Sciweavers

819 search results - page 123 / 164
» Parallelization with Tree Skeletons
Sort
View
ASAP
2002
IEEE
170views Hardware» more  ASAP 2002»
14 years 2 months ago
Reviewing 4-to-2 Adders for Multi-Operand Addition
Recently there has been quite a number of papers discussing the use of redundant 4-to-2 adders for the accumulation of partial products in multipliers, claiming one type to be sup...
Peter Kornerup
COCOON
1999
Springer
14 years 2 months ago
An External Memory Data Structure for Shortest Path Queries
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
David A. Hutchinson, Anil Maheshwari, Norbert Zeh
EMNLP
2009
13 years 7 months ago
Parser Adaptation and Projection with Quasi-Synchronous Grammar Features
We connect two scenarios in structured learning: adapting a parser trained on one corpus to another annotation style, and projecting syntactic annotations from one language to ano...
David A. Smith, Jason Eisner
CONCURRENCY
2000
133views more  CONCURRENCY 2000»
13 years 9 months ago
OpenMP versus threading in C/C++
When comparing OpenMP to other parallel programming models, it is easier to choose between OpenMP and MPI than between OpenMP and POSIX Threads (Pthreads). With languages like C a...
Bob Kuhn, Paul Petersen, Eamonn O'Toole
IPPS
2007
IEEE
14 years 4 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...