Sciweavers

1718 search results - page 317 / 344
» Communicating more than nothing
Sort
View
STOC
2005
ACM
112views Algorithms» more  STOC 2005»
14 years 9 months ago
Covert two-party computation
We introduce the novel concept of covert two-party computation. Whereas ordinary secure two-party computation only guarantees that no more knowledge is leaked about the inputs of t...
Luis von Ahn, Nicholas J. Hopper, John Langford
SIGMOD
2008
ACM
139views Database» more  SIGMOD 2008»
14 years 9 months ago
Paths to stardom: calibrating the potential of a peer-based data management system
As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database...
Mihai Lupu, Beng Chin Ooi, Y. C. Tay
SIGMOD
2005
ACM
106views Database» more  SIGMOD 2005»
14 years 9 months ago
Tributaries and Deltas: Efficient and Robust Aggregation in Sensor Network Streams
Existing energy-efficient approaches to in-network aggregation in sensor networks can be classified into two categories, tree-based and multi-path-based, with each having unique s...
Amit Manjhi, Suman Nath, Phillip B. Gibbons
MOBISYS
2006
ACM
14 years 8 months ago
Fast handoff for seamless wireless mesh networks
This paper presents the architecture and protocols of SMesh, a completely transparent wireless mesh system that offers seamless, fast handoff, supporting VoIP and other real-time ...
Yair Amir, Claudiu Danilov, Michael Hilsdale, Ralu...
MOBIHOC
2008
ACM
14 years 8 months ago
An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
Christian Scheideler, Andréa W. Richa, Paol...