نتایج جستجو برای: con dence interval

تعداد نتایج: 315187  

2008
Larry G. Epstein Kyoungwon Seo

The de Finetti Theorem is a cornerstone of the Bayesian approach. Bernardo [4, p. 5] writes that its “message is very clear: if a sequence of observations is judged to be exchangeable, then any subset of them must be regarded as a random sample from some model, and there exists a prior distribution on the parameter of such model, hence requiring a Bayesian approach.”We argue that while exchange...

2012
Tobias Golling

This diploma thesis is about the Odderon which is the C P partner of the Pomeron Thus its couplings to a particle and its antiparticle are not equal which in principle should be measurable in pp and p p scattering A search for contributions of Odderon photon fusion to the exclusive production of the pseudoscalar in the process ep e N in the photoproduction regime is subject of this thesis The i...

2012
Donald W. K. Andrews Xu Cheng

This paper analyzes the properties of a class of estimators, tests, and con…dence sets (CS’s) when the parameters are not identi…ed in parts of the parameter space. Speci…cally, we consider estimator criterion functions that are sample averages and are smooth functions of a parameter : This includes log likelihood, quasi-log likelihood, and least squares criterion functions. We determine the as...

1991
F J Smieja

It is widely considered an ultimate connectionist objective to incorporate neural net works into intelligent systems These systems are intended to possess a varied re pertoire of functions enabling adaptable interaction with a non static environment The rst step in this direction is to develop various neural network algorithms and models the second step is to combine such networks into a modula...

1996
Sissades Tongsima Chantana Chantrapornchai Nelson Luiz Passos

VLSI circuit manufacturing may result in devices with di erent propagation delays. Hence, the estimation of such delays during the design procedure may not prove totally accurate due to the fabrication process. This paper presents a new optimization methodology, called probabilistic retiming, which transforms a circuit based on statistical data gathered from the production history. Such circuit...

1999
Ricardo L. de Queiroz Gozde Bozdagi Akar Husrev T. Sencar

This paper presents a simple and e ective pre-processing method developed for the segmentation of MPEG compressed video sequences. The proposed method for scene-cut detection only involves computing the number of bits spent for each frame (encoding cost data), thus avoiding decoding the bitstream. The information is separated into I-, P-, B-frames, thus forming 3 vectors which are independently...

1999
Goran Kauermann Raymond J. Carroll

The sandwich estimator, often known as the robust covariance matrix estimator or the empirical covariance matrix estimator, has achieved increasing use with the growing popularity of generalized estimating equations. Its virtue is that it provides consistent estimates of the covariance matrix for parameter estimates even when the tted parametric model fails to hold, or is not even speci ed. Sur...

2007
Jef Wijsen Christian S. Jensen Heidi Gregersen Dieter Pfoser Simonas Saltenis Janne Skyt Giedrius Slivinskas Kristian Torp Richard T. Snodgrass Curtis E. Dyreson Fabio Grandi Nick Kline Gerhard Knolmayer Thomas Myrach Kwang W. Nam Mario A. Nascimento John F. Roddick Keun H. Ryu Michael D. Soo Vassilis Tsotras

We propose a temporal dependency, called trend dependency (TD), which captures a signi cant family of data evolution regularities. A simple example of such regularity might be: \Salaries of employees do not decrease." TDs compare attributes over time using operators of f<;=;>; ; ; 6=g. We de ne a satis ability problem that is the dual of the logical implication problem for TDs, and we investiga...

1996
Dieter van Melkebeek

We prove that there is no sparse hard set for P under logspace computable bounded truthtable reductions unless P = L. In case of reductions computable in NC1, the collapse goes down to P = NC1. We parameterize this result and obtain a generic theorem allowing to vary the sparseness condition, the space bound and the number of queries of the truth-table reduction. Another instantiation yields th...

2007
Stéphane Lallich Olivier Teytaud Elie Prudhomme

The search for interesting Boolean association rules is an important topic in knowledge discovery in databases. The set of admissible rules for the selected support and con dence thresholds can easily be extracted by algorithms based on support and con dence, such as Apriori. However, they may produce a large number of rules, many of them are uninteresting. One has to resolve a two-tier problem...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید