• No results found

The graph traversal and graph representation approaches (as indicated)

Optimized Proposed Algorithm for Graph Traversal

Optimized Proposed Algorithm for Graph Traversal

... 6. Future Scope The proposed algorithm can be further be improved in terms of running time and space. The time complexity is same in the worst case when the algorithm traverses each vertex along each path. The algorithm ...

6

Movie Recommendation Based on Graph Traversal Algorithms

Movie Recommendation Based on Graph Traversal Algorithms

... a graph representation and experimented with modified graph ...a representation of the data about movies in a graph structure and a method which uses our data model for ...

5

Using Graph Traversal in Scientific Data Interpolation

Using Graph Traversal in Scientific Data Interpolation

... The MATCH clause is used for graph pattern matching. The first MATCH clause defines an iterator variable p0 on all nodes of mesh M . The WHERE clause filters p0 to ver- tices where dim property is zero. The WITH ...

8

Relative Representation Of Graph

Relative Representation Of Graph

... the graph can be represented by both connecting the Y R i R ’s or not connecting these points (rule6), but if connected accordingly then we would be able to visualise the Y R i R ’s like functional points and the ...

12

Accelerating In-Memory Graph Database traversal using GPGPUS

Accelerating In-Memory Graph Database traversal using GPGPUS

... In order to evaluate traversal, it is useful to visualize the graph as an alternate representation of a sparse matrix. Con- sider a situation where we have dense index generated on every possible ...

5

Breaking Symmetries in Graph Representation

Breaking Symmetries in Graph Representation

... undirected graph satisfying a certain ...a graph. We illustrate the application of symmetry breaking in graph representation to resolve several open instances in extremal graph ...

8

On the representation number of a crown graph

On the representation number of a crown graph

... w 0 = P(1, 2)P (2 0 , 3 0 )P (3, 4)P (4 0 , 5 0 ) · · · P(n − 1, n)P (n 0 , 1 0 ). It follows from the property 2 in Lemma 6 that w 0 represents the complete bipartite graph K n,n . Shift w 0 cyclicly one position ...

11

An Efficient Stack Based Graph Traversal Method for Network Configuration

An Efficient Stack Based Graph Traversal Method for Network Configuration

... Vijayalakshmi M K, Mysuru, Karnataka. Completed B.Ed in theyear 2018 from Amrita School of Education,AmritaVishwaVidyapeetham, Mysuru.Studied M.Sc Mathematics in the year 2015 from JSS College ofArts, Commerce and ...

5

Walking Linked Data: a graph traversal approach to explain clusters

Walking Linked Data: a graph traversal approach to explain clusters

... a graph search process relying on link traversal and resources ...Link traversal allows us to navigate and span from datasource to datasource throughout Linked Data, without knowing those in advance ...

13

Representation and Analysis of Object Oriented Graph (OOG): A Graph Algorithmic Approach

Representation and Analysis of Object Oriented Graph (OOG): A Graph Algorithmic Approach

... The size and complexity of the software system increases, testing becomes an important activity, which is not only confined to the testing of source code, but, also includes testing and verification of design and ...

8

A standard for a graph representation for functional programs

A standard for a graph representation for functional programs

... resembles the languages SASL [6] and Pifl [3] currently in use at Warwick. Both are translated into graphi- cal form before evaluation. In the case of the SASL interpreter, the intermediate code [5] produced is FLIC. The ...

9

Chemical equation representation as directed graph

Chemical equation representation as directed graph

... _____________________________________________________________________________________________ ABSTRACT One of the major issues in formalizing the dynamics of chemical reactions is that the graph ...

7

Construction of Conceptual Graph Representation of Texts

Construction of Conceptual Graph Representation of Texts

... 4.2 Attaching all constituents to the verb After building separate graphs for each of the con- stituents, we link them together in a single conceptual graph. As each of them describe some aspect of the con- cept ...

6

Graph Signal Processing:Sparse Representation and Applications

Graph Signal Processing:Sparse Representation and Applications

... In particular, we address the problem of sparse representation of graph signals residing on weighted graphs by learning graph structured dictionaries that incor- porate the intrinsic geo[r] ...

167

Temporal Graph Offset Reconstruction: Towards Temporally Robust Graph Representation Learning

Temporal Graph Offset Reconstruction: Towards Temporally Robust Graph Representation Learning

... Recently graph specific neural network based models have been created which are inspired by Convolutional Neural Networks (CNNs) from the field of computer ...Such approaches attempt to create a ...

10

New Approaches on Octilinear Graph Drawing

New Approaches on Octilinear Graph Drawing

... a representation in the sloggy model by finding cer- tain cycles in the dual of the graph and rotating parts of the graph according to these ...

165

AGSF: Adaptive graph formulation and hand-crafted graph spectral features for shape representation

AGSF: Adaptive graph formulation and hand-crafted graph spectral features for shape representation

... Model-based methods include two types: shape-skeleton and shape-contour. The former constructs a tree model using object edges to form a shape descriptor, where the similar- ity measurement is based on tree matching ...

14

Graph-based representation for multiview image geometry

Graph-based representation for multiview image geometry

... He has served as an Associate Chair of EE-Systems and the Director of the Signal and Image Processing Institute at USC. His recent work is focusing on distributed compression, multiview coding, error tolerant ...

14

A Graph Kernel based on Jensen-Shannon Representation

A Graph Kernel based on Jensen-Shannon Representation

... native graph kernels on any ...JS representation can reflect richer characteristics than the h-layer DB representa- ...JS representation can capture more information for graphs than the DBMK ker- nel ...

8

Image matching using relational graph representation

Image matching using relational graph representation

... Approaches for image matching can be broadly classified into two categories: area-based matching and feature-based matching. Area-based matching uses intensity profiles or grey value template as the matching ...

9

Show all 10000 documents...

Related subjects