output
20192022
most citedMediating Artificial Intelligence Developments through Negative and Positive Incentives

61 citations

9 papers

cs.CV2022

Probabilistic Registration for Gaussian Process 3D shape modelling in the presence of extensive missing data

Filipa Valdeira, Ricardo Ferreira, Alessandra Micheletti +1

We propose a shape fitting/registration method based on a Gaussian Processes formulation, suitable for shapes with extensive regions of missing data. Gaussian Processes are a prove…

cs.LG2022

Ranking with Confidence for Large Scale Comparison Data

Filipa Valdeira, Cláudia Soares

In this work, we leverage a generative data model considering comparison noise to develop a fast, precise, and informative ranking algorithm from pairwise comparisons that produces…

cs.DC2021★ 5 cited

A coordination-free, convergent, and safe replicated tree

Sreeja Nair, Filipe Meirim, Mário Pereira +2

The tree is an essential data structure in many applications. In a distributed application, such as a distributed file system, the tree is replicated.To improve performance and ava…

cs.AI2020★ 61 cited

Mediating Artificial Intelligence Developments through Negative and Positive Incentives

The Anh Han, Luis Moniz Pereira, Tom Lenaerts +1

The field of Artificial Intelligence (AI) is going through a period of great expectations, introducing a certain level of anxiety in research, business and also policy. This anxiet…

cs.CV2020★ 2 cited

From noisy point clouds to complete ear shapes: unsupervised pipeline

Filipa Valdeira, Ricardo Ferreira, Alessandra Micheletti +1

Ears are a particularly difficult region of the human face to model, not only due to the non-rigid deformations existing between shapes but also to the challenges in processing the…

cs.RO2020★ 14 cited

Optimal Algorithm Allocation for Single Robot Cloud Systems

Saeid Alirezazadeh, Luís A. Alexandre

In order for a robot to perform a task, several algorithms need to be executed, sometimes, simultaneously. Algorithms can be run either on the robot itself or, upon request, be per…