1963 search results - page 61 / 393 » The Maximum Solution Problem on Graphs |
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
In this paper, we address the problem of video object segmentation, which is to automatically identify the primary object and segment the object out in every frame. We propose a n...
JCP
2006
13 years 8 months ago
2006
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
CORR
2004
Springer
13 years 8 months ago
2004
Springer
Wattenhofer et al. [WW04] derive a complicated distributed algorithm to compute a weighted matching of an arbitrary weighted graph, that is at most a factor 5 away from the maximu...
AUSAI
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
IPM
2008
13 years 8 months ago
2008
Language modeling is an effective and theoretically attractive probabilistic framework for text information retrieval. The basic idea of this approach is to estimate a language mo...