2272 search results - page 6 / 455 » Capture Complexity by Partition |
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
DATE
2006
IEEE
14 years 1 months ago
2006
IEEE
Temporal partitioning techniques are useful to implement large and complex applications, which can be split into partitions in FPGA devices. In order to minimize resources, each o...
CATS
2008
13 years 8 months ago
2008
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
ICIC
2007
Springer
14 years 1 months ago
2007
Springer
: - This paper introduces the main ideas of the nested partitions (NP) method, analyses its efficiency theoretically and proposes the way to improve the optimization efficiency of ...
DAM
2008
13 years 7 months ago
2008
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...