Sciweavers

2049 search results - page 12 / 410
» Normalization and Partial Evaluation
Sort
View
CC
2003
Springer
141views System Software» more  CC 2003»
15 years 4 months ago
A New One-Pass Transformation into Monadic Normal Form
We present a translation from the call-by-value λ-calculus to monadic normal forms that includes short-cut boolean evaluation. The translation is higher-order, operates in one pas...
Olivier Danvy
89
Voted
FGR
2008
IEEE
214views Biometrics» more  FGR 2008»
15 years 6 months ago
Normalized LDA for semi-supervised learning
Linear Discriminant Analysis (LDA) has been a popular method for feature extracting and face recognition. As a supervised method, it requires manually labeled samples for training...
Bin Fan, Zhen Lei, Stan Z. Li
95
Voted
ICFP
2005
ACM
15 years 5 months ago
Fast narrowing-driven partial evaluation for inductively sequential programs
Narrowing-driven partial evaluation is a powerful technique for the specialization of (first-order) functional and functional logic programs. However, although it gives good resu...
J. Guadalupe Ramos, Josep Silva, Germán Vid...
IJAC
2007
99views more  IJAC 2007»
14 years 11 months ago
Normalized Expressions and Finite Automata
There exist two well-known quotients of the position automaton of a regular expression. The first one, called the equation automaton, has first been introduced by Mirkin from th...
Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Zi...
91
Voted
DAC
2001
ACM
16 years 19 days ago
Factoring and Recognition of Read-Once Functions using Cographs and Normality
An approach for factoring general boolean functions was described in [15, 16] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for ...
Martin Charles Golumbic, Aviad Mintz, Udi Rotics