Sciweavers

286 search results - page 4 / 58
» Weak Ordering - A New Definition
Sort
View
LOPSTR
1994
Springer
13 years 12 months ago
A Transformation System for Definite Programs Based on Termination Analysis
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
J. Cook, John P. Gallagher
LREC
2008
135views Education» more  LREC 2008»
13 years 9 months ago
Communicating Unknown Words in Machine Translation
A new approach to handle unknown words in machine translation is presented. The basic idea is to find definitions for the unknown words on the source language side and translate t...
Matthias Eck, Stephan Vogel, Alex Waibel
IJNSEC
2008
91views more  IJNSEC 2008»
13 years 7 months ago
A Weakness in Authenticated Encryption Schemes Based on Tseng et al.'s Schemes
Tseng et al. have introduced in 2003 an authenticated encryption scheme by using self-certified public keys. Based on this scheme several authors have proposed new signature schem...
Luis Hernández Encinas, Ángel Mart&i...
ADCM
2010
129views more  ADCM 2010»
13 years 8 months ago
Construction of positive definite cubature formulae and approximation of functions via Voronoi tessellations
Let Rd be a compact convex set of positive measure. In a recent paper, we established a definiteness theory for cubature formulae of order two on . Here we study extremal propert...
Allal Guessab, Gerhard Schmeisser
APSEC
2007
IEEE
13 years 12 months ago
Definition of an Executable SPEM 2.0
One major advantage of executable models is that once constructed, they can be run, checked, validated and improved in short incremental and iterative cycles. In the field of Soft...
Reda Bendraou, Benoît Combemale, Xavier Cr&e...