112 search results - page 20 / 23 » Labeled Traveling Salesman Problems: Complexity and approxim... |
ICPR
2010
IEEE
14 years 2 months ago
2010
IEEE
GMM based algorithms have become the de facto standard for background subtraction in video sequences, mainly because of their ability to track multiple background distributions, w...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
CPAIOR
2009
Springer
14 years 2 months ago
2009
Springer
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...