Sciweavers

106 search results - page 14 / 22
» Approximating Spanning Trees with Inner Nodes Cost
Sort
View
IPPS
2005
IEEE
15 years 5 months ago
Bootstrapping Free-Space Optical Networks
Title of thesis: BOOTSTRAPPING FREE-SPACE OPTICAL NETWORKS Fang Liu, Master of Science, 2004 Thesis directed by: Professor Uzi Vishkin Department of Electrical and Computer Engine...
Fang Liu, Uzi Vishkin, Stuart Milner
CISS
2007
IEEE
15 years 3 months ago
Energy Efficient Routing for Statistical Inference of Markov Random Fields
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
Animashree Anandkumar, Lang Tong, Ananthram Swami
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
15 years 6 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
TPDS
2008
136views more  TPDS 2008»
14 years 11 months ago
Data Gathering with Tunable Compression in Sensor Networks
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
Yang Yu, Bhaskar Krishnamachari, Viktor K. Prasann...
COMCOM
2006
95views more  COMCOM 2006»
14 years 11 months ago
E-Span and LPT for data aggregation in wireless sensor networks
In wireless sensor networks (WSNs), when a stimulus or event is detected within a particular region, data reports from the neighboring sensor nodes (sources) are sent to the sink ...
Weinan Marc Lee, Vincent W. S. Wong