Sciweavers

56 search results - page 10 / 12
» A case for unlimited watchpoints
Sort
View
FOCS
2002
IEEE
14 years 16 days ago
A Constant-Factor Approximation Algorithm for the Multicommodity
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
Amit Kumar, Anupam Gupta, Tim Roughgarden
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 7 months ago
Broadcast Cooperation Strategies for Two Colocated Users
This work considers the problem of communication from a single transmitter, over a network with colocated users, through an independent block Rayleigh fading channel. The colocati...
Avi Steiner, Amichai Sanderovich, Shlomo Shamai
JGS
2006
113views more  JGS 2006»
13 years 7 months ago
Pattern based map comparisons
Map comparison techniques based on a pixel-by-pixel comparison are useful for many purposes, but fail to reveal important aspects of map similarities and differences. In contrast, ...
Roger White
CISS
2007
IEEE
14 years 1 months ago
Cooperation Strategies for Two Co-located receivers, with no CSI at the transmitter
— We study the case of a single transmitter, which communicates to two co-located users, through an independent block Rayleigh fading channel. The co-location nature of the users...
Amichai Sanderovich, Avi Steiner, Shlomo Shamai
SP
2006
IEEE
100views Security Privacy» more  SP 2006»
14 years 1 months ago
Fundamental Limits on the Anonymity Provided by the MIX Technique
The MIX technique forms the basis of many popular services that offer anonymity of communication in open and shared networks such as the Internet. In this paper, fundamental limit...
Dogan Kesdogan, Dakshi Agrawal, Dang Vinh Pham, Di...