10997 search results - page 1924 / 2200 » On the Structure of Complete Sets |
146
click to vote
TREC
2000
15 years 8 months ago
2000
Dublin City University (DCU) took part in the Web Track (small task) in TREC-9. Our experiments were based on evaluating a number of connectivity analysis algorithms that we hoped...
180
click to vote
ACL
1996
15 years 8 months ago
1996
Lexicalized Tree Adjoining Grammars have proved useful for NLP. However, numerous redundancy problems face LTAGs developers, as highlighted by Vijay-Shanker and Schabes (92). We p...
162
click to vote
CCCG
1993
15 years 8 months ago
1993
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
149
click to vote
DAGSTUHL
1994
15 years 8 months ago
1994
Functionality-based recognition systems recognize objects at the category level by reasoning about how well the objects support the expected function. Such systems naturally assoc...
156
click to vote
USENIX
1993
15 years 8 months ago
1993
Discovering different types of file resources (such as documentation, programs, and images) in the vast amount of data contained within network file systems is useful for both u...