|
|
|
|
|
Mihael Arcan, Sampritha Manjunath, Cécile Robin, Ghanshyam Verma, Devishree Pillai, Simon Sarkar, Sourav Dutta, Haytham Assem, John P. McCrae and Paul Buitelaar
Intent classification is an essential task for goal-oriented dialogue systems for automatically identifying customers? goals. Although intent classification performs well in general settings, domain-specific user goals can still present a challenge for t...
ver más
|
|
|
|
|
|
|
|
|
|
|
Felix Kahmann, Fabian Honecker, Julian Dreyer, Marten Fischer and Ralf Tönjes
Since the introduction of the first cryptocurrency, Bitcoin, in 2008, the gain in popularity of distributed ledger technologies (DLTs) has led to an increasing demand and, consequently, a larger number of network participants in general. Scaling blockcha...
ver más
|
|
|
|
|
|
|
|
|
|
|
Alexandra O. Shabarkova,Mikhail B. Abrosimov
Pág. 28 - 32
One of the most important types of graphs are tournaments, as they find practical application in many areas of our lives. Recall that a tournament is a complete oriented graph, that is, a directed graph, between each pair of its vertices there is a singl...
ver más
|
|
|
|
|
|
|
|
|
|
|
Maximilian Hoffmann and Ralph Bergmann
Similarity-based retrieval of semantic graphs is a core task of Process-Oriented Case-Based Reasoning (POCBR) with applications in real-world scenarios, e.g., in smart manufacturing. The involved similarity computation is usually complex and time-consumi...
ver más
|
|
|
|
|
|
|
|
|
|
|
Fabio Sikansi, Renato R. O. da Silva, Gabriel D. Cantareira, Elham Etemad and Fernando V. Paulovich
Graph visualization has been successfully applied in a wide range of problems and applications. Although different approaches are available to create visual representations, most of them suffer from clutter when faced with many nodes and/or edges. Among ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Frank Gurski, Dominique Komander and Carolin Rehs
Coloring is one of the most famous problems in graph theory. The coloring problem on undirected graphs has been well studied, whereas there are very few results for coloring problems on directed graphs. An oriented k-coloring of an oriented graph ??=(??,...
ver más
|
|
|
|
|
|
|
|
|
|
|
Florian Windhager, Saminu Salisu and Eva Mayr
Uncertainty is a standard condition under which large parts of art-historical and curatorial knowledge creation and communication are operating. In contrast to standard levels of data quality in non-historical research domains, historical object and know...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yelyzaveta Meleshko
Pág. 80 - 85
The subject matter of the article is the process of modeling social networks. The goal is to develop a computer model of a social network with a recommendation system. The tasks to be solved are to research the methods of generating social networks, to r...
ver más
|
|
|
|
|
|
|
|
|
|
|
Welington Pereira Santos, Luiz Mario de Matos Jorge (Author)
Pág. 1427 - 1432
This work presents a user-friendly simulator of an educational module of heat transfer in fins, widely used in undergraduate courses. Simulator was developed in DELPHI, an object-oriented computer language. Data are entered through an interactive window ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Azevedo, M M de; Bagherzadeh, N; Latifi, S
Pág. 261 - 274
|
|
|
|
|
|