Sciweavers

2988 search results - page 176 / 598
» Experiments with a New Boosting Algorithm
Sort
View
EVOW
2004
Springer
15 years 10 months ago
Self-Adaptive Scouting - Autonomous Experimentation for Systems Biology
Abstract. We introduce a new algorithm for autonomous experimentation. This algorithm uses evolution to drive exploration during scientific discovery. Population size and mutation...
Naoki Matsumaru, Florian Centler, Klaus-Peter Zaun...
IJCAI
2007
15 years 6 months ago
Word Sense Disambiguation with Spreading Activation Networks Generated from Thesauri
Most word sense disambiguation (WSD) methods require large quantities of manually annotated training data and/or do not exploit fully the semantic relations of thesauri. We propos...
George Tsatsaronis, Michalis Vazirgiannis, Ion And...
142
Voted
CRYPTO
2007
Springer
144views Cryptology» more  CRYPTO 2007»
15 years 11 months ago
Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
Coppersmith described at Eurocrypt 96 an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction. A simpler algorithm was later pro...
Jean-Sébastien Coron
ASPDAC
2006
ACM
103views Hardware» more  ASPDAC 2006»
15 years 10 months ago
Low area pipelined circuits by multi-clock cycle paths and clock scheduling
— A new algorithm is proposed to reduce the number of intermediate registers of a pipelined circuit using a combination of multi-clock cycle paths and clock scheduling. The algor...
Bakhtiar Affendi Rosdi, Atsushi Takahashi
AAAI
2010
15 years 6 months ago
Filtering Bounded Knapsack Constraints in Expected Sublinear Time
We present a highly efficient incremental algorithm for propagating bounded knapsack constraints. Our algorithm is based on the sublinear filtering algorithm for binary knapsack c...
Yuri Malitsky, Meinolf Sellmann, Radoslaw Szymanek