2343 search results - page 102 / 469 » Visual-Concept Search Solved |
146
click to vote
NIPS
2003
15 years 5 months ago
2003
We describe a new approximation algorithm for solving partially observable MDPs. Our bounded policy iteration approach searches through the space of bounded-size, stochastic fini...
124
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We propose an authentication scheme where forgery (a.k.a. impersonation) seems infeasible without finding the prover's long-term private key. The latter is equivalen...
114
click to vote
JMLR
2006
15 years 4 months ago
2006
We show how the concave-convex procedure can be applied to transductive SVMs, which traditionally require solving a combinatorial search problem. This provides for the first time ...
121
click to vote
ECAI
2006
Springer
15 years 8 months ago
2006
Springer
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
126
click to vote
IJCAI
2007
15 years 6 months ago
2007
Caching, symmetries, and search with decomposition are powerful techniques for pruning the search space of constraint problems. In this paper we present an innovative way of effi...