Sciweavers

64 search results - page 4 / 13
» REHIST: Relative Error Histogram Construction Algorithms
Sort
View
CATS
2006
14 years 11 months ago
A Polynomial Algorithm for Codes Based on Directed Graphs
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...
A. V. Kelarev
CORR
2007
Springer
146views Education» more  CORR 2007»
14 years 9 months ago
Coding for Errors and Erasures in Random Network Coding
Abstract—The problem of error-control in random linear network coding is considered. A “noncoherent” or “channel oblivious” model is assumed where neither transmitter nor...
Ralf Koetter, Frank R. Kschischang
APPROX
2008
Springer
72views Algorithms» more  APPROX 2008»
14 years 11 months ago
Increasing the Output Length of Zero-Error Dispersers
Let C be a class of probability distributions over a finite set . A function D : {0, 1}m is a disperser for C with entropy threshold k and error if for any distribution X in C s...
Ariel Gabizon, Ronen Shaltiel
ECCC
1998
118views more  ECCC 1998»
14 years 9 months ago
Chinese Remaindering with Errors
The Chinese Remainder Theorem states that a positive integer m is uniquely speci ed by its remainder modulo k relatively prime integers p1;:::;pk, provided m < Qk i=1 pi. Thus ...
Oded Goldreich, Dana Ron, Madhu Sudan
KDD
2005
ACM
80views Data Mining» more  KDD 2005»
15 years 10 months ago
Wavelet synopsis for data streams: minimizing non-euclidean error
We consider the wavelet synopsis construction problem for data streams where given n numbers we wish to estimate the data by constructing a synopsis, whose size, say B is much sma...
Sudipto Guha, Boulos Harb