Concept

Stiefel–Whitney class

Related publications (40)

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.

Conjugation spaces and equivariant Chern classes

Jérôme Scherer

Let eta be a Real bundle, in the sense of Atiyah, over a space X. This is a complex vector bundle together with an involution which is compatible with complex conjugation. We use the fact that BU has a canonical structure of a conjugation space, as defined ...

Belgian Mathematical Soc Triomphe2013

New Techniques For Obtaining Schubert-Type Formulas For Hamiltonian Manifolds

Silvia Sabatini

In [GT], Goldin and Tolman extend some ideas from Schubert calculus to the more general setting of Hamiltonian torus actions on compact symplectic manifolds with isolated fixed points. (See also [Kn99,Kn08].) The main goal of this paper is to build on this ...

Int Press Boston, Inc2013

L (p) error estimates for approximation by Sobolev splines and Wendland functions on a"e (d)

John Paul Ward

It is known that a Green's function-type condition may be used to derive rates for approximation by radial basis functions (RBFs). In this paper, we introduce a method for obtaining rates for approximation by functions which can be convolved with a finite ...

Springer US2013

Limit Behaviour of the Voter Model, Exclusion Process and Regenerative Chains

Samuel Schöpfer

Though the following topics seem unlinked, most of the tools used in this thesis are related to random walks and renewal theory. After introducing the voter model, we consider the parabolic Anderson model with the voter model as catalyst. In GÄRTNER, DEN H ...

EPFL2012

Online Testing of Federated and Heterogeneous Distributed Systems

Dejan Novakovic, Dejan Kostic, Marco Canini, Vojin Jovanovic

DiCE is a system for online testing of federated and heterogeneous distributed systems. We have built a prototype of DiCE and integrated it with a BGP router. DiCE quickly detects three important classes of faults, resulting from configuration mistakes, po ...

2011

Online Testing of Federated and Heterogeneous Distributed Systems

Dejan Novakovic, Dejan Kostic, Marco Canini, Vojin Jovanovic

DiCE is a system for online testing of federated and heterogeneous distributed systems. We have built a prototype of DiCE and integrated it with an open-source BGP router. DiCE quickly detects three important classes of faults, resulting from configuration ...

Association for Computing Machinery2011

A rigid triple of conjugacy classes in G(2)

Martin W. Liebeck, Claude Marion

We produce a rigid triple of classes in the algebraic group G(2) in characteristic 5, and use it to show that the finite groups G(2)(5(n)) are not (2, 5, 5)-generated. ...

De Gruyter2011

Ordered Sets in the Calculus of Data Structures

Viktor Kuncak, Philippe Paul Henri Suter, Ruzica Piskac

Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints with a rich set of operations. A key challenge is to define such classes of ...

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

Segmenting memory colours

Sabine Süsstrunk, Francisco Estrada

Memory colours refer to the colour of specific image classes that have the essential attribute of being perceived in a consistent manner by human observers. In colour correction or rendering tasks, this consistency implies that they have to be faithfully r ...

2008

Toward a Theory of Input Acceptance for Transactional Memories

Vincent Gramoli, Pascal Felber

As opposed to database transactional systems, transactional memory (TM) systems are constrained by real-time while treating their input workload. Nevertheless, there is no clear formalization of how a TM should react regarding to a specific input. While TM ...

2008