Sciweavers

2376 search results - page 332 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
DCC
2004
IEEE
16 years 3 months ago
Discrete Universal Filtering Through Incremental Parsing
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...
Erik Ordentlich, Tsachy Weissman, Marcelo J. Weinb...
ICCAD
2001
IEEE
144views Hardware» more  ICCAD 2001»
16 years 18 days ago
Faster SAT and Smaller BDDs via Common Function Structure
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
INFOCOM
2006
IEEE
15 years 9 months ago
Session Privacy Enhancement by Traffic Dispersion
— Traditional network routing uses the single (shortest) path paradigm. This paradigm leaves the session vulnerable to a variety of security threats, such as eavesdropping. We pr...
Haim Zlatokrilov, Hanoch Levy
GLVLSI
2010
IEEE
171views VLSI» more  GLVLSI 2010»
15 years 8 months ago
Timing-driven variation-aware nonuniform clock mesh synthesis
Clock skew variations adversely affect timing margins, limiting performance, reducing yield, and may also lead to functional faults. Non-tree clock distribution networks, such as ...
Ameer Abdelhadi, Ran Ginosar, Avinoam Kolodny, Eby...
GECCO
2010
Springer
168views Optimization» more  GECCO 2010»
15 years 8 months ago
Investigating whether hyperNEAT produces modular neural networks
HyperNEAT represents a class of neuroevolutionary algorithms that captures some of the power of natural development with a ionally efficient high-level abstraction of development....
Jeff Clune, Benjamin E. Beckmann, Philip K. McKinl...