944 search results - page 80 / 189 » Evaluating Ontology Cleaning |
131
click to vote
CP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. The availability of commodity multiprocessors offers significant opportunities for addressing the increasing computational requirements of optimization applications. To...
161
click to vote
ICDT
2005
ACM
15 years 11 months ago
2005
ACM
Abstract. We survey work on statically type checking XML transformations, covering a wide range of notations and ambitions. The concept of type may vary from idealizations of DTD t...
160
click to vote
IFL
2005
Springer
15 years 11 months ago
2005
Springer
In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...
155
click to vote
IJCNLP
2005
Springer
15 years 11 months ago
2005
Springer
This paper presents a lightweight method for unsupervised extraction of paraphrases from arbitrary textual Web documents. The method differs from previous approaches to paraphrase...
153
click to vote
KBSE
1997
IEEE
15 years 10 months ago
1997
IEEE
Proofs in the Nuprl system, an implementation of a constructive type theory, yield “correct-by-construction” programs. In this paper a new methodology is presented for extract...