Sciweavers

16093 search results - page 3121 / 3219
» On the optimality of the neighbor-joining algorithm
Sort
View
CORR
2006
Springer
138views Education» more  CORR 2006»
13 years 9 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite
CVPR
2009
IEEE
1096views Computer Vision» more  CVPR 2009»
15 years 3 months ago
How far can you get with a modern face recognition test set using only simple features?
In recent years, large databases of natural images have become increasingly popular in the evaluation of face and object recognition algorithms. However, Pinto et al. previously ...
Nicolas Pinto, James J. DiCarlo, David D. Cox
CVPR
2009
IEEE
15 years 1 months ago
Tracking of a Non-Rigid Object via Patch-based Dynamic Appearance Modeling and Adaptive Basin Hopping Monte Carlo Sampling
We propose a novel tracking algorithm for the target of which geometric appearance changes drastically over time. To track it, we present a local patch-based appearance model and p...
Junseok Kwon (Seoul National University), Kyoung M...
IJCV
2008
282views more  IJCV 2008»
15 years 1 months ago
Stereo Matching Using Population-Based MCMC
In this paper, we propose a new stereo matching method using the population-based Markov Chain Monte Carlo (Pop-MCMC), which belongs to the sampling-based methods. Since the previo...
Wonsik Kim (Seoul National University), Joonyoung ...
CVPR
2003
IEEE
14 years 11 months ago
Generalized Principal Component Analysis (GPCA)
This paper presents an algebro-geometric solution to the problem of segmenting an unknown number of subspaces of unknown and varying dimensions from sample data points. We represen...
René Vidal, Shankar Sastry, Yi Ma
« Prev « First page 3121 / 3219 Last » Next »