1054 search results - page 118 / 211 » Fast Approximated SIFT |
122
click to vote
WSC
2000
15 years 5 months ago
2000
The calculation of value-at-risk (VAR) for large portfolios of complex instruments is among the most demanding and widespread computational challenges facing the financial industr...
190
click to vote
STOC
2012
ACM
13 years 6 months ago
2012
ACM
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
147
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
Current research in indexing and mining time series data has produced many interesting algorithms and representations. However, it has not led to algorithms that can scale to the ...
222
click to vote
AVSS
2009
IEEE
15 years 11 months ago
2009
IEEE
This paper presents a background segmentation technique, which is able to process acceptable segmentation masks under fast global illumination changes. The histogram of the frame-...
148
click to vote
HAPTICS
2007
IEEE
15 years 10 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 ...