Sciweavers

483 search results - page 78 / 97
» Linear Ranking with Reachability
Sort
View
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
12 years 7 months ago
Noisy Interpolation of Sparse Polynomials, and Applications
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
Shubhangi Saraf, Sergey Yekhanin
CVPR
2007
IEEE
14 years 9 months ago
Progressive Finite Newton Approach To Real-time Nonrigid Surface Detection
Detecting nonrigid surfaces is an interesting research problem for computer vision and image analysis. One important challenge of nonrigid surface detection is how to register a n...
Jianke Zhu, Michael R. Lyu
CVPR
2008
IEEE
14 years 9 months ago
Motion segmentation via robust subspace separation in the presence of outlying, incomplete, or corrupted trajectories
We examine the problem of segmenting tracked feature point trajectories of multiple moving objects in an image sequence. Using the affine camera model, this motion segmentation pr...
René Vidal, Roberto Tron, Shankar Rao, Yi M...
ECCV
2006
Springer
14 years 9 months ago
Optimal Multi-frame Correspondence with Assignment Tensors
Abstract. Establishing correspondence between features of a set of images has been a long-standing issue amongst the computer vision community. We propose a method that solves the ...
R. Oliveira, R. Ferreira, J. P. Costeira
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
14 years 5 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu