An O(n log n) Algorithm for the All-Nearest-Neighbors Problem.
An O(n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments.
An operation with languages occurring in the linguistic approach to the management
An operational semantics for process algebra
An Optimal Convex Hull Algorithm in Any Fixed Dimension.
An optimal strongly identifying code in the infinite triangular grid.
An optimized soft computing-based passage retrieval system
An order topology for finitely generated free monoids.
An Oriented Version of the 1-2-3 Conjecture
The well-known 1-2-3 Conjecture addressed by Karoński, Luczak and Thomason asks whether the edges of every undirected graph G with no isolated edge can be assigned weights from {1, 2, 3} so that the sum of incident weights at each vertex yields a proper vertex-colouring of G. In this work, we consider a similar problem for oriented graphs. We show that the arcs of every oriented graph −G⃗ can be assigned weights from {1, 2, 3} so that every two adjacent vertices of −G⃗ receive distinct sums of outgoing...
An orthogonality-based classification of conjectures in ortholattices.
A mathematical model for conjectures (including hypotheses, consequences and speculations), was recently introduced, in the context of ortholattices, by Trillas, Cubillo and Castiñeira (Artificial Intelligence 117, 2000, 255-257). The aim of the present paper is to further clarify the structure of this model by studying its relationships with one of the most important ortholattices' relation, the orthogonality relation. The particular case of orthomodular lattices -the framework for both Boolean...
An overview of the topological gradient approach in image processing: advantages and inconveniences.
An SMDP model for a multiclass multi-server queueing control problem considering conversion times
We address a queueing control problem considering service times and conversion times following normal distributions. We formulate the multi-server queueing control problem by constructing a semi-Markov decision process (SMDP) model. The mechanism of state transitions is developed through mathematical derivation of the transition probabilities and transition times. We also study the property of the queueing control system and show that optimizing the objective function of the addressed queueing control...
An specification language for fuzzy systems.
This work presents the main features of XFL3, a language for fuzzy system specification, which has been defined as the common description languaje for the tools forming the Xfuzzy 3.0 development environment. Its main advantages are its capability to admit user-defined membership functions, parametric operators, and linguistic hedges. A brief summary of the tools included in Xfuzzy 3.0 and an example illustrating the use of XFL3 are also included.
An Update on bdim the Italian Digital Mathematical Library
bdim has been in operation since the fall of 2010 and has been slowly growing in the last year. I will report here: 1) on what is new in bdim with respect to the first presentation in DML 2010; 2) on some of the technical aspects of our implementation; 3) on the projects for the near future; 4) on some of the issues related to possible integration of bdim with EuDML.
An Upper Bound for Conforming Delaunay Triangulations.
An upper bound for the shortest hamiltonian path in the symmetric euclidean case
An upper bound for transforming self-verifying automata into deterministic ones
This paper describes a modification of the power set construction for the transformation of self-verifying nondeterministic finite automata to deterministic ones. Using a set counting argument, the upper bound for this transformation can be lowered from to
An upper bound on the number of monomials in determinants of sparse matrices with symbolic entries.
An Upper Bound on the Number of Planar K-Sets.
An upper bound on the space complexity of random formulae in resolution
We prove that, with high probability, the space complexity of refuting a random unsatisfiable Boolean formula in -CNF on variables and clauses is .