Sciweavers

73 search results - page 12 / 15
» Recursion and grammars for CS2
Sort
View
BIRTHDAY
2003
Springer
14 years 3 months ago
Towards a Brain Compatible Theory of Syntax Based on Local Testability
Chomsky’s theory of syntax came after criticism of probabilistic associative models of word order in sentences. Immediate constituent structures are plausible but their descripti...
Stefano Crespi-Reghizzi, Valentino Braitenberg
ALT
1998
Springer
14 years 2 months ago
Synthesizing Learners Tolerating Computable Noisy Data
An index for an r.e. class of languages (by definition) generates a sequence of grammars defining the class. An index for an indexed family of recursive languages (by definition) ...
John Case, Sanjay Jain
PLDI
2010
ACM
14 years 7 months ago
A Context-free Markup Language for Semi-structured Text
An ad hoc data format is any non-standard, semi-structured data format for which robust data processing tools are not available. In this paper, we present ANNE, a new kind of mark...
Qian Xi, David Walker
STOC
2007
ACM
132views Algorithms» more  STOC 2007»
14 years 10 months ago
On the convergence of Newton's method for monotone systems of polynomial equations
Monotone systems of polynomial equations (MSPEs) are systems of fixed-point equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomial with p...
Stefan Kiefer, Michael Luttenberger, Javier Esparz...
CPM
2000
Springer
143views Combinatorics» more  CPM 2000»
14 years 2 months ago
Explaining and Controlling Ambiguity in Dynamic Programming
Abstract. Ambiguity in dynamic programming arises from two independent sources, the non-uniqueness of optimal solutions and the particular recursion scheme by which the search spac...
Robert Giegerich