337 search results - page 64 / 68 » Matching Algorithms Are Fast in Sparse Random Graphs |
DAS
2010
Springer
14 years 15 days ago
2010
Springer
In this paper, we present a novel graph-based method for extracting handwritten text lines in monochromatic Arabic document images. Our approach consists of two steps Coarse text ...
PAM
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Internet coordinate systems appear promising as a method for estimating network distance without direct measurement, allowing scalable configuration of emerging applicat...
TIP
2010
13 years 3 months ago
2010
Abstract--Image segmentation plays an important role in computer vision and image analysis. In this paper, image segmentation is formulated as a labeling problem under a probabilit...
RECOMB
2005
Springer
14 years 9 months ago
2005
Springer
Abstract. With ever increasing amount of available data on protein-protein interaction (PPI) networks and research revealing that these networks evolve at a modular level, discover...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...