4171 search results - page 442 / 835 » Choice numbers of graphs |
147
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
A lot of image analysis problems lend themselves to a unified mathematical formulation as optimization problems. Tree-serial dynamic programming is a particular case of the so-cal...
155
click to vote
ICASSP
2007
IEEE
16 years 1 months ago
2007
IEEE
We propose a multi-target tracking algorithm based on the Probability Hypothesis Density (PHD) filter and data association using graph matching. The PHD filter is used to compen...
188
click to vote
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
167
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
This paper studies labeling schemes for the vertex connectivity function on general graphs. We consider the problem of labeling the nodes of any n-node graph is such a way that gi...
204
click to vote
PKDD
2007
Springer
16 years 29 days ago
2007
Springer
Recent years have seen the development of many graph clustering algorithms, which can identify community structure in networks. The vast majority of these only find disjoint commun...