Sciweavers

5331 search results - page 768 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
ICML
2009
IEEE
16 years 7 months ago
Proximal regularization for online and batch learning
Many learning algorithms rely on the curvature (in particular, strong convexity) of regularized objective functions to provide good theoretical performance guarantees. In practice...
Chuong B. Do, Quoc V. Le, Chuan-Sheng Foo
SIGSOFT
2007
ACM
16 years 7 months ago
A framework for characterization and analysis of software system scalability
The term scalability appears frequently in computing literature, but it is a term that is poorly defined and poorly understood. The lack of a clear, consistent and systematic trea...
Leticia Duboc, David S. Rosenblum, Tony Wicks
ICIAP
2005
ACM
16 years 6 months ago
Greedy Algorithm for Local Contrast Enhancement of Images
Abstract. We present a technique that achieves local contrast enhancement by representing it as an optimization problem. For this, we first introduce a scalar objective function th...
Kartic Subr, Aditi Majumder, Sandy Irani
CVPR
2010
IEEE
16 years 2 months ago
Dense Non-rigid Surface Registration Using High-Order Graph Matching
In this paper, we propose a high-order graph matching formulation to address non-rigid surface matching. The singleton terms capture the geometric and appearance similarities (e.g...
Yun Zeng, Chaohui Wang, Yang Wang, Xianfeng Gu, Di...
PKDD
2009
Springer
174views Data Mining» more  PKDD 2009»
16 years 1 months ago
Active and Semi-supervised Data Domain Description
Data domain description techniques aim at deriving concise descriptions of objects belonging to a category of interest. For instance, the support vector domain description (SVDD) l...
Nico Görnitz, Marius Kloft, Ulf Brefeld