777 search results - page 46 / 156 » The Refined Process Structure Tree |
126
Voted
NIPS
2003
15 years 5 months ago
2003
This paper devises a novel kernel function for structured natural language data. In the field of Natural Language Processing, feature extraction consists of the following two ste...
144
Voted
SSDBM
2003
IEEE
15 years 9 months ago
2003
IEEE
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
134
Voted
ACL
1989
15 years 4 months ago
1989
The Context-Free backbone of some natural language analyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by a disambigu...
145
Voted
3DIM
2003
IEEE
15 years 7 months ago
2003
IEEE
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
140
Voted
DMSN
2004
ACM
15 years 9 months ago
2004
ACM
An important type of spatial queries for sensor networks are K Nearest Neighbor (KNN) queries. Currently, research proposals for KNN query processing is based on index structures,...