Sciweavers

699 search results - page 50 / 140
» The method of combinatorial telescoping
Sort
View
86
Voted
CPAIOR
2004
Springer
15 years 6 months ago
SIMPL: A System for Integrating Optimization Techniques
Abstract In recent years, the Constraint Programming (CP) and Operations Research (OR) communities have explored the advantages of combining CP and OR techniques to formulate and s...
Ionut D. Aron, John N. Hooker, Tallys H. Yunes
JMLR
2006
145views more  JMLR 2006»
15 years 15 days ago
Ensemble Pruning Via Semi-definite Programming
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
Yi Zhang 0006, Samuel Burer, W. Nick Street
140
Voted
JMLR
2010
149views more  JMLR 2010»
14 years 7 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
109
Voted
CVPR
2005
IEEE
16 years 2 months ago
Shape Regularized Active Contour Using Iterative Global Search and Local Optimization
Recently, nonlinear shape models have been shown to improve the robustness and flexibility of segmentation. In this paper, we propose Shape Regularized Active Contour (ShRAC) that...
Tianli Yu, Jiebo Luo, Narendra Ahuja
ICML
2009
IEEE
15 years 7 months ago
Non-monotonic feature selection
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
Zenglin Xu, Rong Jin, Jieping Ye, Michael R. Lyu, ...