Sciweavers

15073 search results - page 2746 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
ECML
2003
Springer
15 years 9 months ago
Pairwise Preference Learning and Ranking
We consider supervised learning of a ranking function, which is a mapping from instances to total orders over a set of labels (options). The training information consists of exampl...
Johannes Fürnkranz, Eyke Hüllermeier
DATE
2010
IEEE
171views Hardware» more  DATE 2010»
15 years 9 months ago
Statistical static timing analysis using Markov chain Monte Carlo
—We present a new technique for statistical static timing analysis (SSTA) based on Markov chain Monte Carlo (MCMC), that allows fast and accurate estimation of the right-hand tai...
Yashodhan Kanoria, Subhasish Mitra, Andrea Montana...
TAMC
2010
Springer
15 years 9 months ago
Community Structure in Large Complex Networks
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...
Liaoruo Wang, John E. Hopcroft
118
Voted
TRUST
2010
Springer
15 years 9 months ago
Robust Combiners for Software Hardening
All practical software hardening schemes, as well as practical encryption schemes, e.g., AES, were not proven to be secure. One technique to enhance security is robust combiners. A...
Amir Herzberg, Haya Shulman
HICSS
2002
IEEE
106views Biometrics» more  HICSS 2002»
15 years 8 months ago
Optimal Electric Power Capacity Expansion in the Presence of Options
This paper studies optimal long-term electric power capacity strategies with capacity options. Gencos can sign contracts with Discos, where such contracts take the form of capacit...
D. J. Wu, Paul Kleindorfer, Yanjun Sun
« Prev « First page 2746 / 3015 Last » Next »