376 search results - page 56 / 76 » Betweenness Centrality : Algorithms and Lower Bounds |
160
click to vote
ECCC
2011
15 years 1 months ago
2011
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
198
click to vote
NEUROSCIENCE
2001
Springer
15 years 10 months ago
2001
Springer
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...
157
click to vote
ESA
2009
Springer
16 years 17 days ago
2009
Springer
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
169
click to vote
SODA
2000
ACM
15 years 7 months ago
2000
ACM
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
174
click to vote
COLT
1999
Springer
15 years 10 months ago
1999
Springer
We focus on methods to solve multiclass learning problems by using only simple and efficient binary learners. We investigate the approach of Dietterich and Bakiri [2] based on er...