2314 search results - page 212 / 463 » Minimal Partitions of a Graph |
131
click to vote
CVPR
2000
IEEE
15 years 8 months ago
2000
IEEE
We use cluster analysis as a unifying principle for problems from low, middle and high level vision. The clustering problem is viewed as graph partitioning, where nodes represent ...
169
click to vote
IVC
2008
15 years 4 months ago
2008
In this paper, we address the issue of Euclidean path modeling in a single camera for activity monitoring in a multi-camera video surveillance system. The method consists of a pat...
144
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
172
click to vote
WAW
2004
Springer
15 years 9 months ago
2004
Springer
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
145
click to vote
ENTCS
2006
15 years 4 months ago
2006
Using graph transformation as a formalism to specify model transformation, termination and confluence of the graph transformation system are often required properties. Only under ...