1021 search results - page 116 / 205 » Fast Approximate PCPs |
140
click to vote
HAPTICS
2007
IEEE
15 years 9 months ago
2007
IEEE
We present a fast proximity query algorithm for haptic display of complex deformable models using a layered representation. Assuming that each solid model can be represented as a ...
134
click to vote
ICMCS
2005
IEEE
15 years 8 months ago
2005
IEEE
Multi-stream hidden Markov models (HMMs) have recently been very successful in audio-visual speech recognition, where the audio and visual streams are fused at the final decision...
135
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Previous work reports about SXSI, a fast XPath engine which executes tree automata over compressed XML indexes. Here, reasons are investigated why SXSI is so fast. It is shown tha...
138
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
260
Voted
Book
"The Discrete Fourier Transform (DFT) can be understood as a numerical approximation to the Fourier transform. However, the DFT has its own exact Fourier theory, which is the ...