Sciweavers

9842 search results - page 1663 / 1969
» Problem complexity
Sort
View
CCS
2008
ACM
15 years 8 months ago
Robust, anonymous RFID authentication with constant key-lookup
A considerable number of anonymous RFID authentication schemes have been proposed. However, current proposals either do not provide robust security guarantees, or suffer from scal...
Mike Burmester, Breno de Medeiros, Rossana Motta
ITP
2010
178views Mathematics» more  ITP 2010»
15 years 8 months ago
Interactive Termination Proofs Using Termination Cores
Recent advances in termination analysis have yielded new methods and tools that are highly automatic. However, when they fail, even experts have difficulty understanding why and de...
Panagiotis Manolios, Daron Vroon
CIKM
2008
Springer
15 years 8 months ago
Information shared by many objects
If Kolmogorov complexity [25] measures information in one object and Information Distance [4, 23, 24, 42] measures information shared by two objects, how do we measure information...
Chong Long, Xiaoyan Zhu, Ming Li, Bin Ma
CIKM
2008
Springer
15 years 8 months ago
Indexing and retrieval of a Greek corpus
Greek is one of the most difficult languages to handle in Web Information Retrieval (IR) related tasks. Its difficulty stems from the fact that it is grammatically, morphologicall...
Georgios Paltoglou, Michail Salampasis, Fotis Laza...
AICCSA
2005
IEEE
113views Hardware» more  AICCSA 2005»
15 years 8 months ago
Towards autonomic Web services
Autonomic Computing was introduced to reduce the complexity of managing computing systems; however, the heterogeneous nature existing in most computing systems introduces some dif...
Amir Zeid, Sherif A. Gurguis
« Prev « First page 1663 / 1969 Last » Next »