3731 search results - page 94 / 747 » cases 2006 |
155
click to vote
GC
2006
Springer
15 years 5 months ago
2006
Springer
It is shown that for a set S of n pairwise disjoint axis-parallel line segments in the plane there is a simple alternating path of length ( n). This bound is best possible in the...
155
click to vote
FPL
2006
Springer
15 years 9 months ago
2006
Springer
Computing applications in FPGAs are commonly built from repetitive structures of computing and/or memory elements. In many cases, application performance depends on the degree of ...
143
click to vote
COMBINATORICS
2000
15 years 5 months ago
2000
: We prove two extensions of the Hales-Jewett coloring theorem. The first is a polynomial version of a finitary case of Furstenberg and Katznelson's multiparameter elaboration...
109
click to vote
DM
2006
15 years 5 months ago
2006
We answer a question raised by Brass on the number of maximally repeated sub-patterns in a set of n points in Rd. We show that this number, which was conjectured to be polynomial,...
151
click to vote
AML
2006
15 years 5 months ago
2006
Abstract. The decision problem for positively quantified formulae in the theory of linearly ordered Heyting algebras is known, as a special case of work of Kreisel, to be solvable;...