3818 search results - page 234 / 764 » Word Problems on Compressed Words |
143
click to vote
ECML
1993
Springer
15 years 10 months ago
1993
Springer
This paper addresses the problem of classifying observations when features are context-sensitive, specifically when the testing set involves a context that is different from the t...
155
click to vote
STOC
1990
ACM
15 years 10 months ago
1990
ACM
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
182
click to vote
DAGSTUHL
2006
15 years 8 months ago
2006
In this report paper we collect recent results on the vertex reconstruction in Cayley graphs Cay(G, S). The problem is stated as the problem of reconstructing a vertex from the mi...
158
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
Given a graph G and a spanning tree T of G, we say that T is a tree t-spanner of G if the distance between every pair of vertices in T is at most t times their distance in G. The p...
156
click to vote
ALGORITHMICA
2008
15 years 6 months ago
2008
We propose and study the Maximum Constrained Agreement Subtree (MCAST) problem, which is a variant of the classical Maximum Agreement Subtree (MAST) problem. Our problem allows us...