232 search results - page 36 / 47 » Dynamic Graph Clustering Using Minimum-Cut Trees |
ICIAR
2005
Springer
14 years 26 days ago
2005
Springer
The purpose of this paper is to allow for high level shape representation and matching in multi-object images by detecting and extracting the envelope of object groupings in the im...
PAKDD
2007
ACM
14 years 1 months ago
2007
ACM
In this paper, we investigate and utilize the characteristic of the group movement of objects to achieve energy conservation in the inherently resource-constrained wireless object ...
UAI
1996
13 years 8 months ago
1996
Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithmse.g., clustering, conditioning ar...
CVIU
2011
12 years 11 months ago
2011
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
PODS
1994
ACM
13 years 11 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...