2192 search results - page 181 / 439 » Algorithms for Challenging Motif Problems |
126
click to vote
WWW
2008
ACM
16 years 5 months ago
2008
ACM
We consider the problem of ranking refinement, i.e., to improve the accuracy of an existing ranking function with a small set of labeled instances. We are, particularly, intereste...
113
click to vote
WWW
2006
ACM
16 years 5 months ago
2006
ACM
Fitting enough information from webpages to make browsing on small screens compelling is a challenging task. One approach is to present the user with a thumbnail image of the full...
153
click to vote
KDD
2008
ACM
16 years 5 months ago
2008
ACM
Pattern discovery in sequences is an important problem in many applications, especially in computational biology and text mining. However, due to the noisy nature of data, the tra...
156
click to vote
KDD
2003
ACM
16 years 5 months ago
2003
ACM
We address the issues of discovering significant binary relationships in transaction datasets in a weighted setting. Traditional model of association rule mining is adapted to han...
148
click to vote
KDD
2002
ACM
16 years 5 months ago
2002
ACM
Automated detection of the first document reporting each new event in temporally-sequenced streams of documents is an open challenge. In this paper we propose a new approach which...