Sciweavers

168 search results - page 20 / 34
» Chain Intersecting Families
Sort
View
SODA
2004
ACM
74views Algorithms» more  SODA 2004»
13 years 8 months ago
Torpid mixing of simulated tempering on the Potts model
Simulated tempering and swapping are two families of sampling algorithms in which a parameter representing temperature varies during the simulation. The hope is that this will ove...
Nayantara Bhatnagar, Dana Randall
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
NAR
2011
191views Computer Vision» more  NAR 2011»
12 years 10 months ago
The protein common interface database (ProtCID) - a comprehensive database of interactions of homologous proteins in multiple cr
The protein common interface database (ProtCID) is a database that contains clusters of similar homodimeric and heterodimeric interfaces observed in multiple crystal forms (CFs). ...
Qifang Xu, Roland L. Dunbrack Jr.
FOSSACS
2009
Springer
14 years 2 months ago
Dependency Tree Automata
We introduce a new kind of tree automaton, a dependency tree automaton, that is suitable for deciding properties of classes of terms with binding. Two kinds of such automaton are d...
Colin Stirling
IWPEC
2009
Springer
14 years 2 months ago
Even Faster Algorithm for Set Splitting!
In the p-Set Splitting problem we are given a universe U, a family F of subsets of U and a positive integer k and the objective is to find a partition of U into W and B such that...
Daniel Lokshtanov, Saket Saurabh