405 search results - page 16 / 81 » Using critical sets to solve the maximum independent set pro... |
FCT
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this approach to two hypergraph problems. We show that the Glauber dynamics ...
TCBB
2008
13 years 7 months ago
2008
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...
NIPS
1996
13 years 9 months ago
1996
In the square linear blind source separation problem, one must nd a linear unmixing operator which can detangle the result xi(t) of mixing n unknown independent sources si(t) thro...
ISCI
2008
13 years 7 months ago
2008
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
CEC
2007
IEEE
14 years 2 months ago
2007
IEEE
—This paper describes an evolutionary music composition system that combines trainable music critics with a bag of notes constraint. Unlike many evolutionary composition systems,...