Sciweavers

1396 search results - page 41 / 280
» Succinct Dynamic Data Structures
Sort
View
SCCC
2003
IEEE
15 years 6 months ago
Improved Deletions in Dynamic Spatial Approximation Trees
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alte...
Gonzalo Navarro, Nora Reyes
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
16 years 1 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
15 years 2 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein
IDA
2003
Springer
15 years 6 months ago
Learning Dynamic Bayesian Networks from Multivariate Time Series with Changing Dependencies
Abstract. Many examples exist of multivariate time series where dependencies between variables change over time. If these changing dependencies are not taken into account, any mode...
Allan Tucker, Xiaohui Liu
DBPL
2003
Springer
109views Database» more  DBPL 2003»
15 years 6 months ago
Modelling Dynamic Web Data
We introduce the Xdπ calculus, a peer-to-peer model for reasoning about dynamic web data. Web data is not just stored statically. Rather it is referenced indirectly, for example ...
Philippa Gardner, Sergio Maffeis