Sciweavers

40 search results - page 7 / 8
» A Recursive Treatment of Collocations
Sort
View
JGS
2010
106views more  JGS 2010»
13 years 16 days ago
On vector autoregressive modeling in space and time
Despite the fact that it provides a potentially useful analytical tool, allowing for the joint modeling of dynamic interdependencies within a group of connected areas, until latel...
Valter Di Giacinto
CSL
2007
Springer
13 years 12 months ago
Typed Normal Form Bisimulation
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
Søren B. Lassen, Paul Blain Levy
DASFAA
2005
IEEE
128views Database» more  DASFAA 2005»
13 years 11 months ago
XDO2: A Deductive Object-Oriented Query Language for XML
In the past decade, researchers have combined deductive and object-oriented features to produce systems that are powerful and have excellent modeling capabilities. More recently, a...
Wei Zhang, Tok Wang Ling, Zhuo Chen, Gillian Dobbi...
PODS
1991
ACM
98views Database» more  PODS 1991»
13 years 9 months ago
Minimum and Maximum Predicates in Logic Programming
A novel approach is proposed for ezpresaing and computing eficienily a large cla88 of problem8, including jinding the shortest path in a graph, that were previously considered imp...
Sumit Ganguly, Sergio Greco, Carlo Zaniolo
ANLP
1992
137views more  ANLP 1992»
13 years 7 months ago
Compound Nouns in a Unification-Based MT System
This paper describes an approach to the treatment of nominal compounds in a machine translation project employing a modern unification-based system. General problems connected wit...
Pierrette Bouillon, Katharina Boesefeldt, Graham R...