Sciweavers

1805 search results - page 70 / 361
» Functional programming with structured graphs
Sort
View
IPPS
2006
IEEE
14 years 4 months ago
Effecting parallel graph eigensolvers through library composition
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
A. Breuer, Peter Gottschling, Douglas Gregor, Andr...
ALMOB
2006
138views more  ALMOB 2006»
13 years 10 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh
PPDP
2010
Springer
13 years 9 months ago
Graph queries through datalog optimizations
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
K. Tuncay Tekle, Michael Gorbovitski, Yanhong A. L...
ENTCS
2002
141views more  ENTCS 2002»
13 years 10 months ago
Coalgebraic Monads
This paper introduces coalgebraic monads as a unified model of term algebras covering fundamental examples such as initial algebras, final coalgebras, rational terms and term grap...
Neil Ghani, Christoph Lüth, Federico De March...
IFL
2001
Springer
137views Formal Methods» more  IFL 2001»
14 years 3 months ago
A Generic Programming Extension for Clean
Abstract. Generic programming enables the programmer to define functions by induction on the structure of types. Defined once, such a generic function can be used to generate a s...
Artem Alimarine, Marinus J. Plasmeijer