Sciweavers

374 search results - page 58 / 75
» sum 2010
Sort
View
MICS
2010
102views more  MICS 2010»
13 years 8 months ago
On Conditional Covering Problem
The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...
Balasubramanian Sivan, S. Harini, C. Pandu Rangan
NECO
2010
136views more  NECO 2010»
13 years 8 months ago
Learning to Represent Spatial Transformations with Factored Higher-Order Boltzmann Machines
To allow the hidden units of a restricted Boltzmann machine to model the transformation between two successive images, Memisevic and Hinton (2007) introduced three-way multiplicat...
Roland Memisevic, Geoffrey E. Hinton
PKDD
2010
Springer
184views Data Mining» more  PKDD 2010»
13 years 8 months ago
Shift-Invariant Grouped Multi-task Learning for Gaussian Processes
Multi-task learning leverages shared information among data sets to improve the learning performance of individual tasks. The paper applies this framework for data where each task ...
Yuyang Wang, Roni Khardon, Pavlos Protopapas
PKDD
2010
Springer
148views Data Mining» more  PKDD 2010»
13 years 8 months ago
Exploiting Causal Independence in Markov Logic Networks: Combining Undirected and Directed Models
Abstract. A new method is proposed for compiling causal independencies into Markov logic networks (MLNs). An MLN can be viewed as compactly representing a factorization of a joint ...
Sriraam Natarajan, Tushar Khot, Daniel Lowd, Prasa...
SIAMSC
2010
165views more  SIAMSC 2010»
13 years 8 months ago
Algebraic Multigrid for Markov Chains
Abstract. An algebraic multigrid (AMG) method is presented for the calculation of the stationary probability vector of an irreducible Markov chain. The method is based on standard ...
Hans De Sterck, Thomas A. Manteuffel, Stephen F. M...