Sciweavers

1352 search results - page 72 / 271
» An algorithm for minimizing the Mumford-Shah functional
Sort
View
ICCV
2009
IEEE
15 years 12 hour ago
The Swap and Expansion Moves Revisited and Fused
Many solutions to computer vision and image processing problems involve the minimization of multi-label energy functions with up to K variables in each term. In the minimization pr...
Ido Leichter
DAC
1994
ACM
14 years 26 days ago
Partitioning Very Large Circuits Using Analytical Placement Techniques
A new partitioningapproach for very largecircuits is described. We demonstrate that applying a recently developed analytical placement algorithm, that pro ts from a linear objecti...
Bernhard M. Riess, Konrad Doll, Frank M. Johannes
PAMI
2011
13 years 3 months ago
Semi-Supervised Learning via Regularized Boosting Working on Multiple Semi-Supervised Assumptions
—Semi-supervised learning concerns the problem of learning in the presence of labeled and unlabeled data. Several boosting algorithms have been extended to semi-supervised learni...
Ke Chen, Shihai Wang
FOCS
2007
IEEE
14 years 3 months ago
Maximizing Non-Monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
Uriel Feige, Vahab S. Mirrokni, Jan Vondrák
TIT
2008
86views more  TIT 2008»
13 years 8 months ago
Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
Let P = {p(i)} be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, ...
Michael B. Baer