1039 search results - page 88 / 208 » Kernels and Regularization on Graphs |
130
click to vote
ECCV
2008
Springer
16 years 2 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
80
Voted
JCT
2007
15 years 18 days ago
2007
Every finite, self-dual, regular (or chiral) 4-polytope of type {3, q, 3} has a trivalent 3-transitive (or 2-transitive) medial layer graph. Here, by dropping self-duality, we ob...
111
Voted
INFOCOM
2007
IEEE
15 years 7 months ago
2007
IEEE
— High-speed backbones are regularly affected by various kinds of network anomalies, ranging from malicious attacks to harmless large data transfers. Different types of anomalies...
113
Voted
ARTMED
2004
15 years 17 days ago
2004
: Image segmentation plays a crucial role in many medical imaging applications. In this paper, we present a novel algorithm for fuzzy segmentation of magnetic resonance imaging (MR...
97
Voted
MOC
2010
14 years 7 months ago
2010
In this paper, a Jacobi-collocation spectral method is developed for Volterra integral equations of the second kind with a weakly singular kernel. We use some function transformati...