4009 search results - page 199 / 802 » Clustering on Complex Graphs |
147
Voted
ICALP
1992
Springer
15 years 8 months ago
1992
Springer
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
128
Voted
IPL
2006
15 years 4 months ago
2006
We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n ) using O(nmax(2,4+)) processing
150
click to vote
ISBI
2006
IEEE
16 years 4 months ago
2006
IEEE
Tagged Magnetic Resonance Imaging (MRI) is currently the reference MR modality for myocardial motion and strain analysis. Mutual Information (MI) based non rigid registration has ...
155
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
130
click to vote
SEMWEB
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. An important open question in the semantic Web is the precise relationship between the RDF(S) semantics and the semantics of standard knowledge representation formalisms ...