138 search results - page 17 / 28 » Lower Bounds for Succinct Data Structures |
114
Voted
PKDD
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Partially ordered feature sets appear naturally in many classification settings with structured input instances, for example, when the data instances are graphs and a fe...
211
Voted
COMPGEOM
2011
ACM
14 years 7 months ago
2011
ACM
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
147
Voted
MSV
2004
15 years 5 months ago
2004
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
121
Voted
ICDT
2001
ACM
15 years 8 months ago
2001
ACM
XML data is often used (validated, stored, queried, etc) with respect to di erent types. Understanding the relationship between these types can provide important information for ma...
125
Voted
ACL
2007
15 years 5 months ago
2007
A Bloom filter (BF) is a randomised data structure for set membership queries. Its space requirements are significantly below lossless information-theoretic lower bounds but it ...