114 search results - page 13 / 23 » Dynamic Spatial Approximation Trees for Massive Data |
113
click to vote
VLDB
2001
ACM
15 years 7 months ago
2001
ACM
Similarity retrieval mechanisms should utilize generalized quadratic form distance functions as well as the Euclidean distance function since ellipsoid queries parameters may vary...
121
Voted
SPAA
2006
ACM
15 years 8 months ago
2006
ACM
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
123
Voted
STDBM
2004
Springer
15 years 8 months ago
2004
Springer
This paper introduces the Dynamic Cascade Tree (DCT), a structure designed to index query regions on multi-dimensional data streams. The DCT is designed for a stream management sy...
121
Voted
BMCBI
2011
14 years 6 months ago
2011
Background: Chromatin immunoprecipitation (ChIP), coupled with massively parallel short-read sequencing (seq) is used to probe chromatin dynamics. Although there are many algorith...
212
Voted
VLDB
2008
ACM
16 years 2 months ago
2008
ACM
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...