519 search results - page 45 / 104 » A New Approach to Strongly Polynomial Linear Programming |
102
click to vote
AIPS
2008
15 years 3 months ago
2008
High dimensionality of belief space in DEC-POMDPs is one of the major causes that makes the optimal joint policy computation intractable. The belief state for a given agent is a p...
EVOW
2003
Springer
15 years 6 months ago
2003
Springer
This paper describes a domain independent approach to the use of genetic programming for object detection problems. Rather than using raw pixels or high level domain specific feat...
143
click to vote
JMLR
2012
13 years 3 months ago
2012
Metric and kernel learning arise in several machine learning applications. However, most existing metric learning algorithms are limited to learning metrics over low-dimensional d...
142
click to vote
PEPM
1995
ACM
15 years 5 months ago
1995
ACM
This paper concerns a method for approximating the possible “shapes” that heap-allocated structures in a program can take on. We present a new approach to finding solutions t...
106
click to vote
FOCS
2006
IEEE
15 years 7 months ago
2006
IEEE
Learning an unknown halfspace (also called a perceptron) from labeled examples is one of the classic problems in machine learning. In the noise-free case, when a halfspace consist...