Sciweavers

1021 search results - page 115 / 205
» Fast Approximate PCPs
Sort
View
ISMIR
2000
Springer
176views Music» more  ISMIR 2000»
15 years 6 months ago
SEMEX - An efficient Music Retrieval Prototype
We present an efficient prototype for music information retrieval. The prototype uses bitparallel algorithms for locating transposition invariant matches of monophonic query melod...
Kjell Lemström, S. Perttu
LREC
2010
157views Education» more  LREC 2010»
15 years 4 months ago
Indexing Methods for Faster and More Effective Person Name Search
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...
Mark Arehart
110
Voted
WSC
2000
15 years 4 months ago
Variance reduction techniques for value-at-risk with heavy-tailed risk factors
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...
Paul Glasserman, Philip Heidelberger, Perwez Shaha...
135
Voted
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
16 years 3 months ago
iSAX: indexing and mining terabyte sized time series
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 ...
Jin Shieh, Eamonn J. Keogh
AVSS
2009
IEEE
15 years 10 months ago
Global Illumination Compensation for Background Subtraction Using Gaussian-Based Background Difference Modeling
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-...
Julien A. Vijverberg, Marijn J. H. Loomans, Cornel...