234 search results - page 32 / 47 » Randomized splay trees: Theoretical and experimental results |
115
click to vote
NIPS
2000
15 years 3 months ago
2000
Bayesian networks are graphical representations of probability distributions. In virtually all of the work on learning these networks, the assumption is that we are presented with...
109
click to vote
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
WWW
2006
ACM
16 years 2 months ago
2006
ACM
Expanding a seed set into a larger community is a common procedure in link-based analysis. We show how to adapt recent results from theoretical computer science to expand a seed s...
138
click to vote
TCOS
2010
15 years 5 days ago
2010
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...
99
Voted
ICICS
2003
Springer
15 years 7 months ago
2003
Springer
In this paper, we propose an adaptive collusion attack to a block oriented watermarking scheme [1]. In this attack, traitors conspire to selectively manipulate watermarked blocks t...