Sciweavers

112 search results - page 20 / 23
» Rounds in Communication Complexity Revisited
Sort
View
GLOBECOM
2009
IEEE
15 years 4 months ago
A Decentralized Framework for Dynamic Downlink Base Station Cooperation
— Multiple Base Station (Multi-BS) cooperation has been considered as a promising mechanism to suppress cochannel interference and boost the capacity for cellular networks. Howev...
Sheng Zhou, Jie Gong, Zhisheng Niu, Yunjian Jia, P...
INFOCOM
2009
IEEE
15 years 4 months ago
Quantifying the Importance of Vantage Points Distribution in Internet Topology Measurements
—The topology of the Internet has been extensively studied in recent years, driving a need for increasingly complex measurement infrastructures. These measurements have produced ...
Yuval Shavitt, Udi Weinsberg
INFOCOM
2011
IEEE
14 years 28 days ago
Pricing-based spectrum access control in cognitive radio networks with random access
Abstract—Market-based mechanisms offer promising approaches for spectrum access in cognitive radio networks. In this paper, we focus on two market models, one with a monopoly pri...
Lei Yang, Hongseok Kim, Junshan Zhang, Mung Chiang...
SIGMETRICS
2008
ACM
181views Hardware» more  SIGMETRICS 2008»
14 years 9 months ago
Counter braids: a novel counter architecture for per-flow measurement
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
Yi Lu, Andrea Montanari, Balaji Prabhakar, Sarang ...
78
Voted
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 2 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen