Sciweavers

1960 search results - page 221 / 392
» The Logic of Large Enough
Sort
View
IPPS
2008
IEEE
14 years 5 months ago
Heterogenous dating service with application to rumor spreading
Peer-to-Peer overlay networks have proven their efficiency for storing and retrieving data at large scale, but new services are required to take the actual performances of resour...
Olivier Beaumont, Philippe Duchon, Miroslaw Korzen...
BIBE
2007
IEEE
128views Bioinformatics» more  BIBE 2007»
14 years 5 months ago
QOMA2: Optimizing the alignment of many sequences
Abstract—We consider the problem of aligning multiple protein sequences with the goal of maximizing the SP (Sum-of-Pairs) score, when the number of sequences is large. The QOMA (...
Xu Zhang, Tamer Kahveci
VISUALIZATION
2005
IEEE
14 years 4 months ago
Streaming Meshes
Recent years have seen an immense increase in the complexity of geometric data sets. Today’s gigabyte-sized polygon models can no longer be completely loaded into the main memor...
Martin Isenburg, Peter Lindstrom
SC
2000
ACM
14 years 3 months ago
Performance of Hybrid Message-Passing and Shared-Memory Parallelism for Discrete Element Modeling
The current trend in HPC hardware is towards clusters of shared-memory (SMP) compute nodes. For applications developers the major question is how best to program these SMP cluster...
D. S. Henty
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
14 years 2 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill