Filters








32 Hits in 3.8 sec

Sublinear-Time Computation in the Presence of Online Erasures [article]

Iden Kalemaj, Sofya Raskhodnikova, Nithin Varma
2021 arXiv   pre-print
We initiate the study of sublinear-time algorithms that access their input via an online adversarial erasure oracle.  ...  Specifically, we focus on property testing in the model with online erasures.  ...  Acknowledgements We are thankful to Kobbi Nissim for suggesting investigating settings with online adversarial erasures. We thank Noga Ron-Zewi for pointing out relevant references.  ... 
arXiv:2109.08745v1 fatcat:xt4kjwir7jflfblbsbds64mfri

Sublinear-Time Computation in the Presence of Online Erasures

Iden Kalemaj, Sofya Raskhodnikova, Nithin Varma, Mark Braverman
2022
We initiate the study of sublinear-time algorithms that access their input via an online adversarial erasure oracle.  ...  Specifically, we focus on property testing in the model with online erasures.  ...  I T C S 2 0 2 2 90:14 Sublinear-Time Computation in the Presence of Online Erasures Algorithm 2 A 2 t-Online-Erasure-Resilient Quadraticity Tester.  ... 
doi:10.4230/lipics.itcs.2022.90 fatcat:f7tkwg52vvhihi743dh2wy4cda

The Price of Low Communication in Secure Multi-party Computation [chapter]

Juan Garay, Yuval Ishai, Rafail Ostrovsky, Vassilis Zikas
2017 Lecture Notes in Computer Science  
We provide a complete investigation of security in the presence of semi-honest adversaries-static and adaptive, with and without erasures-and initiate the study of security in the presence of malicious  ...  In contrast, in the sublinear-communication realm erasures have a big effect on the feasibility bound and make the design of an optimal protocol a far more challenging task.  ...  This work was done in part while the authors were visiting the Simons Institute for the  ... 
doi:10.1007/978-3-319-63688-7_14 fatcat:yiixbhuqtjhs3ljhpt6efdaefi

In-network Coding for Resilient Sensor Data Storage and Efficient Data Mule Collection [chapter]

Michele Albano, Jie Gao
2010 Lecture Notes in Computer Science  
We show that using spatial gossip we can compute the erasure codes for the entire network with a total of near linear message transmissions, thus improving substantially the communication cost in previous  ...  In a sensor network of n nodes in which k of them have sensed interesting data, we perform in-network erasure coding such that each node stores a linear combination of all the network data with random  ...  For this, we keep all the computed coded values in the sensors, instead of replacing them with the newly computed codeword.  ... 
doi:10.1007/978-3-642-16988-5_10 fatcat:3mzyjihlmfberhjqcyc227nwve

Periodicity in Data Streams with Wildcards [chapter]

Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou
2018 Lecture Notes in Computer Science  
We present a two-pass streaming algorithm that computes wildcard-periods of S using O k 3 polylog n bits of space, while we also show that this problem cannot be solved in sublinear space in one pass.  ...  We then give a one-pass randomized streaming algorithm that computes all wildcard-periods p of S with p < n 2 and no wildcard characters appearing in the last p symbols of S, using O k 3 log 9 n space.  ...  Acknowledgements We would like to thank the anonymous reviewers for their helpful comments. The work was supported by the National Science Foundation under NSF Awards #1649515 and #1619081.  ... 
doi:10.1007/978-3-319-90530-3_9 fatcat:diw5knbyzfcc5afbs63e43nbay

Periodicity in Data Streams with Wildcards [article]

Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou
2018 arXiv   pre-print
We present a two-pass streaming algorithm that computes wildcard-periods of S using O(k^3 polylog n) bits of space, while we also show that this problem cannot be solved in sublinear space in one pass.  ...  We then give a one-pass randomized streaming algorithm that computes all wildcard-periods p of S with p<n/2 and no wildcard characters appearing in the last p symbols of S, using O(k^3polylog n) space.  ...  Acknowledgements We would like to thank the anonymous reviewers for their helpful comments. The work was supported by the National Science Foundation under NSF Awards #1649515 and #1619081.  ... 
arXiv:1802.07375v3 fatcat:qbsiz23zp5hwjmlh2cf5hfru2m

Fault tolerance of quantum low-density parity check codes with sublinear distance scaling

Alexey A. Kovalev, Leonid P. Pryadko
2013 Physical Review A. Atomic, Molecular, and Optical Physics  
These codes are a finite-rate generalization of the toric codes, and, for sufficiently large quantum computers, offer an advantage over the toric codes.  ...  In particular, we show that any family of LDPC codes, quantum or classical, where distance scales as a positive power of the block length, d ∝ n^α, α>0, can correct all errors with certainty if the error  ...  We also give related bounds for fault-tolerant op-eration in the presence of syndrome measurement errors.  ... 
doi:10.1103/physreva.87.020304 fatcat:bmhqmeaskfhijeu2uspuhodfja

LH*RS---a highly-available scalable distributed data structure

Witold Litwin, Rim Moussa, Thomas Schwarz
2005 ACM Transactions on Database Systems  
The capabilities of LH * RS offer new perspectives to data intensive applications, including the emerging ones of grids and of P2P computing.  ...  The high-availability management uses a novel parity calculus that we have developed, based on Reed-Salomon erasure correcting coding.  ...  The growth of T appears to be sublinear with respect to the number of buckets recovered.  ... 
doi:10.1145/1093382.1093386 fatcat:kfzqgb6vjbcdhlrinv3jyavzjy

Compressive sensing: From theory to applications, a survey

Saad Qaisar, Rana Muhammad Bilal, Wafa Iqbal, Muqaddas Naureen, Sungyoung Lee
2013 Journal of Communications and Networks  
Sparsity, an inherent characteristic of many natural signals, enables the signal to be stored in few samples and subsequently be recovered accurately, courtesy of compressive sensing.  ...  This article gives a brief background on the origins of this idea, reviews the basic mathematical foundation of the theory and then goes on to highlight different areas of its application with a major  ...  The sensing matrix Φ in such schemes is augmented with an additional number of e rows, where e is the number of erasures.  ... 
doi:10.1109/jcn.2013.000083 fatcat:mlxbvwfxivbubdbtzkqxgx5c3y

Identification and lossy reconstruction in noisy databases

Ertem Tuncel, Deniz Gunduz
2010 2010 IEEE International Symposium on Information Theory  
A high-dimensional database system is studied where the noisy versions of the underlying feature vectors are observed in both the enrollment and query phases.  ...  of the feature vector.  ...  COMPUTATION OF R FOR TWO SIMPLE EXAMPLES As was discussed in [6] and [11] for the respective special cases, one way of computing the tradeoff is to rewrite the triplet I (Y ; U ), I (Z ; U ), E[d(X  ... 
doi:10.1109/isit.2010.5513250 dblp:conf/isit/TuncelG10 fatcat:bagt7y5oqnhhbaeyzqpklkaa6y

Fundamental Limits of Online Network-Caching [article]

Rajarshi Bhattacharjee, Subhankar Banerjee, Abhishek Sinha
2020 arXiv   pre-print
Although many different caching algorithms are in use today, the fundamental performance limits of network caching algorithms from an online learning point-of-view remain poorly understood to date.  ...  Technically, the lower-bounds are obtained by relating the online caching problem to the classic probabilistic paradigm of balls-into-bins.  ...  Proof outline: The principal difficulty in extending the argument from the proof of Theorem 3.3 to the inelastic case is the presence of non-linearity in the reward function (16) in the form of min(·  ... 
arXiv:2003.14085v1 fatcat:js7flrxtcjgi7equgsg2kef6xq

Technical Program

2021 2020 IEEE Information Theory Workshop (ITW)  
The limit of a discrete-time model of the optical fiber described by the split-step Fourier method (SSFM) when the number of segments in distance \(K\) tends to infinity is considered.  ...  The optimal local signal satisfies very favorable properties: it is independent of the time horizon, and the resulting error probability is independent of the measurements.  ...  The construction depends on the computation of min-rank of a matrix, which is computationally intensive. In [A. A. Mahesh, N. S. Karat and B. S.  ... 
doi:10.1109/itw46852.2021.9457668 fatcat:j425ygeajrbd5esztbe5zgygty

Serial dependence is absent at the time of perception but increases in visual working memory [article]

Daniel P. Bliss, Jerome J. Sun, Mark D'Esposito
2017 bioRxiv   pre-print
In the present study, we parametrically vary the delay between stimulus and response in a spatial delayed response task to explore the trajectory of serial dependence from the moment of perception into  ...  Only as the memory period lengthens is a blending of past and present information apparent in behavior, reaching its maximum with a memory delay of six seconds.  ...  , we observed a sublinear increase in the variance of responses, which in the case of our data continued up to the 10 s delay (bootstrapped 95% confidence interval at 6 s = [41.28 The large sample of participants  ... 
doi:10.1101/187666 fatcat:4pwdtwrxxrcmdnyos4qlekomjq

Serial dependence is absent at the time of perception but increases in visual working memory

Daniel P. Bliss, Jerome J. Sun, Mark D'Esposito
2017 Scientific Reports  
This smoothing of representations -termed "serial dependence" -is a function of how close successive stimuli are in space 1,15 and time [1] [2] [3] [4] [5] [6] [7] 12, 14, 15 .  ...  In the present study, we parametrically vary the delay between stimulus and response in a spatial delayed response task to explore the trajectory of serial dependence from the moment of perception into  ...  Acknowledgements We thank David Whitney (and the Whitney Lab), Michael Silver, Bill Prinzmetal, Jason Scimeca, and Anastasia Kiyonaga for helpful discussions throughout the completion of this study.  ... 
doi:10.1038/s41598-017-15199-7 pmid:29116132 pmcid:PMC5677003 fatcat:vxdl43gdpra5daqm7fzfynsjle

Jamming Bandits—A Novel Learning Method for Optimal Jamming

SaiDhiraj Amuru, Cem Tekin, Mihaela van der Schaar, R. Michael Buehrer
2016 IEEE Transactions on Wireless Communications  
We first present online learning algorithms to maximize the jamming efficacy against static transmitter-receiver pairs and prove that these algorithms converge to the optimal (in terms of the error rate  ...  Even more importantly, we prove that the rate of convergence to the optimal jamming strategy is sublinear, i.e., the learning is fast in comparison to existing reinforcement learning algorithms, which  ...  Specifically, the computational complexity of the tree-based algorithms in [33] are O(N mod n 2 ) in the nth round (or the nth time instant) and the memory requirement is O (N mod n) .  ... 
doi:10.1109/twc.2015.2510643 fatcat:bepamrvjgbff3kd6373ac3nuzq
« Previous Showing results 1 — 15 out of 32 results