Sciweavers

5115 search results - page 87 / 1023
» On Randomized Lanczos Algorithms
Sort
View
CORR
2011
Springer
144views Education» more  CORR 2011»
14 years 3 months ago
Analyzing Walksat on random formulas
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We prove that the Walksat algorithm from [16, 17] finds a satisfying assignment of Φ in pol...
Amin Coja-Oghlan, Alan M. Frieze
CDES
2006
107views Hardware» more  CDES 2006»
15 years 1 months ago
An Algorithm for Yield Improvement via Local Positioning and Resizing
The ability to improve the yield of integrated circuits through layout modification has been recognized and several techniques for yield enhanced routing and compaction have been ...
Vazgen Karapetyan
GLOBECOM
2008
IEEE
15 years 6 months ago
Distributed Multi-Interface Multi-Channel Random Access
— The aggregate capacity of wireless ad-hoc networks can be substantially increased if each wireless node is equipped with multiple network interface cards (NICs) and each NIC op...
Amir Hamed Mohsenian Rad, Vincent W. S. Wong
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
15 years 1 months ago
Approximating connected facility location problems via random facility sampling and core detouring
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Ro...
JACM
2006
98views more  JACM 2006»
14 years 12 months ago
Distribution sort with randomized cycling
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
Jeffrey Scott Vitter, David A. Hutchinson