2229 search results - page 304 / 446 » Comparative analysis of biclustering algorithms |
118
click to vote
SIGSOFT
2005
ACM
16 years 1 months ago
2005
ACM
We develop a method for matching dynamic histories of program executions of two program versions. The matches produced can be useful in many applications including software piracy...
99
Voted
SIGMETRICS
2004
ACM
15 years 6 months ago
2004
ACM
This paper explores and quantifies garbage collection behavior for three whole heap collectors and generational counterparts: copying semi-space, mark-sweep, and reference counti...
88
Voted
MFCS
2001
Springer
15 years 5 months ago
2001
Springer
In the traveling repairman problem (Trp), a tour must be found through every one of a set of points (cities) in some metric space such that the weighted sum of completion times of ...
124
Voted
BMCBI
2010
15 years 26 days ago
2010
Background: It has now become clear that gene-gene interactions and gene-environment interactions are ubiquitous and fundamental mechanisms for the development of complex diseases...
97
Voted
KAIS
2006
15 years 21 days ago
2006
Clustering has been one of the most widely studied topics in data mining and k-means clustering has been one of the popular clustering algorithms. K-means requires several passes ...