14 search results - page 2 / 3 » Generating Referring Expressions: Boolean Extensions of the ... |
DATE
2009
IEEE
14 years 1 days ago
2009
IEEE
Boolean satisfiability (SAT) solving has become an enabling technology with wide-ranging applications in numerous disciplines. These applications tend to be most naturally encode...
ACL
1997
13 years 6 months ago
1997
Most algorithms dedicated to the generation of referential descriptions widely suffer from a fundamental problem: they make too strong assumptions about adjacent processing compon...
ICDE
2008
IEEE
14 years 6 months ago
2008
IEEE
The paper proposes an extension of CFDs [1], referred to as extended Conditional Functional Dependencies (eCFDs). In contrast to CFDs, eCFDs specify patterns of semantically relate...
IEAAIE
2009
Springer
13 years 12 months ago
2009
Springer
Data mining refers to the process of revealing unknown and potentially useful information from a large database. Frequent itemsets mining is one of the foundational problems in dat...
PKDD
2004
Springer
13 years 10 months ago
2004
Springer
The next wave in search technology will be driven by the identification, extraction, and exploitation of real-world entities represented in unstructured textual sources. Search sy...