7796 search results - page 307 / 1560 » On Generalized Schur Numbers |
164
Voted
TIT
2008
15 years 6 months ago
2008
This article describes new theoretical results concerning the general behavior of a Feedback with Carry Shift Register (FCSR) automaton. They help to better understand how the init...
159
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
A (multi)hypergraph H with vertices in N contains a permutation p = a1a2 . . . ak of 1, 2, . . . , k if one can reduce H by omitting vertices from the edges so that the resulting ...
181
click to vote
COLING
2002
15 years 6 months ago
2002
This paper proposes a learning and extracting method of word sequence correspondences from non-aligned parallel corpora with Support Vector Machines, which have high ability of th...
176
click to vote
JACM
2000
15 years 6 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
179
click to vote
COMBINATORICS
1998
15 years 6 months ago
1998
We show that the moments of the trace of a random unitary matrix have combinatorial interpretations in terms of longest increasing subsequences of permutations. To be precise, we s...