562 search results - page 44 / 113 » Dependency Pairs Revisited |
219
Voted
CADE
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. Security protocols aim at securing communications over public networks. Their design is notoriously difficult and error-prone. Formal methods have shown their usefulness ...
100
click to vote
LREC
2010
15 years 3 months ago
2010
We present a study that compares data-driven dependency parsers obtained by means of annotation projection between language pairs of varying structural similarity. We show how the...
116
Voted
EMNLP
2006
15 years 3 months ago
2006
We describe a probabilistic approach to content selection for meeting summarization. We use skipchain Conditional Random Fields (CRF) to model non-local pragmatic dependencies bet...
123
Voted
SIGMOD
2009
ACM
15 years 8 months ago
2009
ACM
The state of the art commercial query optimizers employ cost-based optimization and exploit dynamic programming (DP) to find the optimal query execution plan (QEP) without evalua...
107
Voted
VLDB
2004
ACM
15 years 7 months ago
2004
ACM
When query optimizers erroneously assume that database columns are statistically independent, they can underestimate the selectivities of conjunctive predicates by orders of magni...