1722 search results - page 74 / 345 » On the sample mean of graphs |
244
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
We present a generic framework for object segmentation using depth maps based on Random Forest and Graph-cuts theory, and apply it to the segmentation of human limbs in depth maps...
173
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
For many tracking and surveillance applications, background subtraction provides an effective means of segmenting objects moving in front of a static background. Researchers have ...
185
click to vote
WAW
2007
Springer
16 years 8 days ago
2007
Springer
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
161
click to vote
TPDS
2010
15 years 4 months ago
2010
—We studied the minimum latency gossiping (all-to-all broadcast) problem in multihop radio networks defined as follows: Each node in the network is preloaded with a message and t...
138
click to vote
OPODIS
2007
15 years 7 months ago
2007
Abstract. Blin et al. (2006) proposed a distributed protocol that enables the smallest number of searchers to clear any unknown asynchronous graph in a decentralized manner. Unknow...