Concept

Discriminant

Related publications (35)

A simulation-based optimization framework for urban transportation problems

Michel Bierlaire, Carolina Osorio Pizano

This paper proposes a simulation-based optimization (SO) method that enables the efficient use of complex stochastic urban traffic simulators to address various transportation problems. It presents a metamodel that integrates information from a simulator w ...

Informs2013

Hessian Schatten-Norm Regularization for Linear Inverse Problems

Michaël Unser, John Paul Ward, Stamatios Lefkimmiatis

We introduce a novel family of invariant, convex, and non-quadratic functionals that we employ to derive regularized solutions of ill-posed linear inverse imaging problems. The proposed regularizers involve the Schatten norms of the Hessian matrix, which a ...

Ieee-Inst Electrical Electronics Engineers Inc2013

Classifying minimally disabled multiple sclerosis patients from resting state functional connectivity

Dimitri Nestor Alice Van De Ville, Patric Hagmann, Jonas Richiardi

Multiple sclerosis (MS), a variable and diffuse disease affecting white and gray matter, is known to cause functional connectivity anomalies in patients. However, related studies published to-date are post hoc; our hypothesis was that such alterations coul ...

Elsevier2012

On the Brauer group of diagonal quartic surfaces

Evis Ieronymou

We obtain an easy sufficient condition for the Brauer group of a diagonal quartic surface D over Q to be algebraic. We also give an upper bound for the order of the quotient of the Brauer group of D by the image of the Brauer group of Q. The proof is based ...

2011

Equidistribution of Heegner points and ternary quadratic forms

Dimitar Petkov Jetchev

We prove new equidistribution results for Galois orbits of Heegner points with respect to single reduction maps at inert primes. The arguments are based on two different techniques: primitive representations of integers by quadratic forms and distribution ...

Springer Verlag2011

Combining Discriminant and Topographic Information in BCI: Preliminary Results on Stroke Patients

José del Rocio Millán Ruiz, Ricardo Andres Chavarriaga Lozano, Robert Leeb, Andrea Biasiucci, Benjamin Hamner

Non–Invasive Brain–Computer Interfaces (BCI) convey a great potential in the field of stroke rehabilitation, where the continuous monitoring of mental tasks execution could support the positive effects of standard therapies. In this paper we combine time-f ...

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

Grassmann Hashing For Approximate Nearest Neighbor Search In High Dimensional Space

Lei Zhang, Xinchao Wang

Locality-Sensitive Hashing (LSH) approximates nearest neighbors in high dimensions by projecting original data into low-dimensional subspaces. The basic idea is to hash data samples to ensure that the probability of collision is much higher for samples tha ...

Ieee2011

Diagonal Quartic Surfaces And Transcendental Elements Of The Brauer Group

Evis Ieronymou

We exhibit central simple algebras over the function field of a diagonal quartic surface over the complex numbers that represent the 2-torsion part of its Brauer group. We investigate whether the 2-primary part of the Brauer group of a diagonal quartic sur ...

Cambridge University Press2010

Arithmetic Bounds-Lenstra's Constant and Torsion of K-Groups

Julien Houriet

This thesis is concerned with computations of bounds for two different arithmetic invariants. In both cases it is done with the intention of proving some algebraic or arithmetic properties for number fields. The first part is devoted to computations of low ...

EPFL2010

Singularities of generic characteristic polynomials and smooth finite splittings of Azumaya algebras over surfaces

Manuel Ojanguren

Let k be an algebraically closed field. Let P(X-11,...,X-nn, T) be the characteristic polynomial of the generic matrix (X-ij) over k. We determine its singular locus as well as the singular locus of its Galois splitting. If X is a smooth quasi-projective s ...

Springer-Verlag2009

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.