Sciweavers

3852 search results - page 405 / 771
» Construction of Codes for Network Coding
Sort
View
232
Voted
HPCC
2011
Springer
14 years 6 months ago
Heuristic-Based Techniques for Mapping Irregular Communication Graphs to Mesh Topologies
— Mapping of parallel applications on the network topology is becoming increasingly important on large supercomputers. Topology aware mapping can reduce the hops traveled by mess...
Abhinav Bhatele, Laxmikant V. Kalé
161
Voted
IPSN
2005
Springer
16 years 11 days ago
Sensing capacity for discrete sensor network applications
We bound the number of sensors required to achieve a desired level of sensing accuracy in a discrete sensor network application (e.g. distributed detection). We model the state of...
Yaron Rachlin, Rohit Negi, Pradeep K. Khosla
CORR
2010
Springer
99views Education» more  CORR 2010»
15 years 7 months ago
On Equivalence Between Network Topologies
One major open problem in network coding is to characterize the capacity region of a general multi-source multi-demand network. There are some existing computational tools for boun...
Michelle Effros, Tracey Ho, Shirin Jalali
224
Voted
WIOPT
2010
IEEE
15 years 5 months ago
Lifetime optimization for wireless sensor networks with correlated data gathering
—The nodes in wireless sensor networks often collect correlated measurements. Not taking into account this information redundancy is detrimental to the network lifetime, since co...
Nashat Abughalieh, Yann-Aël Le Borgne, Kris S...
STOC
2010
ACM
189views Algorithms» more  STOC 2010»
16 years 4 months ago
Near-optimal extractors against quantum storage
We give near-optimal constructions of extractors secure against quantum bounded-storage adversaries. One instantiation gives the first such extractor to achieve an output length (...
Anindya De and Thomas Vidick