578 search results - page 76 / 116 » The Minimum-Entropy Set Cover Problem |
JGAA
2006
13 years 8 months ago
2006
We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize the classical Min Coloring problem by using not only stable sets but also cliques to cover ...
ICCSA
2003
Springer
14 years 2 months ago
2003
Springer
A speaker model in speaker recognition system is to be trained from a large data set gathered in multiple sessions. Large data set requires large amount of memory and computation, ...
KDD
2008
ACM
14 years 9 months ago
2008
ACM
In this paper, we propose a set of novel regression-based approaches to effectively and efficiently summarize frequent itemset patterns. Specifically, we show that the problem of ...
ICML
2009
IEEE
14 years 3 months ago
2009
IEEE
Given a large-scale linked document collection, such as a collection of blog posts or a research literature archive, there are two fundamental problems that have generated a lot o...
COLT
2006
Springer
14 years 19 days ago
2006
Springer
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...