Sciweavers

150 search results - page 19 / 30
» Compressive Sensing over Graphs
Sort
View
EJASP
2010
234views more  EJASP 2010»
13 years 2 months ago
Iterative Sparse Channel Estimation and Decoding for Underwater MIMO-OFDM
In this paper we propose a block-by-block iterative receiver for underwater MIMO-OFDM that couples channel estimation with MIMO detection and channel decoding. In particular, the c...
Jie Huang, Jianzhong Huang, Christian R. Berger, S...
DCC
2007
IEEE
14 years 7 months ago
High-Rate Analysis of Systematic Lossy Error Protection of a Predictively Encoded Source
We consider a first-order Markov source, which is predictively encoded using a DPCM-style encoder. The quantized compressed prediction residual is transmitted over an erasure chan...
Shantanu Rane, David Rebollo-Monedero, Bernd Girod
CPC
2007
97views more  CPC 2007»
13 years 7 months ago
On an Online Spanning Tree Problem in Randomly Weighted Graphs
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
Jan Remy, Alexander Souza, Angelika Steger
IPSN
2005
Springer
14 years 27 days ago
Tracking on a graph
Abstract— This paper considers the problem of tracking objects with sparsely located binary sensors. Tracking with a sensor network is a challenging task due to the inaccuracy of...
Songhwai Oh, Shankar Sastry
BNCOD
2004
85views Database» more  BNCOD 2004»
13 years 8 months ago
Database Support for Path Query Functions
Extending relational database functionality to include data mining primitives is one step towards the greater goal of more closely integrated database and mining systems. This pape...
Rachel Hamill, Nigel J. Martin