1439 search results - page 142 / 288 » Fast approximation of centrality |
119
click to vote
ISMIR
2000
Springer
15 years 4 months ago
2000
Springer
We present an efficient prototype for music information retrieval. The prototype uses bitparallel algorithms for locating transposition invariant matches of monophonic query melod...
87
Voted
LREC
2010
15 years 2 months ago
2010
This paper compares several indexing methods for person names extracted from text, developed for an information retrieval system with requirements for fast approximate matching of...
96
Voted
WSC
2000
15 years 2 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...
157
Voted
STOC
2012
ACM
13 years 3 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...
110
click to vote
KDD
2008
ACM
16 years 1 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 ...