Sciweavers

815 search results - page 100 / 163
» Algebraic Recognizability of Languages
Sort
View
SIGMOD
2007
ACM
128views Database» more  SIGMOD 2007»
16 years 18 hour ago
A SQL: 1999 code generator for the pathfinder xquery compiler
The Pathfinder XQuery compiler has been enhanced by a new code generator that can target any SQL:1999-compliant relational database system (RDBMS). This code generator marks an im...
Torsten Grust, Manuel Mayr, Jan Rittinger, Sherif ...
CORR
2007
Springer
217views Education» more  CORR 2007»
14 years 11 months ago
Hard constraint satisfaction problems have hard gaps at location 1
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 6 months ago
Primitive words and roots of words
In the algebraic theory of codes and formal languages, the set Q of all primitive words over some alphabet Σ has received special interest. With this survey article we give an ove...
Gerhard Lischke
VLDB
2007
ACM
118views Database» more  VLDB 2007»
16 years 3 days ago
Eliminating Impedance Mismatch in C++
Recently, the C# and the VISUAL BASIC communities were tantalized by the advent of LINQ [18]--the Language INtegrated Query technology from Microsoft. LINQ represents a set of lan...
Joseph Gil, Keren Lenz
ICML
2009
IEEE
15 years 6 months ago
Grammatical inference as a principal component analysis problem
One of the main problems in probabilistic grammatical inference consists in inferring a stochastic language, i.e. a probability distribution, in some class of probabilistic models...
Raphaël Bailly, François Denis, Liva R...