202 search results - page 34 / 41 » Performance-Driven Partitioning Using a Replication Graph Ap... |
77
Voted
PKDD
2009
Springer
15 years 4 months ago
2009
Springer
Co-clustering has emerged as an important technique for mining contingency data matrices. However, almost all existing coclustering algorithms are hard partitioning, assigning each...
88
Voted
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
In this paper, we propose an online aggregation system called COSMOS (Continuous Sampling for Multiple queries in an Online aggregation System), to process multiple aggregate quer...
COCOA
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
82
Voted
BMCBI
2004
14 years 9 months ago
2004
Background: Image analysis is the first crucial step to obtain reliable results from microarray experiments. First, areas in the image belonging to single spots have to be identif...
74
Voted
BMCBI
2008
14 years 9 months ago
2008
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...