Search academic resources

At any time humans need accurate information to solve different problems. For example, how to perform a task, what happens in the news, what the hundreds of tweets say, etc. On the other hand, electronic information has ...

In this article, we formally define and investigate the computational complexity of the definability problem for open first-order formulas (i.e. quantifier free first-order formulas) with equality. Given a logic L, the L...

Design‑based estimation of finite population parameters such as totals usually relies on the knowledge of inclusion probabilities characterising the sampling design. They are directly incorporated into sampling weights...

We present some complexity results concerning the problems of covering a graph with p convex sets and of partitioning a graph into p convex sets. The following convexities are considered: digital convexity, monophonic co...

Recently, channel attention mechanism has demonstrated to offer great potential in improving the performance of deep convolutional neural networks (CNNs). However, most existing methods dedicate to developing more sophis...