Braess, while working on traffic modeling, noticed that flow in a network can be worsened by adding extra edges to an existing network. This seemingly counterintuitive phenomenon is known as the Braess paradox. We consider quantum network, where represent shared entangled states between spatially separated parties (nodes). The goal entangle two previously uncorrelated nodes using entanglement s...

‎‎let $g=(v,e)$ be a simple graph‎. ‎an edge labeling $f:eto {0,1}$ induces a vertex labeling $f^+:vtoz_2$ defined by $f^+(v)equiv sumlimits_{uvin e} f(uv)pmod{2}$ for each $v in v$‎, ‎where $z_2={0,1}$ is the additive group of order 2‎. ‎for $iin{0,1}$‎, ‎let‎ ‎$e_f(i)=|f^{-1}(i)|$ and $v_f(i)=|(f^+)^{-1}(i)|$‎. ‎a labeling $f$ is called edge-friendly if‎ ‎$|e_f(1)-e_f(0)|le 1$‎. ‎$i_f(g)=v_f(...

Text spotting is an interesting research problem as text may appear at any random place and may occur in various forms. Moreover, ability to detect text opens the horizons for improving many advanced computer vision problems. In this paper, we propose a novel language agnostic text detection method utilizing edge enhanced Maximally Stable Extremal Regions in natural scenes by defining strong ch...

This paper introduces a novel real-time framework which enables detection, tracking and recognition of license plates from video sequences. An efficient algorithm based on analysis of Maximally Stable Extremal Region (MSER) detection results allows localization of international license plates in single images without the need of any learning scheme. After a one-time detection of a plate it is r...

‎let $g=(v(g),e(g))$ be a simple connected graph with vertex set $v(g)$ and edge‎ ‎set $e(g)$‎. ‎the (first) edge-hyper wiener index of the graph $g$ is defined as‎: ‎$$ww_{e}(g)=sum_{{f,g}subseteq e(g)}(d_{e}(f,g|g)+d_{e}^{2}(f,g|g))=frac{1}{2}sum_{fin e(g)}(d_{e}(f|g)+d^{2}_{e}(f|g)),$$‎ ‎where $d_{e}(f,g|g)$ denotes the distance between the edges $f=xy$ and $g=uv$ in $e(g)$ and $d_{e}(f|g)=s...

Methods for generating maximally stable extremal regions are generalised to make intensity trees. Such trees may be computed quickly, but they are large so there is a need to select useful nodes within the tree. Methods for simplifying the tree are developed and it is shown that standard confidence tests may be applied to regions identified as parent and child nodes in the tree. These tests pro...