Sciweavers

657 search results - page 35 / 132
» Recovering architectural assumptions
Sort
View
TWC
2008
108views more  TWC 2008»
13 years 10 months ago
Successive-Capture Analysis of RTS/CTS in Ad-Hoc Networks
We consider a wireless ad-hoc network with random ALOHA transmissions between nodes. However nodes can decide to use the Request-to-Send (RTS) / Clear-to-Send (CTS) protocol for oc...
Chin Keong Ho, Jean-Paul M. G. Linnartz
ICUMT
2009
13 years 7 months ago
A Bayesian analysis of Compressive Sensing data recovery in Wireless Sensor Networks
Abstract--In this paper we address the task of accurately reconstructing a distributed signal through the collection of a small number of samples at a data gathering point using Co...
Riccardo Masiero, Giorgio Quer, Michele Rossi, Mic...
CORR
2010
Springer
230views Education» more  CORR 2010»
13 years 6 months ago
Query-Efficient Locally Decodable Codes of Subexponential Length
A k-query locally decodable code (LDC) C : n N encodes each message x into a codeword C(x) such that each symbol of x can be probabilistically recovered by querying only k coordina...
Yeow Meng Chee, Tao Feng, San Ling, Huaxiong Wang,...
ECCC
2010
140views more  ECCC 2010»
13 years 5 months ago
Query-Efficient Locally Decodable Codes
A k-query locally decodable code (LDC) C : n N encodes each message x into a codeword C(x) such that each symbol of x can be probabilistically recovered by querying only k coordina...
Yeow Meng Chee, Tao Feng, San Ling, Huaxiong Wang,...
JMLR
2012
12 years 15 days ago
High-Rank Matrix Completion
This paper considers the problem of completing a matrix with many missing entries under the assumption that the columns of the matrix belong to a union of multiple low-rank subspa...
Brian Eriksson, Laura Balzano, Robert Nowak