Sciweavers

1982 search results - page 86 / 397
» Designing Efficient Distributed Algorithms Using Sampling Te...
Sort
View
127
Voted
KDD
2006
ACM
129views Data Mining» more  KDD 2006»
16 years 3 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...
COLCOM
2007
IEEE
15 years 9 months ago
Cooperative security in distributed sensor networks
— Distributed sensor network protocols, such as routing, time synchronization or data aggregation protocols make use of collaborative techniques to minimize the consumption of sc...
Oscar García Morchon, Heribert Baldus, Tobi...
125
Voted
ISCAS
2007
IEEE
136views Hardware» more  ISCAS 2007»
15 years 9 months ago
Flexible Low Power Probability Density Estimation Unit For Speech Recognition
— This paper describes the hardware architecture for a flexible probability density estimation unit to be used in a Large Vocabulary Speech Recognition System, and targeted for m...
Ullas Pazhayaveetil, Dhruba Chandra, Paul Franzon
112
Voted
AUSAI
2003
Springer
15 years 7 months ago
Choosing Learning Algorithms Using Sign Tests with High Replicability
An important task in machine learning is determining which learning algorithm works best for a given data set. When the amount of data is small the same data needs to be used repea...
Remco R. Bouckaert
130
Voted
TCAD
2008
119views more  TCAD 2008»
15 years 2 months ago
FLUTE: Fast Lookup Table Based Rectilinear Steiner Minimal Tree Algorithm for VLSI Design
Abstract-- In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT) algorithm called FLUTE. FLUTE is based on pre-computed lookup table to make RS...
Chris C. N. Chu, Yiu-Chung Wong