Sciweavers

5374 search results - page 1073 / 1075
» The induction of communication protocols
Sort
View
IANDC
2011
129views more  IANDC 2011»
14 years 4 months ago
Rigid tree automata and applications
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
Florent Jacquemard, Francis Klay, Camille Vacher
96
Voted
CORR
2010
Springer
105views Education» more  CORR 2010»
14 years 4 months ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...
MTA
2011
220views Hardware» more  MTA 2011»
14 years 4 months ago
Modeling, simulation, and practice of floor control for synchronous and ubiquitous collaboration
: With the advances in a variety of software/hardware technologies and wireless networking, there is coming a need for ubiquitous collaboration which allows people to access inform...
Kangseok Kim, Geoffrey C. Fox
WINET
2011
14 years 4 months ago
Sleep scheduling with expected common coverage in wireless sensor networks
Sleep scheduling, which is putting some sensor nodes into sleep mode without harming network functionality, is a common method to reduce energy consumption in dense wireless sensor...
Eyuphan Bulut, Ibrahim Korpeoglu
HOTNETS
2010
14 years 4 months ago
Listen (on the frequency domain) before you talk
Conventional WiFi networks perform channel contention in time domain. This is known to be wasteful because the channel is forced to remain idle, while all contending nodes are bac...
Souvik Sen, Romit Roy Choudhury, Srihari Nelakudit...
« Prev « First page 1073 / 1075 Last » Next »