1502 search results - page 107 / 301 » Node weighted scheduling |
162
click to vote
ECML
2006
Springer
15 years 8 months ago
2006
Springer
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...
176
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
— In this paper, we propose a new on-line learning algorithm for the non-linear system identification: the swarm intelligence aided multi-innovation recursive least squares (SIM...
145
click to vote
ICIP
2005
IEEE
16 years 7 months ago
2005
IEEE
In this paper, we investigate the use of discriminant techniques in the elastic graph matching (EGM) algorithm. First we use discriminant analysis in the feature vectors of the no...
155
click to vote
PAKDD
2010
ACM
15 years 11 months ago
2010
ACM
We present a novel graph ranking model to extract a diverse set of answers for complex questions via random walks over a negative-edge graph. We assign a negative sign to edge weig...
160
click to vote
NIPS
2004
15 years 7 months ago
2004
We propose a gossip-based distributed algorithm for Gaussian mixture learning, Newscast EM. The algorithm operates on network topologies where each node observes a local quantity ...