593 search results - page 82 / 119 » An approach to benchmarking configuration complexity |
HIPEAC
2005
Springer
14 years 2 months ago
2005
Springer
This article aims at making iterative optimization practical and usable by speeding up the evaluation of a large range of optimizations. Instead of using a full run to evaluate a s...
COMPSAC
2003
IEEE
14 years 2 months ago
2003
IEEE
In this paper, we propose an algorithm to construct the Ordered Binary Decision Diagram (OBDD) representing the cut function of a terminal-pair network. The algorithm recognizes i...
TVLSI
2002
13 years 8 months ago
2002
In this paper, we propose a low-power approach to the design of embedded very long instruction word (VLIW) processor architectures based on the forwarding (or bypassing) hardware, ...
RECOMB
2005
Springer
14 years 9 months ago
2005
Springer
Abstract. In order to guarantee that the optimal motif is found, traditional pattern-driven approaches perform an exhaustive search over all candidate motifs of length l. We develo...
CVPR
2009
IEEE
15 years 4 months ago
2009
IEEE
Recently SVMs using spatial pyramid matching (SPM)
kernel have been highly successful in image classification.
Despite its popularity, these nonlinear SVMs have a complexity
O(n...