759 search results - page 92 / 152 » A Perspective on Knowledge Compilation |
105
click to vote
ERCIMDL
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. This paper presents an approach to automatically subject index fulltext documents with multiple labels based on binary support vector machines (SVM). The aim was to test ...
NLPRS
2001
Springer
15 years 2 months ago
2001
Springer
This paper reports on a study involving the automatic extraction of Chinese legal terms. We used a word segmented corpus of Chinese court judgments to extract salient legal expres...
ECSQARU
1997
Springer
15 years 1 months ago
1997
Springer
Given a number of Dempster-Shafer belief functions there are different architectures which allow to do a compilation of the given knowledge. These architectures are the Shenoy-Sha...
PEPM
1994
ACM
15 years 1 months ago
1994
ACM
We present an efficient base algorithm for binding-time analysis based on constraint solving and the union-find algorithm. In practice it has been used to handle all of Standard M...
SAS
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. It is often the case at runtime that variables and registers in programs are "quasi-invariant," i.e., the distribution of the values they take on is very skewed...