7129 search results - page 520 / 1426 » Approximation Algorithms for Treewidth |
209
click to vote
CP
2004
Springer
16 years 13 days 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...
168
click to vote
SWAT
2004
Springer
16 years 12 days ago
2004
Springer
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
292
click to vote
VISUALIZATION
2002
IEEE
15 years 12 months ago
2002
IEEE
In this paper we introduce, analyze and quantitatively compare a number of surface simplification methods for point-sampled geometry. We have implemented incremental and hierarchi...
186
click to vote
ICALP
2010
Springer
15 years 12 months ago
2010
Springer
Abstract. We consider the clustering with diversity problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least point...
214
Voted
UAI
2008
15 years 8 months ago
2008
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. As an extension of Welling and ...