Sciweavers

1452 search results - page 82 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
89
Voted
ECOOP
2000
Springer
15 years 4 months ago
Optimizing Java Programs in the Presence of Exceptions
The support for precise exceptions in Java, combined with frequent checks for runtime exceptions, leads to severe limitations on the compiler’s ability to perform program optimiz...
Manish Gupta, Jong-Deok Choi, Michael Hind
SAC
2008
ACM
14 years 11 months ago
Flexible pointer analysis using assign-fetch graphs
se a new abstraction for pointer analysis that represents reads and writes to memory instead of traditional points-to relations. Compared to points-to graphs, our Assign-Fetch Gra...
Marcio Buss, Daniel Brand, Vugranam C. Sreedhar, S...
122
Voted
JMLR
2008
169views more  JMLR 2008»
15 years 9 days ago
Multi-class Discriminant Kernel Learning via Convex Programming
Regularized kernel discriminant analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. Its performance depends on the selection of kernel...
Jieping Ye, Shuiwang Ji, Jianhui Chen
DAC
2009
ACM
16 years 1 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
125
Voted
CAIP
2009
Springer
200views Image Analysis» more  CAIP 2009»
15 years 7 months ago
Real-Time Stereo Vision: Making More Out of Dynamic Programming
Abstract. Dynamic Programming (DP) is a popular and efficient method for calculating disparity maps from stereo images. It allows for meeting real-time constraints even on low-cos...
Jan Salmen, Marc Schlipsing, Johann Edelbrunner, S...