Sciweavers

1066 search results - page 21 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
CORR
2012
Springer
249views Education» more  CORR 2012»
13 years 5 months ago
Computing Cartograms with Optimal Complexity
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
Md. Jawaherul Alam, Therese C. Biedl, Stefan Felsn...
SDM
2004
SIAM
242views Data Mining» more  SDM 2004»
14 years 11 months ago
Privacy-Preserving Multivariate Statistical Analysis: Linear Regression and Classification
Multivariate statistical analysis is an important data analysis technique that has found applications in various areas. In this paper, we study some multivariate statistical analy...
Wenliang Du, Yunghsiang S. Han, Shigang Chen
CRYPTO
2000
Springer
141views Cryptology» more  CRYPTO 2000»
15 years 2 months ago
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
Ivan Damgård, Jesper Buus Nielsen
NAACL
2010
14 years 7 months ago
Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
Daniel Gildea
CSCWD
2008
Springer
14 years 11 months ago
Computer aided architectural design: Wayfinding complexity analysis
Design is a complex process often described as a collaboration between a designer and herself. In architectural design, a designer must consider the selection of a subset of actio...
Brett Bojduj, Ben Weber, Kai-Florian Richter, Sven...