Sciweavers

3656 search results - page 181 / 732
» Compact Location Problems
Sort
View
ML
2007
ACM
15 years 5 months ago
Feature space perspectives for learning the kernel
In this paper, we continue our study of learning an optimal kernel in a prescribed convex set of kernels, [18]. We present a reformulation of this problem within a feature space e...
Charles A. Micchelli, Massimiliano Pontil
MST
2010
106views more  MST 2010»
15 years 4 months ago
Constrained-Path Labellings on Graphs of Bounded Clique-Width
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
Bruno Courcelle, Andrew Twigg
EC
2010
176views ECommerce» more  EC 2010»
15 years 3 months ago
Learning Factorizations in Estimation of Distribution Algorithms Using Affinity Propagation
Estimation of distribution algorithms (EDAs) that use marginal product model factorizations have been widely applied to a broad range of, mainly binary, optimization problems. In ...
Roberto Santana, Pedro Larrañaga, Jos&eacut...
CORR
2012
Springer
196views Education» more  CORR 2012»
14 years 1 months ago
PAC-Bayesian Policy Evaluation for Reinforcement Learning
Bayesian priors offer a compact yet general means of incorporating domain knowledge into many learning tasks. The correctness of the Bayesian analysis and inference, however, lar...
Mahdi Milani Fard, Joelle Pineau, Csaba Szepesv&aa...
PVLDB
2011
15 years 1 months ago
Hyper-local, directions-based ranking of places
Studies find that at least 20% of web queries have local intent; and the fraction of queries with local intent that originate from mobile properties may be twice as high. The eme...
Petros Venetis, Hector Gonzalez, Christian S. Jens...