2735 search results - page 195 / 547 » Comparing notions of randomness |
131
Voted
UAI
2004
15 years 4 months ago
2004
Based on a recent development in the area of error control coding, we introduce the notion of convolutional factor graphs (CFGs) as a new class of probabilistic graphical models. ...
133
Voted
NIPS
2003
15 years 4 months ago
2003
In the problem of probability forecasting the learner’s goal is to output, given a training set and a new object, a suitable probability measure on the possible values of the ne...
116
click to vote
SODA
1996
ACM
15 years 4 months ago
1996
ACM
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
92
Voted
CEC
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper, we introduce a new image database, consisting of examples of artists' work. Successful classification of this database suggests the capacity to automatically re...
116
Voted
ENTCS
2008
15 years 3 months ago
2008
This paper presents the language Lutin and its operational semantics. This language specifically targets the domain of reactive systems, where an execution is a (virtually) infini...