Sciweavers

1165 search results - page 190 / 233
» Effective linear programming based placement methods
Sort
View
DATAMINE
1999
143views more  DATAMINE 1999»
13 years 8 months ago
Partitioning Nominal Attributes in Decision Trees
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
Don Coppersmith, Se June Hong, Jonathan R. M. Hosk...
TASLP
2011
13 years 3 months ago
A Probabilistic Interaction Model for Multipitch Tracking With Factorial Hidden Markov Models
—We present a simple and efficient feature modeling approach for tracking the pitch of two simultaneously active speakers. We model the spectrogram features of single speakers u...
Michael Wohlmayr, Michael Stark, Franz Pernkopf
KDD
1999
ACM
184views Data Mining» more  KDD 1999»
14 years 23 days ago
Mining Optimized Gain Rules for Numeric Attributes
—Association rules are useful for determining correlations between attributes of a relation and have applications in the marketing, financial, and retail sectors. Furthermore, op...
Sergey Brin, Rajeev Rastogi, Kyuseok Shim
ICCAD
2003
IEEE
195views Hardware» more  ICCAD 2003»
14 years 1 months ago
Vectorless Analysis of Supply Noise Induced Delay Variation
The impact of power supply integrity on a design has become a critical issue, not only for functional verification, but also for performance verification. Traditional analysis has...
Sanjay Pant, David Blaauw, Vladimir Zolotov, Savit...
LCTRTS
2010
Springer
14 years 1 months ago
Cache vulnerability equations for protecting data in embedded processor caches from soft errors
Continuous technology scaling has brought us to a point, where transistors have become extremely susceptible to cosmic radiation strikes, or soft errors. Inside the processor, cac...
Aviral Shrivastava, Jongeun Lee, Reiley Jeyapaul