2880 search results - page 315 / 576 » Approximate Range Searching |
143
click to vote
ALGORITHMICA
1998
15 years 3 months ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
140
click to vote
ECCV
2006
Springer
16 years 5 months ago
2006
Springer
Efficient direct solutions for the determination of a cylinder from points are presented. The solutions range from the well known direct solution of a quadric to the minimal soluti...
244
click to vote
ICDE
2009
IEEE
16 years 5 months ago
2009
IEEE
Immortal DB is a transaction time database system that is built into a commercial database system rather than being layered on top. This enables it to have performance that is very...
132
click to vote
PODS
2006
ACM
16 years 3 months ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
116
Voted
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
—We study the problem of data-driven routing and navigation in a distributed sensor network over a continuous scalar field. Specifically, we address the problem of searching fo...