5316 search results - page 894 / 1064 » Which Search Problems Are Random |
144
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
127
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we revisit the sparse multiple measurement vector (MMV) problem, where the aim is to recover a set of jointly sparse multichannel vectors from incomplete measurement...
106
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
A common task in many text mining applications is to generate a multi-faceted overview of a topic in a text collection. Such an overview not only directly serves as an informative...
138
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
150
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
This paper presents a study of a novel summarization problem called contrastive opinion summarization (COS). Given two sets of positively and negatively opinionated sentences whic...