Sciweavers

656 search results - page 128 / 132
» A Formalization of Transition P Systems
Sort
View
113
Voted
SOUPS
2010
ACM
15 years 1 months ago
A closer look at recognition-based graphical passwords on mobile devices
Graphical password systems based on the recognition of photographs are candidates to alleviate current over-reliance on alphanumeric passwords and PINs. However, despite being bas...
Paul Dunphy, Andreas P. Heiner, N. Asokan
74
Voted
FSTTCS
2003
Springer
15 years 2 months ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh
83
Voted
ECCV
2004
Springer
15 years 11 months ago
A Robust Algorithm for Characterizing Anisotropic Local Structures
This paper proposes a robust estimation and validation framework for characterizing local structures in a positive multi-variate continuous function approximated by a Gaussian-base...
Kazunori Okada, Dorin Comaniciu, Navneet Dalal, Ar...
WWW
2003
ACM
15 years 10 months ago
?-Queries: enabling querying for semantic associations on the semantic web
This paper presents the notion of Semantic Associations as complex relationships between resource entities. These relationships capture both a connectivity of entities as well as ...
Kemafor Anyanwu, Amit P. Sheth
98
Voted
ICTAI
2007
IEEE
15 years 3 months ago
Establishing Logical Rules from Empirical Data
We review a method of generating logical rules, or axioms, from empirical data. This method, using closed set properties of formal concept analysis, has been previously described ...
John L. Pfaltz