Sciweavers

1258 search results - page 180 / 252
» Architecture-driven Problem Decomposition
Sort
View
ECCV
2008
Springer
14 years 10 months ago
Feature Correspondence Via Graph Matching: Models and Global Optimization
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...
Lorenzo Torresani, Vladimir Kolmogorov, Carsten Ro...
ICPR
2008
IEEE
14 years 10 months ago
SVD based Kalman particle filter for robust visual tracking
Object tracking is one of the most important tasks in computer vision. The unscented particle filter algorithm has been extensively used to tackle this problem and achieved a grea...
Qingdi Wei, Weiming Hu, Xi Li, Xiaoqin Zhang, Yang...
ICML
2007
IEEE
14 years 9 months ago
Robust non-linear dimensionality reduction using successive 1-dimensional Laplacian Eigenmaps
Non-linear dimensionality reduction of noisy data is a challenging problem encountered in a variety of data analysis applications. Recent results in the literature show that spect...
Samuel Gerber, Tolga Tasdizen, Ross T. Whitaker
SODA
2010
ACM
157views Algorithms» more  SODA 2010»
14 years 6 months ago
Testing monotone high-dimensional distributions
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
Ronitt Rubinfeld, Rocco A. Servedio
CP
2007
Springer
14 years 3 months ago
Dynamic Management of Heuristics for Solving Structured CSPs
Abstract. This paper deals with the problem of solving efficiently structured CSPs. It is well known that (hyper)tree-decompositions offer the best approaches from a theoretical v...
Philippe Jégou, Samba Ndiaye, Cyril Terriou...