Sciweavers

1021 search results - page 51 / 205
» Fast Approximate PCPs
Sort
View
IDA
1998
Springer
15 years 1 months ago
Fast Dimensionality Reduction and Simple PCA
A fast and simple algorithm for approximately calculating the principal components (PCs) of a data set and so reducing its dimensionality is described. This Simple Principal Compo...
Matthew Partridge, Rafael A. Calvo
TNN
1998
89views more  TNN 1998»
15 years 1 months ago
Fast training of recurrent networks based on the EM algorithm
— In this work, a probabilistic model is established for recurrent networks. The EM (expectation-maximization) algorithm is then applied to derive a new fast training algorithm f...
Sheng Ma, Chuanyi Ji
COMPGEOM
2001
ACM
15 years 5 months ago
A practical approach for computing the diameter of a point set
We present an approximation algorithm for computing the diameter of a point-set in d-dimensions. The new algorithm is sensitive to the "hardness" of computing the diamet...
Sariel Har-Peled
CIVR
2009
Springer
132views Image Analysis» more  CIVR 2009»
15 years 8 months ago
Real-time bag of words, approximately
We start from the state-of-the-art Bag of Words pipeline that in the 2008 benchmarks of TRECvid and PASCAL yielded the best performance scores. We have contributed to that pipelin...
Jasper R. R. Uijlings, Arnold W. M. Smeulders, Rem...
ICMCS
2006
IEEE
113views Multimedia» more  ICMCS 2006»
15 years 8 months ago
Fast Multi-Reference Frame Motion Estimation via Downhill Simplex Search
Multi-reference frame motion estimation improves the accuracy of motion compensation in video compression, but it also dramatically increases computational complexity. Based on tr...
Chen-Kuo Chiang, Shang-Hong Lai