138 search results - page 18 / 28 » Bit-probe lower bounds for succinct data structures |
STOC
2006
ACM
14 years 1 months ago
2006
ACM
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
PKDD
2009
Springer
14 years 2 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...
COMPGEOM
2011
ACM
12 years 11 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...
ICDT
2001
ACM
14 years 11 days 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...
MSV
2004
13 years 9 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...