4850 search results - page 220 / 970 » Approximate Data Structures with Applications |
166
click to vote
DIALM
2003
ACM
15 years 11 months ago
2003
ACM
A common way of storing spatio-temporal information about mobile devices is in the form of a 3D (2D geography + time) trajectory. We argue that when cellular phones and Personal D...
153
click to vote
ESA
2000
Springer
15 years 10 months ago
2000
Springer
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
212
Voted
IJCSA
2008
15 years 6 months ago
2008
It is well known that transactional and analytical systems each require different database architecture. In general, the database structure of transactional systems is optimized f...
183
click to vote
COMPGEOM
1994
ACM
15 years 10 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
175
Voted
NIPS
2008
15 years 7 months ago
2008
We present a sparse approximation approach for dependent output Gaussian processes (GP). Employing a latent function framework, we apply the convolution process formalism to estab...