Sciweavers

1452 search results - page 68 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
IEEEPACT
2000
IEEE
14 years 2 months ago
Region Formation Analysis with Demand-Driven Inlining for Region-Based Optimization
Region-based compilation repartitions a program into more desirable compilation units for optimization and scheduling, particularly beneficial for ILP architectures. With region-...
Tom Way, Ben Breech, Lori L. Pollock
ALDT
2009
Springer
184views Algorithms» more  ALDT 2009»
14 years 2 months ago
Inverse Analysis from a Condorcet Robustness Denotation of Valued Outranking Relations
In this article we develop an indirect approach for assessing criteria significance weights from the robustness of the significance that a decision maker acknowledges for his pai...
Raymond Bisdorff, Patrick Meyer, Thomas Veneziano
ICDAR
2009
IEEE
13 years 7 months ago
PixLabeler: User Interface for Pixel-Level Labeling of Elements in Document Images
We present a user interface design for labeling elements in document images at a pixel level. Labels are represented by overlay color, which might map to such terms as "handw...
Eric Saund, Jing Lin, Prateek Sarkar
IFL
2003
Springer
159views Formal Methods» more  IFL 2003»
14 years 3 months ago
Inferring Cost Equations for Recursive, Polymorphic and Higher-Order Functional Programs
Abstract This paper presents a type-based analysis for inferring sizeand cost-equations for recursive, higher-order and polymorphic functional programs without requiring user annot...
Pedro B. Vasconcelos, Kevin Hammond
POPL
2003
ACM
14 years 10 months ago
Static prediction of heap space usage for first-order functional programs
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...
Martin Hofmann, Steffen Jost