Publication

Privacy Preserving and Cost Optimal Mobile Crowdsensing using Smart Contracts on Blockchain

Publications associées (40)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

, ,

Generative language models (LMs) have become omnipresent across data science. For a wide variety of tasks, inputs can be phrased as natural language prompts for an LM, from whose output the solution can then be extracted. LM performance has consistently be ...

Assoc Computing Machinery2024

Efficient Online Clustering with Moving Costs

Volkan Cevher, Efstratios Panteleimon Skoulakis

In this work we consider an online learning problem, called Online k-Clustering with Moving Costs, at which a learner maintains a set of k facilities over T rounds so as to minimize the connection cost of an adversarially selected sequence of clients. The ...

2023

Deplatforming did not decrease Parler users' activity on fringe social media

Robert West, Manoel Horta Ribeiro

Online platforms have banned ("deplatformed") influencers, communities, and even entire websites to reduce content deemed harmful. Deplatformed users often migrate to alternative platforms, which raises concerns about the effectiveness of deplatforming. He ...

OXFORD UNIV PRESS2023

Years of globalization, outsourcing and cost cutting have increased supply chain vulnerability calling for more effective risk mitigation strategies. In our research, we analyze supply chain disruptions in a production setting. Using a bilevel optimization ...

SPRINGER HEIDELBERG2022

Optimal Matching of Random Parts

Thomas Alois Weber

This paper examines the minimization of the cost for an expected random production output, given an assembly of finished goods from two random inputs, matched in two categories. We describe the optimal input portfolio, first using the standard normal appro ...

2022

Cost and benefit allocation in a energy community

In the transition to a sustainable energy system, energy communities have unique advantages; they require no additional land and allow inhabitants to reduce their energy bills. Nowadays, each shareholder’s profit is calculated based on their share of inves ...

2021

In the GW approximation, the screened interaction W is a nonlocal and dynamical potential that usually has a complex frequency dependence. A full description of such a dependence is possible but often computationally demanding. For this reason, it is still ...

AMER PHYSICAL SOC2021

, ,

Advances in mobile computing have paved the way for new types of distributed applications that can be executed solely by mobile devices on device-to-device (D2D) ecosystems (e.g., crowdsensing). More sophisticated applications, like cryptocurrencies, need ...

IEEE2020

This work is concerned with the mechanical design and the description of the different components of a new mobile base for a lightweight mobile manipulator. These kinds of mobile manipulators are normally composed of multiple lightweight links mounted on a ...

MDPI2018

Coordinate Descent with Bandit Sampling

Patrick Thiran, Laura Elisa Celis, Farnood Salehi

Coordinate descent methods usually minimize a cost function by updating a random decision variable (corresponding to one coordinate) at a time. Ideally, we would update the decision variable that yields the largest decrease in the cost function. However, f ...

NEURAL INFORMATION PROCESSING SYSTEMS (NIPS)2018