Sciweavers

819 search results - page 77 / 164
» Parallelization with Tree Skeletons
Sort
View
PPOPP
2009
ACM
15 years 10 months ago
How much parallelism is there in irregular applications?
Irregular programs are programs organized around pointer-based data structures such as trees and graphs. Recent investigations by the Galois project have shown that many irregular...
Milind Kulkarni, Martin Burtscher, Rajeshkar Inkul...
EUROPAR
2003
Springer
15 years 3 months ago
Why Not Use a Pattern-Based Parallel Programming System?
Parallel programming is seen as an effective technique to improve the performance of computationally-intensive programs. This is done at the cost of increasing the complexity of t...
John Anvik, Jonathan Schaeffer, Duane Szafron, Kai...
EUROPAR
2004
Springer
15 years 3 months ago
Near-Optimal Hot-Potato Routing on Trees
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, so that some conflicting packets must be deflected away from their destination...
Costas Busch, Malik Magdon-Ismail, Marios Mavronic...
TALG
2008
81views more  TALG 2008»
14 years 9 months ago
Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics
We introduce a new notion of embedding, called minimum-relaxation ordinal embedding, parallel to the standard notion of minimum-distortion (metric) embedding. In an ordinal embedd...
Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin F...
ACL
2010
14 years 7 months ago
Bayesian Synchronous Tree-Substitution Grammar Induction and Its Application to Sentence Compression
We describe our experiments with training algorithms for tree-to-tree synchronous tree-substitution grammar (STSG) for monolingual translation tasks such as sentence compression a...
Elif Yamangil, Stuart M. Shieber