1963 search results - page 268 / 393 » The Maximum Solution Problem on Graphs |
94
Voted
FSTTCS
2001
Springer
15 years 5 months ago
2001
Springer
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
101
Voted
ICCV
1999
IEEE
15 years 5 months ago
1999
IEEE
We describe a learning-based method for low-level vision problems--estimating scenes from images. We generate a synthetic world of scenes and their corresponding rendered images, m...
127
Voted
ACID
2006
15 years 2 months ago
2006
We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practic...
UAI
2004
15 years 2 months ago
2004
Maximum a Posteriori assignment (MAP) is the problem of finding the most probable instantiation of a set of variables given the partial evidence on the other variables in a Bayesi...
ALGORITHMICA
2002
15 years 16 days ago
2002
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...