315 search results - page 31 / 63 » Algebraic Lower Bounds for Computing on Encrypted Data |
103
Voted
SDM
2010
SIAM
15 years 2 months ago
2010
SIAM
The k-means algorithm is widely used for clustering, compressing, and summarizing vector data. In this paper, we propose a new acceleration for exact k-means that gives the same a...
114
Voted
ICDE
2006
IEEE
15 years 6 months ago
2006
IEEE
Widespread interest in time-series similarity search has made more in need of efficient technique, which can reduce dimensionality of the data and then to index it easily using a ...
111
click to vote
TASLP
2010
14 years 7 months ago
2010
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...
126
Voted
AUTOMATICA
2008
15 years 20 days ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
149
click to vote
ITNG
2010
IEEE
14 years 11 months ago
2010
IEEE
—The increase in computational power of off-the-shelf hardware offers more and more advantageous tradeoffs among efficiency, cost and availability, thus enhancing the feasibil...