276 search results - page 38 / 56 » Fast Algorithm for Stochastic Tree Computation |
117
click to vote
FOCS
2003
IEEE
15 years 7 months ago
2003
IEEE
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
120
Voted
CVPR
2007
IEEE
16 years 4 months ago
2007
IEEE
In this paper we propose and evaluate an algorithm that learns a similarity measure for comparing never seen objects. The measure is learned from pairs of training images labeled ...
100
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
121
Voted
ECML
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Approximate Policy Iteration (API) is a reinforcement learning paradigm that is able to solve high-dimensional, continuous control problems. We propose to exploit API for...
235
Voted
NLP
2000
15 years 5 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...