2452 search results - page 337 / 491 » On Reduction of Lagrange Systems |
148
Voted
MOBIHOC
2000
ACM
15 years 8 months ago
2000
ACM
ln the future, wireless networking will be embedded into a wide variety of common, everyday objects [1]. In many embedded networking situations, the communicating nodes will be ver...
127
click to vote
CRYPTO
2000
Springer
15 years 8 months ago
2000
Springer
We present a chosen-ciphertext attack against the public key cryptosystem called NTRU. This cryptosystem is based on polynomial algebra. Its security comes from the interaction of ...
154
click to vote
ISCA
2010
IEEE
15 years 6 months ago
2010
IEEE
Two broad classes of memory models are available today: models with hardware cache coherence, used in conventional chip multiprocessors, and models that rely upon software to mana...
141
click to vote
IJFCS
2008
15 years 4 months ago
2008
In data mining applications, highly sized contexts are handled what usually results in a considerably large set of frequent itemsets, even for high values of the minimum support t...
126
click to vote
CC
2007
Springer
15 years 4 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...