Sciweavers

2519 search results - page 145 / 504
» Martingales and Locality in Distributed Computing
Sort
View
ATAL
2008
Springer
14 years 2 days ago
Automated global-to-local programming in 1-D spatial multi-agent systems
A spatial computer is a distributed multi-agent system that is embedded in a geometric space. A key challenge is engineering local agent interaction rules that enable spatial comp...
Daniel Yamins, Radhika Nagpal
CORR
2011
Springer
174views Education» more  CORR 2011»
13 years 5 months ago
Distributed Private Data Analysis: On Simultaneously Solving How and What
We examine the combination of two directions in the field of privacy concerning computations over distributed private inputs – secure function evaluation (SFE) and differential...
Amos Beimel, Kobbi Nissim, Eran Omri
CVPR
2001
IEEE
15 years 2 days ago
Affine Arithmetic Based Estimation of Cue Distributions in Deformable Model Tracking
In this paper we describe a statistical method for the integration of an unlimited number of cues within a deformable model framework. We treat each cue as a random variable, each...
Siome Goldenstein, Christian Vogler, Dimitris N. M...
EMNETS
2007
14 years 2 months ago
Robust node localization for wireless sensor networks
The node localization problem in Wireless Sensor Networks has received considerable attention, driven by the need to obtain a higher location accuracy without incurring a large, p...
Radu Stoleru, John A. Stankovic, Sang Hyuk Son
CSR
2008
Springer
13 years 12 months ago
Comparing Universal Covers in Polynomial Time
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
Jirí Fiala, Daniël Paulusma