2634 search results - page 46 / 527 » Faster Than Uppaal |
ICCV
2003
IEEE
14 years 10 months ago
2003
IEEE
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...
MHCI
2007
Springer
14 years 2 months ago
2007
Springer
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...
BIBE
2005
IEEE
14 years 2 months ago
2005
IEEE
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...
CPM
2005
Springer
14 years 2 months ago
2005
Springer
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...
HAPTICS
2003
IEEE
14 years 2 months ago
2003
IEEE
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...