Výsledky vyhľadávania - Computer science Discrete mathematics in relation to computer science

Graph partitioning and graph clustering : 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA Autor DIMACS Implementation Challenge Workshop, Bader, David A.

“…>What are the communities within an (online) social network? How do I speed up a numerical simulation by mapping it efficiently onto a parallel computer…”
Získať plný text

K_{1,3}$-covering red and blue points in the plane Autor Ábrego, Bernardo M., Fernández Merchant, Silvia, Kano, Mikio, Orden, David, Pérez Lantero, Pablo, Seara Ojea, Carlos, Tejel Altarriba, Francisco Javier

Získať plný text

Nonintrusive proper generalised decomposition for parametrised incompressible flow problems in OpenFOAM Autor Tsiolakis, Vasileios, Giacomini, Matteo, Sevilla, Ruben, Othmer, Carsten, Huerta, Antonio

“…The computational cost of parametric studies currently represents the major limitation to the application of simulation-based engineering techniques in a daily…”
Získať plný text

Encapsulated PGD Algebraic Toolbox Operating with High-Dimensional Data Autor Díez, P., Zlotnik, S., García-González, A., Huerta, A.

“…In its original conception, proper generalized decomposition (PGD) provides explicit parametric solutions, denoted as computational vademecums or digital…”
Získať plný text

Centrality measure in social networks based on linear threshold model Autor Riquelme, Fabián, Gonzalez-Cantergiani, Pablo, Molinero, Xavier, Serna, Maria

“…Centrality and influence spread are two of the most studied concepts in social network analysis. In recent years, centrality measures have attracted the…”
Získať plný text

The neighborhood role in the linear threshold rank on social networks Autor Riquelme, Fabián, Gonzalez-Cantergiani, Pablo, Molinero, Xavier, Serna, Maria

“…Centrality and influence spread are two of the most studied concepts in social network analysis. Several centrality measures, most of them, based on…”
Získať plný text

Diffuse scattering on graphs Autor Gilbert, Anna C., Hoskins, Jeremy G., Schotland, John C.

“…We formulate and analyze difference equations on graphs analogous to time-independent diffusion equations arising in the study of diffuse scattering in…”
Získať plný text

Caterpillars Have Antimagic Orientations Autor Lozano, Antoni

“…An of a directed graph with arcs is a bijection from the set of arcs of to {1, …, } such that all oriented vertex sums of vertices in are pairwise distinct,…”
Získať plný text

Resynchronized Uniformization and Definability Problems for Rational Relations Autor Löding, Christof, Winter, Sarah

“…Regular synchronization languages can be used to define rational relations of finite words, and to characterize subclasses of rational relations, like automatic or recognizable relations…”
Získať plný text

Generalized Fitch Graphs III: Symmetrized Fitch maps and Sets of Symmetric Binary Relations that are explained by Unrooted Edge-labeled Trees Autor Hellmuth, Marc, Seemann, Carsten R., Stadler, Peter F.

“…Binary relations derived from labeled rooted trees play an import role in mathematical biology as formal models of evolutionary relationships. The (symmetrized…”
Získať plný text

A relation on 132-avoiding permutation patterns Autor Aisbett, Natalie

“…A permutation $σ$ contains the permutation $τ$ if there is a subsequence of $σ$ order isomorphic to $τ$. A permutation $σ$ is $τ$-avoiding if it does not…”
Získať plný text

Analyzing and Predicting Student Performance in Discrete Mathematics Using Supervised Learning Algorithms Autor Uddin, Mohammad Salah

“…Discrete Mathematics is an important and challenging course for computer science and engineering students…”
Získať plný text

The Bounded and Precise Word Problems for Presentations of Groups Autor Ivanov, S. V.

“…We introduce and study the bounded word problem and the precise word problem for groups given by means of generators and defining relations…”
Získať plný text

Computational Science – ICCS 2022: 22nd International Conference, London, UK, June 21–23, 2022, Proceedings, Part III Autor Groen, Derek, de Mulatier, Clélia, Paszynski, Maciej, Krzhizhanovskaya, Valeria V, Dongarra, Jack J, Sloot, Peter M. A

“…The four-volume set LNCS 13350, 13351, 13352, and 13353 constitutes the proceedings of the 22ndt International Conference on Computational Science, ICCS 2022, held in London, UK, in June 2022…”
Získať plný text

Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words Autor Loding, Christof, Spinrath, Christopher

“…We consider decision problems for relations over finite and infinite words defined by finite automata…”
Získať plný text

Synthesis of reversible circuits with minimal costs Autor Yang, Guowu, Song, Xiaoyu, Hung, William N. N., Perkowski, Marek A., Seo, Chang-Jun

“…We present fast algorithms to synthesize exact minimal reversible circuits for various types of gate and cost. By reducing reversible logic synthesis problems…”
Získať plný text

Trees Social Relations Optimization Algorithm: A new Swarm-Based metaheuristic technique to solve continuous and discrete optimization problems Autor Alimoradi, Mahmoud, Azgomi, Hossein, Asghari, Ali

“…This paper presents a new metaheuristic algorithm called Trees Social Relations Optimization Algorithm (TSR…”
Získať plný text

Discrete Mathematics for Computer Science: An Example-Based Introduction Autor Fortney, Jon Pierre

“…Discrete Mathematics for Computer Science: An Example-Based Introduction is intended for a first- or second-year discrete mathematics course for computer science majors…”
Získať plný text

Graph algorithms and applications I Autor Tamassia, Roberto, Tollis, Ioannis G

“…This book contains volumes 1-3 of the Journal of Graph Algorithms and Applications (JGAA). Topics of interest include design and analysis of graph algorithms,…”
Získať plný text

A generalization of the quadrangulation relation to constellations and hypermaps Autor Fang, Wenjie

“… In this paper, we extend a result of Jackson and Visentin (1990) on an enumerative relation between quadrangulations and bipartite quadrangulations…”
Získať plný text