Sciweavers

3265 search results - page 83 / 653
» Representing Groups on Graphs
Sort
View
148
Voted
IEICET
2011
14 years 10 months ago
Generation of Symmetric and Asymmetric Biconnected Rooted Outerplanar Graphs
In a rooted graph, a vertex is designated as its root. An outerplanar graph is represented by a plane embedding such that all vertices appear along its outer boundary. Two differ...
Bingbing Zhuang, Hiroshi Nagamochi
119
Voted
CP
2006
Springer
15 years 5 months ago
Graph Properties Based Filtering
Abstract. This report presents a generic filtering scheme, based on the graph description of global constraints. This description is defined by a network of binary constraints and ...
Nicolas Beldiceanu, Mats Carlsson, Sophie Demassey...
113
Voted
CVPR
1997
IEEE
15 years 8 months ago
Normalized Cuts and Image Segmentation
ÐWe propose a novel approach for solving the perceptual grouping problem in vision. Rather than focusing on local features and their consistencies in the image data, our approach ...
Jianbo Shi, Jitendra Malik
130
Voted
COMBINATORICS
1998
103views more  COMBINATORICS 1998»
15 years 3 months ago
Recognizing Circulant Graphs of Prime Order in Polynomial Time
A circulant graph G of order n is a Cayley graph over the cyclic group Zn. Equivalently, G is circulant iff its vertices can be ordered such that the corresponding adjacency matr...
Mikhail E. Muzychuk, Gottfried Tinhofer
108
Voted
ACL
1998
15 years 5 months ago
Time Mapping with Hypergraphs
Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of ...
Jan W. Amtrup, Volker Weber