661 search results - page 17 / 133 » On Distributed Computation in Noisy Random Planar Networks |
86
Voted
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
This paper shows the power of randomization in designing e cient parallel algorithms for the problems of routing and PRAM emulation. We show that with randomization techniques opti...
78
Voted
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
— We study the inversion of a random field from pointwise measurements collected by a sensor network. We assume that the field has a sparse representation in a known basis. To ...
ISPAN
1999
IEEE
15 years 1 months ago
1999
IEEE
A network G is called random-fault-tolerant (RFT) network for a network G if G contains a fault-free isomorphic copy of G with high probability even if each processor fails indepe...
86
Voted
ISSAC
2007
Springer
15 years 3 months ago
2007
Springer
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
AINA
2010
IEEE
15 years 2 months ago
2010
IEEE
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...