Sciweavers

732 search results - page 87 / 147
» Testing Geometric Convexity
Sort
View
MM
2010
ACM
169views Multimedia» more  MM 2010»
13 years 10 months ago
CO3 for ultra-fast and accurate interactive segmentation
This paper presents an interactive image segmentation framework which is ultra-fast and accurate. Our framework, termed "CO3", consists of three components: COupled repr...
Yibiao Zhao, Song Chun Zhu, Siwei Luo
SIAMSC
2010
141views more  SIAMSC 2010»
13 years 8 months ago
An Iterative Method for Edge-Preserving MAP Estimation When Data-Noise Is Poisson
In numerous applications of image processing, e.g. astronomical and medical imaging, data-noise is well-modeled by a Poisson distribution. This motivates the use of the negative-lo...
Johnathan M. Bardsley, John Goldes
ICML
1998
IEEE
14 years 11 months ago
Q2: Memory-Based Active Learning for Optimizing Noisy Continuous Functions
This paper introduces a new algorithm, Q2, foroptimizingthe expected output ofamultiinput noisy continuous function. Q2 is designed to need only a few experiments, it avoids stron...
Andrew W. Moore, Jeff G. Schneider, Justin A. Boya...
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
14 years 10 months ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu
STOC
2007
ACM
146views Algorithms» more  STOC 2007»
14 years 10 months ago
Playing games with approximation algorithms
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett