Sciweavers

104 search results - page 5 / 21
» Formal concept analysis of higher order
Sort
View
110
Voted
FUIN
2006
103views more  FUIN 2006»
15 years 16 days ago
A Categorical View on Algebraic Lattices in Formal Concept Analysis
Formal concept analysis has grown from a new branch of the mathematical field of lattice theory to a widely recognized tool in Computer Science and elsewhere. In order to fully be...
Pascal Hitzler, Markus Krötzsch, Guo-Qiang Zh...
WCRE
2009
IEEE
15 years 7 months ago
Domain Feature Model Recovery from Multiple Applications Using Data Access Semantics and Formal Concept Analysis
Feature models are widely employed in domainspecific software development to specify the domain requirements with commonality and variability. A feature model is usually construct...
Yiming Yang, Xin Peng, Wenyun Zhao
133
Voted
DIM
2007
ACM
15 years 4 months ago
Linkability estimation between subjects and message contents using formal concepts
In this paper, we examine how conclusions about linkability threats can be drawn by analyzing message contents and subject knowledge in arbitrary communication systems. At first, ...
Stefan Berthold, Sebastian Clauß
TPHOL
2005
IEEE
15 years 6 months ago
A Structured Set of Higher-Order Problems
Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as...
Christoph Benzmüller, Chad E. Brown
91
Voted
CORR
2008
Springer
114views Education» more  CORR 2008»
15 years 18 days ago
The Equivalence of Semidefinite Relaxation MIMO Detectors for Higher-Order QAM
In multi-input multi-output (MIMO) detection, semidefinite relaxation (SDR) has been shown to be an efficient high-performance approach. For BPSK and QPSK, it has been found that S...
Wing-Kin Ma, Chao-Cheng Su, Joakim Jalden, Tsung-H...