126 search results - page 10 / 26 » BAG: a graph theoretic sequence clustering algorithm |
112
click to vote
COMBINATORICA
2008
15 years 1 months ago
2008
Algorithms are given for computing the number of n-element diagonal sets and the number of n-element strongly diagonal sets of binary sequences of length at most 2n - 2. The first...
112
click to vote
FOCS
1994
IEEE
15 years 7 months ago
1994
IEEE
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
134
click to vote
IROS
2008
IEEE
15 years 9 months ago
2008
IEEE
— In many computer vision related applications it is necessary to distinguish between the background of an image and the objects that are contained in it. This is a difficult pr...
125
click to vote
DATE
2009
IEEE
15 years 10 months ago
2009
IEEE
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
120
click to vote
DIS
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a particularly popular class being spectral clust...