6142 search results - page 88 / 1229 » The Complexity of Partition Functions |
COMBINATORICS
2007
14 years 10 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
CASES
2003
ACM
15 years 3 months ago
2003
ACM
Focusing on embedded applications, scratchpad memories (SPMs) look like a best-compromise solution when taking into account performance, energy consumption and die area. The main ...
ASPDAC
1999
ACM
15 years 2 months ago
1999
ACM
In this paper, we present a fast and efficient Iterative Improvement Partitioning (IIP) technique for VLSI circuits and hybrid bucket structures on its implementation. Due to thei...
JMMA
2010
14 years 4 months ago
2010
An original algorithm is presented that generates both restricted integer compositions and restricted integer partitions that can be constrained simultaneously by a) upper and low...
CVPR
2001
IEEE
15 years 12 months ago
2001
IEEE
Particle filters have proven to be an effective tool for visual tracking in non-gaussian, cluttered environments. Conventional particle filters however do not scale to the problem...