the proceedings contain 54 papers. the special focus in this conference is on algorithms and datastructures. the topics include: Contact graphs of circular arcs;contact representations of graphs in 3D;minimizing the ...
ISBN:
(纸本)9783319218397
the proceedings contain 54 papers. the special focus in this conference is on algorithms and datastructures. the topics include: Contact graphs of circular arcs;contact representations of graphs in 3D;minimizing the aggregate movements for interval coverage;online bin packing with advice of small size;on the approximability of orthogonal order preserving layout adjustment;an optimal algorithm for plane matchings in multipartite geometric graphs;generation of colourings and distinguishing colourings of graphs;strictly implicit priority queues;on conflict-free multi-coloring;semi-dynamic connectivity in the plane;interval selection in the streaming model;on the bounded-hop range assignment problem;greedy is an almost optimal deque;a new approach for contact graph representations and its applications;dealing with 4-variables by resolution;select with groups of 3 or 4;approximating nearest neighbor distances;linearity is strictly more powerful than contiguity for encoding graphs;on the complexity of an unregulated traffic crossing;finding pairwise intersections inside a query range;cache-oblivious iterated predecessor queries via range coalescing;polylogarithmic fully retroactive priority queues via hierarchical checkpointing;on the minimum eccentricity shortest path problem;convex polygons in geometric triangulations;straight-line drawability of a planar graph plus an edge;solving problems on graphs of high rank-width;the parametric closure problem;rooted cycle bases;on the chain pair simplification problem;finding articulation points of large graphs in linear time;LP-based approximation algorithms for facility location in buy-at-bulk network design.
this book provides a cross-section of cutting-edge research areas being pursued by researchers in spatial data handling and geographic information science (GIS). It presents selected papers on the advancement of spati...
ISBN:
(纸本)9783642445538
this book provides a cross-section of cutting-edge research areas being pursued by researchers in spatial data handling and geographic information science (GIS). It presents selected papers on the advancement of spatial data handling and GIS in digital cartography, geospatial data integration, geospatial database and data infrastructures, geospatial data modeling, GIS for sustainable development, the interoperability of heterogeneous spatial data systems, location-based services, spatial knowledge discovery and data mining, spatial decision support systems, spatial datastructures and algorithms, spatial statistics, spatial data quality and uncertainty, the visualization of spatial data, and web and wireless applications in GIS.
this book constitutes the refereed proceedings of the 14thalgorithms and datastructuressymposium, wads 2015, held in Victoria, BC, Canada, August 2015.;the 54 revised full papers presented in this volume were caref...
详细信息
ISBN:
(数字)9783319218403
ISBN:
(纸本)9783319218397
this book constitutes the refereed proceedings of the 14thalgorithms and datastructuressymposium, wads 2015, held in Victoria, BC, Canada, August 2015.;the 54 revised full papers presented in this volume were carefully reviewed and selected from 148 submissions.;the algorithms and datastructuressymposium - wads (formerly Workshop on algorithms And datastructures), which alternates withthe Scandinavian Workshop on Algorithm theory, is intended as a forum for researchers in the area of design and analysis of algorithms and datastructures. wads includes papers presenting original research on algorithms and datastructures in all areas, including bioinformatics, combinatorics, computational geometry, databases, graphics, and parallel and distributed computing.
With multicores being ubiquitous, concurrent datastructures are becoming increasingly important. this paper proposes a novel approach to concurrent data structure design where the data structure collects statistics a...
详细信息
ISBN:
(纸本)9781467371483
With multicores being ubiquitous, concurrent datastructures are becoming increasingly important. this paper proposes a novel approach to concurrent data structure design where the data structure collects statistics about contention and adapts dynamically according to this statistics. We use this approach to create a contention adapting binary search tree (CA tree) that can be used to implement concurrent ordered sets and maps. Our experimental evaluation shows that CA trees scale similar to recently proposed algorithms on a big multicore machine on various scenarios with a larger set size, and outperform the same datastructures in more contended scenarios and in sequential performance. We also show that CA trees are well suited for optimization with hardware lock elision. In short, we propose a practically useful and easy to implement and show correct concurrent search tree that naturally adapts to the level of contention.
the emerging storage systems for Cloud Computing are so-called NoSQL databases. these systems lack the join mechanism and declarative queries approach but show high scalability and performance. While most famous ICT c...
详细信息
ISBN:
(纸本)9780769549347;9781467350266
the emerging storage systems for Cloud Computing are so-called NoSQL databases. these systems lack the join mechanism and declarative queries approach but show high scalability and performance. While most famous ICT companies have no doubts about the usage of NoSQL, there is still a lack of methodologies and mechanisms to support the design and management of a NoSQL database starting from a complex high level data schema. the final goal of our work is to equip NoSQL databases with programming abstractions that make them close to the expressiveness of RDBMS, still maintaining their significant advantages in terms of scalability. In this paper we discuss the main shortcomings of using a NoSQL approach and we show how we plan to overcome them.
In this paper we develop an optimal cache-oblivious data structure that solves the iterated predecessor problem. Given k static sorted lists L1, L2,..., Lk of average length n and a query value q, the iterated predece...
详细信息
Generative Learning Objects are reusable educational templates to be filled with learning content. Currently, they are used only in experimental environments and not on a large scale like multiple-choice questions. On...
详细信息
ISBN:
(纸本)9781728189215
Generative Learning Objects are reusable educational templates to be filled with learning content. Currently, they are used only in experimental environments and not on a large scale like multiple-choice questions. One reason for this drawback is the complexity of meta-models that teachers should imagine and write. In this sense, several example instances are provided and we selected the linked list concept taught in the context of datastructures and algorithms discipline. We outline several use cases of the linked lists and their corresponding models.
暂无评论