Sciweavers

52 search results - page 7 / 11
» Effective Dispersion in Computable Metric Spaces
Sort
View
SIAMCOMP
2008
72views more  SIAMCOMP 2008»
13 years 9 months ago
Plottable Real Number Functions and the Computable Graph Theorem
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
Vasco Brattka
CVPR
2007
IEEE
14 years 11 months ago
Segmenting Images on the Tensor Manifold
In this note, we propose a method to perform segmentation on the tensor manifold, that is, the space of positive definite matrices of given dimension. In this work, we explicitly ...
Yogesh Rathi, Allen Tannenbaum, Oleg V. Michailovi...
ICPR
2010
IEEE
13 years 10 months ago
A Constant Average Time Algorithm to Allow Insertions in the LAESA Fast Nearest Neighbour Search Index
Abstract—Nearest Neighbour search is a widely used technique in Pattern Recognition. In order to speed up the search many indexing techniques have been proposed. However, most of...
Luisa Micó, José Oncina
CVPR
2007
IEEE
14 years 11 months ago
Linear Laplacian Discrimination for Feature Extraction
Discriminant feature extraction plays a fundamental role in pattern recognition. In this paper, we propose the Linear Laplacian Discrimination (LLD) algorithm for discriminant fea...
Deli Zhao, Zhouchen Lin, Rong Xiao, Xiaoou Tang
ACCV
1995
Springer
14 years 1 months ago
An Integrated Model for Evaluating the Amount of Data Required for Reliable Recognition
—Many recognition procedures rely on the consistency of a subset of data features with a hypothesis as the sufficient evidence to the presence of the corresponding object. We ana...
Michael Lindenbaum