2434 search results - page 128 / 487 » Algorithmic Randomness of Closed Sets |
144
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
125
Voted
EUROPAR
2003
Springer
15 years 8 months ago
2003
Springer
In this paper we propose a new parallel clustering algorithm based on the incremental construction of the compact sets of a collection of objects. This parallel algorithm is portab...
151
Voted
CVPR
2011
IEEE
14 years 7 months ago
2011
IEEE
A new family of boosting algorithms, denoted TaylorBoost, is proposed. It supports any combination of loss function and first or second order optimization, and includes classical...
119
click to vote
INFOCOM
1991
IEEE
15 years 7 months ago
1991
IEEE
We have designed and implemented three multicast path finding algorithms for networks with directed links: an optimal algorithm based on the dynamic programming technique, a heuri...
93
Voted
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
— Many scheduling algorithms search the space of possible solutions (schedules), but some instead search the space of permutations of the set of jobs, employing a greedy algorith...