15033 search results - page 69 / 3007 » Complexity Theory and Algorithms |
117
Voted
JOLLI
1998
15 years 3 months ago
1998
This paper shows how proof nets can be used to formalize the notion of “incomplete dependency” used in psycholinguistic theories of the unacceptability of center-embedded const...
145
Voted
COMPGEOM
2003
ACM
15 years 8 months ago
2003
ACM
We address the problem of curvature estimation from sampled smooth surfaces. Building upon the theory of normal cycles, we derive a definition of the curvature tensor for polyhed...
140
Voted
CASC
2006
Springer
15 years 7 months ago
2006
Springer
Homological Perturbation Theory [11, 13] is a well-known general method for computing homology, but its main algorithm, the Basic Perturbation Lemma, presents, in general, high com...
139
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
132
Voted
COLT
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...