Sciweavers

1145 search results - page 19 / 229
» The Correctness of an Optimized Code Generation
Sort
View
APPROX
2005
Springer
96views Algorithms» more  APPROX 2005»
14 years 1 months ago
Tolerant Locally Testable Codes
An error-correcting code is said to be locally testable if it has an efficient spot-checking procedure that can distinguish codewords from strings that are far from every codeword...
Venkatesan Guruswami, Atri Rudra
IPMI
2005
Springer
14 years 8 months ago
A Genetic Algorithm for the Topology Correction of Cortical Surfaces
We propose a technique to accurately correct the spherical topology of cortical surfaces. We construct a mapping from the original surface onto the sphere to detect topological def...
Florent Ségonne, W. Eric L. Grimson, Bruce ...
KBSE
1998
IEEE
13 years 11 months ago
Automating UI Generation by Model Composition
Automated user-interface generation environments have been criticized for their failure to deliver rich and powerful interactive applications [18]. To specify more powerful system...
Kurt Stirewalt, Spencer Rugaber
PLDI
2010
ACM
14 years 19 days ago
A GPGPU compiler for memory optimization and parallelism management
This paper presents a novel optimizing compiler for general purpose computation on graphics processing units (GPGPU). It addresses two major challenges of developing high performa...
Yi Yang, Ping Xiang, Jingfei Kong, Huiyang Zhou
SAC
2008
ACM
13 years 7 months ago
Optimizing code through iterative specialization
Code specialization is a way to obtain significant improvement in the performance of an application. It works by exposing values of different parameters in source code. The availa...
Minhaj Ahmad Khan, Henri-Pierre Charles, Denis Bar...