376 search results - page 64 / 76 » Betweenness Centrality : Algorithms and Lower Bounds |
SPAA
2010
ACM
14 years 14 days ago
2010
ACM
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
ASIAN
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
WWW
2006
ACM
14 years 8 months ago
2006
ACM
An important issue arising from Peer-to-Peer applications is how to accurately and efficiently retrieve a set of K best matching data objects from different sources while minimizi...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
SIGGRAPH
2010
ACM
13 years 11 months ago
2010
ACM
Achieving interactive performance in cloth animation has significant implications in computer games and other interactive graphics applications. Although much progress has been m...