198 search results - page 24 / 40 » A Framework for Dynamizing Succinct Data Structures |
VLDB
2004
ACM
15 years 2 months ago
2004
ACM
Cost-based XML query optimization calls for accurate estimation of the selectivity of path expressions. Some other interactive and internet applications can also benefit from suc...
118
click to vote
KDD
2007
ACM
15 years 10 months ago
2007
ACM
Existing data-stream clustering algorithms such as CluStream are based on k-means. These clustering algorithms are incompetent to find clusters of arbitrary shapes and cannot hand...
SSD
2001
Springer
15 years 1 months ago
2001
Springer
The design of external index structures for one- and multidimensional extended objects is a long and well studied subject in basic database research. Today, more and more commercia...
CIKM
2006
Springer
14 years 11 months ago
2006
Springer
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...