903 search results - page 21 / 181 » Non-well-founded trees in categories |
103
click to vote
ENTCS
2010
14 years 11 months ago
2010
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...
101
click to vote
EDBT
2011
ACM
14 years 3 months ago
2011
ACM
This demonstration paper presents a probabilistic XML data merging tool, that represents the outcome of semi-structured document integration as a probabilistic tree. The system is...
100
click to vote
BMCBI
2008
14 years 12 months ago
2008
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...
84
Voted
SIGCSE
2005
ACM
15 years 5 months ago
2005
ACM
Red-black trees and leftist heaps are classic data structures that are commonly taught in Data Structures (CS2) and/or Algorithms (CS7) courses. This paper describes alternatives ...
SIGGRAPH
1996
ACM
15 years 3 months ago
1996
ACM
The result of a scene manipulation is usually displayed by rerendering the entire image even if the change has affected only a small portion of it. This paper presents a system th...