Sciweavers

4298 search results - page 292 / 860
» Measurable chromatic numbers
Sort
View
COCO
2010
Springer
153views Algorithms» more  COCO 2010»
15 years 10 months ago
Communication Complexity with Synchronized Clocks
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
Russell Impagliazzo, Ryan Williams
184
Voted
INFOCOM
2010
IEEE
15 years 5 months ago
Topology Control for Effective Interference Cancellation in Multi-User MIMO Networks
—In Multi-User MIMO networks, receivers decode multiple concurrent signals using Successive Interference Cancellation (SIC). With SIC a weak target signal can be deciphered in th...
Ece Gelal, Konstantinos Pelechrinis, Tae-Suk Kim, ...
IWDC
2005
Springer
156views Communications» more  IWDC 2005»
16 years 6 days ago
Labeling Schemes for Tree Representation
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, A...
IMC
2004
ACM
16 years 4 days ago
Availability, usage, and deployment characteristics of the domain name system
The Domain Name System (DNS) is a critical part of the Internet’s infrastructure, and is one of the few examples of a robust, highlyscalable, and operational distributed system....
Jeffrey Pang, James Hendricks, Aditya Akella, Robe...
IMC
2003
ACM
15 years 12 months ago
Bitmap algorithms for counting active flows on high speed links
—This paper presents a family of bitmap algorithms that address the problem of counting the number of distinct header patterns (flows) seen on a high-speed link. Such counting c...
Cristian Estan, George Varghese, Mike Fisk