Sciweavers

149 search results - page 25 / 30
» On Finding Minimum Deadly Sets for Directed Networks
Sort
View
MOBISYS
2006
ACM
14 years 7 months ago
Feasibility study of mesh networks for all-wireless offices
There is a fair amount of evidence that mesh (static multihop wireless) networks are gaining popularity, both in the academic literature and in the commercial space. Nonetheless, ...
Jakob Eriksson, Sharad Agarwal, Paramvir Bahl, Jit...
PERCOM
2007
ACM
14 years 7 months ago
Sensor Scheduling for Optimal Observability Using Estimation Entropy
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
Mohammad Rezaeian
KDD
2010
ACM
188views Data Mining» more  KDD 2010»
13 years 9 months ago
Inferring networks of diffusion and influence
Information diffusion and virus propagation are fundamental processes talking place in networks. While it is often possible to directly observe when nodes become infected, observi...
Manuel Gomez-Rodriguez, Jure Leskovec, Andreas Kra...
BMCBI
2010
172views more  BMCBI 2010»
13 years 7 months ago
Inferring gene regression networks with model trees
Background: Novel strategies are required in order to handle the huge amount of data produced by microarray technologies. To infer gene regulatory networks, the first step is to f...
Isabel A. Nepomuceno-Chamorro, Jesús S. Agu...
DCOSS
2009
Springer
14 years 2 months ago
Fast Self-stabilization for Gradients
Abstract. Gradients are distributed distance estimates used as a building block in many sensor network applications. In large or long-lived deployments, it is important for the est...
Jacob Beal, Jonathan Bachrach, Daniel Vickery, Mar...