3059 search results - page 37 / 612 » with Wide Functional Units |
120
click to vote
DCG
2002
15 years 4 months ago
2002
Let f(n) be the maximum number of unit distances determined by the vertices of a convex n-gon. Erdos and Moser conjectured that this function is linear. Supporting this conjecture...
161
click to vote
COCOA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. The node-weighted Steiner tree problem is a variation of classical Steiner minimum tree problem. Given a graph G = (V, E) with node weight function C : V → R+ and a sub...
106
click to vote
SAMOS
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we describe an efficient data fetch circuitry for retrieving several operands from a n-bank interleaved memory system in a single machine cycle. The proposed address ...
150
click to vote
ISCAS
2006
IEEE
15 years 10 months ago
2006
IEEE
— Bit and subword permutations are useful in many multimedia and cryptographic applications. New shift and permute instructions have been added to the instruction set of general-...
143
click to vote
ATS
2002
IEEE
15 years 9 months ago
2002
IEEE
As the deep sub-micron techniques evolving, embedded memories are dominating the yield, while the testing and measurement issues are more difficult due to the access limitations. ...