Sciweavers

633 search results - page 4 / 127
» A Few Constructions on Constructors
Sort
View
CCCG
2008
13 years 8 months ago
A Class of Convex Polyhedra with Few Edge Unfoldings
We construct a sequence of convex polyhedra on n vertices with the property that, as n, the fraction of its edge unfoldings that avoid overlap approaches 0, and so the frac
Alex Benton, Joseph O'Rourke
PERCOM
2009
ACM
14 years 2 months ago
A Dynamic Platform for Runtime Adaptation
—We present a middleware platform for assembling pervasive applications that demand fault-tolerance and adaptivity in distributed, dynamic environments. Unlike typical adaptive m...
Hubert Pham, Justin Mazzola Paluska, Umar Saif, Ch...
FOCS
2004
IEEE
13 years 11 months ago
Extracting Randomness Using Few Independent Sources
In this work we give the first deterministic extractors from a constant number of weak sources whose entropy rate is less than 1/2. Specifically, for every > 0 we give an expl...
Boaz Barak, Russell Impagliazzo, Avi Wigderson
ICRA
1998
IEEE
105views Robotics» more  ICRA 1998»
13 years 11 months ago
PSOM Network: Learning with Few Examples
: Precise sensorimotor mappings between various motor, ensor, and abstract physical spaces are the basis for many robotics tasks. Their cheap construction is a challenge for adapti...
Jörg A. Walter
JCT
2007
103views more  JCT 2007»
13 years 7 months ago
Geometric drawings of Kn with few crossings
We give a new upper bound for the rectilinear crossing number cr(n) of the complete geometric graph Kn. We prove that cr(n) ≤ 0.380559 ¡n 4 ¢ + Θ(n3 ) by means of a new const...
Bernardo M. Ábrego, Silvia Fernández...