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

61 citations

22 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…

cs.CV2019★ 13 cited

GANprintR: Improved Fakes and Evaluation of the State of the Art in Face Manipulation Detection

João C. Neves, Ruben Tolosana, Ruben Vera-Rodriguez +3

The availability of large-scale facial databases, together with the remarkable progresses of deep learning technologies, in particular Generative Adversarial Networks (GANs), have…

cs.SE2019★ 1 cited

SNITCH: Dynamic Dependent Information Flow Analysis for Independent Java Bytecode

Eduardo Geraldo, João Costa Seco

Software testing is the most commonly used technique in the industry to certify the correctness of software systems. This includes security properties like access control and data…

cs.AI2019★ 19 cited

A Syntactic Operator for Forgetting that Satisfies Strong Persistence

Matti Berthold, Ricardo Gonçalves, Matthias Knorr +1

Whereas the operation of forgetting has recently seen a considerable amount of attention in the context of Answer Set Programming (ASP), most of it has focused on theoretical aspec…

cs.IR2018★ 5 cited

Modeling Temporal Evidence from External Collections

Flávio Martins, João Magalhães, Jamie Callan

Newsworthy events are broadcast through multiple mediums and prompt the crowds to produce comments on social media. In this paper, we propose to leverage on this behavioral dynamic…

cs.MM2018

Inferring User Gender from User Generated Visual Content on a Deep Semantic Space

David Semedo, João Magalhães, Flávio Martins

In this paper we address the task of gender classification on picture sharing social media networks such as Instagram and Flickr. We aim to infer the gender of an user given only a…

cs.IR2018★ 6 cited

Ranking News-Quality Multimedia

Gonçalo Marcelino, Ricardo Pinto, João Magalhães

News editors need to find the photos that best illustrate a news piece and fulfill news-media quality standards, while being pressed to also find the most recent photos of live eve…

cs.LO2018

A Simple Functional Presentation and an Inductive Correctness Proof of the Horn Algorithm

António Ravara

We present a recursive formulation of the Horn algorithm for deciding the satisfiability of propositional clauses. The usual presentations in imperative pseudo-code are informal an…

cs.DC2017★ 1 cited

Non-uniform Replication

Gonçalo Cabrita, Nuno Preguiça

Replication is a key technique in the design of efficient and reliable distributed systems. As information grows, it becomes difficult or even impossible to store all information a…

cs.AI2017★ 19 cited

When You Must Forget: beyond strong persistence when forgetting in answer set programming

Ricardo Gonçalves, Matthias Knorr, João Leite +1

Among the myriad of desirable properties discussed in the context of forgetting in Answer Set Programming (ASP), strong persistence naturally captures its essence. Recently, it has…

cs.LO2016★ 23 cited

Reactive Multi-Context Systems: Heterogeneous Reasoning in Dynamic Environments

Gerhard Brewka, Stefan Ellmauthaler, Ricardo Gonçalves +3

Managed multi-context systems (mMCSs) allow for the integration of heterogeneous knowledge sources in a modular and very general way. They were, however, mainly designed for static…

cs.DC2015

Cache-Conscious Run-time Decomposition of Data Parallel Computations

Hervé Paulino, Nuno Delgado

Multi-core architectures feature an intricate hierarchy of cache memories, with multiple levels and sizes. To adequately decompose an application according to the traits of a parti…

cs.DC2015

Eventually Consistent Register Revisited

Marek Zawirski, Carlos Baquero, Annette Bieniusa +2

In order to converge in the presence of concurrent updates, modern eventually consistent replication systems rely on causality information and operation semantics. It is relatively…

cs.DC2015★ 10 cited

Execution of Compound Multi-Kernel OpenCL Computations in Multi-CPU/Multi-GPU Environments

Fábio Soldado, Fernando Alexandre, Hervé Paulino

Current computational systems are heterogeneous by nature, featuring a combination of CPUs and GPUs. As the latter are becoming an established platform for high-performance computi…

cs.PL2015★ 1 cited

Unlocking Blocked Communicating Processes

Adrian Francalanza, Marco Giunti, António Ravara

We study the problem of disentangling locked processes via code refactoring. We identify and characterise a class of processes that is not lock-free; then we formalise an algorithm…

physics.soc-ph2015

Probabilistic Constraint Programming for Parameters Optimisation of Generative Models

Massimiliano Zanin, Marco Correia, Pedro A. C. Sousa +1

Complex networks theory has commonly been used for modelling and understanding the interactions taking place between the elements composing complex systems. More recently, the use…

quant-ph2000★ 29 cited

Quantum secret sharing for general access structures

Adam D. Smith

We explore the conversion of classical secret-sharing schemes to quantum ones, and how this can be used to give efficient QSS schemes for general adversary structures. Our first re…