Sciweavers

13 search results - page 1 / 3
» Symmetric and semisymmetric graphs construction using G-grap...
Sort
View
ISSAC
2005
Springer
107views Mathematics» more  ISSAC 2005»
13 years 10 months ago
Symmetric and semisymmetric graphs construction using G-graphs
Symmetric and semisymmetric graphs are used in many scientific domains, especially parallel computation and interconnection networks. The industry and the research world make a h...
Alain Bretto, Luc Gillibert, Bernard Laget
INFOCOM
2012
IEEE
11 years 7 months ago
Sampling directed graphs with random walks
Abstract—Despite recent efforts to characterize complex networks such as citation graphs or online social networks (OSNs), little attention has been given to developing tools tha...
Bruno F. Ribeiro, Pinghui Wang, Fabricio Murai, Do...
CVPR
2006
IEEE
13 years 11 months ago
Globally Optimal Grouping for Symmetric Boundaries
Many natural and man-made structures have a boundary that shows certain level of bilateral symmetry, a property that has been used to solve many computer-vision tasks. In this pap...
Joachim S. Stahl, Song Wang
ALT
2007
Springer
13 years 9 months ago
Cluster Identification in Nearest-Neighbor Graphs
Abstract. Assume we are given a sample of points from some underlying distribution which contains several distinct clusters. Our goal is to construct a neighborhood graph on the sa...
Markus Maier, Matthias Hein, Ulrike von Luxburg
JCT
2008
103views more  JCT 2008»
13 years 4 months ago
A bijective proof of Jackson's formula for the number of factorizations of a cycle
Factorizations of the cyclic permutation (1 2 . . . N) into two permutations with respectively n and m cycles, or, equivalently, unicellular bicolored maps with N edges and n whit...
Gilles Schaeffer, Ekaterina A. Vassilieva