691 search results - page 15 / 139 » Non-negative graph embedding |
OPODIS
2008
13 years 9 months ago
2008
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...
GD
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
GD
2004
Springer
14 years 1 months ago
2004
Springer
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...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
Our goal is to segment a video sequence into moving objects and the world scene. In recent work, spectral embedding of point trajectories based on 2D motion cues accumulated from ...
ICDM
2007
IEEE
14 years 2 months ago
2007
IEEE
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...