Related papers: ICON Challenge on Algorithm Selection
This article deals with new polynomial time algorithm for graph isomorphism testing.
In this paper, we propose Suppression-Enhancing Mask based attention and Interactive Channel transformatiON (SEMICON) to learn binary hash codes for dealing with large-scale fine-grained image retrieval tasks. In SEMICON, we first develop a…
Academic challenges comprise effective means for (i) advancing the state of the art, (ii) putting in the spotlight of a scientific community specific topics and problems, as well as (iii) closing the gap for under represented communities in…
A semiotic model of the user interface in human-computer interaction. Algorithmic sign, semotics, algorithmic art.
We present a framework for computing with input data specified by intervals, representing uncertainty in the values of the input parameters. To compute a solution, the algorithm can query the input parameters that yield more refined…
We introduce ICON, an R package that contains 1075 complex network datasets in a standard edgelist format. All provided datasets have associated citations and have been indexed by the Colorado Index of Complex Networks - also referred to as…
In this paper we propose an efficient solution of an equivalence problem for semisimple cyclic codes.
We survey some of the major open problems involving selection principles, diagonalizations, and covering properties in topology and infinite combinatorics. Background details, definitions and motivations are also provided.
We consider the challenge of preference elicitation in systems that help users discover the most desirable item(s) within a given database. Past work on preference elicitation focused on structured models that provide a factored…
In recent years the importance of finding a meaningful pattern from huge datasets has become more challenging. Data miners try to adopt innovative methods to face this problem by applying feature selection methods. In this paper we propose…
Let a quantified inequality constraint over the reals be a formula in the first-order predicate language over the structure of the real numbers, where the allowed predicate symbols are $\leq$ and $<$. Solving such constraints is an…
Interactive intelligent systems, i.e., interactive systems that employ AI technologies, are currently present in many parts of our social, public and political life. An issue reoccurring often in the development of these systems is the…
We present an algorithm to compute the number of solutions of the (constrained) number partitioning problem. A concrete implementation of the algorithm on an Ising-type quantum computer is given.
We study the satisfiability problem of symbolic finite automata and decompose it into the satisfiability problem of the theory of the input characters and the monadic second-order theory of the indices of accepted words. We use our…
We discuss the isomorphism problem of projective schemes; given two projective schemes, can we algorithmically decide whether they are isomorphic? We give affirmative answers in the case of one-dimensional projective schemes, the case of…
Many important multiple-objective decision problems can be cast within the framework of ranking under constraints and solved via a weighted bipartite matching linear program. Some of these optimization problems, such as personalized content…
In this report, we descibe our approach to the ECCV 2020 VIPriors Object Detection Challenge which took place from March to July in 2020. We show that by using state-of-the-art data augmentation strategies, model designs, and…
Selecting an optimal set of icons is a crucial step in the pipeline of visual design to structure and navigate through content. However, designing the icons sets is usually a difficult task for which expert knowledge is required. In this…
Tens of thousands of parent companies control millions of subsidiaries through long chains of intermediary entities in global corporate networks. Conversely, tens of millions of entities are directly held by sole owners. We propose an…
We propose a method for computing upper bounds for the Heilbronn problem for triangles.