Sciweavers

11211 search results - page 7 / 2243
» Rank-Sensitive Data Structures
Sort
View
CIDR
2011
188views Algorithms» more  CIDR 2011»
13 years 1 months ago
Managing Structured Collections of Community Data
Data management is becoming increasingly social. We observe a new form of information in such collaborative scenarios, where users contribute and reuse information, which resides ...
Wolfgang Gatterbauer, Dan Suciu
STACS
2012
Springer
12 years 5 months ago
Linear-Space Data Structures for Range Mode Query in Arrays
A mode of a multiset S is an element a ∈ S of maximum multiplicity; that is, a occurs at least as frequently as any other element in S. Given an array A[1 : n] of n elements, we...
Timothy M. Chan, Stephane Durocher, Kasper Green L...
DATESO
2009
146views Database» more  DATESO 2009»
13 years 7 months ago
Compression of the Stream Array Data Structure
In recent years, many approaches to XML twig pattern query (TPQ) processing have been developed. Some algorithms are supported by a stream abstract data type. s an abstract data ty...
Radim Baca, Martin Pawlas
TGIS
2010
86views more  TGIS 2010»
13 years 4 months ago
A Road Network Selection Process Based on Data Enrichment and Structure Detection
The presented paper deals with a generic process for road network selection based on data enrichment and structure detection. The first step is to detect significant structures and...
Guillaume Touya
PPOPP
2012
ACM
12 years 5 months ago
A methodology for creating fast wait-free data structures
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...
Alex Kogan, Erez Petrank