GRADUATE SEMINAR Yihui Zhang The Roots and Weyl Groups of Compact Matrix Lie Groups MSc Student supervised by Donald Stanley

Source URL: www.uregina.ca

The Schur algebra is not spectral in B(`2). Romain Tessera∗ July 31, 2009 Abstract We give an example of an infinite matrix whose rows and columns

Source URL: www.normalesup.org

• Algebra
• Mathematics
• Group theory
• Geometric group theory
• Topological groups
• Functional analysis
• Amenable group
• Matrix
• Kazhdan's property
• Cayley graph
• Convolution
• Group cohomology

EMORY COMMODITY MATRIX The Emory Commodity Matrix guides University faculty and staff in determining how to acquire and/or pay for the most commonly ordered equipment, supplies and services. Preferred Method : Secondary

Source URL: www.finance.emory.edu

• Economy
• Business
• Payment systems
• Banking
• Credit card
• Cheque
• Subscriber identity module
• Purchasing
• Payment
• Invoice

Explainable Matrix Factorization for Collaborative Filtering Behnoush Abdollahi Olfa Nasraoui Knowledge Discovery & Web Mining Lab

Source URL: gdac.uqam.ca

• Recommender systems
• Information science
• Collective intelligence
• Information retrieval
• Humancomputer interaction
• Collaboration
• Information systems
• Matrix factorization
• Collaborative filtering
• GroupLens Research
• Non-negative matrix factorization
• QJ

Symmetric Indefinite Triangular Factorization Revealing the Rank Profile Matrix Jean-Guillaume Dumas, Cl´ement Pernet Universit´ e Grenoble Alpes, Laboratoire Jean Kuntzmann, UMR CNRS

Source URL: ljk.imag.fr

• Algebra
• Linear algebra
• Mathematics
• Matrices
• Symmetric matrix
• Tridiagonal matrix
• Numerical linear algebra
• Lie groups
• Differential geometry

COSC 544 Probabilistic Proof SystemsAn Optimal Interactive Proof for Matrix Multiplication Lecturer: Justin Thaler

Source URL: people.cs.georgetown.edu

• Mathematics
• Algebra
• Exponentials
• Matrix theory
• IP
• Summation
• Exponentiation

Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits In memory of Wen-tsun Wu–Jean-Guillaume Dumas

Source URL: perso.ens-lyon.fr

Leveraging Router Programmability for Traffic Matrix Computation ⇤ Giacomo Balestra‡

Source URL: www0.cs.ucl.ac.uk

• Computing
• Internet architecture
• Network architecture
• Information and communications technology
• Routing
• Internet Standards
• Computer networking
• Border Gateway Protocol
• Router
• Control plane
• IP routing
• NetFlow

Reachability games and related matrix and word problems Thesis submitted in accordance with the requirements of the University of Liverpool for the degree of Doctor in Philosophy by

Source URL: cgi.csc.liv.ac.uk

• Complexity classes
• Mathematics
• Theoretical computer science
• Discrete mathematics
• EXPTIME
• P
• Reachability problem
• Matrix
• Controllability
• Decidability
• Reachability
• Word problem

Implementation of Mesh Routing for the Matrix Step in Number Field Sieving Factoring

Source URL: www.hyperelliptic.org

• Numerical linear algebra
• Integer factorization algorithms
• General number field sieve
• Matrix
• Sparse matrix
• LU decomposition
• Incomplete Cholesky factorization