Sciweavers

40 search results - page 6 / 8
» A Recursive Treatment of Collocations
Sort
View
ICALP
2000
Springer
14 years 1 months ago
Decidable First-Order Transition Logics for PA-Processes
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
Denis Lugiez, Ph. Schnoebelen
TSD
2000
Springer
14 years 1 months ago
A Word Analysis System for German Hyphenation, Full Text Search, and Spell Checking, with Regard to the Latest Reform of German
In text processing systems German words require special treatment because of the possibility to form compound words as a combination of existing words. To this end, a universal wor...
Gabriele Kodydek
SLP
1989
87views more  SLP 1989»
13 years 11 months ago
Partial Evaluation in Prolog: Some Improvements about Cut
Two main aspects of Partial Evaluation for Prolog programs are considered: treatment of cuts and control of recursion. The analysis about cut is exhaustive: we consider occurrence...
Michele Bugliesi, F. Russo
JFP
2006
80views more  JFP 2006»
13 years 9 months ago
Static analysis for path correctness of XML queries
A part of a query that will never contribute data to the query answer should be regarded as an error. This principle has been recently accepted into mainstream XML query languages...
Dario Colazzo, Giorgio Ghelli, Paolo Manghi, Carlo...
ICASSP
2011
IEEE
13 years 1 months ago
The Bayesian inference of phase
Bayesian recursive inference of phase in additive Gaussian noise environments is studied. A tractable conjugate system is established using a von Mises distribution. Its shaping p...
Anthony Quinn, Jean-Pierre Barbot, Pascal Larzabal