Sciweavers

446 search results - page 6 / 90
» Abstract Interpretation Using Typed Decision Graphs
Sort
View
FOSSACS
2009
Springer
14 years 2 months ago
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
Lars Birkedal, Kristian Støvring, Jacob Tha...
ECEASST
2008
171views more  ECEASST 2008»
13 years 7 months ago
Type Checking C++ Template Instantiation by Graph Programs
Abstract: Templates are a language feature of C++ and can be used for metaprogramming. The metaprogram is executed by the compiler and outputs source code which is then compiled. T...
Karl Azab, Karl-Heinz Pennemann
ILP
1997
Springer
13 years 11 months ago
A Logical Framework for Graph Theoretical Decision Tree Learning
Abstract. We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classi ed graph is represente...
Peter Geibel, Fritz Wysotzki
ICANNGA
2007
Springer
129views Algorithms» more  ICANNGA 2007»
13 years 11 months ago
Multi-class Support Vector Machines Based on Arranged Decision Graphs and Particle Swarm Optimization for Model Selection
Abstract. The use of support vector machines for multi-category problems is still an open field to research. Most of the published works use the one-against-rest strategy, but with...
Javier Acevedo, Saturnino Maldonado-Bascón,...
ICCL
1992
IEEE
13 years 11 months ago
Static analysis of PostScript code
rogram. Our abstract interpretation algorithm may then be used to perform static type analysis. The analysis has applications in detecting probable errors in the PostScript code or...
R. Nigel Horspool, Jan Vitek