Sciweavers

677 search results - page 82 / 136
» Bipartite roots of graphs
Sort
View
FOCS
1999
IEEE
15 years 4 months ago
Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain
We show that no Markovian Coupling argument can prove rapid mixing of the Jerrum-Sinclair Markov chain for sampling almost uniformly from the set of perfect and near perfect match...
V. S. Anil Kumar, H. Ramesh
APVIS
2007
15 years 1 months ago
Visualisation and analysis of the internet movie database
In this paper, we present a case study for the visualisation and analysis of large and complex temporal multivariate networks derived from the Internet Movie DataBase (IMDB). Our ...
Adel Ahmed, Vladimir Batagelj, Xiaoyan Fu, Seok-He...
ECCC
2010
82views more  ECCC 2010»
14 years 12 months ago
A Strong Parallel Repetition Theorem for Projection Games on Expanders
The parallel repetition theorem states that for any Two Prover Game with value at most 1 - (for < 1/2), the value of the game repeated n times in parallel is at most (1 - 3 )(n...
Ran Raz
ICASSP
2011
IEEE
14 years 3 months ago
Joint source-channel-network coding for bidirectional wireless relays
The application of joint source-channel coding, based on fountain codes, in the broadcast timeslot of wireless two-way network coding is investigated in this paper. A computationa...
Francois P. S. Luus, Bodhaswar T. Maharaj
CDC
2009
IEEE
189views Control Systems» more  CDC 2009»
15 years 4 months ago
Maximizing aggregated revenue in sensor networks under deadline constraints
Abstract— We study the problem of maximizing the aggregated revenue in sensor networks with deadline constraints. Our model is that of a sensor network that is arranged in the fo...
Srikanth Hariharan, Ness B. Shroff