Sciweavers

263 search results - page 24 / 53
» Extracting Randomness Using Few Independent Sources
Sort
View
AIME
2009
Springer
14 years 15 days ago
Data-Efficient Information-Theoretic Test Selection
We use the concept of conditional mutual information (MI) to approach problems involving the selection of variables in the area of medical diagnosis. Computing MI requires estimate...
Marianne Mueller, Rómer Rosales, Harald Ste...
FOCS
2008
IEEE
14 years 2 months ago
Kakeya Sets, New Mergers and Old Extractors
A merger is a probabilistic procedure which extracts the randomness out of any (arbitrarily correlated) set of random variables, as long as one of them is uniform. Our main result...
Zeev Dvir, Avi Wigderson
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 8 months ago
"Real" Slepian-Wolf Codes
We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field ac...
Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg
ECTEL
2009
Springer
13 years 6 months ago
Ontology Enrichment with Social Tags for eLearning
One of the objectives of this paper is to verify whether it is possible to extract meaningful related tags from a limited set of tagged resources and from resources tagged by only ...
Paola Monachesi, Thomas Markus, Eelco Mossel
CORR
2008
Springer
87views Education» more  CORR 2008»
13 years 8 months ago
The Rate Loss of Single-Letter Characterization: The "Dirty" Multiple Access Channel
For general memoryless systems, the typical information theoretic solution - when exists - has a "single-letter" form. This reflects the fact that optimum performance ca...
Tal Philosof, Ram Zamir