1396 search results - page 60 / 280 » Succinct Dynamic Data Structures |
111
click to vote
ICANN
2010
Springer
14 years 12 months ago
2010
Springer
In this paper, we present a system capable of dynamically learning shapes in a way that also allows for the dynamic deletion of shapes already learned. It uses a self-balancing Bin...
133
click to vote
PLDI
2012
ACM
13 years 3 months ago
2012
ACM
Automatic parallelization is a promising strategy to improve application performance in the multicore era. However, common programming practices such as the reuse of data structur...
116
click to vote
KDD
2009
ACM
15 years 6 months ago
2009
ACM
Graphs or networks can be used to model complex systems. Detecting community structures from large network data is a classic and challenging task. In this paper, we propose a nove...
102
click to vote
ICML
2005
IEEE
16 years 2 months ago
2005
IEEE
In many domains, a Bayesian network's topological structure is not known a priori and must be inferred from data. This requires a scoring function to measure how well a propo...
110
click to vote
EDBT
2009
ACM
15 years 6 months ago
2009
ACM
In this paper, we propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem. Compared to the limitations of existing methods for the RkNN searc...