Results 1  10
of
1,726,324
On Certain Probabilities Equivalent to Wiener Measure,
"... L. Dubins, J. Feldman, M. Smorodinsky and B. Tsirelson gave an example of an equivalent measure Q on standard Wiener space such that each adapted QBrownian motion generates a strictly smaller ltration then the original one. The construction of this important example is complicated and technical. We ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
L. Dubins, J. Feldman, M. Smorodinsky and B. Tsirelson gave an example of an equivalent measure Q on standard Wiener space such that each adapted QBrownian motion generates a strictly smaller ltration then the original one. The construction of this important example is complicated and technical. We give a variant of their construction which di ers in some of the technicalities but essentially follows their ideas, hoping that some readers may nd our presentation easier to digest than the original papers. 1.
PROBABILITY INEQUALITIES FOR SUMS OF BOUNDED RANDOM VARIABLES
, 1962
"... Upper bounds are derived for the probability that the sum S of n independent random variables exceeds its mean ES by a positive number nt. It is assumed that the range of each summand of S is bounded or bounded above. The bounds for Pr(SES> nt) depend only on the endpoints of the ranges of the s ..."
Abstract

Cited by 2209 (2 self)
 Add to MetaCart
Upper bounds are derived for the probability that the sum S of n independent random variables exceeds its mean ES by a positive number nt. It is assumed that the range of each summand of S is bounded or bounded above. The bounds for Pr(SES> nt) depend only on the endpoints of the ranges
ON THE APPROXIMATION OF CERTAIN PROBABILITY MEASURES BY A SET OF POINTS
"... Abstract. In this paper we describe a framework for the comparison of a finite set of points with a probability measure if the latter belongs to a simple class. The measure of closeness chosen quantifies the degree of agreement obtained when a prescribed collection of test functions is simultaneousl ..."
Abstract
 Add to MetaCart
is simultaneously integrated with the respect to the given probability measure, and the set of points (identified with a set of point masses). No specific assumptions are made about the provenance of the point set, although our results have a clear application to certain Markov chain Monte Carlo integration
Efficient Coding of Integers for Certain Probability Distributions
, 2006
"... Abstract — Methods for prefix coding integers generally either consider specific distributions that decline more quickly than a power law (for Golomblike codes) or simultaneously consider all finiteentropy distributions (for universal codes). Particular powerlaw and similar distributions, however ..."
Abstract
 Add to MetaCart
known probability distributions using these codes and other prefix codes. One application of these nearoptimal codes is an improved representation of rational numbers. I.
Games with Incomplete Information Played by 'Bayesian' Players, IIII
 MANAGEMENT SCIENCE
, 1967
"... The paper develops a new theory for the analysis of games with incomplete information where the players are uncertain about some important parameters of the game situation, such as the payoff functions, the strategies available to various players, the information other players have about the game, e ..."
Abstract

Cited by 782 (2 self)
 Add to MetaCart
probability distributions derived from a certain "basic probability distribution " over the parameters unknown to the various players But later the theory is extended also to cases where the different players' subjective probability distributions fail to satisfy this consistency assumption
Random Early Detection Gateways for Congestion Avoidance.
 IEEELACM Transactions on Networking,
, 1993
"... AbstractThis paper presents Random Early Detection (RED) gateways for congestion avoidance in packetswitched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving at the gatewa ..."
Abstract

Cited by 2713 (31 self)
 Add to MetaCart
at the gateway or by setting a bit in packet headers. When the average queue size exceeds a preset threshold, the gateway drops or marks each arriving packet with a certain probability, where the exact probability is a function of the average queue size. RED gateways keep the average queue size low while
Approximate Statistical Tests for Comparing Supervised Classification Learning Algorithms
, 1998
"... This article reviews five approximate statistical tests for determining whether one learning algorithm outperforms another on a particular learning task. These tests are compared experimentally to determine their probability of incorrectly detecting a difference when no difference exists (type I err ..."
Abstract

Cited by 723 (8 self)
 Add to MetaCart
error). Two widely used statistical tests are shown to have high probability of type I error in certain situations and should never be used: a test for the difference of two proportions and a paireddifferences t test based on taking several random traintest splits. A third test, a paired
Guaranteed minimumrank solutions of linear matrix equations via nuclear norm minimization
, 2007
"... The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system identification and control, Euclidean embedding, and collaborative ..."
Abstract

Cited by 561 (20 self)
 Add to MetaCart
, and collaborative filtering. Although specific instances can often be solved with specialized algorithms, the general affine rank minimization problem is NPhard, because it contains vector cardinality minimization as a special case. In this paper, we show that if a certain restricted isometry property holds
Design of capacityapproaching irregular lowdensity paritycheck codes
 IEEE TRANS. INFORM. THEORY
, 2001
"... We design lowdensity paritycheck (LDPC) codes that perform at rates extremely close to the Shannon capacity. The codes are built from highly irregular bipartite graphs with carefully chosen degree patterns on both sides. Our theoretical analysis of the codes is based on [1]. Assuming that the unde ..."
Abstract

Cited by 589 (6 self)
 Add to MetaCart
that the underlying communication channel is symmetric, we prove that the probability densities at the message nodes of the graph possess a certain symmetry. Using this symmetry property we then show that, under the assumption of no cycles, the message densities always converge as the number of iterations tends
High confidence visual recognition of persons by a test of statistical independence
 IEEE TRANS. ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1993
"... A method for rapid visual recognition of personal identity is described, based on the failure of a statistical test of independence. The most unique phenotypic feature visible in a person’s face is the detailed texture of each eye’s iris: An estimate of its statistical complexity in a sample of the ..."
Abstract

Cited by 620 (8 self)
 Add to MetaCart
is passed almost certainly, whereas the same test is failed almost certainly when the compared codes originate from the same eye. The visible texture of a person’s iris in a realtime video image is encoded into a compact sequence of multiscale quadrature 2D Gabor wavelet coefficients, whose most
Results 1  10
of
1,726,324