773 search results - page 39 / 155 » Suffix Trees on Words |
176
click to vote
BIBM
2010
IEEE
15 years 3 months ago
2010
IEEE
The emergence of data rich domains has led to an exponential growth in the size and number of data repositories, offering exciting opportunities to learn from the data using machin...
185
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
158
click to vote
ACL
2010
15 years 4 months ago
2010
We propose Bilingual Tree Kernels (BTKs) to capture the structural similarities across a pair of syntactic translational equivalences and apply BTKs to sub-tree alignment along wi...
178
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
185
click to vote
DAM
2011
15 years 1 months ago
2011
In this paper, we study the Minimum Sum Set Coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersectio...