1017 search results - page 154 / 204 » Some existence and construction results of polygonal designs |
146
click to vote
AO
2007
15 years 6 months ago
2007
One of the major goals of ontology is to represent properly the underlying conceptual structure of the messy world reflecting the reality as much as possible. Ontology building to...
193
click to vote
CRYPTO
2009
Springer
16 years 23 days ago
2009
Springer
We study the design of cryptographic primitives resilient to key-leakage attacks, where an attacker can repeatedly and adaptively learn information about the secret key, subject o...
193
click to vote
SAC
2006
ACM
16 years 4 days ago
2006
ACM
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
201
click to vote
ICISC
2000
15 years 7 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...
197
click to vote
SIGMETRICS
2000
ACM
15 years 6 months ago
2000
ACM
Hot spots are a major obstacle to achieving scalability in the Internet. At the application layer, hot spots are usually caused by either (a) high demand for some data or (b) high...