429 search results - page 46 / 86 » Improved Algorithms for the k Maximum-Sums Problems |
SODA
2012
ACM
13 years 9 days ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
118
click to vote
SIAMSC
2011
14 years 4 months ago
2011
We develop an algebraic multigrid (AMG) setup scheme based on the bootstrap framework for multiscale scientific computation. Our approach uses a weighted least squares definition...
TCOM
2008
14 years 9 months ago
2008
Abstract--This paper addresses the problem of joint optimization of transmit beamforming and space-frequency (SF) coding for MIMO-OFDM systems with spatial correlation feedback in ...
DAC
1996
ACM
15 years 2 months ago
1996
ACM
In this paper, we study the problem of decomposing gates in fanin-unbounded or K-bounded networks such that the K-input LUT mapping solutions computed by a depthoptimal mapper hav...
STOC
2007
ACM
15 years 10 months ago
2007
ACM
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...