4744 search results - page 74 / 949 » Connected Computing |
128
click to vote
DAGM
2008
Springer
15 years 4 months ago
2008
Springer
The design of inference algorithms for discrete-valued Markov Random Fields constitutes an ongoing research topic in computer vision. Large state-spaces, none-submodular energy-fun...
122
click to vote
OPODIS
2007
15 years 3 months ago
2007
Abstract. We consider the distributed construction of a minimum weight 2edge-connected spanning subgraph (2-ECSS) of a given weighted or unweighted graph. A 2-ECSS of a graph is a ...
108
click to vote
USENIX
1994
15 years 3 months ago
1994
To function in mobile computing environments, distributed file systems must cope with networks that are slow, intermittent, or both. Intermittence vitiates the effectiveness of ca...
131
click to vote
ENDM
2010
15 years 2 months ago
2010
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibil...
107
click to vote
ICWSM
2009
15 years 4 days ago
2009
One of the most interesting challenges in the area of social computing and social media analysis is the so-called community analysis. A well known barrier in cross-community (mult...