We present an efficient reduction mapping undirected graphs G with n = 2k vertices for integers k to tables of partially specified Boolean functions g : {0, 1}4k+1 {0, 1, } so tha...
This paper describes a novel resource binding technique for use in multiple-wordlength systems implemented in FPGAs. It is demonstrated that the multiple-wordlength binding problem...
George A. Constantinides, Peter Y. K. Cheung, Wayn...
Coarse Grained Reconfigurable Array (CGRA) architectures give high throughput and data reuse for regular algorithms while providing flexibility to execute multiple algorithms on th...
Named-entity recognition systems extract entities such as people, organizations, and locations from unstructured text. Rather than extract these mentions in isolation, this paper ...
GraphPlan-like and SATPLAN-like planners have shown to outperform classical planners for most of the classical planning domains. However, these two propositional approaches do not ...