138 search results - page 14 / 28 » Bit-probe lower bounds for succinct data structures |
FOCS
2008
IEEE
13 years 8 months ago
2008
IEEE
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...
CPM
1999
Springer
14 years 6 days ago
1999
Springer
This paper examines some of the rich structure of the syntenic distance model of evolutionary distance, introduced by Ferretti et al. (1996). The syntenic distance between two gen...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
TSP
2010
13 years 2 months ago
2010
We consider distributed estimation of a deterministic vector parameter from noisy sensor observations in a wireless sensor network (WSN). The observation noise is assumed uncorrela...
VLDB
1997
ACM
14 years 1 days ago
1997
ACM
Abstract: Recently there has been an increasing interest in supporting bulk operations on multidimensional index structures. Bulk loading refers to the process of creating an initi...