Sciweavers

4411 search results - page 305 / 883
» Communication Complexity and Its Applications
Sort
View
ACSC
2008
IEEE
16 years 1 months ago
Privacy preserving set intersection based on bilinear groups
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
Yingpeng Sang, Hong Shen
STOC
2007
ACM
98views Algorithms» more  STOC 2007»
16 years 7 months ago
Negative weights make adversaries stronger
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
Peter Høyer, Troy Lee, Robert Spalek
DATE
2008
IEEE
116views Hardware» more  DATE 2008»
16 years 1 months ago
A Virtual Prototype for Bluetooth over Ultra Wide Band System Level Design
The industry is merging two different Wireless Personal Area Networks (WPAN) technologies: Bluetooth (BT) and WiMedia Ultra Wide Band (UWB), into a single BT over UWB (BToUWB) spe...
Alexandre Lewicki, Javier del Prado Pavon, Jacky T...
ICC
2007
IEEE
170views Communications» more  ICC 2007»
16 years 1 months ago
Evaluating Techniques for Network Layer Independence in Cognitive Networks
— Cognitive networks are the latest progression of cognitive functionality into the networking stack, an effort which began with a layer one and two focus on cognitive radios, an...
Muthukumaran Pitchaimani, Benjamin J. Ewy, Joseph ...
ICC
2007
IEEE
16 years 1 months ago
A Novel Multistage Equalization Algorithm
— A novel equalization algorithm utilizing improper nature of the intersymbol interference (ISI) is introduced in this paper. We show that full exploitation of the available info...
Pei Xiao, Rolando A. Carrasco, Ian J. Wassell