1066 search results - page 28 / 214 » Computing Private Set Operations with Linear Complexities |
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
— We present a method for complexity reduction in reachability analysis and controller synthesis via a Schur-based decomposition for LTI systems. The decomposition yields either ...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of t...
103
click to vote
TKDE
2012
13 years 1 months ago
2012
—Preparing a data set for analysis is generally the most time consuming task in a data mining project, requiring many complex SQL queries, joining tables and aggregating columns....
109
click to vote
DAC
1999
ACM
15 years 3 months ago
1999
ACM
This paper presents a method to reduce the complexity of a linear or linearized (small-signal) analog circuit. The reduction technique, based on quality-error ranking, can be used...
103
click to vote
CCS
2008
ACM
15 years 1 months ago
2008
ACM
We present FairplayMP (for "Fairplay Multi-Party"), a system for secure multi-party computation. Secure computation is one of the great achievements of modern cryptograp...