Sciweavers

917 search results - page 20 / 184
» Comparison of Data Structures for Computing Formal Concepts
Sort
View
ACTA
1998
81views more  ACTA 1998»
13 years 7 months ago
Dijkstra-Scholten Predicate Calculus: Concepts and Misconceptions
The paper focusses on the logical backgrounds of the Dijkstra-Scholten program development style for correct programs. For proving the correctness of a program (i.e. the fact that...
Lex Bijlsma, Rob Nederpelt
ICGI
2010
Springer
13 years 5 months ago
Learning Context Free Grammars with the Syntactic Concept Lattice
The Syntactic Concept Lattice is a residuated lattice based on the distributional structure of a language; the natural representation based on this is a context sensitive formalism...
Alexander Clark
ISMB
1997
13 years 9 months ago
Hierarchical Protein Structure Superposition Using Both Secondary Structure and Atomic Representations
The structural comparison of proteins has become increasingly important as a means to identify protein motifs and fold families. In this paper we present a new algorithm for the c...
Amit Pal Singh, Douglas L. Brutlag
AINA
2003
IEEE
13 years 11 months ago
Formal Verification of Condition Data Flow Diagrams for Assurance of Correct Network Protocols
Condition Data Flow Diagrams (CDFDs) are a formalized notation resulting from the integration of Yourdon Data Flow Diagrams, Petri Nets, and pre-post notation. They are used in th...
Shaoying Liu
HCI
2009
13 years 5 months ago
Addressing the Interplay of Culture and Affect in HCI: An Ontological Approach
Culture and affect are closely tied domains that have been considered separately in HCI until now. After carefully reviewing research done in each of those domains, a formal ontolo...
Emmanuel G. Blanchard, Riichiro Mizoguchi, Susanne...