866 search results - page 98 / 174 » Bidirectionalizing graph transformations |
131
click to vote
GLVLSI
2002
IEEE
15 years 7 months ago
2002
IEEE
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...
118
Voted
EJC
2010
15 years 2 months ago
2010
Let X = (V, E) be a finite simple connected graph with n vertices and m edges. A configuration is an assignment of one of two colors, black or white, to each edge of X. A move app...
121
Voted
IJCNN
2007
IEEE
15 years 9 months ago
2007
IEEE
— To approximate complex data, we propose new type of low-dimensional “principal object”: principal cubic complex. This complex is a generalization of linear and nonlinear pr...
106
Voted
PDCAT
2007
Springer
15 years 9 months ago
2007
Springer
We present the architecture of nreduce, a distributed virtual machine which uses parallel graph reduction to run programs across a set of computers. It executes code written in a ...
119
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...