Sciweavers

3 search results - page 1 / 1
» QUIC-SVD: Fast SVD Using Cosine Trees
Sort
View
NIPS
2008
13 years 6 months ago
QUIC-SVD: Fast SVD Using Cosine Trees
The Singular Value Decomposition is a key operation in many machine learning methods. Its computational cost, however, makes it unscalable and impractical for applications involvi...
Michael P. Holmes, Alexander G. Gray, Charles Lee ...
JCP
2006
232views more  JCP 2006»
13 years 4 months ago
Indexing of Motion Capture Data for Efficient and Fast Similarity Search
As motion capture systems are increasingly used for motion tracking and capture, and more and more surveillance cameras are installed for security protection, more and more motion ...
Chuanjun Li, B. Prabhakaran
ICDE
1999
IEEE
209views Database» more  ICDE 1999»
14 years 5 months ago
Efficient Time Series Matching by Wavelets
Time series stored as feature vectors can be indexed by multidimensional index trees like R-Trees for fast retrieval. Due to the dimensionality curse problem, transformations are ...
Kin-pong Chan, Ada Wai-Chee Fu