252 search results - page 16 / 51 » Decremental Clique Problem |
ICDCS
1998
IEEE
15 years 1 months ago
1998
IEEE
This paper considers the problem of key agreement in a group setting with highly-dynamic group member population. A protocol suite, called CLIQUES, is developed by extending the w...
ICPR
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper presents Markov random fields (MRFs) to segment strokes of Chinese characters. The distortions caused by the thinning process make the thinning-based stroke segmentatio...
MST
2010
14 years 8 months ago
2010
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
NIPS
2001
14 years 11 months ago
2001
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
ICPR
2000
IEEE
15 years 10 months ago
2000
IEEE
The matching of hierarchical relational structures is of significant interest in computer vision and pattern recognition. We have recently introduced a new solution to this proble...