16666 search results - page 138 / 3334 » Descriptive and Computational Complexity |
142
Voted
ICCS
2000
Springer
15 years 7 months ago
2000
Springer
With the aim of building a "Semantic Web", the content of the documents must be explicitly represented through metadata in order to enable contents-guided search. Our app...
133
click to vote
CADE
2008
Springer
15 years 6 months ago
2008
Springer
We describe the new software package Aligator for automatically inferring polynomial loop invariants. The package combines algorithms from symbolic summation and polynomial algebra...
117
Voted
LREC
2008
15 years 5 months ago
2008
This paper discusses the use of computational linguistic technology to extract definitions from a large corpus of German court decisions. We present a corpus-based survey of defin...
139
Voted
LICS
1999
IEEE
15 years 8 months ago
1999
IEEE
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...
120
click to vote
ESM
2000
15 years 5 months ago
2000
The framework of this paper is the design of complex communication protocols by simulation, based on formal description techniques (FDT). We propose a general-purpose scalable mod...