1538 search results - page 17 / 308 » Spectral Techniques in Graph Algorithms |
ETS
2006
IEEE
14 years 1 months ago
2006
IEEE
Spectral analysis represents a key component in signal processing. The on-chip implementation of classical spectral estimation techniques is generally not considered as a viable B...
PR
2008
13 years 7 months ago
2008
Clustering algorithms are a useful tool to explore data structures and have been employed in many disciplines. The focus of this paper is the partitioning clustering problem with ...
SETA
2004
Springer
14 years 1 months ago
2004
Springer
We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n =...
SIAMDM
2008
13 years 7 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
Structural alignments are the most widely used tools for comparing proteins with low sequence similarity. The main contribution of this paper is to derive various kernels on prote...