BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
matrix
Google matrix

Tag #matrix

627 papers:

CCCC-2020-PizzutiSD #functional #generative #information retrieval #multi #performance
Generating fast sparse matrix vector multiplication from a high level generic functional IR (FP, MS, CD), pp. 85–95.
DLTDLT-2019-AzfarCCJ #bound #linear #set
A Linear Bound on the K-Rendezvous Time for Primitive Sets of NZ Matrices (UA, CC, LC, RMJ), pp. 59–73.
CIKMCIKM-2019-ChenZLYY #approximate #modelling
Synergizing Local and Global Models for Matrix Approximation (CC0, HZ, DL, JY, XY), pp. 2197–2200.
CIKMCIKM-2019-LiuHDO
Convolution-Consistent Collective Matrix Completion (XL, JH, SD, LO), pp. 2209–2212.
CIKMCIKM-2019-PanWWYZZ #network #predict
Matrix Factorization for Spatio-Temporal Neural Networks with Applications to Urban Flow Prediction (ZP, ZW, WW, YY, JZ, YZ), pp. 2683–2691.
ICMLICML-2019-0001PRW #algorithm #performance
Faster Algorithms for Binary Matrix Factorization (RK0, RP, AR, DPW), pp. 3551–3559.
ICMLICML-2019-FrerixB #approximate #effectiveness #orthogonal
Approximating Orthogonal Matrices with Effective Givens Factorization (TF, JB), pp. 1993–2001.
ICMLICML-2019-KasaiJM #adaptation #algorithm #probability
Riemannian adaptive stochastic gradient algorithms on matrix manifolds (HK, PJ, BM), pp. 3262–3271.
ICMLICML-2019-MercadoT0 #clustering #graph
Spectral Clustering of Signed Graphs via Matrix Power Means (PM0, FT, MH0), pp. 4526–4536.
ICMLICML-2019-NayerNV #metric #rank
Phaseless PCA: Low-Rank Matrix Recovery from Column-wise Phaseless Measurements (SN, PN, NV), pp. 4762–4770.
ICMLICML-2019-SotoLF #3d #distributed #multi #polynomial
Dual Entangled Polynomial Code: Three-Dimensional Coding for Distributed Matrix Multiplication (PS, JL, XF), pp. 5937–5945.
ICMLICML-2019-TiomokoCBG #estimation #metric #random #scalability
Random Matrix Improved Covariance Estimation for a Large Class of Metrics (MT, RC, FB, GG), pp. 6254–6263.
ICMLICML-2019-WuDSYHSRK #learning #metric
Learning a Compressed Sensing Measurement Matrix via Gradient Unrolling (SW, AD, SS, FXY, DNHR, DS, AR, SK), pp. 6828–6839.
ICMLICML-2019-YangZXK #effectiveness #estimation #named #robust #towards
ME-Net: Towards Effective Adversarial Robustness with Matrix Estimation (YY, GZ, ZX, DK), pp. 7025–7034.
ICMLICML-2019-ZhangZLWZ #algorithm #orthogonal
Greedy Orthogonal Pivoting Algorithm for Non-Negative Matrix Factorization (KZ, SZ, JL, JW, JZ), pp. 7493–7501.
KDDKDD-2019-HanYZSLZ0K #graph #identification #named #network
GCN-MF: Disease-Gene Association Identification By Graph Convolutional Networks and Matrix Factorization (PH, PY, PZ, SS, YL0, JZ, XG0, PK), pp. 705–713.
KDDKDD-2019-WangYCW00 #graph #modelling #predict
Origin-Destination Matrix Prediction via Graph Convolution: a New Perspective of Passenger Demand Modeling (YW, HY, HC, TW, JX0, KZ0), pp. 1227–1235.
ICSMEICSME-2018-SchlieSS #analysis #matlab #modelling #multi #using
Comparing Multiple MATLAB/Simulink Models Using Static Connectivity Matrix Analysis (AS, SS, IS), pp. 160–171.
MSRMSR-2018-BenkocziGHK08 #approach #design
A design structure matrix approach for measuring co-change-modularity of software products (RB, DRG, SH, MAK), pp. 331–335.
DLTDLT-2018-CatalanoJ #probability #set
The Synchronizing Probability Function for Primitive Sets of Matrices (CC, RMJ), pp. 194–205.
AIIDEAIIDE-2018-SifaYRB #architecture #bottom-up #comparative #evaluation #game studies #online #recommendation
Matrix and Tensor Factorization Based Game Content Recommender Systems: A Bottom-Up Architecture and a Comparative Online Evaluation (RS, RY, RR, CB), pp. 102–108.
CIKMCIKM-2018-GongLZLZK #online #predict
Network-wide Crowd Flow Prediction of Sydney Trains via Customized Online Non-negative Matrix Factorization (YG, ZL, JZ0, WL0, YZ, CK), pp. 1243–1252.
CIKMCIKM-2018-KwonKC #rank #self
Improving Low-Rank Matrix Completion with Self-Expressiveness (MK, HGK, HJC), pp. 1651–1654.
CIKMCIKM-2018-LeeOFKY #memory management
Disk-based Matrix Completion for Memory Limited Devices (DL, JO, CF, BK, HY), pp. 1093–1102.
CIKMCIKM-2018-TranLL0 #recommendation
Regularizing Matrix Factorization with User and Item Embeddings for Recommendation (TT, KL, YL, DL0), pp. 687–696.
CIKMCIKM-2018-YeCZ #community #detection
Deep Autoencoder-like Nonnegative Matrix Factorization for Community Detection (FY, CC, ZZ), pp. 1393–1402.
ECIRECIR-2018-Zhang0LZ #analysis #representation #sentiment #twitter #using
Unsupervised Sentiment Analysis of Twitter Posts Using Density Matrix Representation (YZ, DS0, XL, PZ0), pp. 316–329.
ICMLICML-2018-0002TT #revisited
Differentially Private Matrix Completion Revisited (PJ0, ODT, AT), pp. 2220–2229.
ICMLICML-2018-BravermanCKLWY #data type #multi #performance
Matrix Norms in Data Streams: Faster, Multi-Pass and Row-Order (VB, SRC, RK, YL0, DPW, LFY), pp. 648–657.
ICMLICML-2018-ChenXW0G #estimation #optimisation #precise
Covariate Adjusted Precision Matrix Estimation via Nonconvex Optimization (JC, PX0, LW, JM0, QG), pp. 921–930.
ICMLICML-2018-DouikH #clustering #graph #optimisation #probability #rank
Low-Rank Riemannian Optimization on Positive Semidefinite Stochastic Matrices with Applications to Graph Clustering (AD, BH), pp. 1298–1307.
ICMLICML-2018-FilstroffLF
Closed-form Marginal Likelihood in Gamma-Poisson Matrix Factorization (LF, AL, CF), pp. 1505–1513.
ICMLICML-2018-GanianKOS #algorithm #problem
Parameterized Algorithms for the Matrix Completion Problem (RG, IAK, SO, SS), pp. 1642–1651.
ICMLICML-2018-Huang #sketching
Near Optimal Frequent Directions for Sketching Dense and Sparse Matrices (ZH), pp. 2053–2062.
ICMLICML-2018-JawanpuriaM #framework #learning #rank
A Unified Framework for Structured Low-rank Matrix Learning (PJ, BM), pp. 2259–2268.
ICMLICML-2018-LiaoC18a #approach #learning #random
The Dynamics of Learning: A Random Matrix Approach (ZL, RC), pp. 3078–3087.
ICMLICML-2018-MaOSS
Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced Aggregation of Sparsely Interacting Workers (YM, AO, CS, VS), pp. 3341–3350.
ICMLICML-2018-MaWCC #estimation #retrieval #statistics
Implicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval and Matrix Completion (CM, KW, YC, YC0), pp. 3351–3360.
ICMLICML-2018-MullerMI #kernel
Kernelized Synaptic Weight Matrices (LKM, JNPM, GI), pp. 3651–3660.
ICMLICML-2018-Sinha #clustering #random #using
K-means clustering using random matrix sparsification (KS), pp. 4691–4699.
ICMLICML-2018-SunYDB #network
Convolutional Imputation of Matrix Networks (QS, MY, DLD, SPB), pp. 4825–4834.
ICMLICML-2018-WangLS #multi
Coded Sparse Matrix Multiplication (SW, JL, NBS), pp. 5139–5147.
ICMLICML-2018-ZhangDG #induction #multi #performance
Fast and Sample Efficient Inductive Matrix Completion via Multi-Phase Procrustes Flow (XZ, SSD, QG), pp. 5751–5760.
ICMLICML-2018-ZhangFS #estimation #scalability
Large-Scale Sparse Inverse Covariance Estimation via Thresholding and Max-Det Matrix Completion (RYZ, SF, SS), pp. 5761–5770.
ICMLICML-2018-ZhangWYG #analysis #rank
A Primal-Dual Analysis of Global Optimality in Nonconvex Low-Rank Matrix Recovery (XZ, LW, YY, QG), pp. 5857–5866.
ICPRICPR-2018-GuoD #3d #distance #estimation
Occluded Joints Recovery in 3D Human Pose Estimation based on Distance Matrix (XG, YD), pp. 1325–1330.
ICPRICPR-2018-PanNZ #optimisation #orthogonal
Structured Convex Optimization Method for Orthogonal Nonnegative Matrix Factorization (JP, MKN, XZ), pp. 459–464.
ICPRICPR-2018-ZhangZLYZW #adaptation #composition #robust
Robust Adaptive Label Propagation by Double Matrix Decomposition (HZ, ZZ0, SL0, QY, MZ, MW0), pp. 2160–2165.
KDDKDD-2018-HuangXXSNC
Active Feature Acquisition with Supervised Matrix Completion (SJH, MX, MKX, MS, GN, SC), pp. 1571–1579.
KDDKDD-2018-ZhangWLTYY #learning #self
Discrete Ranking-based Matrix Factorization with Self-Paced Learning (YZ0, HW, DL, IWT, HY, GY), pp. 2758–2767.
CASECASE-2018-LuoZ #recommendation
Unconstrained Non-negative Factorization of High-dimensional and Sparse Matrices in Recommender Systems (XL0, MZ), pp. 1406–1413.
CGOCGO-2018-BarthelsCB #algorithm
The generalized matrix chain algorithm (HB, MC, PB), pp. 138–148.
ESOPESOP-2018-OstermannJ #algebra #data type
Dualizing Generalized Algebraic Data Types by Matrix Transposition (KO, JJ), pp. 60–85.
CIKMCIKM-2017-OsickaT #composition #concept
Boolean Matrix Decomposition by Formal Concept Sampling (PO, MT), pp. 2243–2246.
CIKMCIKM-2017-WangCHLSY #predict
Coupled Sparse Matrix Factorization for Response Time Prediction in Logistics Services (YW, JC, LH0, WL, LS, PSY), pp. 939–947.
CIKMCIKM-2017-Yang17a #predict
Bayesian Heteroscedastic Matrix Factorization for Conversion Rate Prediction (HY), pp. 2407–2410.
CIKMCIKM-2017-YuCY #algebra #finite #rank #recommendation
Low-Rank Matrix Completion over Finite Abelian Group Algebras for Context-Aware Recommendation (CAY, TSC, YHY), pp. 2415–2418.
ECIRECIR-2017-ManotumruksaMO #network #predict #rating #social #word
Matrix Factorisation with Word Embeddings for Rating Prediction on Location-Based Social Networks (JM, CM, IO), pp. 647–654.
ICMLICML-2017-Allen-ZhuL17a #approximate #component #performance
Faster Principal Component Regression and Stable Matrix Chebyshev Approximation (ZAZ, YL), pp. 107–115.
ICMLICML-2017-ChenLK #estimation #performance #towards
Toward Efficient and Accurate Covariance Matrix Estimation on Compressed Data (XC, MRL, IK), pp. 767–776.
ICMLICML-2017-CherapanamjeriG #robust
Nearly Optimal Robust Matrix Completion (YC, KG, PJ0), pp. 797–805.
ICMLICML-2017-LiL #correlation
Provable Alternating Gradient Descent for Non-negative Matrix Factorization with Strong Correlations (YL, YL), pp. 2062–2070.
ICMLICML-2017-Loukas #how #question
How Close Are the Eigenvectors of the Sample and Actual Covariance Matrices? (AL), pp. 2228–2237.
ICMLICML-2017-MaoSC #on the #symmetry
On Mixed Memberships and Symmetric Nonnegative Matrix Factorizations (XM0, PS, DC), pp. 2324–2333.
ICMLICML-2017-MeiCGH
Nonnegative Matrix Factorization for Time Series Recovery From a Few Temporal Aggregates (JM, YdC, YG, GH), pp. 2382–2390.
ICMLICML-2017-OngieWNB #algebra #modelling #rank
Algebraic Variety Models for High-Rank Matrix Completion (GO, RW, RDN, LB), pp. 2691–2700.
ICMLICML-2017-PenningtonB #geometry #network #random
Geometry of Neural Network Loss Surfaces via Random Matrix Theory (JP, YB), pp. 2798–2806.
ICMLICML-2017-RukatHTY
Bayesian Boolean Matrix Factorisation (TR, CCH, MKT, CY), pp. 2969–2978.
ICMLICML-2017-WangZG #framework #rank
A Unified Variance Reduction-Based Framework for Nonconvex Low-Rank Matrix Recovery (LW, XZ, QG), pp. 3712–3721.
ICMLICML-2017-ZhaoLW0TY #network #rank
Theoretical Properties for Neural Networks with Weight Matrices of Low Displacement Rank (LZ, SL, YW, ZL0, JT0, BY0), pp. 4082–4090.
KDDKDD-2017-DauK
Matrix Profile V: A Generic Technique to Incorporate Domain Knowledge into Motif Discovery (HAD, EJK), pp. 125–134.
KDDKDD-2017-LianLG00C
Discrete Content-aware Matrix Factorization (DL, RL, YG, KZ0, XX0, LC), pp. 325–334.
KDDKDD-2017-WangSZTJZ #modelling #multi
Multi-Modality Disease Modeling via Collective Deep Matrix Factorization (QW, MS, LZ, PT0, SJ, JZ), pp. 1155–1164.
KDDKDD-2017-ZhangLZXXY #sketching
Randomization or Condensation?: Linear-Cost Matrix Sketching Via Cascaded Compression Sampling (KZ0, CL, JZ0, HX, EPX, JY), pp. 615–623.
CASECASE-2017-DingWL #approach #feedback #logic #network
Output feedback disturbance decoupling of boolean control networks: A logical matrix factorization approach (XD, SW, HL0), pp. 181–186.
CASECASE-2017-HanCZ #approach #detection
Matrix approach to detectability of discrete event systems under partial observation (XH, ZC, JZ), pp. 187–192.
CASECASE-2017-Luo0 #estimation
Non-negativity constrained missing data estimation for high-dimensional and sparse matrices (XL0, SL0), pp. 1368–1373.
EDMEDM-2016-ShimadaOO #mining
Browsing-Pattern Mining from e-Book Logs with Non-negative Matrix Factorization (AS, FO, HO), pp. 636–637.
ICSMEICSME-2016-RahimiC #feature model #named #source code
Artifact: Cassandra Source Code, Feature Descriptions across 27 Versions, with Starting and Ending Version Trace Matrices (MR, JCH), p. 612.
CIKMCIKM-2016-BrayteeCKL
Balanced Supervised Non-Negative Matrix Factorization for Childhood Leukaemia Patients (AB, DRC, PJK, WL0), pp. 2405–2408.
CIKMCIKM-2016-Duong-TrungSS #predict #realtime #twitter
Near Real-time Geolocation Prediction in Twitter Streams via Matrix Factorization Based Regression (NDT, NS, LST), pp. 1973–1976.
CIKMCIKM-2016-LiuHZSL #adaptation #online
Online Adaptive Passive-Aggressive Methods for Non-Negative Matrix Factorization and Its Applications (CL, SCHH, PZ, JS, EPL), pp. 1161–1170.
CIKMCIKM-2016-PengKYC #named #rank #scalability
RAP: Scalable RPCA for Low-rank Matrix Recovery (CP, ZK, MY, QC), pp. 2113–2118.
CIKMCIKM-2016-ZamaniDSC #feedback #pseudo
Pseudo-Relevance Feedback Based on Matrix Factorization (HZ, JD, AS, WBC), pp. 1483–1492.
CIKMCIKM-2016-ZhangTSYS #orthogonal #performance
Efficient Orthogonal Non-negative Matrix Factorization over Stiefel Manifold (WEZ, MT, QZS, LY, QS), pp. 1743–1752.
CIKMCIKM-2016-ZhangYZZ #classification #network
Collective Classification via Discriminative Matrix Factorization on Sparsely Labeled Networks (DZ, JY, XZ, CZ), pp. 1563–1572.
ECIRECIR-2016-BaluFA #scalability #sketching
Sketching Techniques for Very Large Matrix Factorization (RB, TF, LA), pp. 782–788.
ICMLICML-2016-BhattacharyaGKP
Non-negative Matrix Factorization under Heavy Noise (CB, NG, RK, JP), pp. 1426–1434.
ICMLICML-2016-ColomboV #composition
Tensor Decomposition via Joint Matrix Schur Decomposition (NC, NV), pp. 2820–2828.
ICMLICML-2016-CouilletWAS #approach #network #random
A Random Matrix Approach to Echo-State Neural Networks (RC, GW, HTA, HS), pp. 517–525.
ICMLICML-2016-CutajarOCF #kernel
Preconditioning Kernel Matrices (KC, MAO, JPC, MF), pp. 2529–2538.
ICMLICML-2016-GrosseM #approximate
A Kronecker-factored approximate Fisher matrix for convolution layers (RBG, JM), pp. 573–582.
ICMLICML-2016-GuiHG #estimation #performance #rank #towards
Towards Faster Rates and Oracle Property for Low-Rank Matrix Estimation (HG, JH0, QG), pp. 2300–2309.
ICMLICML-2016-GyorgyS
Shifting Regret, Mirror Descent, and Matrices (AG, CS), pp. 2943–2951.
ICMLICML-2016-KapralovPW #how #multi
How to Fake Multiply by a Gaussian Matrix (MK, VKP, DPW), pp. 2101–2110.
ICMLICML-2016-LiCLYSC #approximate #rank
Low-Rank Matrix Approximation with Stability (DL, CC0, QL, JY, LS, SMC), pp. 295–303.
ICMLICML-2016-LiSJ
Gaussian quadrature for matrix inverse forms with applications (CL, SS, SJ), pp. 1766–1775.
ICMLICML-2016-LouizosW #learning #performance
Structured and Efficient Variational Deep Learning with Matrix Gaussian Posteriors (CL, MW), pp. 1708–1716.
ICMLICML-2016-MenschMTV #learning #taxonomy
Dictionary Learning for Massive Matrix Factorization (AM, JM, BT, GV), pp. 1737–1746.
ICMLICML-2016-PeyreCS #distance #kernel
Gromov-Wasserstein Averaging of Kernel and Distance Matrices (GP, MC, JS), pp. 2664–2672.
ICMLICML-2016-RahmaniA #approach #composition #learning #performance
A Subspace Learning Approach for High Dimensional Matrix Decomposition with Efficient Column/Row Sampling (MR, GKA), pp. 1206–1214.
ICMLICML-2016-RavanbakhshPG #message passing
Boolean Matrix Factorization and Noisy Completion via Message Passing (SR, BP, RG), pp. 945–954.
ICMLICML-2016-TuBSSR #equation #linear #rank
Low-rank Solutions of Linear Matrix Equations via Procrustes Flow (ST, RB, MS, MS, BR), pp. 964–973.
ICMLICML-2016-UbaruS #performance #rank #scalability
Fast methods for estimating the Numerical rank of large matrices (SU, YS), pp. 468–477.
ICMLICML-2016-WangMCBPRGUA #analysis #network
Analysis of Deep Neural Networks with Extended Data Jacobian Matrix (SW, ArM, RC, JAB, MP, MR, KG, GU, ÖA), pp. 718–726.
ICMLICML-2016-XuZCL #optimisation #probability
Matrix Eigen-decomposition via Doubly Stochastic Riemannian Optimization (ZX, PZ, JC, XL0), pp. 1660–1669.
ICPRICPR-2016-Bai0CH16a #graph #novel
A novel entropy-based graph signature from the average mixing matrix (LB0, LR0, LC, ERH), pp. 1339–1344.
ICPRICPR-2016-CaetanoSS #novel
Optical Flow Co-occurrence Matrices: A novel spatiotemporal feature descriptor (CC, JAdS, WRS), pp. 1947–1952.
ICPRICPR-2016-ElTantawyS #novel #physics #using
A novel method for segmenting moving objects in aerial imagery using matrix recovery and physical spring model (AE, MSS), pp. 3898–3903.
ICPRICPR-2016-KohjimaMS #multi
Non-negative multiple matrix factorization with Euclidean and kullback-leibler mixed divergences (MK, TM, HS), pp. 2515–2520.
ICPRICPR-2016-Lan0DAH #bound
A PAC bound for joint matrix completion based on Partially Collective Matrix Factorization (CL, XL0, YD, JSA, JH), pp. 2628–2633.
ICPRICPR-2016-LuoTYZ #adaptation #approximate
Dual approximated nuclear norm based matrix regression via adaptive line search scheme (LL, QT, JY0, YZ), pp. 2538–2543.
ICPRICPR-2016-PuZZDY #approximate #clustering #multi #robust
Multiview clustering based on Robust and Regularized Matrix Approximation (JP, QZ0, LZ, BD, JY), pp. 2550–2555.
ICPRICPR-2016-TripodiVP #clustering
Context aware nonnegative matrix factorization clustering (RT, SV, MP), pp. 1719–1724.
ICPRICPR-2016-YouXLZCTZ #image #rank
Single image super-resolution with non-local balanced low-rank matrix restoration (XY, WX, JL, PZ0, YmC, YT, NZ), pp. 1255–1260.
ICPRICPR-2016-ZorYMWKA #named #optimisation
BeamECOC: A local search for the optimization of the ECOC matrix (CZ, BAY, EM, TW, JK, EA), pp. 198–203.
KDDKDD-2016-GhashamiLP #algorithm #performance
Efficient Frequent Directions Algorithm for Sparse Matrices (MG, EL, JMP), pp. 845–854.
KDDKDD-2016-SiCHRD #induction
Goal-Directed Inductive Matrix Completion (SS, KYC, CJH, NR, ISD), pp. 1165–1174.
KDDKDD-2016-TabeiSYP #scalability
Scalable Partial Least Squares Regression on Grammar-Compressed Data Matrices (YT, HS, YY, SJP), pp. 1875–1884.
KDDKDD-2016-WangNH #clustering #graph #probability
Structured Doubly Stochastic Matrix for Graph Based Clustering: Structured Doubly Stochastic Matrix (XW, FN, HH), pp. 1245–1254.
KDDKDD-2016-WangZD #data mining #mining #modelling
Healthcare Data Mining with Matrix Models (FW0, PZ0, JD), pp. 2137–2138.
KDDKDD-2016-ZadehMUYPVSSZ #optimisation
Matrix Computations and Optimization in Apache Spark (RBZ, XM, AU, BY, LP, SV, ERS, AS, MZ), pp. 31–38.
SKYSKY-2016-Exman #composition #concept
The Modularity Matrix as a Source of Software Conceptual Integrity (IE), pp. 27–35.
SASSAS-2016-GangeNSSS #bound
Exploiting Sparsity in Difference-Bound Matrices (GG, JAN, PS, HS, PJS), pp. 189–211.
SASSAS-2016-JournaultM #abstract interpretation #correctness #functional #source code #static analysis
Static Analysis by Abstract Interpretation of the Functional Correctness of Matrix Manipulating Programs (MJ, AM), pp. 257–277.
CASECASE-2016-YangC #adaptation #evolution
Evolution Strategy with Covariance Matrix and decreasing step-size Adaptation (CMDSA-ES) (ZY, XC), pp. 1008–1013.
CGOCGO-2016-SpampinatoP #algebra #compilation #linear
A basic linear algebra compiler for structured matrices (DGS, MP), pp. 117–127.
CSLCSL-2016-Leiss #algebra
The Matrix Ring of a μ-Continuous Chomsky Algebra is mu-Continuous (HL), p. 15.
PODSPODS-2015-GuchtWWZ #communication #complexity #distributed #multi
The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication (DVG, RW, DPW, QZ), pp. 199–212.
SIGMODSIGMOD-2015-TeflioudiGM #named #performance #retrieval #scalability
LEMP: Fast Retrieval of Large Entries in a Matrix Product (CT, RG, OM), pp. 107–122.
SIGMODSIGMOD-2015-YuSC #dependence #distributed #performance
Exploiting Matrix Dependency for Efficient Distributed Matrix Computation (LY, YS, BC), pp. 93–105.
EDMEDM-2015-VossSMS #approach #dataset #learning
A Transfer Learning Approach for Applying Matrix Factorization to Small ITS Datasets (LV, CS, CM, LST), pp. 372–375.
ICALPICALP-v1-2015-GawrychowskiMW #query
Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search (PG, SM, OW), pp. 580–592.
ICALPICALP-v1-2015-Yu #algorithm #combinator #multi
An Improved Combinatorial Algorithm for Boolean Matrix Multiplication (HY), pp. 1094–1105.
LATALATA-2015-MakowskyL #graph #word
Hankel Matrices: From Words to Graphs (JAM, NL), pp. 47–55.
RTARTA-2015-Waldmann
Matrix Interpretations on Polyhedral Domains (JW), pp. 318–333.
DiGRADiGRA-2015-MarczakSH #comprehension #experience #similarity #using
Understanding Player Experience Through the Use of Similarity Matrix (RM, GS, PH).
CHICHI-2015-LiuS #representation #visual notation #visualisation
The Effects of Representation and Juxtaposition on Graphical Perception of Matrix Visualization (XL, HWS), pp. 269–278.
CSCWCSCW-2015-LeeP #concept #coordination #framework
From The Matrix to a Model of Coordinated Action (MoCA): A Conceptual Framework of and for CSCW (CPL, DP), pp. 179–194.
HCIHIMI-IKC-2015-HamaguchiMTKN #design #generative #using
A Method for Generation and Check of Alarm Configurations Using Cause-Effect Matrices for Plant Alarm System Design (TH, BM, KT, NK, MN), pp. 549–556.
HCIHIMI-IKC-2015-WangN #analysis #identification
Dot Matrix Analysis of Plant Operation Data for Identifying Sequential Alarms Triggered by Single Root Cause (ZW, MN), pp. 152–158.
CIKMCIKM-2015-AilemRN #clustering #composition #graph
Co-clustering Document-term Matrices by Direct Maximization of Graph Modularity (MA, FR, MN), pp. 1807–1810.
CIKMCIKM-2015-GaoNCH #robust
Robust Capped Norm Nonnegative Matrix Factorization: Capped Norm NMF (HG, FN, TWC, HH), pp. 871–880.
CIKMCIKM-2015-JiangLSW #behaviour #clustering #predict #twitter
Message Clustering based Matrix Factorization Model for Retweeting Behavior Prediction (BJ, JL, YS, LW), pp. 1843–1846.
CIKMCIKM-2015-JoKB #analysis #gpu #multi #network #performance #scalability #social
Efficient Sparse Matrix Multiplication on GPU for Large Social Network Analysis (YYJ, SWK, DHB), pp. 1261–1270.
CIKMCIKM-2015-KohjimaMS #probability
Probabilistic Non-negative Inconsistent-resolution Matrices Factorization (MK, TM, HS), pp. 1855–1858.
CIKMCIKM-2015-LiuTL #learning #multi #named #scalability
MF-Tree: Matrix Factorization Tree for Large Multi-Class Learning (LL, PNT, XL), pp. 881–890.
CIKMCIKM-2015-ManSHC #adaptation #multi #recommendation
Context-Adaptive Matrix Factorization for Multi-Context Recommendation (TM, HS, JH, XC), pp. 901–910.
CIKMCIKM-2015-ShinCLD #induction #recommendation
Tumblr Blog Recommendation with Boosted Inductive Matrix Completion (DS, SC, KCL, ISD), pp. 203–212.
ECIRECIR-2015-GaillardR #adaptation #collaboration
Time-Sensitive Collaborative Filtering through Adaptive Matrix Completion (JG, JMR), pp. 327–332.
ICMLICML-2015-GeZ
Intersecting Faces: Non-negative Matrix Factorization With New Guarantees (RG, JZ), pp. 2295–2303.
ICMLICML-2015-GrosseS #scalability
Scaling up Natural Gradient by Sparsely Factorizing the Inverse Fisher Matrix (RBG, RS), pp. 2304–2313.
ICMLICML-2015-HsiehND #learning
PU Learning for Matrix Completion (CJH, NN, ISD), pp. 2445–2453.
ICMLICML-2015-LuoXZL
Support Matrix Machines (LL, YX, ZZ, WJL), pp. 938–947.
ICMLICML-2015-QiuXHLC #estimation #process #robust
Robust Estimation of Transition Matrices in High Dimensional Heavy-tailed Vector Autoregressive Processes (HQ, SX, FH, HL, BC), pp. 1843–1851.
ICMLICML-2015-SaRO #convergence #probability #problem
Global Convergence of Stochastic Gradient Descent for Some Non-convex Matrix Problems (CDS, CR, KO), pp. 2332–2341.
ICMLICML-2015-UbaruMS #approximate #fault #rank #using
Low Rank Approximation using Error Correcting Coding Matrices (SU, AM, YS), pp. 702–710.
ICMLICML-2015-WangY #learning #multi
Safe Screening for Multi-Task Feature Learning with Multiple Data Matrices (JW, JY), pp. 1747–1756.
ICMLICML-2015-XuJZ #algorithm
CUR Algorithm for Partially Observed Matrices (MX, RJ, ZHZ), pp. 1412–1421.
ICMLICML-2015-ZhangWJ #algorithm #bound #distributed #estimation #performance #rank
Distributed Estimation of Generalized Matrix Rank: Efficient Algorithms and Lower Bounds (YZ, MJW, MIJ), pp. 457–465.
ICMLICML-2015-ZukW #metric #rank
Low-Rank Matrix Recovery from Row-and-Column Affine Measurements (OZ, AW), pp. 2012–2020.
KDDKDD-2015-AhnKLRW #distributed #probability #scalability #using
Large-Scale Distributed Bayesian Matrix Factorization using Stochastic Gradient MCMC (SA, AK, NL, SR, MW), pp. 9–18.
KDDKDD-2015-DevooghtKM
Dynamic Matrix Factorization with Priors on Unknown Values (RD, NK, AM), pp. 189–198.
KDDKDD-2015-FeldmanT #approximate #big data #constraints
More Constraints, Smaller Coresets: Constrained Matrix Approximation of Sparse Big Data (DF, TT), pp. 249–258.
KDDKDD-2015-KimCKRP #topic
Simultaneous Discovery of Common and Discriminative Topics via Joint Nonnegative Matrix Factorization (HK, JC, JK, CKR, HP), pp. 567–576.
KDDKDD-2015-OhHYJ #parallel #performance #robust
Fast and Robust Parallel SGD Matrix Factorization (JO, WSH, HY, XJ), pp. 865–874.
KDDKDD-2015-RuchanskyCT #query
Matrix Completion with Queries (NR, MC, ET), pp. 1025–1034.
MLDMMLDM-2015-MojahedBWI #analysis #clustering #semistructured data #similarity #using
Applying Clustering Analysis to Heterogeneous Data Using Similarity Matrix Fusion (SMF) (AM, JHBS, WW, BdlI), pp. 251–265.
RecSysRecSys-2015-BerliozFKBB #difference #privacy
Applying Differential Privacy to Matrix Factorization (AB, AF, MAK, RB, SB), pp. 107–114.
RecSysRecSys-2015-GriesnerAN #recommendation #towards
POI Recommendation: Towards Fused Matrix Factorization with Geographical and Temporal Influences (JBG, TA, HN), pp. 301–304.
RecSysRecSys-2015-LiuWS #performance
Fast Differentially Private Matrix Factorization (ZL, YXW, AJS), pp. 171–178.
RecSysRecSys-2015-SongCL #incremental #recommendation
Incremental Matrix Factorization via Feature Space Re-learning for Recommender System (QS, JC, HL), pp. 277–280.
RecSysRecSys-2015-Steck #ranking
Gaussian Ranking by Matrix Factorization (HS), pp. 115–122.
SIGIRSIGIR-2015-ChenLZLS #approximate #named #recommendation #scalability
WEMAREC: Accurate and Scalable Recommendation through Weighted and Ensemble Matrix Approximation (CC, DL, YZ, QL, LS), pp. 303–312.
SIGIRSIGIR-2015-LiKF #behaviour #predict
Predicting User Behavior in Display Advertising via Dynamic Collective Matrix Factorization (SL, JK, YF), pp. 875–878.
SIGIRSIGIR-2015-LiLZS #modelling #multi #retrieval #using
Modeling Multi-query Retrieval Tasks Using Density Matrix Transformation (QL, JL, PZ, DS), pp. 871–874.
SIGIRSIGIR-2015-TanWX #multi #summary #topic
Joint Matrix Factorization and Manifold-Ranking for Topic-Focused Multi-Document Summarization (JT, XW, JX), pp. 987–990.
SKYSKY-2015-Exman #composition #concept #design
Software Design with the Modularity Matrix and the Modularity Conceptual Lattice (IE), pp. 72–73.
PLDIPLDI-2015-VenkatHS #data transformation
Loop and data transformations for sparse matrix code (AV, MWH, MS), pp. 521–532.
ESEC-FSEESEC-FSE-2015-NasrBAFBSD #architecture #named
MatrixMiner: a red pill to architect informal product descriptions in the matrix (SBN, GB, MA, JBFF, BB, NS, JMD), pp. 982–985.
SACSAC-2015-FerreiraPC #graph
Exploring graph topology via matrix factorization to improve wikification (RF, MdGCP, MC), pp. 1099–1104.
SACSAC-2015-MatuszykVSJG #incremental #recommendation
Forgetting methods for incremental matrix factorization in recommender systems (PM, JV, MS, AMJ, JG), pp. 947–953.
PDPPDP-2015-ConinckKVSBMF #algebra #parallel #predict #scalability #towards
Towards Parallel Large-Scale Genomic Prediction by Coupling Sparse and Dense Matrix Algebra (ADC, DK, FV, OS, BDB, SM, JF), pp. 747–750.
PPoPPPPoPP-2015-BensonB #framework #parallel #performance
A framework for practical parallel fast matrix multiplication (ARB, GB), pp. 42–53.
PPoPPPPoPP-2015-ThebaultPD #3d #assembly #case study #implementation #performance #scalability
Scalable and efficient implementation of 3d unstructured meshes computation: a case study on matrix assembly (LT, EP, QD), pp. 120–129.
STOCSTOC-2015-AmbainisFG #multi #performance
Fast Matrix Multiplication: Limitations of the Coppersmith-Winograd Method (AA, YF, FLG), pp. 585–593.
STOCSTOC-2015-Moitra
Super-resolution, Extremal Functions and the Condition Number of Vandermonde Matrices (AM), pp. 821–830.
STOCSTOC-2015-SchulmanS #algorithm #analysis
Analysis of a Classical Matrix Preconditioning Algorithm (LJS, AS), pp. 831–840.
STOCSTOC-2015-ZhuLO #multi
Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates (ZAZ, ZL, LO), pp. 237–245.
ICSTICST-2015-KorosecP #agile
Supporting the Transition to an Agile Test Matrix (RK, RP), pp. 1–2.
VLDBVLDB-2014-GhashamiPL #approximate #distributed
Continuous Matrix Approximation on Distributed Data (MG, JMP, FL), pp. 809–820.
VLDBVLDB-2014-YunYHVD #algorithm #distributed #multi #named #probability
NOMAD: Nonlocking, stOchastic Multi-machine algorithm for Asynchronous and Decentralized matrix completion (HY, HFY, CJH, SVNV, ISD), pp. 975–986.
EDMEDM-2014-LanSB #learning #personalisation
Quantized Matrix Completion for Personalized Learning (ASL, CS, RGB), pp. 280–283.
EDMEDM-2014-SchattenJMS #adaptation
Matrix Factorization Feasibility for Sequencing and Adaptive Support in Intelligent Tutoring Systems (CS, RJ, MM, LST), pp. 385–386.
ICALPICALP-v1-2014-GawrychowskiMW #query
Improved Submatrix Maximum Queries in Monge Matrices (PG, SM, OW), pp. 525–537.
ICALPICALP-v1-2014-WimmerWZ #complexity #query
Optimal Query Complexity for Estimating the Trace of a Matrix (KW, YW, PZ), pp. 1051–1062.
AIIDEAIIDE-2014-Abou-ZleikhaS #authoring #design #named #using
PaTux: An Authoring Tool for Level Design through Pattern Customisation Using Non-Negative Matrix Factorization (MAZ, NS).
CHICHI-2014-BachPF #network #visualisation
Visualizing dynamic networks with matrix cubes (BB, EP, JDF), pp. 877–886.
CIKMCIKM-2014-ChenC #data type #incremental #named
GI-NMF: Group Incremental Non-Negative Matrix Factorization on Data Streams (XC, KSC), pp. 1119–1128.
CIKMCIKM-2014-WangPX #collaboration #named #recommendation
HGMF: Hierarchical Group Matrix Factorization for Collaborative Recommendation (XW, WP, CX), pp. 769–778.
CIKMCIKM-2014-YuSYL #distributed #probability
Distributed Stochastic ADMM for Matrix Factorization (ZQY, XJS, LY, WJL), pp. 1259–1268.
CIKMCIKM-2014-ZhangZZLM #comprehension #constraints
Understanding the Sparsity: Augmented Matrix Factorization with Sampled Constraints on Unobservables (YZ, MZ, YZ, YL, SM), pp. 1189–1198.
ECIRECIR-2014-BaiGLC #documentation #linear #modelling
Local Linear Matrix Factorization for Document Modeling (LB, JG, YL, XC), pp. 398–411.
ICMLICML-c1-2014-ChenBSW
Coherent Matrix Completion (YC, SB, SS, RW), pp. 674–682.
ICMLICML-c1-2014-DenisGH #bound #learning
Dimension-free Concentration Bounds on Hankel Matrices for Spectral Learning (FD, MG, AH), pp. 449–457.
ICMLICML-c1-2014-ShalitC #coordination #learning #orthogonal
Coordinate-descent for learning orthogonal matrices through Givens rotations (US, GC), pp. 548–556.
ICMLICML-c2-2014-Bhojanapalli0
Universal Matrix Completion (SB, PJ), pp. 1881–1889.
ICMLICML-c2-2014-GunasekarRG #constraints #exponential #product line
Exponential Family Matrix Completion under Structural Constraints (SG, PR, JG), pp. 1917–1925.
ICMLICML-c2-2014-HaeffeleYV #algorithm #image #rank
Structured Low-Rank Matrix Factorization: Optimality, Algorithm, and Applications to Image Processing (BDH, EY, RV), pp. 2007–2015.
ICMLICML-c2-2014-Hernandez-LobatoHG #modelling #probability #scalability
Stochastic Inference for Scalable Probabilistic Modeling of Binary Matrices (JMHL, NH, ZG), pp. 379–387.
ICMLICML-c2-2014-Hernandez-LobatoHG14a #probability
Probabilistic Matrix Factorization with Non-random Missing Data (JMHL, NH, ZG), pp. 1512–1520.
ICMLICML-c2-2014-HoulsbyHG #learning #robust
Cold-start Active Learning with Robust Ordinal Matrix Factorization (NH, JMHL, ZG), pp. 766–774.
ICMLICML-c2-2014-KondorTG #multi
Multiresolution Matrix Factorization (RK, NT, VG), pp. 1620–1628.
ICMLICML-c2-2014-TanTWVP
Riemannian Pursuit for Big Matrix Recovery (MT, IWT, LW, BV, SJP), pp. 1539–1547.
ICMLICML-c2-2014-WangLLFDY
Rank-One Matrix Pursuit for Matrix Completion (ZW, MJL, ZL, WF, HD, JY), pp. 91–99.
ICMLICML-c2-2014-YangLR14a
Elementary Estimators for Sparse Covariance Matrices and other Structured Moments (EY, ACL, PDR), pp. 397–405.
ICPRICPR-2014-ChangWW #image #multi
Multi-view Nonnegative Matrix Factorization for Clothing Image Characterization (WYC, CPW, YCFW), pp. 1272–1277.
ICPRICPR-2014-ChaudhariM #clustering #semistructured data #symmetry #using
Average Overlap for Clustering Incomplete Data Using Symmetric Non-negative Matrix Factorization (SC, MNM), pp. 1431–1436.
ICPRICPR-2014-DengHXC #analysis #composition #rank
Sparse and Low Rank Matrix Decomposition Based Local Morphological Analysis and Its Application to Diagnosis of Cirrhosis Livers (JD, XHH, GX, YWC), pp. 3363–3368.
ICPRICPR-2014-GognaSM #using
Matrix Recovery Using Split Bregman (AG, AS, AM), pp. 1031–1036.
ICPRICPR-2014-MoeiniMF #image #invariant #realtime #recognition
Real-Time Pose-Invariant Face Recognition by Triplet Pose Sparse Matrix from Only a Single Image (AM, HM, KF), pp. 465–470.
ICPRICPR-2014-NourbakhshBP #approach #graph
A Matrix Factorization Approach to Graph Compression (FN, SRB, MP), pp. 76–81.
ICPRICPR-2014-RaghavendraRYB #assessment #automation #empirical #quality #using #video
Automatic Face Quality Assessment from Video Using Gray Level Co-occurrence Matrix: An Empirical Study on Automatic Border Control System (RR, KBR, BY, CB), pp. 438–443.
ICPRICPR-2014-RenL14a #identification
Person Re-identification Based on Relaxed Nonnegative Matrix Factorization with Regularizations (WR, GL), pp. 4654–4659.
ICPRICPR-2014-ZenRS #distance #learning #metric
Simultaneous Ground Metric Learning and Matrix Factorization with Earth Mover’s Distance (GZ, ER, NS), pp. 3690–3695.
KDDKDD-2014-LianZXSCR #modelling #named #recommendation
GeoMF: joint geographical modeling and matrix factorization for point-of-interest recommendation (DL, CZ, XX, GS, EC, YR), pp. 831–840.
KDDKDD-2014-LiWW #rank #testing
Improved testing of low rank matrices (YL, ZW, DPW), pp. 691–700.
RecSysRecSys-2014-BauerN #framework
A framework for matrix factorization based on general distributions (JB, AN), pp. 249–256.
RecSysRecSys-2014-BhagatWIT #learning #recommendation #using
Recommending with an agenda: active learning of private attributes using matrix factorization (SB, UW, SI, NT), pp. 65–72.
RecSysRecSys-2014-FazeliLBDS #social #trust
Implicit vs. explicit trust in social matrix factorization (SF, BL, AB, HD, PBS), pp. 317–320.
RecSysRecSys-2014-PetroniQ #clustering #distributed #graph #named #probability
GASGD: stochastic gradient descent for distributed asynchronous matrix completion via graph partitioning (FP, LQ), pp. 241–248.
SIGIRSIGIR-2014-CaiLR #documentation #personalisation #probability #ranking
Personalized document re-ranking based on Bayesian probabilistic matrix factorization (FC, SL, MdR), pp. 835–838.
PPDPPPDP-J-2012-Emden14
Matrix Code (MHvE), pp. 3–21.
ASEASE-2014-BecanSABBB #automation #comparison #formal method
Automating the formalization of product comparison matrices (GB, NS, MA, OB, AB, BB), pp. 433–444.
SACSAC-2014-ChoiSP #2d #classification #correlation #distance #image
Matrix correlation distance for 2D image classification (HC, JS, HP), pp. 1741–1742.
SACSAC-2014-LiW #clustering #multi
Single multiplicatively updated matrix factorization for co-clustering (ZL, XW), pp. 97–104.
SACSAC-2014-Zheng #using
Semi-supervised context-aware matrix factorization: using contexts in a way of “latent” factors (YZ), pp. 292–293.
CASECASE-2014-ShiWS #approximate
Approximation method to rank-one binary matrix factorization (ZS, LW, LS), pp. 800–805.
CASECASE-2014-YanLP #dependence #fault #framework #integration
Fault diagnosis framework for Air Handling Units based on the integration of Dependency matrices and PCA (YY, PBL, KRP), pp. 1103–1108.
DACDAC-2014-ApostolopoulouDES #scalability #simulation
Selective Inversion of Inductance Matrix for Large-Scale Sparse RLC Simulation (IA, KD, NEE, GIS), p. 6.
HPDCHPDC-2014-BeaumontM #analysis #multi #platform #scheduling
Analysis of dynamic scheduling strategies for matrix multiplication on heterogeneous platforms (OB, LM), pp. 141–152.
HPDCHPDC-2014-XiangMA #pipes and filters #scalability #using
Scalable matrix inversion using MapReduce (JX, HM, AA), pp. 177–190.
PPoPPPPoPP-2014-CatanzaroKG #composition
A decomposition for in-place matrix transposition (BCC, AK, MG), pp. 193–206.
PPoPPPPoPP-2014-SungGGGH
In-place transposition of rectangular matrices on accelerators (IJS, JGL, JMGL, NG, WmWH), pp. 207–218.
STOCSTOC-2014-BoutsidisW
Optimal CUR matrix decompositions (CB, DPW), pp. 353–362.
STOCSTOC-2014-FournierLMS #bound #multi
Lower bounds for depth 4 formulas computing iterated matrix multiplication (HF, NL, GM, SS), pp. 128–135.
HTHT-2013-ZhangZLM #collaboration #framework
A general collaborative filtering framework based on matrix bordered block diagonal forms (YZ, MZ, YL, SM), pp. 219–224.
ICSMEICSM-2013-BosS #ide #named
TRINITY: An IDE for the Matrix (JvdB, TvdS), pp. 520–523.
CIAACIAA-J-2012-Oliveira13 #algebra #automaton #category theory
Weighted Automata as Coalgebras in Categories of Matrices (JNO), pp. 709–728.
ICALPICALP-v1-2013-IndykR #modelling #on the
On Model-Based RIP-1 Matrices (PI, IR), pp. 564–575.
DiGRADiGRA-2013-WarpefeltJV #behaviour #game studies #using
Analyzing the believability of game character behavior using the Game Agent Matrix (HW, MJ, HV).
HCIDUXU-PMT-2013-JiangL #adaptation #effectiveness #using
Understand System’s Relative Effectiveness Using Adapted Confusion Matrix (NJ, HL), pp. 294–302.
VISSOFTVISSOFT-2013-AbuthawabehBZD #multi #visualisation
Finding structures in multi-type code couplings with node-link and matrix visualizations (AA, FB, DZ, SD), pp. 1–10.
VISSOFTVISSOFT-2013-Wehrwein #lightweight #reverse engineering #using #visualisation
Lightweight software reverse engineering using augmented matrix visualizations (BW), pp. 1–4.
ICEISICEIS-v1-2013-SilveiraMAC #development #library #memory management #process
A Library to Support the Development of Applications that Process Huge Matrices in External Memory (JAS, SVGM, MVAA, VSC), pp. 153–160.
CIKMCIKM-2013-ChanLKLBR #graph #using
Discovering latent blockmodels in sparse and noisy graphs using non-negative matrix factorisation (JC, WL, AK, CL, JB, KR), pp. 811–816.
ICMLICML-c1-2013-ChenLYY #functional #using
General Functional Matrix Factorization Using Gradient Boosting (TC, HL, QY, YY), pp. 436–444.
ICMLICML-c1-2013-KumarSK #algorithm #performance
Fast Conical Hull Algorithms for Near-separable Non-negative Matrix Factorization (AK, VS, PK), pp. 231–239.
ICMLICML-c2-2013-HanL #estimation
Transition Matrix Estimation in High Dimensional Time Series (FH, HL), pp. 172–180.
ICMLICML-c2-2013-LeeKLS #approximate #rank
Local Low-Rank Matrix Approximation (JL, SK, GL, YS), pp. 82–90.
ICMLICML-c2-2013-Tran-DinhKC #framework #graph #learning
A proximal Newton framework for composite minimization: Graph learning without Cholesky decompositions and matrix inversions (QTD, ATK, VC), pp. 271–279.
ICMLICML-c3-2013-ChenC
Spectral Compressed Sensing via Structured Matrix Completion (YC, YC), pp. 414–422.
ICMLICML-c3-2013-GonenKK #kernel
Kernelized Bayesian Matrix Factorization (MG, SAK, SK), pp. 864–872.
ICMLICML-c3-2013-SimsekliCY #learning #modelling
Learning the β-Divergence in Tweedie Compound Poisson Matrix Factorization Models (US, ATC, YKY), pp. 1409–1417.
ICMLICML-c3-2013-XuZZ #performance
Fast Max-Margin Matrix Factorization with Data Augmentation (MX, JZ, BZ), pp. 978–986.
ICMLICML-c3-2013-YangLZ #learning #multi
Multi-Task Learning with Gaussian Matrix Generalized Inverse Gaussian Model (MY, YL, ZZ), pp. 423–431.
ICMLICML-c3-2013-YiZJQJ #clustering #similarity
Semi-supervised Clustering by Input Pattern Assisted Pairwise Similarity Matrix Completion (JY, LZ, RJ, QQ, AKJ), pp. 1400–1408.
KDDKDD-2013-KuangP #clustering #documentation #performance
Fast rank-2 nonnegative matrix factorization for hierarchical document clustering (DK, HP), pp. 739–747.
KDDKDD-2013-Liberty #sketching
Simple and deterministic matrix sketching (EL), pp. 581–588.
KDDKDD-2013-LozanoJD #distance #estimation #multi #robust
Robust sparse estimation of multiresponse regression and inverse covariance matrix via the L2 distance (ACL, HJ, XD), pp. 293–301.
KDDKDD-2013-SutherlandPS #learning #rank
Active learning and search on low-rank matrices (DJS, BP, JGS), pp. 212–220.
KDDKDD-2013-ZhengDMZ #collaboration #interactive #multi #predict
Collaborative matrix factorization with multiple similarities for predicting drug-target interactions (XZ, HD, HM, SZ), pp. 1025–1033.
RecSysRecSys-2013-KoenigsteinP #embedded #feature model #recommendation
Xbox movies recommendations: variational bayes matrix factorization with embedded feature selection (NK, UP), pp. 129–136.
RecSysRecSys-2013-KoyejoAG #collaboration
Retargeted matrix factorization for collaborative filtering (OK, SA, JG), pp. 49–56.
RecSysRecSys-2013-PuF #comprehension #recommendation #relational
Understanding and improving relational matrix factorization in recommender systems (LP, BF), pp. 41–48.
RecSysRecSys-2013-SchelterBSAM #distributed #pipes and filters #using
Distributed matrix factorization with mapreduce using a series of broadcast-joins (SS, CB, MS, AA, VM), pp. 281–284.
RecSysRecSys-2013-ZhuangCJL #memory management #parallel #performance
A fast parallel SGD for matrix factorization in shared memory systems (YZ, WSC, YCJ, CJL), pp. 249–256.
SIGIRSIGIR-2013-ZhangZLM #collaboration
Improve collaborative filtering through bordered block diagonal form matrices (YZ, MZ, YL, SM), pp. 313–322.
ASEASE-2013-SannierAB #case study #comparison #variability #wiki
From comparison matrix to Variability Model: The Wikipedia case study (NS, MA, BB), pp. 580–585.
SACSAC-2013-MokarizadehDMB #privacy #social
Enhancing social matrix factorization with privacy (SM, ND, MM, RB), pp. 277–278.
SACSAC-2013-ZengC #data fusion #recommendation #semistructured data
Heterogeneous data fusion via matrix factorization for augmenting item, group and friend recommendations (WZ, LC), pp. 237–244.
CASECASE-2013-SoviziK #nondeterminism #parallel #random #using
Uncertainty characterization in serial and parallel manipulators using random matrix theory (JS, VNK), pp. 312–317.
STOCSTOC-2013-AlonLSV #algorithm #approximate #rank
The approximate rank of a matrix and its algorithmic applications: approximate rank (NA, TL, AS, SV), pp. 675–684.
STOCSTOC-2013-JainNS #rank #using
Low-rank matrix completion using alternating minimization (PJ, PN, SS), pp. 665–674.
STOCSTOC-2013-Ta-Shma #quantum
Inverting well conditioned matrices in quantum logspace (ATS), pp. 881–890.
HTHT-2012-KontopoulouPKG #graph #metric
Graph and matrix metrics to analyze ergodic literature for children (EMK, MP, TK, EG), pp. 133–142.
ICALPICALP-v1-2012-JefferyKM #complexity #graph #multi #quantum #query #using
Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision (SJ, RK, FM), pp. 522–532.
ICALPICALP-v1-2012-Zouzias #algorithm
A Matrix Hyperbolic Cosine Algorithm and Applications (AZ), pp. 846–858.
CoGVS-Games-2012-NeyEE #education #game studies #learning
Paving the Way to Game Based Learning: A Question Matrix for Teacher Reflection (MN, VE, JE), pp. 17–24.
CIKMCIKM-2012-KoenigsteinRS #framework #performance #recommendation #retrieval
Efficient retrieval of recommendations in a matrix factorization framework (NK, PR, YS), pp. 535–544.
CIKMCIKM-2012-LowZ #performance #query #similarity
Fast top-k similarity queries via matrix compression (YL, AXZ), pp. 2070–2074.
CIKMCIKM-2012-WuCLXBZ #probability
Leveraging tagging for neighborhood-aware probabilistic matrix factorization (LW, EC, QL, LX, TB, LZ), pp. 1854–1858.
CIKMCIKM-2012-YanGLCW #clustering #using
Clustering short text using Ncut-weighted non-negative matrix factorization (XY, JG, SL, XC, YW), pp. 2259–2262.
CIKMCIKM-2012-YaoC #locality
Accelerating locality preserving nonnegative matrix factorization (GY, DC), pp. 2271–2274.
ICMLICML-2012-KiralyT #algebra #approach #combinator #rank
A Combinatorial Algebraic Approach for the Identifiability of Low-Rank Matrix Completion (FJK, RT), p. 100.
ICMLICML-2012-MahoneyDMW #approximate #performance #statistics
Fast approximation of matrix coherence and statistical leverage (MWM, PD, MMI, DPW), p. 137.
ICMLICML-2012-MorvantKR #bound #classification #multi
PAC-Bayesian Generalization Bound on Confusion Matrix for Multi-Class Classification (EM, SK, LR), p. 158.
ICMLICML-2012-PurushothamL #collaboration #recommendation #social #topic
Collaborative Topic Regression with Social Matrix Factorization for Recommendation Systems (SP, YL), p. 92.
ICMLICML-2012-SavalleRV #estimation #rank
Estimation of Simultaneously Sparse and Low Rank Matrices (PAS, ER, NV), p. 11.
ICMLICML-2012-ShanKRBSR #predict #probability #using
Gap Filling in the Plant Kingdom — Trait Prediction Using Hierarchical Probabilistic Matrix Factorization (HS, JK, PBR, AB, FS, MR), p. 47.
ICMLICML-2012-StulpS #adaptation #policy
Path Integral Policy Improvement with Covariance Matrix Adaptation (FS, OS), p. 201.
ICMLICML-2012-WangX #collaboration
Stability of matrix factorization for collaborative filtering (YXW, HX), p. 26.
ICMLICML-2012-YangO #clustering #composition #probability #rank
Clustering by Low-Rank Doubly Stochastic Matrix Decomposition (ZY, EO), p. 94.
ICMLICML-2012-YgerBGR #adaptation #analysis #canonical #correlation
Adaptive Canonical Correlation Analysis Based On Matrix Manifolds (FY, MB, GG, AR), p. 43.
ICMLICML-2012-ZhongG #approach #approximate
A Bayesian Approach to Approximate Joint Diagonalization of Square Matrices (MZ, MAG), p. 87.
ICPRICPR-2012-GuyonBZ #constraints #detection #rank #robust
Foreground detection via robust low rank matrix factorization including spatial constraint with Iterative reweighted regression (CG, TB, EHZ), pp. 2805–2808.
ICPRICPR-2012-KirbizG #music
Perceptually weighted Non-negative Matrix Factorization for blind single-channel music source separation (SK, BG), pp. 226–229.
ICPRICPR-2012-LiCWLG #robust
Robust lyric search based on weighted syllable confusion matrix (BL, FC, QW, GL, JG), pp. 613–616.
ICPRICPR-2012-LiW #encoding #recognition #using
Iris recognition using ordinal encoding of Log-Euclidean covariance matrices (PL, GW), pp. 2420–2423.
ICPRICPR-2012-NielsenLYV
Jensen divergence based SPD matrix means and applications (FN, ML, XY, BCV), pp. 2841–2844.
ICPRICPR-2012-TuH #invariant #recognition
Dual subspace nonnegative matrix factorization for person-invariant facial expression recognition (YHT, CTH), pp. 2391–2394.
ICPRICPR-2012-VieiraLSC #distance #invariant
Distance matrices as invariant features for classifying MoCap data (AWV, TL, WRS, MFMC), pp. 2934–2937.
ICPRICPR-2012-WangAG #adaptation #feature model #graph
Adaptive graph regularized Nonnegative Matrix Factorization via feature selection (JW, IA, XG), pp. 963–966.
ICPRICPR-2012-XieLH #clustering #multi
Multi-task co-clustering via nonnegative matrix factorization (SX, HL, YH), pp. 2954–2958.
KDDKDD-2012-HuZLYH
Accelerated singular value thresholding for matrix completion (YH, DZ, JL, JY, XH), pp. 298–306.
KDDKDD-2012-SilvaC #learning #online
Active learning for online bayesian matrix factorization (JGS, LC), pp. 325–333.
KDDKDD-2012-ZhangY #bound #community #detection
Overlapping community detection via bounded nonnegative matrix tri-factorization (YZ, DYY), pp. 606–614.
MLDMMLDM-2012-Moreira-MatiasMGB #categorisation #classification #using
Text Categorization Using an Ensemble Classifier Based on a Mean Co-association Matrix (LMM, JMM, JG, PB), pp. 525–539.
RecSysRecSys-2012-HuangXP
Constrained collective matrix factorization (YJH, EWX, RP), pp. 237–240.
RecSysRecSys-2012-KarimiFNS #learning #recommendation
Exploiting the characteristics of matrix factorization for active learning in recommender systems (RK, CF, AN, LST), pp. 317–320.
SIGIRSIGIR-2012-JungL #probability
Inferring missing relevance judgments from crowd workers via probabilistic matrix factorization (HJJ, ML), pp. 1095–1096.
SIGIRSIGIR-2012-WangCXL #modelling #scalability #topic
Group matrix factorization for scalable topic modeling (QW, ZC, JX, HL), pp. 375–384.
PPDPPPDP-2012-Emden
Matrix code (MvE), pp. 13–24.
RERE-2012-BekkersBBMWW #maturity
Evaluating the Software Product Management Maturity Matrix (WB, SB, LvdB, FM, CW, IvdW), pp. 51–60.
SACSAC-2012-WickerPK #classification #composition #multi #using
Multi-label classification using boolean matrix decomposition (JW, BP, SK), pp. 179–186.
PPoPPPPoPP-2012-DuBBHD #fault tolerance
Algorithm-based fault tolerance for dense matrix factorizations (PD, AB, GB, TH, JD), pp. 225–234.
STOCSTOC-2012-AroraGKM
Computing a nonnegative matrix factorization — provably (SA, RG, RK, AM), pp. 145–162.
STOCSTOC-2012-CheungKL #algorithm #performance #rank
Fast matrix rank algorithms and applications (HYC, TCK, LCL), pp. 549–562.
STOCSTOC-2012-HardtR #random
Beating randomized response on incoherent matrices (MH, AR), pp. 1255–1268.
STOCSTOC-2012-Williams #multi #performance
Multiplying matrices faster than coppersmith-winograd (VVW), pp. 887–898.
CSLCSL-2012-KotekM #graph #parametricity
Connection Matrices and the Definability of Graph Parameters (TK, JAM), pp. 411–425.
ICLPICLP-2012-BanbaraTI #generative #programming #testing
Generating Event-Sequence Test Cases by Answer Set Programming with the Incidence Matrix (MB, NT, KI), pp. 86–97.
VLDBVLDB-2011-ZhangM0 #revisited #theory and practice
Storing Matrices on Disk: Theory and Practice Revisited (YZ, KM, JY), pp. 1075–1086.
CSEETCSEET-2011-CaiIW #design #education
Leveraging design structure matrices in software design education (YC, DI, SW), pp. 179–188.
DLTDLT-J-2009-Zetzsche11 #capacity #comprehension #generative #towards
Toward Understanding the Generative Capacity of Erasing Rules in Matrix Grammars (GZ), pp. 411–426.
ICALPICALP-v1-2011-NgoPR
Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications — (HQN, EP, AR), pp. 557–568.
RTARTA-2011-NeurauterM #proving #term rewriting #termination
Revisiting Matrix Interpretations for Proving Termination of Term Rewriting (FN, AM), pp. 251–266.
CIKMCIKM-2011-Garza #classification
Structured data classification by means of matrix factorization (PG), pp. 2165–2168.
CIKMCIKM-2011-KongDH #robust #using
Robust nonnegative matrix factorization using L21-norm (DK, CHQD, HH), pp. 673–682.
CIKMCIKM-2011-WangHD #clustering #multi #relational #symmetry
Simultaneous clustering of multi-type relational data via symmetric nonnegative matrix tri-factorization (HW, HH, CHQD), pp. 279–284.
ICMLICML-2011-AgarwalNW #composition
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions (AA, SN, MJW), pp. 1129–1136.
ICMLICML-2011-AgovicBC #probability
Probabilistic Matrix Addition (AA, AB, SC), pp. 1025–1032.
ICMLICML-2011-AroraGKF #clustering
Clustering by Left-Stochastic Matrix Factorization (RA, MRG, AK, MF), pp. 761–768.
ICMLICML-2011-ChenXCS #robust
Robust Matrix Completion and Corrupted Columns (YC, HX, CC, SS), pp. 873–880.
ICMLICML-2011-ZhouT #composition #named #random
GoDec: Randomized Lowrank & Sparse Matrix Decomposition in Noisy Case (TZ, DT), pp. 33–40.
KDDKDD-2011-GemullaNHS #distributed #probability #scalability
Large-scale matrix factorization with distributed stochastic gradient descent (RG, EN, PJH, YS), pp. 69–77.
KDDKDD-2011-HsiehD #coordination #performance
Fast coordinate descent methods with variable selection for non-negative matrix factorization (CJH, ISD), pp. 1064–1072.
KDDKDD-2011-MiettinenV #order
Model order selection for boolean matrix factorization (PM, JV), pp. 51–59.
KDDKDD-2011-WangBB #analysis #component #multi
Common component analysis for multiple covariance matrices (HW, AB, DB), pp. 956–964.
RecSysRecSys-2011-BaltrunasLR #recommendation
Matrix factorization techniques for context aware recommendation (LB, BL, FR), pp. 301–304.
RecSysRecSys-2011-CamposDS #evaluation #predict #recommendation #testing #towards
Towards a more realistic evaluation: testing the ability to predict future tastes of matrix factorization-based recommenders (PGC, FD, MASM), pp. 309–312.
RecSysRecSys-2011-ForbesZ #recommendation
Content-boosted matrix factorization for recommender systems: experiments with recipe recommendation (PF, MZ), pp. 261–264.
RecSysRecSys-2011-XinS #multi #probability #recommendation
Multi-value probabilistic matrix factorization for IP-TV recommendations (YX, HS), pp. 221–228.
RecSysRecSys-2011-ZhangAC #flexibility
Generalizing matrix factorization through flexible regression priors (LZ, DA, BCC), pp. 13–20.
SIGIRSIGIR-2011-WangHND #classification #information management #using #web
Cross-language web page classification via dual knowledge transfer using nonnegative matrix tri-factorization (HW, HH, FN, CHQD), pp. 933–942.
SIGIRSIGIR-2011-ZhouYZ #functional #recommendation
Functional matrix factorizations for cold-start recommendation (KZ, SHY, HZ), pp. 315–324.
PLDIPLDI-2011-SatoI #automation #parallel
Automatic parallelization via matrix multiplication (SS, HI), pp. 470–479.
SACSAC-2011-FormigaLSDT #assessment #recognition #scalability
An assessment of data matrix barcode recognition under scaling, rotation and cylindrical warping (AdAF, RDL, SJS, GD, MT), pp. 266–267.
DACDAC-2011-ChaiJ #complexity #equation #linear
Direct matrix solution of linear complexity for surface integral-equation based impedance extraction of high bandwidth interconnects (WC, DJ), pp. 206–211.
PDPPDP-2011-EzzattiQR #framework #manycore #performance #platform
High Performance Matrix Inversion on a Multi-core Platform with Several GPUs (PE, ESQO, AR), pp. 87–93.
STOCSTOC-2011-BarakDYW #bound #design #geometry #rank
Rank bounds for design matrices with applications toc ombinatorial geometry and locally correctable codes (BB, ZD, AY, AW), pp. 519–528.
STOCSTOC-2011-BourgainDFKK
Breaking the k2 barrier for explicit RIP matrices (JB, SJD, KF, SK, DK), pp. 637–644.
DocEngDocEng-2010-NamaneSM #feature model #recognition #using
Degraded dot matrix character recognition using CSM-based feature extraction (AN, EHS, PM), pp. 207–210.
TPDLECDL-2010-CamargoCG #image #multimodal #using #visualisation
Multimodal Image Collection Visualization Using Non-negative Matrix Factorization (JEC, JCC, FAG), pp. 429–432.
CIAACIAA-2010-LiuGLT #automaton #composition #regular expression
Compressing Regular Expressions’ DFA Table by Matrix Decomposition (YL, LG, PL, JT), pp. 282–289.
RTARTA-2010-Waldmann #bound
Polynomially Bounded Matrix Interpretations (JW), pp. 357–372.
ICFPICFP-2010-ArnoldHKBS #specification #verification
Specifying and verifying sparse matrix codes (GA, JH, ASK, RB, MS), pp. 249–260.
CoGCIG-2010-AshlockKA #comparison
A fingerprint comparison of different Prisoner's Dilemma payoff matrices (DAA, EYK, WA), pp. 219–226.
SOFTVISSOFTVIS-2010-Zeckzer #layout #using #visualisation
Visualizing software entities using a matrix layout (DZ), pp. 207–208.
CIKMCIKM-2010-FangS #approximate #information retrieval #multi
Hypergraph-based multilevel matrix approximation for text information retrieval (HrF, YS), pp. 1597–1600.
CIKMCIKM-2010-ThurauKB
Yes we can: simplex volume maximization for descriptive web-scale matrix factorization (CT, KK, CB), pp. 1785–1788.
ICMLICML-2010-BhadraBBB #kernel #nondeterminism #robust
Robust Formulations for Handling Uncertainty in Kernel Matrices (SB, SB, CB, ABT), pp. 71–78.
ICMLICML-2010-BouzyM #game studies #learning #multi
Multi-agent Learning Experiments on Repeated Matrix Games (BB, MM), pp. 119–126.
ICMLICML-2010-HoffmanBC #music #parametricity
Bayesian Nonparametric Matrix Factorization for Recorded Music (MDH, DMB, PRC), pp. 439–446.
ICMLICML-2010-MackeyWJ
Mixed Membership Matrix Factorization (LWM, DJW, MIJ), pp. 711–718.
ICMLICML-2010-NakajimaS
Implicit Regularization in Variational Bayesian Matrix Factorization (SN, MS), pp. 815–822.
ICMLICML-2010-NegahbanW #estimation #rank #scalability
Estimation of (near) low-rank matrices with noise and high-dimensional scaling (SN, MJW), pp. 823–830.
ICMLICML-2010-TomiokaSSK #algorithm #learning #performance #rank
A Fast Augmented Lagrangian Algorithm for Learning Low-Rank Matrices (RT, TS, MS, HK), pp. 1087–1094.
ICPRICPR-2010-JammalamadakaJKM #using
Discriminative Basis Selection Using Non-negative Matrix Factorization (AJ, SJ, SK, BSM), pp. 1533–1536.
ICPRICPR-2010-KirbizCG #modelling
Bayesian Inference for Nonnegative Matrix Factor Deconvolution Models (SK, ATC, BG), pp. 2812–2815.
ICPRICPR-2010-Seo #detection #distance
Speaker Change Detection Based on the Pairwise Distance Matrix (JSS), pp. 93–96.
ICPRICPR-2010-YamashitaW #correlation
Subspace Methods with Globally/Locally Weighted Correlation Matrix (YY, TW), pp. 4259–4262.
RecSysRecSys-2010-JamaliE #network #recommendation #social #trust
A matrix factorization technique with trust propagation for recommendation in social networks (MJ, ME), pp. 135–142.
RecSysRecSys-2010-PilaszyZT #dataset #feedback #performance
Fast als-based matrix factorization for explicit and implicit feedback datasets (IP, DZ, DT), pp. 71–78.
RecSysRecSys-2010-ShiLH #collaboration #learning #rank
List-wise learning to rank with matrix factorization for collaborative filtering (YS, ML, AH), pp. 269–272.
SIGIRSIGIR-2010-WangDL #comprehension #documentation #set
Feature subset non-negative matrix factorization and its applications to document understanding (DW, CHQD, TL), pp. 805–806.
SPLCSPLC-2010-Duszynski #diagrams #variability #visualisation
Visualizing and Analyzing Software Variability with Bar Diagrams and Occurrence Matrices (SD), pp. 481–485.
SACSAC-2010-ChenS #3d #interactive #modelling
Modeling cardinal directions in the 3D space with the objects interaction cube matrix (TC, MS), pp. 906–910.
SACSAC-2010-ColantonioPOV #adaptation #approach #clustering #named
ABBA: adaptive bicluster-based approach to impute missing values in binary matrices (AC, RDP, AO, NVV), pp. 1026–1033.
SACSAC-2010-GabrielSN #clustering #similarity #using
Eigenvector-based clustering using aggregated similarity matrices (HHG, MS, AN), pp. 1083–1087.
CASECASE-2010-FrohlichS #automation #constraints #modelling #problem #scheduling #using
Relation matrices for automated MILP modeling of scheduling problems using temporal constraints (RF, SCS), pp. 69–74.
PDPPDP-2010-AlonsoRL #case study #clustering #implementation #manycore #parallel
Experimental Study of Six Different Implementations of Parallel Matrix Multiplication on Heterogeneous Computational Clusters of Multicore Processors (PA, RR, ALL), pp. 263–270.
PDPPDP-2010-UcarC #clustering #modelling #on the #scalability
On the Scalability of Hypergraph Models for Sparse Matrix Partitioning (BU, ÜVÇ), pp. 593–600.
STOCSTOC-2010-Kannan
Spectral methods for matrices and tensors (RK), pp. 1–12.
STOCSTOC-2010-KasiviswanathanRSU #correlation #random
The price of privately releasing contingency tables and the spectra of random matrices with correlated rows (SPK, MR, AS, JU), pp. 775–784.
VMCAIVMCAI-2010-HenzingerHKV #invariant #type inference
Invariant and Type Inference for Matrices (TAH, TH, LK, AV), pp. 163–179.
WCREWCRE-1999-LavalDDB99a #dependence #identification
Identifying Cycle Causes with Enriched Dependency Structural Matrix (JL, SD, SD, AB), pp. 113–122.
DLTDLT-2009-AlmeidaS
Matrix Mortality and the Cerný-Pin Conjecture (JA, BS), pp. 67–80.
DLTDLT-2009-Harju #problem
Post Correspondence Problem and Small Dimensional Matrices (TH), pp. 39–46.
DLTDLT-2009-Zetzsche #petri net
Erasing in Petri Net Languages and Matrix Grammars (GZ), pp. 490–501.
HCIHCD-2009-KobayashiN #guidelines #usability
Mapping of Usability Guidelines onto User’s Temporal Viewpoint Matrix (TK, HN), pp. 75–83.
CIKMCIKM-2009-MaYKL #collaboration #consistency #statistics
Semi-nonnegative matrix factorization with global statistical consistency for collaborative filtering (HM, HY, IK, MRL), pp. 767–776.
ICMLICML-2009-ChengSS #markov #modelling
Matrix updates for perceptron training of continuous density hidden Markov models (CCC, FS, LKS), pp. 153–160.
ICMLICML-2009-LawrenceU #process
Non-linear matrix factorization with Gaussian processes (NDL, RU), pp. 601–608.
KDDKDD-2009-ShenJY #mining
Mining discrete patterns via binary matrix factorization (BHS, SJ, JY), pp. 757–766.
RecSysRecSys-2009-WeimerKB #recommendation
Maximum margin matrix factorization for code recommendation (MW, AK, MB), pp. 309–312.
SIGIRSIGIR-2009-YuZLG #collaboration #parametricity #performance #scalability
Fast nonparametric matrix factorization for large-scale collaborative filtering (KY, SZ, JDL, YG), pp. 211–218.
SASSAS-2009-DrapeV #obfuscation
Creating Transformations for Matrix Obfuscation (SD, IV), pp. 273–292.
SACSAC-2009-Brand #composition #constraints #problem
The sum-of-increments constraint in the consecutive-ones matrix decomposition problem (SB), pp. 1417–1418.
SACSAC-2009-ShenU #approximate #composition #concept #multi
A class of multistep sparse matrix strategies for concept decomposition matrix approximation (CS, MU), pp. 1714–1718.
STOCSTOC-2009-BabaiBS #polynomial
Polynomial-time theory of matrix groups (LB, RB, ÁS), pp. 55–64.
STOCSTOC-2009-NguyenDT #algorithm #approximate #performance #rank
A fast and efficient algorithm for low-rank approximation of a matrix (NHN, TTD, TDT), pp. 215–224.
WICSAWICSA-2008-LaMantiaCMR #design #evolution #scalability #using
Analyzing the Evolution of Large-Scale Software Systems Using Design Structure Matrices and Design Rule Theory: Two Exploratory Cases (MJL, YC, AM, JR), pp. 83–92.
SIGMODSIGMOD-2008-PanZW #clustering #composition #dataset #named #performance #scalability
CRD: fast co-clustering on large datasets utilizing sampling-based matrix decomposition (FP, XZ, WW), pp. 173–184.
LATALATA-2008-Steinberg #sequence #theorem
Subsequence Counting, Matrix Representations and a Theorem of Eilenberg (BS), pp. 6–10.
RTARTA-2008-LafontR #case study #diagrams #orthogonal
Diagram Rewriting for Orthogonal Matrices: A Study of Critical Peaks (YL, PR), pp. 232–245.
CIKMCIKM-2008-HsuC08a #order #performance #web
Efficient web matrix processing based on dual reordering (CMH, MSC), pp. 1389–1390.
CIKMCIKM-2008-MaYLK08a #named #probability #recommendation #social #using
SoRec: social recommendation using probabilistic matrix factorization (HM, HY, MRL, IK), pp. 931–940.
ICMLICML-2008-BiggsGV
Nonnegative matrix factorization via rank-one downdate (MB, AG, SAV), pp. 64–71.
ICMLICML-2008-SalakhutdinovM08a #markov #monte carlo #probability #using
Bayesian probabilistic matrix factorization using Markov chain Monte Carlo (RS, AM), pp. 880–887.
ICPRICPR-2008-BucakG #clustering #incremental
Incremental clustering via nonnegative matrix factorization (SSB, BG), pp. 1–4.
ICPRICPR-2008-CheongL #approach #image #multi #orthogonal #recognition #using
An approach to texture-based image recognition by deconstructing multispectral co-occurrence matrices using Tchebichef orthogonal polynomials (MCYC, KSL), pp. 1–4.
ICPRICPR-2008-DonoserB #segmentation #using
Using covariance matrices for unsupervised texture segmentation (MD, HB), pp. 1–4.
ICPRICPR-2008-DuinP #difference #learning #on the
On refining dissimilarity matrices for an improved NN learning (RPWD, EP), pp. 1–4.
ICPRICPR-2008-KazuiMMF #detection #using
Incoherent motion detection using a time-series Gram matrix feature (MK, MM, SM, HF), pp. 1–5.
ICPRICPR-2008-KinoshenkoMY #distance #image #retrieval
Block-diagonal form of distance matrix for region-based image retrieval (DK, VM, EY), pp. 1–4.
ICPRICPR-2008-LiZ #algorithm #fixpoint #named #performance
FastNMF: A fast monotonic fixed-point non-negative Matrix Factorization algorithm with high ease of use (LL, YJZ), pp. 1–4.
ICPRICPR-2008-ScrippsTCE #approach #predict
A matrix alignment approach for link prediction (JS, PNT, FC, AHE), pp. 1–4.
ICPRICPR-2008-WangWH
Structure and motion factorization under quasi-perspective projection with missing data in tracking matrix (GW, QMJW, WH), pp. 1–4.
KDDKDD-2008-GarrigaJM
Banded structure in binary matrices (GCG, EJ, HM), pp. 292–300.
KDDKDD-2008-HyvonenMT
Interpretable nonnegative matrix decompositions (SH, PM, ET), pp. 345–353.
KDDKDD-2008-SinghG #learning #relational
Relational learning via collective matrix factorization (APS, GJG), pp. 650–658.
RecSysRecSys-2008-RendleS #kernel #modelling #recommendation #scalability
Online-updating regularized kernel matrix factorization models for large-scale recommender systems (SR, LST), pp. 251–258.
RecSysRecSys-2008-TakacsPNT #algorithm #problem
Matrix factorization and neighbor based algorithms for the netflix prize problem (GT, IP, BN, DT), pp. 267–274.
SIGIRSIGIR-2008-WangLZD #analysis #multi #semantics #summary #symmetry
Multi-document summarization via sentence-level semantic analysis and symmetric matrix factorization (DW, TL, SZ, CHQD), pp. 307–314.
CASECASE-2008-HooverMR #3d #detection #image #using
Pose detection of 3-D objects using images sampled on SO(3), spherical harmonics, and wigner-D matrices (RCH, AAM, RGR), pp. 47–52.
DACDAC-2008-Garland #gpu #manycore
Sparse matrix computations on manycore GPU’s (MG), pp. 2–6.
PPoPPPPoPP-2008-DongarraPRV #platform
Matrix product on heterogeneous master-worker platforms (JD, JFP, YR, FV), pp. 53–62.
STOCSTOC-2008-Sherstov #bound #communication #quantum
The pattern matrix method for lower bounds on quantum communication (AAS), pp. 85–94.
SIGMODSIGMOD-2007-FaloutsosKS #graph #mining #scalability #tool support #using
Mining large graphs and streams using matrix and tensor tools (CF, TGK, JS), p. 1174.
LATALATA-2007-KocholKSS #reduction
Reductions of matrices associated with nowhere-zero flows (MK, NK, SS, KS), pp. 297–306.
LATALATA-2007-Stiebe
Slender Siromoney Matrix Languages (RS), pp. 553–564.
DiGRADiGRA-2007-Ferri #game studies #interactive
Narrating machines and interactive matrices: a semiotic common ground for game studies (GF0).
ICEISICEIS-EIS-2007-AmritH #detection #problem #process
Matrix Based Problem Detection in the Application of Software Process Patterns (CA, JvH), pp. 316–320.
ICMLICML-2007-HoiJL #constraints #kernel #learning #parametricity
Learning nonparametric kernel matrices from pairwise constraints (SCHH, RJ, MRL), pp. 361–368.
ICMLICML-2007-KuzminW #kernel #online
Online kernel PCA with entropic matrix updates (DK, MKW), pp. 465–472.
ICMLICML-2007-TomiokaA
Classifying matrices with a spectral regularization (RT, KA), pp. 895–902.
ICMLICML-2007-XueDC #flexibility #learning #multi #process
The matrix stick-breaking process for flexible multi-task learning (YX, DBD, LC), pp. 1063–1070.
KDDKDD-2007-YeJC #analysis #kernel #learning #polynomial #programming
Learning the kernel matrix in discriminant analysis via quadratically constrained quadratic programming (JY, SJ, JC), pp. 854–863.
SIGIRSIGIR-2007-ZhuYCG #classification #using
Combining content and link for classification using matrix factorization (SZ, KY, YC, YG), pp. 487–494.
CASECASE-2007-ChalfounBKP #fault #using
Calibration Using Generalized Error Matrices of a Long Reach Articulated Carrier (JC, CB, DK, YP), pp. 777–782.
CASECASE-2007-YangM #approach #automation #feature model #interactive #verification
Automatic Feasibility Verification of Object Configurations: A New Approach Based on Feature Interaction Matrices (FY, MMM), pp. 686–691.
PDPPDP-2007-TudrujM #clustering #communication #on the fly #parallel
Dynamic SMP Clusters with Communication on the Fly in SoC Technology Applied for Medium-Grain Parallel Matrix Multiplication (MT, LM), pp. 270–277.
STOCSTOC-2007-VuT
The condition number of a randomly perturbed matrix (VHV, TT), pp. 248–255.
ICSTSAT-2007-Kullmann #invariant #polynomial #satisfiability
Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices (OK), pp. 314–327.
ICSTSAT-2007-LynceM #modelling #satisfiability #symmetry
Breaking Symmetries in SAT Matrix Models (IL, JPMS), pp. 22–27.
VMCAIVMCAI-2007-PeronH #abstract domain #bound #constraints
An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints (MP, NH), pp. 268–282.
VLDBVLDB-2006-DrineasM #algorithm #random #set
Randomized Algorithms for Matrices and Massive Data Sets (PD, MWM), p. 1269.
DLTDLT-2006-BellP #bound
Lowering Undecidability Bounds for Decision Questions in Matrices (PB, IP), pp. 375–385.
ICALPICALP-v1-2006-FrandsenF #rank
Dynamic Matrix Rank (GSF, PFF), pp. 395–406.
ICALPICALP-v1-2006-Sankowski #multi
Weighted Bipartite Matching in Matrix Multiplication Time (PS), pp. 274–285.
ICALPICALP-v1-2006-Wolf #bound #quantum
Lower Bounds on Matrix Rigidity Via a Quantum Argument (RdW), pp. 62–71.
RTARTA-2006-HofbauerW #string #termination
Termination of String Rewriting with Matrix Interpretations (DH, JW), pp. 328–342.
CoGCIG-2006-ChongY #adaptation #interactive #self
Self-Adapting Payoff Matrices in Repeated Interactions (SYC, XY0), pp. 103–110.
ICGTICGT-2006-VelascoL #approach #graph transformation #sequence
Matrix Approach to Graph Transformation: Matching and Sequences (PPPV, JdL), pp. 122–137.
CIKMCIKM-2006-OrdonezG #relational
Vector and matrix operations programmed with UDFs in a relational DBMS (CO, JGG), pp. 503–512.
ECIRECIR-2006-Osinski #approximate #clustering #quality
Improving Quality of Search Results Clustering with Approximate Matrix Factorisations (SO), pp. 167–178.
ICMLICML-2006-DeCoste #collaboration #predict #using
Collaborative prediction using ensembles of Maximum Margin Matrix Factorizations (DD), pp. 249–256.
ICMLICML-2006-KulisSD #kernel #learning #rank
Learning low-rank kernel matrices (BK, MAS, ISD), pp. 505–512.
ICMLICML-2006-ZhangK #kernel #performance
Block-quantized kernel matrix for fast spectral embedding (KZ, JTK), pp. 1097–1104.
ICPRICPR-v1-2006-HouZS #estimation
Estimation of the Fundamental Matrix Based on EV Mode (TH, FZ, ZS), pp. 679–682.
ICPRICPR-v1-2006-PflugfelderB
Fundamental matrix and slightly overlapping views (RPP, HB), pp. 527–530.
ICPRICPR-v1-2006-WangL
Characteristic Line of Planar Homography Matrix and Its Applications in Camera Calibration (JW, YL), pp. 147–150.
ICPRICPR-v2-2006-RiggiTA #estimation #invariant #parametricity
Fundamental Matrix Estimation via TIP — Transfer of Invariant Parameters (FR, MT, TA), pp. 21–24.
ICPRICPR-v3-2006-ChenWTG #analysis #empirical #image #statistics
Blind Image Steganalysis Based on Statistical Analysis of Empirical Matrix (XC, YW, TT, LG), pp. 1107–1110.
ICPRICPR-v3-2006-XueTCZ #algorithm #recognition
A Modified Non-negative Matrix Factorization Algorithm for Face Recognition (YX, CST, WSC, WZ), pp. 495–498.
ICPRICPR-v4-2006-HeYTWX #image #novel #retrieval #symmetry #using
Texture Image Retrieval Using Novel Non-separable Filter Banks Based on Centrally Symmetric Matrices (ZH, XY, YYT, PSPW, YX), pp. 161–164.
ICPRICPR-v4-2006-YaoZDLX #correlation #identification #modelling
Directly Modeling of Correlation Matrices for GMM in Speaker Identification (ZY, XZ, BD, ML, YX), pp. 306–309.
ICPRICPR-v4-2006-YuanMZL #recognition #using
Ear Recognition using Improved Non-Negative Matrix Factorization (LY, ZM, YZ, KL), pp. 501–504.
KDDKDD-2006-DingLPP #clustering #orthogonal
Orthogonal nonnegative matrix t-factorizations for clustering (CHQD, TL, WP, HP), pp. 126–135.
KDDKDD-2006-WuCCH #approximate #incremental
Incremental approximate matrix factorization for speeding up support vector machines (GW, EYC, YKC, CJH), pp. 760–766.
CASECASE-2006-ChenYTCW #difference #fuzzy #hybrid #linear
Applying the Linear Matrix Inequality for Hybrid Fuzzy/H-infinity Control of Active Structural Damping (CWC, KY, CHT, CYC, DJW), pp. 678–682.
DACDAC-2006-WongC #performance
A fast passivity test for descriptor systems via structure-preserving transformations of Skew-Hamiltonian/Hamiltonian matrix pencils (NW, CKC), pp. 261–266.
DACDAC-2006-YangCGJ #algorithm #parallel #rank #scalability
A parallel low-rank multilevel matrix compression algorithm for parasitic extraction of electrically large structures (CY, SC, DG, VJ), pp. 1053–1056.
PDPPDP-2006-TsilikasF #benchmark #metric #multi
Comparing Commodity SMP System Software with a Matrix Multiplication Benchmark (GT, MF), pp. 149–152.
IJCARIJCAR-2006-EndrullisWZ #proving #term rewriting #termination
Matrix Interpretations for Proving Termination of Term Rewriting (JE, JW, HZ), pp. 574–588.
ICDARICDAR-2005-LiSC #analysis #multi
A Threshlod Selection Method Based on Multiscale and Graylevel Co-occurrence Matrix Analysis (YL, CYS, MC), pp. 575–579.
ICDARICDAR-2005-SextonS #analysis #semantics
Semantic Analysis of Matrix Structures (APS, VS), pp. 1141–1145.
SIGITESIGITE-2005-SmithS #assessment
Competency matrices for peer assessment of individuals in team projects (HHSI, DLS), pp. 155–162.
DLTDLT-2005-BellP #on the
On the Membership of Invertible Diagonal Matrices (PB, IP), pp. 146–157.
ICMLICML-2005-RennieS #collaboration #performance #predict
Fast maximum margin matrix factorization for collaborative prediction (JDMR, NS), pp. 713–719.
SIGIRSIGIR-2005-XiFFZCYZ #named #similarity #using
SimFusion: measuring similarity using unified relationship matrix (WX, EAF, WF, BZ, ZC, JY, DZ), pp. 130–137.
SACSAC-2005-KoshelevaKMN #np-hard
Computing the cube of an interval matrix is NP-Hard (OK, VK, GM, HTN), pp. 1449–1453.
SACSAC-2005-LawL #constraints #modelling #symmetry #using
Breaking value symmetries in matrix models using channeling constraints (YCL, JHML), pp. 371–376.
SACSAC-2005-ZhangLN
An attribute-based access matrix model (XZ, YL, DN), pp. 359–363.
DATEDATE-2005-KrishnaswamyVMH #evaluation #probability #reliability
Accurate Reliability Evaluation and Enhancement via Probabilistic Transfer Matrices (SK, GFV, ILM, JPH), pp. 282–287.
STOCSTOC-2005-TaoV #on the #random
On random pm 1 matrices: singularity and determinant (TT, VHV), pp. 431–440.
STOCSTOC-2005-Vu #random
Spectral norm of random matrices (VHV), pp. 423–430.
CSLCSL-2005-Soltys #algorithm #proving
Feasible Proofs of Matrix Properties with Csanky’s Algorithm (MS), pp. 493–508.
CBSECBSE-2004-Taborda #component
The Release Matrix for Component-Based Software Systems (LJMT), pp. 100–113.
TPDLECDL-2004-KornbluhFR #repository
Media Matrix: Creating Secondary Repositories (MK, MF, DR), pp. 329–340.
PODSPODS-2004-ZhouW #clustering
Clustering via Matrix Powering (HZ, DPW), pp. 136–142.
VLDBVLDB-2004-JohnsonKCKV #order #scalability #using
Compressing Large Boolean Matrices using Reordering Techniques (DSJ, SK, JC, SK, SV), pp. 13–23.
DLTDLT-2004-Potapov #automaton #multi #problem #reachability
From Post Systems to the Reachability Problems for Matrix Semigroups and Multicounter Automata (IP), pp. 345–356.
ICMLICML-2004-WeinbergerSS #kernel #learning #reduction
Learning a kernel matrix for nonlinear dimensionality reduction (KQW, FS, LKS).
ICMLICML-2004-Ye #approximate #rank
Generalized low rank approximations of matrices (JY).
ICMLICML-2004-ZhangYK #algorithm #kernel #learning #using
Bayesian inference for transductive learning of kernel matrix using the Tanner-Wong data augmentation algorithm (ZZ, DYY, JTK).
ICPRICPR-v1-2004-BuciuP #recognition
Application of non-Negative and Local non Negative Matrix Factorization to Facial Expression Recognition (IB, IP), pp. 288–291.
ICPRICPR-v1-2004-Zwiggelaar #automation #segmentation
Texture Based Segmentation: Automatic Selection of Co-Occurrence Matrices (RZ), pp. 588–591.
KDDKDD-2004-BanerjeeDGMM #approach #approximate #clustering
A generalized maximum entropy approach to bregman co-clustering and matrix approximation (AB, ISD, JG, SM, DSM), pp. 509–514.
KDDKDD-2004-ChilsonNWZ #correlation #parallel #robust
Parallel computation of high dimensional robust correlation and covariance matrices (JC, RTN, AW, RHZ), pp. 533–538.
KDDKDD-2004-DavidsonGST #algorithm #approach #data mining #mining #quality
A general approach to incorporate data quality matrices into data mining algorithms (ID, AG, AS, GKT), pp. 794–798.
DACDAC-2004-GopeCJ #modelling #multi #performance #rank
A fast parasitic extractor based on low-rank multilevel matrix compression for conductor and dielectric modeling in microelectronics and MEMS (DG, SC, VJ), pp. 794–799.
DATEDATE-v2-2004-MeiVVL #architecture #case study #configuration management #design
Design Methodology for a Tightly Coupled VLIW/Reconfigurable Matrix Architecture: A Case Study (BM, SV, DV, RL), pp. 1224–1229.
HPDCHPDC-2004-WeinbergJDFH #execution #query #using
Gridflow Description, Query, and Execution at SCEC using the SDSC Matrix (JW, AJ, AD, MF, YH), pp. 262–263.
DRRDRR-2003-FaconY #segmentation
Morphological postal envelope segmentation by co-occurrence matrix (JF, EAY), pp. 294–304.
ICDARICDAR-2003-ToshihiroM #detection #documentation #image #segmentation
Detection of Matrices and Segmentation of Matrix Elements in Scanned Images of Scientific Documents (KT, SM), pp. 433–437.
ICALPICALP-2003-BlondelD #graph #similarity
Similarity Matrices for Pairs of Graphs (VDB, PVD), pp. 739–750.
KDDKDD-2003-El-HajjZ #dataset #interactive #mining #performance #scalability
Inverted matrix: efficient discovery of frequent items in large datasets in the context of interactive mining (MEH, ORZ), pp. 109–118.
SIGIRSIGIR-2003-XuLG #clustering #documentation
Document clustering based on non-negative matrix factorization (WX, XL, YG), pp. 267–273.
PPoPPPPoPP-2003-FrensW #memory management #parallel
Factorization with morton-ordered quadtree matrices for memory re-use and parallelism (JDF, DSW), pp. 144–154.
ICMLICML-2002-LanckrietCBGJ #kernel #learning #programming
Learning the Kernel Matrix with Semi-Definite Programming (GRGL, NC, PLB, LEG, MIJ), pp. 323–330.
ICPRICPR-v2-2002-GuillametSV #classification #image
Analyzing Non-Negative Matrix Factorization for Image Classification (DG, BS, JV), pp. 116–119.
ICPRICPR-v2-2002-GuillametV #metric #using
Determining a Suitable Metric when Using Non-Negative Matrix Factorization (DG, JV), pp. 128–131.
ICPRICPR-v2-2002-RothW #algorithm
Some Improvements on Two Autocalibration Algorithms Based on the Fundamental Matrix (GR, AW), p. 312–?.
ICPRICPR-v2-2002-Vaswani #classification #linear
A Linear Classifier for Gaussian Class Conditional Distributions with Unequal Covariance Matrices (NV), pp. 60–63.
DATEDATE-2002-VanasscheGS #behaviour #modelling #using
Constructing Symbolic Models for the Input/Output Behavior of Periodically Time-Varying Systems Using Harmonic Transfer Matrices (PV, GGEG, WMCS), pp. 279–284.
DATEDATE-2002-XuM
Formulation of Low-Order Dominant Poles for Y-Matrix of Interconnects (QX, PM), pp. 820–825.
STOCSTOC-2002-Raz #complexity #on the
On the complexity of matrix product (RR), pp. 144–151.
ICDARICDAR-2001-BogushMAUK #correlation #image #performance
An Efficient Correlation Computation Method for Binary Images Based on Matrix Factorisation (RB, SM, SA, SU, SiK), pp. 312–316.
ITiCSEITiCSE-2001-KorhonenMS #algorithm #animation #concept #named #simulation
Matrix — concept animation and algorithm simulation system (AK, LM, RS), p. 180.
DLTDLT-2001-Harju #integer
Decision Questions on Integer Matrices (TH), pp. 57–68.
SIGIRSIGIR-2001-MillerRS #algorithm #using
Modifications of Kleinberg’s HITS Algorithm Using Matrix Exponentiation and WebLog Records (JCM, GR, FS), pp. 444–445.
PPoPPPPoPP-2001-WiseFGA
Language support for Morton-order matrices (DSW, JDF, YG, GAA), pp. 24–33.
STOCSTOC-2001-AchlioptasM #performance #rank
Fast computation of low rank matrix (DA, FM), pp. 611–618.
STOCSTOC-2001-FischerN #testing
Testing of matrix properties (EF, IN), pp. 286–295.
STOCSTOC-2001-JerrumSV #algorithm #approximate #polynomial
A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries (MJ, AS, EV), pp. 712–721.
STOCSTOC-2001-RazS #bound
Lower bounds for matrix product, in bounded depth circuits with arbitrary gates (RR, AS), pp. 409–418.
ICMLICML-2000-SmolaS #approximate #machine learning
Sparse Greedy Matrix Approximation for Machine Learning (AJS, BS), pp. 911–918.
ICPRICPR-v1-2000-HaymanKM #self
Self-Alignment of an Active Head from Observations of Rotation Matrices (EH, JK, DWM), pp. 1080–1084.
ICPRICPR-v1-2000-IsgroT
A General Rank-2 Parameterization of the Fundamental Matrix (FI, ET), pp. 1868–1871.
ICPRICPR-v1-2000-WangT #composition
An SVD Decomposition of Essential Matrix with Eight Solutions for the Relative Positions of Two Perspective Cameras (WW, HTT), pp. 1362–1365.
ICPRICPR-v2-2000-CarcassoniH #proximity
An Improved Point Proximity Matrix for Modal Matching (MC, ERH), pp. 2034–2037.
ICPRICPR-v2-2000-MetzlerAPL #classification #image #multi
Texture Classification of Graylevel Images by Multiscale Cross-Cooccurrence Matrices (VM, TA, CP, TML), pp. 2549–2552.
ICPRICPR-v3-2000-AlbregtsenND #adaptation #distance
Adaptive Gray Level Run Length Features from Class Distance Matrices (FA, BN, HED), pp. 3746–3749.
ICPRICPR-v3-2000-Perez-CordobaRST
Channel Optimized Matrix Quantizer (COMQ) in CELP Coding (JLPC, AJR, VES, ÁdlT), pp. 3270–3273.
SIGIRSIGIR-2000-SrinivasanP #documentation #retrieval
Phonetic confusion matrix based spoken document retrieval (SS, DP), pp. 81–87.
HPCAHPCA-2000-ChatterjeeS
Cache-Efficient Matrix Transposition (SC, SS), pp. 195–205.
STOCSTOC-2000-Fortune #integer #symmetry
Exact computations of the inertia symmetric integer matrices (SF), pp. 556–564.
STOCSTOC-2000-Furer #approximate
Approximating permanents of complex matrices (MF), pp. 667–669.
STOCSTOC-2000-OlshevskyS #confluence
Matrix-vector product for confluent Cauchy-like matrices with application to confluent rational interpolation (VO, MAS), pp. 573–581.
IWPCIWPC-1999-KesslerS #approach #automation #comprehension
The SPARAMAT Approach to Automatic Comprehension of Sparse Matrix Computations (CWK, CS), pp. 200–207.
DLTDLT-1999-Stiebe
Slender matrix languages (RS), pp. 375–385.
ICALPICALP-1999-OlshevskyP #evaluation #polynomial
Polynomial and Rational Evaluation and Interpolation (with Structured Matrices) (VO, VYP), pp. 585–594.
ICALPICALP-1999-Tiskin #named #parallel
Erratum: Bulk-synchronous Parallel Multiplication of Boolean Matrices (AT), pp. 717–718.
ICFPICFP-1999-Okasaki #performance
From Fast Exponentiation to Square Matrices: An Adventure in Types (CO), pp. 28–35.
HCIHCI-CCAD-1999-LiangL #metric #process #representation
Information representation and decision process: effects of measurement scale and shape of decision matrix on preferential choice (SFML, MRL), pp. 62–65.
HCIHCI-EI-1999-Baumann #evaluation #feedback #usability
Matrix Evaluation Method for Planned Usability Improvements Based on Customer Feedback (KB), pp. 701–705.
SACSAC-1999-DumitrescuL #coordination #performance #reliability
Reliable and Efficient Matrix Processing with the Specification-Consistent Coordination Model (RAD, EFAL), pp. 191–193.
SACSAC-1999-RauberR99a
Matrix Computations Behind the Hierarchical Radiosity Method (TR, GR), pp. 533–540.
SACSAC-1999-Rivera-Gallego #algorithm #distance #problem #search-based
A Genetic Algorithm for Solving the Euclidean Distance Matrices Completion Problem (WRG), pp. 286–290.
PDPPDP-1999-DoalloFZ #modelling #performance
Direct mapped cache performance modeling for sparse matrix operations (RD, BBF, ELZ), pp. 331–338.
STOCSTOC-1999-PanC #complexity #problem
The Complexity of the Matrix Eigenproblem (VYP, ZQC), pp. 507–516.
ICALPICALP-1998-BiniCMM
Inversion of Circulant Matrices over Zm (DB, GMDC, GM, LM), pp. 719–730.
ICALPICALP-1998-Tiskin #parallel
Bulk-Synchronous Parallel Multiplication of Boolean Matrices (AT), pp. 494–506.
SIGIRSIGIR-1998-LagergrenO #empirical #information retrieval #interactive
Comparing Interactive Information Retrieval systems Across Sites: The TREC-6 Interactive Track Matrix Experiment (EL, PO), pp. 164–172.
PDPPDP-1998-VesztergombiORV #algorithm #architecture #multi #scalability
Scalable matrix multiplication algorithm for IRAM architecture machine (GV, , FR, GV), pp. 367–372.
STOCSTOC-1998-LinialSW #algorithm #approximate #polynomial #scalability
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents (NL, AS, AW), pp. 644–652.
ICDARICDAR-1997-SabourinDW #verification
Shape Matrices as a Mixed Shape Factor for Off-line Signature Verification (RS, JPD, ESW), pp. 661–666.
SACSAC-1997-TheobaldWB #concept #design
Design concepts for matrices and lattices in LiDIA (PT, SW, WB), pp. 532–536.
PDPPDP-1997-VesztergombiORVT #architecture #parallel #scalability #string
Boolean matrix exponentiation: A case story for a scalable massively parallel matrix machine with string architecture (GV, , FR, GV, FT), pp. 461–467.
ICPRICPR-1996-DeguchiN #interactive #using #visual notation
Visual servoing using eigenspace method and dynamic calculation of interaction matrices (KD, TN), pp. 302–306.
ICPRICPR-1996-Hauta-KasariPJL #analysis #multi
Generalized co-occurrence matrix for multispectral texture analysis (MHK, JP, TJ, RL), pp. 785–789.
PDPPDP-1996-Lloyd #parallel #scalability
Parallel Formulations of Matrix-Vector Multiplication for Matrices with Large Aspect Ratios (JL), pp. 102–108.
PDPPDP-1996-MollarH #distributed #memory management #multi
Computing the Singular Values of the Product of Two Matrices in Distributed Memory Multiprocessors (MM, VH), pp. 15–21.
STOCSTOC-1996-AllenderBO #complexity #equation #linear #rank
The Complexity of Matrix Rank and Feasible Systems of Linear Equations (EA, RB, MO), pp. 161–167.
CADECADE-1996-SchmittK #proving
Converting Non-Classical Matrix Proofs into Sequent-Style Systems (SS, CK), pp. 418–432.
ICDARICDAR-v1-1995-ChiuTC #invariant #recognition #using
Invariant handwritten Chinese character recognition using weighted ring-data matrix (HPC, DCT, JCC), pp. 116–119.
ICALPICALP-1995-GiancarloG #algorithm #on the
On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications (RG, RG), pp. 111–122.
CIKMCIKM-1995-DashH #knowledge base #multi #semantics
The Semantic Matrix Model (SMM): A Knowledge Based Solution to Semantic Homogeneity in Multidatabases (KID, ARH), pp. 122–128.
SACSAC-1995-LiangL #algorithm #representation #scheduling #search-based #using
A sparse matrix representation for production scheduling using genetic algorithms (SJTL, JML), pp. 313–317.
SACSAC-1995-LuoD #algorithm #parallel #scalability
A scalable parallel Strassen’s matrix multiplication algorithm for distributed-memory computers (QL, JBD), pp. 221–226.
DACDAC-1995-NakamuraY #clustering #logic #optimisation #scalability
A Partitioning-Based Logic Optimization Method for Large Scale Circuits with Boolean Matrix (YN, TY), pp. 653–657.
PDPPDP-1995-BadiaV #multi #performance #problem #symmetry
Efficient solution of the eigenproblem of banded symmetric Toeplitz matrices on multicomputers (JMB, AMV), pp. 416–423.
PDPPDP-1995-LuoUX
Continuous-time computation of the eigenvectors of a class of positive definite matrices (FLL, RU, HX), pp. 464–471.
PDPPDP-1995-Ralha #algorithm #parallel #symmetry
Parallel QR algorithm for the complete eigensystem of symmetric matrices (RMSR), pp. 480–485.
DACDAC-1993-MotoharaHMMKSS #algorithm #traversal #using
A State Traversal Algorithm Using a State Covariance Matrix (AM, TH, MM, HM, KK, YS, SS), pp. 97–101.
PDPPDP-1993-HuesoHM #algorithm #equation
Systolic algorithms for matrix functions via the commutant equation (JLH, VH, GM), pp. 222–229.
PDPPDP-1993-LawsonMH #named #using
SMART: a neurocomputer using sparse matrices (JCL, NM, JH), pp. 59–64.
PDPPDP-1993-StuartW #algorithm #array #parallel #scalability #set #symmetry #using
An algorithm far the parallel computation of subsets of eigenvalues and associated eigenvectors of large symmetric matrices using an array processor (EJS, JSW), pp. 211–217.
STOCSTOC-1993-HershbergerS #metric
Matrix searching with the shortest path metric (JH, SS), pp. 485–494.
STOCSTOC-1993-PapadimitriouY #linear #programming
Linear programming without the matrix (CHP, MY), pp. 121–129.
CSCWCSCW-1992-JeffayLMSS #architecture #collaboration
Architecture of the Artifact-Based Collaboration System Matrix (KJ, JKL, JM, FDS, JBS), pp. 195–202.
STOCSTOC-1992-FeigeL #on the #random
On the Hardness of Computing the Permanent of Random Matrices (UF, CL), pp. 643–654.
STOCSTOC-1992-VenkatesanR #problem
Average Case Intractability of Matrix and Diophantine Problems (RV, SR), pp. 632–642.
ICALPICALP-1991-BiniGP #parallel
Improved Parallel Computations with Matrices and Polynomials (DB, LG, VYP), pp. 520–531.
CHICHI-1991-HammondBCHMY #design #modelling
Modelling user, system design: results of a scenarios matrix exercise (NH, PJB, JC, MDH, AM, RMY), pp. 377–380.
DACDAC-1991-HoS #flexibility
Flexible Transistor Matrix (FTM) (KCH, SS), pp. 475–480.
DACDAC-1990-SinghC #layout #order
A Transistor Reordering Technique for Gate Matrix Layout (US, CYRC), pp. 462–467.
DACDAC-1989-IrwinO #2d #comparison #layout #tool support
A Comparison of Four Two-dimensional Gate Matrix Layout Tools (MJI, RMO), pp. 698–701.
DACDAC-1989-LinDY #2d #layout #synthesis
Gate Matrix Layout Synthesis with Two-Dimensional Folding (IL, DHCD, SHCY), pp. 37–42.
DACDAC-1989-SadayappanV #performance #simulation
Efficient Sparse Matrix Factorization for Circuit Simulation on Vector Supercomputers (PS, VV), pp. 13–18.
ICALPICALP-1988-DietzfelbingerM #complexity #turing machine
The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape (MD, WM), pp. 188–200.
CADECADE-1988-MalkinM #generative #logic #testing
Logical Matrix Generation and Testing (PKM, EPM), pp. 685–693.
CADECADE-1988-Socher #algorithm
A Subsumption Algorithm Based on Characteristic Matrices (RS), pp. 573–581.
FPCAFPCA-1987-Wise #algebra #programming
Matrix algebra and applicative programming (DSW), pp. 134–153.
DACDAC-1987-ChangCH #approach #automation #generative #layout #using
Automated Layout Generation Using Gate Matrix Approach (YCC, SCC, LHH), pp. 552–558.
STOCSTOC-1987-CoppersmithW #multi
Matrix Multiplication via Arithmetic Progressions (DC, SW), pp. 1–6.
STOCSTOC-1987-MulmuleyVV
Matching Is as Easy as Matrix Inversion (KM, UVV, VVV), pp. 345–354.
ICALPICALP-1986-Mascle
Torsion Matrix Semigroups and Recognizable Transductions (JPM), pp. 244–253.
DACDAC-1986-FreemanKLN #automation #layout #modelling
Automated extraction of SPICE circuit models from symbolic gate matrix layout with pruning (RDF, SMK, CGLH, MLN), pp. 418–424.
STOCSTOC-1986-Mulmuley #algorithm #parallel #performance #rank
A Fast Parallel Algorithm to Compute the Rank of a Matrix over an Arbitrary Field (KM), pp. 338–339.
ICALPICALP-1985-VarmanR #array #multi #on the #using
On Matrix Multiplication Using Array Processors (PJV, IVR), pp. 487–496.
STOCSTOC-1985-Lubiw #order
Doubly Lexical Orderings of Matrices (AL), pp. 396–404.
ICALPICALP-1984-Ferment #product line
Principality Results About Some Matrix Languages Families (DF), pp. 151–161.
ICALPICALP-1984-Jung #complexity #on the #performance #probability #problem
On Probabilistic Tape Complexity and Fast Circuits for Matrix Inversion Problems (HJ), pp. 281–291.
DACDAC-1982-KangKL #adaptation #cpu #design #evolution #layout #logic #random
Gate matrix layout of random control logic in a 32-bit CMOS CPU chip adaptable to evolving logic design (SMK, RHK, HFSL), pp. 170–174.
CADECADE-1982-Caferra #proving #reduction #validation
Proof by Matrix Reduction as Plan + Validation (RC), pp. 309–325.
PLDISCC-1979-Pleban #compilation #recursion #using
The use of transition matrices in a recursive-descent compiler (UFP), pp. 144–151.
VLDBVLDB-1978-Ashany #analysis #classification #database #retrieval #scalability
Application of Sparse Matrix Techniques to Search, Retrieval, Classification and Relationship Analysis in Large Data Base Systems — SPARCOM (RA), pp. 499–516.
ICALPICALP-1977-Jacob #french
Complexite des Demi-Groupes de Matrices (GJ), pp. 269–281.
ICALPICALP-1974-Fischer #algorithm
Further Schemes for Combining Matrix Algorithms (PCF), pp. 428–436.
ICALPICALP-1974-FischerP #algorithm #performance #using
Efficient Procedures for Using Matrix Algorithms (PCF, RLP), pp. 413–427.
STOCSTOC-1974-Kirkpatrick #graph
Determining Graph Properties from Matrix Representations (DGK), pp. 84–90.
STOCSTOC-1974-Pratt #multi #power of
The Power of Negative Thinking in Multiplying Boolean Matrices (VRP), pp. 80–83.
STOCSTOC-1973-HopcroftM #complexity #multi
Duality Applied to the Complexity of Matrix Multiplications and other Bilinear Forms (JEH, JM), pp. 73–87.
STOCSTOC-1971-Fiduccia #multi #performance
Fast Matrix Multiplication (CMF), pp. 45–49.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.