Sciweavers

153 search results - page 17 / 31
» Symbolic Implementation of the Best Transformer
Sort
View
VMCAI
2005
Springer
14 years 1 months ago
Information Flow Analysis for Java Bytecode
Abstract. We present a context-sensitive compositional analysis of information flow for full (mono-threaded) Java bytecode. Our idea consists in transforming the Java bytecode int...
Samir Genaim, Fausto Spoto
ESA
2004
Springer
166views Algorithms» more  ESA 2004»
14 years 1 months ago
Super Scalar Sample Sort
Sample sort, a generalization of quicksort that partitions the input into many pieces, is known as the best practical comparison based sorting algorithm for distributed memory para...
Peter Sanders, Sebastian Winkel
INFOCOM
2009
IEEE
14 years 2 months ago
Rateless Coding with Feedback
The erasure resilience of rateless codes, such as Luby-Transform (LT) codes, makes them particularly suitable to a wide variety of loss-prone wireless and sensor network applicati...
Andrew Hagedorn, Sachin Agarwal, David Starobinski...
EACL
1989
ACL Anthology
13 years 8 months ago
On The Generative Power Of Two-Level Morphological Rules
Koskenniemi's model of two-level morphology has been very influential in recent years, but definitions of the formalism have generally been phrased in terms of a compilation ...
Graeme D. Ritchie
IEEECIT
2010
IEEE
13 years 6 months ago
Exploiting More Parallelism from Applications Having Generalized Reductions on GPU Architectures
Reduction is a common component of many applications, but can often be the limiting factor for parallelization. Previous reduction work has focused on detecting reduction idioms a...
Xiao-Long Wu, Nady Obeid, Wen-Mei Hwu