5606 search results - page 443 / 1122 » Randomization Techniques for Graphs. |
221
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Global shape information is an effective top-down complement
to bottom-up figure-ground segmentation as well
as a useful constraint to avoid drift during adaptive tracking.
We p...
170
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
188
click to vote
JITECH
2010
15 years 5 months ago
2010
This paper employs the network perspective to study patterns and structures of intraorganizational learning networks. The theoretical background draws from cognitive theories, the...
160
click to vote
TIT
2010
15 years 1 months ago
2010
Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared wit...
178
click to vote
ICIP
2005
IEEE
16 years 8 months ago
2005
IEEE
We present a graph cuts-based image segmentation technique that incorporates an elliptical shape prior. Inclusion of this shape constraint restricts the solution space of the segm...