1048 search results - page 59 / 210 » Best Probabilistic Transformers |
154
click to vote
PRICAI
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The problem of interpreting Natural Language (NL) discourse is generally of exponential complexity. However, since interactions with users must be conducted in real time,...
159
click to vote
ICALP
2001
Springer
15 years 10 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
170
Voted
ICDE
2010
IEEE
15 years 10 months ago
2010
IEEE
Mashups are situational applications that build data flows to link the contents of multiple Web sources. Often times, ranking the results of a mashup is handled in a materializethe...
155
Voted
ECIR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Users often search for entities instead of documents and in this setting are willing to provide extra input, in addition to a query, such as category information and exam...
173
click to vote
EMNLP
2004
15 years 7 months ago
2004
We describe how simple, commonly understood statistical models, such as statistical dependency parsers, probabilistic context-free grammars, and word-to-word translation models, c...