661 search results - page 9 / 133 » Argument Reduction by Factoring |
LFCS
1994
Springer
14 years 18 days ago
1994
Springer
In a previous paper [4], we introduced a non-deterministic -calculus (-LK) whose type system corresponds exactly to Gentzen's cut-free LK [9]. This calculus, however, cannot b...
HT
2005
ACM
14 years 2 months ago
2005
ACM
We describe our approach to the automatic generation of argument structures in the domain of video documentaries. Our approach releases control of the final video sequencing from...
NAACL
2010
13 years 6 months ago
2010
In this work, we try a hybrid methodology for language modeling where both morphological decomposition and factored language modeling (FLM) are exploited to deal with the complex ...
APPROX
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
CVPR
2011
IEEE
13 years 5 months ago
2011
IEEE
This paper presents an algorithm for order reduction of
factors in High-Order Markov Random Fields (HOMRFs).
Standard techniques for transforming arbitrary high-order
factors in...