4324 search results - page 740 / 865 » A Generalized Representer Theorem |
105
click to vote
LOGCOM
2007
15 years 4 months ago
2007
Recently, the old logical notion of forgetting propositional symbols (or reducing the logical vocabulary) has been generalized to a new notion: forgetting literals. The aim was to...
134
click to vote
COMPUTER
2004
15 years 4 months ago
2004
highly abstracted. The Chinese writing system uses logographs--conventional representations of words or morphemes. Characters of the most common kind have two parts, one suggesting...
117
click to vote
COLING
2002
15 years 4 months ago
2002
With the rapid growth of real application domains for NLP systems, there is a genuine demand for a general toolkit from which programmers with no linguistic knowledge can build sp...
127
click to vote
COMBINATORICS
2002
15 years 4 months ago
2002
We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings of planar graphs, up to matrix operations on their rows and columns. If such a matrix is ...
137
click to vote
CORR
2000
Springer
15 years 4 months ago
2000
Springer
This paper presents a semantic parsing approach for non domain-specific texts. Semantic parsing is one of the major bottlenecks of Natural Language Understanding (NLU) systems and...