2272 search results - page 232 / 455 » Capture Complexity by Partition |
137
click to vote
ACSD
2010
IEEE
15 years 1 months ago
2010
IEEE
Self-timed circuits present an attractive solution to the problem of process variation. However, implementing selftimed combinational logic can be complex and expensive. This pape...
123
click to vote
CASES
2010
ACM
15 years 1 months ago
2010
ACM
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
141
Voted
IEEEPACT
2009
IEEE
15 years 1 months ago
2009
IEEE
Abstract--Chip-MultiProcessor (CMP) architectures are becoming more and more popular as an alternative to the traditional processors that only extract instruction-level parallelism...
123
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
135
click to vote
ICASSP
2010
IEEE
14 years 10 months ago
2010
IEEE
Cooperative communication with multi-antenna relays can significantly increase the reliability and speed. However, cooperative MIMO detection would impose considerable complexity o...