Sciweavers

2735 search results - page 195 / 547
» Comparing notions of randomness
Sort
View
UAI
2004
13 years 11 months ago
Convolutional Factor Graphs as Probabilistic Models
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. ...
Yongyi Mao, Frank R. Kschischang, Brendan J. Frey
NIPS
2003
13 years 11 months ago
Self-calibrating Probability Forecasting
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...
Vladimir Vovk, Glenn Shafer, Ilia Nouretdinov
SODA
1996
ACM
95views Algorithms» more  SODA 1996»
13 years 11 months ago
RNC Algorithms for the Uniform Generation of Combinatorial Structures
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...
Michele Zito, Ida Pu, Martyn Amos, Alan Gibbons
CEC
2010
IEEE
13 years 11 months ago
Evolutionary automated recognition and characterization of an individual's artistic style
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...
Taras Kowaliw, Jon McCormack, Alan Dorin
ENTCS
2008
120views more  ENTCS 2008»
13 years 10 months ago
Specifying and Executing Reactive Scenarios With Lutin
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...
Pascal Raymond, Yvan Roux, Erwan Jahier