Sciweavers

903 search results - page 49 / 181
» Non-well-founded trees in categories
Sort
View
122
Voted
GECCO
2009
Springer
134views Optimization» more  GECCO 2009»
15 years 6 months ago
Estimating the distribution and propagation of genetic programming building blocks through tree compression
Shin et al [19] and McKay et al [15] previously applied tree compression and semantics-based simplification to study the distribution of building blocks in evolving Genetic Progr...
Robert I. McKay, Xuan Hoai Nguyen, James R. Cheney...
GIS
2007
ACM
16 years 3 months ago
TS2-tree - an efficient similarity based organization for trajectory data
The increasingly popular GPS technology and the growing amount of trajectory data it generates create the need for developing applications that efficiently store and query traject...
Petko Bakalov, Eamonn J. Keogh, Vassilis J. Tsotra...
WWW
2008
ACM
16 years 2 months ago
Genealogical trees on the web: a search engine user perspective
This paper presents an extensive study about the evolution of textual content on the Web, which shows how some new pages are created from scratch while others are created using al...
Ricardo A. Baeza-Yates, Álvaro R. Pereira J...
WWW
2004
ACM
16 years 2 months ago
KnowledgeTree: a distributed architecture for adaptive e-learning
This paper presents KnowledgeTree, an architecture for adaptive E-Learning based on distributed reusable intelligent learning activities. The goal of KnowledgeTree is to bridge th...
Peter Brusilovsky
PODS
2008
ACM
143views Database» more  PODS 2008»
16 years 2 months ago
XPath, transitive closure logic, and nested tree walking automata
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
Balder ten Cate, Luc Segoufin