Sciweavers

5448 search results - page 441 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
FOCS
2000
IEEE
15 years 11 months ago
The Randomness Recycler: A New Technique for Perfect Sampling
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
James Allen Fill, Mark Huber
IPPS
2006
IEEE
16 years 26 days ago
Bio-sequence database scanning on a GPU
Protein sequences with unknown functionality are often compared to a set of known sequences to detect functional similarities. Efficient dynamic programming algorithms exist for t...
Weiguo Liu, Bertil Schmidt, Gerrit Voss, Adrian Sc...
PPOPP
2006
ACM
16 years 24 days ago
Predicting bounds on queuing delay for batch-scheduled parallel machines
Most space-sharing parallel computers presently operated by high-performance computing centers use batch-queuing systems to manage processor allocation. In many cases, users wishi...
John Brevik, Daniel Nurmi, Richard Wolski
TMI
2010
133views more  TMI 2010»
15 years 5 months 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
DEBS
2007
ACM
15 years 10 months ago
On adding replies to publish-subscribe
Recently, the publish-subscribe communication model has attracted the attention of developers as a viable alternative to traditional communication schemas, like request/reply, for...
Gianpaolo Cugola, Matteo Migliavacca, Alessandro M...