Sciweavers

5153 search results - page 104 / 1031
» Introduction to Randomized Algorithms
Sort
View
APPROX
2008
Springer
125views Algorithms» more  APPROX 2008»
15 years 4 months ago
On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs
In order to perform an average-case analysis for specific input distributions one needs to derive and understand properties of a 'typical' input instance. In the case of...
Nicla Bernasconi, Konstantinos Panagiotou, Angelik...
MOC
2000
132views more  MOC 2000»
15 years 2 months ago
Lattice computations for random numbers
We improve on a lattice algorithm of Tezuka for the computation of the k-distribution of a class of random number generators based on finite fields. We show how this is applied to ...
Raymond Couture, Pierre L'Ecuyer
STOC
2005
ACM
101views Algorithms» more  STOC 2005»
15 years 8 months ago
The round complexity of two-party random selection
We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even i...
Saurabh Sanghvi, Salil P. Vadhan
ICARCV
2002
IEEE
132views Robotics» more  ICARCV 2002»
15 years 7 months ago
Handling of randomly located moving parts using FPGA-based realtime vision
We will develop a manipulator system that can handle randomly located, moving parts. Vision algorithm to detect the planar motion of a part is implemented on an FPGA-based realtim...
Shinichi Hirai, Tatsuhiko Tsuboi, Masakazu Zakouji...
STOC
1994
ACM
93views Algorithms» more  STOC 1994»
15 years 6 months ago
Scalable expanders: exploiting hierarchical random wiring
Recent work has shown many advantages to randomly wired expander-based networks. Unfortunately, the wiring complexity of such networks becomes physically problematic as they becom...
Eric A. Brewer, Frederic T. Chong, Tom Leighton