Sciweavers

186 search results - page 7 / 38
» Tractability of Theory Patching
Sort
View
112
Voted
CVPR
2007
IEEE
16 years 2 months ago
Fast Keypoint Recognition in Ten Lines of Code
While feature point recognition is a key component of modern approaches to object detection, existing approaches require computationally expensive patch preprocessing to handle pe...
Mustafa Özuysal, Pascal Fua, Vincent Lepetit
96
Voted
NIPS
2004
15 years 1 months ago
The power of feature clustering: An application to object detection
We give a fast rejection scheme that is based on image segments and demonstrate it on the canonical example of face detection. However, instead of focusing on the detection step w...
Shai Avidan, Moshe Butman
CP
2006
Springer
15 years 4 months ago
The Theory of Grammar Constraints
Abstract. By introducing the Regular Membership Constraint, Gilles Pesant pioneered the idea of basing constraints on formal languages. The paper presented here is highly motivated...
Meinolf Sellmann
91
Voted
CVIU
2008
95views more  CVIU 2008»
15 years 13 days ago
The visual hull of piecewise smooth objects
The visual hull relates the shape of an object to its silhouettes. This paper develops the theory of the visual hull of piecewise smooth objects, as those used in CAD applications...
Andrea Bottino, Aldo Laurentini
ALGORITHMICA
2006
77views more  ALGORITHMICA 2006»
15 years 12 days ago
Scalable Parallel Algorithms for FPT Problems
Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems o...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...