419 search results - page 75 / 84 » Using Matrix Decompositions in Formal Concept Analysis |
POPL
2006
ACM
14 years 8 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
CMSB
2006
Springer
13 years 11 months ago
2006
Springer
Type checking and type inference are important concepts and methods of programming languages and software engineering. Type checking is a way to ensure some level of consistency, d...
INCDM
2010
Springer
13 years 11 months ago
2010
Springer
Hospitals increasingly use process models for structuring their care processes. Activities performed to patients are logged to a database but these data are rarely used for managin...
CONCURRENCY
2008
13 years 7 months ago
2008
This paper presents a new service-oriented approach to the design and implementation of visualization systems in a Grid computing environment. The approach evolves the traditional...
VMCAI
2010
Springer
14 years 5 months ago
2010
Springer
In the recent years, there have been a large amount of investigations on safety verification of uncertain continuous systems. In engineering and applied mathematics, this verificat...