500 search results - page 34 / 100 » Approximation algorithms for maximum independent set of pseu... |
132
click to vote
ALGORITHMICA
2006
15 years 1 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
104
click to vote
ICRA
2010
IEEE
15 years 8 days ago
2010
IEEE
We present an efficient algorithm for solving the ray-shooting problem on high dimensional sets. Our algorithm computes the intersection of the boundary of a compact convex set w...
COLT
1993
Springer
15 years 5 months ago
1993
Springer
We introduce a new formal model in which a learning algorithm must combine a collection of potentially poor but statistically independent hypothesis functions in order to approxima...
116
click to vote
TIP
2008
15 years 1 months ago
2008
Density estimation for observational data plays an integral role in a broad spectrum of applications, e.g. statistical data analysis and information-theoretic image registration. ...
100
Voted
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...