252 search results - page 32 / 51 » Automata for Data Words and Data Trees |
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
PR
2008
13 years 7 months ago
2008
The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has also been employed as a g...
ICTAI
2009
IEEE
14 years 2 months ago
2009
IEEE
A serious threat to user privacy in new mobile and web2.0 applications stems from ‘social inferences’. These unwanted inferences are related to the users’ identity, current ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
ALGORITHMICA
1999
13 years 7 months ago
1999
Sequence data for a group of species is often summarized by a distance matrix M where M[s, t] is the dissimilarity between the sequences of species s and t. An ordinal assertion is...