5096 search results - page 310 / 1020 » Landscape of Clustering Algorithms |
193
click to vote
NIPS
2008
15 years 8 months ago
2008
By attempting to simultaneously partition both the rows (examples) and columns (features) of a data matrix, Co-clustering algorithms often demonstrate surprisingly impressive perf...
208
click to vote
BIBE
2008
IEEE
16 years 1 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
196
click to vote
CLUSTER
2005
IEEE
16 years 8 days ago
2005
IEEE
In network protocol research a common goal is optimal bandwidth utilization, while still being network friendly. The drawback of TCP in networks with large bandwidth-delay product...
188
click to vote
UAI
2004
15 years 8 months ago
2004
An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well...
197
click to vote
GECCO
2010
Springer
15 years 5 months ago
2010
Springer
A multiobjective genetic algorithm for detecting communities in dynamic networks, i.e., networks that evolve over time, is proposed. The approach leverages on the concept of evolu...