Sciweavers

779 search results - page 98 / 156
» Algorithms for the Sample Mean of Graphs
Sort
View
PKDD
2009
Springer
175views Data Mining» more  PKDD 2009»
15 years 11 months ago
Latent Dirichlet Bayesian Co-Clustering
Co-clustering has emerged as an important technique for mining contingency data matrices. However, almost all existing coclustering algorithms are hard partitioning, assigning each...
Pu Wang, Carlotta Domeniconi, Kathryn B. Laskey
AAAI
2007
15 years 6 months ago
Compact Spectral Bases for Value Function Approximation Using Kronecker Factorization
A new spectral approach to value function approximation has recently been proposed to automatically construct basis functions from samples. Global basis functions called proto-val...
Jeffrey Johns, Sridhar Mahadevan, Chang Wang
IJCAI
2007
15 years 5 months ago
Utile Distinctions for Relational Reinforcement Learning
We introduce an approach to autonomously creating state space abstractions for an online reinforcement learning agent using a relational representation. Our approach uses a tree-b...
William Dabney, Amy McGovern
PPSWR
2005
Springer
15 years 10 months ago
A Geospatial World Model for the Semantic Web
The Semantic Web is an endeavour aiming at enhancing Web data with meta-data and data processing, as well as processing methods specifying the “meaning” of such data and allowi...
François Bry, Bernhard Lorenz, Hans Jü...
PLDI
2011
ACM
14 years 7 months ago
Evaluating value-graph translation validation for LLVM
Translation validators are static analyzers that attempt to verify that program transformations preserve semantics. Normalizing translation validators do so by trying to match the...
Jean-Baptiste Tristan, Paul Govereau, Greg Morrise...