Sciweavers

4007 search results - page 249 / 802
» Computation with imprecise probabilities
Sort
View
PE
2011
Springer
214views Optimization» more  PE 2011»
14 years 11 months ago
Time-bounded reachability in tree-structured QBDs by abstraction
Structured QBDs by Abstraction Daniel Klink, Anne Remke, Boudewijn R. Haverkort, Fellow, IEEE, and Joost-Pieter Katoen, Member, IEEE Computer Society —This paper studies quantita...
Daniel Klink, Anne Remke, Boudewijn R. Haverkort, ...
TNN
2011
104views more  TNN 2011»
14 years 11 months ago
Extended Input Space Support Vector Machine
—In some applications, the probability of error of a given classifier is too high for its practical application, but we are allowed to gather more independent test samples from ...
Ricardo Santiago-Mozos, Fernando Pérez-Cruz...
CVIU
2011
14 years 8 months ago
Graph attribute embedding via Riemannian submersion learning
In this paper, we tackle the problem of embedding a set of relational structures into a metric space for purposes of matching and categorisation. To this end, we view the problem ...
Haifeng Zhao, Antonio Robles-Kelly, Jun Zhou, Jian...
ATAL
2011
Springer
14 years 4 months ago
A model of norm emergence and innovation in language change
We analyze and extend a recently proposed model of linguistic diffusion in social networks, to analytically derive time to convergence, and to account for the innovation phase of...
Samarth Swarup, Andrea Apolloni, Zsuzsanna Fagyal
EDBT
2012
ACM
224views Database» more  EDBT 2012»
13 years 6 months ago
Aggregate queries on probabilistic record linkages
Record linkage analysis, which matches records referring to the same real world entities from different data sets, is an important task in data integration. Uncertainty often exi...
Ming Hua, Jian Pei