Sciweavers

7109 search results - page 156 / 1422
» Process Algebra with Combinators
Sort
View
109
Voted
CONNECTION
2004
71views more  CONNECTION 2004»
15 years 3 months ago
Lack of combinatorial productivity in language processing with simple recurrent networks
An astronomical set of sentences can be produced in natural language by combining relatively simple sentence structures with a human-size lexicon. These sentences are within the ra...
Frank van der Velde, Gwendid T. van der Voort van ...
137
Voted
EMISA
2006
Springer
15 years 7 months ago
A Unified Formal Foundation for Service Oriented Architectures
: This paper summarizes how an algebra for mobile systems, the -calculus, can be applied as unified formal foundation to service oriented architectures (SOA). The concepts accounte...
Frank Puhlmann
121
Voted
CSR
2008
Springer
15 years 5 months ago
Invariant Generation for P-Solvable Loops with Assignments
We discuss interesting properties of a general technique for inferring polynomial invariants for a subfamily of imperative loops, called the P-solvable loops, with assignments only...
Laura Kovács
122
Voted
JAT
2006
77views more  JAT 2006»
15 years 3 months ago
On extensions of a theorem of Baxter
We combine the Riemann-Hilbert approach with the techniques of Banach algebras to obtain an extension of Baxter's Theorem for polynomials orthogonal on the unit circle. This ...
Jeffrey S. Geronimo, Andrei Martínez-Finkel...
110
Voted
DM
2002
93views more  DM 2002»
15 years 3 months ago
A proof of the q, t-Catalan positivity conjecture
We present here a proof that a certain rational function Cn(q, t) which has come to be known as the "q, t-Catalan" is in fact a polynomial with positive integer coeffici...
Adriano M. Garsia, James Haglund