Sciweavers

163 search results - page 18 / 33
» Representing Aggregators in Relational Probabilistic Models
Sort
View
IJAR
2008
99views more  IJAR 2008»
13 years 7 months ago
Unifying practical uncertainty representations. II: Clouds
There exist many tools for capturing imprecision in probabilistic representations. Among them are random sets, possibility distributions, probability intervals, and the more recen...
Sébastien Destercke, Didier Dubois, Eric Ch...
TSE
2011
134views more  TSE 2011»
13 years 2 months ago
Verifying the Evolution of Probability Distributions Governed by a DTMC
— We propose a new probabilistic temporal logic iLTL which captures properties of systems whose state can be represented by probability mass functions (pmf’s). Using iLTL, we c...
YoungMin Kwon, Gul A. Agha
BMVC
2000
13 years 8 months ago
Region-Based Object Recognition: Pruning Multiple Representations and Hypotheses
We address the problem of object recognition in computer vision. We represent each model and the scene in the form of Attributed Relational Graph. A multiple region representation...
Alireza Ahmadyfard, Josef Kittler
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
13 years 12 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer
ICML
2000
IEEE
14 years 8 months ago
Maximum Entropy Markov Models for Information Extraction and Segmentation
Hidden Markov models (HMMs) are a powerful probabilistic tool for modeling sequential data, and have been applied with success to many text-related tasks, such as part-of-speech t...
Andrew McCallum, Dayne Freitag, Fernando C. N. Per...