1805 search results - page 185 / 361 » Functional programming with structured graphs |
177
click to vote
GMP
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract. Riemann surfaces naturally appear in the analysis of complex functions that are branched over the complex plane. However, they usually possess a complicated topology and ...
CICLING
2003
Springer
15 years 6 months ago
2003
Springer
Finite-state processing is typically based on structures that allow for efficient indexing and sequential search. However, this “rigid” framework has several disadvantages when...
134
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
118
click to vote
ICSM
2007
IEEE
15 years 7 months ago
2007
IEEE
In many application areas, including piracy detection, software debugging and maintenance, situations arise in which there is a need for comparing two versions of a program that d...
128
click to vote
ICLP
1997
Springer
15 years 5 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...