Sciweavers

3875 search results - page 480 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
ISSAC
2005
Springer
119views Mathematics» more  ISSAC 2005»
16 years 5 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
ECCV
2008
Springer
16 years 8 months ago
Efficiently Learning Random Fields for Stereo Vision with Sparse Message Passing
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
Jerod J. Weinman, Lam Tran, Christopher J. Pal
PAMI
2010
248views more  PAMI 2010»
15 years 5 months ago
Coupled Prediction Classification for Robust Visual Tracking
—This paper addresses the problem of robust template tracking in image sequences. Our work falls within the discriminative framework in which the observations at each frame yield...
Ioannis Patras, Edwin R. Hancock
PVLDB
2010
105views more  PVLDB 2010»
15 years 5 months ago
Destabilizers and Independence of XML Updates
Independence analysis is the problem of determining whether an update affects the result of a query, e.g. a constraint or materialized view. We develop a new, modular framework fo...
Michael Benedikt, James Cheney
BMVC
2010
15 years 4 months ago
Stratified Generalized Procrustes Analysis
This paper deals with generalized procrustes analysis. This is the problem of registering a set of shape data by finding a reference shape and global rigid transformations given p...
Adrien Bartoli, Daniel Pizarro, Marco Loog