10271 search results - page 1679 / 2055 » Self-plagiarism in computer science |
162
click to vote
MFCS
1995
Springer
15 years 10 months ago
1995
Springer
The graph inference from a walk for a class C of undirected edge-colored graphs is, given a string x of colors, nding the smallest graph G in C that allows a traverse of all edge...
173
click to vote
MFCS
1995
Springer
15 years 10 months ago
1995
Springer
Let ≤r and ≤s be two binary relations on 2N which are meant as reducibilities. Let both relations be closed under finite variation (of their set arguments) and consider the un...
160
click to vote
WG
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...
188
click to vote
FOCS
1991
IEEE
15 years 10 months ago
1991
IEEE
The upper bound on the exponent, ω, of matrix multiplication over a ring that was three in 1968 has decreased several times and since 1986 it has been 2.376. On the other hand, t...
184
click to vote
FOCS
1992
IEEE
15 years 10 months ago
1992
IEEE
We consider a variant of the traditional task of explicitly reconstructing algebraic functions from black box representations. In the traditional setting for such problems, one is ...