281 search results - page 35 / 57 » On Embedding a Graph on Two Sets of Points |
80
Voted
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Given a finite number of data points sampled from a low-dimensional manifold embedded in a high dimensional space together with the parameter vectors for a subset of the data poin...
116
click to vote
SMA
2009
ACM
15 years 4 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
ICCV
2005
IEEE
15 years 3 months ago
2005
IEEE
When an image is viewed at varying resolutions, it is known to create discrete perceptual jumps or transitions amid the continuous intensity changes. In this paper, we study a per...
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
We propose a novel generative language for shape that is based on the shock graph: given a shock graph topology, we explore constraints on the geometry and dynamics of the shock g...
JCT
2008
14 years 9 months ago
2008
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...