Sciweavers

478 search results - page 9 / 96
» Improving probability bounds by optimization over subsets
Sort
View
ICMCS
2007
IEEE
180views Multimedia» more  ICMCS 2007»
13 years 7 months ago
Content-Based Image Categorization and Retrieval using Neural Networks
We propose a neural network based method for organizing images for content-based image retrieval. We use spectral histogram features, the histograms of filtered images to capture...
Yuhua Zhu, Xiuwen Liu, Washington Mio
CRYPTO
2005
Springer
94views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
Improved Security Analyses for CBC MACs
We present an improved bound on the advantage of any q-query adversary at distinguishing between the CBC MAC over a random n-bit permutation and a random function outputting n bit...
Mihir Bellare, Krzysztof Pietrzak, Phillip Rogaway
DCC
2011
IEEE
13 years 2 months ago
Collaboration in Distributed Hypothesis Testing with Quantized Prior Probabilities
The effect of quantization of prior probabilities in a collection of distributed Bayesian binary hypothesis testing problems over which the priors themselves vary is studied. In ...
Joong Bum Rhim, Lav R. Varshney, Vivek K. Goyal
ICDT
2009
ACM
166views Database» more  ICDT 2009»
14 years 8 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
CORR
2008
Springer
111views Education» more  CORR 2008»
13 years 6 months ago
Concave Programming Upper Bounds on the Capacity of 2-D Constraints
The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distribut...
Ido Tal, Ron M. Roth