2064 search results - page 195 / 413 » Segmentation Problems |
120
click to vote
CPAIOR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
112
Voted
GD
2006
Springer
15 years 4 months ago
2006
Springer
Given a tree T spanning a set of points S in the plane, we study the problem of drawing T using only line segments aligned with a fixed set of directions C. The vertices in the dra...
86
Voted
ACL
1998
15 years 2 months ago
1998
An essential step in comparative reconstruction is to align corresponding phonological segments in the words being compared. To do this, one must search among huge numbers of pote...
135
Voted
ICIP
2006
IEEE
16 years 2 months ago
2006
IEEE
In this study, an algorithm is proposed to solve the multi-frame structure from motion (MFSfM) problem for monocular video sequences in dynamic scenes. The algorithm uses the epip...
90
Voted
ICIAP
2005
ACM
16 years 23 days ago
2005
ACM
Automatic recognition of time and date stamps in CCTV video enables the inclusion of time-based queries in video indexing applications. Such ability needs to deal with problems of ...