Sciweavers

110 search results - page 13 / 22
» Chain polynomials and Tutte polynomials
Sort
View
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
14 years 7 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
JCB
2007
168views more  JCB 2007»
13 years 7 months ago
Fast Molecular Shape Matching Using Contact Maps
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
Pankaj K. Agarwal, Nabil H. Mustafa, Yusu Wang
JCT
2011
87views more  JCT 2011»
13 years 2 months ago
Chain enumeration of k-divisible noncrossing partitions of classical types
We give combinatorial proofs of the formulas for the number of multichains in the k-divisible noncrossing partitions of classical types with certain conditions on the rank and the ...
Jang Soo Kim
JCT
2010
94views more  JCT 2010»
13 years 6 months ago
Growth diagrams for the Schubert multiplication
We present a partial generalization to Schubert calculus on flag varieties of the classical Littlewood-Richardson rule, in its version based on Sch¨utzenberger’s jeu de taquin....
Cristian Lenart
PODS
2012
ACM
297views Database» more  PODS 2012»
11 years 10 months ago
Query-based data pricing
Data is increasingly being bought and sold online, and Webbased marketplace services have emerged to facilitate these activities. However, current mechanisms for pricing data are ...
Paraschos Koutris, Prasang Upadhyaya, Magdalena Ba...