1922 search results - page 177 / 385 » ie 2007 |
169
click to vote
ACL
1996
15 years 7 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...
184
click to vote
NAACL
1994
15 years 7 months ago
1994
We show how the recognition performance of a speech recognition component in a speech retrieval system affects the retrieval effectiveness. A speech retrieval system facilitates c...
138
Voted
IJCAI
1989
15 years 7 months ago
1989
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...
181
click to vote
ALENEX
2009
15 years 7 months ago
2009
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
148
click to vote
CIDR
2009
15 years 7 months ago
2009
To date, the principal use case for schema matching research has been as a precursor for code generation, i.e., constructing mappings between schema elements with the end goal of ...