5227 search results - page 293 / 1046 » Constructing New Media |
190
click to vote
ISIM
2007
15 years 9 months ago
2007
One of the main problems connected with the formal concept analysis and lattice construction is the high complexity of algorithms which plays a significant role when computing all ...
180
Voted
IJCAI
2003
15 years 8 months ago
2003
Identifying and breaking the symmetries of CNF formulae has been shown to lead to significant reductions in search times. In this paper we describe a more systematic and efficient...
226
Voted
SYRCODIS
2007
15 years 8 months ago
2007
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...
250
click to vote
CADE
2010
Springer
15 years 8 months ago
2010
Springer
State of the art reasoners for expressive description logics, such as those that underpin the OWL ontology language, are typically based on highly optimized implementations of (hyp...
151
click to vote
DAM
2008
15 years 7 months ago
2008
We interpret the reciprocation process in K[[x]] as a fixed point problem related to contractive functions for certain adequate ultrametric spaces. This allows us to give a dynamic...