Sciweavers

2638 search results - page 117 / 528
» Random Geometric Complexes
Sort
View
EATCS
2002
141views more  EATCS 2002»
15 years 4 months ago
Recent Developments in Explicit Constructions of Extractors
Extractors are functions which are able to "extract" random bits from arbitrary distributions which "contain" sufficient randomness. Explicit constructions of ...
Ronen Shaltiel
ITC
2003
IEEE
222views Hardware» more  ITC 2003»
15 years 10 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
IPPS
1998
IEEE
15 years 9 months ago
Sharing Random Bits with No Process Coordination
We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits a...
Marius Zimand
NIPS
2003
15 years 6 months ago
From Algorithmic to Subjective Randomness
We explore the phenomena of subjective randomness as a case study in understanding how people discover structure embedded in noise. We present a rational account of randomness per...
Thomas L. Griffiths, Joshua B. Tenenbaum
IROS
2009
IEEE
176views Robotics» more  IROS 2009»
15 years 11 months ago
A new modular schema for the control of tumbling robots
— Tumbling is an exciting new area of robotic locomotion that takes advantage of ground-body interactions to achieve rich motions with minimal hardware complexity. The increased ...
Brett Hemes, Nikolaos Papanikolopoulos