Sciweavers

2816 search results - page 78 / 564
» Submodular function minimization
Sort
View
ICCV
2003
IEEE
16 years 2 months ago
Minimally-Supervised Classification using Multiple Observation Sets
This paper discusses building complex classifiers from a single labeled example and vast number of unlabeled observation sets, each derived from observation of a single process or...
Chris Stauffer
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 1 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
135
Voted
KDD
2007
ACM
132views Data Mining» more  KDD 2007»
16 years 28 days ago
A scalable modular convex solver for regularized risk minimization
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...
Choon Hui Teo, Alex J. Smola, S. V. N. Vishwanatha...
VLSID
2007
IEEE
209views VLSI» more  VLSID 2007»
16 years 27 days ago
Simultaneous Power Fluctuation and Average Power Minimization during Nano-CMOS Behavioral Synthesis
We present minimization methodologies and an algorithm for simultaneous scheduling, binding, and allocation for the reduction of total power and power fluctuation during behaviora...
Saraju P. Mohanty, Elias Kougianos
102
Voted
CVPR
2009
IEEE
15 years 7 months ago
Automatic facial landmark labeling with minimal supervision
Landmark labeling of training images is essential for many learning tasks in computer vision, such as object detection, tracking, and alignment. Image labeling is typically conduc...
Yan Tong, Xiaoming Liu 0002, Frederick W. Wheeler,...