Sciweavers

17298 search results - page 319 / 3460
» Abstract computing machines
Sort
View
STACS
1999
Springer
15 years 11 months ago
A Logical Characterisation of Linear Time on Nondeterministic Turing Machines
The paper gives a logical characterisation of the class NTIME(n) of problems that can be solved on a nondeterministic Turing machine in linear time. It is shown that a set L of str...
Clemens Lautemann, Nicole Schweikardt, Thomas Schw...
DAC
1996
ACM
15 years 10 months ago
Stochastic Sequential Machine Synthesis Targeting Constrained Sequence Generation
- The problem of stochastic sequential machines (SSM) synthesis is addressed and its relationship with the constrained sequence generation problem which arises during power estimat...
Diana Marculescu, Radu Marculescu, Massoud Pedram
ICDCS
1993
IEEE
15 years 10 months ago
Diagnosis of Single Transition Faults in Communicating Finite State Machines
In this paper, we propose a diagnostic algorithm for the case where distributed system specifications (implementations) are given in the form of communicating finite state machine...
Abderrazak Ghedamsi, Gregor von Bochmann, Rachida ...
ACL
2010
15 years 4 months ago
Pseudo-Word for Phrase-Based Machine Translation
The pipeline of most Phrase-Based Statistical Machine Translation (PB-SMT) systems starts from automatically word aligned parallel corpus. But word appears to be too fine-grained ...
Xiangyu Duan, Min Zhang, Haizhou Li
ACL
2010
15 years 4 months ago
Fixed Length Word Suffix for Factored Statistical Machine Translation
Factored Statistical Machine Translation extends the Phrase Based SMT model by allowing each word to be a vector of factors. Experiments have shown effectiveness of many factors, ...
Narjes Sharif Razavian, Stephan Vogel