1461 search results - page 67 / 293 » Complexity of Graph Covering Problems |
STOC
2002
ACM
14 years 8 months ago
2002
ACM
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...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
abstract such additional information as network annotations. We introduce a network topology modeling framework that treats annotations as an extended correlation profile of a net...
RECOMB
2007
Springer
14 years 8 months ago
2007
Springer
Association, or LD (linkage disequilibrium), mapping is an intensely-studied approach to gene mapping (genome-wide or in candidate regions) that is widely hoped to be able to effic...
AAAI
1990
13 years 8 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
JMLR
2006
13 years 7 months ago
2006
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...