Sciweavers

2519 search results - page 86 / 504
» Martingales and Locality in Distributed Computing
Sort
View
DIALM
2008
ACM
168views Algorithms» more  DIALM 2008»
13 years 10 months ago
Local broadcasting in the physical interference model
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...
Olga Goussevskaia, Thomas Moscibroda, Roger Watten...
TSP
2011
90views more  TSP 2011»
13 years 3 months ago
Radar HRRP Statistical Recognition With Local Factor Analysis by Automatic Bayesian Ying-Yang Harmony Learning
—Radar high-resolution range profiles (HRRPs) are typical high-dimensional, non-Gaussian and interdimension dependently distributed data, the statistical modelling of which is a...
Lei Shi, Penghui Wang, Hongwei Liu, Lei Xu, Zheng ...
APPROX
2004
Springer
179views Algorithms» more  APPROX 2004»
14 years 2 months ago
Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz
GIS
2010
ACM
13 years 7 months ago
Exploiting local node cache in top-k queries within wireless sensor networks
Top-k queries are a popular type of query in Wireless Sensor Networks. Typical solutions rely on coordinated root-tonodes and nodes-to-root messages and on maintaining filters at...
Johannes Niedermayer, Mario A. Nascimento, Matthia...
UPP
2004
Springer
14 years 2 months ago
Grassroots Approach to Self-management in Large-Scale Distributed Systems
Abstract. Traditionally, autonomic computing is envisioned as replacing the human factor in the deployment, administration and maintenance of computer systems that are ever more co...
Özalp Babaoglu, Márk Jelasity, Alberto...