Sciweavers

3778 search results - page 504 / 756
» Representing Web Graphs
Sort
View
AHSWN
2010
105views more  AHSWN 2010»
15 years 5 months ago
Optimal Gathering Algorithms in Multi-Hop Radio Tree-Networks with Interferences
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network,...
Jean-Claude Bermond, Min-Li Yu
ANOR
2008
66views more  ANOR 2008»
15 years 5 months ago
Optimization problems involving collections of dependent objects
We describe a class of problems motivated by numerous real-world applications where there is a collection of objects that have both a cost and a value, but where some of those obj...
David L. Roberts, Charles L. Isbell, Michael L. Li...
CLUSTER
2006
IEEE
15 years 5 months ago
A taxonomy of application scheduling tools for high performance cluster computing
Application scheduling plays an important role in high-performance cluster computing. Application scheduling can be classified as job scheduling and task scheduling. This paper pre...
Jiannong Cao, Alvin T. S. Chan, Yudong Sun, Sajal ...
IJCV
2008
201views more  IJCV 2008»
15 years 5 months ago
Probabilistic Fusion of Stereo with Color and Contrast for Bi-Layer Segmentation
This paper describes two algorithms for the real-time segmentation of foreground from background layers in stereo video sequences. Automatic separation of layers from colour/contr...
Vladimir Kolmogorov, Antonio Criminisi, Andrew Bla...
IANDC
2006
97views more  IANDC 2006»
15 years 5 months ago
Pure bigraphs: Structure and dynamics
Abstract Bigraphs are graphs whose nodes may be nested, representing locality, independently of the edges connecting them. They may be equipped with reaction rules, forming a bigra...
Robin Milner