Sciweavers

1578 search results - page 79 / 316
» Algorithmic randomness of continuous functions
Sort
View
ECCC
2010
108views more  ECCC 2010»
14 years 12 months ago
Improved bounds for the randomized decision tree complexity of recursive majority
We consider the randomized decision tree complexity of the recursive 3-majority function. For evaluating a height h formulae, we prove a lower bound for the -two-sided-error rando...
Frédéric Magniez, Ashwin Nayak, Mikl...
ITC
2003
IEEE
222views Hardware» more  ITC 2003»
15 years 7 months ago
Race: A Word-Level ATPG-Based Constraints Solver System For Smart Random Simulation
Functional verification of complex designs largely relies on the use of simulation in conjunction high-level verification languages (HVL) and test-bench automation (TBA) tools. In...
Mahesh A. Iyer
111
Voted
ICML
2006
IEEE
16 years 3 months ago
A DC-programming algorithm for kernel selection
We address the problem of learning a kernel for a given supervised learning task. Our approach consists in searching within the convex hull of a prescribed set of basic kernels fo...
Andreas Argyriou, Raphael Hauser, Charles A. Micch...
IOR
2008
109views more  IOR 2008»
15 years 2 months ago
Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
In 1958, Wagner and Whitin published a seminal paper on the deterministic uncapacitated lot-sizing problem, a fundamental model that is embedded in many practical production plann...
Yongpei Guan, Andrew J. Miller
EMNLP
2009
15 years 8 days ago
On the Use of Virtual Evidence in Conditional Random Fields
Virtual evidence (VE), first introduced by (Pearl, 1988), provides a convenient way of incorporating prior knowledge into Bayesian networks. This work generalizes the use of VE to...
Xiao Li