
LSVO: Learning Dense Optical Subspace for Robust Visual Odometry Estimation
This work proposes a novel deep network architecture to solve the camera...
read it

Query Answering in ResourceBased Answer Set Semantics
In recent work we defined resourcebased answer set semantics, which is ...
read it

A Framework for Parallel and Distributed Training of Neural Networks
The aim of this paper is to develop a general framework for training neu...
read it

Distributed Adaptive Learning of Graph Signals
The aim of this paper is to propose distributed strategies for adaptive ...
read it

Autonomous Agents Coordination: Action Languages meet CLP(FD) and Linda
The paper presents a knowledge representation formalism, in the form of ...
read it

Multivalued Action Languages in CLP(FD)
Action description languages, such as A and B, are expressive instrument...
read it

Applications of sampling Kantorovich operators to thermographic images for seismic engineering
In this paper, we present some applications of the multivariate sampling...
read it

Tables, bounds and graphics of short linear codes with covering radius 3 and codimension 4 and 5
The length function ℓ_q(r,R) is the smallest length of a q ary linear ...
read it

On the Edgelength Ratio of Outerplanar Graphs
We show that any outerplanar graph admits a planar straightline drawing ...
read it

Planar Drawings of FixedMobile Bigraphs
A fixedmobile bigraph G is a bipartite graph such that the vertices of ...
read it

Colored Pointset Embeddings of Acyclic Graphs
We show that any planar drawing of a forest of three stars whose vertice...
read it

Gapplanar Graphs
We introduce the family of kgapplanar graphs for k ≥ 0, i.e., graphs t...
read it

3D Visibility Representations of 1planar Graphs
We prove that every 1planar graph G has a zparallel visibility represe...
read it

Accelerating Energy Games Solvers on Modern Architectures
Quantitative games, where quantitative objectives are defined on weighte...
read it

Beyond Outerplanarity
We study straightline drawings of graphs where the vertices are placed ...
read it

Minimum weight codewords in dual AlgebraicGeometric codes from the GiuliettiKorchmáros curve
In this paper we investigate the number of minimum weight codewords of s...
read it

A Matrix Approach for Weighted Argumentation Frameworks: a Preliminary Report
The assignment of weights to attacks in a classical Argumentation Framew...
read it

On Looking for Local Expansion Invariants in Argumentation Semantics
We study invariant local expansion operators for conflictfree and admis...
read it

Geodesic Obstacle Representation of Graphs
An obstacle representation of a graph is a mapping of the vertices onto ...
read it

Towards Monocular Digital Elevation Model (DEM) Estimation by Convolutional Neural Networks  Application on Synthetic Aperture Radar Images
Synthetic aperture radar (SAR) interferometry (InSAR) is performed using...
read it

Pure gaps on curves with many rational places
We consider the algebraic curve defined by y^m = f(x) where m ≥ 2 and f(...
read it

Efficient Algorithms for Bendminimum Orthogonal Drawings of Planar 3Graphs
Let G be a planar 3graph (i.e., a planar graph with vertex degree at mo...
read it

A Survey on Graph Drawing Beyond Planarity
Graph Drawing Beyond Planarity is a rapidly growing research area that c...
read it

(k,p)Planarity: A Generalization of Hybrid Planarity
A graph G is (k,p)planar if its vertices can be partitioned into cluste...
read it

Orthopolygon Visibility Representations of 3connected 1plane Graphs
An orthopolygon visibility representation Γ of a 1plane graph G (OPVR ...
read it

Turning Cliques into Paths to Achieve Planarity
Motivated by hybrid graph representations, we introduce and study the fo...
read it

Pole Dancing: 3D Morphs for Tree Drawings
We study the question whether a crossingfree 3D morph between two strai...
read it

Polyline Drawings with Topological Constraints
Let G be a simple topological graph and let Γ be a polyline drawing of G...
read it

(k,p)Planarity: A Relaxation of Hybrid Planarity
We present a new model for hybrid planarity that relaxes existing hybrid...
read it

Marginal models with individualspecific effects for the analysis of longitudinal bipartite networks
A new modeling framework for bipartite social networks arising from a se...
read it

Planar Graphs of Bounded Degree have Constant Queue Number
A queue layout of a graph consists of a linear order of its vertices and...
read it

Minimal linear codes in odd characteristic
In this paper we generalize constructions in two recent works of Ding, H...
read it

Krylov Iterative Methods for the Geometric Mean of Two Matrices Times a Vector
In this work, we are presenting an efficient way to compute the geometri...
read it

Planar Polynomials arising from Linearized polynomials
In this paper we construct planar polynomials of the type f_A,B(x)=x(x^q...
read it

Graph Planarity Testing with Hierarchical Embedding Constraints
Hierarchical embedding constraints define a set of allowed cyclic orders...
read it

Introduction to the 35th International Conference on Logic Programming Special Issue
We are proud to introduce this special issue of Theory and Practice of L...
read it

Technical Report on Implementing RankingBased Semantics in ConArg
ConArg is a suite of tools that offers a wide series of applications for...
read it

ChordLink: A New Hybrid Visualization Model
Many realworld networks are globally sparse but locally dense. Typical ...
read it

Parameterized Algorithms for Book Embedding Problems
A kpage book embedding of a graph G draws the vertices of G on a line a...
read it

Implementing RankingBased Semantics in ConArg: a Preliminary Report
ConArg is a suite of tools that offers a wide series of applications for...
read it

A new family of maximum scattered linear sets in PG(1,q^6)
We generalize the example of linear set presented by the last two author...
read it

Coloring outerplanar graphs and planar 3trees with small monochromatic components
In this work, we continue the study of vertex colorings of graphs, in wh...
read it

On the weight distribution of some minimal codes
Minimal codes are a class of linear codes which gained interest in the l...
read it

Grid Drawings of Graphs with Constant EdgeVertex Resolution
We study the algorithmic problem of computing drawings of graphs in whic...
read it

On integral weight spectra of the MDS codes cosets of weight 1, 2, and 3
The weight of a coset of a code is the smallest Hamming weight of any ve...
read it

Storyline Visualizations with Ubiquitous Actors
Storyline visualizations depict the temporal dynamics of social interact...
read it

On construction and (non)existence of c(almost) perfect nonlinear functions
Functions with low differential uniformity have relevant applications in...
read it
Università Perugia
The Università degli Studi di Perugia is one of the oldest universities in Italy and one of the most accredited, offering a wide variety of courses in all fields of education.