Sciweavers

686 search results - page 108 / 138
» Foundations for Bidirectional Programming
Sort
View
CORR
2008
Springer
159views Education» more  CORR 2008»
14 years 9 months ago
Compound Multiple Access Channels with Partial Cooperation
A two-user discrete memoryless compound multiple access channel with a common message and conferencing decoders is considered. The capacity region is characterized in the special ...
Osvaldo Simeone, Deniz Gündüz, H. Vincen...
CN
2006
145views more  CN 2006»
14 years 9 months ago
Understanding optimal data gathering in the energy and latency domains of a wireless sensor network
The problem of optimal data gathering in wireless sensor networks (WSNs) is addressed by means of optimization techniques. The goal of this work is to lay the foundations to devel...
Ugo Monaco, Francesca Cuomo, Tommaso Melodia, Fabi...
JCS
2008
124views more  JCS 2008»
14 years 9 months ago
Securing information flow via dynamic capture of dependencies
Although static systems for information flow security are well-studied, few works address runtime information flow monitoring. Runtime information flow control offers distinct adv...
Paritosh Shroff, Scott F. Smith, Mark Thober
DAM
2007
85views more  DAM 2007»
14 years 9 months ago
Testing primitivity on partial words
Primitive words, or strings over a finite alphabet that cannot be written as a power of another string, play an important role in numerous research areas including formal language...
Francine Blanchet-Sadri, Arundhati R. Anavekar
AIM
2000
14 years 9 months ago
Probabilistic Algorithms in Robotics
This article describes a methodology for programming robots known as probabilistic robotics. The probabilistic paradigm pays tribute to the inherent uncertainty in robot perceptio...
Sebastian Thrun