Sciweavers

402 search results - page 47 / 81
» On Finding the Number of Graph Automorphisms
Sort
View
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 7 months ago
Network Inference from Co-Occurrences
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
Michael Rabbat, Mário A. T. Figueiredo, Rob...
CVPR
2008
IEEE
14 years 9 months ago
Probabilistic graph and hypergraph matching
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
Ron Zass, Amnon Shashua
COMAD
2009
13 years 8 months ago
Large Maximal Cliques Enumeration in Large Sparse Graphs
Identifying communities in social networks is a problem of great interest. One popular type of community is where every member of the community knows all others, which can be view...
Natwar Modani, Kuntal Dey
ICDM
2006
IEEE
166views Data Mining» more  ICDM 2006»
14 years 1 months ago
Mining Generalized Graph Patterns Based on User Examples
There has been a lot of recent interest in mining patterns from graphs. Often, the exact structure of the patterns of interest is not known. This happens, for example, when molecu...
Pavel Dmitriev, Carl Lagoze
CC
1998
Springer
111views System Software» more  CC 1998»
13 years 7 months ago
Live Range Splitting in a Graph Coloring Register Allocator
Graph coloring is the dominant paradigm for global register allocation [8, 7, 4]. Coloring allocators use an interference graph, Z, to model conflicts that prevent two values from ...
Keith D. Cooper, L. Taylor Simpson