Sciweavers

730 search results - page 54 / 146
» Developing a Foundation for Code Optimization
Sort
View
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
15 years 8 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
DLS
2010
204views Languages» more  DLS 2010»
15 years 11 days ago
Alias analysis for optimization of dynamic languages
Dynamic languages such as Python allow programs to be written more easily using high-level constructs such as comprehensions for queries and using generic code. Efficient executio...
Michael Gorbovitski, Yanhong A. Liu, Scott D. Stol...
112
Voted
SCAM
2008
IEEE
15 years 8 months ago
Modular Decompilation of Low-Level Code by Partial Evaluation
Decompiling low-level code to a high-level intermediate representation facilitates the development of analyzers, model checkers, etc. which reason about properties of the low-leve...
Miguel Gómez-Zamalloa, Elvira Albert, Germ&...
99
Voted
ICIP
1997
IEEE
16 years 3 months ago
Complexity-Regularized Image Denoising
We develop a new approach to image denoising based on complexity regularization. This technique presents a flexible alternative to the more conventional l2 , l1 , and Besov regula...
Juan Liu, Pierre Moulin
ICRA
1998
IEEE
91views Robotics» more  ICRA 1998»
15 years 6 months ago
Multi-Resolution Planning for Earthmoving
We suggest that planning for automated earthmoving operations such as digging a foundation or leveling a mound of soil, be treated at multiple levels. In a system that we have dev...
Sanjiv Singh, Howard Cannon