1066 search results - page 98 / 214 » Computing Private Set Operations with Linear Complexities |
106
click to vote
SIGGRAPH
1999
ACM
15 years 2 months ago
1999
ACM
High contrast scenes are difficult to depict on low contrast displays without loss of important fine details and textures. Skilled artists preserve these details by drawing scen...
107
click to vote
ICS
2007
Tsinghua U.
15 years 4 months ago
2007
Tsinghua U.
Strassen’s matrix multiplication (MM) has benefits with respect to any (highly tuned) implementations of MM because Strassen’s reduces the total number of operations. Strasse...
NIPS
1997
14 years 11 months ago
1997
Nonlinear dimensionality reduction is formulated here as the problem of trying to find a Euclidean feature-space embedding of a set of observations that preserves as closely as p...
140
click to vote
FOCS
2010
IEEE
14 years 7 months ago
2010
IEEE
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
TCS
2010
14 years 4 months ago
2010
The incremental approach to modular monadic semantics constructs complex monads by using monad transformers to add computational features to a preexisting monad. A complication of...