2324 search results - page 69 / 465 » A Fast Keyword-Spotting Technique |
142
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
118
click to vote
AAAI
2006
15 years 7 months ago
2006
There is growing interest in scaling up the widely-used decision-tree learning algorithms to very large data sets. Although numerous diverse techniques have been proposed, a fast ...
194
click to vote
NIPS
2004
15 years 7 months ago
2004
The computation and memory required for kernel machines with N training samples is at least O(N2 ). Such a complexity is significant even for moderate size problems and is prohibi...
157
click to vote
IDA
1998
Springer
15 years 6 months ago
1998
Springer
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...
143
click to vote
ICIP
2008
IEEE
16 years 8 months ago
2008
IEEE
Motivated by the need to efficiently leverage user relevance feedback in content-based retrieval from image databases, we propose a fast, clustering-based indexing technique for e...