1199 search results - page 79 / 240 » Parameterized Proof Complexity |
95
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The paper addresses the problem of learning a regression model parameterized by a fixed-rank positive semidefinite matrix. The focus is on the nonlinear nature of the search space...
110
Voted
TOG
2008
15 years 21 days ago
2008
We present a novel shadow map parameterization to reduce perspective aliasing artifacts for both point and directional light sources. We derive the aliasing error equations for bo...
93
Voted
IJCAI
1993
15 years 2 months ago
1993
In this paper a framework is developed for measuring the complexities of deductions in an ab stract and computationally perspicuous man ner. As a notion of central importance ...
99
Voted
CORR
2008
Springer
15 years 27 days ago
2008
Springer
Abstract--Effective complexity measures the information content of the regularities of an object. It has been introduced by M. Gell-Mann and S. Lloyd to avoid some of the disadvant...
123
Voted
RTA
2010
Springer
15 years 4 months ago
2010
Springer
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...