125 search results - page 1 / 25 » N Semantic Classes are Harder than Two |
ACL
2006
13 years 6 months ago
2006
We show that we can automatically classify semantically related phrases into 10 classes. Classification robustness is improved by training with multiple sources of evidence, inclu...
SIGMOD
2004
ACM
14 years 5 months ago
2004
ACM
A schema mapping produces a semantic correspondence between two schemas. Automating schema mapping is challenging. The existence of 1:n (or n:1) and n:m mapping cardinalities make...
FOCS
1990
IEEE
13 years 9 months ago
1990
IEEE
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
APAL
2008
13 years 5 months ago
2008
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
ICALP
1992
Springer
13 years 9 months ago
1992
Springer
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...