Sciweavers

1576 search results - page 90 / 316
» Properties of Synthetic Optimization Problems
Sort
View
ICML
2006
IEEE
14 years 11 months ago
Quadratic programming relaxations for metric labeling and Markov random field MAP estimation
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
Pradeep D. Ravikumar, John D. Lafferty
FLAIRS
2007
14 years 11 days ago
A Distance-Based Over-Sampling Method for Learning from Imbalanced Data Sets
Many real-world domains present the problem of imbalanced data sets, where examples of one classes significantly outnumber examples of other classes. This makes learning difficu...
Jorge de la Calleja, Olac Fuentes
CORR
2010
Springer
228views Education» more  CORR 2010»
13 years 8 months ago
Sparse Inverse Covariance Selection via Alternating Linearization Methods
Gaussian graphical models are of great interest in statistical learning. Because the conditional independencies between different nodes correspond to zero entries in the inverse c...
Katya Scheinberg, Shiqian Ma, Donald Goldfarb
ECCV
2004
Springer
14 years 12 months ago
Shape and View Independent Reflectance Map from Multiple Views
We consider the problem of estimating the 3D shape and reflectance properties of an object made of a single material from a calibrated set of multiple views. To model reflectance, ...
Tianli Yu, Ning Xu, Narendra Ahuja
KDD
2008
ACM
243views Data Mining» more  KDD 2008»
14 years 10 months ago
Permu-pattern: discovery of mutable permutation patterns with proximity constraint
Pattern discovery in sequences is an important problem in many applications, especially in computational biology and text mining. However, due to the noisy nature of data, the tra...
Meng Hu, Jiong Yang, Wei Su