1615 search results - page 148 / 323 » Computer science and decision theory |
78
Voted
ISVD
2007
IEEE
15 years 7 months ago
2007
IEEE
We introduce the use of weighted medial graph structures to represent sounds and musical events. Such structures permit the building of hierarchical neighborhood relationships (sy...
116
click to vote
TLCA
2007
Springer
15 years 6 months ago
2007
Springer
Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type, it provides a fold combinator encapsulating struc...
ACMSE
2006
ACM
15 years 6 months ago
2006
ACM
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...
87
Voted
RTA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. As a window into the subject, we recount some of the history (and geography) of two mature, challenging, partially open, partially closed problems in the theory of rewrit...
97
Voted
GG
2004
Springer
15 years 6 months ago
2004
Springer
We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives rise to recursively nested structures, in which each level of nesting corresponds ...