Sciweavers

1173 search results - page 75 / 235
» Ranking functions and rankings on languages
Sort
View
ACL
2012
11 years 10 months ago
Strong Lexicalization of Tree Adjoining Grammars
Recently, it was shown (KUHLMANN, SATTA: Tree-adjoining grammars are not closed under strong lexicalization. Comput. Linguist., 2012) that finitely ambiguous tree adjoining gramm...
Andreas Maletti, Joost Engelfriet
COCO
2001
Springer
161views Algorithms» more  COCO 2001»
14 years 6 days ago
Communication Complexity Lower Bounds by Polynomials
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
Harry Buhrman, Ronald de Wolf
SIGIR
2009
ACM
14 years 2 months ago
Positional language models for information retrieval
Although many variants of language models have been proposed for information retrieval, there are two related retrieval heuristics remaining “external” to the language modelin...
Yuanhua Lv, ChengXiang Zhai
EACL
2003
ACL Anthology
13 years 9 months ago
A Comparison of Event Models for Naive Bayes Anti-Spam E-Mail Filtering
We describe experiments with a Naive Bayes text classifier in the context of anti-spam E-mail filtering, using two different statistical event models: a multi-variate Bernoulli ...
Karl-Michael Schneider
EJC
2008
13 years 7 months ago
Graph parameters and semigroup functions
Abstract. We prove a general theorem on semigroup functions that implies characterizations of graph partition functions in terms of the positive semidefiniteness (`reflection posit...
László Lovász, Alexander Schr...