#### Filter Results:

#### Publication Year

2000

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

- F Rossi, P Van Beek, T Walsh Elsevier, Ugo Montanari, Rolf Backofen, Philippe Baptiste +38 others
- 2006

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 security provided by the XCBC, TMAC and OMAC schemes is analysed and compared with other MAC schemes. The results imply that there is relatively little to be gained practically through the introduction of these schemes by comparison with other well-established MAC functions. Moreover , TMAC and OMAC possess design weaknesses which enable part of the… (More)

- Erik D Demaine, Mohammadtaghi Hajiaghayi, Dániel Marx, Mihai Pˇatra¸scu, Gregory Gutin, Royal Holloway +1 other
- 2009

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)

- Erik D Demaine, Gregory Gutin, Dániel Marx, Ulrike Stege, Royal Holloway, U London +4 others
- 2007

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)

The Directed Rural Postman Problem (DRPP) can be formulated as follows: given a strongly connected directed multigraph D = (V, A) with nonnegative integral weights on the arcs, a subset R of A and a nonnegative integer ℓ, decide whether D has a closed directed walk containing every arc of R and of total weight at most ℓ. Let k be the number of weakly… (More)

- Wouter M Koolen, Wouter Edu Koolen@qut, Au, Manfred K Warmuth, Manfred@ucsc Edu, Dmitry Adamskiy +1 other
- 2015

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)