1396 search results - page 186 / 280 » Succinct Dynamic Data Structures |
112
click to vote
SPAA
2003
ACM
15 years 6 months ago
2003
ACM
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
134
click to vote
UMUAI
1998
15 years 1 months ago
1998
We present an approach to keyhole plan recognition which uses a dynamic belief (Bayesian) network to represent features of the domain that are needed to identify users’ plans and...
108
click to vote
KDD
2007
ACM
16 years 1 months ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
CHI
2005
ACM
16 years 1 months ago
2005
ACM
Although information visualization (infovis) technologies have proven indispensable tools for making sense of complex data, wide-spread deployment has yet to take hold, as success...
110
click to vote
STOC
2002
ACM
16 years 1 months ago
2002
ACM
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...