Sciweavers

56 search results - page 7 / 12
» Axiomatic First-Order Probability
Sort
View
APAL
2008
92views more  APAL 2008»
13 years 7 months ago
The complexity of random ordered structures
We show that for random bit strings, Up(n), with probability, p = 1 2 , the firstorder quantifier depth D(Up(n)) needed to distinguish non-isomorphic structures is (lg lg n), with...
Joel H. Spencer, Katherine St. John
EUSFLAT
2007
147views Fuzzy Logic» more  EUSFLAT 2007»
13 years 9 months ago
Various Representations and Algebraic Structure of Linear Imprecision Indices
The paper is devoted to the investigation of imprecision indices, introduced in [7]. They are used for evaluation of uncertainty (or more exactly imprecision), which is contained ...
Alexander E. Lepskiy, Andrey G. Bronevich
IANDC
2011
119views more  IANDC 2011»
13 years 2 months ago
Quantitative Kleene coalgebras
We present a systematic way to generate (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of quantitative ...
Alexandra Silva, Filippo Bonchi, Marcello M. Bonsa...
AAAI
2000
13 years 8 months ago
Multivariate Clustering by Dynamics
We present a Bayesian clustering algorithm for multivariate time series. A clustering is regarded as a probabilistic model in which the unknown auto-correlation structure of a tim...
Marco Ramoni, Paola Sebastiani, Paul R. Cohen
ICASSP
2009
IEEE
13 years 5 months ago
Volterra series for analyzing MLP based phoneme posterior estimator
We present a framework to apply Volterra series to analyze multilayered perceptrons trained to estimate the posterior probabilities of phonemes in automatic speech recognition. Th...
Joel Pinto, Garimella S. V. S. Sivaram, Hynek Herm...