Sciweavers

320 search results - page 7 / 64
» Run-Time Support for Optimizations Based on Escape Analysis
Sort
View
CDC
2009
IEEE
180views Control Systems» more  CDC 2009»
15 years 27 days ago
Robustness analysis for Least Squares kernel based regression: an optimization approach
—In kernel based regression techniques (such as Support Vector Machines or Least Squares Support Vector Machines) it is hard to analyze the influence of perturbed inputs on the ...
Tillmann Falck, Johan A. K. Suykens, Bart De Moor
89
Voted
DAC
2009
ACM
15 years 10 months ago
Optimal static WCET-aware scratchpad allocation of program code
Caches are notorious for their unpredictability. It is difficult or even impossible to predict if a memory access will result in a definite cache hit or miss. This unpredictabilit...
Heiko Falk, Jan C. Kleinsorge
FCT
2001
Springer
15 years 2 months ago
Best Increments for the Average Case of Shellsort
This paper presents the results of using sequential analysis to find increment sequences that minimize the average running time of Shellsort, for array sizes up to several thousan...
Marcin Ciura
IJCV
1998
105views more  IJCV 1998»
14 years 9 months ago
Robust Algorithms for Object Localization
Object localization using sensed data features and corresponding model features is a fundamental problem in machine vision. We reformulate object localization as a least squares p...
Aaron S. Wallack, Dinesh Manocha
JUCS
2007
84views more  JUCS 2007»
14 years 9 months ago
Optimized Compilation of Around Advice for Aspect Oriented Programs
: The technology that supports Aspect-Oriented Programming (AOP) tools is inherently intrusive, since it changes the behavior of base application code. Advice weaving performed by ...
Eduardo S. Cordeiro, Roberto da Silva Bigonha, Mar...