Sciweavers

505 search results - page 74 / 101
» On the Minimality and Decomposability of Constraint Networks
Sort
View
TSP
2012
13 years 7 months ago
Distributed Covariance Estimation in Gaussian Graphical Models
—We consider distributed estimation of the inverse covariance matrix in Gaussian graphical models. These models factorize the multivariate distribution and allow for efficient d...
Ami Wiesel, Alfred O. Hero
IPSN
2005
Springer
15 years 5 months ago
Adaptive statistical sampling methods for decentralized estimation and detection of localized phenomena
— Sensor networks (SNETs) for monitoring spatial phenomena has emerged as an area of significant practical interest. We focus on the important problem of detection of distribute...
Erhan Baki Ermis, Venkatesh Saligrama
INFOCOM
2005
IEEE
15 years 5 months ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
TON
2002
99views more  TON 2002»
14 years 11 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda
GPC
2007
Springer
15 years 6 months ago
Optimizing Server Placement for QoS Requirements in Hierarchical Grid Environments
This paper focuses on two problems related to QoS-aware I/O server placement in hierarchical Grid environments. Given a hierarchical network with requests from clients, the network...
Chien-Min Wang, Chun-Chen Hsu, Pangfeng Liu, Hsi-M...