Sciweavers

501 search results - page 50 / 101
» Communication Lower Bounds Using Dual Polynomials
Sort
View
MP
2007
95views more  MP 2007»
13 years 8 months ago
Smoothed analysis of integer programming
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
Heiko Röglin, Berthold Vöcking
ESA
2010
Springer
197views Algorithms» more  ESA 2010»
13 years 6 months ago
How to Allocate Goods in an Online Market?
Abstract. We study an online version of Fisher's linear case market. In this market there are m buyers and a set of n dividable goods to be allocated to the buyers. The utilit...
Yossi Azar, Niv Buchbinder, Kamal Jain
ASYNC
1997
IEEE
83views Hardware» more  ASYNC 1997»
14 years 13 days ago
Response Time Properties of Some Asynchronous Circuits
Wediscuss response timeproperties of linear arrays and tree-like arrays of cells with various handshake communication behaviours. The response times of a networkare the delays bet...
Jo C. Ebergen, Robert Berks
COCO
2005
Springer
110views Algorithms» more  COCO 2005»
14 years 2 months ago
Prior Entanglement, Message Compression and Privacy in Quantum Communication
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
MOBIHOC
2012
ACM
11 years 11 months ago
Throughput of rateless codes over broadcast erasure channels
In this paper, we characterize the throughput of a broadcast network with n receivers using rateless codes with block size K. We assume that the underlying channel is a Markov mod...
Yang Yang, Ness B. Shroff