184 search results - page 9 / 37 » Cache-oblivious data structures for orthogonal range searchi... |
117
click to vote
ISAAC
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
WWW
2009
ACM
16 years 10 days ago
2009
ACM
Web search engines often federate many user queries to relevant structured databases. For example, a product related query might be federated to a product database containing thei...
103
click to vote
PERCOM
2007
ACM
15 years 11 months ago
2007
ACM
Abstract. A major challenge in pervasive computing is to learn activity patterns, such as bathing and cleaning from sensor data. Typical sensor deployments generate sparse datasets...
SPAA
1990
ACM
15 years 3 months ago
1990
ACM
Fractional cascading is a technique designed to allow e cient sequential search in a graph with catalogs of total size n. The search consists of locating a key in the catalogs alo...
ANCS
2009
ACM
14 years 9 months ago
2009
ACM
In this paper we introduce the Range Trie, a new multiway tree data structure for address lookup. Each Range Trie node maps to an address range [Na, Nb) and performs multiple comp...