Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Hankala, Teemu"'
We study consistent query answering via different graph representations. First, we introduce solution-conflict hypergraphs in which nodes represent facts and edges represent either conflicts or query solutions. Considering a monotonic query and a set
Externí odkaz:
http://arxiv.org/abs/2412.08324
We study the complexity of the problem of training neural networks defined via various activation functions. The training problem is known to be existsR-complete with respect to linear activation functions and the ReLU activation function. We conside
Externí odkaz:
http://arxiv.org/abs/2305.11833