Sciweavers

2219 search results - page 158 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
148
Voted
PPOPP
2009
ACM
16 years 3 months ago
Comparability graph coloring for optimizing utilization of stream register files in stream processors
A stream processor executes an application that has been decomposed into a sequence of kernels that operate on streams of data elements. During the execution of a kernel, all stre...
Xuejun Yang, Li Wang, Jingling Xue, Yu Deng, Ying ...
106
Voted
EOR
2010
149views more  EOR 2010»
15 years 2 months ago
Adaptive multicut aggregation for two-stage stochastic linear programs with recourse
Outer linearization methods for two-stage stochastic linear programs with recourse, such as the L-shaped algorithm, generally apply a single optimality cut on the nonlinear object...
Svyatoslav Trukhanov, Lewis Ntaimo, Andrew Schaefe...
116
Voted
ICCS
2009
Springer
15 years 9 months ago
Hiding Communication Latency with Non-SPMD, Graph-Based Execution
Reformulating an algorithm to mask communication delays is crucial in maintaining scalability, but traditional solutions embed the overlap strategy into the application. We present...
Jacob Sorensen, Scott B. Baden
118
Voted
ECOOP
2008
Springer
15 years 4 months ago
Computing Stack Maps with Interfaces
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...
Frédéric Besson, Thomas P. Jensen, T...
129
Voted
IPPS
1996
IEEE
15 years 6 months ago
Commutativity Analysis: A Technique for Automatically Parallelizing Pointer-Based Computations
This paper introduces an analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutati...
Martin C. Rinard, Pedro C. Diniz