19320 search results - page 294 / 3864 » On the complexity of computing determinants |
220
click to vote
IJNSEC
2010
15 years 1 months ago
2010
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...
177
click to vote
COMSWARE
2007
IEEE
16 years 1 months ago
2007
IEEE
—Traditional authentication systems employed on Internet are facing an acute problem of intrusions. In this context we propose a neural architecture for user authentication throu...
165
click to vote
JNCA
2008
15 years 6 months ago
2008
Communities are the latest phenomena on the Internet. At the heart of each community lies a social network. In this paper, we show a generalized framework to understand and reason...
195
click to vote
FCT
2005
Springer
16 years 4 days ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
153
Voted
COMCOM
2004
15 years 6 months ago
2004
The Private Network-to-Network Interface (PNNI) is a scalable hierarchical protocol that allows ATM switches to be aggregated into clusters called peer groups. To provide good acc...