Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
In this paper, we explore the use of an interaction technique called sequential segmentation to support target selection for mobile devices. Sequential segmentation iteratively pa...
We propose two novel dynamic programming (DP) methods that solve the the approximate bounded and unbounded global alignment problems for biological sequences. Our first method so...
Tamer Kahveci, Venkatakrishnan Ramaswamy, Han Tao,...
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
Cobots assist humans by mechanically guiding motion along software-defined paths or surfaces. Cobot design has been extensively studied previously. This paper reports the first sy...
Eng Seng Boy, Etienne Burdet, Chee Leong Teo, Jame...