Sciweavers

78 search results - page 3 / 16
» Large Equiangular Sets of Lines in Euclidean Space
Sort
View
ECCV
2010
Springer
13 years 10 months ago
Fast Approximate Nearest Neighbor Methods for Non-Euclidean Manifolds with Applications to Human Activity Analysis in Videos
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
Rizwan Chaudhry, Yuri Ivanov
ESA
2009
Springer
144views Algorithms» more  ESA 2009»
14 years 4 days ago
Narrow-Shallow-Low-Light Trees with and without Steiner Points
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
Michael Elkin, Shay Solomon
SIGMOD
2001
ACM
184views Database» more  SIGMOD 2001»
14 years 5 months ago
Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
Eamonn J. Keogh, Kaushik Chakrabarti, Sharad Mehro...
CVPR
2010
IEEE
13 years 11 months ago
One-Shot Multi-Set Non-rigid Feature-Spatial Matching
We introduce a novel framework for nonrigid feature matching among multiple sets in a way that takes into consideration both the feature descriptor and the features spatial arra...
Marwan Torki and Ahmed Elgammal
ECCV
2002
Springer
14 years 7 months ago
Properties of the Catadioptric Fundamental Matrix
The geometry of two uncalibrated views obtained with a parabolic catadioptric device is the subject of this paper. We introduce the notion of circle space, a natural representation...
Christopher Geyer, Konstantinos Daniilidis