Sciweavers

26782 search results - page 356 / 5357
» The Importance of Importance
Sort
View
COCOON
2009
Springer
16 years 2 months ago
HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank
This paper explores the fundamental question of how many iterations the celebrated HITS algorithm requires on a general graph to converge in score and, perhaps more importantly, in...
Enoch Peserico, Luca Pretto
ERSHOV
2009
Springer
16 years 2 months ago
Privacy Preserving Modules for Ontologies
Abstract. Data privacy is an important application of ontology modularization. The aim is to publish one module while keeping the information of another module private. We show how...
Thomas Studer
IMA
2009
Springer
131views Cryptology» more  IMA 2009»
16 years 2 months ago
An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems
Gaudry and Schost gave a low-memory algorithm for solving the 2-dimensional discrete logarithm problem. We present an improvement to their algorithm and extend this improvement to ...
Steven D. Galbraith, Raminder S. Ruprai
CDC
2008
IEEE
182views Control Systems» more  CDC 2008»
16 years 2 months ago
A Lyapunov approach to second-order sliding mode controllers and observers
— In this paper a strong Lyapunov function is obtained, for the first time, for the supertwisting algorithm, an important class of second order sliding modes (SOSM). This algori...
Jaime A. Moreno, Marisol Osorio
GLOBECOM
2008
IEEE
16 years 2 months ago
Small Logarithmic S-Boxes for Small Ciphers
-- The substitution box (S-Box) is one of the most important components in modern ciphers. This paper reports a new class of S-Boxes defined by the logarithmic functions in GF(16)....
Xian Liu