Browsing by Subject "Longest path"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    ItemOpen Access
    Integrated segmentation and recognition of connected Ottoman script
    (S P I E - International Society for Optical Engineering, 2009-11) Yalniz, I. Z.; Altingovde, I. S.; Güdükbay, Uğur; Ulusoy, Özgür
    We propose a novel context-sensitive segmentation and recognition method for connected letters in Ottoman script. This method first extracts a set of segments from a connected script and determines the candidate letters to which extracted segments are most similar. Next, a function is defined for scoring each different syntactically correct sequence of these candidate letters. To find the candidate letter sequence that maximizes the score function, a directed acyclic graph is constructed. The letters are finally recognized by computing the longest path in this graph. Experiments using a collection of printed Ottoman documents reveal that the proposed method provides >90% precision and recall figures in terms of character recognition. In a further set of experiments, we also demonstrate that the framework can be used as a building block for an information retrieval system for digital Ottoman archives. © 2009 Society of Photo-Optical Instrumentation Engineers.
  • Thumbnail Image
    ItemOpen Access
    Star p-hub center problem and star p-hub median problem with bounded path lengths
    (2012) Yaman H.; Elloumi, S.
    We consider two problems that arise in designing two-level star networks taking into account service quality considerations. Given a set of nodes with pairwise traffic demand and a central hub, we select p hubs and connect them to the central hub with direct links and then we connect each nonhub node to a hub. This results in a star/star network. In the first problem, called the Star p-hub Center Problem, we would like to minimize the length of the longest path in the resulting network. In the second problem, Star p-hub Median Problem with Bounded Path Lengths, the aim is to minimize the total routing cost subject to upper bound constraints on the path lengths. We propose formulations for these problems and report the outcomes of a computational study where we compare the performances of our formulations.