1554 search results - page 188 / 311 » Parameterized Complexity and Approximation Algorithms |
144
click to vote
EMMCVPR
2005
Springer
15 years 8 months ago
2005
Springer
This paper addresses the problem of efficient information theoretic, non-parametric data clustering. We develop a procedure for adapting the cluster memberships of the data pattern...
151
click to vote
AMAI
2004
Springer
15 years 8 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
158
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
233
click to vote
COMPGEOM
2011
ACM
14 years 6 months ago
2011
ACM
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
130
Voted
CGF
2008
15 years 3 months ago
2008
Rendering animations of scenes with deformable objects, camera motion, and complex illumination, including indirect lighting and arbitrary shading, is a long-standing challenge. P...