172 search results - page 13 / 35 » Improved approximation for directed cut problems |
132
Voted
DAM
2007
15 years 3 months ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
154
click to vote
FOCS
1995
IEEE
15 years 7 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
136
click to vote
ICARCV
2006
IEEE
15 years 10 months ago
2006
IEEE
— Many problems in computer vision such as pose recovery and structure estimation are formulated as a minimization process. These problems vary in the use of image measurements d...
128
click to vote
CONIELECOMP
2005
IEEE
15 years 9 months ago
2005
IEEE
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
158
click to vote
JCP
2007
15 years 3 months ago
2007
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...