Sciweavers

94 search results - page 12 / 19
» Markov Random Walk Representations with Continuous Distribut...
Sort
View
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
16 years 5 days ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori
ITA
2006
163views Communications» more  ITA 2006»
14 years 11 months ago
Graph fibrations, graph isomorphism, and PageRank
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...
Paolo Boldi, Violetta Lonati, Massimo Santini, Seb...
AAAI
2007
15 years 2 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
VALUETOOLS
2006
ACM
132views Hardware» more  VALUETOOLS 2006»
15 years 5 months ago
Zero-automatic networks
We continue the study of zero-automatic queues first introduced in [3]. These queues are characterized by a special buffering mechanism evolving like a random walk on some infi...
Thu-Ha Dao-Thi, Jean Mairesse
VLDB
2005
ACM
129views Database» more  VLDB 2005»
15 years 5 months ago
Sketching Streams Through the Net: Distributed Approximate Query Tracking
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
Graham Cormode, Minos N. Garofalakis