543 search results - page 27 / 109 » An Experimental Comparison of Several Clustering and Initial... |
135
click to vote
SAT
2010
Springer
14 years 12 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
119
click to vote
SIGIR
2006
ACM
15 years 7 months ago
2006
ACM
For the task of near-duplicated document detection, both traditional fingerprinting techniques used in database community and bag-of-word comparison approaches used in information...
116
Voted
BMCBI
2006
15 years 1 months ago
2006
Background: Deluged by the rate and complexity of completed genomic sequences, the need to align longer sequences becomes more urgent, and many more tools have thus been developed...
BMCBI
2010
15 years 1 months ago
2010
Background: A major goal of the analysis of high-dimensional RNA expression data from tumor tissue is to identify prognostic signatures for discriminating patient subgroups. For t...
102
click to vote
PAKDD
2004
ACM
15 years 6 months ago
2004
ACM
This paper proposes a two-step graph partitioning method to discover constrained clusters with an objective function that follows the well-known minmax clustering principle. Compar...