1277 search results - page 62 / 256 » Terminating Decision Algorithms Optimally |
154
click to vote
FOCS
2009
IEEE
16 years 28 days ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
245
click to vote
TOG
2012
13 years 8 months ago
2012
Using existing programming tools, writing high-performance image processing code requires sacrificing readability, portability, and modularity. We argue that this is a consequenc...
154
click to vote
SIAMSC
2010
15 years 4 months ago
2010
We propose a fast algorithm for solving the ℓ1-regularized minimization problem minx∈Rn µ x 1 + Ax − b 2 2 for recovering sparse solutions to an undetermined system of linea...
163
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
183
click to vote
EUC
2007
Springer
16 years 10 days ago
2007
Springer
Networked embedded systems present unique challenges for system designers composing distributed applications with dyanmic, real-time, and resilience requirements. We consider the ...