Sciweavers

796 search results - page 62 / 160
» Approximating the centroid is hard
Sort
View
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
14 years 8 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
SISAP
2008
IEEE
175views Data Mining» more  SISAP 2008»
14 years 2 months ago
Anytime K-Nearest Neighbor Search for Database Applications
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
Weijia Xu, Daniel P. Miranker, Rui Mao, Smriti R. ...
TASLP
2008
131views more  TASLP 2008»
13 years 7 months ago
A Noise-Robust FFT-Based Auditory Spectrum With Application in Audio Classification
In this paper, we investigate the noise robustness of Wang and Shamma's early auditory (EA) model for the calculation of an auditory spectrum in audio classification applicati...
Wei Chu, B. Champagne
TVCG
2008
192views more  TVCG 2008»
13 years 7 months ago
Anisotropic Noise Samples
We present a practical approach to generate stochastic anisotropic samples with Poisson-disk characteristic over a two-dimensional domain. In contrast to isotropic samples, we unde...
Louis Feng, Ingrid Hotz, Bernd Hamann, Kenneth I. ...
TASLP
2010
157views more  TASLP 2010»
13 years 2 months ago
HMM-Based Reconstruction of Unreliable Spectrographic Data for Noise Robust Speech Recognition
This paper presents a framework for efficient HMM-based estimation of unreliable spectrographic speech data. It discusses the role of Hidden Markov Models (HMMs) during minimum mea...
Bengt J. Borgstrom, Abeer Alwan