Search Results - 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 by 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…”
Get full text

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

Get full text

Nonintrusive proper generalised decomposition for parametrised incompressible flow problems in OpenFOAM by 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…”
Get full text

Encapsulated PGD Algebraic Toolbox Operating with High-Dimensional Data by 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…”
Get full text

Centrality measure in social networks based on linear threshold model by 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…”
Get full text

The neighborhood role in the linear threshold rank on social networks by 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…”
Get full text

Diffuse scattering on graphs by 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…”
Get full text

Caterpillars Have Antimagic Orientations by 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,…”
Get full text

Resynchronized Uniformization and Definability Problems for Rational Relations by 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…”
Get full text

Generalized Fitch Graphs III: Symmetrized Fitch maps and Sets of Symmetric Binary Relations that are explained by Unrooted Edge-labeled Trees by 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…”
Get full text

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

“…A permutation $σ$ contains the permutation $τ$ if there is a subsequence of $σ$ order isomorphic to $τ$. A permutation $σ$ is $τ$-avoiding if it does not…”
Get full text

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

“…Discrete Mathematics is an important and challenging course for computer science and engineering students…”
Get full text

The Bounded and Precise Word Problems for Presentations of Groups by 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…”
Get full text

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

“…We consider decision problems for relations over finite and infinite words defined by finite automata…”
Get full text

Synthesis of reversible circuits with minimal costs by 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…”
Get full text

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

“…This paper presents a new metaheuristic algorithm called Trees Social Relations Optimization Algorithm (TSR…”
Get full text

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

“… In this paper, we extend a result of Jackson and Visentin (1990) on an enumerative relation between quadrangulations and bipartite quadrangulations…”
Get full text

Gaussian Process regression over discrete probability measures: on the non-stationarity relation between Euclidean and Wasserstein Squared Exponential Kernels by Candelieri, Antonio, Ponti, Andrea, Archetti, Francesco

“…, impossible to avoid by adding artificial noise ( nugget effect ) as usually done. This paper uncovers the main reason of these issues, that is a non-stationarity relation…”
Get full text

Type B plactic relations for $r$-domino tableaux by Taşkın, Müge

“…$ with unequal parameters. In this paper we provide plactic relations on signed permutations which determine whether given two signed permutations have the same insertion $r…”
Get full text

Semi-discrete optimal transport: hardness, regularization and numerical solution by Taşkesen, Bahar, Shafieezadeh-Abadeh, Soroosh, Kuhn, Daniel

“…Semi-discrete optimal transport problems, which evaluate the Wasserstein distance between a discrete and a generic…”
Get full text