— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
We present a unified model for face detection, pose estimation, and landmark estimation in real-world, cluttered images. Our model is based on a mixtures of trees with a shared p...
Abstract. In a software watermarking environment, several graph theoretic watermark methods encode the watermark values as graph structures and embed them in application programs. ...
ATL is a language for describing model transformations currently in uni-direction. In our previous work we have shown that transformations of graph structures given in some form ca...
Data-parallel accelerator devices such as Graphical Processing Units (GPUs) are providing dramatic performance improvements over even multicore CPUs for lattice-oriented applicatio...
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...
Graph automata define symbol dynamics on graph structures, which has capability of generating structures in addition to state transition. The rules of the graph automata are unifo...
There are various representations for encoding graph structures, such as artificial neural networks (ANNs) and circuits, each with its own strengths and weaknesses. Here we analyz...
A new evolutionary method named “Genetic Network Programming with Control Nodes, GNPcn” has been proposed and applied to determine the timing of buying and selling stocks. GNP...
Etsushi Ohkawa, Yan Chen, Shingo Mabu, Kaoru Shima...
The issue of graph recognition has been not always investigated until today though the subjects on the document image understanding are very interest and have proposed many method...