1054 search results - page 119 / 211 » Fast Approximated SIFT |
146
click to vote
ICMCS
2005
IEEE
15 years 10 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...
147
click to vote
CORR
2010
Springer
15 years 4 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...
148
click to vote
CORR
2007
Springer
15 years 4 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...
277
click to vote
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 ...
112
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
We present methods for training high quality object detectors
very quickly. The core contribution is a pair of fast
training algorithms for piece-wise linear classifiers, which
...