623 search results - page 105 / 125 » Improved construction for pooling design |
139
click to vote
CCS
2008
ACM
15 years 3 months ago
2008
ACM
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
142
click to vote
ICISC
2000
15 years 3 months ago
2000
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
113
click to vote
NN
2008
Springer
15 years 1 months ago
2008
Springer
We organized a challenge for IJCNN 2007 to assess the added value of prior domain knowledge in machine learning. Most commercial data mining programs accept data pre-formatted in ...
125
click to vote
SIGIR
2008
ACM
15 years 1 months ago
2008
ACM
This paper proposes a learning approach for the merging process in multilingual information retrieval (MLIR). To conduct the learning approach, we also present a large number of f...
132
Voted
CORR
2011
Springer
14 years 8 months ago
2011
Springer
Abstract. In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust ...