Sciweavers

18 search results - page 2 / 4
» On the structure of 1-designs with at most two block interse...
Sort
View
TPDS
1998
94views more  TPDS 1998»
13 years 4 months ago
Access Control and Signatures via Quorum Secret Sharing
—We suggest a method of controlling the access to a secure database via quorum systems. A quorum system is a collection of sets (quorums) every two of which have a nonempty inter...
Moni Naor, Avishai Wool
FOCS
2008
IEEE
13 years 11 months ago
Dynamic Connectivity: Connecting to Networks and Geometry
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
Timothy M. Chan, Mihai Patrascu, Liam Roditty
COMPGEOM
2009
ACM
13 years 11 months ago
Cache-oblivious range reporting with optimal queries requires superlinear space
We consider a number of range reporting problems in two and three dimensions and prove lower bounds on the amount of space used by any cache-oblivious data structure for these pro...
Peyman Afshani, Chris H. Hamilton, Norbert Zeh
ICASSP
2010
IEEE
13 years 5 months ago
Automatic detection of well sampled images via a new ringing measure
According to Shannon Sampling Theory, Fourier interpolation is the optimal way to reach subpixel accuracy from a properly-sampled digital image. However, for most images this inte...
Gwendoline Blanchet, Lionel Moisan, Bernard Roug&e...
TCS
2002
13 years 4 months ago
Binary (generalized) Post Correspondence Problem
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
Vesa Halava, Tero Harju, Mika Hirvensalo