Sciweavers

1158 search results - page 150 / 232
» Approximation Algorithms for the Fixed-Topology Phylogenetic...
Sort
View
CIAC
2006
Springer
103views Algorithms» more  CIAC 2006»
15 years 10 months ago
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
Friedrich Eisenbrand, Edda Happ
COCOON
2008
Springer
15 years 8 months ago
The Computational Complexity of Link Building
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
Martin Olsen
COMPGEOM
2005
ACM
15 years 8 months ago
Learning smooth objects by probing
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...
Jean-Daniel Boissonnat, Leonidas J. Guibas, Steve ...
PKDD
2010
Springer
162views Data Mining» more  PKDD 2010»
15 years 4 months ago
Expectation Propagation for Bayesian Multi-task Feature Selection
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...
Daniel Hernández-Lobato, José Miguel...
NIPS
2001
15 years 7 months ago
Model-Free Least-Squares Policy Iteration
We propose a new approach to reinforcement learning which combines least squares function approximation with policy iteration. Our method is model-free and completely off policy. ...
Michail G. Lagoudakis, Ronald Parr