Sciweavers

1031 search results - page 95 / 207
» codes 2004
Sort
View
IJNSEC
2006
113views more  IJNSEC 2006»
14 years 11 months ago
Cryptanalysis of Park's Authentication Protocol in Wireless Mobile Communication Systems
In 2004, C. Park proposed an authentication protocol to provide user anonymity and untraceability in wireless mobile communication systems. The real user identities are hidden and...
Alberto Peinado Domínguez
AIEDAM
2004
96views more  AIEDAM 2004»
14 years 11 months ago
Learning while designing
: This paper reports on preliminary results of an explorative study of a protocol analysis of team learning while designing using in-situ data. Two measurement-based frameworks are...
Gourabmoy Nath, John S. Gero
BMCBI
2004
85views more  BMCBI 2004»
14 years 11 months ago
Frequent occurrence of recognition Site-like sequences in the restriction endonucleases
Background: There are two different theories about the development of the genetic code. Woese suggested that it was developed in connection with the amino acid repertoire, while C...
Jan C. Biro, Josephine M. K. Biro
CORR
2004
Springer
152views Education» more  CORR 2004»
14 years 11 months ago
Non-negative matrix factorization with sparseness constraints
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been a...
Patrik O. Hoyer
CORR
2004
Springer
111views Education» more  CORR 2004»
14 years 11 months ago
Finding Approximate Palindromes in Strings Quickly and Simply
: Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence. A simple algorithm requires O(n)space and almost always runs in O(k.n)-...
L. Allison