Sciweavers

4255 search results - page 12 / 851
» Cover
Sort
View
MICS
2010
124views more  MICS 2010»
13 years 2 months ago
An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
George B. Mertzios, Walter Unger
SIGSOFT
2007
ACM
14 years 8 months ago
Towards incremental adaptive covering arrays
The increasing complexity of configurable software systems creates a need for more intelligent sampling mechanisms to detect and locate failure-inducing dependencies between confi...
Adam A. Porter, Myra B. Cohen, Sandro Fouché...
SIGMOD
2005
ACM
161views Database» more  SIGMOD 2005»
14 years 7 months ago
Mining Top-k Covering Rule Groups for Gene Expression Data
In this paper, we propose a novel algorithm to discover the topk covering rule groups for each row of gene expression profiles. Several experiments on real bioinformatics datasets...
Gao Cong, Kian-Lee Tan, Anthony K. H. Tung, Xin Xu
ADMA
2009
Springer
142views Data Mining» more  ADMA 2009»
14 years 2 months ago
Crawling Deep Web Using a New Set Covering Algorithm
Abstract. Crawling the deep web often requires the selection of an appropriate set of queries so that they can cover most of the documents in the data source with low cost. This ca...
Yan Wang, Jianguo Lu, Jessica Chen
WG
2007
Springer
14 years 1 months ago
Minimum-Weight Cycle Covers and Their Approximability
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
Bodo Manthey