Function composition

Formal sciences
Mathematics
Algebra
Abstract algebra

About
Privacy
Disclaimer

Graph Chatbot

Related publications (27)

Technical Note: Development of chemoinformatic tools to enumerate functional groups in molecules for organic aerosol characterization

Satoshi Takahama, Giulia Ruggeri

Functional groups (FGs) can be used as a reduced representation of organic aerosol composition in both ambient and controlled chamber studies, as they retain a certain chemical specificity. Furthermore, FG composition has been informative for source apport ...

Copernicus GmbH2016

Specialising Parsers for Queries

Manohar Jonnalagedda

Many software systems consist of data processing components that analyse large datasets to gather information and learn from these. Often, only part of the data is relevant for analysis. Data processing systems contain an initial preprocessing step that fi ...

EPFL2016

Sur quelques foncteurs de bi-ensembles

Rosalie Françoise Chevalley

This thesis is in the context of representation theory of finite groups. More specifically, it studies biset functors. In this thesis, I focus on two biset functors: the Burnside functor and the functor of p-permutation modules. For the Burnside functor we ...

EPFL2015

Restricting representations of classical algebraic groups to maximal subgroups

Mikaël Cavallin

Fix an algebraically closed field

K

having characteristic

p\geq 0

and let

Y

be a simple algebraic group of classical type over

K.

Also let

X

be maximal among closed connected subgroups of

Y

and consider a non-trivial

p

-restricted irreducible ...

EPFL2015

Effect Analysis for Programs with Callbacks

Viktor Kuncak, Etienne Kneuss, Philippe Paul Henri Suter

We introduce a precise interprocedural effect analysis for programs with mutable state, dynamic object allocation, and dynamic dispatch. Our analysis is precise even in the presence of dynamic dispatch where the context-insensitive estimate on the number o ...

Springer Berlin Heidelberg2013

The functor of p-permutation modules for abelian groups

Mélanie Baumann

Let k be a field of characteristic p, where p is a prime number, let pp_k(G) be the Grothendieck group of p-permutation kG-modules, where G is a finite group, and let Cpp_k(G) be pp_k(G) tensored with the field of complex numbers C. In this article, we fin ...

Elsevier2013

A proximal Newton framework for composite minimization: Graph learning without Cholesky decompositions and matrix inversions

Volkan Cevher, Quoc Tran Dinh, Anastasios Kyrillidis

We propose an algorithmic framework for convex minimization problems of a composite function with two terms: a self-concordant function and a possibly nonsmooth regularization term. Our method is a new proximal Newton algorithm that features a local quadra ...

2013

Page 2 of 2