Titlebook: LATIN 2008: Theoretical Informatics; 8th Latin American S Eduardo Sany Laber,Claudson Bornstein,Luerbio Fari Conference proceedings 2008 Sp

合并

How to Complete a Doubling Metric,esearch has not only enhanced our understanding of finite metrics, but has also resulted in many algorithmic applications. However, we still do not understand the interaction between various graph-theoretic (topological) properties of graphs, and the doubling (geometric) properties of the shortest-p

外形

Factorable

紳士

Comparing and Aggregating Partially Resolved Trees,es are based on the topologies the input trees induce on .; that is, on three-element subsets of the set of species. For unrooted trees, the measures are based on . (four-element subsets). Triplet and quartet-based distances provide a robust and fine-grained measure of the similarities between trees

繁忙

Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices,c growth of the number . . of overlap-free words of length .. We obtain explicit formulas for the minimal and maximal rates of growth of . . in terms of spectral characteristics (the lower spectral radius and the joint spectral radius) of one set of matrices of dimension 20. Using these descriptions

Bumptious

Synchronism

BABY

The View Selection Problem for Regular Path Queries,sense. In this paper we study the view selection problem for regular path queries over semistructured data and two specific view-based query rewriting formalisms, namely single-word and arbitrary regular rewritings. We present an algorithm that for a given finite set of workload queries, i.e. for a

鍵琴

上漲

Coloring Geometric Range Spaces,mber of points contains points of many different colors. Using . colors, it is not always possible to ensure that every region containing . points contains all . colors. Thus, we introduce two relaxations: either we allow the number of colors to increase to .(.), or we require that the number of poi