5595 search results - page 702 / 1119 » Approximation Algorithms for Clustering Problems |
191
Voted
ALT
2008
Springer
16 years 3 months ago
2008
Springer
We propose a new boosting algorithm for bipartite ranking problems. Our boosting algorithm, called SoftRankBoost, is a modification of RankBoost which maintains only smooth distri...
131
Voted
ICCAD
2003
IEEE
16 years 3 months ago
2003
IEEE
— In this paper we consider the problem of finding a smaller RLCM circuit that approximately replicates the behavior (up to a certain frequency) of a given RLCM circuit. Targeted...
178
click to vote
ISAAC
2007
Springer
16 years 1 months ago
2007
Springer
Trajectory data is becoming increasingly available and the size of the trajectories is getting larger. In this paper we study the problem of compressing spatio-temporal trajectorie...
177
click to vote
FOCS
2006
IEEE
16 years 28 days ago
2006
IEEE
In this paper we present a new approximation algorithm for Unique Games. For a Unique Game with n vertices and k states (labels), if a (1 − ε) fraction of all constraints is sa...
138
click to vote
GLOBECOM
2006
IEEE
16 years 28 days ago
2006
IEEE
Abstract— In this paper, we propose a power optimal opportunistic scheduling scheme for a multiuser single hop Time Division Multiple Access (TDMA) system. We formulate the probl...