110 search results - page 17 / 22 » Automatic Generator of Minimal Problem Solvers |
248
Voted
EMNLP
2011
14 years 7 months ago
2011
We propose a general method to watermark and probabilistically identify the structured outputs of machine learning algorithms. Our method is robust to local editing operations and...
193
Voted
CP
2005
Springer
16 years 29 days ago
2005
Springer
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
216
click to vote
COMPUTING
2004
15 years 7 months ago
2004
The presented image registration method uses a regularized gradient flow to correlate the intensities in two images. Thereby, an energy functional is successively minimized by des...
205
Voted
IMCSIT
2010
15 years 5 months ago
2010
The portfolio optimization problem is modeled as a mean-risk bicriteria optimization problem where the expected return is maximized and some (scalar) risk measure is minimized. In ...
213
Voted
ICDM
2003
IEEE
16 years 21 days ago
2003
IEEE
Learning Bayesian network structure from large-scale data sets, without any expertspecified ordering of variables, remains a difficult problem. We propose systematic improvements ...