607 search results - page 45 / 122 » Unifying Exact Completions |
112
click to vote
IJCAI
2001
15 years 2 months ago
2001
Ontologies are set to play a key r^ole in the "Semantic Web" by providing a source of shared and precisely defined terms that can be used in descriptions of web resource...
127
click to vote
MCU
1998
15 years 1 months ago
1998
A BSS machine is -uniform if it does not use exact tests; such machines are equivalent (modulo parameters) to Type 2 Turing machines. We define a notion of closure related to Turi...
100
Voted
ACL
1996
15 years 1 months ago
1996
Under categorial grammars that have powerful rules like composition, a simple n-word sentence can have exponentially many parses. Generating all parses is inefficient and obscures...
122
Voted
SOCO
2002
Springer
15 years 7 days ago
2002
Springer
Retrieving relevant information is a crucial component of cased-based reasoning systems for Internet applications such as search engines. The task is to use user-defined queries to...
128
Voted
RSA
2010
14 years 11 months ago
2010
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...