Sciweavers

154 search results - page 4 / 31
» Using Galois Ideals for Computing Relative Resolvents
Sort
View
CIE
2007
Springer
14 years 1 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
IJCAI
2001
13 years 8 months ago
Weakening Conflicting Information for Iterated Revision and Knowledge Integration
The ability to handle exceptions, to perform iterated belief revision and to integrate information from multiple sources are essential skills for an intelligent agent. These impor...
Salem Benferhat, Souhila Kaci, Daniel Le Berre, Ma...
ICCS
2005
Springer
14 years 27 days ago
Morphisms in Context
Abstract. Morphisms constitute a general tool for modelling complex relationships between mathematical objects in a disciplined fashion. In Formal Concept Analysis (FCA), morphisms...
Markus Krötzsch, Pascal Hitzler, Guo-Qiang Zh...
ICIP
2007
IEEE
14 years 1 months ago
Relative Position-Based Spatial Relationships using Mathematical Morphology
Spatial information is a crucial aspect of image understanding for modeling context as well as resolving the uncertainties caused by the ambiguities in low-level features. We desc...
Ramazan Gokberk Cinbis, Selim Aksoy
PPOPP
2005
ACM
14 years 28 days ago
Fault tolerant high performance computing by a coding approach
As the number of processors in today’s high performance computers continues to grow, the mean-time-to-failure of these computers are becoming significantly shorter than the exe...
Zizhong Chen, Graham E. Fagg, Edgar Gabriel, Julie...