Sciweavers

3991 search results - page 107 / 799
» Bounding homogeneous models
Sort
View
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
14 years 2 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman
ASIACRYPT
2000
Springer
14 years 10 days ago
A Note on Security Proofs in the Generic Model
A discrete-logarithm algorithm is called generic if it does not exploit the specific representation of the cyclic group for which it is supposed to compute discrete logarithms. Su...
Marc Fischlin
INFOCOM
2012
IEEE
11 years 10 months ago
Maximizing capacity with power control under physical interference model in duplex mode
—This paper addresses the joint selection and power assignment of a largest set of given links which can communicate successfully at the same time under the physical interference...
Peng-Jun Wan, Dechang Chen, Guojun Dai, Zhu Wang, ...
INFOCOM
2005
IEEE
14 years 1 months ago
Bounding the power rate function of wireless ad hoc networks
Abstract— Given a wireless ad hoc network and an endto-end traffic pattern, the power rate function refers to the minimum total power required to support different throughput un...
Yunnan Wu, Qian Zhang, Wenwu Zhu, Sun-Yuan Kung
MASCOTS
2007
13 years 9 months ago
Distance Reduction in Mobile Wireless Communication: Lower Bound Analysis and Practical Attainment
— The transmission energy required for a wireless communication increases superlinearly with the communication distance. In a mobile wireless network, nodal movement can be explo...
Yu Dong, Wing-Kai Hon, David K. Y. Yau, Jren-Chit ...