Sciweavers

1576 search results - page 89 / 316
» Properties of Synthetic Optimization Problems
Sort
View
COCOS
2003
Springer
148views Optimization» more  COCOS 2003»
14 years 3 months ago
Convex Programming Methods for Global Optimization
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
John N. Hooker
PAKDD
2010
ACM
134views Data Mining» more  PAKDD 2010»
14 years 4 hour ago
A Robust Seedless Algorithm for Correlation Clustering
Abstract. Finding correlation clusters in the arbitrary subspaces of highdimensional data is an important and a challenging research problem. The current state-of-the-art correlati...
Mohammad S. Aziz, Chandan K. Reddy
ICIAP
2007
ACM
13 years 11 months ago
A New Stereo Algorithm Integrating Luminance, Gradient and Segmentation Informations in a Belief-Propagation Framework
The paper deals with the design and implementation of a stereo algorithm. Disparity map is formulated as a Markov Random Field with a new smoothness constraint depending not only ...
Nello Balossino, Maurizio Lucenteforte, Luca Piova...
NIPS
2003
13 years 11 months ago
Online Passive-Aggressive Algorithms
We present a family of margin based online learning algorithms for various prediction tasks. In particular we derive and analyze algorithms for binary and multiclass categorizatio...
Shai Shalev-Shwartz, Koby Crammer, Ofer Dekel, Yor...
IJCV
1998
157views more  IJCV 1998»
13 years 9 months ago
Stereo Matching with Nonlinear Diffusion
One of the central problems in stereo matching (and other image registration tasks) is the selection of optimal window sizes for comparing image regions. This paper addresses this ...
Daniel Scharstein, Richard Szeliski