Sciweavers

159 search results - page 3 / 32
» Codes identifying sets of vertices in random networks
Sort
View
CORR
2007
Springer
146views Education» more  CORR 2007»
13 years 7 months ago
Coding for Errors and Erasures in Random Network Coding
Abstract—The problem of error-control in random linear network coding is considered. A “noncoherent” or “channel oblivious” model is assumed where neither transmitter nor...
Ralf Koetter, Frank R. Kschischang
TIT
2008
122views more  TIT 2008»
13 years 7 months ago
Identifying Codes and Covering Problems
The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1...
Moshe Laifenfeld, Ari Trachtenberg
BROADNETS
2007
IEEE
14 years 1 months ago
Joint monitoring and routing in wireless sensor networks using robust identifying codes
Wireless Sensor Networks (WSNs) provide an important means of monitoring the physical world, but their ons present challenges to fundamental network services such as routing. In t...
Moshe Laifenfeld, Ari Trachtenberg, Reuven Cohen, ...
BIRTHDAY
2009
Springer
14 years 2 months ago
Vertical Object Layout and Compression for Fixed Heaps
Research into embedded sensor networks has placed increased focus on the problem of developing reliable and flexible software for microcontroller-class devices. Languages such as ...
Ben Titzer, Jens Palsberg
CORR
2010
Springer
119views Education» more  CORR 2010»
13 years 7 months ago
Graph-Constrained Group Testing
Non-adaptive group testing involves grouping arbitrary subsets of n items into different pools. Each pool is then tested and defective items are identified. A fundamental question...
Mahdi Cheraghchi, Amin Karbasi, Soheil Mohajer, Ve...