Sciweavers

351 search results - page 42 / 71
» Classical proof forestry
Sort
View
ICASSP
2009
IEEE
14 years 2 months ago
A PDE characterization of the intrinsic mode functions
For the first time, a proof of the sifting process (SP) and so the empirical mode decomposition (EMD), is given. For doing this, lower and upper envelopes are modeled in a more c...
El-Hadji Samba Diop, R. Alexandre, Abdel-Ouahab Bo...
IROS
2009
IEEE
114views Robotics» more  IROS 2009»
14 years 2 months ago
A Distributed boundary detection algorithm for multi-robot systems
— We describe a distributed boundary detection algorithm suitable for use on multi-robot systems with dynamic network topologies. We assume that each robot has access to its loca...
James McLurkin, Erik D. Demaine
COLT
2005
Springer
14 years 1 months ago
The Value of Agreement, a New Boosting Algorithm
We present a new generalization bound where the use of unlabeled examples results in a better ratio between training-set size and the resulting classifier’s quality and thus red...
Boaz Leskes
CSL
2005
Springer
14 years 1 months ago
Light Functional Interpretation
We give a Natural Deduction formulation of an adaptation of G¨odel’s functional (Dialectica) interpretation to the extraction of (more) efficient programs from (classical) proof...
Mircea-Dan Hernest
COCO
2004
Springer
95views Algorithms» more  COCO 2004»
14 years 1 months ago
Consequences and Limits of Nonlocal Strategies
This paper investigates the powers and limitations of quantum entanglement in the context of cooperative games of incomplete information. We give several examples of such nonlocal...
Richard Cleve, Peter Høyer, Benjamin Toner,...