2324 search results - page 286 / 465 » A Fast Keyword-Spotting Technique |
146
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3list-coloring. Our algorithms are based on a constraint satisfaction...
160
click to vote
VMV
2001
15 years 8 months ago
2001
In this paper we present a method to achieve interactive rendering of smooth terrain based on coarse data. Therefore we use adaptive subdivision surfaces which are calculated on t...
161
click to vote
COLING
2000
15 years 8 months ago
2000
A deterministic finite state transducer is a fast device for analyzing strings. It takes O(n) time to analyze a string of length n. In this paper, an application of this technique...
139
click to vote
ESANN
2000
15 years 8 months ago
2000
In this work new Decision-Feedback (DF) Neural Equalizers (DFNE) are introduced and compared with classical DF equalizers and Viterbi demodulators. It is shown that the choice of ...
193
click to vote
APDC
1997
15 years 8 months ago
1997
' An efficient assignment of tasks to the processors is imperative for achieving a fast job turnaround time in a parallel or distributed enviornment. The assignment problem is...