Sciweavers

1999 search results - page 167 / 400
» Finding Reductions Automatically
Sort
View
TACAS
1997
Springer
146views Algorithms» more  TACAS 1997»
15 years 2 months ago
Compositional State Space Generation from Lotos Programs
This paper describes a compositional approach to generate the labeled transition system representing the behavior of a Lotos program by repeatedly alternating composition and reduc...
Jean-Pierre Krimm, Laurent Mounier
ICDAR
2007
IEEE
15 years 2 months ago
Towards Explainable Writer Verification and Identification Using Vantage Writers
In this paper, a new method for off-line writer verification and identification is proposed which encodes writer features as a mix of typical handwriting styles, written by so-cal...
Axel Brink, Lambert Schomaker, Marius Bulacu
ICASSP
2009
IEEE
15 years 2 months ago
Improved clustered hierarchical tandem system with bottom-up processing
The outputs of multi-layer perceptron (MLP) classifiers have been successfully used in tandem systems as features for HMM-based automatic speech recognition. In a previous paper, ...
Shuo-Yiin Chang, Lin-Shan Lee
AMAST
2006
Springer
15 years 1 months ago
The Substitution Vanishes
Abstract. Accumulation techniques were invented to transform functional programs, which intensively use append functions (like inefficient list reversal), into more efficient progr...
Armin Kühnemann, Andreas Maletti
75
Voted
ISLPED
1995
ACM
70views Hardware» more  ISLPED 1995»
15 years 1 months ago
Transformation and synthesis of FSMs for low-power gated-clock implementation
We present a technique that automatically synthesizes nite state machines with gated clocks to reduce the power dissipation of the nal implementation. We describe a new transfor...
Luca Benini, Giovanni De Micheli