19 search results - page 3 / 4 » Sharper Upper and Lower Bounds for an Approximation Scheme f... |
SCN
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Span programs provide a linear algebraic model of computation. Monotone span programs (MSP) correspond to linear secret sharing schemes. This paper studies the properties...
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
SIAMCOMP
2002
13 years 5 months ago
2002
We consider the problem of maintaining aggregates and statistics over data streams, with respect to the last N data elements seen so far. We refer to this model as the sliding wind...
TIT
2008
13 years 5 months ago
2008
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We investigate the extent to which price updates can increase the revenue of a seller with little prior information on demand. We study prior-free revenue maximization for a selle...