Sciweavers

819 search results - page 151 / 164
» Parallelization with Tree Skeletons
Sort
View
CORR
2007
Springer
107views Education» more  CORR 2007»
13 years 8 months ago
Asynchronous Distributed Searchlight Scheduling
Abstract— This paper develops and compares two asynchronous distributed scheduling algorithms for multiple controlled searchlights in nonconvex polygonal environments. A searchli...
Karl J. Obermeyer, Anurag Ganguli, Francesco Bullo
PC
2010
111views Management» more  PC 2010»
13 years 6 months ago
Reducing complexity in tree-like computer interconnection networks
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...
Javier Navaridas, José Miguel-Alonso, Franc...
SIAMCOMP
2010
120views more  SIAMCOMP 2010»
13 years 6 months ago
Edge Disjoint Paths in Moderately Connected Graphs
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...
Satish Rao, Shuheng Zhou
NAACL
2010
13 years 6 months ago
Joint Parsing and Alignment with Weakly Synchronized Grammars
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...
David Burkett, John Blitzer, Dan Klein
CIARP
2009
Springer
13 years 6 months ago
Incorporating Linguistic Information to Statistical Word-Level Alignment
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...
Eduardo Cendejas, Grettel Barceló, Alexande...