Results 1  10
of
1,891,768
PROBABILITY CALCULATIONS UNDER THE IAC HYPOTHESIS
"... Abstract. We show how powerful algorithms recently developed for counting lattice points and computing volumes of convex polyhedra can be used to compute probabilities of a wide variety of events of interest in social choice theory. Several illustrative examples are given. 1. ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
Abstract. We show how powerful algorithms recently developed for counting lattice points and computing volumes of convex polyhedra can be used to compute probabilities of a wide variety of events of interest in social choice theory. Several illustrative examples are given. 1.
Improved probability calculation for DIALIGN2
"... DIALIGN2 is a successful sequence alignment program, which does not use a gap penalty[1,2,3,4]. It considers all possible gapless aligned segments, called diagonals, calculates a score for each, and assigns a weight to each according to the probability that the corresponding diagonal selected from t ..."
Abstract
 Add to MetaCart
DIALIGN2 is a successful sequence alignment program, which does not use a gap penalty[1,2,3,4]. It considers all possible gapless aligned segments, called diagonals, calculates a score for each, and assigns a weight to each according to the probability that the corresponding diagonal selected from
Aliasing Probability Calculations In Nonlinear Compactors
"... This paper discusses a systematic methodology for calculating the aliasing probability when an arbitrary finitestate machine is used to compact the response of a combinational circuit to a sequence of randomly generated test input vectors. The proposed approach is general and is based on simultaneo ..."
Abstract
 Add to MetaCart
This paper discusses a systematic methodology for calculating the aliasing probability when an arbitrary finitestate machine is used to compact the response of a combinational circuit to a sequence of randomly generated test input vectors. The proposed approach is general and is based
Mutually Disjoint Signals and Probability Calculation in Digital Circuits
"... Signal probability calculation in circuits where signals are not independent is generally expensive. We show that some correlated signals may be mutually disjoint. In such cases, the probability calculation can be as simple as it is for independent signals. For example, two signals that cannot be si ..."
Abstract
 Add to MetaCart
Signal probability calculation in circuits where signals are not independent is generally expensive. We show that some correlated signals may be mutually disjoint. In such cases, the probability calculation can be as simple as it is for independent signals. For example, two signals that cannot
Multipoint quantitativetrait linkage analysis in general pedigrees
 Am. J. Hum. Genet
, 1998
"... Multipoint linkage analysis of quantitativetrait loci (QTLs) has previously been restricted to sibships and small pedigrees. In this article, we show how variancecomponent linkage methods can be used in pedigrees of arbitrary size and complexity, and we develop a general framework for multipoint i ..."
Abstract

Cited by 553 (56 self)
 Add to MetaCart
identitybydescent (IBD) probability calculations. We extend the sibpair multipoint mapping approach of Fulker et al. to general relative pairs. This multipoint IBD method uses the proportion of alleles shared identical by descent at genotyped loci to estimate IBD sharing at arbitrary points along a
Unscented Filtering and Nonlinear Estimation
 PROCEEDINGS OF THE IEEE
, 2004
"... The extended Kalman filter (EKF) is probably the most widely used estimation algorithm for nonlinear systems. However, more than 35 years of experience in the estimation community has shown that is difficult to implement, difficult to tune, and only reliable for systems that are almost linear on the ..."
Abstract

Cited by 558 (5 self)
 Add to MetaCart
The extended Kalman filter (EKF) is probably the most widely used estimation algorithm for nonlinear systems. However, more than 35 years of experience in the estimation community has shown that is difficult to implement, difficult to tune, and only reliable for systems that are almost linear
Fast probabilistic algorithms for verification of polynomial identities
 J. ACM
, 1980
"... ABSTRACT The starthng success of the RabmStrassenSolovay pnmahty algorithm, together with the intriguing foundattonal posstbthty that axtoms of randomness may constttute a useful fundamental source of mathemaucal truth independent of the standard axmmaUc structure of mathemaUcs, suggests a wgorous ..."
Abstract

Cited by 517 (1 self)
 Add to MetaCart
wgorous search for probabdisuc algonthms In dlustratmn of this observaUon, vanous fast probabdlsttc algonthms, with probability of correctness guaranteed a prion, are presented for testing polynomial ldentmes and propemes of systems of polynomials. Ancdlary fast algorithms for calculating resultants
A New Statistical Parser Based on Bigram Lexical Dependencies
, 1996
"... This paper describes a new statistical parser which is based on probabilities of dependencies between headwords in the parse tree. Standard bigram probability estimation techniques are extended to calculate probabilities of dependencies between pairs of words. Tests using Wall Street Journal ..."
Abstract

Cited by 488 (4 self)
 Add to MetaCart
This paper describes a new statistical parser which is based on probabilities of dependencies between headwords in the parse tree. Standard bigram probability estimation techniques are extended to calculate probabilities of dependencies between pairs of words. Tests using Wall Street
A direct approach to false discovery rates
, 2002
"... Summary. Multiplehypothesis testing involves guarding against much more complicated errors than singlehypothesis testing. Whereas we typically control the type I error rate for a singlehypothesis test, a compound error rate is controlled for multiplehypothesis tests. For example, controlling the ..."
Abstract

Cited by 753 (14 self)
 Add to MetaCart
and then estimate its corresponding error rate. This new approach offers increased applicability, accuracy and power. We apply the methodology to both the positive false discovery rate pFDR and FDR, and provide evidence for its benefits. It is shown that pFDR is probably the quantity of interest over FDR. Also
An Algorithm for Tracking Multiple Targets
 IEEE Transactions on Automatic Control
, 1979
"... Abstractâ€”An algorithm for tracking multiple targets In a cluttered algorithms. Clustering is the process of dividing the entire environment Is developed. The algorithm Is capable of Initiating tracks, set of targets and measurements into independent groups accounting for false or m[~clngreports, and ..."
Abstract

Cited by 587 (0 self)
 Add to MetaCart
[~clngreports, and groom sets of dSPeU&IIt ~or clusters ~ Instead of solvin one lar e roblem a reports~As each measurement Is received, probabilities are ~*uI~ted for ~ g g ~â€˜ thehypotheses that the measurement ~ f ~ ~ IUM)Wfl ~ number of smaller problems are solved in parallel. Fiin a target file, or from a new
Results 1  10
of
1,891,768