Sciweavers

288 search results - page 31 / 58
» Compositional Machine Transliteration
Sort
View
RE
2004
Springer
15 years 7 months ago
Composing Requirements Using Problem Frames
Problem Frames are a systematic approach to the decomposition of problems that allows us to relate requirements, domain properties, and machine specifications. Having decomposed a...
Robin C. Laney, Leonor Barroca, Michael Jackson, B...
COCO
1992
Springer
82views Algorithms» more  COCO 1992»
15 years 6 months ago
Functional Characterizations of Uniform Log-depth and Polylog-depth Circuit Families
We characterize the classes of functions computable by uniform log-depth (NC1) and polylog-depth circuit families as closures of a set of base functions. (The former is equivalent...
Stephen A. Bloch
JLP
2010
73views more  JLP 2010»
14 years 8 months ago
Composing model programs for analysis
Model programs are high-level behavioral specifications used for software testing and design analysis. Composition of model programs is a versatile technique that, at one end of t...
Margus Veanes, Jonathan Jacky
BLISS
2007
IEEE
15 years 8 months ago
Evolving the Face of a Criminal: How to Search a Face Space More Effectively
Witnesses and victims of serious crime are often required to construct a facial composite, a visual likeness of a suspect’s face. The traditional method is for them to select in...
Charlie D. Frowd, Vicki Bruce, Carol Gannon, Mark ...
CSL
1992
Springer
15 years 6 months ago
Communicating Evolving Algebras
We develop the rst steps of a theory of concurrency within the framework of evolving algebras of Gurevich, with the aim of investigating its suitability for the role of a general f...
Paola Glavan, Dean Rosenzweig