1749 search results - page 211 / 350 » Conditional colorings of graphs |
183
Voted
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
We consider a network of control systems connected over a graph. Considering the graph structure as constraints on the set of permissible controllers, we show that such systems ar...
215
click to vote
JMLR
2010
15 years 1 months ago
2010
Directed acyclic graph (DAG) models are popular tools for describing causal relationships and for guiding attempts to learn them from data. In particular, they appear to supply a ...
242
click to vote
JMIV
1998
15 years 6 months ago
1998
The main task of digital image processing is to recognize properties of real objects based on their digital images. These images are obtained by some sampling device, like a CCD c...
159
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract—Efficient operation of wireless networks requires distributed routing and scheduling algorithms that take into account interference constraints. Recently, a few algorit...
153
click to vote
ICPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We present algorithms for improved Viterbi decoding for the case of hidden semi-Markov models. By carefully constructing directed acyclic graphs, we pose the decoding problem as t...