2503 search results - page 129 / 501 » A study of 3-arc graphs |
180
click to vote
PPOPP
2012
ACM
14 years 1 months ago
2012
ACM
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
168
click to vote
PPOPP
2009
ACM
16 years 6 months ago
2009
ACM
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
173
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
In this article we describe a visual-analytic tool for the interrogation of evolving interaction network data such as those found in social, bibliometric, WWW and biological appli...
164
click to vote
GECCO
2009
Springer
16 years 25 days ago
2009
Springer
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
152
click to vote
PKDD
2009
Springer
16 years 24 days ago
2009
Springer
In this paper we introduce graph-evolution rules, a novel type of frequency-based pattern that describe the evolution of large networks over time, at a local level. Given a sequenc...