106 search results - page 6 / 22 » Two Element Unavoidable Sets of Partial Words |
DAM
2008
13 years 8 months ago
2008
A clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A clique-independent set is a collection of pairwise vertex-disjoint cliques. The clique...
RTA
2010
Springer
14 years 14 days ago
2010
Springer
Data words and data trees appear in verification and XML processing. The term “data” means that positions of the word, or tree, are decorated with elements of an infinite set...
ACML
2009
Springer
14 years 3 months ago
2009
Springer
Enterprises have accumulated both structured and unstructured data steadily as computing resources improve. However, previous research on enterprise data mining often treats these ...
SIAMCOMP
2000
13 years 8 months ago
2000
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
TIP
2008
13 years 8 months ago
2008
Abstract--In this paper, we present a complete and practical algorithm for the approximation of level-set-based curve evolution suitable for real-time implementation. In particular...