Sciweavers

1272 search results - page 158 / 255
» Approximate Parameterized Matching
Sort
View
WCNC
2008
IEEE
16 years 21 days ago
Computing TCP Throughput in a UMTS Network
— We compute the throughput obtained by a TCP connection in a UMTS environment. For downloading data at a mobile terminal, the packets of each TCP connection are stored in separa...
Kunde Anand, Vinod Sharma
ACCV
2007
Springer
16 years 16 days ago
Learning a Fast Emulator of a Binary Decision Process
Abstract. Computation time is an important performance characteristic of computer vision algorithms. This paper shows how existing (slow) binary-valued decision algorithms can be a...
Jan Sochman, Jiri Matas
FGR
2006
IEEE
217views Biometrics» more  FGR 2006»
16 years 11 days ago
Face Recognition with Image Sets Using Hierarchically Extracted Exemplars from Appearance Manifolds
An unsupervised nonparametric approach is proposed to automatically extract representative face samples (exemplars) from a video sequence or an image set for multipleshot face rec...
Wei Fan, Dit-Yan Yeung
COMPGEOM
2004
ACM
15 years 11 months ago
On the least median square problem
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...
Jeff Erickson, Sariel Har-Peled, David M. Mount
CVPR
1996
IEEE
15 years 10 months ago
Sparse Representations for Image Decomposition with Occlusions
We study the problem of how to detect \interesting objects" appeared in a given image, I. Our approach is to treat it as a function approximation problem based on an over-red...
Michael J. Donahue, Davi Geiger, Tyng-Luh Liu, Rob...