Sciweavers

2836 search results - page 287 / 568
» Parsing Algorithms and Metrics
Sort
View
ICCAD
2006
IEEE
106views Hardware» more  ICCAD 2006»
16 years 1 months ago
Wire density driven global routing for CMP variation and timing
In this paper, we propose the first wire density driven global routing that considers CMP variation and timing. To enable CMP awareness during global routing, we propose a compac...
Minsik Cho, David Z. Pan, Hua Xiang, Ruchir Puri
ICASSP
2009
IEEE
15 years 11 months ago
On the use of Bayesian modeling for predicting noise reduction performance
In speech enhancement applications, a validated metric of noise reduction performance is vital in the relative ranking of noise reduction algorithms and in enhancing the performan...
Nazanin Pourmand, David Suelzle, Vijay Parsa, Yi H...
IROS
2007
IEEE
123views Robotics» more  IROS 2007»
15 years 10 months ago
Learning humanoid reaching tasks in dynamic environments
— A central challenging problem in humanoid robotics is to plan and execute dynamic tasks in dynamic environments. Given that the environment is known, sampling-based online moti...
Xiaoxi Jiang, Marcelo Kallmann
ROCAI
2004
Springer
15 years 9 months ago
Optimizing Area Under Roc Curve with SVMs
For many years now, there is a growing interest around ROC curve for characterizing machine learning performances. This is particularly due to the fact that in real-world problems ...
Alain Rakotomamonjy
KDD
1999
ACM
108views Data Mining» more  KDD 1999»
15 years 8 months ago
Mining the Most Interesting Rules
Several algorithms have been proposed for finding the “best,” “optimal,” or “most interesting” rule(s) in a database according to a variety of metrics including confid...
Roberto J. Bayardo Jr., Rakesh Agrawal