Sciweavers

1252 search results - page 150 / 251
» Foundations of Similarity and Utility
Sort
View
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
14 years 1 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...
MFCS
1995
Springer
14 years 1 months ago
Measure on P: Robustness of the Notion
In AS , we de ned a notion of measure on the complexity class P in the spirit of the work of Lutz L92 that provides a notion of measure on complexity classes at least as large as...
Eric Allender, Martin Strauss
DLOG
2007
14 years 20 days ago
Retrospective on Clio: Schema Mapping and Data Exchange in Practice
Clio is a joint research project between the University of Toronto and IBM Almaden Research Center started in 1999 to address both foundational and systems issues related to the ma...
Renée J. Miller
GLVLSI
2010
IEEE
190views VLSI» more  GLVLSI 2010»
14 years 10 days ago
A linear statistical analysis for full-chip leakage power with spatial correlation
In this paper, we present an approved linear-time algorithm for statistical leakage analysis in the present of any spatial correlation condition (strong or weak). The new algorith...
Ruijing Shen, Sheldon X.-D. Tan, Jinjun Xiong
CIKM
2008
Springer
14 years 10 days ago
On effective presentation of graph patterns: a structural representative approach
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
Chen Chen, Cindy Xide Lin, Xifeng Yan, Jiawei Han