Sciweavers

368 search results - page 58 / 74
» Advanced Computing and Communications Research under NSF Sup...
Sort
View
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
14 years 15 days ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks
ROBOCOMM
2007
IEEE
14 years 2 months ago
A networked robot system for wireless network emulation
Abstract—A major barrier to advancing modern wireless networking research is the lack of an effective wireless network simulation platform that simultaneously offers high fideli...
Tzi-cker Chiueh, Rupa Krishnan, Pradipta De, Jui-H...
INFOCOM
1995
IEEE
14 years 13 hour ago
Analysis of One-Way Reservation Algorithms
Modern high speed networks and ATM networks in particular use resource reservation as a basic means of establishing communications. One-way on-the- y reservation is a method for...
Israel Cidon, Raphael Rom, Yuval Shavitt
TRIDENTCOM
2008
IEEE
14 years 2 months ago
The NTP experimental platform for heterogeneous wireless sensor networks
— This paper presents the NTP experimental platform for heterogeneous wireless sensor networks (WSN), which is built on the campus of National Tsing Hua University under the supp...
Sheng-Po Kuo, Chun-Yu Lin, Yueh-Feng Lee, Hua-Wei ...
CRYPTO
2005
Springer
96views Cryptology» more  CRYPTO 2005»
14 years 2 months ago
Privacy-Preserving Set Operations
In many important applications, a collection of mutually distrustful parties must perform private computation over multisets. Each party’s input to the function is his private i...
Lea Kissner, Dawn Xiaodong Song