Sciweavers

1095 search results - page 109 / 219
» A Parallel Algorithm for Computing Betweenness Centrality
Sort
View
130
Voted
ISBI
2008
IEEE
15 years 9 months ago
An optimal-path approach for neural circuit reconstruction
Neurobiologists are collecting large amounts of electron microscopy image data to gain a better understanding of neuron organization in the central nervous system. Image analysis ...
Elizabeth Jurrus, Ross T. Whitaker, Bryan W. Jones...
116
Voted
ICPADS
2005
IEEE
15 years 8 months ago
Distributed Spanning Tree Algorithms for Large Scale Traversals
— The Distributed Spanning Tree (DST) is an overlay structure designed to be scalable. It supports the growth from small scale to large scale. The DST is a tree without bottlenec...
Sylvain Dahan
143
Voted
PCRCW
1997
Springer
15 years 6 months ago
ChaosLAN: Design and Implementation of a Gigabit LAN Using Chaotic Routing
In recent years, theChaos Project at theUniversityofWashingtonhas analyzed and simulated a dozen routing algorithms. Three new routing algorithms have been invented; of these, the...
Neil R. McKenzie, Kevin Bolding, Carl Ebeling, Law...
116
Voted
BMCBI
2008
151views more  BMCBI 2008»
15 years 2 months ago
Application of the Linux cluster for exhaustive window haplotype analysis using the FBAT and Unphased programs
Background: Genetic association studies have been used to map disease-causing genes. A newly introduced statistical method, called exhaustive haplotype association study, analyzes...
Hiroyuki Mishima, Andrew C. Lidral, Jun Ni
CIKM
2001
Springer
15 years 7 months ago
Joint Optimization of Cost and Coverage of Query Plans in Data Integration
Existing approaches for optimizing queries in data integration use decoupled strategies–attempting to optimize coverage and cost in two separate phases. Since sources tend to ha...
Zaiqing Nie, Subbarao Kambhampati