419 search results - page 50 / 84 » Using Matrix Decompositions in Formal Concept Analysis |
ADAEUROPE
2003
Springer
13 years 11 months ago
2003
Springer
Concurrency introduces a high degree of combinatory which may be the source of subtle mistakes. We present a new tool, Quasar, which is based on ASIS and which uses fully the conce...
SAS
1994
Springer
13 years 11 months ago
1994
Springer
Constraint-based analysis is a technique for inferring implementation types. Traditionally it has been described using mathematical formalisms. We explain it in a different and mor...
DATE
2008
IEEE
14 years 2 months ago
2008
IEEE
Compositional Scheduling Analysis couples local scheduling analysis via event streams. While local analysis has successfully been extended to include hierarchical scheduling strat...
TPHOL
2005
IEEE
14 years 1 months ago
2005
IEEE
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
AIME
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In most case-based reasoning (CBR) systems there has been little research done on validating new knowledge, specifically on how previous knowledge differs from current k...