1105 search results - page 133 / 221 » Linear choosability of graphs |
146
click to vote
DGCI
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, we propose a new thinning paradigm to compute them. More precisel...
156
click to vote
IJAR
2010
15 years 3 months ago
2010
Probabilistic Decision Graphs (PDGs) are a class of graphical models that can naturally encode some context specific independencies that cannot always be efficiently captured by...
147
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
In this paper, we investigate limiting behavior of linear dynamic systems driven by random stochastic matrices. We introduce and study the new concepts of partial ergodicity and 1-...
129
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
Real-time streaming signal processing systems typically desire high throughput and low latency. Many such systems can be modeled as synchronous data flow graphs. In this paper, w...
155
click to vote
CIKM
2011
Springer
14 years 4 months ago
2011
Springer
The study of information flow analyzes the principles and mechanisms of social information distribution. It is becoming an extremely important research topic in social network re...