Sciweavers

2743 search results - page 158 / 549
» Minimization of an M-convex Function
Sort
View
CORR
2000
Springer
116views Education» more  CORR 2000»
15 years 6 months ago
Algorithmic Statistics
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between a...
Péter Gács, John Tromp, Paul M. B. V...
SIAMSC
2010
215views more  SIAMSC 2010»
15 years 4 months ago
A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
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...
Zaiwen Wen, Wotao Yin, Donald Goldfarb, Yin Zhang
VLSID
1998
IEEE
105views VLSI» more  VLSID 1998»
15 years 10 months ago
Optimizing Logic Design Using Boolean Transforms
When a Boolean function is transformed by exclusiveOR with a suitably selected transform function, the new functzon is often synthesized wzth significantly reduced hardware. `I�...
Pramit Chavda, James Jacob, Vishwani D. Agrawal
CVPR
2005
IEEE
2143views Computer Vision» more  CVPR 2005»
17 years 2 months ago
Level Set Evolution Without Re-initialization: A New Variational Formulation
"In this paper, we present a new variational formulation for geometric active contours that forces the level set function to be close to a signed distance function, and theref...
Chunming Li, Chenyang Xu, Changfeng Gui, and Marti...
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
16 years 1 days ago
A new strategy for querying priced information
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
Ferdinando Cicalese, Eduardo Sany Laber