When Is Amplification Necessary for Composition in Randomized Query Complexity?

Related publications (30)

About
Privacy
Disclaimer

Graph Chatbot

Distributionally Robust Optimization with Markovian Data

We study a stochastic program where the probability distribution of the uncertain problem parameters is unknown and only indirectly observed via finitely many correlated samples generated by an unknown Markov chain with d states. We propose a data-driven d ...

JMLR-JOURNAL MACHINE LEARNING RESEARCH2021

Metric dimension of critical Galton–Watson trees and linear preferential attachment trees

Gergely Odor

The metric dimension of a graph G is the minimal size of a subset R of vertices of G that, upon reporting their graph distance from a distinguished (source) vertex v⋆, enable unique identification of the source vertex v⋆ among all possible vertices of G. I ...

2021

Cross Modal Focal Loss for RGBD Face Anti-Spoofing

Sébastien Marcel

Automatic methods for detecting presentation attacks are essential to ensure the reliable use of facial recognition technology. Most of the methods available in the litera- ture for presentation attack detection (PAD) fails in gen- eralizing to unseen atta ...

IEEE2021

Analysis of Polycerate Mutants Reveals the Evolutionary Co-option of HOXD1 for Horn Patterning in Bovidae

Denis Duboule, Jozsef Zakany, Aurélie Hintermann

In the course of evolution, pecorans (i.e., higher ruminants) developed a remarkable diversity of osseous cranial appendages, collectively referred to as "headgear," which likely share the same origin and genetic basis. However, the nature and function of ...

OXFORD UNIV PRESS2021

A Spectral Algorithm for 3-valued Function Equivalence Classification

Mathias Soeken

Spectral techniques for Boolean and multiple-valued functions have been well studied and found to be useful in logic design and testing for conventional circuits. Spectral techniques also have potential application for reversible and quantum circuits. This ...

OLD CITY PUBLISHING INC2020

The Cost of Scaling a Reliable Interconnection Topology

Rachid Guerraoui, Alexandre David Olivier Maurer

In distributed computing, many papers try to evaluate the message complexity of a distributed system as a function of the number of nodes n. But what about the cost of building the distributed system itself? Assuming that we want to reliably connect n node ...

2020

Cognitive workload monitoring in virtual reality based rescue missions with drones

David Atienza Alonso, Adriana Arza Valdes, Fabio Isidoro Tiberio Dell'Agnola, Niloofar Momeni

The use of drones in search and rescue (SAR) missions can be very cognitively demanding. Since high levels of cognitive workload can negatively affect human performance, there is a risk of compromising the mission and leading to failure with catastrophic o ...

2020

Multi-armed Bandits in Action

Farnood Salehi

Making decisions is part and parcel of being human. Among a set of actions, we want to choose the one that has the highest reward. But the uncertainty of the outcome prevents us from always making the right decision. Making decisions under uncertainty can ...

EPFL2020

ResOT: Resource-Efficient Oblique Trees for Neural Signal Classification

Mahsa Shoaran, Bingzhao Zhu

Classifiers that can be implemented on chip with minimal computational and memory resources are essential for edge computing in emerging applications such as medical and IoT devices. This paper introduces a machine learning model based on oblique decision ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Investigation of effective processes parameters on lead (II) adsorption from wastewater by biochar in mild air oxidation pyrolysis process

Farzaneh Talebkeikhah, Mohsen Talebkeikhah, Mohammad Torkashvand

This study evaluates and compares several machine learning methods on the effects of different parameters in lead adsorption capacity. pH, contact time, adsorbent dosage and initial lead concentration were considered as inputs and adsorption capacity was r ...

TAYLOR & FRANCIS LTD2022