11862 search results - page 82 / 2373 » Relative information completeness |
KI
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We provide an interactive method for knowledge acquisition combining approaches from description logic and formal concept analysis. Based on present data, hypothetical ru...
TPDS
1998
13 years 7 months ago
1998
—Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are 3-complete and hence it may not be possible to desig...
SIBGRAPI
2005
IEEE
14 years 1 months ago
2005
IEEE
Mathematical morphology was originally conceived as a set theoretic approach for the processing of binary images. Approaches that extend classical binary morphology to gray-scale ...
ICFP
2007
ACM
14 years 7 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
PROFES
2001
Springer
14 years 5 days ago
2001
Springer
Many small and medium-sized companies that develop software experience the same problems repeatedly, and have few systems in place to learn from their own mistakes as well as their...