39 search results - page 2 / 8 » Algorithms for Finding Maximal-Scoring Segment Sets (Extende... |
DAS
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. This paper presents a quantitative comparison of six algorithms for page segmentation: X-Y cut, smearing, whitespace analysis, constrained text-line finding, Docstrum, an...
ICALP
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
ICIP
1999
IEEE
13 years 10 months ago
1999
IEEE
Segmentation of motion in an image sequence is one of the most challenging problems in image processing, while at the same time one that finds numerous applications. To date, a wea...
ICRA
2009
IEEE
14 years 27 days ago
2009
IEEE
Abstract— In this paper we describe an algorithm to compute cycle constraints that can be used in many graph-based SLAM algorithms; we exemplify it in Hierarchical SLAM. Our algo...
VTC
2008
IEEE
14 years 19 days ago
2008
IEEE
—Many different types of modern wired and wireless communication links can be mathematically described as discretebert channels. In this extended abstract, we present an exact me...