Learn More
Foreword Constraints are an ubiquitous concept, which in its broader sense pertains to every day experience: they represent the conditions which restrict our freedom of decision. In fact, how much our choices are constrained by the external world is a basic philosophical question. In the formalized reasoning of scientific disciplines, constraints have been(More)
  • Eric D Feigelson, John Farris, Statisticians—adrian Baddeley, James Berger, Duke, Clyde Merlise +27 others
  • 2005
The five-day course " Statistical Inference for Astronomers " is designed to provide graduate students and young researchers with a strong conceptual foundation in modern statistics and to help them develop a repertoire of well-established techniques applicable to observational astronomy and physics. Topics include exploratory data analysis, hypothesis(More)
The Exponential Time Hypothesis (ETH) states that 3SAT cannot be solved in 2 o(n) time. We have strong relations between ETH and fixed-parameter tractability. For instance, assuming ETH, a k-clique cannot be found in n o(k) time, and k-SUM cannot be solved in n o(k) time. (The k-SUM problem is this: given n numbers, do some k of them sum to zero?) We can(More)
Is it fixed-parameter tractable to find an out-directed spanning tree of a given digraph with the maximum possible k of leaves? More precisely, consider a digraph D. An out-tree of D is a subtree in which all vertices but one have in-degree exactly 1. The vertices of out-degree 0 are called leaves. Let (D) denote the maximum number of leaves of any out-tree(More)
  • Christopher W Nobes, Liesel Knorr, German Accounting Standards Committee, Erlend Kvaal, Norwegian, Steinar Kvifte +10 others
  • 2000
It is widely believed that international financial reporting standards (IFRS) have been adopted in many countries, at least for the consolidated reporting of listed companies. However, in nearly all cases, what the rules require is some national or supranational version of IFRS. This might create problems for investor confidence and comparability. We(More)
There has been much work on extending the prediction with expert advice methodology to the case when experts are composed of components and there are combinatorially many such experts. One of the core examples is the Online Shortest Path problem where the components are edges and the experts are paths. In this note we revisit this online routing problem in(More)
We present a modified version of the perceptron learning algorithm (PLA) which solves semidefinite programs (SDPs) in polynomial time. The algorithm is based on the following three observations: (i) Semidefinite programs are linear programs with infinitely many (linear) constraints; (ii) every linear program can be solved by a sequence of constraint(More)