Sciweavers

855 search results - page 120 / 171
» Complexity of Equations over Sets of Natural Numbers
Sort
View
DAC
2009
ACM
15 years 11 months ago
Mode grouping for more effective generalized scheduling of dynamic dataflow applications
For a number of years, dataflow concepts have provided designers of digital signal processing systems with environments capable of expressing high-level software architectures as ...
William Plishker, Nimish Sane, Shuvra S. Bhattacha...
TAMC
2009
Springer
15 years 4 months ago
Approximation and Hardness Results for Label Cut and Related Problems
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
Peng Zhang, Jin-yi Cai, Linqing Tang, Wenbo Zhao
CBSE
2005
Springer
15 years 3 months ago
Unlocking the Grid
The grid has emerged as a novel paradigm that supports seamless cooperation of distributed, heterogeneous computing resources in addressing highly complex computing and data manage...
Chris Mattmann, Nenad Medvidovic, Paul M. Ramirez,...
EGH
2005
Springer
15 years 3 months ago
Optimal automatic multi-pass shader partitioning by dynamic programming
Complex shaders must be partitioned into multiple passes to execute on GPUs with limited hardware resources. Automatic partitioning gives rise to an NP-hard scheduling problem tha...
Alan Heirich
IWPEC
2004
Springer
15 years 3 months ago
Chordless Paths Through Three Vertices
Consider the following problem, that we call “Chordless Path through Three Vertices” or CP3V, for short: Given a simple undirected graph G = (V, E), a positive integer k, and t...
Robert Haas, Michael Hoffmann