Sciweavers

1272 search results - page 129 / 255
» Approximate Parameterized Matching
Sort
View
172
Voted
TIFS
2008
157views more  TIFS 2008»
15 years 3 months ago
Subspace Approximation of Face Recognition Algorithms: An Empirical Study
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
Pranab Mohanty, Sudeep Sarkar, Rangachar Kasturi, ...
136
Voted
GLOBECOM
2006
IEEE
15 years 9 months ago
Efficient Approximations for Call Admission Control Performance Evaluations in Multi-Service Networks
—Several dynamic call admission control (CAC) schemes for cellular networks have been proposed in the literature to reserve resources adaptively to provide the desired quality of...
Emre A. Yavuz, Victor C. M. Leung
139
Voted
IJCV
2006
145views more  IJCV 2006»
15 years 3 months ago
Simultaneous Object Recognition and Segmentation from Single or Multiple Model Views
We present a novel Object Recognition approach based on affine invariant regions. It actively counters the problems related to the limited repeatability of the region detectors, an...
Vittorio Ferrari, Tinne Tuytelaars, Luc J. Van Goo...
166
Voted
STRINGOLOGY
2004
15 years 5 months ago
BDD-Based Analysis of Gapped q-Gram Filters
Recently, there has been a surge of interest in gapped q-gram filters for approximate string matching. Important design parameters for filters are for example the value of q, the f...
Marc Fontaine, Stefan Burkhardt, Juha Kärkk&a...
114
Voted
ECCV
2002
Springer
16 years 5 months ago
Shock-Based Indexing into Large Shape Databases
This paper examines issues arising in applying a previously developed edit-distance shock graph matching technique to indexing into large shape databases. This approach compares th...
Thomas B. Sebastian, Philip N. Klein, Benjamin B. ...