125 search results - page 15 / 25 » N Semantic Classes are Harder than Two |
AML
2010
14 years 9 months ago
2010
We show the non-arithmeticity of 1st order theories of lattices of n sentences modulo provable equivalence in a formal theory, of diagonalizable algebras of a wider class of arithm...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We investigate the asymptotic behavior of the steady-state queue length distribution under generalized maxweight scheduling in the presence of heavy-tailed traffic. We consider a s...
ICDT
2010
ACM
14 years 8 months ago
2010
ACM
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
AUSDM
2006
Springer
15 years 1 months ago
2006
Springer
The Scamseek project, as commissioned by ASIC has the principal objective of building an industrially viable system that retrieves potential scam candidate documents from the Inte...
SIGDIAL
2010
14 years 7 months ago
2010
Incremental natural language understanding is the task of assigning semantic representations to successively larger prefixes of utterances. We compare two types of statistical mod...