Sciweavers

1985 search results - page 193 / 397
» A Minimal Periods Algorithm with Applications
Sort
View
JACM
2011
152views more  JACM 2011»
14 years 7 months ago
Robust principal component analysis?
This paper is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a low-rank component and a sparse component. Can we recover each component i...
Emmanuel J. Candès, Xiaodong Li, Yi Ma, Joh...
CVPR
2007
IEEE
16 years 6 months ago
Incorporating On-demand Stereo for Real Time Recognition
A new method for localising and recognising hand poses and objects in real-time is presented. This problem is important in vision-driven applications where it is natural for a use...
Thomas Deselaers, Antonio Criminisi, John M. Winn,...
FOCS
2002
IEEE
15 years 9 months ago
The Partition Technique for Overlays of Envelopes
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
Vladlen Koltun, Micha Sharir
DAM
2007
91views more  DAM 2007»
15 years 4 months ago
Integer linear programming approaches for non-unique probe selection
In addition to their prevalent use for analyzing gene expression, DNA microarrays are an efficient tool for biological, medical, and industrial applications because of their abil...
Gunnar W. Klau, Sven Rahmann, Alexander Schliep, M...
WADS
2005
Springer
95views Algorithms» more  WADS 2005»
15 years 9 months ago
Improved Approximation Bounds for Planar Point Pattern Matching
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
Minkyoung Cho, David M. Mount