819 search results - page 151 / 164 » Parallelization with Tree Skeletons |
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Abstract— This paper develops and compares two asynchronous distributed scheduling algorithms for multiple controlled searchlights in nonconvex polygonal environments. A searchli...
PC
2010
14 years 9 months ago
2010
The fat-tree is one of the topologies most widely used to build high-performance parallel computers. However, they are expensive and difficult to build. In this paper we propose t...
101
click to vote
SIAMCOMP
2010
14 years 9 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
103
click to vote
NAACL
2010
14 years 9 months ago
2010
Syntactic machine translation systems extract rules from bilingual, word-aligned, syntactically parsed text, but current systems for parsing and word alignment are at best cascade...
119
click to vote
CIARP
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. Parallel texts are enriched by alignment algorithms, thus establishing a relationship between the structures of the implied languages. Depending on the alignment level, t...