Sciweavers

1830 search results - page 140 / 366
» Workshop on Graph Computation Models
Sort
View
SBACPAD
2005
IEEE
177views Hardware» more  SBACPAD 2005»
15 years 10 months ago
Automatic Data-Flow Graph Generation of MPI Programs
The Data-Flow Graph (DFG) of a parallel application is frequently used to take scheduling decisions, based on the information that it models (dependencies among the tasks and volu...
Rafael Ennes Silva, Guilherme P. Pezzi, Nicolas Ma...
122
Voted
FCCM
2009
IEEE
171views VLSI» more  FCCM 2009»
15 years 11 months ago
Accelerating SPICE Model-Evaluation using FPGAs
—Single-FPGA spatial implementations can provide an order of magnitude speedup over sequential microprocessor implementations for data-parallel, floating-point computation in SP...
Nachiket Kapre, André DeHon
164
Voted
CORR
2010
Springer
141views Education» more  CORR 2010»
15 years 4 months ago
Termination Detection of Local Computations
Contrary to the sequential world, the processes involved in a distributed system do not necessarily know when a computation is globally finished. This paper investigates the proble...
Emmanuel Godard, Yves Métivier, Gerard Tel
141
Voted
ICML
2008
IEEE
16 years 5 months ago
Graph kernels between point clouds
Point clouds are sets of points in two or three dimensions. Most kernel methods for learning on sets of points have not yet dealt with the specific geometrical invariances and pra...
Francis R. Bach
160
Voted
DAGM
2008
Springer
15 years 6 months ago
MAP-Inference for Highly-Connected Graphs with DC-Programming
The design of inference algorithms for discrete-valued Markov Random Fields constitutes an ongoing research topic in computer vision. Large state-spaces, none-submodular energy-fun...
Jörg H. Kappes, Christoph Schnörr