10051 search results - page 50 / 2011 » A Dynamic Separator Algorithm |
93
Voted
ICDAR
2003
IEEE
15 years 5 months ago
2003
IEEE
In this paper we present a top-down, projection-profile based algorithm to separate text blocks from image blocks in a Devanagari document. We use a distinctive feature of Devana...
80
Voted
COCO
1998
Springer
15 years 4 months ago
1998
Springer
We show that MAEXP, the exponential time version of the Merlin-Arthur class, does not have polynomial size circuits. This significantly improves the previous known result due to K...
102
click to vote
SODA
1992
ACM
15 years 1 months ago
1992
ACM
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
109
Voted
CVPR
2004
IEEE
16 years 2 months ago
2004
IEEE
When we take a picture through a window the image we obtain is often a linear superposition of two images: the image of the scene beyond the window plus the image of the scene ref...
82
Voted
ACIVS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Most existing feature-point matching algorithms rely on photometric region descriptors to distinct and match feature points in two images. In this paper, we propose an e...