6568 search results - page 280 / 1314 » Reducing the Complexity of Reductions |
199
click to vote
TC
2010
15 years 1 months ago
2010
In this paper, we define and study a new class of capacity planning models called MAP queueing networks. MAP queueing networks provide the first analytical methodology to describe ...
162
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We show that a large fraction of the data-structure lower bounds known today in fact follow by reduction from the communication complexity of lopsided (asymmetric) set disjointness...
156
click to vote
ICIP
2001
IEEE
16 years 8 months ago
2001
IEEE
This paper proposes several low complexity algorithmic modifications to the SPIHT (Set Partitioning in Hierarchical Trees) image coding method of [3]. The modifications exploit un...
176
click to vote
DCC
1993
IEEE
15 years 11 months ago
1993
IEEE
Two new algorithms for performing arithmetic coding without employing multiplication are presented. The first algorithm, suitable for an alphabet of arbitrary size, reduces the wo...
190
click to vote
SAC
2004
ACM
16 years 5 days ago
2004
ACM
The selection of a cost-minimizing combination of hardware and network components that satisfy organizational requirements is a complex design problem with multiple degrees of fre...