736 search results - page 99 / 148 » A dynamic data structure for approximate range searching |
169
Voted
CCCG
1998
15 years 4 months ago
1998
Molecular surface computations are often necessary in order to perform synthetic drug design. A critical step in this process is the computation and update of an exact boundary re...
120
click to vote
DATE
2002
IEEE
15 years 8 months ago
2002
IEEE
Microprocessors are today getting more and more inefficient for a growing range of applications. Its principles -The Von Neumann paradigm[3]- based on the sequential execution of ...
206
Voted
SIGMOD
2007
ACM
16 years 3 months ago
2007
ACM
This paper proposes a demo of the TopX search engine, an extensive framework for unified indexing, querying, and ranking of large collections of unstructured, semistructured, and ...
111
Voted
ICDE
2005
IEEE
15 years 9 months ago
2005
IEEE
Structured P2P systems in the form of distributed hash tables (DHT) are a promising approach for building massively distributed data management platforms. However, for many applic...
132
Voted
ICRA
2003
IEEE
15 years 8 months ago
2003
IEEE
In this paper we present a dynamic data structure, useful for robot navigation in an unknown, simplyconnected planar environment. The guiding philosophy in this work is to avoid t...