Sciweavers

3220 search results - page 249 / 644
» Constrained Graph Processes
Sort
View
ICES
2003
Springer
101views Hardware» more  ICES 2003»
15 years 11 months ago
A Developmental Method for Growing Graphs and Circuits
A review is given of approaches to growing neural networks and electronic circuits. A new method for growing graphs and circuits using a developmental process is discussed. The met...
Julian F. Miller, Peter Thomson
AIRS
2006
Springer
15 years 10 months ago
Natural Document Clustering by Clique Percolation in Random Graphs
Document clustering techniques mostly depend on models that impose explicit and/or implicit priori assumptions as to the number, size, disjunction characteristics of clusters, and/...
Wei Gao, Kam-Fai Wong
CRIWG
2007
15 years 8 months ago
Coordinating Multi-task Environments Through the Methodology of Relations Graph
Abstract. This paper presents Relations Graph – GR a methodology to automate the generation of coordination mechanisms in computational environments. GR explores encapsulation an...
Adailton José Alves Da Cruz, Léo Pin...
ICMLA
2008
15 years 8 months ago
Graph-Based Multilevel Dimensionality Reduction with Applications to Eigenfaces and Latent Semantic Indexing
Dimension reduction techniques have been successfully applied to face recognition and text information retrieval. The process can be time-consuming when the data set is large. Thi...
Sophia Sakellaridi, Haw-ren Fang, Yousef Saad
ICWS
2007
IEEE
15 years 8 months ago
Improved Matchmaking Algorithm for Semantic Web Services Based on Bipartite Graph Matching
The ability to dynamically discover and invoke a Web Service is a critical aspect of Service Oriented Architectures. An important component of the discovery process is the matchma...
Umesh Bellur, Roshan Kulkarni