Sciweavers

199 search results - page 28 / 40
» Combinatorial Constraints on Multiple Projections of a Set o...
Sort
View
COMPGEOM
2010
ACM
13 years 11 months ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...
CVPR
2012
IEEE
11 years 9 months ago
Scale resilient, rotation invariant articulated object matching
A novel method is proposed for matching articulated objects in cluttered videos. The method needs only a single exemplar image of the target object. Instead of using a small set o...
Hao Jiang, Tai-Peng Tian, Kun He, Stan Sclaroff
ICCV
1995
IEEE
13 years 10 months ago
Locating Objects Using the Hausdorff Distance
The Hausdorff distance is a measure defined between two point sets, here representing a model and an image. The Hausdorff distance is reliable even when the image contains multipl...
William Rucklidge
SIAMSC
2008
139views more  SIAMSC 2008»
13 years 6 months ago
Probing the Pareto Frontier for Basis Pursuit Solutions
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
Ewout van den Berg, Michael P. Friedlander
ICTAI
2002
IEEE
13 years 11 months ago
Machine Learning for Software Engineering: Case Studies in Software Reuse
There are many machine learning algorithms currently available. In the 21st century, the problem no longer lies in writing the learner, but in choosing which learners to run on a ...
Justin S. Di Stefano, Tim Menzies