1538 search results - page 67 / 308 » Spectral Techniques in Graph Algorithms |
119
click to vote
TVCG
2012
13 years 3 months ago
2012
—This paper proposes an algorithm to build a set of orthogonal Point-Based Manifold Harmonic Bases (PB-MHB) for spectral analysis over point-sampled manifold surfaces. To ensure ...
107
click to vote
STACS
2001
Springer
15 years 5 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
107
click to vote
ICML
2005
IEEE
16 years 2 months ago
2005
IEEE
We apply classic online learning techniques similar to the perceptron algorithm to the problem of learning a function defined on a graph. The benefit of our approach includes simp...
109
click to vote
WAW
2004
Springer
15 years 6 months ago
2004
Springer
In this paper we study the size of generalised dominating sets in two graph processes which are widely used to model aspects of the world-wide web. On the one hand, we show that gr...
121
click to vote
ICASSP
2010
IEEE
15 years 1 months ago
2010
IEEE
Artificial bandwidth extension (ABWE) of speech signals aims to estimate wideband speech (50 Hz – 7 kHz) from narrowband signals (300 Hz – 3.4 kHz). Applying the source-filt...