779 search results - page 86 / 156 » Algorithms for the Sample Mean of Graphs |
179
click to vote
TCAD
1998
15 years 5 months ago
1998
— We introduce a transformation, named rephasing, that manipulates the timing parameters in control-data-flow graphs (CDFG’s) during the high-level synthesis of data-pathinten...
175
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Learning to cope with domain change has been known
as a challenging problem in many real-world applications.
This paper proposes a novel and efficient approach, named
domain ada...
183
click to vote
WWW
2010
ACM
16 years 1 months ago
2010
ACM
PageRank computes the importance of each node in a directed graph under a random surfer model governed by a teleportation parameter. Commonly denoted alpha, this parameter models ...
170
click to vote
ACSAC
2005
IEEE
15 years 12 months ago
2005
IEEE
The typical means by which an attacker breaks into a network is through a chain of exploits, where each exploit in the chain lays the groundwork for subsequent exploits. Such a ch...
162
click to vote
KDD
2010
ACM
15 years 10 months ago
2010
ACM
In the traditional link prediction problem, a snapshot of a social network is used as a starting point to predict, by means of graph-theoretic measures, the links that are likely ...