Concept

Bootstrapping (statistics)

Related publications (135)

Netscope: Practical Network Loss Tomography

Patrick Thiran, Xuan Hung Nguyen, Maciej Kurant, Denisa Gabriela Ghita

We present Netscope, a tomographic technique that infers the loss rates of network links from unicast end-to-end measurements. Netscope uses a novel combination of first- and second-order moments of end-to-end measurements to identify and characterize the ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

How many bootstrap replicates are necessary?

Bernard Moret, Alexandros Stamatakis

Phylogenetic bootstrapping (BS) is a standard technique for inferring confidence values on phylogenetic trees that is based on reconstructing many trees from minor variations of the input data, trees called replicates. BS is used with all phylogenetic reco ...

2010

Fast and accurate phylogenetic reconstruction from high-resolution whole-genome data and a novel robustness estimator

Bernard Moret, Yu Lin, Vaibhav Rajan

The rapid accumulation of whole-genome data has renewed interest in the study of genomic rearrangements. Comparative genomics, evolutionary biology, and cancer research all require models and algorithms to elucidate the mechanisms, history, and consequence ...

Springer2010

Approximate Confidence Computation in Probabilistic Databases.

Christoph Koch

This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variables. The algorithm is based on an incremental compilation of formulas into decision diagr ...

2010

Scheduling periodic tasks in a hard real-time environment

Friedrich Eisenbrand, Martin Niemeier, Nicolai Hähnle

We give a rigorous account on the complexity landscape of an important real-time scheduling problem that occurs in the design of software-based aircraft control. The goal is to distribute tasks

\tau_i=(c_i,p_i)

on a minimum number of identical machines a ...

Springer-Verlag2010

Innovations Diffusion: A Spatial Sampling Scheme for Distributed Estimation and Detection

Ali H. Sayed

We consider a wireless network with distributed processing capabilities for estimation or detection applications. Due to limited communication resources, the network selects only a subset of sensor measurements for estimation or detection as long as the re ...

IEEE2009

A Rapid Bootstrap Algorithm for the RAxML Web Servers

Jacques Rougemont, Alexandros Stamatakis

Despite recent advances achieved by application of high-performance computing methods and novel algorithmic techniques to maximum likelihood (ML)-based inference programs, the major computational bottleneck still consists in the computation of bootstrap su ...

Taylor and Francis, Oxford2008

A sparse grid stochastic collocation method for partial differential equations with random input data

Fabio Nobile

This work proposes and analyzes a Smolyak-type sparse grid stochastic collocation method for the approximation of statistical quantities related to the solution of partial differential equations with random coeffcients and forcing terms ( input data of the ...

Society for Industrial and Applied Mathematics2008

Consistent And Regularized Magnification Of Images

Michaël Unser, Philippe Thévenaz, Aurélien Bourquard, Katarina Balac

Because more output data must be created than is available from the input, magnification is an III-posed problem. Traditional magnification relies on resampling an interpolation model at the appropriate rate; unfortunately, this simple solution is blind to ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008

Performance Generalization in Biometric Authentication Using Joint User-Specific and Sample Bootstraps

Samy Bengio, Norman Hoon Thian Poh

Biometric authentication performance is often depicted by a DET curve. We show that this curve is dependent on the choice of samples available, the demographic composition and the number of users specific to a database. We propose a two-step bootstrap proc ...

2007

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Scheduling periodic tasks in a hard real-time environment

Friedrich Eisenbrand, Martin Niemeier, Nicolai Hähnle

We give a rigorous account on the complexity landscape of an important real-time scheduling problem that occurs in the design of software-based aircraft control. The goal is to distribute tasks

\tau_i=(c_i,p_i)

on a minimum number of identical machines a ...

Springer-Verlag2010