Sciweavers

4843 search results - page 904 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
KDD
2006
ACM
129views Data Mining» more  KDD 2006»
15 years 10 months ago
Suppressing model overfitting in mining concept-drifting data streams
Mining data streams of changing class distributions is important for real-time business decision support. The stream classifier must evolve to reflect the current class distributi...
Haixun Wang, Jian Yin, Jian Pei, Philip S. Yu, Jef...
KDD
2001
ACM
203views Data Mining» more  KDD 2001»
15 years 10 months ago
Ensemble-index: a new approach to indexing large databases
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
Eamonn J. Keogh, Selina Chu, Michael J. Pazzani
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
15 years 10 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur
STOC
2004
ACM
61views Algorithms» more  STOC 2004»
15 years 10 months ago
The zero-one principle for switching networks
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
Yossi Azar, Yossi Richter
SIGMOD
2009
ACM
120views Database» more  SIGMOD 2009»
15 years 10 months ago
Kernel-based skyline cardinality estimation
The skyline of a d-dimensional dataset consists of all points not dominated by others. The incorporation of the skyline operator into practical database systems necessitates an ef...
Zhenjie Zhang, Yin Yang, Ruichu Cai, Dimitris Papa...