Sciweavers

4007 search results - page 187 / 802
» Computation with imprecise probabilities
Sort
View
BMVC
2000
15 years 5 months ago
Object Recognition using the Invariant Pixel-Set Signature
A new object recognition method, the Invariant Pixel Set Signature (IPSS), is introduced. Objects are represented with a probability density on the space of invariants computed fr...
Jiri Matas, J. Burianek, Josef Kittler
APNOMS
2006
Springer
15 years 7 months ago
An Enhanced RED-Based Scheme for Differentiated Loss Guarantees
Abstract. Recently, researchers have explored to provide a queue management scheme with differentiated loss guarantees for the future Internet. The Bounded Random Drop (BRD), known...
Jahwan Koo, Vladimir V. Shakhov, Hyunseung Choo
148
Voted
EATCS
1998
250views more  EATCS 1998»
15 years 3 months ago
Human Visual Perception and Kolmogorov Complexity: Revisited
Experiments have shown [2] that we can only memorize images up to a certain complexity level, after which, instead of memorizing the image itself, we, sort of, memorize a probabil...
Vladik Kreinovich, Luc Longpré
227
Voted
ICDT
2009
ACM
166views Database» more  ICDT 2009»
16 years 4 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
149
Voted
BMCBI
2010
123views more  BMCBI 2010»
15 years 4 months ago
Decoding HMMs using the k best paths: algorithms and applications
Background: Traditional algorithms for hidden Markov model decoding seek to maximize either the probability of a state path or the number of positions of a sequence assigned to th...
Daniel G. Brown 0001, Daniil Golod