281 search results - page 47 / 57 » Graph Kernels |
CASES
2007
ACM
15 years 1 months ago
2007
ACM
We present an efficient framework for dynamic reconfiguration of application-specific custom instructions. A key component of this framework is an iterative algorithm for temporal...
ICS
1995
Tsinghua U.
15 years 1 months ago
1995
Tsinghua U.
Modulo scheduling is an e cient technique for exploiting instruction level parallelism in a variety of loops, resulting in high performance code but increased register requirement...
CSCWD
2005
Springer
14 years 11 months ago
2005
Springer
This paper presents a simple and novel structure representation supporting the assembly and disassembly planning of electromechanical products. The proposed Relationship Matrix de...
ESANN
2004
14 years 11 months ago
2004
Standard pattern recognition provides effective and noise-tolerant tools for machine learning tasks; however, most approaches only deal with real vectors of a finite and fixed dime...
TAMC
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...