Search Sciweavers | Sciweavers

5115 search results - page 53 / 1023

» On Randomized Lanczos Algorithms

click to vote

ESA
2004
Springer

120views Algorithms» more ESA 2004»

Maximum Matchings in Planar Graphs via Gaussian Elimination

15 years 5 months ago

Download www.mimuw.edu.pl

We present a randomized algorithm for ﬁnding maximum matchings in planar graphs in time O(nω/2 ), where ω is the exponent of the best known matrix multiplication algorithm. Sin...

Marcin Mucha, Piotr Sankowski

claim paper

Read More »

click to vote

ADHOCNOW
2008
Springer

88views Computer Networks» more ADHOCNOW 2008»

Communication in Random Geometric Radio Networks with Positively Correlated Random Faults

15 years 28 days ago

Download people.scs.carleton.ca

Abstract. We study the feasibility and time of communication in random geometric radio networks, where nodes fail randomly with positive correlation. We consider a set of radio sta...

Evangelos Kranakis, Michel Paquette, Andrzej Pelc

claim paper

Read More »

117

click to vote

CSDA
2004

191views more CSDA 2004»

Computing the distribution of the product of two continuous random variables

14 years 11 months ago

Download www.math.wm.edu

We present an algorithm for computing the probability density function of the product of two independent random variables, along with an implementation of the algorithm in a compu...

Andrew G. Glen, Lawrence Leemis, John H. Drew

claim paper

Read More »

click to vote

STOC
2004
ACM

94views Algorithms» more STOC 2004»

Sharp thresholds For monotone properties in random geometric graphs

16 years 3 days ago