Sciweavers

19866 search results - page 353 / 3974
» Computing all factorizations in ***
Sort
View
IPPS
2003
IEEE
16 years 2 days ago
Recovery Schemes for High Availability and High Performance Distributed Real-Time Computing
Clusters and distributed systems offer fault tolerance and high performance through load sharing, and are thus attractive in real-time applications. When all computers are up and ...
Lars Lundberg, Daniel Häggander, Kamilla Klon...
183
Voted
IPPS
2002
IEEE
15 years 11 months ago
Load-Balanced Parallel Merge Sort on Distributed Memory Parallel Computers
Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Merge sort can be parallelized, however, the conventional algorithm implement...
Minsoo Jeon, Dongseung Kim
COMPGEOM
2001
ACM
15 years 10 months ago
PRECISE: efficient multiprecision evaluation of algebraic roots and predicates for reliable geometric computation
: Many geometric problems like generalized Voronoi diagrams, medial axis computations and boundary evaluation involve computation and manipulation of non-linear algebraic primitive...
Shankar Krishnan, Mark Foskey, Tim Culver, John Ke...
BIBM
2010
IEEE
222views Bioinformatics» more  BIBM 2010»
15 years 4 months ago
CEO a cloud epistasis computing model in GWAS
The 1000 Genome project has made available a large number of single nucleotide polymorphisms (SNPs) for genome-wide association studies (GWAS). However, the large number of SNPs ha...
Zhengkui Wang, Yue Wang, Kian-Lee Tan, Limsoon Won...
VLDB
2003
ACM
141views Database» more  VLDB 2003»
16 years 7 months ago
Computing complete answers to queries in the presence of limited access patterns
In data applications such as information integration, there can be limited access patterns to relations, i.e., binding patterns require values to be specified for certain attribut...
Chen Li