Sciweavers

5473 search results - page 54 / 1095
» On the graph isomorphism problem
Sort
View
GECCO
2003
Springer
120views Optimization» more  GECCO 2003»
15 years 5 months ago
New Usage of SOM for Genetic Algorithms
Abstract. Self-Organizing Map (SOM) is an unsupervised learning neural network and it is used for preserving the structural relationships in the data without prior knowledge. SOM h...
Jung Hwan Kim, Byung Ro Moon
COMBINATORICS
2006
133views more  COMBINATORICS 2006»
14 years 12 months ago
Completion of the Wilf-Classification of 3-5 Pairs Using Generating Trees
A permutation is said to avoid the permutation if no subsequence in has the same order relations as . Two sets of permutations 1 and 2 are Wilfequivalent if, for all n, the numb...
Mark Lipson
ISPEC
2009
Springer
15 years 6 months ago
Strongly Unforgeable ID-Based Signatures without Random Oracles
In this paper, we construct a strongly unforgeable ID-based signature scheme without random oracles.4 The signature size of our scheme is smaller than that of other schemes based o...
Chifumi Sato, Takeshi Okamoto, Eiji Okamoto
EMMCVPR
2001
Springer
15 years 4 months ago
Estimation of Distribution Algorithms: A New Evolutionary Computation Approach for Graph Matching Problems
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...
Endika Bengoetxea, Pedro Larrañaga, Isabell...
TVCG
2012
182views Hardware» more  TVCG 2012»
13 years 2 months ago
Coherent Time-Varying Graph Drawing with Multifocus+Context Interaction
—We present a new approach for time-varying graph drawing that achieves both spatiotemporal coherence and multifocus+context visualization in a single framework. Our approach uti...
Kun-Chuan Feng, Chaoli Wang, Han-Wei Shen, Tong-Ye...