2324 search results - page 174 / 465 » A Fast Keyword-Spotting Technique |
173
Voted
ICASSP
2010
IEEE
15 years 7 months ago
2010
IEEE
We propose a quantization design technique (estimator) suitable for new compressed sensing sampling systems whose ultimate goal is classiļ¬cation or detection. The design is base...
154
Voted
WEA
2005
Springer
16 years 8 days ago
2005
Springer
We present the problem of statically distributing instructions of a common programming language, a problem which we prove equivalent to the multiterminal cut problem. We design eļ¬...
186
click to vote
ICCSA
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. Many problems in computer science are related to scheduling problems or embedding problems. Therefore it is an interesting topic to ļ¬nd eļ¬cient (approximation) algori...
147
click to vote
PARA
1994
Springer
15 years 11 months ago
1994
Springer
In this paper we present four parallel algorithms to compute any group of eigenvalues and eigenvectors of a Toeplitz-plus-Hankel matrix. These algorithms parallelize a method that...
176
click to vote
ALENEX
2007
15 years 8 months ago
2007
Inverted index data structures are the key to fast search engines. The predominant operation on inverted indices asks for intersecting two sorted lists of document IDs which might...