934 search results - page 74 / 187 » Quantum Algorithmic Entropy |
APPROX
2008
Springer
13 years 11 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
STOC
2004
ACM
14 years 9 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
We consider support vector machines for binary classification. As opposed to most approaches we use the number of support vectors (the "L0 norm") as a regularizing term ...
ICMCS
2007
IEEE
14 years 3 months ago
2007
IEEE
Correlated steganography considers the case in which the cover Work is chosen to be correlated with the covert message that is to be hidden. The advantage of this is that, at leas...
JMLR
2012
11 years 11 months ago
2012
Many real-world problems are inherently hierarchically structured. The use of this structure in an agent’s policy may well be the key to improved scalability and higher performa...