Search
Now showing items 181-190 of 203
Segmentation Strategies for Scene Word Images
(2017-12-10)
Explicit Segmentation Of Speech For Indian Languages
(2010-07-02)
Speech segmentation is the process of identifying the boundaries between words, syllables or phones in the recorded waveforms of spoken natural languages. The lowest level of speech segmentation is the breakup and ...
Methods for Text Segmentation from Scene Images
(2017-09-27)
Recognition of text from camera-captured scene/born-digital images help in the development of aids for the blind, unmanned navigation systems and spam filters. However, text in such images is not confined to any page layout, ...
Multiview Face Detection And Free Form Face Recognition For Surveillance
(2014-10-15)
The problem of face detection and recognition within a given database has become one of the important problems in computer vision. A simple approach for Face Detection in video is to run a learning based face detector every ...
Power Efficient Last Level Cache For Chip Multiprocessors
(2015-09-09)
The number of processor cores and on-chip cache size has been increasing on chip multiprocessors (CMPs). As a result, leakage power dissipated in the on-chip cache has become very significant. We explore various techniques ...
Boxicity, Cubicity And Vertex Cover
(2010-09-28)
The boxicity of a graph G, denoted as box(G), is the minimum dimension d for which each vertex of G can be mapped to a d-dimensional axis-parallel box in Rd such that two boxes intersect if and only if the corresponding ...
Rainbow Colouring and Some Dimensional Problems in Graph Theory
(2018-04-05)
This thesis touches three different topics in graph theory, namely, rainbow colouring, product dimension and boxicity.
Rainbow colouring An edge colouring of a graph is called a rainbow colouring, if every pair of vertices ...
Intersection Graphs Of Boxes And Cubes
(2011-01-25)
A graph Gis said to be an intersection graph of sets from a family of sets if there exists a function ƒ : V(G)→ such that for u,v V(G), (u,v) E(G) ƒ (u) ƒ (v) ≠ . Interval graphs are thus the intersection graphs ...
Parameterized Complexity of Maximum Edge Coloring in Graphs
(2018-03-09)
The classical graph edge coloring problem deals in coloring the edges of a given graph with minimum number of colors such that no two adjacent edges in the graph, get the same color in the proposed coloring. In the following ...
Rainbow Connection Number Of Graph Power And Graph Products
(2014-09-09)
The minimum number of colors required to color the edges of a graph so that any two distinct vertices are connected by at least one path in which no two edges are colored the same is called its rainbow connection number. ...