Sciweavers

26 search results - page 3 / 6
» Network Coding Theory Via Commutative Algebra
Sort
View
INFOCOM
2009
IEEE
13 years 12 months ago
Null Keys: Limiting Malicious Attacks Via Null Space Properties of Network Coding
—The performance of randomized network coding can suffer significantly when malicious nodes corrupt the content of the exchanged blocks. Previous work have introduced error corr...
Elias Kehdi, Baochun Li
IJRR
2006
145views more  IJRR 2006»
13 years 5 months ago
Coordinate-free Coverage in Sensor Networks with Controlled Boundaries via Homology
ABSTRACT. We introduce tools from computational homology to verify coverage in an idealized sensor network. Our methods are unique in that, while they are coordinate-free and assum...
V. de Silva, R. Ghrist
IJCINI
2007
125views more  IJCINI 2007»
13 years 5 months ago
A Unified Approach To Fractal Dimensions
The Cognitive Processes of Abstraction and Formal Inferences J. A. Anderson: A Brain-Like Computer for Cognitive Software Applications: the Resatz Brain Project L. Flax: Cognitive ...
Witold Kinsner
CCR
2010
203views more  CCR 2010»
13 years 5 months ago
Minimizing energy consumptions in wireless sensor networks via two-modal transmission
We present a sophisticated framework to systematically explore the temporal correlation in environmental monitoring wireless sensor networks. The presented framework optimizes los...
Yao Liang, Wei Peng
LATIN
2010
Springer
13 years 10 months ago
Prize-Collecting Steiner Networks via Iterative Rounding
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
MohammadTaghi Hajiaghayi, Arefeh A. Nasri