—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
: We give the first combinatorial approximation algorithm for MAXCUT that beats the trivial 0.5 factor by a constant. The main partitioning procedure is very intuitive, natural, an...
We give a precise definition of "generic-case complexity" and show that for a very large class of finitely generated groups the classical decision problems of group theor...
Ilya Kapovich, Alexei G. Myasnikov, Paul Schupp, V...
It has long been recognized that capturing term relationships is an important aspect of information retrieval. Even with large amounts of data, we usually only have significant ev...
We consider the problem of multi-label, supervised image segmentation when an initial labeling of some pixels is given. In this paper, we propose a new generative image segmentatio...
Tae Hoon Kim (Seoul National University), Kyoung M...