777 search results - page 31 / 156 » The Refined Process Structure Tree |
136
Voted
IJCNLP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Partial parsing techniques try to recover syntactic information efficiently and reliably by sacrificing completeness and depth of analysis. One of the difficulties of pa...
132
Voted
KDID
2003
15 years 4 months ago
2003
We introduce generalized version space trees, a novel data structure that serves as a condensed representation in inductive databases for graph mining. Generalized version space tr...
109
Voted
COLING
1996
15 years 4 months ago
1996
This paper presents an efficient algorithm for retrieving from a database of trees, all trees that match a given query tree appro,imately, that is, within a certain error toleranc...
135
Voted
AAAI
2000
15 years 4 months ago
2000
or cone, abstraction is chosen to represent a spectrum of user inputs/requirements that are narrowed, refined, and structured into a system design. User inputs require refinement f...
142
Voted
DASFAA
2006
IEEE
15 years 9 months ago
2006
IEEE
Keyword search is an effective approach for most users to search for information because they do not need to learn complex query languages or the underlying structures of the data....