903 search results - page 100 / 181 » Non-well-founded trees in categories |
146
click to vote
ISSAC
2007
Springer
16 years 13 days ago
2007
Springer
Through the use of a new disk-based method for enumerating very large orbits, condensation for orbits with tens of billions of elements can be performed. The algorithm is novel in...
190
click to vote
PKDD
2007
Springer
16 years 12 days ago
2007
Springer
In this paper, a method for automatic classification of Hidden-Web databases is addressed. In our approach, the classification tree for Hidden Web databases is constructed by tailo...
132
click to vote
SIGCSE
2006
ACM
16 years 7 days ago
2006
ACM
In this paper, we present an extensible visualization tool that is being used in a web-based closed laboratory system. The goal of this project is to provide a tool for both stude...
146
click to vote
INFOVIS
2005
IEEE
15 years 12 months ago
2005
IEEE
The general problem of visualizing “family trees”, or genealogical graphs, in 2D, is considered. A graph theoretic analysis is given, which identifies why genealogical graphs...
187
click to vote
TPHOL
2005
IEEE
15 years 12 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...