9842 search results - page 1623 / 1969 » The Complexity of the Matching-Cut Problem |
193
click to vote
ISCAS
2008
IEEE
16 years 1 months ago
2008
IEEE
— Since the complexity of MIMO detection algorithms is exponential, the K–best algorithm is often chosen for efficient VLSI implementation. This detection problem is often view...
165
click to vote
ISPASS
2008
IEEE
16 years 1 months ago
2008
IEEE
— This work addresses the problem of building representative subsets of benchmarks from an original large set of benchmarks, using statistical analysis techniques. The subsets sh...
180
click to vote
RAM
2008
IEEE
16 years 1 months ago
2008
IEEE
Eelectronic device technology has been monopolized by binary system for many years. The circs not only makes it impossible to break through the existing technology bottleneck, but...
192
click to vote
RTSS
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper presents algorithms that (1) facilitate systemindependent synthesis of timing-interfaces for subsystems and (2) system-level selection of interfaces to minimize CPU loa...
190
click to vote
SECURWARE
2008
IEEE
16 years 1 months ago
2008
IEEE
Filtering is a very important issue in next generation networks. These networks consist of a relatively high number of resource constrained devices with very special features, suc...