29908 search results - page 114 / 5982 » On the Complexity of |
163
click to vote
LATIN
1998
Springer
15 years 10 months ago
1998
Springer
The reconstruction of a shape or surface from a finite set of points is a practically significant and theoretically challenging problem. This paper presents a unified view of algor...
146
click to vote
ICECCS
1997
IEEE
15 years 10 months ago
1997
IEEE
An approach to problem analysis is described, based on the notion of a problem frame. Problem frames are intended to capture classes of recognisable and soluble problems. Because ...
161
click to vote
LFCS
1997
Springer
15 years 9 months ago
1997
Springer
The provability problem for the Horn fragment of linear logic is NP-complete [4, 1]. In this work we investigate various definitions of concurrency proposed in [2] and establish t...
189
click to vote
FSTTCS
1992
Springer
15 years 9 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
131
click to vote
COLT
2006
Springer
15 years 9 months ago
2006
Springer
Bounds are given for the empirical and expected Rademacher complexity of classes of linear transformations from a Hilbert space H to a ...nite dimensional space. The results imply ...