138 search results - page 13 / 28 » Lower Bounds for Succinct Data Structures |
121
Voted
CPM
1999
Springer
15 years 7 months 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...
155
Voted
INFOCOM
2011
IEEE
14 years 7 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...
138
Voted
INFOCOM
2012
IEEE
13 years 6 months ago
2012
IEEE
—We study error estimating codes with the goal of establishing better bounds for the theoretical and empirical overhead of such schemes. We explore the idea of using sketch data ...
121
Voted
VLDB
1997
ACM
15 years 7 months 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...
144
Voted
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
—A fundamental challenge of managing mutable data replication in a Peer-to-Peer (P2P) system is how to efficiently maintain consistency under various sharing patterns with heter...