10891 search results - page 370 / 2179 » Combining Model Reductions |
191
Voted
ICTCS
2003
Springer
16 years 20 days ago
2003
Springer
We define a calculus for modeling dynamic linking independently of the details of a particular programming environment. The calculus distinguishes at the language level the notion...
206
Voted
ASP
2001
Springer
15 years 12 months ago
2001
Springer
We define a reduction system Ë¿ which preserves the stable semantics. This system includes two types of transformation rules. One type (which we call ˾) preserves the stable...
153
Voted
DATE
2009
IEEE
15 years 11 months ago
2009
IEEE
The process of sequential redundancy identification is the cornerstone of sequential synthesis and equivalence checking frameworks. The scalability of the proof obligations inhere...
176
Voted
FPCA
1995
15 years 11 months ago
1995
A number of useful optimisations are enabled if we can determine when a value is accessed at most once. We extend the Hindley-Milner type system with uses, yielding a typeinferenc...
208
Voted
NIPS
2004
15 years 8 months ago
2004
This paper investigates the effect of Kernel Principal Component Analysis (KPCA) within the classification framework, essentially the regularization properties of this dimensional...