712 search results - page 31 / 143 » A mixture model for random graphs |
ICC
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract— In this contribution the radio channel model proposed in [1] is extended to include multiple transmitters and receivers. The propagation environment is modelled using r...
ICASSP
2010
IEEE
13 years 10 months ago
2010
IEEE
We present a novel language identification technique using our recently developed deep-structured conditional random fields (CRFs). The deep-structured CRF is a multi-layer CRF mo...
SIGECOM
2006
ACM
14 years 4 months ago
2006
ACM
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
CCCG
2010
13 years 11 months ago
2010
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
ICCV
2009
IEEE
15 years 3 months ago
2009
IEEE
In this work, we extend a common framework for seeded
image segmentation that includes the graph cuts, ran-
dom walker, and shortest path optimization algorithms.
Viewing an ima...