In this paper, we consider the following graph embedding problem: Given a bipartite graph G = (V1, V2; E), where the maximum degree of vertices in V2 is 4, can G be embedded on a t...
Anil Ada, Melanie Coggan, Paul Di Marco, Alain Doy...
Many systems for tasks such as question answering, multi-document summarization, and information retrieval need robust numerical measures of lexical relatedness. Standard thesauru...
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
When the amount of information in visualization becomes large enough, users can not perceive all elements at the same time. This problem can be solved by removing parts of the inf...
In order to protect an image search engine's users from undesirable results adult images' classifier should be built. The information about links from websites to images...
Evgeny Kharitonov, Anton Slesarev, Ilya Muchnik, F...