Sciweavers

TKDE
2012
250views Formal Methods» more  TKDE 2012»
12 years 2 months ago
Dense Subgraph Extraction with Application to Community Detection
— 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...
Jie Chen 0007, Yousef Saad
CVPR
2012
IEEE
12 years 2 months ago
Face detection, pose estimation, and landmark localization in the wild
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...
Xiangxin Zhu, Deva Ramanan
COMPSYSTECH
2011
12 years 11 months ago
Encoding watermark numbers as cographs using self-inverting permutations
Abstract. In a software watermarking environment, several graph theoretic watermark methods encode the watermark values as graph structures and embed them in application programs. ...
Maria Chroni, Stavros D. Nikolopoulos
ICMT
2011
Springer
13 years 3 months ago
Toward Bidirectionalization of ATL with GRoundTram
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...
Isao Sasano, Zhenjiang Hu, Soichiro Hidaka, Kazuhi...
IJPP
2011
99views more  IJPP 2011»
13 years 6 months ago
Regular Lattice and Small-World Spin Model Simulations Using CUDA and GPUs
Data-parallel accelerator devices such as Graphical Processing Units (GPUs) are providing dramatic performance improvements over even multicore CPUs for lattice-oriented applicatio...
Kenneth A. Hawick, Arno Leist, Daniel P. Playne
NJC
2000
99views more  NJC 2000»
13 years 11 months ago
An Incremental Unique Representation for Regular Trees
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...
Laurent Mauborgne
IJBC
2006
130views more  IJBC 2006»
13 years 11 months ago
Automatic Generation of Self-Replicating Patterns in Graph Automata
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...
Kohji Tomita, Haruhisa Kurokawa, Satoshi Murata
GPEM
2006
82views more  GPEM 2006»
13 years 12 months ago
Shortcomings with using edge encodings to represent graph structures
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...
Gregory Hornby
GECCO
2008
Springer
122views Optimization» more  GECCO 2008»
14 years 27 days ago
Varying portfolio construction of stocks using genetic network programming with control nodes
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...
MVA
1996
14 years 1 months ago
Recognition of Composite Elements in Bar Graphs
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...
Naoko Yokokura, Toyohide Watanabe