Sciweavers

12459 search results - page 59 / 2492
» cans 2006
Sort
View
IJNSEC
2006
113views more  IJNSEC 2006»
13 years 7 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
INFORMS
2006
87views more  INFORMS 2006»
13 years 7 months ago
Early Estimates of the Size of Branch-and-Bound Trees
This paper intends to show that the time needed to solve mixed integer programming problems by branch and bound can be roughly predicted early in the solution process. We construc...
Gérard Cornuéjols, Miroslav Karamano...
IPL
2006
117views more  IPL 2006»
13 years 7 months ago
P systems without multiplicities of symbol-objects
In this paper we investigate P systems whose compartments contain sets of symbolobjects rather than multisets of objects, as it is common in membrane computing. If the number of m...
Artiom Alhazov
JPDC
2006
106views more  JPDC 2006»
13 years 7 months ago
Computing nearest neighbors in real time
The nearest-neighbor method can successfully be applied to correct possible errors induced into bit strings transmitted over noisy communication channels or to classify samples in...
Marius Nagy, Selim G. Akl
MP
2006
93views more  MP 2006»
13 years 7 months ago
Computation of Error Bounds for P-matrix Linear Complementarity Problems
Abstract We give new error bounds for the linear complementarity problem where the involved matrix is a P-matrix. Computation of rigorous error bounds can be turned into a P-matrix...
Xiaojun Chen, Shuhuang Xiang