13603 search results - page 135 / 2721 » On the Computational Complexity of Cut-Reduction |
184
click to vote
ECWEB
2009
Springer
16 years 21 days ago
2009
Springer
Abstract. Alternating least squares (ALS) is a powerful matrix factorization (MF) algorithm for both implicit and explicit feedback based recommender systems. We show that by using...
152
click to vote
FSTTCS
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. This paper studies a recently developed an approach to reasoning about mutable data structures, which uses an assertion language with spatial conjunction and implication ...
137
click to vote
LICS
2009
IEEE
16 years 24 days ago
2009
IEEE
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
157
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
This paper addresses the problem of computing visual hulls from image contours. We propose a new hybrid approach which overcomes the precision-complexity trade-off inherent to vox...
151
Voted
EUROGP
2001
Springer
15 years 10 months ago
2001
Springer
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...