Sciweavers

4526 search results - page 724 / 906
» Algorithmic problems related to the Internet
Sort
View
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
16 years 4 months ago
Narrow proofs may be spacious: separating space and width in resolution
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...
Jakob Nordström
STOC
2005
ACM
93views Algorithms» more  STOC 2005»
16 years 4 months ago
Representing hard lattices with O(n log n) bits
We present a variant of the Ajtai-Dwork public-key cryptosystem where the size of the public-key is only O(n log n) bits and the encrypted text/clear text ratio is also O(n log n)...
Miklós Ajtai
SIGMOD
2007
ACM
156views Database» more  SIGMOD 2007»
16 years 4 months ago
M-invariance: towards privacy preserving re-publication of dynamic datasets
The previous literature of privacy preserving data publication has focused on performing "one-time" releases. Specifically, none of the existing solutions supports re-pu...
Xiaokui Xiao, Yufei Tao
SIGMOD
2005
ACM
105views Database» more  SIGMOD 2005»
16 years 4 months ago
Reference Reconciliation in Complex Information Spaces
Reference reconciliation is the problem of identifying when different references (i.e., sets of attribute values) in a dataset correspond to the same real-world entity. Most previ...
Xin Dong, Alon Y. Halevy, Jayant Madhavan
DCC
2008
IEEE
16 years 3 months ago
Simultaneous Encryption/Compression of Images Using Alpha Rooting
Significant work has been done in the areas of image encryption and compression as two independent problems, yet the two areas are strongly interleaved and should be considered si...
Eric J. Wharton, Karen Panetta, Sos S. Agaian