Sciweavers

1434 search results - page 180 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
ICPP
2006
IEEE
15 years 8 months ago
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
David A. Bader, Kamesh Madduri
CCGRID
2005
IEEE
15 years 8 months ago
Dynamic load balancing experiments in a grid
Connected world-widely distributed computers and data systems establish a global source of processing power and data, called a grid. Key properties of a grid are the fact that com...
Menno Dobber, Ger Koole, Robert D. van der Mei
SPAA
2005
ACM
15 years 7 months ago
Parallelizing time with polynomial circuits
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
Ryan Williams
TMI
2010
133views more  TMI 2010»
15 years 19 days ago
Synthetic Magnetic Resonance Imaging Revisited
—Synthetic magnetic resonance (MR) imaging is an approach suggested in the literature to predict MR images at different design parameter settings from at least three observed MR ...
Ranjan Maitra, John J. Riddles

Presentation
1518views
17 years 3 months ago
Stochastic Segmentation of Blood Vessels From Time-of-Flight
In this paper, we present an automatic statistical approach for extracting 3D blood vessels from time-of-flight (TOF) magnetic resonance angiography (MRA) data. The voxels of the d...
M. Sabry Hassouna