1940 search results - page 186 / 388 » Graph Transformation with Variables |
167
Voted
FOSSACS
2006
Springer
15 years 7 months ago
2006
Springer
Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference gr...
136
Voted
EJC
2008
15 years 3 months ago
2008
The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to i...
125
Voted
JEC
2006
15 years 3 months ago
2006
Many applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). In our previous work, we proposed a ...
154
Voted
PKDD
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. The eigenspectrum of a graph Laplacian encodes smoothness information over the graph. A natural approach to learning involves transforming the spectrum of a graph Laplaci...
140
Voted
MCS
2010
Springer
15 years 5 months ago
2010
Springer
Selecting a set of good and diverse base classifiers is essential for building multiple classifier systems. However, almost all commonly used procedures for selecting such base cla...