Sciweavers

6142 search results - page 13 / 1229
» The Complexity of Partition Functions
Sort
View
ARSCOM
2002
70views more  ARSCOM 2002»
13 years 7 months ago
On the Number of Graphical Forest Partitions
A graphical partition of the even integer n is a partition of n where each part of the partition is the degree of a vertex in a simple graph and the degree sum of the graph is n. ...
Deborah A. Frank, Carla D. Savage, James A. Seller...
IWOCA
2009
Springer
123views Algorithms» more  IWOCA 2009»
14 years 1 months ago
Computability of Width of Submodular Partition Functions
The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether ...
Petr Skoda
TIP
2008
111views more  TIP 2008»
13 years 7 months ago
Unsupervised Bayesian Convex Deconvolution Based on a Field With an Explicit Partition Function
This paper proposes a non-Gaussian Markov field with a special feature: an explicit partition function. To the best of our knowledge, this is an original contribution. Moreover, th...
Jean-François Giovannelli
EURODAC
1995
IEEE
128views VHDL» more  EURODAC 1995»
13 years 11 months ago
Closeness metrics for system-level functional partitioning
An important system design task is the partitioning of system functionality for implementation among multiple system components, including partitions among hardware and software c...
Frank Vahid, Daniel D. Gajski
COMBINATORICS
2004
70views more  COMBINATORICS 2004»
13 years 7 months ago
On a Partition Function of Richard Stanley
In this paper, we examine partitions classified according to the number r() of odd parts in and s() the number of odd parts in , the conjugate of . The generating function for ...
George E. Andrews