10271 search results - page 531 / 2055 » Computer Science |
135
click to vote
FOCS
1996
IEEE
15 years 10 months ago
1996
IEEE
In thispaper we give a 3-approximationalgorithmfor the problem ojJnding a minimum tree spanning any k-vertices in a graph. Our algorithm extends to a 3-approximationalgorithmfor t...
170
click to vote
RELMICS
1997
Springer
15 years 10 months ago
1997
Springer
In this paper we extend an earlierapproach to graphicalrelationcalculitowards relational matching, thus allowing proofs with fewer auxiliary steps and concentrating more on the es...
175
click to vote
FOCS
1994
IEEE
15 years 10 months ago
1994
IEEE
Sipser and Spielman have introduced a constructive family of asymptotically good linear error-correcting codes--expander codes--together with a simple parallel algorithm that will ...
155
click to vote
HOA
1993
15 years 10 months ago
1993
Abstract. The Spectrum project concentrates on the process of developing well-structured, precise system speci cations. Spectrum is a speci cation language, with a deduction calcul...
166
click to vote
ACMSE
1992
ACM
15 years 10 months ago
1992
ACM
The feasibility of extracting both explicit and implicit synonym references from a machine readable dictionary is investigated; the extracted synonyms, both symmetric and asymmetr...