746 search results - page 117 / 150 » Fast (Structured) Newton Computations |
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
ECCV
2002
Springer
14 years 9 months ago
2002
Springer
Abstract. Stereo matching is an ill-posed problem for at least two principal reasons: (1) because of the random nature of match similarity measure and (2) because of structural amb...
BIRTHDAY
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Many relevant Web mining tasks translate into classical algorithms on the Web graph. Compact Web graph representations allow running these tasks on larger graphs within m...
ISVC
2009
Springer
2009
Springer
Factorization of Correspondence and Camera Error for Unconstrained Dense Correspondence Applications
14 years 2 months ago
Abstract. A correspondence and camera error analysis for dense correspondence applications such as structure from motion is introduced. This provides error introspection, opening u...
HPCC
2007
Springer
14 years 1 months ago
2007
Springer
Packet filters play an essential role in traffic management and security management on the Internet. In order to create software-based packet filters that are fast enough to work...