11211 search results - page 195 / 2243 » Rank-Sensitive Data Structures |
104
click to vote
SAC
2002
ACM
15 years 2 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
153
click to vote
TON
2010
14 years 9 months ago
2010
This paper presents Interleaved Stratified Timer Wheels as a novel priority queue data structure for traffic shaping and scheduling in packet-switched networks. The data structure ...
186
click to vote
CORR
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
130
click to vote
CIDR
2003
15 years 4 months ago
2003
It has frequently been observed that most of the world’s data lies outside database systems. The reason is that database systems focus on structured data, leaving the unstructur...
118
click to vote
WETICE
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract—DHT systems are structured overlay networks capable of using P2P resources as a scalable platform for very large data storage applications. However, their efficiency ex...