225 search results - page 32 / 45 » Approximating Parameterized Convex Optimization Problems |
ICML
2004
IEEE
14 years 9 months ago
2004
IEEE
Markov networks are extensively used to model complex sequential, spatial, and relational interactions in fields as diverse as image processing, natural language analysis, and bio...
ISPD
1997
ACM
14 years 19 days ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
— We address a lifetime maximization problem for a single-hop wireless sensor network where multiple sensors encode and communicate their measurements of a Gaussian random source...
SIAMIS
2011
13 years 3 months ago
2011
Abstract. Many problems of low-level computer vision and image processing, such as denoising, deconvolution, tomographic reconstruction or superresolution, can be addressed by maxi...
ICIP
2006
IEEE
14 years 10 months ago
2006
IEEE
Traditional snakes, or active contours, are planar parametric curves. Their parameters are determined by optimizing the weighted sum of three energy terms: one depending on the dat...