It is shown that for essentially all MAX SNP-hard optimization problems finding exact solutions in subexponential time is not possible unless W [1] = FPT . In particular, we show that O(2p(n)) parameterized algorithms do not exist for Vertex Cover, Max Cut, Max c-Sat, and a number of problems on bounded degree graphs such as Dominating Set and Independent Set, unless W [1] = FPT . Our results a...

Every economic model should include an estimate of its stability and predictability. A new measure, the first passage time (FPT) which is defined as the time period when the model error first exceeds a pre-determined criterion (i.e., the tolerance level), is proposed here to estimate the model predictability. A theoretical framework is developed to determine the mean and variance of FPT. The cl...

0

Introduction: MR spectroscopy can be used to identify various metabolites and their quantities in vivo and provide biochemical information that can be correlated with disease. For example, MR spectroscopy of the brain can show levels of creatinine (Cr), choline (Cho), and N-acetyl aspartate (NAA), which are correlated with the presence or absence of tumor. One of the major drawbacks in MR spect...

The two objectives of this paper are: (1) to articulate three new general techniques for designing FPT algorithms, and (2) to apply these to obtain new FPT algorithms for Set Splitting and Vertex Cover. In the case of Set Splitting, we improve the best previous O(72) FPT algorithm due to Dehne, Fellows and Rosamond [DFR03], to O(8) by an approach based on greedy localization in conjunction with...

Abstract. We present exact results for the spectrum of the fractional Laplacian in a bounded domain and apply them to First Passage Time (FPT) Statistics of Lévy flights. We specifically show that the average is insufficient to describe the distribution of FPT, although it is the only quantity available in the existing literature. In particular, we show that the FPT distribution is not peaked a...

FPT is a Fortran Parallel Transformer 1 which parallelizes sequential programs for various parallel processing architectures. Recently, a Program Information Base (PIB) is developed in order to adapt the FPT for diierent application domains. A program information base integrates various forms of program information into a database. Users are asked to use a data manipulation language (DML) to de...

Above two dimensions, diffusion of a particle in a medium with quenched random traps is believed to be well described by the annealed continuous-time random walk. We propose an approximate expression for the first-passage-time (FPT) distribution in a given sample that enables detailed comparison of the two problems. For a system of finite size, the number and spatial arrangement of deep traps y...

We describe some new, simple and apparently general methods for designing FPT algorithms, and illustrate how these can be used to obtain a significantly improved FPT algorithm for the Maximum Leaf Spanning Tree problem. Furthermore, we sketch how the methods can be applied to a number of other well-known problems, including the parametric dual of Dominating Set (also known as Nonblocker), Matri...