Sciweavers

1346 search results - page 33 / 270
» On the number of rectangular partitions
Sort
View
COMBINATORICS
2004
94views more  COMBINATORICS 2004»
13 years 7 months ago
A Bijection Between Classes of Fully Packed Loops and Plane Partitions
It has recently been observed empirically that the number of FPL configurations with 3 sets of a, b and c nested arches equals the number of plane partitions in a box of size a
P. Di Francesco, Paul Zinn-Justin, Jean-Bernard Zu...
CORR
2010
Springer
155views Education» more  CORR 2010»
13 years 7 months ago
Combinatorial Approximation Algorithms for MaxCut using Random Walks
: We give the first combinatorial approximation algorithm for MAXCUT that beats the trivial 0.5 factor by a constant. The main partitioning procedure is very intuitive, natural, an...
Satyen Kale, C. Seshadhri
COMPLEXITY
2010
120views more  COMPLEXITY 2010»
13 years 4 months ago
The complexity of partition tasks
In this paper we introduce the Partition Task problem class along with a complexity measure to evaluate its instances and a performance measure to quantify the ability of a system...
Fernando Eesponda, Matías Vera-Cruz, Jorge ...
ICCAD
2006
IEEE
119views Hardware» more  ICCAD 2006»
14 years 4 months ago
Post-placement voltage island generation
High power consumption will shorten battery life for handheld devices and cause thermal and reliability problems. One way to lower the dynamic power consumption is to reduce the s...
Royce L. S. Ching, Evangeline F. Y. Young, Kevin C...
DM
2008
145views more  DM 2008»
13 years 7 months ago
Clique coverings and partitions of line graphs
A clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a collection C of cliques such that each edge of G occurs in at least (exactly) one clique...
Bo-Jr Li, Gerard J. Chang