7930 search results - page 153 / 1586 » Greedy in Approximation Algorithms |
153
click to vote
IPL
2011
15 years 1 months ago
2011
The segment minimization problem consists of representing an integer matrix as the sum of the fewest number of integer matrices each of which have the property that the non-zeroes...
146
click to vote
ICCS
2009
Springer
16 years 29 days ago
2009
Springer
Recent years have seen growth in the number of algorithms designed to solve challenging simulation-based nonlinear optimization problems. One such algorithm is the Trust-Region Par...
177
click to vote
JCSS
2010
15 years 4 months ago
2010
We develop an algorithmically useful refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This characterization ...
182
click to vote
SSDBM
2007
IEEE
16 years 20 days ago
2007
IEEE
We present a fast algorithm for computing approximate quantiles in high speed data streams with deterministic error bounds. For data streams of size N where N is unknown in advanc...
164
click to vote
FOCS
2005
IEEE
16 years 11 hour ago
2005
IEEE
We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1 − O(1/ log n), satisfies a constant fraction of constraints, wher...