Sciweavers

5183 search results - page 146 / 1037
» The Complexity of Distributions
Sort
View
OPODIS
2001
15 years 7 months ago
A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...
Lélia Blin, Franck Butelle
ECCC
2010
89views more  ECCC 2010»
15 years 6 months ago
Estimating the unseen: A sublinear-sample canonical estimator of distributions
We introduce a new approach to characterizing the unobserved portion of a distribution, which provides sublinear-sample additive estimators for a class of properties that includes...
Gregory Valiant, Paul Valiant
TCS
2008
15 years 6 months ago
Using bisimulation proof techniques for the analysis of distributed abstract machines
Analysis of Distributed Abstract Machines Damien Pous ENS Lyon, France. We illustrate the use of recently developed proof techniques for weak bisimulation sing a generic framework...
Damien Pous
CORR
2011
Springer
195views Education» more  CORR 2011»
15 years 1 months ago
Simplicial Homology of Random Configurations
Given a Poisson process on a d-dimensional torus, its random geometric simplicial complex is the complex whose vertices are the points of the Poisson process and simplices are give...
Laurent Decreusefond, Eduardo Ferraz, Hugues Randr...
ICC
2009
IEEE
147views Communications» more  ICC 2009»
16 years 1 months ago
A Distributed Protocol for Virtual Device Composition in Mobile Ad Hoc Networks
— The dynamic composition of systems of networked appliances, or virtual devices, in MANETs, enables users to generate, on-the-fly, complex strong specific systems. Current work ...
Eric Karmouch, Amiya Nayak