1396 search results - page 113 / 280 » Succinct Dynamic Data Structures |
155
click to vote
PAMI
2012
13 years 3 months ago
2012
—This paper is concerned with the representation and recognition of the observed dynamics (i.e., excluding purely spatial appearance cues) of spacetime texture based on a spatiot...
129
click to vote
VLDB
2004
ACM
15 years 6 months ago
2004
ACM
Cost-based XML query optimization calls for accurate estimation of the selectivity of path expressions. Some other interactive and internet applications can also benefit from suc...
143
click to vote
IPPS
1999
IEEE
15 years 5 months ago
1999
IEEE
In order to extract high levels of performance from modern parallel architectures, the effective management of deep memory hierarchies is very important. While architectural advan...
132
click to vote
HYBRID
2010
Springer
15 years 6 months ago
2010
Springer
This paper addresses the problem of self localization of mobile devices. In particular, each device combines noisy measurements of its absolute position with distance measurements...
129
click to vote
TKDE
2010
14 years 12 months ago
2010
—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter a...