Cited By
View all- Barman SChawla SMathieu C(2009)Packing multiway cuts in capacitated graphsProceedings of the twentieth annual ACM-SIAM symposium on Discrete algorithms10.5555/1496770.1496884(1048-1057)Online publication date: 4-Jan-2009
We consider the dynamic map labeling problem: given a set of rectangular labels on the map, the goal is to appropriately select visible ranges for all the labels such that no two consistent labels overlap at every scale and the sum of total visible ...
We propose a multi-view learning approach called co-labeling which is applicable for several machine learning problems where the labels of training samples are uncertain, including semi-supervised learning (SSL), multi-instance learning (MIL) and max-...
We consider approximation algorithms for the metric labeling problem. This problem was introduced in a paper by Kleinberg and Tardos [J. ACM, 49 (2002), pp. 616--630] and captures many classification problems that arise in computer vision and related ...
Society for Industrial and Applied Mathematics
United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in