16404 search results - page 745 / 3281 » A set coverage problem |
191
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The ov...
174
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
Typechecking consists of statically verifying whether the output of an XML transformation always conforms to an output type for documents satisfying a given input type. In this ge...
168
click to vote
JCSS
2008
15 years 7 months ago
2008
We give a quadratic algorithm for the following structure identification problem: given a Boolean relation R and a finite set S of Boolean relations, can the relation R be express...
174
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Processing compressed strings without decompression is often essential when dealing with massive data sets. We consider local subsequence recognition problems on strings ...
190
click to vote
ML
2006
ACM
15 years 7 months ago
2006
ACM
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...