7913 search results - page 524 / 1583 » Information Collection on a Graph |
158
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Motivated by applications in social networks, peer-to-peer and overlay networks, we define and study the Bounded Budget Connection (BBC) game - we have a collection of n players o...
189
click to vote
ICALP
2011
Springer
14 years 9 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
165
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
We present a simple but efficient model for object segmentation in video scenes that integrates motion and color information in a joint probabilistic framework. Optical flow is mo...
133
click to vote
IV
2007
IEEE
16 years 15 days ago
2007
IEEE
In this study, we crawled a local Web domain, created its graph representation, and analyzed the network structure. The results of network analysis revealed local scalefree patter...
141
click to vote
ISCIS
2004
Springer
15 years 11 months ago
2004
Springer
Partial order methods, such as the stubborn set method and the priority method, reduce verification effort by exploiting irrelevant orders of events. We show how the stubborn set...