Sciweavers

903 search results - page 31 / 181
» Non-well-founded trees in categories
Sort
View
CAISE
2005
Springer
15 years 5 months ago
Querying Tree-Structured Data Using Dimension Graphs
Abstract. Tree structures provide a popular means to organize the information on the Web. Taxonomies of thematic categories, concept hierarchies, e-commerce product catalogs are ex...
Dimitri Theodoratos, Theodore Dalamagas
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
15 years 5 months ago
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
Bryant A. Julstrom
SIGMETRICS
2009
ACM
149views Hardware» more  SIGMETRICS 2009»
15 years 6 months ago
On the treeness of internet latency and bandwidth
Existing empirical studies of Internet structure and path properties indicate that the Internet is tree-like. This work quantifies the degree to which at least two important Inte...
Venugopalan Ramasubramanian, Dahlia Malkhi, Fabian...
PODS
2010
ACM
170views Database» more  PODS 2010»
15 years 4 months ago
A learning algorithm for top-down XML transformations
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
Aurélien Lemay, Sebastian Maneth, Joachim N...
ISCA
2010
IEEE
214views Hardware» more  ISCA 2010»
15 years 1 months ago
Translation caching: skip, don't walk (the page table)
This paper explores the design space of MMU caches that accelerate virtual-to-physical address translation in processor architectures, such as x86-64, that use a radix tree page t...
Thomas W. Barr, Alan L. Cox, Scott Rixner