Mathematics in Computer Science
Công bố khoa học tiêu biểu
* Dữ liệu chỉ mang tính chất tham khảo
Sắp xếp:
Grammatical Verification for Mathematical Formula Recognition Based on Context-Free Tree Grammar
Mathematics in Computer Science - - 2010
Foreword to the Special Focus on Advances in Symbolic and Numeric Computation IV
Mathematics in Computer Science - Tập 16 Số 1 - 2022
Modeling of an Asymptotically Central Markov Process on 3D Young Graph
Mathematics in Computer Science - Tập 11 - Trang 315-328 - 2017
The paper discusses the asymptotics of path probabilities in Markov processes close to a central one on 3D Young graph. We consider a one-parameter family of such processes and compute the parameter value in such a way that the centrality condition is satisfied with the greatest possible accuracy. We defined a normalized dimension of paths in the 3D Young graph. We study the growth and oscillation......
Subdivision Strategies for Boxes in Branch-and-Bound Nonlinear Solvers and Verification
Mathematics in Computer Science - Tập 8 - Trang 341-355 - 2014
Most verified solvers for nonlinear interval systems of equations comprise two strategies: a branch-and-bound-type “location” phase for excluding regions that cannot contain a solution, and a “verification” phase for proving that the remaining regions do indeed contain solutions. In the first phase, subdivision is crucial for the efficiency of the solvers. We discuss several ways for subdivision a......
An Efficient Algorithm to Identify DNA Motifs
Mathematics in Computer Science - Tập 7 - Trang 387-399 - 2013
We consider the problem of identifying motifs that abstracts the task of finding short conserved sites in genomic DNA. The planted (l, d)-motif problem, PMP, is the mathematical abstraction of this problem, which consists of finding a substring of length l that occurs in each s
i
in a set of input sequences S = {s
1, s
......
Descriptive Proximities. Properties and Interplay Between Classical Proximities and Overlap
Mathematics in Computer Science - Tập 12 - Trang 91-106 - 2017
The theory of descriptive nearness is usually adopted when dealing with subsets that share some common properties, even when the subsets are not spatially close. Set description arises from the use of probe functions to define feature vectors that describe a set; nearness is given by proximities. A probe on a nonempty set X is an n-dimensional, real-valued function that maps each member of X to it......
Design, Concepts, and State of the Art of the swMATH Service
Mathematics in Computer Science - Tập 11 - Trang 469-481 - 2017
In this paper, the concepts and design for an efficient information service for mathematical software and further mathematical research data are presented. The publication-based approach and the web-based approach are the main building blocks of the service and will be discussed. Heuristic methods are used for identification, extraction, and ranking of information about software and other mathemat......
Antimagic Labelings of Join Graphs
Mathematics in Computer Science - Tập 9 - Trang 139-143 - 2015
An antimagic labeling of a graph with q edges is a bijection from the set of edges of the graph to the set of positive integers
$${\{1, 2,\dots,q\}}$$
such that all vertex weights are pairwise distinct, where a vertex weight is the sum of labels ......
Tổng số: 433
- 1
- 2
- 3
- 4
- 5
- 6
- 10