Sciweavers

281 search results - page 5 / 57
» On Embedding a Graph on Two Sets of Points
Sort
View
CVPR
2005
IEEE
14 years 11 months ago
Graph Embedding: A General Framework for Dimensionality Reduction
In the last decades, a large family of algorithms supervised or unsupervised; stemming from statistic or geometry theory have been proposed to provide different solutions to the p...
Shuicheng Yan, Dong Xu, Benyu Zhang, HongJiang Zha...
JCT
2010
112views more  JCT 2010»
13 years 8 months ago
Annular embeddings of permutations for arbitrary genus
In the symmetric group on a set of size 2n, let P2n denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as “pairings”, since each ...
I. P. Goulden, William Slofstra
CCCG
2009
13 years 10 months ago
Colored Simultaneous Geometric Embeddings and Universal Pointsets
A set of n points in the plane is a universal pointset for a given class of graphs, if any n-vertex graph in that class can be embedded in the plane so that vertices are mapped to...
Alejandro Estrella-Balderrama, J. Joseph Fowler, S...
GD
2004
Springer
14 years 3 months ago
The Three Dimensional Logic Engine
We consider the following graph embedding question: given a graph G, is it possible to map its vertices to points in 3D such that G is isomorphic to the mutual nearest neighbor gra...
Matthew Kitching, Sue Whitesides
IJCV
2006
115views more  IJCV 2006»
13 years 9 months ago
Object Recognition as Many-to-Many Feature Matching
Object recognition can be formulated as matching image features to model features. When recognition is exemplar-based, feature correspondence is one-to-one. However, segmentation e...
M. Fatih Demirci, Ali Shokoufandeh, Yakov Keselman...