4544 search results - page 602 / 909 » Reinforcement Learning with Time |
179
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
Given a large, real graph, how can we generate a synthetic graph that matches its properties, i.e., it has similar degree distribution, similar (small) diameter, similar spectrum,...
185
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
143
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
We present a unified model of what was traditionally viewed as two separate tasks: data association and intensity tracking of multiple topics over time. In the data association pa...
174
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
Semi-naive Bayesian classifiers seek to retain the numerous strengths of naive Bayes while reducing error by weakening the attribute independence assumption. Backwards Sequential ...
164
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
In genomic sequence analysis tasks like splice site recognition or promoter identification, large amounts of training sequences are available, and indeed needed to achieve suffici...