3068 search results - page 75 / 614 » Clustering with Multiple Graphs |
109
Voted
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
We propose a manifold learning approach to fiber tract clustering using a novel similarity measure between fiber tracts constructed from dual-rooted graphs. In particular, to gene...
120
click to vote
ALMOB
2006
15 years 18 days ago
2006
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
115
click to vote
ADHOC
2005
15 years 13 days ago
2005
Geographic routing protocols base their forwarding decisions on the location of the current device, its neighbors, and the packets destination. Early proposed heuristic greedy rou...
105
click to vote
ICPP
2009
IEEE
15 years 7 months ago
2009
IEEE
Providing continuous on-demand streaming services with VCR functionality over ubiquitous environments is challenging due to the stringent QoS requirements of streaming service as ...
112
Voted
ECML
2004
Springer
15 years 6 months ago
2004
Springer
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...