385 search results - page 11 / 77 » On higher-order perceptron algorithms |
FSTTCS
2004
Springer
14 years 1 months ago
2004
Springer
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...
ESOP
2003
Springer
14 years 1 months ago
2003
Springer
Previous methods have generally identified the location of a type error as a particular program point or the program subtree rooted at that point. We present a new approach that ...
POPL
1996
ACM
14 years 17 days ago
1996
ACM
operators. The analysis is abstract interpretation-based and is parameterized over two polyvariance operators and a projection operator. These operators are used to regulate the sp...
ICCBR
2007
Springer
14 years 2 months ago
2007
Springer
We present a novel approach to mine word similarity in Textual Case Based Reasoning. We exploit indirect associations of words, in addition to direct ones for estimating their simi...
CIAC
2010
Springer
14 years 1 months ago
2010
Springer
Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optim...