374 search results - page 22 / 75 » Stochastic Minority on Graphs |
116
click to vote
CP
2006
Springer
15 years 4 months ago
2006
Springer
This paper describes a complete and efficient solution to the stochastic allocation and scheduling for Multi-Processor System-on-Chip (MPSoC). Given a conditional task graph charac...
113
Voted
ICIP
2008
IEEE
16 years 2 months ago
2008
IEEE
In this paper, we present a patch-based variational Bayesian framework of image processing using the language of factor graphs (FGs). The variable and factor nodes of FGs represen...
117
Voted
ICPR
2008
IEEE
15 years 7 months ago
2008
IEEE
To automatically register foreground target in cluttered images, we present a novel hierarchical graph representation and a stochastic computing strategy in Bayesian framework. Th...
102
Voted
TPDS
2008
15 years 17 days ago
2008
This paper proposes a new methodology to model the distribution of finite size content to a group of users connected through an overlay network. Our methodology describes the distr...
121
click to vote
CONSTRAINTS
2007
15 years 20 days ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...