Sciweavers

866 search results - page 103 / 174
» Bidirectionalizing graph transformations
Sort
View
EJC
2008
14 years 10 months ago
Eriksson's numbers game and finite Coxeter groups
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...
Robert G. Donnelly
JEC
2006
61views more  JEC 2006»
14 years 9 months ago
Time-constrained loop scheduling with minimal resources
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 ...
Timothy W. O'Neil, Edwin Hsing-Mean Sha
MCS
2010
Springer
14 years 11 months ago
Selecting Structural Base Classifiers for Graph-Based Multiple Classifier Systems
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...
Wan-Jui Lee, Robert P. W. Duin, Horst Bunke
SIAMDM
2008
79views more  SIAMDM 2008»
14 years 9 months ago
Testing Triangle-Freeness in General Graphs
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
Noga Alon, Tali Kaufman, Michael Krivelevich, Dana...
FPGA
2010
ACM
243views FPGA» more  FPGA 2010»
15 years 6 months ago
Bit-level optimization for high-level synthesis and FPGA-based acceleration
d hardware design from behavior-level abstraction has drawn wide interest in FPGA-based acceleration and configurable computing research field. However, for many high-level progra...
Jiyu Zhang, Zhiru Zhang, Sheng Zhou, Mingxing Tan,...