1332 search results - page 251 / 267 » Combinatorial Algorithms |
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
103
click to vote
COLOGNETWENTE
2008
15 years 1 months ago
2008
We consider combinatorial optimization problems arising in radiation therapy. Given a matrix I with non-negative integer entries, we seek for a decomposition of I as a weighted su...
102
click to vote
SODA
2008
ACM
15 years 1 months ago
2008
ACM
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
NIPS
2004
15 years 1 months ago
2004
In many applications, good ranking is a highly desirable performance for a classifier. The criterion commonly used to measure the ranking quality of a classification algorithm is ...
106
click to vote
SMA
2010
ACM
14 years 12 months ago
2010
ACM
We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3 , where one of the polytopes keeps rotating. The algorithm is based on pre-...