3874 search results - page 302 / 775 » Approximation Algorithms for k-hurdle Problems |
237
click to vote
ICDE
2008
IEEE
16 years 6 months ago
2008
IEEE
Subspace clustering has attracted great attention due to its capability of finding salient patterns in high dimensional data. Order preserving subspace clusters have been proven to...
133
click to vote
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...
153
click to vote
FOCS
2000
IEEE
15 years 9 months ago
2000
IEEE
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, wi...
174
click to vote
STOC
2007
ACM
16 years 5 months ago
2007
ACM
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
130
Voted
GLOBECOM
2006
IEEE
15 years 11 months ago
2006
IEEE
— We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize ...