7150 search results - page 268 / 1430 » An Approximation Algorithm for Approximation Rank |
169
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Belief Propagation (BP) can be very useful and efficient for performing approximate inference on graphs. But when the graph is very highly connected with strong conflicting intera...
171
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We consider the read/write streams model, an extension of the standard data stream model in which an algorithm can create and manipulate multiple read/write streams in addition to...
151
click to vote
WADS
2007
Springer
16 years 22 days ago
2007
Springer
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
160
click to vote
COMPGEOM
2004
ACM
16 years 2 days ago
2004
ACM
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
157
click to vote
ICIAR
2010
Springer
15 years 11 months ago
2010
Springer
The structural similarity (SSIM) index has been shown to be an useful tool in a wide variety of applications that involve the assessment of image quality and similarity. However, i...