3874 search results - page 332 / 775 » Approximation Algorithms for k-hurdle Problems |
158
click to vote
CP
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
185
click to vote
FOGA
2011
14 years 8 months ago
2011
It was recently proven that sets of points maximizing the hypervolume indicator do not give a good multiplicative approximation of the Pareto front. We introduce a new “logarith...
125
Voted
APPROX
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We study the problem embedding an n-point metric space into another n-point metric space while minimizing distortion. We show that there is no polynomial time algorithm t...
152
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
This paper surveys recent work in applying ideas from graphical models and message passing algorithms to solve large scale regularized regression problems. In particular, the focu...
178
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...