608 search results - page 24 / 122 » Random Systems with Complete Connections |
ICCCN
2008
IEEE
14 years 4 months ago
2008
IEEE
Abstract—Previous work has shown that CSMA-based protocols such as the IEEE 802.11 can yield flow starvation in multihop wireless networks. While prior protocol designs alleviat...
WOLLIC
2009
Springer
14 years 4 months ago
2009
Springer
We give a simple intuitionistic completeness proof of Kripke semantics with constant domain for intuitionistic logic with implication and universal quantification. We use a cut-fr...
INFOCOM
2009
IEEE
14 years 4 months ago
2009
IEEE
—A new random linear network coding scheme for reliable communications for time division duplexing channels is proposed. The setup assumes a packet erasure channel and that nodes...
FOCS
2009
IEEE
14 years 4 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
NIPS
2004
13 years 11 months ago
2004
We seek to both detect and segment objects in images. To exploit both local image data as well as contextual information, we introduce Boosted Random Fields (BRFs), which use boos...