17760 search results - page 3509 / 3552 » A Generalization of the Massey-Ding Algorithm |
NETWORKS
2010
13 years 6 months ago
2010
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
PASTE
2010
ACM
13 years 6 months ago
2010
ACM
Monitoring or profiling programs provides us with an understanding for its further improvement and analysis. Typically, for monitoring or profiling, the program is instrumented ...
PKDD
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. The eigenspectrum of a graph Laplacian encodes smoothness information over the graph. A natural approach to learning involves transforming the spectrum of a graph Laplaci...
PKDD
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. One of the key problems in model-based reinforcement learning is balancing exploration and exploitation. Another is learning and acting in large relational domains, in wh...
PKDD
2010
Springer
13 years 6 months ago
2010
Springer
In this paper we propose a Bayesian model for multi-task feature selection. This model is based on a generalized spike and slab sparse prior distribution that enforces the selectio...