333 search results - page 12 / 67 » Automatic Generation of Parallel Treebanks |
ICS
2001
Tsinghua U.
13 years 12 months ago
2001
Tsinghua U.
This paper presents a novel technique to perform global optimization of communication and preprocessing calls in the presence of array accesses with arbitrary subscripts. Our sche...
IESS
2007
Springer
14 years 1 months ago
2007
Springer
The stringent performance constraints and short time to market of modern digital systems require automatic methods for design of high performance applicationspecific architectures...
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...
RIDE
1998
IEEE
13 years 11 months ago
1998
IEEE
This paper presents a method of automatically creating hypermedia documents from conventional transcriptions of television programs. Using parallel text alignment techniques, the ...
PPOPP
1999
ACM
13 years 12 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...