Sciweavers

11160 search results - page 2007 / 2232
» Incompleteness in a General Setting
Sort
View
FOCS
2006
IEEE
15 years 10 months ago
Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority
Secret sharing and multiparty computation (also called “secure function evaluation”) are fundamental primitives in modern cryptography, allowing a group of mutually distrustfu...
Michael Ben-Or, Claude Crépeau, Daniel Gott...
GLOBECOM
2006
IEEE
15 years 10 months ago
Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
Po-Chiang Lin, Tsungnan Lin, Hsinping Wang
GLOBECOM
2006
IEEE
15 years 10 months ago
Efficient Approximations for Call Admission Control Performance Evaluations in Multi-Service Networks
—Several dynamic call admission control (CAC) schemes for cellular networks have been proposed in the literature to reserve resources adaptively to provide the desired quality of...
Emre A. Yavuz, Victor C. M. Leung
GLVLSI
2006
IEEE
152views VLSI» more  GLVLSI 2006»
15 years 10 months ago
2 Gbps SerDes design based on IBM Cu-11 (130nm) standard cell technology
This paper introduces a standard cell based design for a Serializer and Deserializer (SerDes) communication link. The proposed design is area, power and design time efficient as c...
Rashed Zafar Bhatti, Monty Denneau, Jeff Draper
ICDCS
2006
IEEE
15 years 10 months ago
Greedy is Good: On Service Tree Placement for In-Network Stream Processing
This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, whe...
Zoë Abrams, Jie Liu
« Prev « First page 2007 / 2232 Last » Next »