776 search results - page 79 / 156 » Distributed Information Regularization on Graphs |
100
click to vote
MSR
2006
ACM
15 years 8 months ago
2006
ACM
Files, classes, or methods have frequently been investigated in recent research on co-change. In this paper, we present a first study at the level of lines. To identify line chan...
130
click to vote
BIRD
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We describe a new method for the exploration of evolutionary relations between protein structures. The approach is based on the ESSM algorithm for detecting structural mu...
103
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
114
click to vote
ICS
1989
Tsinghua U.
15 years 6 months ago
1989
Tsinghua U.
Control intensive scalar programs pose a very different challenge to highly pipelined supercomputers than vectorizable numeric applications. Function call/return and branch instru...
150
Voted
BMCBI
2005
15 years 2 months ago
2005
Background: Graph theory provides a computational framework for modeling a variety of datasets including those emerging from genomics, proteomics, and chemical genetics. Networks ...