Sciweavers

384 search results - page 34 / 77
» Eliciting properties of probability distributions
Sort
View
ICDCS
2005
IEEE
14 years 3 months ago
Equational Approach to Formal Analysis of TLS
TLS has been formally analyzed with the OTS/CafeOBJ method. In the method, distributed systems are modeled as transition systems, which are written in terms of equations, and it i...
Kazuhiro Ogata, Kokichi Futatsugi
COLT
2008
Springer
13 years 11 months ago
Finding Metric Structure in Information Theoretic Clustering
We study the problem of clustering discrete probability distributions with respect to the Kullback-Leibler (KL) divergence. This problem arises naturally in many applications. Our...
Kamalika Chaudhuri, Andrew McGregor
TR
2010
128views Hardware» more  TR 2010»
13 years 4 months ago
Strategy for Planning Accelerated Life Tests With Small Sample Sizes
Previous work on planning accelerated life tests has been based on large-sample approximations to evaluate test plan properties. In this paper, we use more accurate simulation met...
Haiming Ma, William Q. Meeker
ISIPTA
2003
IEEE
14 years 3 months ago
Computing Lower Expectations with Kuznetsov's Independence Condition
Kuznetsov’s condition says that variables X and Y are independent when any product of bounded functions f(X) and g(Y) behaves in a certain way: the interval of expected values E...
Fabio Gagliardi Cozman
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
13 years 12 months ago
Learning Random Monotone DNF
We give an algorithm that with high probability properly learns random monotone DNF with t(n) terms of length log t(n) under the uniform distribution on the Boolean cube {0, 1}n ....
Jeffrey C. Jackson, Homin K. Lee, Rocco A. Servedi...