A Low-Power Correlator for Wakeup Receivers with Algorithm Pruning through Early Termination

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (32)

Computation Of A 30750-Bit Binary Field Discrete Logarithm

Arjen Lenstra, Thorsten Kleinjung, Benjamin Pierre Charles Wesolowski, Robert Granger

This paper reports on the computation of a discrete logarithm in the finite field F-230750, breaking by a large margin the previous record, which was set in January 2014 by a computation in F-29234. The present computation made essential use of the elimina ...

AMER MATHEMATICAL SOC2021

Knapsack and Subset Sum with Small Items

Adam Teodor Polak, Lars Rohwedder

Knapsack and Subset Sum are fundamental NP-hard problems in combinatorial optimization. Recently there has been a growing interest in understanding the best possible pseudopolynomial running times for these problems with respect to various parameters. In t ...

Schloss Dagstuhl -- Leibniz-Zentrum für Informatik2021

Towards Tight Bounds for Spectral Sparsification of Hypergraphs

Mikhail Kapralov, Jakab Tardos

Cut and spectral sparsification of graphs have numerous applications, including e.g. speeding up algorithms for cuts and Laplacian solvers. These powerful notions have recently been extended to hypergraphs, which are much richer and may offer new applicati ...

ASSOC COMPUTING MACHINERY2021

Mathematical and numerical models for the cardiac electromechanical function

Alfio Quarteroni, Francesco Regazzoni

This paper deals with the mathematical model that describes the function of the human heart. More specifically, it addresses the equations that express the electromechanical process, that is the mechanical deformation (contraction and relaxation) of the he ...

EUROPEAN MATHEMATICAL SOC-EMS2021

Increasing Superstructure Optimization Capacity Through Self-Learning Surrogate Models

François Maréchal, Ivan Daniel Kantor, Julia Granacher

Simulation-based optimization models are widely applied to find optimal operating conditions of processes. Often, computational challenges arise from model complexity, making the generation of reliable design solutions difficult. We propose an algorithm fo ...

2021

Scalable and Efficient Comparison-based Search without Features

Matthias Grossglauser, Lucas Maystre, Daniyar Chumbalov

We consider the problem of finding a target object t using pairwise comparisons, by asking an oracle questions of the form “Which object from the pair (i, j) is more similar to t?”. Objects live in a space of latent features, from which the oracle generate ...

JMLR-JOURNAL MACHINE LEARNING RESEARCH2020

On Vacuous and Non-Vacuous Generalization Bounds for Deep Neural Networks

Konstantinos Pitas

Deep neural networks have been empirically successful in a variety of tasks, however their theoretical understanding is still poor. In particular, modern deep neural networks have many more parameters than training data. Thus, in principle they should over ...

EPFL2020

Roundtable Panel Discussion at DAC 2019: Evolutionary Computing or Heuristic Forever?

Massimiliano Di Ventra, Giovanni De Micheli

As demands for computing have been continuously increasing, various solutions have been proposed. Some approaches deal with improving algorithms and software programs, mainly through the tuning of advanced heuristics and learning methods. Some other tackle ...

2020

Fast Transformers with Clustered Attention

François Fleuret, Angelos Katharopoulos, Apoorv Vyas

Transformers have been proven a successful model for a variety of tasks in sequence modeling. However, computing the attention matrix, which is their key component, has quadratic complexity with respect to the sequence length, thus making them prohibitivel ...

2020

Walkman: A Communication-Efficient Random-Walk Algorithm for Decentralized Optimization

Ali H. Sayed, Kun Yuan

This paper introduces a new algorithm for consensus optimization in a multi-agent network, where all agents collaboratively find a minimizer for the sum of their private functions. All decentralized algorithms rely on communications between adjacent nodes. ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Distributed Routing and Charging Scheduling Optimization for Internet of Electric Vehicles

Xiaoying Tang

In this paper, we consider an Internet of Electric Vehicles (IoEV) powered by heterogeneous charging facilities in the transportation network. In particular, we take into account the state-of-the-art vehicle-to-grid (V2G) charging and renewable power gener ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

A new analysis approach for T-2 relaxometry myelin water quantification: Orthogonal Matching Pursuit

Guillaume Jean Op 't Veld

Purpose: In vivo myelin quantification can provide valuable noninvasive information on neuronal maturation and development, as well as insights into neurological disorders. Multiexponential analysis of multiecho T-2 relaxation is a powerful and widely appl ...

Wiley2019

Page 2 sur 2