7930 search results - page 628 / 1586 » Greedy in Approximation Algorithms |
143
click to vote
ICASSP
2011
IEEE
14 years 11 months ago
2011
IEEE
Finding the least squares (LS) solution s to a system of linear equations Hs = y where H, y are given and s is a vector of binary variables, is a well known NP-hard problem. In th...
152
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— We consider the problem of designing controllers for spatially-varying interconnected systems distributed in one spatial dimension. The matrix structure of such systems can be ...
166
click to vote
GLOBECOM
2006
IEEE
16 years 1 months ago
2006
IEEE
In this letter we develop an expression for the approximate throughput guarantee violation probability (TGVP) for users in time-slotted networks for any scheduling algorithm with ...
214
click to vote
SPAA
1998
ACM
15 years 10 months ago
1998
ACM
In this paper we develop models for and analyze several randomized work stealing algorithms in a dynamic setting. Our models represent the limiting behavior of systems as the numb...
230
click to vote
COMPGEOM
2005
ACM
15 years 9 months ago
2005
ACM
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...