Publications associées à Experiments with the Markoff Surface

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.

Graph Laplacian Mixture Model

Pascal Frossard, Hermina Petric Maretic

Graph learning methods have recently been receiving increasing interest as means to infer structure in datasets. Most of the recent approaches focus on different relationships between a graph and data sample distributions, mostly in settings where all avai ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Implication of the box C/D snoRNP assembly factor Rsa1p in U3 snoRNP assembly

Benjamin Marcel Daniel Rothé

The U3 box C/D snoRNA is one key element of 90S pre-ribosome. It contains a 5' domain pairing with pre-rRNA and the U3(B/C) and U3(C'/D) motifs for U3 packaging into a unique small nucleolar ribonucleoprotein particle (snoRNP). The RNA-binding protein Snu1 ...

Oxford University Press (OUP)2017

System, device, and method for contextual knowledge retrieval and display

Pierre Vandergheynst, Kirell Maël Benzi, Benjamin Ricaud

A method to extract patterns of activity from time series of data structured as a network of objects, the method comprising the steps of creating a base graph of similar or related items from a given corpus by comparing intrinsic features of the items, com ...

2017

Compressive Embedding and Visualization using Graphs

Pierre Vandergheynst, Nathanaël Perraudin, Johann Paratte

Visualizing high-dimensional data has been a focus in data analysis communities for decades, which has led to the design of many algorithms, some of which are now considered references (such as t-SNE for example). In our era of overwhelming data volumes, t ...

arXiv e-print archive2017

Graph learning under sparsity priors

Pascal Frossard, Hermina Petric Maretic

Graph signals offer a very generic and natural representation for data that lives on networks or irregular structures. The actual data structure is however often unknown a priori but can sometimes be estimated from the knowledge of the application domain. ...

Ieee2017

Isogeny graphs of ordinary abelian varieties

Dimitar Petkov Jetchev, Benjamin Pierre Charles Wesolowski, Ernest Hunter Brooks

Fix a prime number l. Graphs of isogenies of degree a power of l are well-understood for elliptic curves, but not for higher-dimensional abelian varieties. We study the case of absolutely simple ordinary abelian varieties over a finite field. We analyse gr ...

Springer Heidelberg2017

Some applications of smooth bilinear forms with Kloosterman sums

Philippe Michel

We revisit a recent bound of I. Shparlinski and T. Zhang on bilinear forms with Kloosterman sums, and prove an extension for correlation sums of Kloosterman sums against Fourier coefficients of modular forms. We use these bounds to improve on earlier resul ...

Maik Nauka/Interperiodica/Springer2017

Conditional expanding bounds for two-variable functions over finite valuation rings

Van Thang Pham

In this paper, we use methods from spectral graph theory to obtain some results on the sum-product problem over finite valuation rings R of order q(r) which generalize recent results given by Hegyvari and Hennecart (2013). More precisely, we prove that, fo ...

Academic Press Ltd- Elsevier Science Ltd2017

SAS-6 engineering reveals interdependence between cartwheel and microtubules in determining centriole architecture

Paul Guichard, Virginie Hamel

Centrioles are critical for the formation of centrosomes, cilia and flagella in eukaryotes. They are thought to assemble around a nine-fold symmetric cartwheel structure established by SAS-6 proteins. Here, we have engineered Chlamydomonas reinhardtii SAS- ...

Nature Publishing Group2016

Experiments with the Markoff Surface

Graph Chatbot

Chattez avec Graph Search

Graph Laplacian Mixture Model

Incidences Between Planes Over Finite Fields

Implication of the box C/D snoRNP assembly factor Rsa1p in U3 snoRNP assembly

System, device, and method for contextual knowledge retrieval and display

Compressive Embedding and Visualization using Graphs

Graph learning under sparsity priors

Isogeny graphs of ordinary abelian varieties

Some applications of smooth bilinear forms with Kloosterman sums

Conditional expanding bounds for two-variable functions over finite valuation rings

SAS-6 engineering reveals interdependence between cartwheel and microtubules in determining centriole architecture

Compressive Embedding and Visualization using Graphs

System, device, and method for contextual knowledge retrieval and display

Some applications of smooth bilinear forms with Kloosterman sums

Graph learning under sparsity priors

SAS-6 engineering reveals interdependence between cartwheel and microtubules in determining centriole architecture

Conditional expanding bounds for two-variable functions over finite valuation rings

Incidences Between Planes Over Finite Fields

Graph Laplacian Mixture Model

Isogeny graphs of ordinary abelian varieties

Implication of the box C/D snoRNP assembly factor Rsa1p in U3 snoRNP assembly