727 search results - page 108 / 146 » Private approximation of search problems |
JMLR
2010
13 years 4 months ago
2010
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...
CEC
2010
IEEE
13 years 1 months ago
2010
IEEE
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...
MIA
2010
13 years 4 months ago
2010
We propose a framework for intensity-based registration of images by linear transformations, based on a discrete Markov Random Field (MRF) formulation. Here, the challenge arises ...
ALENEX
2009
13 years 7 months ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
ICML
2006
IEEE
14 years 10 months ago
2006
IEEE
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...