Sciweavers

6437 search results - page 167 / 1288
» Parallel Algorithms for Arrangements
Sort
View
ICCS
2003
Springer
15 years 8 months ago
A Parallel Virtual Machine for Bulk Synchronous Parallel ML
We have designed a functional data-parallel language called BSML for programming bulk-synchronous parallel (BSP) algorithms. The execution time can be estimated and dead-locks and ...
Frédéric Gava, Frédéri...
ISVC
2010
Springer
15 years 22 days ago
Indented Pixel Tree Plots
We introduce Indented Pixel Tree Plots (IPTPs): a novel pixel-based visualization technique for depicting large hierarchies. It is inspired by the visual metaphor of indented outli...
Michael Burch, Michael Raschke, Daniel Weiskopf
IPL
2006
151views more  IPL 2006»
15 years 2 months ago
Approximating weighted matchings in parallel
We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 - ). This improves the previously best approximation ratio of...
Stefan Hougardy, Doratha E. Drake Vinkemeier
VLDB
1995
ACM
149views Database» more  VLDB 1995»
15 years 6 months ago
Managing Intra-operator Parallelism in Parallel Database Systems
Abstract: Intra-operator(or partitioned) parallelism is a well-established mechanism for achieving high performance in parallel database systems. However, the problem of how to exp...
Manish Mehta 0002, David J. DeWitt
ICGA
1993
75views Optimization» more  ICGA 1993»
15 years 4 months ago
Structure and Performance of Fine-Grain Parallelism in Genetic Search
Within the parallel genetic algorithm framework, there currently exists a growing dichotomy between coarse-pain and fine-grain parallel architectures. This paper attempts to chara...
Shumeet Baluja