Publications associées à Integration of an IEEE Std. C37.118 compliant PMU into a real-time simulator

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.

Neutralité et engagement. Les relations entre le Comité international de la Croix-Rouge et le gouvernement suisse pendant la Seconde Guerre mondiale

Isabelle Barbara Marie-Hélène Cardia

Since its creation in 1863, the ICRC has maintained a special relationship with Switzerland and its government, based on the pursuit of neutrality and on the perception of a common destiny. Such a perception and the adherence to shared political values wer ...

Société d'histoire de la Suisse romande2012

Generating Fast Indulgent Algorithms

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Synchronous distributed algorithms are easier to design and prove correct than algorithms that tolerate asynchrony. Yet, in the real world, networks experience asynchrony and other timing anomalies. In this paper, we address the question of how to efficien ...

Springer Verlag2012

On the Construction of Polar Codes

Emre Telatar, Seyed Hamed Hassani, Ramtin Pedarsani

We consider the problem of efficiently constructing polar codes over binary memoryless symmetric (BMS) channels. The complexity of designing polar codes via an exact evaluation of the polarized channels to find which ones are "good" appears to be exponenti ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Generating Fast Indulgent Algorithms

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2011

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

Fast Randomized Test-and-Set and Renaming

Rachid Guerraoui, Seth Gilbert, Dan Alistarh, Hagit Albo Attiya, Andrei Giurgiu

Most people believe that renaming is easy: simply choose a name \emph{at random}; if more than one process selects the same name, then try again. We highlight the issues that occur when trying to implement such a scheme and shed new light on the read-write ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

On the benefits of vector network coding

Christina Fragouli, Javad Ebrahimi Boroojeni

In vector network coding, the source multi- casts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying them with L × L coding matrices that play a similar role as coding coeffic ...

2010

Reducing Memory Requirements for Combinatorial Attacks on NTRU via Multiple Birthdays

In this paper we view the possibilities to lance a multiple (iterative) birthday attack on NTRU. Recently Wagner's algorithm for the generalized birthday problem [9] allowed to speed-up several combinatorial attacks. However, in the case of NTRU we can not ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2009

Integration of an IEEE Std. C37.118 compliant PMU into a real-time simulator

Graph Chatbot

Chattez avec Graph Search

Neutralité et engagement. Les relations entre le Comité international de la Croix-Rouge et le gouvernement suisse pendant la Seconde Guerre mondiale

Generating Fast Indulgent Algorithms

On the Construction of Polar Codes

Generating Fast Indulgent Algorithms

Repeater Insertion Techniques for 3D Interconnects

Fast Randomized Test-and-Set and Renaming

On the benefits of vector network coding

Algorithm/Architecture Co-Exploration of Visual Computing: Overview and Future Perspectives

ProtoFlex: Towards Scalable, Full-System Multiprocessor Simulations Using FPGAs

Reducing Memory Requirements for Combinatorial Attacks on NTRU via Multiple Birthdays

Neutralité et engagement. Les relations entre le Comité international de la Croix-Rouge et le gouvernement suisse pendant la Seconde Guerre mondiale

Generating Fast Indulgent Algorithms

On the Construction of Polar Codes

Repeater Insertion Techniques for 3D Interconnects

Generating Fast Indulgent Algorithms

Fast Randomized Test-and-Set and Renaming

Algorithm/Architecture Co-Exploration of Visual Computing: Overview and Future Perspectives

ProtoFlex: Towards Scalable, Full-System Multiprocessor Simulations Using FPGAs

On the benefits of vector network coding

Reducing Memory Requirements for Combinatorial Attacks on NTRU via Multiple Birthdays