Sciweavers

2570 search results - page 478 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
DAC
2004
ACM
15 years 1 months ago
A methodology to improve timing yield in the presence of process variations
The ability to control the variations in IC fabrication process is rapidly diminishing as feature sizes continue towards the sub-100 nm regime. As a result, there is an increasing...
Sreeja Raj, Sarma B. K. Vrudhula, Janet Meiling Wa...
DIS
2006
Springer
14 years 11 months ago
Change Detection with Kalman Filter and CUSUM
Knowledge discovery systems are constrained by three main limited resources: time, memory and sample size. Sample size is traditionally the dominant limitation, but in many present...
Milton Severo, João Gama
JCB
2006
124views more  JCB 2006»
14 years 9 months ago
The Average Common Substring Approach to Phylogenomic Reconstruction
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
Igor Ulitsky, David Burstein, Tamir Tuller, Benny ...
ICML
2004
IEEE
15 years 10 months ago
Predictive automatic relevance determination by expectation propagation
In many real-world classification problems the input contains a large number of potentially irrelevant features. This paper proposes a new Bayesian framework for determining the r...
Yuan (Alan) Qi, Thomas P. Minka, Rosalind W. Picar...
EDBT
2008
ACM
206views Database» more  EDBT 2008»
15 years 10 months ago
Designing an inductive data stream management system: the stream mill experience
There has been much recent interest in on-line data mining. Existing mining algorithms designed for stored data are either not applicable or not effective on data streams, where r...
Hetal Thakkar, Barzan Mozafari, Carlo Zaniolo