Sciweavers

4324 search results - page 98 / 865
» A Generalized Representer Theorem
Sort
View
JCT
2007
99views more  JCT 2007»
15 years 4 months ago
Independence for partition regular equations
A matrix A is said to be partition regular (PR) over a subset S of the positive integers if whenever S is finitely coloured, there exists a vector x, with all elements in the sam...
Imre Leader, Paul A. Russell
JUCS
2007
88views more  JUCS 2007»
15 years 4 months ago
A Comparison of Various Methods for Computing Bounds for Positive Roots of Polynomials
Abstract: The recent interest in isolating real roots of polynomials has revived interest in computing sharp upper bounds on the values of the positive roots of polynomials. Until ...
Alkiviadis G. Akritas, Panagiotis S. Vigklas
JCT
2007
111views more  JCT 2007»
15 years 4 months ago
Removing even crossings
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and T´oth proved that a graph can always be redrawn so...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
IJRR
2010
113views more  IJRR 2010»
15 years 2 months ago
On the Topology of Discrete Strategies
This paper explores a topological perspective of planning in the presence of uncertainty, focusing on tasks specified by goal states in discrete spaces. The paper introduces stra...
Michael Erdmann
CORR
2007
Springer
98views Education» more  CORR 2007»
15 years 4 months ago
Normalisation Control in Deep Inference Via Atomic Flows
We introduce ‘atomic flows’: they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomi...
Alessio Guglielmi, Tom Gundersen