310 search results - page 47 / 62 » dam 2008 |
DAM
1998
13 years 9 months ago
1998
We give a simple and natural proof of (an extension of) the identity P(k, l, n) = P2(k − 1, l − 1, n − 1). The number P(k, l, n) counts noncrossing partitions of {1, 2, . . ...
DAM
2006
13 years 10 months ago
2006
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neigh...
DAM
2006
13 years 10 months ago
2006
Sub-dominant theory provides efficient tools for clustering. However it classically works only for ultrametrics and ad hoc extensions like Jardine and Sibson's 2ultrametrics....
DAM
2006
13 years 10 months ago
2006
A floorplan represents the relative relations between modules on an integrated circuit. Floorplans are commonly classified as slicing, mosaic, or general. Separable and Baxter per...
DAM
2007
13 years 10 months ago
2007
A Skolem sequence is a sequence a1, a2, . . . , a2n (where ai ∈ A = {1, . . . , n}), each ai occurs exactly twice in the sequence and the two occurrences are exactly ai position...