Sciweavers

1805 search results - page 147 / 361
» Functional programming with structured graphs
Sort
View
POPL
2007
ACM
16 years 1 months ago
Scrap your boilerplate with XPath-like combinators
XML programming involves idioms for expressing `structure shyness' such as the descendant axis of XPath or the default templates of XSLT. We initiate a discussion of the rela...
Ralf Lämmel
FSTTCS
2009
Springer
15 years 7 months ago
Fractional Pebbling and Thrifty Branching Programs
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
ECOOP
2003
Springer
15 years 6 months ago
Higher-Order Hierarchies
This paper explains how higher-order hierarchies can be used to handle the expression problem. The expression is concerned with extending both the set of data structures and the s...
Erik Ernst
ICANN
2007
Springer
15 years 7 months ago
Unbiased SVM Density Estimation with Application to Graphical Pattern Recognition
Abstract. Classification of structured data (i.e., data that are represented as graphs) is a topic of interest in the machine learning community. This paper presents a different,...
Edmondo Trentin, Ernesto Di Iorio
ICFP
2008
ACM
16 years 1 months ago
Efficient nondestructive equality checking for trees and graphs
The Revised6 Report on Scheme requires its generic equivalence predicate, equal?, to terminate even on cyclic inputs. While the terminating equal? can be implemented via a DFA-equ...
Michael D. Adams, R. Kent Dybvig