1066 search results - page 24 / 214 » Computing Private Set Operations with Linear Complexities |
73
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Set intersection is a fundamental operation in information retrieval and database systems. This paper introduces linear space data structures to represent sets such that their int...
65
Voted
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
The seminal work of Hubel and Wiesel [14] and the vast amount of work that followed it prove that hierarchies of increasingly complex cells play a central role in cortical computa...
STOC
1993
ACM
15 years 1 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
DCC
2008
IEEE
15 years 9 months ago
2008
IEEE
A probabilistic algorithm is presented for finding a basis of the root space of a linearized polynomial L(x) = t i=0 Lixqi over Fqn . The expected time complexity of the presented ...
CAD
2008
Springer
14 years 9 months ago
2008
Springer
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...