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
»
How frequently is a system of 2-linear Boolean equations sol...
Sort
relevance
views
votes
recent
update
View
thumb
title
20
click to vote
CORR
2010
Springer
102
views
Education
»
more
CORR 2010
»
How frequently is a system of 2-linear Boolean equations solvable?
13 years 9 months ago
Download
www.combinatorics.org
Boris Pittel, Ji-A Yeum
claim paper
Read More »
28
click to vote
ICASSP
2009
IEEE
146
views
Signal Processing
»
more
ICASSP 2009
»
Detection of sparse signals under finite-alphabet constraints
14 years 20 days ago
Download
ens.ewi.tudelft.nl
In this paper, we solve the problem of detecting the entries of a sparse finite-alphabet signal from a limited amount of data, for instance obtained by compressive sampling. While...
Zhi Tian, Geert Leus, Vincenzo Lottici
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »