Concept

L (complexity)

Related publications (131)

The robust single machine scheduling problem with uncertain release and processing times

In this work, we study the single machine scheduling problem with uncertain release times and processing times of jobs. We adopt a robust scheduling approach, in which the measure of robustness to be minimized for a given sequence of jobs is the worst-case ...

2013

Foil-to-foil lamination and electrical interconnection of printed components on flexible substrates

Nico de Rooij, Danick Briand, Andres Felipe Vasquez Quintero

This paper describes and compares two integration methods to structurally laminate and interconnect foil-based components with flexible polymeric substrates. The first method uses isotropic conductive adhesives (ICA) confined in laser-ablated through foil ...

Elsevier2013

A Simple Reflectarray Cell with 1-bit Phase Control and Polarization Flexibility

Julien Perruisseau-Carrier, Tomislav Debogovic

In this work we present a simple reconfigurable reflectarray (RRA) unit cell general topology and implementation, which allows the independent control of the phase and polarization of the reflected electromagnetic wave. The 1-bit phase control (with 180 de ...

Ieee2013

Towards reconfigurable RF devices based on dielectric elastomer actuators

Herbert Shea, Julien Perruisseau-Carrier, Samuel Rosset, Pietro Romano, Oluwaseun Adelowo Araromi

Radio Frequency (RF) devices generate or control the transmission or reception of electromagnetic (EM) waves such as are used in mobile phones, WIFI etc. Microwave (MW) and millimeter‐wave (MMW) devices are used widely in satellite communications. Dynamic ...

2013

Completeness and Ambiguity of Schema Cover

Karl Aberer, Quoc Viet Hung Nguyen, Zoltán Miklós

Given a schema and a set of concepts, representative of entities in the domain of discourse, schema cover deﬁnes correspondences between concepts and parts of the schema. Schema cover aims at interpreting the schema in terms of concepts and thus, vastly si ...

2013

Low Complexity Image Recognition Algorithms for Handheld devices

Pradyumna Ayyalasomayajula

Content Based Image Retrieval (CBIR) has gained a lot of interest over the last two decades. The need to search and retrieve images from databases, based on information (“features”) extracted from the image itself, is becoming increasingly important. CBIR ...

EPFL2013

Distributed average consensus with quantization refinement

Pascal Frossard, Ye Pu, Effrosyni Kokiopoulou

We consider the problem of distributed average consensus in a sensor network where sensors exchange quantized information with their neighbors. We propose a novel quantization scheme that exploits the increasing correlation between the values exchanged by ...

Institute of Electrical and Electronics Engineers2013

Abstractions for Solving Consensus and Related Problems with Byzantine Faults

Zarko Milosevic

We become increasingly dependent on online services; therefore, their availability and correct behavior become increasingly important. Software replication is a popular technique for ensuring that computer systems continue to provide a correct service even ...

EPFL2013

Fast Byzantine Agreement

Rachid Guerraoui, Florian Huc

This paper presents the first probabilistic Byzantine Agreement algorithm whose communication and time complexities are poly-logarithmic. So far, the most effective probabilistic Byzantine Agreement algorithm had communication complexity and time complexit ...

2013

Vibration energy harvester on plastic foil based on transferring PZT thick sheets with dry film photoresist

Nico de Rooij, Danick Briand, Jinyu Jason Ruan, Andres Felipe Vasquez Quintero, Pattanaphong Janphuang, Robert Andrew Lockhart

This paper presents a low-complexity and low temperature (85°C) fabrication process for vibration energy harvesters. The process employs lamination steps to transfer thinned PZT thick sheets onto flexible polymeric substrates, using dry film photoresist. T ...

2012

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.