Publications associées à Multi-Objective Quality-Driven Service Selection-A Fully Polynomial Time Approximation Scheme

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.

DESIA: A General Framework for Designing Interlocking Assemblies

Mark Pauly, Peng Song

Interlocking assemblies have a long history in the design of puzzles, furniture, architecture, and other complex geometric structures. The key defining property of interlocking assemblies is that all component parts are immobilized by their geometric arran ...

ASSOC COMPUTING MACHINERY2018

DESIA: A General Framework for Designing Interlocking Assemblies

Mark Pauly, Peng Song

ASSOC COMPUTING MACHINERY2018

Coordinate-Descent Diffusion Learning by Networked Agents

Ali H. Sayed, Bicheng Ying, Chengcheng Wang

This paper examines the mean-square error performance of diffusion stochastic algorithms under a generalized coordinate-descent scheme. In this setting, the adaptation step by each agent is limited to a random subset of the coordinates of its stochastic gr ...

Ieee-Inst Electrical Electronics Engineers Inc2018

Using Structural Properties for Integer Programs

Kim-Manuel Klein

Integer programs (IPs) are one of the fundamental tools used to solve combinatorial problems in theory and practice. Understanding the structure of solutions of IPs is thus helpful to argue about the existence of solutions with a certain simple structure, ...

SPRINGER INTERNATIONAL PUBLISHING AG2018

Indiscreet logarithms in finite fields of small characteristic

Robert Granger, Thorsten Kleinjung, Jens Markus Zumbrägel

Recently, several striking advances have taken place regarding the discrete logarithm problem (DLP) in finite fields of small characteristic, despite progress having remained essentially static for nearly thirty years, with the best known algorithms being ...

2018

An Any-Resolution Distributed Pressure Localization Scheme Using a Capacitive Soft Sensor Skin

Jamie Paik, Harshal Arun Sonar, Michelle Ching-Sum Yuen

We present a method to determine the location of an applied pressure on a large area, monolithic silicone based capacitive sensor. In contrast to pressure sensor arrays composed of n x n discrete sensors, we utilize a single sensor body with a single instr ...

2018

SAT-Based Area Recovery in Structural Technology Mapping

Bruno Schmitt Antunes

This paper proposes a fast SAT-based algorithm for recovering area applicable to an already technology mapped circuit. The algorithm considers a sequence of relatively small overlapping regions, called windows, in a mapped network and tries to improve the ...

ASSOC COMPUTING MACHINERY2018

Recompression Of Hadamard Products Of Tensors In Tucker Format

Daniel Kressner, Lana Perisa

The Hadamard product features prominently in tensor-based algorithms in scientific computing and data analysis. Due to its tendency to significantly increase ranks, the Hadamard product can represent a major computational obstacle in algorithms based on lo ...

Siam Publications2017

Coordinate-descent adaptation over networks

Ali H. Sayed, Bicheng Ying, Chengcheng Wang

This work examines the mean-square error performance of diffusion stochastic algorithms under a generalized coordinate-descent scheme. In this setting, the adaptation step by each agent is limited to a random subset of the coordinates of its stochastic gra ...

2017

Multi-Objective Quality-Driven Service Selection-A Fully Polynomial Time Approximation Scheme

Graph Chatbot

Chattez avec Graph Search

DESIA: A General Framework for Designing Interlocking Assemblies

DESIA: A General Framework for Designing Interlocking Assemblies

Coordinate-Descent Diffusion Learning by Networked Agents

Using Structural Properties for Integer Programs

Indiscreet logarithms in finite fields of small characteristic

An Any-Resolution Distributed Pressure Localization Scheme Using a Capacitive Soft Sensor Skin

SAT-Based Area Recovery in Structural Technology Mapping

LPN in Cryptography

Recompression Of Hadamard Products Of Tensors In Tucker Format

Coordinate-descent adaptation over networks

Indiscreet logarithms in finite fields of small characteristic

SAT-Based Area Recovery in Structural Technology Mapping

LPN in Cryptography

DESIA: A General Framework for Designing Interlocking Assemblies

Recompression Of Hadamard Products Of Tensors In Tucker Format

Using Structural Properties for Integer Programs

Coordinate-descent adaptation over networks

DESIA: A General Framework for Designing Interlocking Assemblies

Coordinate-Descent Diffusion Learning by Networked Agents

An Any-Resolution Distributed Pressure Localization Scheme Using a Capacitive Soft Sensor Skin