Sciweavers

33 search results - page 7 / 7
» Building Very Large Neighbour-joining Trees
Sort
View
VLDB
1999
ACM
118views Database» more  VLDB 1999»
13 years 9 months ago
Similarity Search in High Dimensions via Hashing
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
Aristides Gionis, Piotr Indyk, Rajeev Motwani
EMNLP
2007
13 years 6 months ago
Bootstrapping Feature-Rich Dependency Parsers with Entropic Priors
One may need to build a statistical parser for a new language, using only a very small labeled treebank together with raw text. We argue that bootstrapping a parser is most promis...
David A. Smith, Jason Eisner
VLDB
1987
ACM
92views Database» more  VLDB 1987»
13 years 8 months ago
Mind Your Grammar: a New Approach to Modelling Text
Beginning to create the New Oxford English Dictionary database has resulted in the realization that databases for reference texts are unlike those for conventional enterprises. Wh...
Gaston H. Gonnet, Frank Wm. Tompa