22 search results - page 3 / 5 » A new family of tight sets in Q (5, q) |
ECCC
2006
13 years 5 months ago
2006
A q query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
SIAMCOMP
2000
13 years 5 months ago
2000
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
ATAL
2005
Springer
13 years 10 months ago
2005
Springer
This paper presents the key features of a new negotiation model for autonomous agents. The model is generic, handles multi-party and multi-issue negotiation, acknowledges the role...
PKC
2000
Springer
13 years 8 months ago
2000
Springer
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
STOC
2012
ACM
11 years 7 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...