2314 search results - page 353 / 463 » Minimal Partitions of a Graph |
135
click to vote
ICCAD
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper proposes a new bipatition-codec architecture that may reduce power consumption of pipelined circuits. We treat each output value of a pipelined circuit as one state of ...
162
click to vote
INFOCOM
1998
IEEE
1998
IEEE
Performance Bounds for Dynamic Channel Assignment Schemes Operating under Varying Re-Use Constraints
15 years 10 months ago
-We derive bounds for the performance of dynamic channel assignment (DCA) schemeswhich strengthenthe existing Erlang bound. The construction of the bounds is based on a reward para...
159
click to vote
PLDI
1998
ACM
15 years 10 months ago
1998
ACM
In conventional superscalar microarchitectures with partitioned integer and floating-point resources, all floating-point resources are idle during execution of integer programs....
173
click to vote
DATE
2009
IEEE
15 years 10 months ago
2009
IEEE
As application complexity increases, modern embedded systems have adopted heterogeneous processing elements to enhance the computing capability or to reduce the power consumption. ...
151
click to vote
GLOBECOM
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract--In this paper, we propose a near-maximum likelihood (ML) detection method referred to as reduced dimension ML search (RD-MLS). The RD-MLS detector is based on a partition...