691 search results - page 82 / 139 » Non-negative graph embedding |
137
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
7 Irregular pyramids are made of a stack of successively reduced graphs embedded in the plane. Such pyramids are used within the segmentation framework to encode a hierarchy of pa...
139
Voted
DMTCS
2010
15 years 8 days ago
2010
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulation...
159
click to vote
IPMI
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. Brain matching is an important problem in neuroimaging studies. Current surface-based methods for cortex matching and atlasing, although quite accurate, can require long ...
155
click to vote
CVPR
2004
IEEE
16 years 4 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
220
click to vote
GIS
2007
ACM
16 years 4 months ago
2007
ACM
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...