Search

11 Jan 2016: Examples are spam filters, text and speech recognition, machine learning,bioinformatics, health economics and (some) clinical trials.

20 Mar 2020: Middle years. Mark Kac visited Holland in 1955, and Harry had theopportunity to meet him at the Mathematical Centre.He wrote to Kac in January 1956 to enquire of agraduate fellowship ... Exciting and beau-tiful problems were formulated and solved, and con

29 Nov 2018: the 2008 Annals paper Jager and Wellner (2007)with Leah Jager on goodness of fit tests based onRényi divergences. ... figuring out newnonparametric confidence bands for distributionfunctions related to an intriguing test statistic dueto Berk and Jones.

8 Mar 2016: 22. 6.3 Optimal stopping over the infinite horizon. 23. 6.4 Example: sequential probability ratio test. ... 6516.2 Problems in which time appears explicitly. 6616.3 Example: monopolist. 6616.4 Example: neoclassical economic growth.

23 Oct 2016: 3). If we are interested in the middle block of eigenvectors correspondingto those with corresponding eigenvalue 3 in , then for every orthogonal matrix Ô Rdd ,. ‖V̂ Ô V ‖F = 21/2‖ ... Fan and X. Han (arXiv: 1305.7007) on estimating the false

29 Nov 2014: 22. 6.3 Optimal stopping over the infinite horizon. 23. 6.4 Example: sequential probability ratio test. ... 6416.2 Problems in which time appears explicitly. 6516.3 Example: monopolist. 6516.4 Example: neoclassical economic growth.

22 May 2013: 22. 6.3 Optimal stopping over the infinite horizon. 22. 6.4 Sequential Probability Ratio Test. ... 6615.4 Problems in which time appears explicitly. 6615.5 Example: monopolist. 6715.6 Example: neoclassical economic growth.

28 Oct 2013: Bayesianinference on f is then entirely based on this posterior distribution—it gives accessto point estimates for f , credible sets and tests in a natural way. ... A frequentistgoodness of fit test of a null hypothesis H0 : f = f0 could, for instance,

15 Sep 2011: C. Courcoubetis is with the Athens University of Economics and Business,Athens 10434, Greece. ... Thisgreatly reduces the economic value of many new portable de-vices, such as PDAs, tablet computers, and smart-phones run-ning the IP protocol.

16 Sep 2019: Screening test.Simpson’s paradox. 6.1 Conditional probability. Suppose B is an event with P(B) > 0. ... However, the test yields a false positive rate of1% of the healthy persons tested.

15 Sep 2011: In this paper we develop an economic model for sharing resources among WLANs. ... Our aim is to optimize participation rules to maximize economic efficiency and reducefree-riding.

21 Oct 2011: In: Karreman H (ed) Stochastic. Optimization and Control, Wiley, pp 173–209Knapp KC, Olson LJ (1995) The economics of conjunctive groundwater management with stochastic surface sup-. ... plies. Journal of Environmental Economics and Management

25 Feb 2020: 8.1.1 Adaptive Testing with L2-Alternatives 6088.1.2 Adaptive Plug-in Tests for L-Alternatives 612. ... Thebasic information-theoretic ideas behind it are developed, and it is shown how statisticalinference procedures – estimators, tests and confidence

16 Jan 2024: The statistical intuition behind this algorithm is simple: We compute the new(conditionally Gaussian) proposal sm and perform a likelihood ratio test against theprevious position #m of the Markov chain. ... D m0ıN and log N."/ D cNı2N , c > 0; constant

14 May 2016: constructs that parallel fundamental concepts from physics or economics. such as energy or price, and which allow us to reason about the systems we. ... some ideas from physics and economics. In our study of loss networks we will have seen a network

15 Sep 2011: To achieve economic eciency, it is necessary that usage-based charg-ing schemes capture the relative amount of resources used by connections. ... Fairness of charging schemesWe rst argue that charging in proportion to the actual eective bandwidthis

15 Aug 2012: obtained from L by placing a vertexin the middle of each edge, and calling two such vertices adjacent whenever thecorresponding edges of L share an endvertex).

15 Aug 2012: obtained from L by placing a vertexin the middle of each edge, and calling two such vertices adjacent whenever thecorresponding edges of L share an endvertex).

15 Aug 2012: obtained from L byplacing a vertex in the middle of each edge, and calling two such verticesadjacent whenever the corresponding edges of L share an endvertex).

15 Sep 2011: In contrast, stations in the middle of the line can experience both blocking and starvation. ... are served at stations 1 4 into the middle of the sequence 2 1 4 1 4 1 4 2 4 4.