Sciweavers

2520 search results - page 21 / 504
» The complexity of approximating entropy
Sort
View
COLT
2006
Springer
14 years 1 months ago
Unifying Divergence Minimization and Statistical Inference Via Convex Duality
Abstract. In this paper we unify divergence minimization and statistical inference by means of convex duality. In the process of doing so, we prove that the dual of approximate max...
Yasemin Altun, Alexander J. Smola
CVPR
2003
IEEE
14 years 11 months ago
An Efficient Approach to Learning Inhomogeneous Gibbs Model
Inhomogeneous Gibbs model (IGM) [4] is an effective maximum entropy model in characterizing complex highdimensional distributions. However, its training process is so slow that th...
Ziqiang Liu, Hong Chen, Heung-Yeung Shum
PKC
2009
Springer
102views Cryptology» more  PKC 2009»
14 years 10 months ago
A Practical Key Recovery Attack on Basic TCHo
TCHo is a public key encryption scheme based on a stream cipher component, which is particular suitable for low cost devices like RFIDs. In its basic version, TCHo offers no IND-CC...
Mathias Herrmann, Gregor Leander
SODA
2010
ACM
157views Algorithms» more  SODA 2010»
14 years 7 months ago
Testing monotone high-dimensional distributions
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
Ronitt Rubinfeld, Rocco A. Servedio
CORR
2007
Springer
135views Education» more  CORR 2007»
13 years 9 months ago
Detailed Network Measurements Using Sparse Graph Counters: The Theory
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
Yi Lu, Andrea Montanari, Balaji Prabhakar