220 search results - page 29 / 44 » The Forgiving Tree: A Self-Healing Distributed Data Structur... |
153
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
ERLANG
2003
ACM
15 years 3 months ago
2003
ACM
The viability of implementing an in-memory database, Erlang ETS, using a relatively-new data structure, called a Judy array, was studied by comparing the performance of ETS tables...
KDD
2004
ACM
15 years 10 months ago
2004
ACM
This paper proposes a data mining approach to modeling relationships among categories in image collection. In our approach, with image feature grouping, a visual dictionary is cre...
ADC
2003
Springer
15 years 3 months ago
2003
Springer
Minkowski-sum cost model indicates that balanced data partitioning is not beneficial for high dimensional data. Thus we study several unbalanced partitioning methods and propose ...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...