267 search results - page 21 / 54 » Core Decomposition in Graphs: Concepts, Algorithms and Appli... |
BMCBI
2008
13 years 8 months ago
2008
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...
SIGMOD
2010
ACM
14 years 1 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
PPOPP
2009
ACM
14 years 9 months ago
2009
ACM
Irregular programs are programs organized around pointer-based data structures such as trees and graphs. Recent investigations by the Galois project have shown that many irregular...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Abstract. Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements correspon...
ICASSP
2008
IEEE
14 years 3 months ago
2008
IEEE
We propose in this paper a robust multi-resolution technique to estimate dense velocity field from image sequences. It couples a Gaussian pyramidal down-sampling decomposition to...