67 search results - page 13 / 14 » Solving MAX-r-SAT Above a Tight Lower Bound |
EDBT
2004
ACM
14 years 5 months ago
2004
ACM
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
DATAMINE
2006
13 years 5 months ago
2006
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...
INFOCOM
2010
IEEE
13 years 4 months ago
2010
IEEE
—The delivery of latency sensitive packets is a crucial issue in real time applications of communication networks. Such packets often have a firm deadline and a packet becomes u...
ASIACRYPT
2009
Springer
14 years 2 days ago
2009
Springer
Multi-party secure computations are general important procedures to compute any function while keeping the security of private inputs. In this work we ask whether preprocessing can...
INFOCOM
2005
IEEE
13 years 11 months ago
2005
IEEE
— We consider the problem of scheduling multiple users sharing a time-varying wireless channel. (As an example, this is a model of scheduling in 3G wireless technologies, such as...