Sciweavers

496 search results - page 65 / 100
» C4-saturated bipartite graphs
Sort
View
APVIS
2007
13 years 10 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»
13 years 9 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
13 years 22 days 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
ICALP
2010
Springer
14 years 1 months ago
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
Venkatesan Guruswami, Rishi Saket
STOC
2005
ACM
147views Algorithms» more  STOC 2005»
14 years 9 months ago
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sud...