Sciweavers

84 search results - page 15 / 17
» On Degree Constrained Shortest Paths
Sort
View
ISCA
2012
IEEE
280views Hardware» more  ISCA 2012»
12 years 6 days ago
A case for random shortcut topologies for HPC interconnects
—As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance C...
Michihiro Koibuchi, Hiroki Matsutani, Hideharu Ama...
CVPR
2006
IEEE
14 years 11 months ago
Control Theory and Fast Marching Techniques for Brain Connectivity Mapping
We propose a novel, fast and robust technique for the computation of anatomical connectivity in the brain. Our approach exploits the information provided by Diffusion Tensor Magne...
Emmanuel Prados, Stefano Soatto, Christophe Lengle...
BMCBI
2007
80views more  BMCBI 2007»
13 years 10 months ago
A network perspective on the topological importance of enzymes and their phylogenetic conservation
Background: A metabolic network is the sum of all chemical transformations or reactions in the cell, with the metabolites being interconnected by enzyme-catalyzed reactions. Many ...
Wei-chung Liu, Wen-hsien Lin, Andrew J. Davis, Fer...
LATIN
2010
Springer
14 years 4 months ago
Sharp Separation and Applications to Exact and Parameterized Algorithms
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grando...
WWW
2009
ACM
14 years 10 months ago
Social search in "Small-World" experiments
The "algorithmic small-world hypothesis" states that not only are pairs of individuals in a large social network connected by short paths, but that ordinary individuals ...
Sharad Goel, Roby Muhamad, Duncan J. Watts