Sciweavers

385 search results - page 66 / 77
» Contour Approximation in Sensor Networks
Sort
View
ICASSP
2010
IEEE
15 years 3 months ago
Distributed bearing estimation via matrix completion
We consider bearing estimation of multiple narrow-band plane waves impinging on an array of sensors. For this problem, bearing estimation algorithms such as minimum variance disto...
Andrew Waters, Volkan Cevher
PAM
2005
Springer
15 years 8 months ago
Scalable Coordination Techniques for Distributed Network Monitoring
Abstract. Emerging network monitoring infrastructures capture packetlevel traces or keep per-flow statistics at a set of distributed vantage points. Today, distributed monitors in...
Manish R. Sharma, John W. Byers
TWC
2010
14 years 10 months ago
Distributed consensus-based demodulation: algorithms and error analysis
This paper deals with distributed demodulation of space-time transmissions of a common message from a multiantenna access point (AP) to a wireless sensor network. Based on local me...
Hao Zhu, Alfonso Cano, Georgios B. Giannakis
GLOBECOM
2009
IEEE
15 years 10 months ago
Data Acquisition through Joint Compressive Sensing and Principal Component Analysis
—In this paper we look at the problem of accurately reconstructing distributed signals through the collection of a small number of samples at a data gathering point. The techniqu...
Riccardo Masiero, Giorgio Quer, Daniele Munaretto,...
139
Voted
ISAAC
2004
Springer
137views Algorithms» more  ISAAC 2004»
15 years 8 months ago
The Polymatroid Steiner Problems
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Gruia Calinescu, Alexander Zelikovsky