Sciweavers

7189 search results - page 163 / 1438
» Connecting Design with Code
Sort
View
ICC
2008
IEEE
102views Communications» more  ICC 2008»
15 years 9 months ago
Geometric Random Linear Codes in Sensor Networks
—Wireless sensor networks consist of unreliable and energy-constrained sensors connecting to each other wirelessly. As measured data may be lost due to sensor failures, maintaini...
Yunfeng Lin, Ben Liang, Baochun Li
CORR
2010
Springer
108views Education» more  CORR 2010»
15 years 3 months ago
On Graphs and Codes Preserved by Edge Local Complementation
Orbits of graphs under local complementation (LC) and edge local complementation (ELC) have been studied in several different contexts. For instance, there are connections between...
Lars Eirik Danielsen, Matthew G. Parker, Constanza...
TIT
2008
122views more  TIT 2008»
15 years 3 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
POPL
2006
ACM
16 years 3 months ago
Frame rules from answer types for code pointers
We define a type system, which may also be considered as a simple Hoare logic, for a fragment of an assembly language that deals with code pointers and jumps. The typing is aimed ...
Hayo Thielecke
INFOCOM
2009
IEEE
15 years 10 months ago
Passive Loss Inference in Wireless Sensor Networks Based on Network Coding
Abstract—The highly stochastic nature of wireless environments makes it desirable to monitor link loss rates in wireless sensor networks. In this paper, we study the loss inferen...
Yunfeng Lin, Ben Liang, Baochun Li