2252 search results - page 50 / 451 » Lower Bounds for Dynamic Algorithms |
ECCC
2010
13 years 6 months ago
2010
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
We present lower bounds on the space required to estimate the quantiles of a stream of numerical values. Quantile estimation is perhaps the most studied problem in the data stream ...
ICDCS
1995
IEEE
13 years 11 months ago
1995
IEEE
Tasks in a real-time application usually have several stringent timing, resource, and communication requirements. Designing a distributed computing system which can meet all these...
PAMI
1998
13 years 7 months ago
1998
—Deformable template representations of observed imagery, model the variability of target pose via the actions of the matrix Lie groups on rigid templates. In this paper, we stud...
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most 2(1+o(1))q , where q is the total number of oracle queries a...