259 search results - page 47 / 52 » Graph Distances in the Data-Stream Model |
131
click to vote
MM
2004
ACM
15 years 7 months ago
2004
ACM
This paper deals with phrase structure detection in contemporary western dance. Phrases are a sequence of movements that exist at semantic abstraction than gestures. The problem i...
107
click to vote
ECCV
2006
Springer
16 years 3 months ago
2006
Springer
We introduce a new approach to modelling gradient flows of contours and surfaces. While standard variational methods (e.g. level sets) compute local interface motion in a different...
165
click to vote
CIVR
2008
Springer
15 years 3 months ago
2008
Springer
This paper presents a semi-supervised learning (SSL) approach to find similarities of images using statistics of local matches. SSL algorithms are well known for leveraging a larg...
124
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
106
click to vote
JSYML
2010
14 years 8 months ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...