Sciweavers

11211 search results - page 2218 / 2243
» Rank-Sensitive Data Structures
Sort
View
COLING
1996
13 years 12 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
ISMB
1996
13 years 12 months ago
Refining Neural Network Predictions for Helical Transmembrane Proteins by Dynamic Programming
For transmembrane proteins experimental determina-tion of three-dimensional structure is problematic. However, membrane proteins have important impact for molecular biology in gen...
Burkhard Rost, Rita Casadio, Piero Fariselli
IPSJ
1994
138views more  IPSJ 1994»
13 years 12 months ago
The TSIMMIS Project: Integration of Heterogeneous Information Sources
The goal of the Tsimmis Project is to develop tools that facilitate the rapid integration of heterogeneous information sources that may include both structured and unstructured da...
Sudarshan S. Chawathe, Hector Garcia-Molina, Joach...
ACL
1989
13 years 11 months ago
The Lexical Semantics of Comparative Expressions in a Multi-Level Semantic Processor
Comparative expressions (CEs) such as "bigger than" and "more oranges than" are highly ambiguous, and their meaning is context dependent. Thus, they pose probl...
Duane E. Olawsky
ACL
1992
13 years 11 months ago
SEXTANT: Exploring Unexplored Contexts for Semantic Extraction from Syntactic Analysis
For a very long time, it has been considered that the only way of automatically extracting similar groups of words from a text collection for which no semantic information exists ...
Gregory Grefenstette
« Prev « First page 2218 / 2243 Last » Next »