Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
2
search results - page 1 / 1
»
On the Hardness of Approximating Stopping and Trapping Sets ...
Sort
relevance
views
votes
recent
update
View
thumb
title
8
click to vote
CORR
2007
Springer
53
views
Education
»
more
CORR 2007
»
On the Hardness of Approximating Stopping and Trapping Sets in LDPC Codes
13 years 8 months ago
Download
www.cs.umass.edu
Andrew McGregor, Olgica Milenkovic
claim paper
Read More »
33
click to vote
CORR
2010
Springer
182
views
Education
»
more
CORR 2010
»
Index coding via linear programming
13 years 8 months ago
Download
www.cs.cornell.edu
Abstract Anna Blasiak Robert Kleinberg Eyal Lubetzky Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and e...
Anna Blasiak, Robert D. Kleinberg, Eyal Lubetzky
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »