Sciweavers

173 search results - page 26 / 35
» An optimal randomized algorithm for maximum Tukey depth
Sort
View
INFOCOM
2005
IEEE
15 years 3 months ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
UAI
1997
14 years 10 months ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish
TCOM
2010
167views more  TCOM 2010»
14 years 7 months ago
On distributed scheduling in wireless networks exploiting broadcast and network coding
—In this paper, we consider cross-layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links....
Tao Cui, Lijun Chen, Tracey Ho
EMMCVPR
1999
Springer
15 years 1 months ago
Adaptive Bayesian Contour Estimation: A Vector Space Representation Approach
Abstract. We propose a vector representation approach to contour estimation from noisy data. Images are modeled as random elds composed of a set of homogeneous regions contours (bo...
José M. B. Dias
ICDCS
2010
IEEE
15 years 1 months ago
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun,...