Sciweavers

1251 search results - page 149 / 251
» Optimizing Compilation of CLP(R)
Sort
View
IRREGULAR
1995
Springer
15 years 1 months ago
Run-Time Techniques for Parallelizing Sparse Matrix Problems
Sparse matrix problems are di cult to parallelize e ciently on message-passing machines, since they access data through multiple levels of indirection. Inspector executor strategie...
Manuel Ujaldon, Shamik D. Sharma, Joel H. Saltz, E...
OOPSLA
1991
Springer
15 years 1 months ago
Object-Oriented Type Inference
We present a new approach to inferring types in untyped object-oriented programs with inheritance, assignments, and late binding. It guarantees that all messages are understood, a...
Jens Palsberg, Michael I. Schwartzbach
LREC
2010
158views Education» more  LREC 2010»
14 years 11 months ago
Lexicon Design for Transcription of Spontaneous Voice Messages
Building a comprehensive pronunciation lexicon is a crucial element in the success of any speech recognition engine. The first stage of lexicon design involves the compilation of ...
Michal Gishri, Vered Silber-Varod, Ami Moyal
CASCON
1996
89views Education» more  CASCON 1996»
14 years 11 months ago
A comparison of algorithms for interprocedural class analysis
Message passing overhead is often a substantial source of runtime overhead in object-oriented applications. To combat this performance problem, a number of techniques have been de...
David Grove
IEEEPACT
2007
IEEE
15 years 4 months ago
Automatic Correction of Loop Transformations
Loop nest optimization is a combinatorial problem. Due to the growing complexity of modern architectures, it involves two increasingly difficult tasks: (1) analyzing the profita...
Nicolas Vasilache, Albert Cohen, Louis-Noël P...