The fooling pairs method is one of the standard methods for proving lower bounds for deterministic two-player communication complexity. We study fooling pairs in the context of randomized communication complexity. We show that every fooling pair induces far away distributions on transcripts of private-coin protocols. We use the above to conclude that the private-coin randomized ε-error communic...

Discriminative model combination is a new approach in the field of automatic speech recognition, which aims at an optimal integration of all given (acoustic and language) models into one log-linear posterior probability distribution. As opposed to the maximum entropy approach, the coefficients of the log-linear combination are optimized on training samples using discriminative methods to obtain...

Time-to-Failure analysis is a technique for predicting earthquakes in which a failure function is t to a time series of accumulated Benioo strain. Benioo strain is computed from regional seismicity in areas that may produce a large earthquake. We have tested the technique by tting two functions, a power-law proposed by Bufe & Varnes (1993) and a log-periodic function proposed by Sornette & Samm...

The pointer function of Göös, Pitassi and Watson [5] and its variants have recently been used to prove separation results among various measures of complexity such as deterministic, randomized and quantum query complexities, exact and approximate polynomial degrees, etc. In particular, the widest possible (quadratic) separations between deterministic and zero-error randomized query complexity, ...

In this study, we study the empirical Bayes estimation of the parameter of the exponential distribution. In the empirical Bayes procedure, we employ the non-parameter polynomial density estimator to the estimation of the unknown marginal probability density function, instead of estimating the unknown prior probability density function of the parameter. Empirical Bayes estimators are derived for...

We compare splitting methods for constructing survival trees that are used as a model of survival time based on covariates. A number of splitting criteria on the classification and regression tree (CART) have been proposed by various authors, and we compare nine criteria through simulations. Comparative studies have been restricted to criteria that suppose the survival model for each terminal n...

We have carried out rigorous experimental analysis of iterative randomized rounding algorithms for the packing integer problem in this project. We have explored techniques based on multidimensional Brownian motion in R. Let x′ be a fractional feasible solution that maximizes a linear objective function with respect to the set of constraints Ax ≤ 1, A ∈ {0,1}m×n. The independent randomized round...

The log-Gamma function is an important special function of mathematics, and its principal branch is required in many applications. We develop here the mathematics required to evaluate the principal branch to arbitrary precision, including a new bound for the error in Stirling’s asymptotic series. We conclude with a discussion of the implementation of the principal branch of the log-Gamma functi...

Weconsider sensor scheduling for state estimation of a scalar systemover a packet-delaying network. The current measurement data can be sent over a delay-free channel if the sensor uses larger communication energy; the data will be delayed for one time step if the sensor uses less communication energy. We consider a cost function consisting of a weighted average estimation error and a weighted ...