656 search results - page 33 / 132 » Marrying Words and Trees |
120
click to vote
DAM
2002
14 years 11 months ago
2002
We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between p...
JACM
2000
14 years 11 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
105
click to vote
TCS
2010
14 years 10 months ago
2010
We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the use of non-linearity. We show how such problems can be described in terms of...
JORS
2010
14 years 6 months ago
2010
The Basel New Accord which is being implemented throughout the banking world on 1 January 2007 has made a significant difference to the use of modelling within financial organisat...
WWW
2007
ACM
16 years 15 days ago
2007
ACM
In this paper, we propose a new similarity measure to compute the pairwise similarity of text-based documents based on suffix tree document model. By applying the new suffix tree ...