Sciweavers

7006 search results - page 636 / 1402
» Approximation Algorithms
Sort
View
ISSAC
2005
Springer
119views Mathematics» more  ISSAC 2005»
16 years 29 days ago
Computing the multiplicity structure in solving polynomial systems
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
Barry H. Dayton, Zhonggang Zeng
ICIP
2008
IEEE
16 years 9 months ago
Conditional iterative decoding of Two Dimensional Hidden Markov Models
Two Dimensional Hidden Markov Models (2D-HMMs) provide substantial benefits for many computer vision and image analysis applications. Many fundamental image analysis problems, inc...
Mehmet Emre Sargin, Alphan Altinok, Kenneth Rose, ...
ESA
2009
Springer
90views Algorithms» more  ESA 2009»
16 years 2 months ago
Storing a Compressed Function with Constant Time Access
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
Jóhannes B. Hreinsson, Morten Krøyer...
CVPR
2007
IEEE
16 years 9 months ago
Stereo Matching via Disparity Estimation and Surface Modeling
Two new techniques are proposed to improve stereo matching performance in this work. First, to address the disparity discontinuity problem in occluded regions, we present a dispar...
Jong Dae Oh, Siwei Ma, C. C. Jay Kuo
SPIN
2004
Springer
16 years 25 days ago
Minimization of Counterexamples in SPIN
We propose an algorithm to find a counterexample to some property in a finite state program. This algorithm is derived from SPIN’s one, but it finds a counterexample faster th...
Paul Gastin, Pierre Moro, Marc Zeitoun