177 search results - page 23 / 36 » Semidefinite Programming Relaxations for the Quadratic Assig... |
AAAI
2011
12 years 9 months ago
2011
In this paper, we propose a novel method to select the most informative subset of features, which has little redundancy and very strong discriminating power. Our proposed approach...
AAAI
2006
13 years 10 months ago
2006
One of the well known risks of large margin training methods, such as boosting and support vector machines (SVMs), is their sensitivity to outliers. These risks are normally mitig...
CP
2007
Springer
14 years 3 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
STOC
2006
ACM
14 years 9 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
AAAI
2006
13 years 10 months ago
2006
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...