702 search results - page 66 / 141 » Identifying Graph Automorphisms Using Determining Sets |
107
click to vote
SIGMOD
2011
ACM
14 years 2 months ago
2011
ACM
In this work we design algorithms for clustering relational columns into attributes, i.e., for identifying strong relationships between columns based on the common properties and ...
ACMSE
2006
ACM
15 years 5 months ago
2006
ACM
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
ACCV
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Many real objects, such as faces, sculptures, or low-reliefs are composed of many detailed parts that can not be easily modeled by an artist nor by 3D scanning. In this p...
117
click to vote
LCPC
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. A fundamental problem in the analysis of parallel programs is to determine when two statements in a program may run concurrently. This analysis is the parallel analog to ...
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
In this communication Simulated Annealing and Genetic Algorithms, are applied to the graph partitioning problem. These techniques mimic processes in statistical mechanics and biol...