Variations in inter-line gaps and skewed or curled text-lines are some of the challenging issues in segmentation of handwritten text-lines. Moreover, overlapping and touching text-lines that frequently appear in unconstrained handwritten text documents significantly increase segmentation complexities. In this paper, we propose a novel approach for unconstrained handwritten text-line segmentatio...

We analyze a few of the commonly used statistics based and machine learning algorithms for natural language disambiguation tasks and observe that they can be re-cast as learning linear separators in the feature space. Each of the methods makes a priori assumptions, which it employs, given the data, when searching for its hypothesis. Nevertheless, as we show, it searches a space that is as rich ...

OBJECTIVE To evaluate the expression of an activator of nuclear factor-kappa (RANK), osteoprotegerin (OPG), osteopontin (OPN), and transforming growth factor ß1 (TGF-ß1) in gingival crevicular fluid (GCF) of teeth subjected to orthodontic forces. MATERIALS AND METHODS A randomized, pilot clinical trial including 10 healthy volunteers was conducted using a split-mouth design. Orthodontic elast...

In this paper we show that every 2-connected embedded planar graph with faces of sizes d! . . . . . df has a simple cycle separator of size 1.58~,/dl 2 + . . . + d } and we give an almost linear time algorithm for finding these separators, O(m~(n. n)). We show that the new upper bound expressed as a function of IG{ = ~/d~ +..+ d} is no larger, up to a constant factor than previous bounds that w...

Hyperbolic random graphs share many common properties with complex real-world networks; e.g., small diameter and average distance, large clustering coefficient, and a power-law degree sequence with adjustable exponent β. Thus, when analyzing algorithms for large networks, potentially more realistic results can be achieved by assuming the input to be a hyperbolic random graph of size n. The wors...

Distance labelings and compact routing schemes have both been active areas of recent research. It was already known that graphs with constant-sized recursive separators, such as trees, outerplanar graphs, series-parallel graphs and graphs of bounded treewidth, support both exact distance labelings and optimal (additive stretch 0, multiplicative stretch 1) compact routing schemes, but there are ...

We analyze a few of the commonly used statistics ba ed and machine l arning algorithms fornatural language disambiguation asks and observe that hey can bc recast as learning linear separators in the feature space. Each of the methods makes a priori assumptions, which it employs, given the data, when searching for its hypothesis. Nevertheless, a weshow, it searches a pace that is as rich as the ...