Sciweavers

1025 search results - page 52 / 205
» Improved Behaviour of Tries by the
Sort
View
ICS
1994
Tsinghua U.
15 years 6 months ago
Evaluating automatic parallelization for efficient execution on shared-memory multiprocessors
We present a parallel code generation algorithm for complete applications and a new experimental methodology that tests the efficacy of our approach. The algorithm optimizes for d...
Kathryn S. McKinley
TRECVID
2008
15 years 3 months ago
Informedia @ TRECVID2008: Exploring New Frontiers
The Informedia team participated in the tasks of Rushes summarization, high-level feature extraction and event detection in surveillance video. For the rushes summarization, our b...
Alexander G. Hauptmann, Robert V. Baron, Ming-yu C...
WDAG
2010
Springer
168views Algorithms» more  WDAG 2010»
15 years 9 days ago
Fast Randomized Test-and-Set and Renaming
Most people believe that renaming is easy: simply choose a name at random; if more than one process selects the same name, then try again. We highlight the issues that occur when t...
Dan Alistarh, Hagit Attiya, Seth Gilbert, Andrei G...
SIGSOFT
2001
ACM
16 years 2 months ago
An empirical study on the utility of formal routines to transfer knowledge and experience
Most quality and software process improvement frameworks emphasize written (i.e. formal) documentation to convey recommended work practices. However, there is considerable skeptic...
Reidar Conradi, Tore Dybå
IFL
2007
Springer
221views Formal Methods» more  IFL 2007»
15 years 8 months ago
From Contracts Towards Dependent Types: Proofs by Partial Evaluation
Abstract. The specification and resolution of non-trivial domain constraints has become a well-recognised measure for improving the stability of large software systems. In this pa...
Stephan Herhut, Sven-Bodo Scholz, Robert Bernecky,...