Sciweavers

327 search results - page 28 / 66
» On the structure of the Medvedev lattice
Sort
View
61
Voted
JSYML
2010
55views more  JSYML 2010»
14 years 8 months ago
Groups definable in linear o-minimal structures: the non-compact case
Let M = M, +, <, 0, S be a linear o-minimal expansion of an ordered group, and G = G, ⊕, eG an n-dimensional group definable in M. We show that if G is definably connected w...
Pantelis E. Eleftheriou
INFOSCALE
2006
ACM
15 years 3 months ago
Rough concept lattice based ontology similarity measure
With the rapid development of the semantic web, it is likely that the number of ontologies will greatly increase during the next few years, which leads to the arising demand for r...
Yi Zhao, Wolfgang A. Halang
RIA
2008
73views more  RIA 2008»
14 years 9 months ago
Representing and Manipulating Situation Hierarchies using Situation Lattices
Situations, the semantic interpretations of context, provide a better basis for selecting adaptive behaviours than context itself. The definition of situations typically rests on t...
Juan Ye, Lorcan Coyle, Simon A. Dobson, Paddy Nixo...
INDOCRYPT
2010
Springer
14 years 7 months ago
Partial Key Exposure Attack on RSA - Improvements for Limited Lattice Dimensions
Abstract. Consider the RSA public key cryptosystem with the parameters N = pq, q < p < 2q, public encryption exponent e and private decryption exponent d. In this paper, cryp...
Santanu Sarkar, Sourav Sengupta, Subhamoy Maitra
MDAI
2007
Springer
15 years 3 months ago
Lindig's Algorithm for Concept Lattices over Graded Attributes
Formal concept analysis (FCA) is a method of exploratory data analysis. The data is in the form of a table describing relationship between objects (rows) and attributes (columns), ...
Radim Belohlávek, Bernard De Baets, Jan Out...