Sciweavers

312 search results - page 31 / 63
» Protocols for Non-Deterministic Communication over Synchrono...
Sort
View
SIGCSE
2002
ACM
153views Education» more  SIGCSE 2002»
14 years 9 months ago
A communication library to support concurrent programming courses
A number of communication libraries have been written to support concurrent programming. For a variety of reasons, these libraries generally are not well-suited for use in undergr...
Steve Carr, Changpeng Fang, Tim Jozwowski, Jean Ma...
80
Voted
INTERACT
2003
14 years 11 months ago
Proximal Interactions: A Direct Manipulation Technique for Wireless Networking
As a number of networked digital devices are ubiquitously used, control of inter-device communications becomes a complicated task. People can no longer keep track of all the device...
Jun Rekimoto, Yuji Ayatsuka, Michimune Kohno, Haru...
100
Voted
INFOCOM
2011
IEEE
14 years 1 months ago
Experimental evaluation of optimal CSMA
Abstract—By ‘optimal CSMA’ we denote a promising approach to maximize throughput-based utility in wireless networks without message passing or synchronization among nodes. De...
Bruno Nardelli, Jinsung Lee, Kangwook Lee, Yung Yi...
GLOBECOM
2007
IEEE
15 years 4 months ago
Multi-Linked AODV Routing Protocol for Wireless Mesh Networks
Abstract— Nodes in multi-hop wireless networks, and specifically in ad-hoc and mesh networks, are being increasingly equipped with multiple wireless network interfaces (radios) o...
Asad Amir Pirzada, Ryan Wishart, Marius Portmann
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
15 years 2 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain