691 search results - page 37 / 139 » Non-negative graph embedding |
98
Voted
CORR
2006
Springer
15 years 19 days ago
2006
Springer
We investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures th...
103
Voted
DM
2006
15 years 19 days ago
2006
Any given graph can be embedded in a chordal graph by adding edges, and the resulting chordal graph is called a triangulation of the input graph. In this paper we study minimal tr...
122
click to vote
DCG
2011
14 years 7 months ago
2011
We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by O(27.55n ) = O(18...
102
Voted
APPROX
2010
Springer
15 years 24 days ago
2010
Springer
We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the f...
106
Voted
ICPR
2010
IEEE
14 years 10 months ago
2010
IEEE
We propose a framework to learn scene semantics from surveillance videos. Using the learnt scene semantics, a video analyst can efficiently and effectively retrieve the hidden sem...