172 search results - page 14 / 35 » Improved approximation for directed cut problems |
138
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
148
Voted
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
164
Voted
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
152
click to vote
ICCV
2005
IEEE
15 years 9 months ago
2005
IEEE
This paper presents an efficient algorithm for image segmentation and a framework for perceptual grouping. It makes an attempt to provide one way of combining bottomup and top-do...
134
click to vote
NIPS
2008
15 years 5 months ago
2008
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...