819 search results - page 43 / 164 » Parallelization with Tree Skeletons |
81
Voted
COLING
1992
14 years 11 months ago
1992
This paper presents a direct implementation of Government-Binding theory in a parser for German, which faithfully models the modular structure of the theory. The modular design yi...
CCGRID
2002
IEEE
15 years 2 months ago
2002
IEEE
—Switch-trees are peer-to-peer algorithms for building and improving end-host multicast trees. Nodes switch parents to reduce tree cost or lower source-member latency. A node swi...
ASIACRYPT
2003
Springer
15 years 2 months ago
2003
Springer
We present two new parallel algorithms for extending the domain of a UOWHF. The first algorithm is complete binary tree based construction and has less key length expansion than S...
ICFP
2010
ACM
14 years 10 months ago
2010
ACM
Nested data-parallelism (NDP) is a declarative style for programming irregular parallel applications. NDP languages provide language features favoring the NDP style, efficient com...
IWCIA
2004
Springer
15 years 3 months ago
2004
Springer
Regions in an image graph can be described by their spanning tree. A graph pyramid is a stack of image graphs at different granularities. Integral features capture important prope...