501 search results - page 26 / 101 » Communication Lower Bounds Using Dual Polynomials |
106
Voted
ECCC
2010
15 years 2 months ago
2010
The deterministic space complexity of approximating the length of the longest increasing subsequence of a stream of N integers is known to be ( N). However, the randomized comple...
102
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract-- A green code attempts to minimize the total energy per-bit required to communicate across a noisy channel. The classical information-theoretic approach neglects the ener...
131
Voted
SIGMOD
2004
ACM
16 years 2 months ago
2004
ACM
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
119
Voted
AIPS
2007
15 years 5 months ago
2007
We introduce the Linear Resource Temporal Network (LRTN), which consists of activities that consume or produce a resource, subject to absolute and relative metric temporal constra...
103
Voted
EOR
2008
15 years 2 months ago
2008
The Linear Ordering Problem with Cumulative Costs is an NP-hard combinatorial optimization problem arising from an application in UMTS mobile-phone communication systems. This pap...