Publication

A Complexity Analysis Approach for Model-based System Engineering

Related publications (56)

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.

Aligning Supply Chain and Product Portfolios

Ralf Seifert, Jean-Sébastien Tancrez, Kerstin Langenberg

In recent years, it has become widely accepted that optimal supply chain design depends on the type of product the chain is catering to. Moreover, as opposed to carrying one product type only, firms deliver a variety of both functional and innovative produ ...

Elsevier2012

Fast Speaker Verification on Mobile Phone data using Boosted Slice Classifiers

Sébastien Marcel, Anindya Roy

In this work, we investigate a novel computationally efficient speaker verification (SV) system involving boosted ensembles of simple threshold-based classifiers. The system is based on a novel set of features called “slice features”. Both the system and t ...

2011

Geometric skeleton computation enabling concurrent product engineering and assembly sequence planning

This paper introduces a novel modelling approach to geometric skeleton computation enabling concurrent product engineering and assembly sequence planning. Current engineering vision has recently moved towards new modelling and management paradigms to maint ...

2011

Determining Control Strategies for Damage Tolerance of an Active Tensegrity Structure

Ian Smith, Nizar Bel Hadj Ali, Sinan Korkmaz

Tensegrity structures are spatial, reticulate and lightweight systems composed of struts and cables. Stability is provided by a self-stress state between tensioned and compressed elements. Tensegrities have received interest among scientists and engineers ...

Elsevier2011

Repeater Insertion Techniques for 3D Interconnects

Giovanni De Micheli, Vasileios Pavlidis

A new approach for inserting repeaters in 3-D interconnects is proposed. The allocation of repeaters along an interplane interconnect is iteratively determined. The proposed approach is compared with two other techniques based on conventional methods used ...

2010

Constructing Convex Planes In The Pants Complex

Hugo Parlier

Our main theorem identifies a class of totally geodesic subgraphs of the 1-skeleton of the pants complex, referred to as the pants graph, each isomorphic to the product of two Farey graphs. We deduce the existence of many convex planes in the pants graph o ...

2009

The Complexity of Obstruction-Free Implementations

Rachid Guerraoui, Hagit Albo Attiya

Obstruction-free implementations of concurrent ob jects are optimized for the common case where there is no step contention, and were recently advocated as a solution to the costs associated with synchronization without locks. In this paper, we study this ...

2009

The performance impact of intra-firm organizational design on an alliance's NPD projects

Christopher Tucci, Yuosre Badir

This research contributes to the intra-organization, inter-organization, and new product development (NPD) management literature by studying the impact of a firm's internal organizational design on the communication within and performance of NPD projects c ...

Elsevier2009

The Complexity of Distinguishing Distributions

Serge Vaudenay, Thomas Baignères

Cryptography often meets the problem of distinguishing distributions. In this paper we review techniques from hypothesis testing to express the advantage of the best distinguisher limited to a given number of samples. We link it with the Chernoff informati ...

Springer2008

Improved Related-Key Attacks on DESX and DESX+

In this paper, we present improved related-key attacks on the original DESX, and DESX+, a variant of the DESX with its pre- and post-whitening XOR operations replaced with addition modulo

2^{64}

. Compared to previous results, our attack on DESX has reduc ...

2008

Improved Related-Key Attacks on DESX and DESX+

In this paper, we present improved related-key attacks on the original DESX, and DESX+, a variant of the DESX with its pre- and post-whitening XOR operations replaced with addition modulo

2^{64}

. Compared to previous results, our attack on DESX has reduc ...

2008