Sciweavers

548 search results - page 25 / 110
» Parallel Relative Debugging with Dynamic Data Structures
Sort
View
PARCO
2003
15 years 3 months ago
SIMD design to solve partial differential equations
The relation between autonomous and communication phases determines the throughput of parallel structured information processing systems. Such a relation depends on the algorithm w...
R. W. Schulze
BMCBI
2011
14 years 5 months ago
Learning sparse models for a dynamic Bayesian network classifier of protein secondary structure
Background: Protein secondary structure prediction provides insight into protein function and is a valuable preliminary step for predicting the 3D structure of a protein. Dynamic ...
Zafer Aydin, Ajit Singh, Jeff Bilmes, William Staf...
IEEEPACT
1999
IEEE
15 years 6 months ago
Containers on the Parallelization of General-Purpose Java Programs
Automatic parallelization of general-purpose programs is still not possible in general in the presence of irregular data structures and complex control-flows. One promising strate...
Peng Wu, David A. Padua
129
Voted
COMPUTER
2000
138views more  COMPUTER 2000»
15 years 1 months ago
Making Pointer-Based Data Structures Cache Conscious
Processor and memory technology trends portend a continual increase in the relative cost of accessing main memory. Machine designers have tried to mitigate the effect of this tren...
Trishul M. Chilimbi, Mark D. Hill, James R. Larus
128
Voted
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
15 years 11 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu