Sciweavers

1897 search results - page 81 / 380
» Sparse Additive Machine
Sort
View
FDL
2006
IEEE
15 years 6 months ago
Formalizing TLM with Communicating State Machines
Transaction Level Models are widely being used as high-level reference models during embedded systems development. High simulation speed and great modeling flexibility are the ma...
Bernhard Niemann, Christian Haubelt
100
Voted
ISLPED
1998
ACM
94views Hardware» more  ISLPED 1998»
15 years 4 months ago
Theoretical bounds for switching activity analysis in finite-state machines
- The objective of this paper is to provide lower and upper bounds for the switching activity on the state lines in Finite State Machines (FSMs). Using a Markov chain model for the...
Diana Marculescu, Radu Marculescu, Massoud Pedram
CONPAR
1994
15 years 4 months ago
The Rewrite Rule Machine Node Architecture and Its Performance
The Rewrite Rule Machine (RRM) is a massively parallel MIMD/SIMD computer designed with the explicit purpose of supporting veryhigh-level parallel programming with rewrite rules. T...
Patrick Lincoln, José Meseguer, Livio Ricci...
84
Voted
OHS
2000
Springer
15 years 4 months ago
Accessing the History of the Web: A Web Way-Back Machine
One of the deficiencies of the World Wide Web is that the Web does not have a memory. Web resources always display one revision only, namely the latest one. In addition, once a Web...
Joachim Feise
102
Voted
EMNLP
2007
15 years 2 months ago
A Systematic Comparison of Training Criteria for Statistical Machine Translation
We address the problem of training the free parameters of a statistical machine translation system. We show significant improvements over a state-of-the-art minimum error rate tr...
Richard Zens, Sasa Hasan, Hermann Ney