Sciweavers

3941 search results - page 677 / 789
» Computational Efficiency of Batching Methods
Sort
View
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 9 months ago
Assessing data mining results via swap randomization
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
Aristides Gionis, Heikki Mannila, Panayiotis Tsapa...
KDD
2005
ACM
104views Data Mining» more  KDD 2005»
14 years 9 months ago
A hit-miss model for duplicate detection in the WHO drug safety database
The WHO Collaborating Centre for International Drug Monitoring in Uppsala, Sweden, maintains and analyses the world's largest database of reports on suspected adverse drug re...
Andrew Bate, G. Niklas Norén, Roland Orre
CVPR
2010
IEEE
14 years 5 months ago
Linked Edges as Stable Region Boundaries
Many of the recently popular shape based category recognition methods require stable, connected and labeled edges as input. This paper introduces a novel method to find the most st...
Michael Donoser, Hayko Riemenschneider and Horst B...
MIR
2004
ACM
154views Multimedia» more  MIR 2004»
14 years 2 months ago
Fast and robust short video clip search using an index structure
In this paper, we present an index structure-based method to fast and robustly search short video clips in large video collections. First we temporally segment a given long video ...
Junsong Yuan, Ling-Yu Duan, Qi Tian, Changsheng Xu
CIKM
2008
Springer
13 years 11 months ago
Achieving both high precision and high recall in near-duplicate detection
To find near-duplicate documents, fingerprint-based paradigms such as Broder's shingling and Charikar's simhash algorithms have been recognized as effective approaches a...
Lian'en Huang, Lei Wang, Xiaoming Li