1187 search results - page 231 / 238 » Constructing Distributed Representations Using Additive Clus... |
145
click to vote
IACR
2011
14 years 2 months ago
2011
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
112
click to vote
SIGGRAPH
1993
ACM
15 years 6 months ago
1993
ACM
We present an efficient and robust algorithm for finding points of collision between time-dependent parametric and implicit surfaces. The algorithm detects simultaneous collisio...
122
Voted
PLDI
1990
ACM
15 years 6 months ago
1990
ACM
- This paper describes techniques for optimizing range checks performed to detect array bound violations. In addition to the elimination of range check:s, the optimizations discuss...
155
click to vote
ASIACRYPT
2011
Springer
14 years 2 months ago
2011
Springer
We present a generic method to secure various widely-used cryptosystems against arbitrary side-channel leakage, as long as the leakage adheres three restrictions: first, it is bou...
126
click to vote
WWW
2004
ACM
16 years 3 months ago
2004
ACM
We present a Semantic Web application that we call CS AKTive Space1 . The application exploits a wide range of semantically heterogeneous and distributed content relating to Compu...