1177 search results - page 219 / 236 » Iterative methods for Robbins problems |
CP
2003
Springer
14 years 1 months ago
2003
Springer
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
DATAMINE
2006
13 years 8 months ago
2006
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...
IJCV
2006
13 years 8 months ago
2006
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
JMLR
2006
13 years 8 months ago
2006
The task of learning models for many real-world problems requires incorporating domain knowledge into learning algorithms, to enable accurate learning from a realistic volume of t...
JCB
2007
13 years 8 months ago
2007
The assignment of orthologous genes between a pair of genomes is a fundamental and challenging problem in comparative genomics, since many computational methods for solving variou...