1272 search results - page 90 / 255 » The Set Cover with Pairs Problem |
105
Voted
VLDB
2007
ACM
15 years 7 months ago
2007
ACM
Real-world datasets exhibit a complex dependency structure among the data attributes. Learning this structure is a key task in automatic statistics configuration for query optimi...
94
Voted
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
108
Voted
AMAI
1999
Springer
15 years 16 days ago
1999
Springer
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
131
Voted
ICCAD
1991
IEEE
15 years 4 months ago
1991
IEEE
This paper presents an efficient algorithm for the generation of diagnostic test patterns which distinguish between two arbitrary single stuck-at faults. The algorithm is able to ...
91
Voted
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
Let G = (V, E) be an undirected graph, and let B ⊆ V × V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X ...