Sciweavers

1469 search results - page 40 / 294
» Approximate polynomial decomposition
Sort
View
CORR
2010
Springer
190views Education» more  CORR 2010»
14 years 12 months ago
Bidimensionality and EPTAS
Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
JVCIR
2007
96views more  JVCIR 2007»
14 years 11 months ago
Image decomposition combining staircase reduction and texture extraction
This paper proposes a natural and efficient way to achieve staircase reduction in texture extraction models of image processing. Moreover, we propose a precise framework for this ...
Tony F. Chan, Selim Esedoglu, Frederick E. Park
COMGEO
2002
ACM
14 years 11 months ago
Quadtree, ray shooting and approximate minimum weight Steiner triangulation
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...
Siu-Wing Cheng, Kam-Hing Lee
NIPS
2007
15 years 1 months ago
Local Algorithms for Approximate Inference in Minor-Excluded Graphs
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
Kyomin Jung, Devavrat Shah
SIAMJO
2011
14 years 6 months ago
A Unifying Polyhedral Approximation Framework for Convex Optimization
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
Dimitri P. Bertsekas, Huizhen Yu