281 search results - page 36 / 57 » On Embedding a Graph on Two Sets of Points |
119
click to vote
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
86
Voted
ICCV
2009
IEEE
16 years 1 months ago
2009
IEEE
Graph-based semi-supervised learning has gained considerable
interests in the past several years thanks to its effectiveness
in combining labeled and unlabeled data through
labe...
ICCV
1999
IEEE
15 years 11 months ago
1999
IEEE
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
112
click to vote
COMSWARE
2008
IEEE
14 years 11 months ago
2008
IEEE
Social networks refer to structures made of nodes that represent people or other entities embedded in a social context, and whose edges represent interaction between entities. Typi...
ICALP
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB...