Sciweavers

3145 search results - page 260 / 629
» Algebraic Linear Orderings
Sort
View
GD
2006
Springer
15 years 10 months ago
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
David R. Wood, Jan Arne Telle
151
Voted
LPNMR
1990
Springer
15 years 10 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote
COMBINATORICS
2000
49views more  COMBINATORICS 2000»
15 years 6 months ago
A Short Proof of a Partition Relation for Triples
We provide a much shorter proof of the following partition theorem of P. Erdos and R. Rado: If X is an uncountable linear order into which neither 1 nor 1 embeds, then X (, 4)3 f...
Albin L. Jones
309
Voted

Book
519views
17 years 5 months ago
Information Theory, Inference, and Learning Algorithms
This book is aimed at senior undergraduates and graduate students in Engineering, Science, Mathematics, and Computing. It expects familiarity with calculus, probability theory, and...
David J. C. MacKay
ICPR
2002
IEEE
16 years 7 months ago
Multi-Scale Autoconvolution for Affine Invariant Pattern Recognition
This paper describes a novel image transform called Multi-Scale Autoconvolution which is invariant with respect to affine transformations of the spatial image coordinates. The tra...
Janne Heikkilä