Sciweavers

2638 search results - page 25 / 528
» Random Geometric Complexes
Sort
View
CORR
2006
Springer
101views Education» more  CORR 2006»
15 years 1 months ago
Geographic Gossip: Efficient Aggregation for Sensor Networks
Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain en...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....
IH
2005
Springer
15 years 7 months ago
On the Intractability of Inverting Geometric Distortions in Watermarking Schemes
We examine the problem of watermarking schemes robust against geometric distortions from a complexity theoretic point of view. The main results presented are polynomial time reduct...
Maciej Liskiewicz, Ulrich Wölfel
JC
2008
87views more  JC 2008»
15 years 1 months ago
The randomized complexity of initial value problems
We study the complexity of randomized solution of initial value problems for systems of ordinary differential equations (ODE). The input data are assumed to be -smooth ( = r+ : th...
Stefan Heinrich, Bernhard Milla
PIMRC
2008
IEEE
15 years 8 months ago
Bayesian inference in linear models with a random Gaussian matrix : Algorithms and complexity
—We consider the Bayesian inference of a random Gaussian vector in a linear model with a random Gaussian matrix. We review two approaches to finding the MAP estimator for this m...
Ido Nevat, Gareth W. Peters, Jinhong Yuan
STOC
1992
ACM
91views Algorithms» more  STOC 1992»
15 years 6 months ago
Randomized versus Nondeterministic Communication Complexity
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean fu...
Paul Beame, Joan Lawry