1022 search results - page 157 / 205 » New models and algorithms for programmable networks |
103
click to vote
SIAMJO
2011
14 years 7 months ago
2011
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
104
click to vote
MICRO
2010
IEEE
14 years 10 months ago
2010
IEEE
As the number of cores and threads in manycore compute accelerators such as Graphics Processing Units (GPU) increases, so does the importance of on-chip interconnection network des...
118
click to vote
VLSISP
2002
15 years 5 days ago
2002
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
110
Voted
AAAI
2011
14 years 16 days ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
108
click to vote
IWNAS
2008
IEEE
15 years 7 months ago
2008
IEEE
Data streaming applications, usually composed with sequential/parallel tasks in a data pipeline form, bring new challenges to task scheduling and resource allocation in grid envir...