Sciweavers

5624 search results - page 28 / 1125
» On Conditional Covering Problem
Sort
View
70
Voted
NETWORKS
2007
15 years 1 months ago
A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs
Katerina Asdre, Stavros D. Nikolopoulos
74
Voted
MP
2010
79views more  MP 2010»
15 years 22 days ago
MIP reformulations of the probabilistic set covering problem
Anureet Saxena, Vineet Goyal, Miguel A. Lejeune
66
Voted
CORR
2010
Springer
67views Education» more  CORR 2010»
14 years 11 months ago
Covering Cubes and the Closest Vector Problem
Friedrich Eisenbrand, Nicolai Hähnle, Martin ...
78
Voted
APAL
2006
54views more  APAL 2006»
15 years 2 months ago
Covering the Baire space by families which are not finitely dominating
It is consistent (relative to ZFC) that each union of max{b, g} many families in the Baire space which are not finitely dominating is not dominating. In particular, it is consist...
Heike Mildenberger, Saharon Shelah, Boaz Tsaban
KDD
2008
ACM
104views Data Mining» more  KDD 2008»
16 years 2 months ago
Succinct summarization of transactional databases: an overlapped hyperrectangle scheme
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
Yang Xiang, Ruoming Jin, David Fuhry, Feodor F. Dr...