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
linear
Google linear

Tag #linear

1361 papers:

POPLPOPL-2020-AschieriG #concurrent #functional #logic #parallel #proving #source code
Par means parallel: multiplicative linear logic proofs as concurrent functional programs (FA, FAG), p. 28.
POPLPOPL-2020-BansalNS #coordination #source code #specification #synthesis
Synthesis of coordination programs from linear temporal specifications (SB, KSN, YS), p. 27.
POPLPOPL-2020-BrunelMP #λ-calculus
Backpropagation in the simply typed lambda-calculus with linear negation (AB, DM, MP), p. 27.
POPLPOPL-2020-SmolkaFHKKS #algebra #source code #testing #verification
Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time (SS, NF, JH, TK, DK, AS0), p. 28.
ASPLOSASPLOS-2020-HildebrandKTLA #automation #integer #memory management #named #programming #using
AutoTM: Automatic Tensor Movement in Heterogeneous Memory Systems using Integer Linear Programming (MH, JK, ST, JLP, VA), pp. 875–890.
ASPLOSASPLOS-2020-Mathur0 #using
Atomicity Checking in Linear Time using Vector Clocks (UM, MV0), pp. 183–199.
CCCC-2020-ChidaKITS #algorithm #parsing
Is stateful packrat parsing really linear in practice? a counter-example, an improved grammar, and its parsing algorithms (NC, YK, DI, KT, KS), pp. 155–166.
CSLCSL-2020-AcclavioM #logic #multi
Generalized Connectives for Multiplicative Linear Logic (MA, RM), p. 16.
CSLCSL-2020-BarloyFLM #robust #sequence
A Robust Class of Linear Recurrence Sequences (CB, NF, NL, FM), p. 16.
CIAACIAA-2019-0001M #composition #top-down #transducer
Composition Closure of Linear Weighted Extended Top-Down Tree Transducers (ZF0, AM), pp. 133–145.
CIAACIAA-2019-Beier0 #automaton #finite
Semi-linear Lattices and Right One-Way Jumping Finite Automata (Extended Abstract) (SB, MH0), pp. 70–82.
DLTDLT-2019-AzfarCCJ #bound #matrix #set
A Linear Bound on the K-Rendezvous Time for Primitive Sets of NZ Matrices (UA, CC, LC, RMJ), pp. 59–73.
FSCDFSCD-2019-Felty #framework #hybrid #logic
A Linear Logical Framework in Hybrid (Invited Talk) (APF), p. 2.
FSCDFSCD-2019-HeijltjesHS #first-order #logic #proving
Proof Nets for First-Order Additive Linear Logic (WH, DJDH, LS), p. 22.
FSCDFSCD-2019-Horne #logic #probability #proving
The Sub-Additives: A Proof Theory for Probabilistic Choice extending Linear Logic (RH), p. 16.
ICFP-2019-LindenhoviusMZ #recursion
Mixed linear and non-linear recursive types (BL, MWM, VZ), p. 29.
ICFP-2019-StrydonckPD #compilation
Linear capabilities for fully abstract compilation of separation-logic-verified code (TVS, FP, DD), p. 29.
ICMLICML-2019-Becker-Ehmck0S
Switching Linear Dynamics for Variational Bayes Filtering (PBE, JP0, PvdS), pp. 553–562.
ICMLICML-2019-BeygelzimerPSTW #algorithm #classification #multi #performance
Bandit Multiclass Linear Classification: Efficient Algorithms for the Separable Case (AB, DP, BS, DT, CYW, CZ), pp. 624–633.
ICMLICML-2019-CanGZ #convergence #probability
Accelerated Linear Convergence of Stochastic Momentum Methods in Wasserstein Distances (BC, MG, LZ), pp. 891–901.
ICMLICML-2019-CinelliKCPB #analysis #modelling
Sensitivity Analysis of Linear Structural Causal Models (CC, DK, BC, JP, EB), pp. 1252–1261.
ICMLICML-2019-DaoGERR #algorithm #learning #performance #using
Learning Fast Algorithms for Linear Transforms Using Butterfly Factorizations (TD, AG, ME, AR, CR), pp. 1517–1527.
ICMLICML-2019-DoanMR #analysis #approximate #distributed #finite #learning #multi
Finite-Time Analysis of Distributed TD(0) with Linear Function Approximation on Multi-Agent Reinforcement Learning (TTD, STM, JR), pp. 1626–1635.
ICMLICML-2019-DuH #matter #network #optimisation
Width Provably Matters in Optimization for Deep Linear Neural Networks (SSD, WH), pp. 1655–1664.
ICMLICML-2019-GengYKK #modelling #visual notation
Partially Linear Additive Gaussian Graphical Models (SG, MY, MK, SK), pp. 2180–2190.
ICMLICML-2019-HaninR #complexity #network
Complexity of Linear Regions in Deep Networks (BH, DR), pp. 2596–2604.
ICMLICML-2019-HsiehLBK
Stay With Me: Lifetime Maximization Through Heteroscedastic Linear Bandits With Reneging (PCH, XL0, AB, PRK), pp. 2800–2809.
ICMLICML-2019-KempkaKW #adaptation #algorithm #invariant #learning #modelling #online
Adaptive Scale-Invariant Online Algorithms for Learning Linear Models (MK, WK, MKW), pp. 3321–3330.
ICMLICML-2019-KuninBGS
Loss Landscapes of Regularized Linear Autoencoders (DK, JMB, AG, CS), pp. 3560–3569.
ICMLICML-2019-LiCW #algorithm #classification #kernel #quantum #sublinear
Sublinear quantum algorithms for training linear and kernel-based classifiers (TL, SC, XW), pp. 3815–3824.
ICMLICML-2019-SarkarR #finite #identification
Near optimal finite time identification of arbitrary linear dynamical systems (TS, AR), pp. 5610–5618.
ICMLICML-2019-Streeter #learning
Learning Optimal Linear Regularizers (MS), pp. 5996–6004.
ICMLICML-2019-Wang019a #difference #on the #privacy
On Sparse Linear Regression in the Local Differential Privacy Model (DW, JX0), pp. 6628–6637.
ICMLICML-2019-WeiDGG #modelling
Generalized Linear Rule Models (DW, SD, TG, OG), pp. 6687–6696.
ICMLICML-2019-YuJY #analysis #communication #distributed #on the #optimisation #performance
On the Linear Speedup Analysis of Communication Efficient Momentum SGD for Distributed Non-Convex Optimization (HY, RJ, SY), pp. 7184–7193.
KDDKDD-2019-WuZ #ambiguity #analysis #reduction
Disambiguation Enabled Linear Discriminant Analysis for Partial Label Dimensionality Reduction (JHW, MLZ), pp. 416–424.
KDDKDD-2019-ZhengXKWMAY #predict #using
Glaucoma Progression Prediction Using Retinal Thickness via Latent Space Linear Regression (YZ, LX, TK, JW0, HM, RA, KY), pp. 2278–2286.
ECOOPECOOP-2019-MakwanaK #algebra #named
NumLin: Linear Types for Linear Algebra (DCM, NRK), p. 25.
ECOOPECOOP-2019-ShaikhhaP #algebra #polymorphism
Finally, a Polymorphic Linear Algebra Language (Pearl) (AS, LP), p. 29.
OOPSLAOOPSLA-2019-NearDASGWSZSSS #difference #higher-order #named #privacy #type system
Duet: an expressive higher-order language and linear type system for statically enforcing differential privacy (JPN, DD, CA, TS, PG, LW, NS, MZ0, NS, AS, DS), p. 30.
POPLPOPL-2019-AcetoAFIL #branch
Adventures in monitorability: from branching to linear time and back again (LA, AA, AF, AI, KL), p. 29.
POPLPOPL-2019-BonchiHPSZ #algebra #concurrent #diagrams
Diagrammatic algebra: from linear to concurrent systems (FB, JH, RP, PS, FZ), p. 28.
POPLPOPL-2019-SkorstengaardDB #control flow #encapsulation #named #stack #using
StkTokens: enforcing well-bracketed control flow and stack encapsulation using linear capabilities (LS, DD, LB), p. 28.
PPDPPPDP-2019-CondoluciAC #similarity
Sharing Equality is Linear (AC, BA, CSC), p. 14.
SASSAS-2019-YuM #parametricity #performance #programming
An Efficient Parametric Linear Programming Solver and Application to Polyhedral Projection (HY, DM), pp. 203–224.
SLESLE-2019-WeidmannALS #consistency #graph grammar #programming
Consistency management via a combination of triple graph grammars and linear programming (NW, AA, EL, AS), pp. 29–41.
CASECASE-2019-DongKDBDG #automation #multi
Automating Planar Object Singulation by Linear Pushing with Single-point and Multi-point Contacts (ZD, SK, SD, AB, MD, KG), pp. 1429–1436.
CAVCAV-2019-SotoHSZ #automaton #hybrid #synthesis
Membership-Based Synthesis of Linear Hybrid Automata (MGS, TAH, CS0, LZ), pp. 297–314.
DLTDLT-2018-GuillonPPP #automaton
Two-Way Automata and One-Tape Machines - Read Only Versus Linear Time (BG, GP, LP, DP), pp. 366–378.
FSCDFSCD-2018-BellinH #logic #proving
Proof Nets for Bi-Intuitionistic Linear Logic (GB, WH), p. 18.
CIKMCIKM-2018-HuNY #framework #performance #predict
A Fast Linear Computational Framework for User Action Prediction in Tencent MyApp (YH, DN, JY), pp. 2047–2055.
CIKMCIKM-2018-LiangYTLYXZ #modelling #optimisation
Optimizing Generalized Linear Models with Billions of Variables (YL, YY, MT, CL, WY, WX, RZ), pp. 2155–2163.
ECIRECIR-2018-YangOMMF #on the #word
On the Reproducibility and Generalisation of the Linear Transformation of Word Embeddings (XY0, IO, RM, CM, AF), pp. 263–275.
ICMLICML-2018-AbeilleL #bound #polynomial #problem
Improved Regret Bounds for Thompson Sampling in Linear Quadratic Control Problems (MA, AL), pp. 1–9.
ICMLICML-2018-AndoniLSZZ
Subspace Embedding and Linear Regression with Orlicz Norm (AA, CL0, YS0, PZ, RZ), pp. 224–233.
ICMLICML-2018-BartlettHL
Gradient descent with identity initialization efficiently learns positive definite linear transformations (PLB, DPH, PML), pp. 520–529.
ICMLICML-2018-CohenHKLMT #online #polynomial
Online Linear Quadratic Control (AC, AH, TK, NL, YM, KT), pp. 1028–1037.
ICMLICML-2018-DeshpandeMST #adaptation #modelling
Accurate Inference for Adaptive Linear Models (YD, LWM, VS, MT), pp. 1202–1211.
ICMLICML-2018-Fazel0KM #convergence #policy #polynomial
Global Convergence of Policy Gradient Methods for the Linear Quadratic Regulator (MF, RG0, SMK, MM), pp. 1466–1475.
ICMLICML-2018-GhodsLGS #retrieval
Linear Spectral Estimators and an Application to Phase Retrieval (RG, ASL, TG, CS), pp. 1729–1738.
ICMLICML-2018-JanzingS #detection #modelling #multi
Detecting non-causal artifacts in multivariate linear regression models (DJ, BS), pp. 2250–2258.
ICMLICML-2018-LaurentB #network
Deep Linear Networks with Arbitrary Loss: All Local Minima Are Global (TL0, JvB), pp. 2908–2913.
ICMLICML-2018-PangDZ #analysis #network
Max-Mahalanobis Linear Discriminant Analysis Networks (TP, CD, JZ0), pp. 4013–4022.
ICMLICML-2018-PretoriusKK #learning
Learning Dynamics of Linear Denoising Autoencoders (AP, SK, HK), pp. 4138–4147.
ICMLICML-2018-SerraTR #bound #network
Bounding and Counting Linear Regions of Deep Neural Networks (TS, CT, SR), pp. 4565–4573.
ICMLICML-2018-TaoBZ #dependence #identification
Best Arm Identification in Linear Bandits with Linear Dimension Dependency (CT, SAB, YZ0), pp. 4884–4893.
ICMLICML-2018-TuR #difference #learning #polynomial
Least-Squares Temporal Difference Learning for the Linear Quadratic Regulator (ST, BR), pp. 5012–5021.
ICPRICPR-2018-ChangWZ #network #performance #self
Piecewise Linear Units for Fast Self-Normalizing Neural Networks (YC, XW, SZ), pp. 429–434.
ICPRICPR-2018-DhakaIS #behaviour #modelling
Latent Linear Dynamics for Modeling Pedestrian Behaviors (DD, MI, AS), pp. 1592–1597.
ICPRICPR-2018-GaoSXL #classification #image #kernel #set
Kernel Dual Linear Regression for Face Image Set Classification (XG, QS, HX, YL), pp. 1542–1547.
ICPRICPR-2018-GrelssonF #exponential #learning #network
Improved Learning in Convolutional Neural Networks with Shifted Exponential Linear Units (ShELUs) (BG, MF), pp. 517–522.
ICPRICPR-2018-QiuXC #flexibility #named #network
FReLU: Flexible Rectified Linear Units for Improving Convolutional Neural Networks (SQ, XX, BC), pp. 1223–1228.
ICPRICPR-2018-XuZL18a #incremental #kernel #learning #online
A Linear Incremental Nyström Method for Online Kernel Learning (SX, XZ, SL), pp. 2256–2261.
ICPRICPR-2018-ZhangSW #network #problem
Cascade Deep Networks for Sparse Linear Inverse Problems (HZ, HS, WW), pp. 812–817.
ICPRICPR-2018-ZhangW #reduction
Linear Discriminative Sparsity Preserving Projections for Dimensionality Reduction (JZ, JW), pp. 159–164.
ICPRICPR-2018-ZhaoSJ #integer #locality #programming #using
Temporal Pattern Localization using Mixed Integer Linear Programming (RZ, GS, QJ), pp. 1361–1365.
KDDKDD-2018-ChuHHWP #consistency #network
Exact and Consistent Interpretation for Piecewise Linear Neural Networks: A Closed Form Solution (LC, XH, JH, LW, JP), pp. 1244–1253.
KDDKDD-2018-DahiyaKW #algebra #empirical #evaluation #sketching
An Empirical Evaluation of Sketching for Numerical Linear Algebra (YD, DK, DPW), pp. 1292–1300.
LOPSTRLOPSTR-2018-PapapanagiotouF #approach #composition #logic #process #scalability #using
A Pragmatic, Scalable Approach to Correct-by-Construction Process Composition Using Classical Linear Logic Inference (PP, JDF), pp. 77–93.
PLDIPLDI-2018-AcharyaB0 #integer #programming
Polyhedral auto-transformation with no integer linear programming (AA, UB, AC0), pp. 529–542.
POPLPOPL-2018-BernardyBNJS #haskell #higher-order #polymorphism
Linear Haskell: practical linearity in a higher-order polymorphic language (JPB, MB, RRN, SPJ, AS), p. 29.
POPLPOPL-2018-FarzanK #game studies #synthesis
Strategy synthesis for linear arithmetic games (AF, ZK), p. 30.
SASSAS-2018-RanzatoZ #abstract domain
Invertible Linear Transforms of Numerical Abstract Domains (FR, MZ), pp. 344–363.
ASPLOSASPLOS-2018-MalekiB #automation #parallel
Automatic Hierarchical Parallelization of Linear Recurrences (SM, MB), pp. 128–138.
CASECASE-2018-DanielczukMCG #policy
Linear Push Policies to Increase Grasp Access for Robot Bin Picking (MD, JM, CC, KG), pp. 1249–1256.
CASECASE-2018-LaiPPHM #estimation #probability
Probabilistic Pose Estimation of Deformable Linear Objects (YL, JP, GP, HH, TM), pp. 471–476.
CASECASE-2018-VijayaraghavanK #evaluation #integer #programming #recursion #reduction #reliability
A Mixed Integer Programming Based Recursive Variance Reduction Method for Reliability Evaluation of Linear Sensor Systems (VV, KK, YD, HP), pp. 836–842.
CASECASE-2018-ZhangLFL #integer #programming #sequence #using
Shortest Legal Firing Sequence of Net Condition/Event Systems Using Integer Linear Programming (JZ, HL, GF, ZL), pp. 1556–1561.
CGOCGO-2018-SpampinatoFBP #algebra #generative
Program generation for small-scale linear algebra applications (DGS, DFT, PB, MP), pp. 327–339.
CAVCAV-2018-FanMM0 #specification #synthesis
Controller Synthesis Made Real: Reach-Avoid Specifications and Linear Dynamics (CF, UM, SM, MV0), pp. 347–366.
CSLCSL-2018-BaillotG #complexity #logic
Combining Linear Logic and Size Types for Implicit Complexity (PB, AG), p. 21.
CSLCSL-2018-ChouquetA #logic #parallel #proving
An Application of Parallel Cut Elimination in Unit-Free Multiplicative Linear Logic to the Taylor Expansion of Proof Nets (JC, LVA), p. 17.
CSLCSL-2018-NolletST #fixpoint #logic #proving
Local Validity for Circular Proofs in Linear Logic with Fixed Points (RN, AS, CT), p. 23.
IJCARIJCAR-2018-Bromberger #bound #problem #reduction
A Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded Problems (MB), pp. 329–345.
AFLAFL-2017-BeierHK #complexity #on the #set
On the Descriptional Complexity of Operations on Semilinear Sets (SB, MH, MK), pp. 41–55.
FSCDFSCD-2017-BarenbaumB #calculus
Optimality and the Linear Substitution Calculus (PB, EB), p. 16.
AIIDEAIIDE-2017-AzadXYL #interactive #programming #scheduling
Scheduling Live Interactive Narratives with Mixed-Integer Linear Programming (SA, JX, HY, BL), pp. 2–8.
ICMLICML-2017-ChenKB #equation #identification #modelling #testing #using
Identification and Model Testing in Linear Structural Equation Models using Auxiliary Variables (BC, DK, EB), pp. 757–766.
ICMLICML-2017-KaleKLP #adaptation #feature model #online #performance
Adaptive Feature Selection: Computationally Efficient Online Sparse Linear Regression under RIP (SK, ZSK, TL, DP), pp. 1780–1788.
ICMLICML-2017-LiLZ #algorithm
Provably Optimal Algorithms for Generalized Linear Contextual Bandits (LL0, YL, DZ), pp. 2071–2080.
ICMLICML-2017-RaffelLLWE #online
Online and Linear-Time Attention by Enforcing Monotonic Alignments (CR, MTL, PJL, RJW, DE), pp. 2837–2846.
ICMLICML-2017-RiquelmeGL #estimation #learning #modelling
Active Learning for Accurate Estimation of Linear Models (CR, MG, AL), pp. 2931–2939.
ICMLICML-2017-Zhang0KALZ #learning #modelling #named #precise
ZipML: Training Linear Models with End-to-End Low Precision, and a Little Bit of Deep Learning (HZ, JL0, KK, DA, JL0, CZ), pp. 4035–4043.
ECOOPECOOP-2017-CastegrenW #data type
Relaxed Linear References for Lock-free Data Structures (EC, TW), p. 32.
ECOOPECOOP-2017-ScalasDHY #composition #distributed #multi #programming
A Linear Decomposition of Multiparty Sessions for Safe Distributed Programming (AS, OD, RH, NY), p. 31.
PLDIPLDI-2017-KiniM0 #predict
Dynamic race prediction in linear time (DK, UM, MV0), pp. 157–170.
POPLPOPL-2017-ZhangS #analysis #data flow #reachability
Context-sensitive data-dependence analysis via linear conjunctive language reachability (QZ, ZS), pp. 344–358.
SASSAS-2017-MarechalMP #parametricity #programming #scalability
Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming (AM, DM, MP), pp. 212–231.
CASECASE-2017-HanPM #approach #learning #modelling
Model-based reinforcement learning approach for deformable linear object manipulation (HH, GP, TM), pp. 750–755.
ESOPESOP-2017-GeorgesMOP #framework #logic #named
LINCX: A Linear Logical Framework with First-Class Contexts (ALG, AM, SO, BP), pp. 530–555.
FASEFASE-2017-LeblebiciAS #consistency #graph grammar #optimisation #using
Inter-model Consistency Checking Using Triple Graph Grammars and Linear Optimization Techniques (EL, AA, AS), pp. 191–207.
CADECADE-2017-HorbachVW #integer #on the
On the Combination of the Bernays-Schönfinkel-Ramsey Fragment with Simple Linear Integer Arithmetic (MH, MV, CW), pp. 77–94.
CADECADE-2017-TeuckeW #constraints #decidability #first-order #monad
Decidability of the Monadic Shallow Linear First-Order Fragment with Straight Dismatching Constraints (AT, CW), pp. 202–219.
CAVCAV-2017-BakD #reachability #scalability
Simulation-Equivalent Reachability of Large Linear Systems with Inputs (SB, PSD), pp. 401–420.
CAVCAV-2017-FortinMW #automaton #model checking
Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems (MF, AM, IW), pp. 155–175.
ICSTICST-2017-Gyori0PM #metric #performance #runtime
Efficient Incrementalized Runtime Checking of Linear Measures on Lists (AG, PG0, EP, PM), pp. 310–320.
CIAACIAA-2016-IbarraM #bound #on the
On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L (OHI, IM), pp. 138–149.
CIAACIAA-2016-Teichmann #approximate #context-free grammar
Regular Approximation of Weighted Linear Nondeleting Context-Free Tree Languages (MT), pp. 273–284.
DLTDLT-2016-BoiretP #equivalence #polynomial #transducer
Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time (AB, RP), pp. 355–367.
FMFM-2016-YangHCL0 #approach #generative #hybrid #programming
A Linear Programming Relaxation Based Approach for Generating Barrier Certificates of Hybrid Systems (ZY, CH, XC0, WL, ZL0), pp. 721–738.
FSCDFSCD-2016-RappM #automation #first-order #term rewriting
Automating the First-Order Theory of Rewriting for Left-Linear Right-Ground Rewrite Systems (FR, AM), p. 12.
ICFP-2016-Morris #functional #programming
The best of both worlds: linear functional programming without compromise (JGM), pp. 448–461.
CIKMCIKM-2016-KasneciG #named #network
LICON: A Linear Weighting Scheme for the Contribution ofInput Variables in Deep Artificial Neural Networks (GK, TG), pp. 45–54.
ICMLICML-2016-KordaSL #clustering #distributed #network
Distributed Clustering of Linear Bandits in Peer to Peer Networks (NK, BS, SL), pp. 1301–1309.
ICMLICML-2016-LiuWS #constraints #convergence #optimisation #orthogonal #polynomial
Quadratic Optimization with Orthogonality Constraints: Explicit Lojasiewicz Exponent and Linear Convergence of Line-Search Methods (HL, WW, AMCS), pp. 1158–1167.
ICMLICML-2016-LiuZO #education
The Teaching Dimension of Linear Learners (JL, XZ0, HO), pp. 117–126.
ICMLICML-2016-MedinaY #algorithm
No-Regret Algorithms for Heavy-Tailed Linear Bandits (AMM, SY), pp. 1642–1650.
ICMLICML-2016-RaghunathanFDL #estimation
Estimation from Indirect Supervision with Linear Moments (AR, RF, JCD, PL), pp. 2568–2577.
ICMLICML-2016-RaviIJS #design #modelling
Experimental Design on a Budget for Sparse Linear Models and Applications (SNR, VKI, SCJ, VS), pp. 583–592.
ICMLICML-2016-ShangSAL #comprehension #network
Understanding and Improving Convolutional Neural Networks via Concatenated Rectified Linear Units (WS, KS, DA, HL), pp. 2217–2225.
ICMLICML-2016-TuBSSR #equation #matrix #rank
Low-rank Solutions of Linear Matrix Equations via Procrustes Flow (ST, RB, MS, MS, BR), pp. 964–973.
ICMLICML-2016-WangDL #modelling
No penalty no tears: Least squares in high-dimensional linear models (XW0, DBD, CL), pp. 1814–1822.
ICMLICML-2016-ZhangYJXZ #feedback #online #optimisation #probability
Online Stochastic Linear Optimization under One-bit Feedback (LZ0, TY, RJ, YX, ZHZ), pp. 392–401.
ICPRICPR-2016-GiraudTP #named #using
SCALP: Superpixels with Contour Adherence using Linear Path (RG, VTT, NP), pp. 2374–2379.
ICPRICPR-2016-HaralickDSK #clustering
Inexact MDL for linear manifold clusters (RMH, AD, XS, NYK), pp. 1345–1351.
ICPRICPR-2016-KostadinovVDFH
Local Active Content Fingerprint: Solutions for general linear feature maps (DK, SV, MD, SF, TH), pp. 949–954.
ICPRICPR-2016-Lobato-RiosHCT #comparison #network #quality
Linear model optimizer vs Neural Networks: A comparison for improving the quality and saving of LED-Lighting control systems (VLR, VdRHC, JACO, JFMT), pp. 2664–2669.
KDDKDD-2016-ChiangLL #classification #coordination #manycore #parallel #scalability
Parallel Dual Coordinate Descent Method for Large-scale Linear Classification in Multi-core Environments (WLC, MCL, CJL), pp. 1485–1494.
KDDKDD-2016-LiLDWWC #algorithm #parallel #sequence
A Real Linear and Parallel Multiple Longest Common Subsequences (MLCS) Algorithm (YL, HL, TD, SW, ZW, YC), pp. 1725–1734.
KDDKDD-2016-YuanYZH #approximate #difference #optimisation #privacy #query
Convex Optimization for Linear Query Processing under Approximate Differential Privacy (GY, YY, ZZ, ZH), pp. 2005–2014.
KDDKDD-2016-ZhangZMCZA #modelling #named #predict #scalability
GLMix: Generalized Linear Mixed Models For Large-Scale Response Prediction (XZ, YZ, YM, BCC, LZ, DA), pp. 363–372.
SASSAS-2016-MauricaMP #float #on the #problem #ranking
On the Linear Ranking Problem for Simple Floating-Point Loops (FM, FM, ÉP), pp. 300–316.
CASECASE-2016-LathamMM #adaptation
Nonlinear adaptive current control for linear vapor compressors (JL, MLM, MM), pp. 1257–1262.
CASECASE-2016-QiaoZWZL #clustering #optimisation #process #tool support
Optimizing close-down processes of single-robot cluster tools via linear programing (YQ, MZ, NW, QZ, ZL), pp. 148–153.
CGOCGO-2016-SpampinatoP #algebra #compilation #matrix
A basic linear algebra compiler for structured matrices (DGS, MP), pp. 117–127.
ESOPESOP-2016-Ehrhard #call-by #logic #perspective
Call-By-Push-Value from a Linear Logic Point of View (TE), pp. 202–228.
CAVCAV-2016-Duggirala0 #simulation #verification
Parsimonious, Simulation Based Verification of Linear Systems (PSD, MV0), pp. 477–494.
CAVCAV-2016-ManevichDR #analysis #termination
From Shape Analysis to Termination Analysis in Linear Time (RM, BD, NR), pp. 426–446.
CAVCAV-2016-SickertEJK #automaton #logic
Limit-Deterministic Büchi Automata for Linear Temporal Logic (SS, JE, SJ, JK), pp. 312–332.
CAVCAV-2016-Wijs #model checking
BFS-Based Model Checking of Linear-Time Properties with an Application on GPUs (AW), pp. 472–493.
CSLCSL-2016-BaillotD #logic
Free-Cut Elimination in Linear Logic and an Application to a Feasible Arithmetic (PB, AD0), p. 18.
CSLCSL-2016-Carvalho #exponential #injection #logic #multi #relational
The Relational Model Is Injective for Multiplicative Exponential Linear Logic (DdC), p. 19.
CSLCSL-2016-TabuadaN #logic #robust
Robust Linear Temporal Logic (PT, DN), p. 21.
PODSPODS-2015-Ullman #multi #query
Private Multiplicative Weights Beyond Linear Queries (JU), pp. 303–312.
SIGMODSIGMOD-2015-CochezM #approximate #clustering #distance
Twister Tries: Approximate Hierarchical Agglomerative Clustering for Average Distance in Linear Time (MC, HM), pp. 505–517.
SIGMODSIGMOD-2015-KumarNP #learning #modelling #normalisation
Learning Generalized Linear Models Over Normalized Data (AK, JFN, JMP), pp. 1969–1984.
ICPCICPC-2015-BusjahnBBCPSST #eye tracking #order
Eye movements in code reading: relaxing the linear order (TB, RB, AB, MEC, JHP, CS, BS, ST), pp. 255–265.
CIAACIAA-2015-Madejski #permutation #problem
The Membership Problem for Linear and Regular Permutation Languages (GM), pp. 211–223.
ICALPICALP-v1-2015-BeiCZ #constraints #programming
Solving Linear Programming with Constraints Unknown (XB, NC, SZ), pp. 129–142.
ICALPICALP-v1-2015-HemenwayW
Linear-Time List Recovery of High-Rate Expander Codes (BH, MW), pp. 701–712.
ICALPICALP-v1-2015-LokshtanovMPS
Deterministic Truncation of Linear Matroids (DL, PM, FP, SS), pp. 922–934.
ICALPICALP-v1-2015-LokshtanovRS #algorithm #feedback #set
Linear Time Parameterized Algorithms for Subset Feedback Vertex Set (DL, MSR, SS), pp. 935–946.
ICALPICALP-v2-2015-ColcombetS #order #quantifier #set
Limited Set quantifiers over Countable Linear Orderings (TC, AVS), pp. 146–158.
LATALATA-2015-PolicritiGP
Average Linear Time and Compressed Space Construction of the Burrows-Wheeler Transform (AP, NG, NP), pp. 587–598.
RTARTA-2015-DasS #logic #term rewriting
No complete linear term rewriting system for propositional logic (AD, LS), pp. 127–142.
HaskellHaskell-2015-Polakow #haskell #λ-calculus
Embedding a full linear Lambda calculus in Haskell (JP), pp. 177–188.
ICEISICEIS-v1-2015-AwasthiLK #algorithm #problem #sequence #strict
Un-restricted Common Due-Date Problem with Controllable Processing Times — Linear Algorithm for a Given Job Sequence (AA, JL, OK), pp. 526–534.
ICMLICML-2015-AnBB #how #network #question
How Can Deep Rectifier Networks Achieve Linear Separability and Preserve Distances? (SA, FB, MB), pp. 514–523.
ICMLICML-2015-BelangerK
A Linear Dynamical System Model for Text (DB, SMK), pp. 833–842.
ICMLICML-2015-FilipponeE #probability #process #scalability
Enabling scalable stochastic gradient-based inference for Gaussian processes by employing the Unbiased LInear System SolvEr (ULISSE) (MF, RE), pp. 1015–1024.
ICMLICML-2015-GuanSBMBB
Moderated and Drifting Linear Dynamical Systems (JG, KS, EB, CM, EB, KB), pp. 2473–2482.
ICMLICML-2015-KuklianskyS #performance
Attribute Efficient Linear Regression with Distribution-Dependent Sampling (DK, OS), pp. 153–161.
ICMLICML-2015-LeeR #distributed #optimisation #polynomial
Distributed Box-Constrained Quadratic Optimization for Dual Linear SVM (CPL, DR), pp. 987–996.
ICMLICML-2015-MaLF #analysis #canonical #correlation #dataset #scalability
Finding Linear Structure in Large Datasets with Scalable Canonical Correlation Analysis (ZM, YL, DPF), pp. 169–178.
ICMLICML-2015-ShajarisalesJSB
Telling cause from effect in deterministic linear dynamical systems (NS, DJ, BS, MB), pp. 285–294.
KDDKDD-2015-ChuHTLL #classification #parametricity
Warm Start for Parameter Selection of Linear Classifiers (BYC, CHH, CHT, CYL, CJL), pp. 149–158.
KDDKDD-2015-OkumuraST #analysis #classification #incremental #problem
Quick Sensitivity Analysis for Incremental Data Modification and Its Application to Leave-one-out CV in Linear Classification Problems (SO, YS, IT), pp. 885–894.
KDDKDD-2015-ZhengYX #composition #modelling #topic #using
Linear Time Samplers for Supervised Topic Models using Compositional Proposals (XZ, YY, EPX), pp. 1523–1532.
KDDKDD-2015-ZhouALS #algebra
Cuckoo Linear Algebra (LZ, DGA, ML, AJS), pp. 1553–1562.
RecSysRecSys-2015-AuteriT #personalisation
Personalized Catch-up & DVR: VOD or Linear, That is the Question (PA, RT), p. 227.
RecSysRecSys-2015-KarSA #online #video
Selection and Ordering of Linear Online Video Ads (WK, VS, PA), pp. 203–210.
PADLPADL-2015-CruzR #compilation #logic programming #on the #source code
On Compiling Linear Logic Programs with Comprehensions, Aggregates and Rule Priorities (FC, RR), pp. 34–49.
POPLPOPL-2015-KrishnaswamiPB #dependent type
Integrating Linear and Dependent Types (NRK, PP, NB), pp. 17–30.
SASSAS-2015-GargR #integer #programming
Synthesizing Heap Manipulations via Integer Linear Programming (AG, SR), pp. 109–127.
GTTSEGTTSE-2015-PontesMOP #algebra #approach #implementation
Implementing a Linear Algebra Approach to Data Processing (RP, MM, JNO, JOP), pp. 215–222.
CASECASE-2015-HayakawaI #fault #reduction
GPS error range reduction method based on linear kinematic model (TH, MI), pp. 1515–1520.
CASECASE-2015-HillmannS #dependence #distributed
Decentralized control of distributed discrete event systems with linear dependency structure (CH, OS), pp. 551–557.
CASECASE-2015-KouiderHOO #approach #graph #integer #scheduling #source code
Mixed integer linear programs and tabu search approach to solve mixed graph coloring for unit-time job shop scheduling (AK, HAH, SO, AO), pp. 1177–1181.
CASECASE-2015-ProdelAXJL #database #integer #mining #process #programming #using
Discovery of patient pathways from a national hospital database using process mining and integer linear programming (MP, VA, XX, BJ, LL), pp. 1409–1414.
CASECASE-2015-ZhuCS #energy #process #recognition #using
Using unlabeled acoustic data with locality-constrained linear coding for energy-related activity recognition in buildings (QZ, ZC, YCS), pp. 174–179.
DACDAC-2015-ZolotovF #integer #programming
Variation aware cross-talk aggressor alignment by mixed integer linear programming (VZ, PF), p. 6.
DATEDATE-2015-KyrtatasSP #algebra #compilation #embedded
A basic linear algebra compiler for embedded processors (NK, DGS, MP), pp. 1054–1059.
DATEDATE-2015-SchaffnerGSB #architecture #image
DRAM or no-DRAM?: exploring linear solver architectures for image domain warping in 28 nm CMOS (MS, FKG, AS, LB), pp. 707–712.
DATEDATE-2015-ZhuM #machine learning #optimisation #programming #using
Optimizing dynamic trace signal selection using machine learning and linear programming (CSZ, SM), pp. 1289–1292.
HPDCHPDC-2015-ElliottHM #fault
A Numerical Soft Fault Model for Iterative Linear Solvers (JE, MH, FM), pp. 271–274.
PPoPPPPoPP-2015-HaidarDLTD #hardware #platform #towards
Towards batched linear solvers on accelerated hardware platforms (AH, TD, PL, ST, JJD), pp. 261–262.
FoSSaCSFoSSaCS-2015-GrelloisM #logic
An Infinitary Model of Linear Logic (CG, PAM), pp. 41–55.
FoSSaCSFoSSaCS-2015-Vakar #category theory #framework #logic #semantics
A Categorical Semantics for Linear Logical Frameworks (MV), pp. 102–116.
CADECADE-2015-Bromberger0W #integer #revisited
Linear Integer Arithmetic Revisited (MB, TS, CW), pp. 623–637.
CADECADE-2015-ShintaniH #confluence #named #term rewriting
CoLL: A Confluence Tool for Left-Linear Term Rewrite Systems (KS, NH), pp. 127–136.
CSLCSL-2015-AminiE #logic #on the
On Classical PCF, Linear Logic and the MIX Rule (SA, TE), pp. 582–596.
CSLCSL-2015-BreuvartP #logic #modelling #relational #semantics
Modelling Coeffects in the Relational Semantics of Linear Logic (FB, MP), pp. 567–581.
CSLCSL-2015-Charatonik0 #logic #order
Two-variable Logic with Counting and a Linear Order (WC, PW), pp. 631–647.
CSLCSL-2015-GrelloisM #higher-order #logic #model checking #relational #semantics
Relational Semantics of Linear Logic and Higher-order Model Checking (CG, PAM), pp. 260–276.
LICSLICS-2015-LechnerOW #complexity #on the
On the Complexity of Linear Arithmetic with Divisibility (AL, JO, JW), pp. 667–676.
VMCAIVMCAI-2015-AdjeG #automation #invariant #polynomial #source code #synthesis
Automatic Synthesis of Piecewise Linear Quadratic Invariants for Programs (AA, PLG), pp. 99–116.
EDMEDM-2014-KimPSJ #comparison #learning #online #predict #student #using
Predicting students' learning achievement by using online learning patterns in blended learning environments: Comparison of two cases on linear and non-linear model (JK, YP, JS, IHJ), pp. 407–408.
CIAACIAA-2014-AmorimMR #canonical #finite #transducer #using
Counting Equivalent Linear Finite Transducers Using a Canonical Form (IA, AM, RR), pp. 70–83.
ICALPICALP-v1-2014-HegdeIS #modelling
Nearly Linear-Time Model-Based Compressive Sensing (CH, PI, LS), pp. 588–599.
ICALPICALP-v1-2014-HsuRRU #source code
Privately Solving Linear Programs (JH, AR, TR, JU), pp. 612–624.
ICALPICALP-v2-2014-OuaknineW #on the #problem #sequence
On the Positivity Problem for Simple Linear Recurrence Sequences, (JO, JW), pp. 318–329.
ICALPICALP-v2-2014-OuaknineW14a #decidability #sequence
Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences (JO, JW), pp. 330–341.
LATALATA-2014-FinkbeinerT #logic #modelling
Counting Models of Linear-Time Temporal Logic (BF, HT), pp. 360–371.
SFMSFM-2014-GiachinoL #concurrent #detection #recursion #source code
Deadlock Detection in Linear Recursive Programs (EG, CL), pp. 26–64.
FLOPSFLOPS-2014-Sacchini #calculus
Linear Sized Types in the Calculus of Constructions (JLS), pp. 169–185.
IFLIFL-2014-AmorimGAH #type checking
Really Natural Linear Indexed Type Checking (AAdA, MG, EJGA, JH), p. 5.
CHI-PLAYCHI-PLAY-2014-HarleyL #game studies #interactive
CHI PLAY 2014: the bellman: subtle interactions in a linear narrative (DH, RL), pp. 343–346.
CHICHI-2014-AuSL #named
LinearDragger: a linear selector for target acquisition on touch screens (OKCA, XS, RWHL), pp. 2607–2616.
CHICHI-2014-BaillyOBH #visual notation
Model of visual search and selection time in linear menus (GB, AO, DPB, AH), pp. 3865–3874.
CIKMCIKM-2014-DeBBGC #learning
Learning a Linear Influence Model from Transient Opinion Dynamics (AD, SB, PB, NG, SC), pp. 401–410.
CIKMCIKM-2014-LiuXCXTY #approach #bound #network #scalability #social
Influence Maximization over Large-Scale Social Networks: A Bounded Linear Approach (QL, BX, EC, HX, FT, JXY), pp. 171–180.
CIKMCIKM-2014-MaoWHO #classification #learning #multi
Nonlinear Classification via Linear SVMs and Multi-Task Learning (XM, OW, WH, PO), pp. 1955–1958.
CIKMCIKM-2014-SchneiderBV #multi
Solving Linear SVMs with Multiple 1D Projections (JS, JB, MV), pp. 221–230.
ECIRECIR-2014-BaiGLC #documentation #matrix #modelling
Local Linear Matrix Factorization for Document Modeling (LB, JG, YL, XC), pp. 398–411.
ICMLICML-c2-2014-KarninH
Hard-Margin Active Linear Regression (ZSK, EH), pp. 883–891.
ICMLICML-c2-2014-LinAKLC #combinator #feedback #game studies #monitoring
Combinatorial Partial Monitoring Game with Linear Feedback and Its Applications (TL, BDA, RDK, JL, WC), pp. 901–909.
ICMLICML-c2-2014-MalekAB #markov #problem #programming #scalability
Linear Programming for Large-Scale Markov Decision Problems (AM, YAY, PLB), pp. 496–504.
ICMLICML-c2-2014-MizrahiDF #learning #markov #parallel #random
Linear and Parallel Learning of Markov Random Fields (YDM, MD, NdF), pp. 199–207.
ICMLICML-c2-2014-NieHH
Linear Time Solver for Primal SVM (FN, YH, HH), pp. 505–513.
ICMLICML-c2-2014-SunIM #classification #learning
Learning Mixtures of Linear Classifiers (YS, SI, AM), pp. 721–729.
ICMLICML-c2-2014-TaylorGP #analysis #approximate #programming
An Analysis of State-Relevance Weights and Sampling Distributions on L1-Regularized Approximate Linear Programming Approximation Accuracy (GT, CG, DP), pp. 451–459.
ICMLICML-c2-2014-ToulisAR #analysis #modelling #probability #statistics
Statistical analysis of stochastic gradient methods for generalized linear models (PT, EA, JR), pp. 667–675.
ICMLICML-c2-2014-YangLR
Elementary Estimators for High-Dimensional Linear Regression (EY, ACL, PDR), pp. 388–396.
ICMLICML-c2-2014-YiCS
Alternating Minimization for Mixed Linear Regression (XY, CC, SS), pp. 613–621.
ICPRICPR-2014-ChenYJ #analysis #feature model #robust
An Improved Linear Discriminant Analysis with L1-Norm for Robust Feature Extraction (XC, JY, ZJ), pp. 1585–1590.
ICPRICPR-2014-DuZCW #flexibility #learning #random
Learning Flexible Binary Code for Linear Projection Based Hashing with Random Forest (SD, WZ, SC, YW), pp. 2685–2690.
ICPRICPR-2014-GubarevaSSLM
Finding the Largest Hypercavity in a Linear Data Space (AG, VS, OS, AL, VM), pp. 4406–4410.
ICPRICPR-2014-ItohIS #2d #image #using
Two-Dimensional Global Image Registration Using Local Linear Property of Image Manifold (HI, AI, TS), pp. 3862–3867.
ICPRICPR-2014-KrytheL #analysis
Implicitly Constrained Semi-supervised Linear Discriminant Analysis (JHK, ML), pp. 3762–3767.
ICPRICPR-2014-LenochHGW #3d
Linear Unmixing in BRDF Reproduction and 3D Shape Recovery (ML, SH, AG, CW), pp. 2071–2076.
ICPRICPR-2014-MiaoSH #multi #programming #robust
Fusion of Multibiometrics Based on a New Robust Linear Programming (DM, ZS, YH), pp. 291–296.
ICPRICPR-2014-NguyenP #multi #using
Tracking Using Multiple Linear Searches and Motion Direction Sampling (TN, TPP), pp. 2191–2196.
ICPRICPR-2014-NieJ #learning #using
Feature Learning Using Bayesian Linear Regression Model (SN, QJ), pp. 1502–1507.
ICPRICPR-2014-RahmaniMHM #classification
Action Classification with Locality-Constrained Linear Coding (HR, AM, DQH, ASM), pp. 3511–3516.
ICPRICPR-2014-YanRLSS #analysis #clustering #invariant #multi #recognition
Clustered Multi-task Linear Discriminant Analysis for View Invariant Color-Depth Action Recognition (YY, ER, GL, RS, NS), pp. 3493–3498.
KDDKDD-2014-FangP #algorithm #performance
Fast DTT: a near linear algorithm for decomposing a tensor into factor tensors (XF, RP), pp. 967–976.
KDDKDD-2014-FangT
Networked bandits with disjoint linear payoffs (MF, DT), pp. 1106–1115.
KDDKDD-2014-TsaiLL #classification #incremental
Incremental and decremental training for linear classification (CHT, CYL, CJL), pp. 343–352.
KDDKDD-2014-Yoshida #adaptation #algorithm #sketching #using
Almost linear-time algorithms for adaptive betweenness centrality using hypergraph sketches (YY), pp. 1416–1425.
KRKR-2014-Lin #first-order #formal method #logic #source code
A Formalization of Programs in First-Order Logic with a Discrete Linear Order (FL).
KRKR-2014-Potyka #consistency #logic #nondeterminism #probability #source code
Linear Programs for Measuring Inconsistency in Probabilistic Logics (NP).
PPDPPPDP-J-2012-LagoP14 #call-by #dependent type
Linear dependent types in a call-by-value scenario (UDL, BP), pp. 77–100.
POPLPOPL-2014-JeannetSS
Abstract acceleration of general linear loops (BJ, PS, SS), pp. 529–540.
PPDPPPDP-2014-CruzRG #design #implementation #logic programming #parallel #source code #thread #virtual machine
Design and Implementation of a Multithreaded Virtual Machine for Executing Linear Logic Programs (FC, RR, SCG), pp. 43–54.
CASECASE-2014-ChuLSO #analysis #contract #flexibility #parametricity #programming #using
Flexibility analysis on a supply chain contract using a parametric Linear Programming model (CC, EEL, XS, DO), pp. 704–709.
CASECASE-2014-WuBZ #approach #scheduling
Linear programming-based approach to scheduling of crude oil operations in refinery with oil type mixing requirement (NW, LB, MZ), pp. 430–435.
CGOCGO-2014-SpampinatoP #algebra #compilation
A Basic Linear Algebra Compiler (DGS, MP), p. 23.
DACDAC-2014-SchaffnerGSKB #approximate #complexity #realtime #video
An Approximate Computing Technique for Reducing the Complexity of a Direct-Solver for Sparse Linear Systems in Real-Time Video Processing (MS, FKG, AS, HK, LB), p. 6.
DATEDATE-2014-GangopadhyayLNR #adaptation #analysis #modelling #performance
Modeling and analysis of digital linear dropout regulators with adaptive control for high efficiency under wide dynamic range digital loads (SG, YL, SBN, AR), pp. 1–6.
DATEDATE-2014-SchollPDA
Simple interpolants for linear arithmetic (CS, FP, SD, EA), pp. 1–6.
DATEDATE-2014-UbolliGBC #megamodelling
Sensitivity-based weighting for passivity enforcement of linear macromodels in power integrity applications (AU, SGT, MB, AC), pp. 1–6.
ISMMISMM-2014-BrandtKSB #concurrent #garbage collection #parallel
Concurrent, parallel garbage collection in linear time (SRB, HK, GS, CB), pp. 47–58.
LCTESLCTES-2014-BeaugnonKHBTAL #algebra #named
VOBLA: a vehicle for optimized basic linear algebra (UB, AK, SvH, RB, DT, JA, AL), pp. 115–124.
PDPPDP-2014-CamargosSGM #gpu
Iterative Solution on GPU of Linear Systems Arising from the A-V Edge-FEA of Time-Harmonic Electromagnetic Phenomena (AFPC, VCS, JMG, GM), pp. 365–371.
PDPPDP-2014-Schick #nondeterminism #parallel #parametricity
A Parallel Multilevel Spectral Galerkin Solver for Linear Systems with Uncertain Parameters (MS), pp. 352–359.
ESOPESOP-2014-GhicaS #bound
Bounded Linear Types in a Resource Semiring (DRG, AIS), pp. 331–350.
FoSSaCSFoSSaCS-2014-Cirstea #algebra #approach #logic
A Coalgebraic Approach to Linear-Time Logics (CC), pp. 426–440.
FoSSaCSFoSSaCS-2014-Padovani #re-engineering #recursion #π-calculus
Type Reconstruction for the Linear π-Calculus with Composite and Equi-Recursive Types (LP), pp. 88–102.
STOCSTOC-2014-AwasthiBL #learning #locality #power of
The power of localization for efficiently learning linear separators with noise (PA, MFB, PML), pp. 449–458.
STOCSTOC-2014-Belazzougui
Linear time construction of compressed text indices in compact space (DB), pp. 148–193.
STOCSTOC-2014-CohenKMPPRX
Solving SDD linear systems in nearly mlog1/2n time (MBC, RK, GLM, JWP, RP, AR, SCX), pp. 343–352.
STOCSTOC-2014-LiNW #algorithm #sketching #streaming
Turnstile streaming algorithms might as well be linear sketches (YL, HLN, DPW), pp. 174–183.
STOCSTOC-2014-PengS #parallel #performance
An efficient parallel solver for SDD linear systems (RP, DAS), pp. 333–342.
STOCSTOC-2014-Williams #algorithm #bound
New algorithms and lower bounds for circuits with linear threshold gates (RW), pp. 194–202.
TACASTACAS-2014-LeikeH #ranking
Ranking Templates for Linear Loops (JL, MH), pp. 172–186.
ICLPICLP-J-2014-BogaertsJBCVD #calculus #simulation #using
Simulating Dynamic Systems Using Linear Time Calculus Theories (BB, JJ, MB, BdC, JV, MD), pp. 477–492.
ICLPICLP-J-2014-CominiTV #logic #using
Abstract Diagnosis for tccp using a Linear Temporal Logic (MC, LT, AV), pp. 787–801.
ICLPICLP-J-2014-CruzRGP #concurrent #graph #logic programming #programming language
A Linear Logic Programming Language for Concurrent Programming over Graph Structures (FC, RR, SCG, FP), pp. 493–507.
IJCARIJCAR-2014-BozzelliS #logic
Visibly Linear Temporal Logic (LB, CS), pp. 418–433.
LICSLICS-CSL-2014-BaierKKW #complexity #decidability #logic #monitoring
Weight monitoring with linear temporal logic: complexity and decidability (CB, JK, SK, SW), p. 10.
LICSLICS-CSL-2014-Padovani #concurrent #π-calculus
Deadlock and lock freedom in the linear π-calculus (LP), p. 10.
SMTSMT-2014-KingBT #integer #programming #smt
Leveraging Linear and Mixed Integer Programming for SMT (TK, CB, CT), p. 65.
SIGMODSIGMOD-2013-PapadopoulosCDG #algebra #authentication #data type #lightweight #query
Lightweight authentication of linear algebraic queries on data streams (SP, GC, AD, MNG), pp. 881–892.
DLTDLT-2013-BertoniCD #automaton #context-free grammar #decidability #finite #problem #quantum
Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem (AB, CC, FD), pp. 82–93.
DLTDLT-2013-FulopM #composition #top-down #transducer
Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers (ZF, AM), pp. 239–251.
ICALPICALP-v1-2013-0002LPRRSS #algorithm #kernel
Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions (EJK, AL, CP, FR, PR, IS, SS), pp. 613–624.
ICALPICALP-v1-2013-AndoniNPW #bound #sketching
Tight Lower Bound for Linear Sketches of Moments (AA, HLN, YP, YW), pp. 25–32.
ICALPICALP-v1-2013-DuanM #algorithm #combinator #polynomial
A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market (RD, KM), pp. 425–436.
ICALPICALP-v1-2013-Kolmogorov #power of #programming
The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization (VK), pp. 625–636.
ICALPICALP-v1-2013-WeimannY #approximate #graph
Approximating the Diameter of Planar Graphs in Near Linear Time (OW, RY), pp. 828–839.
ICALPICALP-v2-2013-Jez #equation #word
One-Variable Word Equations in Linear Time (AJ), pp. 324–335.
LATALATA-2013-KociumakaRRW #algorithm #testing
Linear-Time Version of Holub’s Algorithm for Morphic Imprimitivity Testing (TK, JR, WR, TW), pp. 383–394.
LATALATA-2013-NakamuraI #automaton #stack
Eliminating Stack Symbols in Push-Down Automata and Linear Indexed Grammars (KN, KI), pp. 444–455.
LATALATA-2013-Ouaknine
Discrete Linear Dynamical Systems (JO), p. 42.
RTARTA-2013-Accattoli #logic #normalisation
Linear Logic and Strong Normalization (BA), pp. 39–54.
RTARTA-2013-Das #logic
Rewriting with Linear Inferences in Propositional Logic (AD), pp. 158–173.
TLCATLCA-2013-Clairambault #bound #reduction
Bounding Skeletons, Locally Scoped Terms and Exact Bounds for Linear Head Reduction (PC), pp. 109–124.
ICFPICFP-2013-Dolan #algebra #functional #using
Fun with semirings: a functional pearl on the abuse of linear algebra (SD), pp. 101–110.
ICEISICEIS-v1-2013-QasimR #analysis #classification #evaluation #using
Classification of Hepatitis Patients and Fibrosis Evaluation using Decision Trees and Linear Discriminant Analysis (RQ, RMR), pp. 239–246.
CIKMCIKM-2013-AkibaIY #network #random #scalability
Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction (TA, YI, YY), pp. 909–918.
ICMLICML-c1-2013-AnandkumarHJK #learning #network
Learning Linear Bayesian Networks with Latent Variables (AA, DH, AJ, SK), pp. 249–257.
ICMLICML-c1-2013-ChevaleyreKZ #classification
Rounding Methods for Discrete Linear Classification (YC, FK, JDZ), pp. 651–659.
ICMLICML-c1-2013-ZhangC #analysis
Sparse Uncorrelated Linear Discriminant Analysis (XZ, DC), pp. 45–52.
ICMLICML-c3-2013-0002YY
Guaranteed Sparse Recovery under Linear Transformation (JL, LY, JY), pp. 91–99.
ICMLICML-c3-2013-AgrawalG
Thompson Sampling for Contextual Bandits with Linear Payoffs (SA, NG), pp. 127–135.
ICMLICML-c3-2013-ChagantyL
Spectral Experts for Estimating Mixtures of Linear Regressions (ATC, PL), pp. 1040–1048.
ICMLICML-c3-2013-GermainHLM #adaptation #approach #classification
A PAC-Bayesian Approach for Domain Adaptation with Specialization to Linear Classifiers (PG, AH, FL, EM), pp. 738–746.
KDDKDD-2013-CaiQ #analysis #on the #rank
On the equivalent of low-rank linear regressions and linear discriminant analysis based regressions (XC, CHQD, FN, HH), pp. 1124–1132.
KDDKDD-2013-YenCLLL #classification #coordination #memory management #scalability
Indexed block coordinate descent for large-scale linear classification with limited memory (IEHY, CFC, TWL, SWL, SDL), pp. 248–256.
ECOOPECOOP-2013-ZhuL #composition #programming
Heap Decomposition Inference with Linear Programming (HSZ, YDL), pp. 104–128.
LOPSTRLOPSTR-2013-AransayD #algebra #algorithm #execution #formal method #theorem
Formalization and Execution of Linear Algebra: From Theorems to Algorithms (JA, JD), pp. 1–18.
PEPMPEPM-2013-CominiT #automation #equivalence #named #term rewriting
TRSynth: a tool for automatic inference of term equivalence in left-linear term rewriting systems (MC, LT), pp. 67–70.
POPLPOPL-2013-Ben-AmramG #constraints #integer #on the #problem #ranking
On the linear ranking problem for integer linear-constraint loops (AMBA, SG), pp. 51–62.
POPLPOPL-2013-GaboardiHHNP #dependent type #difference #privacy
Linear dependent types for differential privacy (MG, AH, JH, AN, BCP), pp. 357–370.
PPDPPPDP-2013-BagnaraM #ranking
Eventual linear ranking functions (RB, FM), pp. 229–238.
SACSAC-2013-HapfelmeierSK #dataset #incremental #performance
Incremental linear model trees on massive datasets: keep it simple, keep it fast (AH, JS, SK), pp. 129–135.
CASECASE-2013-LiF #approach #integer #multi #problem #programming #scheduling
A mixed integer linear programming approach for multi-degree cyclic multi-hoist scheduling problems without overlapping (XL, RYKF), pp. 274–279.
CASECASE-2013-SilvaCTS #automation #optimisation #programming
A mixed-integer linear programming model for automatic routing decisions in oil production optimization (TLS, EC, AFT, SS), pp. 280–285.
CGOCGO-2013-DuchateauPB #algebra #algorithm #automation #equation #named
Hydra: Automatic algorithm exploration from linear algebra equations (AD, DAP, DB), p. 10.
DACDAC-2013-KarthikR #approximate #modelling #named #using
ABCD-L: approximating continuous linear systems using boolean models (KVA, JSR), p. 9.
DACDAC-2013-ShafaeiSP #architecture #distance #interactive #nearest neighbour #optimisation #quantum
Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures (AS, MS, MP), p. 6.
DACDAC-2013-ZhouLJ #3d #complexity #finite #multi #scalability
A direct finite element solver of linear complexity for large-scale 3-D circuit extraction in multiple dielectrics (BZ, HL, DJ), p. 6.
DATEDATE-2013-LifaEP #predict
Dynamic configuration prefetching based on piecewise linear prediction (AAL, PE, ZP), pp. 815–820.
DATEDATE-2013-LiuLHCLL #clustering #effectiveness #network #programming #prototype #statistics
Effective power network prototyping via statistical-based clustering and sequential linear programming (SYSL, CJL, CCH, HMC, CTL, CHL), pp. 1701–1706.
DATEDATE-2013-NovoAI #estimation #fault #fixpoint #invariant #trade-off
Accuracy vs speed tradeoffs in the estimation of fixed-point errors on linear time-invariant systems (DN, SEA, PI), pp. 15–20.
PDPPDP-2013-GuptaGV #3d #gpu #simulation #using
3D Bubbly Flow Simulation on the GPU — Iterative Solution of a Linear System Using Sub-domain and Level-Set Deflation (RG, MBvG, CV), pp. 359–366.
STOCSTOC-2013-EisenstatK #algorithm #graph #multi
Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs (DE, PNK), pp. 735–744.
STOCSTOC-2013-Har-PeledR #algorithm #distance #problem
Net and prune: a linear time algorithm for euclidean distance problems (SHP, BAR), pp. 605–614.
STOCSTOC-2013-HardtW #adaptation #how #question #robust #sketching
How robust are linear sketches to adaptive inputs? (MH, DPW), pp. 121–130.
STOCSTOC-2013-KleinMS #graph #recursion
Structured recursive separator decompositions for planar graphs in linear time (PNK, SM, CS), pp. 505–514.
STOCSTOC-2013-MengM #robust
Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression (XM, MWM), pp. 91–100.
STOCSTOC-2013-Wootters #fault #on the #random #scalability
On the list decodability of random linear codes with large error rates (MW), pp. 853–860.
TACASTACAS-2013-JohnC #quantifier
Extending Quantifier Elimination to Linear Inequalities on Bit-Vectors (AKJ, SC), pp. 78–92.
CAVCAV-2013-0001LMN #data type #invariant #learning #quantifier
Learning Universally Quantified Invariants of Linear Data Structures (PG, CL, PM, DN), pp. 813–829.
CSLCSL-2013-CloustonDGT #calculus #logic
Annotation-Free Sequent Calculi for Full Intuitionistic Linear Logic (RC, JED, RG, AT), pp. 197–214.
CSLCSL-2013-HampsonK #first-order #logic
One-variable first-order linear temporal logics with counting (CH, AK), pp. 348–362.
LICSLICS-2013-AndersonDH #fixpoint #logic #programming
Maximum Matching and Linear Programming in Fixed-Point Logic with Counting (MA, AD, BH), pp. 173–182.
PODSPODS-2012-GrozMS #regular expression
Deterministic regular expressions in linear time (BG, SM, SS), pp. 49–60.
AFLAFL-J-2011-IbarraS12 #bound
Characterizations of Bounded semilinear Languages by One-Way and Two-Way Deterministic Machines (OHI, SS), pp. 1291–1306.
CIAACIAA-2012-Oliveira #algebra #automaton #probability
Typed Linear Algebra for Weigthed (Probabilistic) Automata (JNO), pp. 52–65.
ICALPICALP-v1-2012-AzarG #constraints #performance
Efficient Submodular Function Maximization under Linear Packing Constraints (YA, IG), pp. 38–50.
ICALPICALP-v1-2012-MolinaroR #geometry #online #source code
Geometry of Online Packing Linear Programs (MM, RR), pp. 701–713.
ICALPICALP-v1-2012-Schmidt
Certifying 3-Connectivity in Linear Time (JMS), pp. 786–797.
ICALPICALP-v2-2012-Spielman #algorithm #equation #graph
Algorithms, Graph Theory, and the Solution of Laplacian Linear Equations (DAS), pp. 24–26.
CIKMCIKM-2012-ComarLSNT #detection #kernel
Weighted linear kernel with tree transformed features for malware detection (PMC, LL, SS, AN, PNT), pp. 2287–2290.
CIKMCIKM-2012-XieZSzP #data type #multi #performance #representation
Efficient buffer management for piecewise linear representation of multiple data streams (QX, JZ, MAS, XZ, CP), pp. 2114–2118.
CIKMCIKM-2012-ZhangWH #integer #programming #set
Selecting expansion terms as a set via integer linear programming (QZ, YW, XH), pp. 2399–2402.
ECIRECIR-2012-GeraniZC #multi #ranking
Score Transformation in Linear Combination for Multi-criteria Relevance Ranking (SG, CZ, FC), pp. 256–267.
ICMLICML-2012-BelletHS #classification #learning #similarity
Similarity Learning for Provably Accurate Sparse Linear Classification (AB, AH, MS), p. 193.
ICMLICML-2012-ChenCRCC #analysis
Communications Inspired Linear Discriminant Analysis (MC, WRC, MRDR, LC, ARC), p. 196.
ICMLICML-2012-DegrisWS
Linear Off-Policy Actor-Critic (TD, MW, RSS), p. 28.
ICMLICML-2012-HazanK12a
Linear Regression with Limited Observation (EH, TK), p. 242.
ICMLICML-2012-KongD #algorithm
An Iterative Locally Linear Embedding Algorithm (DK, CHQD), p. 122.
ICMLICML-2012-MerchanteGG #analysis #approach #performance
An Efficient Approach to Sparse Linear Discriminant Analysis (LFSM, YG, GG), p. 168.
ICMLICML-2012-PiresS #estimation #learning #statistics
Statistical linear estimation with penalized estimators: an application to reinforcement learning (BAP, CS), p. 228.
ICPRICPR-2012-BaiZX #detection #multi
Multi scale multi structuring element top-hat transform for linear feature detection (XB, FZ, BX), pp. 1920–1923.
ICPRICPR-2012-BrownLG #recognition
Locality-Regularized Linear Regression for face recognition (DB, HL, YG), pp. 1586–1589.
ICPRICPR-2012-DongYDWYGSM #classification
A Linear Max K-min classifier (MD, LY, WD, QW, CY, JG, LS, LM), pp. 2967–2971.
ICPRICPR-2012-DuH #adaptation #approach
A discriminative linear regression approach to OCR adaptation (JD, QH), pp. 629–632.
ICPRICPR-2012-LeiLL #analysis #feature model #performance #recognition
Efficient feature selection for linear discriminant analysis and its application to face recognition (ZL, SL, SZL), pp. 1136–1139.
ICPRICPR-2012-LiuDHZL
A cost construction via MSW and linear regression for stereo matching (TL, XD, ZH, XZ, LL), pp. 914–917.
ICPRICPR-2012-LiuLWZ #learning
Locally linear embedding based example learning for pan-sharpening (QL, LL, YW, ZZ), pp. 1928–1931.
ICPRICPR-2012-SjobergKIL #classification #concept #detection #realtime #scalability #visual notation
Real-time large-scale visual concept detection with linear classifiers (MS, MK, SI, JL), pp. 421–424.
ICPRICPR-2012-TaniguchiHISC #image
Image super-resolution based on locality-constrained linear coding (KT, XHH, YI, SS, YWC), pp. 1948–1951.
ICPRICPR-2012-WangST #feature model #programming #recognition #robust
Robust regularized feature selection for iris recognition via linear programming (LW, ZS, TT), pp. 3358–3361.
ICPRICPR-2012-ZhangWDP #detection
Skin detection via linear regression tree (JZ, HW, FD, CP), pp. 1711–1714.
KDDKDD-2012-BoleyMG #using
Linear space direct pattern sampling using coupling from the past (MB, SM, TG), pp. 69–77.
KDDKDD-2012-MatsushimaVS
Linear support vector machines via dual cached loops (SM, SVNV, AJS), pp. 177–185.
RecSysRecSys-2012-NingK #recommendation
Sparse linear methods with side information for top-n recommendations (XN, GK), pp. 155–162.
SEKESEKE-2012-NarataM
Managing Linear Hash in a Closed Space (SN, TM), pp. 741–746.
SEKESEKE-2012-WangXC #mining #network #social
Sparse Linear Influence Model for Hot User Selection on Mining a Social Network (YW, GX, SKC), pp. 1–6.
SIGIRSIGIR-2012-MarkovAC #normalisation #revisited
Unsupervised linear score normalization revisited (IM, AA, FC), pp. 1161–1162.
PPDPPPDP-2012-LagoP #call-by #dependent type
Linear dependent types in a call-by-value scenario (UDL, BP), pp. 115–126.
PPDPPPDP-2012-LamC #datalog #logic #modelling
Modeling datalog fact assertion and retraction in linear logic (ESLL, IC), pp. 67–78.
PPDPPPDP-2012-OlartePRC #approach #automation #concurrent #constraints #verification
A linear concurrent constraint approach for the automatic verification of access permissions (CO, EP, CR, NC), pp. 207–216.
SASSAS-2012-ChenFM #proving #termination
Termination Proofs for Linear Simple Loops (HYC, SF, SM), pp. 422–438.
ASEASE-2012-AminGC #approach #automation #modelling
An automated approach to forecasting QoS attributes based on linear and non-linear time series modeling (AA, LG, AC), pp. 130–139.
CASECASE-2012-LiuJCLX #analysis #canonical #correlation #fault #identification #research
Research on fault identification for complex system based on generalized linear canonical correlation analysis (DL, DJ, XC, AL, GX), pp. 474–478.
CASECASE-2012-ParkM #behaviour #bound #clustering #hybrid #performance #tool support
Performance bounds for hybrid flow lines: Fundamental behavior, practical features and application to linear cluster tools (KP, JRM), pp. 371–376.
CASECASE-2012-ShinPKA #analysis
Structural analysis of built-in sensor frame in jaws with linear type gripper (DHS, TSP, YGK, JA), pp. 810–814.
CASECASE-2012-WuY #estimation #markov #metric #using
State estimation for Markovian Jump Linear System using quantized measurements (HW, HY), pp. 527–531.
DATEDATE-2012-MahmoodSD #framework #modelling #multi #performance
An efficient framework for passive compact dynamical modeling of multiport linear systems (ZM, RS, LD), pp. 1203–1208.
DATEDATE-2012-WangLPW #algorithm #difference #simulation
An operational matrix-based algorithm for simulating linear and fractional differential circuits (YW, HL, GKHP, NW), pp. 1463–1466.
PDPPDP-2012-CastilloFC #algorithm #complexity #concurrent #detection
A Dynamic Deadlock Detection/Resolution Algorithm with Linear Message Complexity (MC, FF, AC), pp. 175–179.
PDPPDP-2012-CastilloFMQR #algebra #analysis #energy #kernel #message passing
Analysis of Strategies to Save Energy for Message-Passing Dense Linear Algebra Kernels (MC, JCF, RM, ESQO, VR), pp. 346–352.
PDPPDP-2012-CuencaGG #algebra #parallel #platform
Improving Linear Algebra Computation on NUMA Platforms through Auto-tuned Nested Parallelism (JC, LPG, DG), pp. 66–73.
PPoPPPPoPP-2012-MarkerTPBG #algebra #developer
Mechanizing the expert dense linear algebra developer (BM, AT, JP, DSB, RAvdG), pp. 289–290.
ESOPESOP-2012-PerezCPT #concurrent #logic
Linear Logical Relations for Session-Based Concurrency (JAP, LC, FP, BT), pp. 539–558.
STOCSTOC-2012-BhaskaraDKT #query
Unconditional differentially private mechanisms for linear queries (AB, DD, RK, KT), pp. 1269–1284.
STOCSTOC-2012-FioriniMPTW #bound #exponential
Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds (SF, SM, SP, HRT, RdW), pp. 95–106.
CAVCAV-2012-Venet #analysis #difference #invariant #scalability
The Gauge Domain: Scalable Analysis of Linear Inequality Invariants (AV), pp. 139–154.
CSLCSL-2012-DawarGHKP #equation
Definability of linear equation systems over groups and rings (AD, EG, BH, EK, WP), pp. 213–227.
CSLCSL-2012-DeYoungCPT #communication #logic #reduction
Cut Reduction in Linear Logic as Asynchronous Session-Typed Communication (HD, LC, FP, BT), pp. 228–242.
CSLCSL-2012-GroheO #equation #game studies
Pebble Games and Linear Equations (MG, MO), pp. 289–304.
CSLCSL-2012-Kuske #automation #morphism #order
Isomorphisms of scattered automatic linear orders (DK), pp. 455–469.
IJCARIJCAR-2012-BobotCCIMMM #integer
A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic (FB, SC, EC, MI, AM, AM, GM), pp. 67–81.
IJCARIJCAR-2012-FalkeK #induction
Rewriting Induction + Linear Arithmetic = Decision Procedure (SF, DK), pp. 241–255.
IJCARIJCAR-2012-HeamHK #logic
From Linear Temporal Logic Properties to Rewrite Propositions (PCH, VH, OK), pp. 316–331.
LICSLICS-2012-Nigam #complexity #logic #on the
On the Complexity of Linear Authorization Logics (VN), pp. 511–520.
LICSLICS-2012-SchalkS #logic #modelling #multi
Constructing Fully Complete Models for Multiplicative Linear Logic (AS, HPS), pp. 571–580.
ICSTSAT-2012-SlivovskyS #dependence
Computing Resolution-Path Dependencies in Linear Time , (FS, SS), pp. 58–71.
TAPTAP-2012-SulzmannZ #analysis #finite #logic
Constructive Finite Trace Analysis with Linear Temporal Logic (MS, AZ), pp. 132–148.
ICDARICDAR-2011-VinelDA #feature model #optimisation #random
Joint Optimization of Hidden Conditional Random Fields and Non Linear Feature Extraction (AV, TMTD, TA), pp. 513–517.
VLDBVLDB-2011-ChiMH #incremental #named #scheduling
iCBS: Incremental Costbased Scheduling under Piecewise Linear SLAs (YC, HJM, HH), pp. 563–574.
DLTDLT-J-2009-BloomE11 #algebra #order
Algebraic Linear Orderings (SLB, ), pp. 491–515.
AFLAFL-2011-IbarraS #bound
Characterizations of Bounded Semilinear Languages by One-Way and Two-way Deterministic Machines (OHI, SS), pp. 211–224.
CIAACIAA-2011-Ibarra #equivalence #on the #problem #transducer
On the Containment and Equivalence Problems for GSMs, Transducers, and Linear CFGs (OHI), pp. 190–202.
DLTDLT-2011-Esik #order
Scattered Context-Free Linear Orderings (), pp. 216–227.
DLTDLT-2011-MantaciM
From Linear Partitions to Parallelogram Polyominoes (RM, PM), pp. 350–361.
ICALPICALP-v1-2011-DurocherHMNS #constant
Range Majority in Constant Time and Linear Space (SD, MH, JIM, PKN, MS), pp. 244–255.
ICALPICALP-v2-2011-AhnG #problem #programming
Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem (KJA, SG), pp. 526–538.
ICALPICALP-v2-2011-CartonCP #order #regular expression #word
Regular Languages of Words over Countable Linear Orderings (OC, TC, GP), pp. 125–136.
ICALPICALP-v2-2011-FischerK #calculus #hybrid #model checking #μ-calculus
Model Checking the Quantitative μ-Calculus on Linear Hybrid Systems (DF, LK), pp. 404–415.
RTARTA-2011-DurandS #bound
Left-linear Bounded TRSs are Inverse Recognizability Preserving (ID, MS), pp. 361–376.
RTARTA-2011-KochemsO #analysis #functional #reachability #using
Improved Functional Flow and Reachability Analyses Using Indexed Linear Tree Grammars (JK, CHLO), pp. 187–202.
TLCATLCA-2011-Gimenez #difference #logic #normalisation #proving
Realizability Proof for Normalization of Full Differential Linear Logic (SG), pp. 107–122.
TLCATLCA-2011-Roversi #λ-calculus
Linear λ Calculus and Deep Inference (LR), pp. 184–197.
CIKMCIKM-2011-JangKFP #approximate #distance
A linear-time approximation of the earth mover’s distance (MHJ, SWK, CF, SP), pp. 505–514.
ICMLICML-2011-Bylander #learning #multi #polynomial
Learning Linear Functions with Quadratic and Linear Multiplicative Updates (TB), pp. 505–512.
ICMLICML-2011-Gould #learning #markov #random
Max-margin Learning for Lower Linear Envelope Potentials in Binary Markov Random Fields (SG), pp. 193–200.
ICMLICML-2011-LadickyT
Locally Linear Support Vector Machines (LL, PHST), pp. 985–992.
ICMLICML-2011-MeyerBS #approach #constraints
Linear Regression under Fixed-Rank Constraints: A Riemannian Approach (GM, SB, RS), pp. 545–552.
ICMLICML-2011-Potetz #problem #using
Estimating the Bayes Point Using Linear Knapsack Problems (BP), pp. 257–264.
KDDKDD-2011-ChangR #convergence #memory management #modelling #performance #scalability
Selective block minimization for faster convergence of limited memory large-scale linear models (KWC, DR), pp. 699–707.
KDDKDD-2011-MukerjeePG #algorithm #framework #mining #platform #semantics #sql
Linear scale semantic mining algorithms in microsoft SQL server’s semantic platform (KM, TP, SG), pp. 213–221.
SEKESEKE-2011-Amasaki #case study #consistency #estimation #nondeterminism #performance
A Study on Performance Inconsistency between Estimation by Analogy and Linear Regression (SA), pp. 485–488.
LOPSTRLOPSTR-2011-StroderESGF #analysis #complexity #prolog #semantics #termination
A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog (TS, FE, PSK, JG, CF), pp. 237–252.
PPDPPPDP-2011-ToninhoCP #type system
Dependent session types via intuitionistic linear type theory (BT, LC, FP), pp. 161–172.
CASECASE-2011-Gomez-GutierrezCRRG
Sliding mode observer for Switched Linear Systems (DGG, SC, ART, JJRL, SDG), pp. 725–730.
CASECASE-2011-MovafaghpourM #approach #probability #programming
A linear programming approach for probabilistic robot path planning with missing information of outcomes (MAM, EM), pp. 126–132.
CASECASE-2011-SchererCC #distributed #modelling #network
Transfer function modeling of linear dynamic networks for distributed MPC (HFS, EC, AC), pp. 613–618.
DACDAC-2011-ChaiJ #complexity #equation #matrix
Direct matrix solution of linear complexity for surface integral-equation based impedance extraction of high bandwidth interconnects (WC, DJ), pp. 206–211.
DACDAC-2011-MukherjeeFBL #automation #scalability
Automatic stability checking for large linear analog integrated circuits (PM, GPF, RB, PL), pp. 304–309.
ESOPESOP-2011-ChenMWC #analysis
Linear Absolute Value Relation Analysis (LC, AM, JW, PC), pp. 156–175.
FoSSaCSFoSSaCS-2011-Hoshino #functional #programming language
A Modified GoI Interpretation for a Linear Functional Programming Language and Its Adequacy (NH), pp. 320–334.
FoSSaCSFoSSaCS-2011-Kobayashi #algorithm #automaton #higher-order #model checking #recursion
A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes (NK0), pp. 260–274.
STOCSTOC-2011-AaronsonA #complexity
The computational complexity of linear optics (SA, AA), pp. 333–342.
STOCSTOC-2011-DinitzK #source code
Directed spanners via flow-based linear programs (MD, RK), pp. 323–332.
STOCSTOC-2011-KhotM #approximate #equation #np-hard
NP-hardness of approximately solving linear equations over reals (SK, DM), pp. 413–420.
TACASTACAS-2011-BarbotCHKM #model checking #performance #realtime
Efficient CTMC Model Checking of Linear Real-Time Objectives (BB, TC, TH, JPK, AM), pp. 128–142.
TACASTACAS-2011-GriggioLS #generative #integer #performance #satisfiability
Efficient Interpolant Generation in Satisfiability Modulo Linear Integer Arithmetic (AG, TTHL, RS), pp. 143–157.
CADECADE-2011-JovanovicM #integer
Cutting to the Chase Solving Linear Integer Arithmetic (DJ, LMdM), pp. 338–353.
CADECADE-2011-KorovinV #bound
Solving Systems of Linear Inequalities by Bound Propagation (KK, AV), pp. 369–383.
CAVCAV-2011-JohnC #algorithm #composition #equation #quantifier
A Quantifier Elimination Algorithm for Linear Modular Equations and Disequations (AKJ, SC), pp. 486–503.
CAVCAV-2011-KroeningOSWW #bound #model checking
Linear Completeness Thresholds for Bounded Model Checking (DK, JO, OS, TW, JW), pp. 557–572.
CSLCSL-2011-BesC #algebra #order
Algebraic Characterization of FO for Scattered Linear Orderings (AB, OC), pp. 67–81.
CSLCSL-2011-Kieronski #decidability #logic #order
Decidability Issues for Two-Variable Logics with Several Linear Orders (EK), pp. 337–351.
CSLCSL-2011-Vardi #branch #perspective #semantics
Branching vs. Linear Time: Semantical Perspective (MYV), p. 3.
ICLPICLP-J-2011-Haemmerle #concurrent #constraints #logic
Observational equivalences for linear logic concurrent constraint languages (RH), pp. 469–485.
LICSLICS-2011-Heijltjes #logic #proving
Proof Nets for Additive Linear Logic with Units (WH), pp. 207–216.
LICSLICS-2011-LagoG #dependent type
Linear Dependent Types and Relative Completeness (UDL, MG), pp. 133–142.
PODSPODS-2010-LiHRMM #difference #optimisation #privacy #query
Optimizing linear counting queries under differential privacy (CL, MH, VR, GM, AM), pp. 123–134.
VLDBVLDB-2010-LiPF
Parsimonious Linear Fingerprinting for Time Series (LL, BAP, CF), pp. 385–396.
ICALPICALP-v1-2010-BjorklundHKK
Covering and Packing in Linear Space (AB, TH, PK, MK), pp. 727–737.
ICALPICALP-v1-2010-PatrascuT #independence #on the
On the k-Independence Required by Linear Probing and Minwise Independence (MP, MT), pp. 715–726.
ICALPICALP-v2-2010-BraudC #automaton #order
Linear Orders in the Pushdown Hierarchy (LB, AC), pp. 88–99.
RTARTA-2010-DurandSS #bound #term rewriting #termination
Termination of linear bounded term rewriting systems (ID, GS, MS), pp. 341–356.
ICFPICFP-2010-MazurakZ #concurrent #logic #named
Lolliproc: to concurrency from classical linear logic via curry-howard and control (KM, SZ), pp. 39–50.
CHICHI-2010-BaillyLG #multi
Finger-count & radial-stroke shortcuts: 2 techniques for augmenting linear menus on multi-touch surfaces (GB, EL, YG), pp. 591–594.
ICMLICML-2010-BshoutyL #clustering #using
Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering (NHB, PML), pp. 135–142.
ICMLICML-2010-Martens10a #learning
Learning the Linear Dynamical System with ASOS (JM), pp. 743–750.
ICMLICML-2010-NairH #strict
Rectified Linear Units Improve Restricted Boltzmann Machines (VN, GEH), pp. 807–814.
ICMLICML-2010-PetrikTPZ #approximate #feature model #markov #process #source code #using
Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes (MP, GT, RP, SZ), pp. 871–878.
ICMLICML-2010-SonnenburgF #framework #named
COFFIN: A Computational Framework for Linear SVMs (SS, VF), pp. 999–1006.
ICPRICPR-2010-ArvanitopoulosBT #fault #subclass #using
Subclass Error Correcting Output Codes Using Fisher’s Linear Discriminant Ratio (NA, DB, AT), pp. 2953–2956.
ICPRICPR-2010-BushraOEO #detection
QRS Complex Detection by Non Linear Thresholding of Modulus Maxima (BJ, OB, EF, OL), pp. 4500–4503.
ICPRICPR-2010-ChenSW #distance #geometry #optimisation
Minimizing Geometric Distance by Iterative Linear Optimization (YC, JS, GW), pp. 1–4.
ICPRICPR-2010-ChiaSN #multimodal #towards
Towards a Best Linear Combination for Multimodal Biometric Fusion (CC, NS, LN), pp. 1176–1179.
ICPRICPR-2010-ErdoganS #classification #framework #learning
A Unifying Framework for Learning the Linear Combiners for Classifier Ensembles (HE, MUS), pp. 2985–2988.
ICPRICPR-2010-FaureF #composition
Linear Decomposition of Planar Shapes (AF, FF), pp. 1096–1099.
ICPRICPR-2010-GhanemA #recognition
Sparse Coding of Linear Dynamical Systems with an Application to Dynamic Texture Recognition (BG, NA), pp. 987–990.
ICPRICPR-2010-HuiWX
Globally-Preserving Based Locally Linear Embedding (KH, CW, BX), pp. 531–534.
ICPRICPR-2010-HuntyAG #modelling
Linear Facial Expression Transfer with Active Appearance Models (MdlH, AA, RG), pp. 3789–3792.
ICPRICPR-2010-JokoKY #learning #modelling
Learning Non-linear Dynamical Systems by Alignment of Local Linear Models (MJ, YK, TY), pp. 1084–1087.
ICPRICPR-2010-LathenCKB #detection #robust
Non-ring Filters for Robust Detection of Linear Structures (GL, OC, HK, MB), pp. 233–236.
ICPRICPR-2010-LeeWC #classification #multi
A Discriminative and Heteroscedastic Linear Feature Transformation for Multiclass Classification (HSL, HMW, BC), pp. 690–693.
ICPRICPR-2010-LiuWWY #adaptation #using
Pan-Sharpening Using an Adaptive Linear Model (LL, YW, YW, HY), pp. 4512–4515.
ICPRICPR-2010-NguyenD10a
Circularity Measuring in Linear Time (TPN, IDR), pp. 2098–2101.
ICPRICPR-2010-PlumptonKLJ #classification #online #using
On-Line fMRI Data Classification Using Linear and Ensemble Classifiers (COP, LIK, DEJL, SJJ), pp. 4312–4315.
ICPRICPR-2010-SrikrishnanC #analysis #using
Crowd Motion Analysis Using Linear Cyclic Pursuit (VS, SC), pp. 3340–3343.
ICPRICPR-2010-WangLL #3d #programming #using
Monocular 3D Tracking of Deformable Surfaces Using Linear Programming (CW, XL, YL), pp. 1710–1713.
ICPRICPR-2010-ZhangGA #analysis
An Information Theoretic Linear Discriminant Analysis Method (HZ, CG, KKA), pp. 4182–4185.
KDDKDD-2010-DangB #clustering
A hierarchical information theoretic technique for the discovery of non linear alternative clusterings (XHD, JB), pp. 573–582.
KDDKDD-2010-DurrantK #analysis #classification
Compressed fisher linear discriminant analysis: classification of randomly projected data (RJD, AK), pp. 1119–1128.
KDDKDD-2010-WangC #algorithm #modelling #performance
An efficient causal discovery algorithm for linear models (ZW, LC), pp. 1109–1118.
KDDKDD-2010-YuHCL #classification #in memory #memory management #scalability
Large linear classification when data cannot fit in memory (HFY, CJH, KWC, CJL), pp. 833–842.
KRKR-2010-PorelloE #combinator #logic #modelling
Modelling Combinatorial Auctions in Linear Logic (DP, UE).
PADLPADL-2010-AreiasR #implementation #order #performance
An Efficient Implementation of Linear Tabling Based on Dynamic Reordering of Alternatives (MA, RR), pp. 279–293.
PPDPPPDP-2010-BaillotH #logic #type inference
Type inference in intuitionistic linear logic (PB, MH), pp. 219–230.
PPDPPPDP-2010-Martinez #concurrent #constraints #programming #semantics
Semantics-preserving translations between linear concurrent constraint programming and constraint handling rules (TM), pp. 57–66.
QAPLQAPL-2010-CacheraJ #abstract interpretation #cost analysis #injection #modelling
Injecting Abstract Interpretations into Linear Cost Models (DC, AJ), pp. 64–81.
SASSAS-2010-MatringeMR #algebra #generative #hybrid #invariant
Generating Invariants for Non-linear Hybrid Systems by Linear Algebraic Methods (NM, AVM, RR), pp. 373–389.
SASSAS-2010-NasreG #analysis #equation #points-to
Points-to Analysis as a System of Linear Equations (RN, RG), pp. 422–438.
SACSAC-2010-ChakrabartiCGM #analysis #privacy
Privacy preserving linear discriminant analysis from perturbed data (SC, ZC, AG, SM), pp. 610–615.
SACSAC-2010-NepomucenoLA #clustering #correlation #metaheuristic
Evolutionary metaheuristic for biclustering based on linear correlations among genes (JAN, ATL, JSAR), pp. 1143–1147.
SACSAC-2010-RuggieriM #constraints
Variable ranges in linear constraints (SR, FM), pp. 2061–2065.
SACSAC-2010-ZhouCS #consistency #source code
Reparameterization based consistent graph-structured linear programs (HZ, QC, ZS), pp. 974–978.
CGOCGO-2010-WimmerF
Linear scan register allocation on SSA form (CW, MF), pp. 170–179.
DACDAC-2010-GuthausWR #optimisation #programming
Non-uniform clock mesh optimization with linear programming buffer insertion (MRG, GW, RR), pp. 74–79.
DACDAC-2010-ShenTX #algorithm #analysis #correlation #power management #statistics
A linear algorithm for full-chip statistical leakage power analysis considering weak spatial correlation (RS, SXDT, JX), pp. 481–486.
DACDAC-2010-XiongW #algorithm #constraints #grid #performance #power management #verification
An efficient dual algorithm for vectorless power grid verification under linear current constraints (XX, JW), pp. 837–842.
DATEDATE-2010-BuLWCL #bound #composition #hybrid #reachability
BACH 2 : Bounded reachability checker for compositional linear hybrid systems (LB, YL, LW, XC, XL), pp. 1512–1517.
DATEDATE-2010-FerentSGD #approach #embedded #network #programming
Linear programming approach for performance-driven data aggregation in networks of embedded sensors (CF, VS, MG, AD), pp. 1456–1461.
PDPPDP-2010-GaikwadT #gpu #parallel
Parallel Iterative Linear Solvers on GPU: A Financial Engineering Case (AG, IMT), pp. 607–614.
PPoPPPPoPP-2010-ChandramowlishwaranKV #algebra #concurrent #parallel #programming
Applying the concurrent collections programming model to asynchronous parallel dense linear algebra (AC, KK, RWV), pp. 345–346.
ESOPESOP-2010-BaillotGM #functional #logic
A PolyTime Functional Language from Light Linear Logic (PB, MG, VM), pp. 104–124.
STOCSTOC-2010-DeyHK #programming
Optimal homologous cycles, total unimodularity, and linear programming (TKD, ANH, BK), pp. 221–230.
STOCSTOC-2010-GuruswamiHK #on the #random
On the list-decodability of random linear codes (VG, JH, SK), pp. 409–416.
STOCSTOC-2010-KoppartyS #fault #random #testing
Local list-decoding and testing of random linear codes from high error (SK, SS), pp. 417–426.
WRLAWRLA-2010-BaeM #logic #maude #model checking
The Linear Temporal Logic of Rewriting Maude Model Checker (KB, JM), pp. 208–225.
CAVCAV-2010-MariMST #feedback #hybrid #synthesis
Synthesis of Quantized Feedback Control Software for Discrete Time Linear Hybrid Systems (FM, IM, IS, ET), pp. 180–195.
CAVCAV-2010-TorreMP #concurrent #interface #model checking #source code #using
Model-Checking Parameterized Concurrent Programs Using Linear Interfaces (SLT, PM, GP), pp. 629–644.
CSLCSL-2010-CookF #algebra
Formal Theories for Linear Algebra (SAC, LF), pp. 245–259.
CSLCSL-2010-Pous #algebra #logic #proving
Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic (DP), pp. 484–498.
ICLPICLP-2010-Guenot10 #calculus #logic #proving
Focused Proof Search for Linear Logic in the Calculus of Structures (NG), pp. 84–93.
ICLPICLP-2010-Martinez10 #concurrent #constraints #design #implementation #logic programming #programming language
Design and Implementation of a Concurrent Logic Programming Language with Linear Logic Constraints (TM), pp. 277–280.
IJCARIJCAR-2010-Bjorner #quantifier
Linear Quantifier Elimination as an Abstract Decision Procedure (NB), pp. 316–330.
IJCARIJCAR-2010-Schack-NielsenS #λ-calculus
Curry-Style Explicit Substitutions for the Linear and Affine Lambda Calculus (ASN, CS), pp. 1–14.
ICSTSAT-2010-FuhsS #satisfiability #source code #using
Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT (CF, PSK), pp. 71–84.
ICSTSAT-2010-PorschenSS #complexity #problem
Complexity Results for Linear XSAT-Problems (SP, TS, ES), pp. 251–263.
VMCAIVMCAI-2010-ChenMWC #abstract domain
An Abstract Domain to Discover Interval Linear Equalities (LC, AM, JW, PC), pp. 112–128.
VMCAIVMCAI-2010-SanchezL #logic
Regular Linear Temporal Logic with Past (CS, ML), pp. 295–311.
ICDARICDAR-2009-Abd-AlmageedKD #documentation #using
Page Rule-Line Removal Using Linear Subspaces in Monochromatic Handwritten Arabic Documents (WAA, JK, DSD), pp. 768–772.
ICDARICDAR-2009-BodicLAHLK #detection #graph #integer #programming #using
Symbol Detection Using Region Adjacency Graphs and Integer Linear Programming (PLB, HL, SA, PH, YL, AK), pp. 1320–1324.
ICDARICDAR-2009-HeLS #analysis #metric #novel #recognition
A Novel Rejection Measurement in Handwritten Numeral Recognition Based on Linear Discriminant Analysis (CLH, LL, CYS), pp. 451–455.
ICDARICDAR-2009-HuangDJG #adaptation #analysis #incremental #online #recognition #using
Writer Adaptive Online Handwriting Recognition Using Incremental Linear Discriminant Analysis (ZH, KD, LJ, XG), pp. 91–95.
PODSPODS-2009-Parys #complexity #evaluation #polynomial #xpath
XPath evaluation in linear time with polynomial combined complexity (PP), pp. 55–64.
VLDBVLDB-2009-ElmeleegyECAZ #approximate #online #precise
Online Piece-wise Linear Approximation of Numerical Streams with Precision Guarantees (HE, AKE, EC, WGA, WZ), pp. 145–156.
ICALPICALP-v1-2009-ChandranGR #complexity
The Tile Complexity of Linear Assemblies (HC, NG, JHR), pp. 235–253.
ICALPICALP-v2-2009-BodirskyJO
Semilinear Program Feasibility (MB, PJ, TvO), pp. 79–90.
ICALPICALP-v2-2009-MelliesTT #exponential #logic
An Explicit Formula for the Free Exponential Modality of Linear Logic (PAM, NT, CT), pp. 247–260.
FMFM-2009-SeidlVV #alias #analysis #polynomial
A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis (HS, VV, VV), pp. 644–659.
TLCATLCA-2009-FaggianP #partial order
Partial Orders, Event Structures and Linear Strategies (CF, MP), pp. 95–111.
TLCATLCA-2009-LagoH #bound #logic #revisited
Bounded Linear Logic, Revisited (UDL, MH), pp. 80–94.
TLCATLCA-2009-Strassburger #higher-order #logic #multi #proving
Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic (LS), pp. 309–324.
TLCATLCA-2009-Vaux #difference #logic
Differential Linear Logic and Polarization (LV), pp. 371–385.
CIKMCIKM-2009-ColazzoGPS #regular expression #xml
Linear inclusion for XML regular expression types (DC, GG, LP, CS), pp. 137–146.
ECIRECIR-2009-Ailon #algorithm #query #ranking #using
A Simple Linear Ranking Algorithm Using Query Dependent Intercept Variables (NA), pp. 685–690.
ICMLICML-2009-GermainLLM #classification #learning
PAC-Bayesian learning of linear classifiers (PG, AL, FL, MM), pp. 353–360.
ICMLICML-2009-HelleputteD #feature model #modelling
Partially supervised feature selection with regularized linear models (TH, PD), pp. 409–416.
ICMLICML-2009-HuangS #learning #sequence
Learning linear dynamical systems without sequence information (TKH, JGS), pp. 425–432.
ICMLICML-2009-LiuY #performance
Efficient Euclidean projections in linear time (JL, JY), pp. 657–664.
ICMLICML-2009-NickischS #modelling #scalability
Convex variational Bayesian inference for large scale generalized linear models (HN, MWS), pp. 761–768.
ICMLICML-2009-NowozinJ #clustering #graph #learning #programming
Solution stability in linear programming relaxations: graph partitioning and unsupervised learning (SN, SJ), pp. 769–776.
ICMLICML-2009-PetrikZ #approximate #constraints #source code
Constraint relaxation in approximate linear programs (MP, SZ), pp. 809–816.
ICMLICML-2009-SuttonMPBSSW #approximate #learning #performance
Fast gradient-descent methods for temporal-difference learning with linear function approximation (RSS, HRM, DP, SB, DS, CS, EW), pp. 993–1000.
KDDKDD-2009-FormanSR #classification
Feature shaping for linear SVM classifiers (GF, MS, SR), pp. 299–308.
KDDKDD-2009-ShiJ #statistics
Anomalous window discovery through scan statistics for linear intersecting paths (SSLIP) (LS, VPJ), pp. 767–776.
MLDMMLDM-2009-KobayashiS #classification #distributed #representation #using
A Linear Classification Method in a Very High Dimensional Space Using Distributed Representation (TK, IS), pp. 137–147.
PEPMPEPM-2009-SimmonsP #approximate #logic
Linear logical approximations (RJS, FP), pp. 9–20.
POPLPOPL-2009-Monniaux #abstraction #automation #composition #constraints
Automatic modular abstractions for linear constraints (DM), pp. 140–151.
POPLPOPL-2009-Simpson
Linear types for computational effects (AS), p. 301.
PPDPPPDP-2009-NigamM #algorithm #logic #specification
Algorithmic specifications in linear logic with subexponentials (VN, DM), pp. 129–140.
PPDPPPDP-2009-Vasconcelos #functional #parallel #programming #thread
Session types for linear multithreaded functional programming (VTV), pp. 1–6.
SASSAS-2009-ChenMWC #abstract domain
Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships (LC, AM, JW, PC), pp. 309–325.
ASEASE-2009-ArthoLHTY #branch #model checking
Cache-Based Model Checking of Networked Applications: From Linear to Branching Time (CA, WL, MH, YT, MY), pp. 447–458.
ASEASE-2009-DeanPMW #approach #automation #fault #locality #multi #programming
A Linear Programming Approach for Automated Localization of Multiple Faults (BCD, WBP, BAM, AAW), pp. 640–644.
SACSAC-2009-Djelloul #exponential #finite #infinity
From exponential to almost linear decomposability of finite or infinite trees (KD), pp. 897–902.
SACSAC-2009-Vaidya #privacy #programming
Privacy-preserving linear programming (JV), pp. 2002–2007.
SACSAC-2009-ZhangLZZZZ #first-order #optimisation
Optimizing techniques for saturated arithmetic with first-order linear recurrence (WZ, LL, CZ, HZ, BZ, CZ), pp. 1883–1889.
CASECASE-2009-RamakrishnanR #analysis
Delay-dependent stability analysis of linear system with additive time-varying delays (KR, GR), pp. 122–126.
CGOCGO-2009-VoronenkoMP #generative #library
Computer Generation of General Size Linear Transform Libraries (YV, FdM, MP), pp. 102–113.
DACDAC-2009-ArfaeeILFK #multi #named #performance
Xquasher: a tool for efficient computation of multiple linear expressions (AA, AI, NL, FF, RK), pp. 254–257.
DACDAC-2009-ChaiJK #3d #complexity #equation #scalability
A direct integral-equation solver of linear complexity for large-scale 3D capacitance and impedance extraction (WC, DJ, CKK), pp. 752–757.
DATEDATE-2009-JafriKBJ #flexibility
ASIP-based flexible MMSE-IC Linear Equalizer for MIMO turbo-equalization applications (ARJ, DK, AB, MJ), pp. 1620–1625.
DATEDATE-2009-MullerWJSM #approach #modelling #testing
An approach to linear model-based testing for nonlinear cascaded mixed-signal systems (RM, CW, HJJ, SS, HM), pp. 1662–1667.
PPoPPPPoPP-2009-Quintana-OrtiIQG #hardware #multi #platform
Solving dense linear systems on platforms with multiple hardware accelerators (GQO, FDI, ESQO, RAvdG), pp. 121–130.
STOCSTOC-2009-BarenboimE #distributed
Distributed (delta+1)-coloring in linear (in delta) time (LB, ME), pp. 111–120.
STOCSTOC-2009-ClarksonW #algebra #streaming
Numerical linear algebra in the streaming model (KLC, DPW), pp. 205–214.
STOCSTOC-2009-KannanN #programming #random
Random walks on polytopes and an affine interior point method for linear programming (RK, HN), pp. 561–570.
STOCSTOC-2009-KarpinskiS #approximate #game studies #problem
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems (MK, WS), pp. 313–322.
STOCSTOC-2009-RabaniS
Explicit construction of a small epsilon-net for linear threshold functions (YR, AS), pp. 649–658.
TACASTACAS-2009-SchollDPK #constraints #detection
Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints (CS, SD, FP, SK), pp. 383–397.
CADECADE-2009-BorrallerasLNRR #polynomial #satisfiability
Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic (CB, SL, RNM, ERC, AR), pp. 294–305.
CADECADE-2009-MaLZ #constraints
Volume Computation for Boolean Combination of Linear Arithmetic Constraints (FM, SL, JZ), pp. 453–468.
CAVCAV-2009-BjornerH #fixpoint #functional
Linear Functional Fixed-points (NB, JH), pp. 124–139.
CAVCAV-2009-DilligDA #integer #proving
Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers (ID, TD, AA), pp. 233–247.
CAVCAV-2009-Monniaux #float #on the #using
On Using Floating-Point Computations to Help an Exact Linear Arithmetic Decision Procedure (DM), pp. 570–583.
CSLCSL-2009-DuparcFM #automaton #decidability #game studies #problem
Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata (JD, AF, FM), pp. 225–239.
CSLCSL-2009-EggerMS #calculus
Enriching an Effect Calculus with Linear Types (JE, REM, AS), pp. 240–254.
CSLCSL-2009-FerreiraO #functional #logic
Functional Interpretations of Intuitionistic Linear Logic (GF, PO), pp. 3–19.
CSLCSL-2009-GheerbrantC
Craig Interpolation for Linear Temporal Languages (AG, BtC), pp. 287–301.
ISSTAISSTA-2009-ZhangHGXM #integer #programming #testing #using
Time-aware test-case prioritization using integer linear programming (LZ, SSH, CG, TX, HM), pp. 213–224.
LICSLICS-2009-PaganiT #logic #problem
The Inverse Taylor Expansion Problem in Linear Logic (MP, CT), pp. 222–231.
VMCAIVMCAI-2009-LavironL #approach #named #scalability
SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities (VL, FL), pp. 229–244.
PODSPODS-2008-BojanczykP #evaluation #xpath
XPath evaluation in linear time (MB, PP), pp. 241–250.
DLTDLT-2008-BassinoGN #complexity #finite #set #word
The Average State Complexity of the Star of a Finite Set of Words Is Linear (FB, LG, CN), pp. 134–145.
ICALPICALP-A-2008-CicaleseL #evaluation #programming
Function Evaluation Via Linear Programming in the Priced Information Model (FC, ESL), pp. 173–185.
ICALPICALP-A-2008-IwamaNPRY #network #polynomial
Polynomial-Time Construction of Linear Network Coding (KI, HN, MP, RR, SY), pp. 271–282.
ICALPICALP-A-2008-TedderCHP #composition #permutation #recursion
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations (MT, DGC, MH, CP), pp. 634–645.
ICALPICALP-B-2008-SimmonsP #algorithm #logic
Linear Logical Algorithms (RJS, FP), pp. 336–347.
LATALATA-2008-Kahramanogullari #concurrent #logic #on the
On Linear Logic Planning and Concurrency (OK), pp. 250–262.
RTARTA-2008-KojimaS #decidability #reachability #term rewriting
Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems (YK, MS), pp. 187–201.
FLOPSFLOPS-2008-Vidal #termination
Termination of Narrowing in Left-Linear Constructor Systems (GV), pp. 113–129.
ICFPICFP-2008-Henglein #sorting
Generic discrimination: sorting and paritioning unshared data in linear time (FH), pp. 91–102.
CIKMCIKM-2008-GhelliCS #regular expression
Linear time membership in a class of regular expressions with interleaving and counting (GG, DC, CS), pp. 389–398.
ICMLICML-2008-DredzeCP #classification
Confidence-weighted linear classification (MD, KC, FP), pp. 264–271.
ICMLICML-2008-HsiehCLKS #coordination #scalability
A dual coordinate descent method for large-scale linear SVM (CJH, KWC, CJL, SSK, SS), pp. 408–415.
ICMLICML-2008-Li #approximate #comparison #difference #worst-case
A worst-case comparison between temporal difference and residual gradient with linear function approximation (LL), pp. 560–567.
ICMLICML-2008-ParrLTPL #analysis #approximate #feature model #learning #modelling
An analysis of linear models, linear value-function approximation, and feature selection for reinforcement learning (RP, LL, GT, CPW, MLL), pp. 752–759.
ICMLICML-2008-RavikumarAW #convergence #message passing #source code
Message-passing for graph-structured linear programs: proximal projections, convergence and rounding schemes (PDR, AA, MJW), pp. 800–807.
ICMLICML-2008-RishGCPG #modelling #reduction
Closed-form supervised dimensionality reduction with generalized linear models (IR, GG, GAC, FP, GJG), pp. 832–839.
ICMLICML-2008-RothF #algorithm #modelling #performance
The Group-Lasso for generalized linear models: uniqueness of solutions and efficient algorithms (VR, BF), pp. 848–855.
ICMLICML-2008-SyedBS #learning #programming #using
Apprenticeship learning using linear programming (US, MHB, RES), pp. 1032–1039.
ICPRICPR-2008-ChenR #3d #algorithm #invariant #recognition
Linear time recognition algorithms for topological invariants in 3D (LC, YR), pp. 1–4.
ICPRICPR-2008-HuiW #clustering
Clustering-based locally linear embedding (KH, CW), pp. 1–4.
ICPRICPR-2008-LampertO #detection #image
Active contour detection of linear patterns in spectrogram images (TAL, SO), pp. 1–4.
ICPRICPR-2008-LiuWBM #kernel #learning
Semi-supervised learning by locally linear embedding in kernel space (RL, YW, TB, DM), pp. 1–4.
ICPRICPR-2008-ParkCDK #analysis #clustering
Linear discriminant analysis for data with subcluster structure (HP, JC, BLD, JK), pp. 1–4.
ICPRICPR-2008-TranTJ #anti #network #probability
An adjustable combination of linear regression and modified probabilistic neural network for anti-spam filtering (TPT, PT, TJ), pp. 1–4.
ICPRICPR-2008-WuJP #detection #effectiveness
Effective features based on normal linear structures for detecting microcalcifications in mammograms (ZQW, JJ, YP), pp. 1–4.
KDDKDD-2008-KeerthiSCHL #multi #scalability
A sequential dual method for large scale multi-class linear svms (SSK, SS, KWC, CJH, CJL), pp. 408–416.
KDDKDD-2008-LiFGMF #learning #named #parallel #performance
Cut-and-stitch: efficient parallel learning of linear dynamical systems on smps (LL, WF, FG, TCM, CF), pp. 471–479.
KDDKDD-2008-SongJRG
A bayesian mixture model with linear regression mixing proportions (XS, CJ, SR, JG), pp. 659–667.
LOPSTRLOPSTR-2008-BandaG #analysis #hybrid
Analysis of Linear Hybrid Systems in CLP (GB, JPG), pp. 55–70.
PLDIPLDI-2008-Terauchi #programming
Checking race freedom via linear programming (TT), pp. 1–10.
PPDPPPDP-2008-PaoliniP #programming language #semantics
Semantically linear programming languages (LP, MP), pp. 97–107.
QAPLQAPL-2008-FaellaLS #logic #model checking
Model Checking Quantitative Linear Time Logic (MF, AL, MS), pp. 61–77.
SASSAS-2008-RuggieriM #constraints #source code #type system
Typing Linear Constraints for Moding CLP() Programs (SR, FM), pp. 128–143.
SACSAC-2008-ZhuDXW #documentation #image #using
Perspective rectification of camera-based document images using local linear structure (YZ, RD, BX, CW), pp. 451–452.
DACDAC-2008-CzajkowskiB #composition #logic #synthesis
Functionally linear decomposition and synthesis of logic circuits for FPGAs (TSC, SDB), pp. 18–23.
DACDAC-2008-YanZTCM #distributed #named #network #order #reduction
DeMOR: decentralized model order reduction of linear networks with massive ports (BY, LZ, SXDT, JC, BM), pp. 409–414.
DACDAC-2008-YeZP #analysis #equation #multi
Generalized Krylov recycling methods for solution of multiple related linear equation systems in electromagnetic analysis (ZY, ZZ, JRP), pp. 682–687.
DATEDATE-2008-Parandeh-AfsharBI #integer #programming #synthesis
Improving Synthesis of Compressor Trees on FPGAs via Integer Linear Programming (HPA, PB, PI), pp. 1256–1261.
HPDCHPDC-2008-YouseffSYDW #algebra #kernel #memory management
The impact of paravirtualized memory hierarchy on linear algebra computational kernels and software (LY, KS, HY, JD, RW), pp. 141–152.
PPoPPPPoPP-2008-DiamondRKGGB #algebra #distributed #performance
High performance dense linear algebra on a spatially distributed processor (JRD, BR, SWK, RAvdG, KG, DB), pp. 63–72.
ESOPESOP-2008-KanekoK #classification
Linear Declassification (YK, NK), pp. 224–238.
ESOPESOP-2008-TerauchiM #bound #programming
Inferring Channel Buffer Bounds Via Linear Programming (TT, AM), pp. 284–298.
FoSSaCSFoSSaCS-2008-Bozzelli #complexity
The Complexity of CTL* + Linear Past (LB), pp. 186–200.
STOCSTOC-2008-AwerbuchK #distributed #source code
Stateless distributed gradient descent for positive linear programs (BA, RK), pp. 691–700.
STOCSTOC-2008-DasK #algorithm #set
Algorithms for subset selection in linear regression (AD, DK), pp. 45–54.
STOCSTOC-2008-KawarabayashiM #graph #morphism
Graph and map isomorphism and all polyhedral embeddings in linear time (KiK, BM), pp. 471–480.
CAVCAV-2008-CohenN #concurrent #proving #source code
Local Proofs for Linear-Time Properties of Concurrent Programs (AC, KSN), pp. 149–161.
CAVCAV-2008-JainCG #composition #equation #performance
Efficient Craig Interpolation for Linear Diophantine (Dis)Equations and Linear Modular Equations (HJ, EMC, OG), pp. 254–267.
CAVCAV-2008-PiskacK
Linear Arithmetic with Stars (RP, VK), pp. 268–280.
CSLCSL-2008-Eisinger #automaton #bound #integer
Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (JE), pp. 431–445.
CSLCSL-2008-HamanoT #logic #multi
An Indexed System for Multiplicative Additive Polarized Linear Logic (MH, RT), pp. 262–277.
CSLCSL-2008-LagoL #game studies #logic #semantics
Quantitative Game Semantics for Linear Logic (UDL, OL), pp. 230–245.
CSLCSL-2008-PiskacK #bound
Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars (RP, VK), pp. 124–138.
CSLCSL-2008-Tranquilli #correctness #logic #multi #semantics
A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic (PT), pp. 246–261.
IJCARIJCAR-2008-NigamM #logic
Focusing in Linear Meta-logic (VN, DM), pp. 507–522.
IJCARIJCAR-2008-Nipkow #quantifier
Linear Quantifier Elimination (TN), pp. 18–33.
ICSTSAT-2008-FaureNOR #formal method #satisfiability
SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers (GF, RN, AO, ERC), pp. 77–90.
ICSTSAT-2008-PorschenS
A CNF Class Generalizing Exact Linear Formulas (SP, ES), pp. 231–245.
ICDARICDAR-2007-GaoWHD #documentation #image #integer #programming #using
Decompose Document Image Using Integer Linear Programming (DG, YW, HH, MD), pp. 397–401.
ICDARICDAR-2007-RamirezTBR #algorithm #robust
Quantile Linear Algorithm for Robust Binarization of Digitalized Letters (MR, ET, MB, RR), pp. 1158–1162.
VLDBVLDB-2007-VoM #named
RadixZip: Linear-Time Compression of Token Streams (BV, GSM), pp. 1162–1172.
CIAACIAA-2007-Vardi #automaton #model checking
Linear-Time Model Checking: Automata Theory in Practice (MYV), pp. 5–10.
ICALPICALP-2007-GuoN #graph #kernel #np-hard #problem
Linear Problem Kernels for NP-Hard Problems on Planar Graphs (JG, RN), pp. 375–386.
RTARTA-2007-Vaux #on the
On Linear Combinations of λ-Terms (LV), pp. 374–388.
TLCATLCA-2007-Baillot #logic #polynomial #type system
From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing (PB), pp. 2–7.
TLCATLCA-2007-FaggianP #π-calculus
Ludics is a Model for the Finitary Linear π-Calculus (CF, MP), pp. 148–162.
TLCATLCA-2007-Fiore #difference #logic #modelling #multi
Differential Structure in Models of Multiplicative Biadditive Intuitionistic Linear Logic (MPF), pp. 163–177.
HCIDHM-2007-VolzBHK #automation #generative #metric #using
Automatic, Body Measurements Based Generation of Individual Avatars Using Highly Adjustable Linear Transformation (AV, RB, SH, KK), pp. 453–459.
HCIDHM-2007-ZhangZPY #analysis #multi
Estimating Mental Fatigue Based on Multichannel Linear Descriptors Analysis (CZ, CZ, XmP, XY), pp. 521–529.
HCIHIMI-MTT-2007-SongQLPZ #named #navigation
LensList: Browsing and Navigating Long Linear Information Structures (HS, YQ, YL, HP, LZ), pp. 535–543.
ICMLICML-2007-McNeillV #generative #modelling #probability
Linear and nonlinear generative probabilistic class models for shape contours (GM, SV), pp. 617–624.
ICMLICML-2007-PhuaF #approximate #learning
Tracking value function dynamics to improve reinforcement learning with piecewise linear function approximation (CWP, RF), pp. 751–758.
ICMLICML-2007-XuF #learning #on the #ranking
On learning linear ranking functions for beam search (YX, AF), pp. 1047–1054.
ICMLICML-2007-Ye #analysis
Least squares linear discriminant analysis (JY), pp. 1087–1093.
ICMLICML-2007-YoganandaMG #performance
A fast linear separability test by projection of positive points on subspaces (APY, MNM, LG), pp. 713–720.
KDDKDD-2007-VogelAS #scalability
Scalable look-ahead linear regression trees (DSV, OA, TS), pp. 757–764.
SEKESEKE-2007-SalamahKG #generative #logic #specification
Generating Linear Temporal Logic Formulas for Pattern-Based Specifications (SS, VK, AQG), pp. 422–427.
ECOOPECOOP-2007-DegenTW #java
Tracking Linear and Affine Resources with Java(X) (MD, PT, SW), pp. 550–574.
PADLPADL-2007-Liang #aspect-oriented #higher-order #logic #programming
Aspect-Oriented Programming in Higher-Order and Linear Logic (CCL), pp. 305–319.
SACSAC-2007-BordeauxZ #constraints #quantifier
A solver for quantified Boolean and linear constraints (LB, LZ), pp. 321–325.
SACSAC-2007-FeydyS #equation #integer
Propagating dense systems of integer linear equations (TF, PJS), pp. 306–310.
CASECASE-2007-YiDZ0 #analysis #clustering #throughput #tool support
Throughput Analysis of Linear Cluster Tools (JY, SD, MTZ, PvdM), pp. 1063–1068.
CASECASE-2007-ZuHT #coordination #generative #integer #programming #using
Trajectory Generation in Relative Velocity Coordinates Using Mixed Integer Linear Programming with IHDR Guidance (DZ, JH, DT), pp. 1125–1130.
CCCC-2007-NagarakatteG #integer #pipes and filters #programming #scheduling #using
Register Allocation and Optimal Spill Code Scheduling in Software Pipelined Loops Using 0-1 Integer Linear Programming Formulation (SGN, RG), pp. 126–140.
CCCC-2007-SarkarB
Extended Linear Scan: An Alternate Foundation for Global Register Allocation (VS, RB), pp. 141–155.
DACDAC-2007-FangHC #algorithm #design #integer #programming
An Integer Linear Programming Based Routing Algorithm for Flip-Chip Design (JWF, CHH, YWC), pp. 606–611.
ESOPESOP-2007-SeidlFP #difference
Interprocedurally Analysing Linear Inequality Relations (HS, AF, MP), pp. 284–299.
FoSSaCSFoSSaCS-2007-BaulandSSSV #complexity #logic #satisfiability
The Complexity of Generalized Satisfiability for Linear Temporal Logic (MB, TS, HS, IS, HV), pp. 48–62.
STOCSTOC-2007-KawarabayashiR
Computing crossing number in linear time (KiK, BAR), pp. 382–390.
STOCSTOC-2007-PaghPR #constant #independence
Linear probing with constant independence (AP, RP, MR), pp. 318–327.
TACASTACAS-2007-ArmandoBM #abstraction #array #refinement #source code
Abstraction Refinement of Linear Programs with Arrays (AA, MB, JM), pp. 373–388.
CAVCAV-2007-BeckerDEK #constraints #integer #named
LIRA: Handling Constraints of Linear Arithmetics over the Integers and the Reals (BB, CD, JE, FK), pp. 307–310.
CAVCAV-2007-Segelken #abstraction #automaton #hybrid #model checking #modelling
Abstraction and Counterexample-Guided Construction of ω-Automata for Model Checking of Step-Discrete Linear Hybrid Models (MS), pp. 433–448.
CSLCSL-2007-Hoshino
Linear Realizability (NH), pp. 420–434.
CSLCSL-2007-KorovinV #calculus
Integrating Linear Arithmetic into Superposition Calculus (KK, AV), pp. 223–237.
CSLCSL-2007-MillerS #composition #logic #proving
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic (DM, AS), pp. 405–419.
ICLPICLP-2007-OikarinenJ #logic programming
A Linear Transformation from Prioritized Circumscription to Disjunctive Logic Programming (EO, TJ), pp. 440–441.
LICSLICS-2007-Oliva #logic
Modified Realizability Interpretation of Classical Linear Logic (PO), pp. 431–442.
ICSTSAT-2007-Kojevnikov #bound
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities (AK), pp. 70–79.
SIGMODSIGMOD-2006-JainAAKPSV #design #evaluation #implementation
Design, implementation, and evaluation of the linear road bnchmark on the stream processing core (NJ, LA, HA, RK, YP, PS, CV), pp. 431–442.
VLDBVLDB-2006-KanneM #algorithm #approximate #clustering
A Linear Time Algorithm for Optimal Tree Sibling Partitioning and Approximation Algorithms in Natix (CCK, GM), pp. 91–102.
DLTDLT-J-2005-BesC06 #order #theorem #word
A Kleene Theorem for Languages of Words Indexed by Linear Orderings (AB, OC), pp. 519–542.
CIAACIAA-2006-GalvezSF #bound #lookahead #parsing
Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time (JFG, SS, JF), pp. 253–264.
ICALPICALP-v1-2006-GairingMT #game studies #latency
Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions (MG, BM, KT), pp. 501–512.
ICALPICALP-v2-2006-GuerriniM #commutative #logic #multi #quantifier
Commutative Locative Quantifiers for Multiplicative Linear Logic (SG, PM), pp. 396–407.
RTARTA-2006-GramlichL #term rewriting
Generalizing Newman’s Lemma for Left-Linear Rewrite Systems (BG, SL), pp. 66–80.
RTARTA-2006-OhtaH #confluence #λ-calculus
A Terminating and Confluent Linear λ Calculus (YO, MH), pp. 166–180.
RTARTA-2006-Salvati #equation #type system #λ-calculus
Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear λ-Calculus (SS), pp. 151–165.
RTARTA-2006-WangS #decidability #termination
Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems (YW, MS), pp. 343–356.
HaskellHaskell-2006-Eaton #algebra #haskell #static typing
Statically typed linear algebra in Haskell (FE), pp. 120–121.
ICEISICEIS-AIDSS-2006-SombattheeraG #algorithm #distributed
A Distributed Algorithm for Coalition Formation in Linear Production Domain (CS, AG), pp. 17–22.
CIKMCIKM-2006-YeXLJBCK #analysis #performance
Efficient model selection for regularized linear discriminant analysis (JY, TX, QL, RJ, JB, VC, CK), pp. 532–539.
ICMLICML-2006-KimMSBL #classification
Pareto optimal linear classification (SJK, AM, SS, SPB, JL), pp. 473–480.
ICMLICML-2006-WangZ
Label propagation through linear neighborhoods (FW, CZ), pp. 985–992.
ICMLICML-2006-WingateS #kernel #modelling #predict #probability
Kernel Predictive Linear Gaussian models for nonlinear stochastic dynamical systems (DW, SPS), pp. 1017–1024.
ICMLICML-2006-YeX #analysis #null #orthogonal
Null space versus orthogonal linear discriminant analysis (JY, TX), pp. 1073–1080.
ICPRICPR-v1-2006-ConduracheA #2d #classification #image #segmentation #using
Vessel Segmentation in 2D-Projection Images Using a Supervised Linear Hysteresis Classifier (AC, TA), pp. 343–346.
ICPRICPR-v1-2006-LiuD #analysis #performance #recognition
Improve Handwritten Character Recognition Performance by Heteroscedastic Linear Discriminant Analysis (HL, XD), pp. 880–883.
ICPRICPR-v1-2006-LublinermanOZC #process #recognition #using #validation
Activity Recognition from Silhouettes using Linear Systems and Model (In)validation Techniques (RL, NO, DZ, OIC), pp. 347–350.
ICPRICPR-v1-2006-WangKY #2d #analysis #recognition
Bilateral Two Dimensional Linear Discriminant Analysis for Stereo Face Recognition (JGW, HK, WYY), pp. 429–432.
ICPRICPR-v1-2006-YingZ #approach #image #novel
A Novel Linear Approach to Camera Calibration from Sphere Images (XY, HZ), pp. 535–538.
ICPRICPR-v2-2006-AnR #novel #recognition
Novel Mathematical Model for Enhanced Fisher’s Linear Discriminant and Its Application to Face Recognition (GA, QR), pp. 524–527.
ICPRICPR-v2-2006-InoueU #2d #analysis
Non-Iterative Two-Dimensional Linear Discriminant Analysis (KI, KU), pp. 540–543.
ICPRICPR-v2-2006-LiangZ #feature model
Feature selection for linear support vector machines (ZL, TZ), pp. 606–609.
ICPRICPR-v2-2006-Loog #analysis
Conditional Linear Discriminant Analysis (ML), pp. 387–390.
ICPRICPR-v2-2006-SunV #detection #multi #performance #using
Fast Linear Feature Detection Using Multiple Directional Non-Maximum Suppression (CS, PV), pp. 288–291.
ICPRICPR-v2-2006-TangT #analysis #performance #using
Fast Linear Discriminant Analysis Using Binary Bases (FT, HT), pp. 52–55.
ICPRICPR-v2-2006-UekiHK #2d #analysis #classification
Two-dimensional Heteroscedastic Linear Discriminant Analysis for Age-group Classification (KU, TH, TK), pp. 585–588.
ICPRICPR-v3-2006-ArreolaFB #classification #performance #using
Fast Support Vector Machine Classification using linear SVMs (KZA, JF, HB), pp. 366–369.
ICPRICPR-v3-2006-HoppeS #algorithm #modelling
Fusion Algorithm for Locally Arranged Linear Models (FH, GS), pp. 1208–1211.
ICPRICPR-v4-2006-HoppeS06a #algorithm #modelling
Fusion Algorithm for Locally Arranged Linear Models (FH, GS), p. 951.
ICPRICPR-v4-2006-PeursumVW
Observation-Switching Linear Dynamic Systems for Tracking Humans Through Unexpected Partial Occlusions by Scene Objects (PP, SV, GAWW), pp. 929–934.
ICPRICPR-v4-2006-TaxD #optimisation
Linear model combining by optimizing the Area under the ROC curve (DMJT, RPWD), pp. 119–122.
ICPRICPR-v4-2006-VandeportaeleCMG
A New Linear Calibration Method for Paracatadioptric Cameras (BV, MC, PM, PG), pp. 647–651.
ICPRICPR-v4-2006-Yang #graph
Building Connected Neighborhood Graphs for Locally Linear Embedding (LY), pp. 194–197.
KDDKDD-2006-Joachims
Training linear SVMs in linear time (TJ), pp. 217–226.
KDDKDD-2006-RosalesF #learning #metric #programming
Learning sparse metrics via linear programming (RR, GF), pp. 367–373.
KDDKDD-2006-ZhangPD #categorisation #graph #modelling #predict
Linear prediction models with graph regularization for web-page categorization (TZ, AP, BD), pp. 821–826.
SIGIRSIGIR-2006-SindhwaniK #scalability
Large scale semi-supervised linear SVMs (VS, SSK), pp. 477–484.
SIGIRSIGIR-2006-ZhangOFM #analysis #recommendation
Analysis of a low-dimensional linear model under recommendation attacks (SZ, YO, JF, FM), pp. 517–524.
SASSAS-2006-GonnordH #analysis
Combining Widening and Acceleration in Linear Relation Analysis (LG, NH), pp. 144–160.
SACSAC-2006-AltLM #on the #probability #problem #using
On the numerical solution to linear problems using stochastic arithmetic (RA, JLL, SM), pp. 1635–1639.
SACSAC-2006-MontanesCRD #categorisation #feature model #metric
Finding optimal linear measures for feature selection in text categorization (EM, EFC, JR, ID), pp. 861–862.
SACSAC-2006-SinghXMH #geometry #locality #problem #programming #using
Solving the brachytherapy seed localization problem using geometric and linear programming techniques (VS, LM, JX, KRH), pp. 229–234.
GPCEGPCE-2006-PerryJW #contract #logic
Expressing heap-shape contracts in linear logic (FP, LJ, DW), pp. 101–110.
CASECASE-2006-ChenYTCW #difference #fuzzy #hybrid #matrix
Applying the Linear Matrix Inequality for Hybrid Fuzzy/H-infinity Control of Active Structural Damping (CWC, KY, CHT, CYC, DJW), pp. 678–682.
CASECASE-2006-LiLWC #automation #component #equation #generative #graph #using
Automatic Generation of Component-level Dynamic Equations Using Extensible Element Linear Graph Method (YL, ZL, HW, YC), pp. 118–123.
CASECASE-2006-ShangYQ #algorithm #equation
Algorithm of Two-Step Eye-Hand Calibration by Resolving Linear Equations (YS, QY, ZQ), pp. 218–222.
CASECASE-2006-ShaoHM #algorithm #analysis #component #multi #using
Quantitative Analysis Using NIR by Building Principal Component- Multiple Linear Regression-BP Algorithm (YS, YH, JM), pp. 161–164.
CASECASE-2006-XieLP #hybrid
The hybrid calibration of linear structured light system (KX, WYL, ZBP), pp. 611–614.
DACDAC-2006-AksoyCFM #constraints #integer #optimisation #programming #satisfiability #synthesis #using
Optimization of area under a delay constraint in digital filter synthesis using SAT-based integer linear programming (LA, EACdC, PFF, JM), pp. 669–674.
DACDAC-2006-LiS #network #order #reduction
Model order reduction of linear networks with massive ports via frequency-dependent port packing (PL, WS), pp. 267–272.
DACDAC-2006-ZhaoPSYF #algorithm #megamodelling #performance #programming #using
A fast on-chip decoupling capacitance budgeting algorithm using macromodeling and linear programming (MZ, RP, SS, SY, YF), pp. 217–222.
DATEDATE-2006-DhayniMRB #functional #pseudo
Pseudorandom functional BIST for linear and nonlinear MEMS (AD, SM, LR, AB), pp. 664–669.
DATEDATE-DF-2006-FanucciCSKWSALM #design #image #synthesis
ASIP design and synthesis for non linear filtering in image processing (LF, MC, SS, DK, EMW, OS, GA, RL, HM), pp. 233–238.
HPCAHPCA-2006-JosephVT #analysis #modelling #performance #using
Construction and use of linear regression models for processor performance analysis (PJJ, KV, MJT), pp. 99–108.
ESOPESOP-2006-FluetMA
Linear Regions Are All You Need (MF, GM, AJA), pp. 7–21.
ESOPESOP-2006-GulwaniT #abstraction
Assertion Checking over Combined Abstraction of Linear Arithmetic and Uninterpreted Functions (SG, AT), pp. 279–293.
STOCSTOC-2006-DevanurKSV #problem
Integrality gaps for sparsest cut and minimum linear arrangement problems (NRD, SK, RS, NKV), pp. 537–546.
STOCSTOC-2006-KelnerS #algorithm #polynomial #programming #random
A randomized polynomial-time simplex algorithm for linear programming (JAK, DAS), pp. 51–60.
STOCSTOC-2006-NesetrilM #algorithm
Linear time low tree-width partitions and algorithmic consequences (JN, POdM), pp. 391–400.
STOCSTOC-2006-Zuckerman #clique
Linear degree extractors and the inapproximability of max clique and chromatic number (DZ), pp. 681–690.
CAVCAV-2006-Braverman #integer #source code #termination
Termination of Integer Linear Programs (MB), pp. 372–385.
CAVCAV-2006-RosuB #logic #ltl #monitoring #synthesis
Allen Linear (Interval) Temporal Logic — Translation to LTL and Monitor Synthesis (GR, SB), pp. 263–277.
CSLCSL-2006-AlvesFFM #power of
The Power of Linear Functions (SA, MF, MF, IM), pp. 119–134.
CSLCSL-2006-Bagan #query
MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay (GB), pp. 167–181.
CSLCSL-2006-Pagani #exponential #logic #multi
Acyclicity and Coherence in Multiplicative Exponential Linear Logic (MP), pp. 531–545.
FATESFATES-RV-2006-ArmoniKTVZ #monitoring
Deterministic Dynamic Monitors for Linear-Time Assertions (RA, DK, AT, MYV, YZ), pp. 163–177.
ICLPICLP-2006-SilvaRL #implementation #prolog
An External Module for Implementing Linear Tabling in Prolog (CS, RR, RL), pp. 429–430.
IJCARIJCAR-2006-HendrixMO #axiom #order #specification
A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms (JH, JM, HO), pp. 151–155.
IJCARIJCAR-2006-LahiriM #constraints
Solving Sparse Linear Constraints (SKL, MM), pp. 468–482.
LICSLICS-2006-BarthM #logic #using
Managing Digital Rights using Linear Logic (AB, JCM), pp. 127–136.
LICSLICS-2006-Lago #complexity #logic #semantics
Context Semantics, Linear Logic and Computational Complexity (UDL), pp. 169–178.
ICSTSAT-2006-PorschenSR #on the
On Linear CNF Formulas (SP, ES, BR), pp. 212–225.
ICSTSAT-2006-YuM #constraints #learning #smt
Lemma Learning in SMT on Linear Constraints (YY, SM), pp. 142–155.
VMCAIVMCAI-2006-HristovaL #algorithm #automaton #logic #model checking
Improved Algorithm Complexities for Linear Temporal Logic Model Checking of Pushdown Systems (KH, YAL), pp. 190–206.
VMCAIVMCAI-2006-JabbarE #model checking #parallel
Parallel External Directed Model Checking with Linear I/O (SJ, SE), pp. 237–251.
MSRMSR-2005-AntoniolRV #mining #predict #repository
Linear predictive coding and cepstrum coefficients for mining time variant information from software repositories (GA, VFR, GV), pp. 61–65.
DLTDLT-J-2004-RispalC05 #order #set
Complementation of rational sets on countable scattered linear orderings (CR, OC), pp. 767–786.
CIAACIAA-2005-FujiyoshiK #automaton #recognition
Deterministic Recognition of Trees Accepted by a Linear Pushdown Tree Automaton (AF, IK), pp. 129–140.
CIAACIAA-2005-KleinB #automaton #logic
Experiments with Deterministic ω-Automata for Formulas of Linear Temporal Logic (JK, CB), pp. 199–212.
DLTDLT-2005-BedonR #order #theorem #word
Schützenberger and Eilenberg Theorems for Words on Linear Orderings (NB, CR), pp. 134–145.
DLTDLT-2005-BesC #order #theorem #word
A Kleene Theorem for Languages of Words Indexed by Linear Orderings (AB, OC), pp. 158–167.
ICALPICALP-2005-CzeizlerK #automaton #bound
A Tight Linear Bound on the Neighborhood of Inverse Cellular Automata (EC, JK), pp. 410–420.
ICALPICALP-2005-Hast #approximate #named #random
Approximating — Outperforming a Random Assignment with Almost a Linear Factor (GH), pp. 956–968.
ICALPICALP-2005-KumarSS #algorithm #clustering #problem
Linear Time Algorithms for Clustering Problems in Any Dimensions (AK, YS, SS), pp. 1374–1385.
RTARTA-2005-GeserHWZ #automaton #on the #term rewriting #termination
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems (AG, DH, JW, HZ), pp. 353–367.
RTARTA-2005-Simpson #reduction #semantics #λ-calculus
Reduction in a Linear λ-Calculus with Applications to Operational Semantics (AKS), pp. 219–234.
RTARTA-2005-Yoshinaka #higher-order #λ-calculus
Higher-Order Matching in the Linear λ Calculus in the Absence of Constants Is NP-Complete (RY), pp. 235–249.
TLCATLCA-2005-MorrisettAF #named
L3: A Linear Language with Locations (GM, AJA, MF), pp. 293–307.
AIIDEAIIDE-2005-RiedlY #branch #generative #graph
From Linear Story Generation to Branching Story Graphs (MOR, RMY), pp. 111–116.
ICMLICML-2005-RothY #integer #programming #random
Integer linear programming inference for conditional random fields (DR, WtY), pp. 736–743.
ICMLICML-2005-WuMR #classification #detection #symmetry
Linear Asymmetric Classifier for cascade detectors (JW, MDM, JMR), pp. 988–995.
KDDKDD-2005-FungSR
Rule extraction from linear support vector machines (GF, SS, RBR), pp. 32–40.
KDDKDD-2005-Sandler #classification #on the #programming #using
On the use of linear programming for unsupervised text classification (MS), pp. 256–264.
MLDMMLDM-2005-Bak #classification #multi
A New Multidimensional Feature Transformation for Linear Classifiers and Its Applications (EB), pp. 275–284.
MLDMMLDM-2005-HaralickH #clustering
Linear Manifold Clustering (RMH, RH), pp. 132–141.
SEKESEKE-2005-WangWH #hybrid #verification
Verifying Timed and Linear Hybrid Rule-Systems with RED (FW, RSW, GDH), pp. 448–454.
SIGIRSIGIR-2005-GaoQXN #information retrieval
Linear discriminant model for information retrieval (JG, HQ, XX, JYN), pp. 290–297.
PPDPPPDP-2005-LopezPPW #concurrent #logic programming #monad
Monadic concurrent linear logic programming (PL, FP, JP, KW), pp. 35–46.
SACSAC-2005-GuoLLW #problem
The shortest route cut and fill problem in linear topological structure (SG, WL, AL, FW), pp. 409–410.
SACSAC-2005-Hosobe #constraints #documentation #layout #web
Solving linear and one-way constraints for web document layout (HH), pp. 1252–1253.
SACSAC-2005-JanejaA #detection #named #semantics #statistics
LS3: a Linear Semantic Scan Statistic technique for detecting anomalous windows (VPJ, VA), pp. 493–497.
DACDAC-2005-JiangCC #3d #algorithm #named #order
ICCAP: a linear time sparse transformation and reordering algorithm for 3D BEM capacitance extraction (RJ, YHC, CCPC), pp. 163–166.
DACDAC-2005-WanR #reduction
Operator-based model-order reduction of linear periodically time-varying systems (YW, JSR), pp. 391–396.
DATEDATE-2005-BalakrishnanT #configuration management #using
Reconfigurable Linear Decompressors Using Symbolic Gaussian Elimination (KJB, NAT), pp. 1130–1135.
PPoPPPPoPP-2005-DarteS #algorithm
A linear-time algorithm for optimal barrier placement (AD, RS), pp. 26–35.
PPoPPPPoPP-2005-LowGZ #algebra #algorithm #parallel #specification
Extracting SMP parallelism for dense linear algebra algorithms from high-level specifications (TML, RAvdG, FGVZ), pp. 153–163.
STOCSTOC-2005-Regev #encryption #fault #learning #on the #random
On lattices, learning with errors, random linear codes, and cryptography (OR), pp. 84–93.
TACASTACAS-2005-BozzanoBCJRSS #incremental #logic #satisfiability
An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic (MB, RB, AC, TAJ, PvR, SS, RS), pp. 317–333.
CADECADE-2005-ChaudhuriP #first-order #logic #proving #theorem proving
A Focusing Inverse Method Theorem Prover for First-Order Linear Logic (KC, FP), pp. 69–83.
CADECADE-2005-GodoyT #term rewriting #termination
Termination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules (GG, AT), pp. 164–176.
CAVCAV-2005-BradleyMS #ranking #reachability
Linear Ranking with Reachability (ARB, ZM, HBS), pp. 491–504.
CAVCAV-2005-Monniaux #analysis #composition #float
Compositional Analysis of Floating-Point Linear Numerical Filters (DM), pp. 199–212.
CSLCSL-2005-ChaudhuriP #logic
Focusing the Inverse Method for Linear Logic (KC, FP), pp. 200–215.
CSLCSL-2005-GodoyT #confluence #term rewriting
Confluence of Shallow Right-Linear Rewrite Systems (GG, AT), pp. 541–556.
ICLPICLP-2005-Haemmerle #concurrent #constraints #programming
SiLCC Is Linear Concurrent Constraint Programming (RH), pp. 448–449.
ICLPICLP-2005-Maher #abduction #constraints
Abduction of Linear Arithmetic Constraints (MJM), pp. 174–188.
LICSLICS-2005-Lago #geometry #higher-order #recursion
The Geometry of Linear Higher-Order Recursion (UDL), pp. 366–375.
LICSLICS-2005-Mellies #game studies #logic
Asynchronous Games 4: A Fully Complete Model of Propositional Linear Logic (PAM), pp. 386–395.
ICSTSAT-2005-HeuleM #bound #programming #random #satisfiability #using
Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming (MH, HvM), pp. 122–134.
ICSTSAT-2005-SheiniS #integer #logic #satisfiability #scalability
A Scalable Method for Solving Satisfiability of Integer Linear Arithmetic Logic (HMS, KAS), pp. 241–256.
VMCAIVMCAI-2005-AbrahamBKS #bound #hybrid #model checking #optimisation
Optimizing Bounded Model Checking for Linear Hybrid Systems (, BB, FK, MS), pp. 396–412.
VMCAIVMCAI-2005-Lange #automaton #calculus
Weak Automata for the Linear Time µ-Calculus (ML), pp. 267–281.
VMCAIVMCAI-2005-SankaranarayananSM #analysis #programming #scalability #using
Scalable Analysis of Linear Systems Using Mathematical Programming (SS, HBS, ZM), pp. 25–41.
VLDBVLDB-2004-ArasuCGMMRST #benchmark #data transformation #metric
Linear Road: A Stream Data Management Benchmark (AA, MC, EFG, DM, AM, ER, MS, RT), pp. 480–491.
ICSMEICSM-2004-MerloAPR #analysis #clone detection #complexity #detection #evolution #object-oriented #similarity
Linear Complexity Object-Oriented Similarity for Clone Detection and Software Evolution Analyses (EM, GA, MDP, VFR), pp. 412–416.
CIAACIAA-2004-BordihnHK #context-free grammar #problem
Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages (HB, MH, MK), pp. 68–79.
CIAACIAA-2004-GiraudL #automaton #encoding #finite
Linear Encoding Scheme for Weighted Finite Automata (MG, DL), pp. 146–155.
CIAACIAA-2004-Lugiez #automaton #logic #set
From Automata to Semilinear Sets: A Logical Solution for Sets L(C, P) (DL), pp. 321–322.
DLTDLT-2004-KutribMW #context-free grammar
The Boolean Closure of Linear Context-Free Languages (MK, AM, DW), pp. 284–295.
DLTDLT-2004-RispalC #order #set
Complementation of Rational Sets on Countable Scattered Linear Orderings (CR, OC), pp. 381–392.
ICALPICALP-2004-AlfaroFS #branch #metric
Linear and Branching Metrics for Quantitative Transition Systems (LdA, MF, MS), pp. 97–109.
ICALPICALP-2004-Fleischer #algorithm #bound #network
Linear Tolls Suffice: New Bounds and Algorithms for Tolls in Single Source Networks (LF), pp. 544–554.
ICALPICALP-2004-FominT #algorithm #exponential #graph #kernel #performance
Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up (FVF, DMT), pp. 581–592.
ICALPICALP-2004-GuruswamiI
Linear-Time List Decoding in Error-Free Settings: (VG, PI), pp. 695–707.
FLOPSFLOPS-2004-Hasegawa #call-by #continuation #semantics
Semantics of Linear Continuation-Passing in Call-by-Name (MH), pp. 229–243.
ICEISICEIS-v2-2004-TagarelliTG #clustering #mining #programming
Mining Scientific Results Through the Combined Use of Clustering and Linear Programming Techniques (AT, IT, SG), pp. 84–91.
ICMLICML-2004-ChangY #adaptation #clustering #metric
Locally linear metric adaptation for semi-supervised clustering (HC, DYY).
ICMLICML-2004-HardinTA #feature model
A theoretical characterization of linear SVM-based feature selection (DPH, IT, CFA).
ICMLICML-2004-MerkeS #approximate #convergence #learning
Convergence of synchronous reinforcement learning with linear function approximation (AM, RS).
ICMLICML-2004-Potts #incremental #learning
Incremental learning of linear model trees (DP).
ICMLICML-2004-YeJLP #analysis #feature model
Feature extraction via generalized uncorrelated linear discriminant analysis (JY, RJ, QL, HP).
ICMLICML-2004-Zhang #algorithm #predict #probability #problem #scalability #using
Solving large scale linear prediction problems using stochastic gradient descent algorithms (TZ0).
ICPRICPR-v1-2004-KeysersN #analysis #modelling
Linear Discriminant Analysis and Discriminative Log-linear Modeling (DK, HN), pp. 156–159.
ICPRICPR-v3-2004-GimelfarbFE
Expectation-Maximization for a Linear Combination of Gaussians (GLG, AAF, AEB), pp. 422–425.
ICPRICPR-v3-2004-LeowCPTVH #geometry #representation
Linear and Non-linear Geometric Object Matching with Implicit Representation (ADL, MCC, HP, PMT, LAV, HSCH), pp. 710–713.
ICPRICPR-v3-2004-WuZZ #feature model #using
Relevant Linear Feature Extraction Using Side-information and Unlabeled Data (FW, YZ, CZ), pp. 582–585.
SEKESEKE-2004-CanforaCT #estimation #experience #fuzzy
An Experience of Fuzzy Linear Regression applied to Effort Estimation (GC, LC, LT), pp. 57–61.
SIGIRSIGIR-2004-MladenicBGM #classification #feature model #interactive #modelling #using
Feature selection using linear classifier weights: interaction with classification models (DM, JB, MG, NMF), pp. 234–241.
POPLPOPL-2004-Muller-OlmS #algebra #analysis #interprocedural #precise
Precise interprocedural analysis through linear algebra (MMO, HS), pp. 330–341.
PPDPPPDP-2004-ZhouSS #evaluation
Semi-naive evaluation in linear tabling (NFZ, YDS, TS), pp. 90–97.
SASSAS-2004-GulwaniN04a #analysis
Path-Sensitive Analysis for Linear Arithmetic and Uninterpreted Functions (SG, GCN), pp. 328–343.
SACSAC-2004-GuptaCH #constraints
Experiments with UNA for solving linear constraints in real variables (NG, YC, MZH), pp. 1013–1020.
DACDAC-2004-WangHL #nondeterminism #parametricity
A linear fractional transform (LFT) based model for interconnect parametric uncertainty (JMW, OH, JL), pp. 375–380.
DATEDATE-v1-2004-VandersteenPLD #identification
Extended Subspace Identification of Improper Linear Systems (GV, RP, DL, SD), pp. 454–459.
DATEDATE-v2-2004-Feldmann #order #reduction #scalability
Model Order Reduction Techniques for Linear Systems with Large Numbers of Terminals (PF), pp. 944–947.
DATEDATE-v2-2004-MineKKWA #hybrid #performance #reduction #simulation
Hybrid Reduction Technique for Efficient Simulation of Linear/Nonlinear Mixed Circuits (TM, HK, AK, TW, HA), pp. 1327–1333.
ESOPESOP-2004-CarlierPWK #flexibility #type system
System E: Expansion Variables for Flexible Typing with Linear and Non-linear Types and Intersection Types (SC, JP, JBW, AJK), pp. 294–309.
ESOPESOP-2004-EnnalsSM
Linear Types for Packet Processing (RE, RS, AM), pp. 204–218.
STOCSTOC-2004-AilonC #bound #testing
Lower bounds for linear degeneracy testing (NA, BC), pp. 554–560.
STOCSTOC-2004-ChenHKX #bound #reduction
Linear FPT reductions and computational lower bounds (JC, XH, IAK, GX), pp. 212–221.
STOCSTOC-2004-DunaganV #algorithm #polynomial #source code
A simple polynomial-time rescaling algorithm for solving linear programs (JD, SV), pp. 315–320.
STOCSTOC-2004-HolmerinK #equation #verification
A new PCP outer verifier with applications to homogeneous linear equations and max-bisection (JH, SK), pp. 11–20.
STOCSTOC-2004-RodittyZ #algorithm #graph #reachability
A fully dynamic reachability algorithm for directed graphs with an almost linear update time (LR, UZ), pp. 184–191.
STOCSTOC-2004-SpielmanT #algorithm #clustering #graph
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems (DAS, SHT), pp. 81–90.
CAVCAV-2004-Tiwari #source code #termination
Termination of Linear Programs (AT), pp. 70–82.
CAVCAV-2004-Wang #analysis #hybrid #parametricity #safety
Symbolic Parametric Safety Analysis of Linear Hybrid Systems with BDD-Like Data-Structures (FW), pp. 295–307.
CSLCSL-2004-Gianantonio #logic #multi
Structures for Multiplicative Cyclic Linear Logic: Deepness vs Cyclicity (PDG), pp. 130–144.
CSLCSL-2004-GrooteS #higher-order #λ-calculus
Higher-Order Matching in the Linear λ-calculus with Pairing (PdG, SS), pp. 220–234.
CSLCSL-2004-Hyvernat #logic
Predicate Transformers and Linear Logic: Yet Another Denotational Model (PH), pp. 115–129.
CSLCSL-2004-StrassburgerL #logic #multi #on the #proving
On Proof Nets for Multiplicative Linear Logic with Units (LS, FL), pp. 145–159.
LICSLICS-2004-GroheS #first-order #logic
The Succinctness of First-Order Logic on Linear Orders (MG, NS), pp. 438–447.
LICSLICS-2004-Luosto #order
Equicardinality on Linear Orders (KL), pp. 458–465.
VMCAIVMCAI-2004-PodelskiR #ranking #synthesis
A Complete Method for the Synthesis of Linear Ranking Functions (AP, AR), pp. 239–251.
ICDARICDAR-2003-WangDL #identification #using
Writer Identification Using Directional Element Features and Linear Transform (XW, XD, HL), pp. 942–945.
CIAACIAA-2003-Fritz #automaton #logic #simulation #using
Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata (CF), pp. 35–48.
CIAACIAA-2003-XieLD #complexity #equation #problem #using
New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations (GX, CL, ZD), pp. 163–175.
ICALPICALP-2003-BaswanaS #algorithm #graph
A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n1+1/k) Size in Weighted Graphs (SB, SS), pp. 384–296.
ICALPICALP-2003-KarkkainenS #array
Simple Linear Work Suffix Array Construction (JK, PS), pp. 943–955.
FMFME-2003-MussetR
Computing Meta-transitions for Linear Transition Systems with Polynomials (JM, MR), pp. 562–581.
RTARTA-2003-SalvatiG #complexity #higher-order #on the #λ-calculus
On the Complexity of Higher-Order Matching in the Linear λ-Calculus (SS, PdG), pp. 234–245.
CIKMCIKM-2003-ShanksW #categorisation
Index construction for linear categorisation (VRS, HEW), pp. 334–341.
ICMLICML-2003-Graepel #difference #equation #process
Solving Noisy Linear Operator Equations by Gaussian Processes: Application to Ordinary and Partial Differential Equations (TG), pp. 234–241.
ICMLICML-2003-LeskovecS #dataset #programming
Linear Programming Boosting for Uneven Datasets (JL, JST), pp. 456–463.
ICMLICML-2003-RosipalTM #classification #kernel
Kernel PLS-SVC for Linear and Nonlinear Classification (RR, LJT, BM), pp. 640–647.
KDDKDD-2003-BayS #mining
Mining distance-based outliers in near linear time with randomization and a simple pruning rule (SDB, MS), pp. 29–38.
MLDMMLDM-2003-HadidP #performance
Efficient Locally Linear Embeddings of Imperfect Manifolds (AH, MP), pp. 188–201.
SIGIRSIGIR-2003-LiZO #generative #topic
Topic hierarchy generation via linear discriminant projection (TL, SZ, MO), pp. 421–422.
SIGIRSIGIR-2003-ZhangY #categorisation #classification #robust
Robustness of regularized linear classification methods in text categorization (JZ, YY), pp. 190–197.
PLDIPLDI-2003-LambTA #analysis #optimisation #source code
Linear analysis and optimization of stream programs (AAL, WT, SPA), pp. 12–25.
PPDPPPDP-2003-ZhouS #fixpoint #performance
Efficient fixpoint computation in linear tabling (NFZ, TS), pp. 275–283.
SASSAS-2003-HalbwachsMP #analysis
Cartesian Factoring of Polyhedra in Linear Relation Analysis (NH, DM, CPV), pp. 355–365.
AdaSIGAda-2003-EvangelistaKPR #ada #concurrent #logic #source code #verification
Verifying linear time temporal logic properties of concurrent Ada programs with quasar (SE, CK, JFPP, PR), pp. 17–24.
DATEDATE-2003-LeeC #3d #grid #power management #simulation
The Power Grid Transient Simulation in Linear Time Based on 3D Alternating-Direction-Implicit Method (YML, CCPC), pp. 11020–11025.
DATEDATE-2003-WegenerK #fault #identification #modelling
Linear Model-Based Error Identification and Calibration for Data Converters (CW, MPK), pp. 10630–10635.
PDPPDP-2003-CuencaGGDR #algebra #automation #optimisation #parallel
Automatic Optimisation of Parallel Linear Algebra Routines in Systems with Variable Load (JC, DG, JG, JD, KR), pp. 409–416.
PDPPDP-2003-SpiteriGBM #parallel #problem
Parallelization of Subdomain Methods with Overlapping for Linear and Nonlinear Convection-Diffusion Problems. (PS, RG, DEB, MC), pp. 341–348.
STOCSTOC-2003-GuruswamiI
Linear time encodable and list decodable codes (VG, PI), pp. 126–135.
STOCSTOC-2003-OstlinP #constant
Uniform hashing in constant time and linear space (, RP), pp. 622–628.
TACASTACAS-2003-ArmoniBKV #logic
Resets vs. Aborts in Linear Temporal Logic (RA, DB, OK, MYV), pp. 65–80.
TACASTACAS-2003-BerezinGD #online
An Online Proof-Producing Decision Procedure for Mixed-Integer Linear Arithmetic (SB, VG, DLD), pp. 521–536.
CAVCAV-2003-ArmoniFFGPTV #detection #logic
Enhanced Vacuity Detection in Linear Temporal Logic (RA, LF, AF, OG, NP, AT, MYV), pp. 368–380.
CAVCAV-2003-ColonSS #constraints #generative #invariant #theorem proving #using
Linear Invariant Generation Using Non-linear Constraint Solving (MC, SS, HS), pp. 420–432.
LICSLICS-2003-HughesG #logic #multi #proving
Proof Nets for Unit-free Multiplicative-Additive Linear Logic (DJDH, RJvG), pp. 1–10.
LICSLICS-2003-LaurentR #logic
About Translations of Classical Logic into Polarized Linear Logic (OL, LR), pp. 11–20.
ICSTSAT-2003-PorschenRS #algorithm #problem #satisfiability
Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems (SP, BR, ES), pp. 172–187.
VLDBVLDB-2002-ChakrabartiRS #classification #multi #performance
Fast and Accurate Text Classification via Multiple Linear Discriminant Projections (SC, SR, MVS), pp. 658–669.
VLDBVLDB-2002-HulgeriS #cost analysis #optimisation #parametricity #query
Parametric Query Optimization for Linear and Piecewise Linear Cost Functions (AH, SS), pp. 167–178.
CIAACIAA-2002-Okhotin #performance #recognition
Efficient Automaton-Based Recognition for Linear Conjunctive Languages (AO), pp. 169–181.
DLTDLT-2002-BonizzoniFMZ #problem
Decision Problems for Linear and Circular Splicing Systems (PB, CdF, GM, RZ), pp. 78–92.
DLTDLT-2002-BruyereC #automaton #order
Automata on Linear Orderings (VB, OC), pp. 103–115.
DLTDLT-2002-Okhotin #automaton #representation
Automaton Representation of Linear Conjunctive Languages (AO), pp. 393–404.
ICALPICALP-2002-AdsulS #logic
Complete and Tractable Local Linear Time Temporal Logics over Traces (BA, MAS), pp. 926–937.
ICALPICALP-2002-Uehara #algorithm #graph
Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs (RU), pp. 993–1004.
FLOPSFLOPS-2002-Hasegawa #continuation #monad #λ-calculus
Linearly Used Effects: Monadic and CPS Transformations into the Linear λ Calculus (MH), pp. 167–182.
ICFPICFP-2002-Ford #functional #lazy evaluation #parsing
Packrat parsing: : simple, powerful, lazy, linear time, functional pearl (BF), pp. 36–47.
ICGTICGT-2002-MontanariR #algebra #graph grammar #order
Linear Ordered Graph Grammars and Their Algebraic Foundations (UM, LR), pp. 317–333.
ICPRICPR-v1-2002-CarvalhoSDR #constraints #estimation
Bayes Information Criterion for Tikhonov Regularization with Linear Constraints: Application to Spectral Data Estimation (PDC, AS, AD, BR), pp. 696–700.
ICPRICPR-v1-2002-HadidKP #analysis #learning #using
Unsupervised Learning Using Locally Linear Embedding: Experiments with Face Pose Analysis (AH, OK, MP), pp. 111–114.
ICPRICPR-v1-2002-JeongKSS #gesture #recognition #using
Two-Hand Gesture Recognition using Coupled Switching Linear Model (MHJ, YK, NS, YS), pp. 9–12.
ICPRICPR-v1-2002-KubotaA #generative #image
Virtual View Generation by Linear Processing of Two Differently Focused Images (AK, KA), pp. 504–507.
ICPRICPR-v2-2002-MoghaddamZ #analysis #online #pattern matching #pattern recognition #performance #recognition
Fast Linear Discriminant Analysis for On-Line Pattern Recognition Applications (HAM, KAZ), pp. 64–67.
ICPRICPR-v2-2002-Vaswani #classification #matrix
A Linear Classifier for Gaussian Class Conditional Distributions with Unequal Covariance Matrices (NV), pp. 60–63.
ICPRICPR-v3-2002-JeongKSS02a #gesture #recognition #using
Two-Hand Gesture Recognition Using Coupled Switching Linear Model (MHJ, YK, NS, YS), pp. 529–532.
ICPRICPR-v3-2002-KatzMDK #analysis #automation #robust #speech
Robustness of Linear Discriminant Analysis in Automatic Speech Recognitio (MK, HGM, HD, DK), pp. 371–374.
ICPRICPR-v3-2002-MullerH
Extending the Linear Interpolating Condition to Advanced Synthetic Discriminant Function Variants (NM, BMH), pp. 883–886.
ICPRICPR-v3-2002-RavindranF
A Simple Linear Method to Obtain Height Ordering of Scene Points (PR, NJF), pp. 719–722.
ICPRICPR-v4-2002-RomaniukDRD #locality #statistics
Linear and Non-Linear Model for Statistical Localization of Landmarks (BR, MD, MR, MJD), p. 393–?.
KDDKDD-2002-DobraG #algorithm #named #scalability
SECRET: a scalable linear regression tree algorithm (AD, JG), pp. 481–487.
KDDKDD-2002-KeoghLC #database
Finding surprising patterns in a time series database in linear time and space (EJK, SL, BYcC), pp. 550–556.
LOPSTRLOPSTR-2002-SimonKH #abstract domain #difference
Two Variables per Linear Inequality as an Abstract Domain (AS, AK, JMH), pp. 71–89.
PADLPADL-2002-JohanssonS #compilation #erlang
Linear Scan Register Allocation in a High-Performance Erlang Compiler (EJ, KFS), pp. 101–119.
PLDIPLDI-2002-FahndrichD #imperative #programming
Adoption and Focus: Practical Linear Types for Imperative Programming (MF, RD), pp. 13–24.
PPDPPPDP-2002-BozzanoD #automation #logic #protocol #verification
Automated protocol verification in linear logic (MB, GD), pp. 38–49.
CCCC-2002-MossenbockP #constraints
Linear Scan Register Allocation in the Context of SSA Form and Register Constraints (HM, MP), pp. 229–246.
DACDAC-2002-KadayifKS #approach #integer #multi #programming
An integer linear programming based approach for parallelizing applications in On-chip multiprocessors (IK, MTK, US), pp. 703–708.
DACDAC-2002-MegerianDP #integer #programming
Watermarking integer linear programming solutions (SM, MD, MP), pp. 8–13.
DATEDATE-2002-DaemsGS #approach #performance
A Fitting Approach to Generate Symbolic Expressions for Linear and Nonlinear Analog Circuit Performance Characteristics (WD, GGEG, WMCS), pp. 268–273.
DATEDATE-2002-GadN #performance #reduction
Efficient Model Reduction of Linear Time-Varying Systems via Compressed Transient System Function (EG, MSN), pp. 916–922.
DATEDATE-2002-Hieu #analysis #design #feedback #optimisation
Optimization Techniques for Design of General and Feedback Linear Analog Amplifier with Symbolic Analysis (TcH), p. 1104.
PDPPDP-2002-CuencaGG #algebra #automation #design #library #towards
Towards the Design of an Automatically Tuned Linear Algebra Library (JC, DG, JG), p. 201–?.
STOCSTOC-2002-Guruswami
Limits to list decodability of linear codes (VG), pp. 802–811.
STOCSTOC-2002-GuruswamiI
Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets (VG, PI), pp. 812–821.
STOCSTOC-2002-Han #sorting
Deterministic sorting in O(nlog log n) time and linear space (YH), pp. 602–608.
CADECADE-2002-AudemardBCKS #approach #satisfiability
A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions (GA, PB, AC, AK, RS), pp. 195–210.
CAVCAV-2002-KupfermanPV #model checking
Model Checking Linear Properties of Prefix-Recognizable Systems (OK, NP, MYV), pp. 371–385.
CSLCSL-2002-BarbanchonG #problem
Local Problems, Planar Local Problems and Linear Time (RB, EG), pp. 397–411.
CSLCSL-2002-Hasegawa #logic
Classical Linear Logic of Implications (MH), pp. 458–472.
LICSLICS-2002-SoltysC #algebra #complexity #proving
The Proof Complexity of Linear Algebra (MS, SAC), pp. 335–344.
SATSAT-2002-Kusper #problem #satisfiability
Solving the resolution-free SAT problem by hyper-unit propagation in linear time (GK), p. 32.
ICDARICDAR-2001-RoneeUS #2d #recognition #using
Handwritten Character Recognition Using Piecewise Linear Two-Dimensional Warping (MAR, SU, HS), pp. 39–43.
ICALPICALP-2001-BorosEGKM #generative #integer #on the
On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities (EB, KME, VG, LK, KM), pp. 92–103.
ICALPICALP-2001-Furer #refinement
Weisfeiler-Lehman Refinement Requires at Least a Linear Number of Iterations (MF), pp. 322–333.
ICALPICALP-2001-Havill #array #online
Online Packet Routing on Linear Arrays and Rings (JTH), pp. 773–784.
TLCATLCA-2001-CoppolaM #constraints #logic #type system
Typing λ Terms in Elementary Logic with Linear Constraints (PC, SM), pp. 76–90.
TLCATLCA-2001-Haghverdi #category theory #logic #modelling
Partially Additive Categories and Fully Complete Models of Linear Logic (EH), pp. 197–216.
FLOPSFLOPS-2001-BozzanoDM #bottom-up #effectiveness #first-order #logic programming #semantics #source code
An Effective Bottom-Up Semantics for First-Order Linear Logic Programs (MB, GD, MM), pp. 138–152.
FLOPSFLOPS-2001-Lux #constraints
Adding Linear Constraints over Real Numbers to Curry (WL), pp. 185–200.
ICFPICFP-2001-WalkerW #on the
On Regions and Linear Types (DW, KW), pp. 181–192.
CHICHI-2001-HornbaekF #documentation #interface #overview #usability
Reading of electronic documents: the usability of linear, fisheye, and overview+detail interfaces (KH, EF), pp. 293–300.
MLDMMLDM-2001-ImiyaO
PCA-Based Model Selection and Fitting for Linear Manifolds (AI, HO), pp. 278–292.
QAPLQAPL-2001-BrogiPW #comparison
Linear Embedding for a Quantitative Comparison of Language Expressiveness (AB, ADP, HW), pp. 207–237.
SACSAC-2001-Kandemir #algebra #algorithm #locality #optimisation
A dynamic locality optimization algorithm for linear algebra codes (MTK), pp. 632–635.
DACDAC-2001-VerhaegenG #analysis #performance #scalability
Efficient DDD-based Symbolic Analysis of Large Linear Analog Circuits (WV, GGEG), pp. 139–144.
DATEDATE-2001-AzaisBBR #implementation
Implementation of a linear histogram BIST for ADCs (FA, SB, YB, MR), pp. 590–595.
DATEDATE-2001-DasguptaCNKC #abstraction #component
Abstraction of word-level linear arithmetic functions from bit-level component descriptions (PD, PPC, AN, SK, AC), pp. 4–8.
DATEDATE-2001-YildizSV #bias #float #integer #programming
Minimizing the number of floating bias voltage sources with integer linear programming (EY, AvS, CJMV), p. 816.
PDPPDP-2001-CuencaGG #algebra #algorithm #behaviour #message passing #modelling
Modeling the Behaviour of Linear Algebra Algorithms with Message-Passing (JC, DG, JG), pp. 282–289.
TACASTACAS-2001-ColonS #ranking #synthesis
Synthesis of Linear Ranking Functions (MC, HS), pp. 67–81.
TACASTACAS-2001-HuneRSV #automaton #model checking #parametricity
Linear Parametric Model Checking of Timed Automata (TH, JR, MS, FWV), pp. 189–203.
TACASTACAS-2001-Vardi #branch
Branching vs. Linear Time: Final Showdown (MYV), pp. 1–22.
CSLCSL-2001-Kanovich #logic #monad #power of
The Expressive Power of Horn Monadic Linear Logic (MIK), pp. 39–53.
ICLPICLP-2001-BanbaraKHT #logic programming
Logic Programming in a Fragment of Intuitionistic Temporal Linear Logic (MB, KSK, TH, NT), pp. 315–330.
IJCARIJCAR-2001-BoigelotJW #automaton #integer #on the #using
On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables (BB, SJ, PW), pp. 611–625.
IJCARIJCAR-2001-HodasT #agile #first-order #implementation #logic #named #proving #theorem proving
lolliCop — A Linear Logic Implementation of a Lean Connection-Method Theorem Prover for First-Order Classical Logic (JSH, NT), pp. 670–684.
IJCARIJCAR-2001-LynchM #complexity #decidability #equation
Decidability and Complexity of Finitely Closable Linear Equational Theories (CL, BM), pp. 499–513.
LICSLICS-2001-KozenT #correctness #logic
Intuitionistic Linear Logic and Partial Correctness (DK, JT), pp. 259–268.
PODSPODS-2000-GeertsK #approximate #database #logic #transitive #using
Linear Approximation of Planar Spatial Databases Using Transitive-Closure Logic (FG, BK), pp. 126–135.
PODSPODS-2000-Kreutzer #constraints #database #fixpoint #query
Fixed-Point Query Languages for Linear Constraint Databases (SK), pp. 116–125.
SIGMODSIGMOD-2000-ChangBCLLS #optimisation #query
The Onion Technique: Indexing for Linear Optimization Queries (YCC, LDB, VC, CSL, MLL, JRS), pp. 391–402.
RTARTA-2000-Groote #higher-order
Linear Higher-Order Matching Is NP-Complete (PdG), pp. 127–140.
RTARTA-2000-LevyV #constraints #higher-order #unification
Linear Second-Order Unification and Context Unification with Tree-Regular Constraints (JL, MV), pp. 156–171.
RTARTA-2000-TakaiKS #effectiveness #finite #term rewriting
Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability (TT, YK, HS), pp. 246–260.
ICFPICFP-2000-SasanoHTO #algorithm #problem
Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems (IS, ZH, MT, MO), pp. 137–149.
ICMLICML-2000-PaccanaroH #concept #distributed #learning
Learning Distributed Representations by Mapping Concepts and Relations into a Linear Space (AP, GEH), pp. 711–718.
ICMLICML-2000-Torgo
Partial Linear Trees (LT), pp. 1007–1014.
ICMLICML-2000-YildizA
Linear Discriminant Trees (OTY, EA), pp. 1175–1182.
ICPRICPR-v2-2000-DuinLH #feature model #multi
Multi-Class Linear Feature Extraction by Nonlinear PCA (RPWD, ML, RHU), pp. 2398–2401.
ICPRICPR-v2-2000-HiraokaHHMMY #algorithm #analysis #learning
Successive Learning of Linear Discriminant Analysis: Sanger-Type Algorithm (KH, KiH, MH, HM, TM, SY), pp. 2664–2667.
ICPRICPR-v2-2000-Schulerud #analysis #bias #fault #feature model
Bias of Error Rates in Linear Discriminant Analysis Caused by Feature Selection and Sample Size (HS), pp. 2372–2377.
ICPRICPR-v2-2000-UnsalanE #analysis
Shapes of Features and a Modified Measure for Linear Discriminant Analysis (, AE), pp. 2410–2413.
ICPRICPR-v3-2000-KeglK #using
Piecewise Linear Skeletonization Using Principal Curves (BK, AK), pp. 3135–3138.
ICPRICPR-v3-2000-LuceySC #performance #using
Initialized Eigenlip Estimator for Fast Lip Tracking Using Linear Regression (SL, SS, VC), pp. 3182–3185.
ICPRICPR-v3-2000-ToczyskiP #bias #estimation #geometry #process
Complementary Linear Biases in Spatial Derivative Estimation for Improving Geometry-Driven Diffusion Processes (WDT, NP), pp. 3001–3006.
ICPRICPR-v3-2000-UchidaS #2d
Piecewise Linear Two-Dimensional Warping (SU, HS), pp. 3538–3541.
ICPRICPR-v4-2000-AbeggEW #algorithm #image #robust #sequence #video
A Robust Algorithm for Segmenting Deformable Linear Objects from Video Image Sequences (FA, DE, HW), pp. 4756–4759.
ICPRICPR-v4-2000-HuynhCT #automation #evaluation #metric #re-engineering #self
Semi-Automatic Metric Reconstruction of Buildings from Self-Calibration: Preliminary Results on the Evaluation of a Linear Camera Self-Calibration Method (DQH, YSC, HTT), pp. 4599–4602.
OOPSLAOOPSLA-2000-LujanFG #algebra #analysis #design #named #object-oriented
OoLALA: an object oriented analysis and design of numerical linear algebra (ML, TLF, JRG), pp. 229–252.
PADLPADL-2000-ZhouSYY #implementation
Implementation of a Linear Tabling Mechanism (NFZ, YDS, LYY, JHY), pp. 109–123.
PEPMPEPM-2000-LeviS #analysis #refinement
Non Pair-Sharing and Freeness Analysis Through Linear Refinement (GL, FS), pp. 52–61.
PPDPPPDP-2000-BozzanoDM #bottom-up #logic programming #semantics #source code
A bottom-up semantics for linear logic programs (MB, GD, MM), pp. 92–102.
PPDPPPDP-2000-Fages #concurrent #constraints #logic #programming
Concurrent constraint programming and linear logic (FF), p. 44.
PPDPPPDP-2000-Polakow #logic programming #order
Linear logic programming with an ordered context (JP), pp. 68–79.
DACDAC-2000-ChenK #approximate #programming
Floorplan sizing by linear programming approximation (PC, ESK), pp. 468–471.
DACDAC-2000-WangN #analysis #multi #order
Extended Krylov subspace method for reduced order analysis of linear circuits with multiple sources (JMW, TVN), pp. 247–252.
FoSSaCSFoSSaCS-2000-MaiettiPR #category theory #modelling #type system
Categorical Models for Intuitionistic and Linear Type Theory (MEM, VdP, ER), pp. 223–237.
FoSSaCSFoSSaCS-2000-Tsay #composition #logic #verification
Compositional Verification in Linear-Time Temporal Logic (YKT), pp. 344–358.
TACASTACAS-2000-WolperB #automaton #constraints #on the
On the Construction of Automata from Linear Arithmetic Constraints (PW, BB), pp. 1–19.
CSLCSL-2000-BenediktK #constraints
Definability over Linear Constraints (MB, HJK), pp. 217–231.
CSLCSL-2000-Hemaspaandra #satisfiability
Modal Satisfiability Is in Deterministic Linear Space (EH), pp. 332–342.
HTHT-1999-Vardi #interactive #navigation
Navigation Scheme for Interactive Movies with Linear Narrative (GV), pp. 131–132.
PODSPODS-1999-BoassonCGM #problem #sequence
Window-Accumulated Subsequence Matching Problem is Linear (LB, PC, IG, YM), pp. 327–336.
PODSPODS-1999-KleinbergT #algebra #analysis #hypermedia #information retrieval
Applications of Linear Algebra in Information Retrieval and Hypertext Analysis (JMK, AT), pp. 185–193.
ICSMEICSM-1999-LapierreMSAFT #automation #execution #generative #programming #testing #using
Automatic Unit Test Data Generation Using Mixed-Integer Linear Programming and Execution Trees (SL, EM, GS, GA, RF, PT), pp. 189–198.
DLTDLT-1999-AndreiK #bidirectional #parsing
Bidirectional parsing for linear languages (SA, MK), pp. 257–269.
ICALPICALP-1999-KimP #2d
Linear-Time Construction of Two-Dimensional Suffix Trees (DKK, KP), pp. 463–472.
FMFM-v1-1999-Couvreur #logic #on the fly #verification
On-the-Fly Verification of Linear Temporal Logic (JMC), pp. 253–271.
FMFM-v2-1999-DellacherieDL #programming #verification
Software Verification Based on Linear Programming (SD, SD, JLL), pp. 1147–1165.
TLCATLCA-1999-Hasegawa #logic
Logical Predicates for Intuitionistic Linear Type Theories (MH), pp. 198–212.
TLCATLCA-1999-MikamiA #automaton #case study
A Study of Abramsky’s Linear Chemical Abstract Machine (SM, YA), pp. 243–257.
TLCATLCA-1999-PolakowP #deduction #logic
Natural Deduction for Intuitionistic Non-communicative Linear Logic (JP, FP), pp. 295–309.
ICMLICML-1999-AbeL #concept #learning #probability #using
Associative Reinforcement Learning using Linear Probabilistic Concepts (NA, PML), pp. 3–11.
ICMLICML-1999-KimuraK #performance
Efficient Non-Linear Control by Combining Q-learning with Local Linear Controllers (HK, SK), pp. 210–219.
KDDKDD-1999-LarsenA #clustering #documentation #effectiveness #mining #performance #using
Fast and Effective Text Mining Using Linear-Time Document Clustering (BL, CA), pp. 16–22.
SASSAS-1999-HillS #analysis #refinement
Freeness Analysis Through Linear Refinement (PMH, FS), pp. 85–100.
RERE-1999-PaunC
Events in Linear-Time Properties (DOP, MC), pp. 123–132.
ASEASE-1999-DevulderL #case study #comparative #programming #validation #verification
A Comparative Study between Linear Programming Validation (LPV) and other Verification Methods (SD, JLL), pp. 299–302.
SACSAC-1999-BassiouniF
Dynamic Channel Allocation for Linear Macrocellular Topology (MAB, CCF), pp. 382–388.
SACSAC-1999-Bugarin #approximate #polynomial
Linear Quadratic Approximation for Solving a Model Economy Distorted by Progressive Taxation (MNSB), pp. 52–56.
CCCC-1999-KastnerL #integer #optimisation #programming
Code Optimization by Integer Linear Programming (DK, ML), pp. 122–136.
DACDAC-1999-HurL #clustering #framework
Relaxation and Clustering in a Local Search Framework: Application to Linear Placement (SWH, JL), pp. 360–366.
DACDAC-1999-TanSLLY #network #optimisation #sequence
Reliability-Constrained Area Optimization of VLSI Power/Ground Networks via Sequence of Linear Programmings (XDT, CJRS, DL, JCL, LPY), pp. 78–83.
DATEDATE-1999-CotaCL #adaptation #fault #using
A Method to Diagnose Faults in Linear Analog Circuits using an Adaptive Tester (ÉFC, LC, ML), pp. 184–188.
HPDCHPDC-1999-DindaO #evaluation #modelling #predict
An Evaluation of Linear Models for Host Load Prediction (PAD, DRO), pp. 87–96.
STOCSTOC-1999-Ajtai #nondeterminism
Determinism versus Non-Determinism for Linear Time RAMs (MA), pp. 632–641.
STOCSTOC-1999-BussGIP #calculus #polynomial
Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes (SRB, DG, RI, TP), pp. 547–556.
CAVCAV-1999-BloemRS #logic #model checking #performance
Efficient Decision Procedures for Model Checking of Linear Time Logic Properties (RB, KR, FS), pp. 222–235.
CAVCAV-1999-DanieleGV #automaton #generative #logic
Improved Automata Generation for Linear Temporal Logic (MD, FG, MYV), pp. 249–260.
CSLCSL-1999-BalatC #logic #morphism
A Linear Logical View of Linear Type Isomorphisms (VB, RDC), pp. 250–265.
ICLPICLP-1999-KangT #logic programming #programming language #static analysis
A Static Analysis for Classical Linear Logic Programming Language (KSK, NT), p. 610.
ICLPICLP-1999-ZhouSYY
A Linear Tabling Mechanism (NFZ, YDS, LYY, JHY), p. 618.
LICSLICS-1999-DevarajanHPP #logic #multi
Full Completeness of the Multiplicative Linear Logic of Chu Spaces (HD, DJDH, GDP, VRP), pp. 234–243.
LICSLICS-1999-Guerrini #correctness #multi #proving
Correctness of Multiplicative Proof Nets Is Linear (SG), pp. 454–463.
LICSLICS-1999-Hofmann99a #polynomial
Linear Types and Non-Size-Increasing Polynomial Time Computation (MH0), pp. 464–473.
PODSPODS-1998-AgarwalAEFV #constraints #performance
Efficient Searching with Linear Constraints (PKA, LA, JE, PGF, JSV), pp. 169–178.
PODSPODS-1998-VandeurzenGG #database #query
An Expressive Language for Linear Spatial Database Queries (LV, MG, DVG), pp. 109–118.
ICALPICALP-1998-KestenPR #algorithm #logic #specification #verification
Algorithmic Verification of Linear Temporal Logic Specifications (YK, AP, LoR), pp. 1–16.
ICALPICALP-1998-LiuS #algorithm #fixpoint
Simple Linear-Time Algorithms for Minimal Fixed Points (XL, SAS), pp. 53–66.
CIAAWIA-1998-Goeman #lr #on the #parsing #string
On Parsing and Condensing Substrings of LR Languages in Linear Time (HG), pp. 22–42.
ICPRICPR-1998-HeikkilaS #3d #estimation #image #metric #sequence
Linear motion estimation for image sequence based accurate 3-D measurements (JH, OS), pp. 1247–1250.
ICPRICPR-1998-HwangYTY #3d #using
A factorization method using 3D linear combination for shape and motion recovery (KCH, NY, HT, KY), pp. 959–963.
ICPRICPR-1998-IvinsPFO #component #probability
The joint probability density function for linear optic flow components (JI, JP, JPF, GAO), pp. 795–798.
ICPRICPR-1998-KadyrovP #detection #estimation #fault #parametricity
Linear transformation parameter estimation for fault detection (AK, MP), pp. 550–552.
ICPRICPR-1998-LiLCLW #recognition
Hierarchical linear combinations for face recognition (SZL, JL, KLC, JL, LW), pp. 1191–1193.
ICPRICPR-1998-LiuW98a #modelling #recognition
Enhanced Fisher linear discriminant models for face recognition (CL, HW), pp. 1368–1372.
ICPRICPR-1998-TingL #layout
Linear layout processing (AT, MKHL), pp. 403–405.
ICPRICPR-1998-ZhaoN #analysis #recognition
Linear discriminant analysis of MPF for face recognition (WZ, NN), pp. 185–188.
PPDPALP-PLILP-1998-AjiliL #constraints
Integrating Constraint Propagation in Complete Solving of Linear Diophantine Systems (FA, HCRL), pp. 463–480.
SASSAS-1998-GiacobazziRS #abstract interpretation
Building Complete Abstract Interpretations in a Linear Logic-based Setting (RG, FR, FS), pp. 215–229.
SACSAC-1998-McGuireS #algorithm #search-based #using
Using a genetic algorithm to find good linear error-correcting codes (KMM, RES), pp. 332–337.
DACDAC-1998-FallahDK #functional #generative #modelling #programming #satisfiability #using
Functional Vector Generation for HDL Models Using Linear Programming and 3-Satisfiability (FF, SD, KK), pp. 528–533.
DACDAC-1998-NguyenDN #simulation
Adjoint Transient Sensitivity Computation in Piecewise Linear Simulation (TVN, AD, OJN), pp. 477–482.
DATEDATE-1998-FreundF #approximate #modelling #multi #scalability #using
Reduced-Order Modeling of Large Linear Passive Multi-Terminal Circuits Using Matrix-Pade Approximation (RWF, PF), pp. 530–537.
DATEDATE-1998-HedrichB #approach #formal method #parametricity #verification
A Formal Approach to Verification of Linear Analog Circuits with Parameter Tolerances (LH, EB), pp. 649–654.
DATEDATE-1998-Velasco-MedinaCN #detection #fault #injection #using
Fault Detection for Linear Analog Circuits Using Current Injection (JVM, TC, MN), pp. 987–988.
FoSSaCSFoSSaCS-1998-Heckmann #integer
The Appearance of Big Integers in Exact Real Arithmetic Based on Linear Fractional Transformations (RH), pp. 172–188.
STOCSTOC-1998-BuchsbaumKRW #algorithm #verification
Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators (ALB, HK, AR, JW), pp. 279–288.
TACASTACAS-1998-AjamiHI #logic #model checking #symmetry
Exploiting Symmetry in Linear Time Temporal Logic Model Checking: One Step Beyond (KA, SH, JMI), pp. 52–67.
CADECADE-1998-Pfenning #deduction #logic #reasoning
Reasoning About Deductions in Linear Logic (FP), pp. 1–2.
CSLCSL-1998-Schwentick #bound #complexity
Descriptive Complexity, Lower Bounds and Linear Time (TS), pp. 9–28.
ICLPJICSLP-1998-HodasWTK #implementation #logic programming #performance #programming language
Efficient Implementation of a Linear Logic Programming Language (JSH, KMW, NT, KSK), pp. 145–159.
ICLPJICSLP-1998-McAloon #logic programming #research
Disjunctive Linear Programming: At the Intersection of Operations Research and Logic Programming (KM), pp. 5–6.
LICSLICS-1998-KupfermanV
Freedom, Weakness, and Determinism: From Linear-Time to Branching-Time (OK, MYV), pp. 81–92.
LICSLICS-1998-Mackie #logic
Linear Logic With Boxes (IM), pp. 309–320.
LICSLICS-1998-Vardi #branch #perspective
Linear vs. Branching Time: A Complexity-Theoretic Perspective (MYV), pp. 394–405.
ICDARICDAR-1997-ChenAS
Piecewise Linear Modulation Model of Handwriting (HC, OEA, CYS), pp. 363–368.
ICDARICDAR-1997-WorringS #case study #documentation #internet
From Linear to Non-Linear Reading: A Case Study to Provide Internet Access to Paper Documents (MW, AWMS), p. 273–?.
PODSPODS-1997-GoldsteinRSY #constraints #query
Processing Queries By Linear Constraints (JG, RR, US, JBY), pp. 257–267.
PODSPODS-1997-IbarraS #constraints #database #equivalence #on the #query
On the Containment and Equivalence of Database Queries with Linear Constraints (OHI, JS), pp. 32–43.
ICALPICALP-1997-BodlaenderT #algorithm
Constructive Linear Time Algorithms for Branchwidth (HLB, DMT), pp. 627–637.
ICALPICALP-1997-ManziniM #automaton #classification
A Complete and Efficiently Computable Topological Classification of D-dimensional Linear Cellular Automata over Zm (GM, LM), pp. 794–804.
RTARTA-1997-OyamaguchiO #parallel #term rewriting
A New Parallel Closed Condition for Church-Rossser of Left-Linear Term Rewriting Systems (MO, YO), pp. 187–201.
RTARTA-1997-TomasF #equation #geometry #using
Solving Linear Diophantine Equations Using the Geometric Structure of the Solution Space (APT, MF), pp. 269–283.
RTARTA-1997-Vorobyov #decidability #first-order
The First-Order Theory of One Step Rewriting in Linear Noetherian Systems is Undecidable (SGV), pp. 254–268.
TLCATLCA-1997-RetoreL #commutative #logic
A Non-commutative Extension of Classical Linear Logic (CR, PL), pp. 300–318.
ICMLICML-1997-Gama #probability
Probabilistic Linear Tree (JG), pp. 134–142.
PPDPALP-1997-CesarM
A Left-Linear Variant of λσ (AC, HM), pp. 224–239.
PLDIPLDI-1997-HeintzeM #analysis #control flow #transitive
Linear-time Subtransitive Control Flow Analysis (NH, DAM), pp. 261–272.
POPLPOPL-1997-ChenH #monad
Rolling Your Own MADT — A Connection Between Linear Types and Monads (CPC, PH), pp. 54–66.
POPLPOPL-1997-Halbwachs #automation #network #process #verification
Automatic Verification of Parameterized Linear Networks of Processes (DL, NH, PR), pp. 346–357.
DACDAC-1997-MeinelST #diagrams
Linear Sifting of Decision Diagrams (CM, FS, TT), pp. 202–207.
PDPPDP-1997-Ojeda-GuerraS #equation #network
Solving linear systems of equations overlapping communications and computations in torus networks (CNOG, ÁS), pp. 453–460.
STOCSTOC-1997-AlonDMPT #question
Is Linear Hashing Good? (NA, MD, PBM, EP, GT), pp. 465–474.
STOCSTOC-1997-CramerD #performance #proving
Linear Zero-Knowledge — A Note on Efficient Zero-Knowledge Proofs and Arguments (RC, ID), pp. 436–445.
STOCSTOC-1997-FortnowS #probability
Retraction of Probabilistic Computation and Linear Time (LF, MS), p. 750.
TACASTACAS-1997-SchmittG #logic
A Tableau System for Linear-TIME Temporal Logic (PHS, JGL), pp. 130–144.
TAPSOFTTAPSOFT-1997-Schubert #higher-order #problem
Linear Interpolation for the Higher-Order Matching Problem (AS), pp. 441–452.
CADECADE-1997-KreitzMOS #logic #proving
Connection-Based Proof Construction in Linear Logic (CK, HM, JO, SS), pp. 207–221.
CAVCAV-1997-BoigelotBR #analysis #hybrid #reachability
An Improved Reachability Analysis Method for Strongly Linear Hybrid Systems (BB, LB, SR), pp. 167–178.
CAVCAV-1997-Sistla #automaton #invariant #network #using #verification
Parametrized Verification of Linear Networks Using Automata as Invariants (APS), pp. 412–423.
CSLCSL-1997-BarberGHP #calculus #logic
From Action Calculi to Linear Logic (AB, PG, MH, GDP), pp. 78–97.
CSLCSL-1997-BonetG #bound #simulation
Linear Lower Bounds and Simulations in Frege Systems with Substitutions (MLB, NG), pp. 115–128.
CSLCSL-1997-BraunerP #logic
A Formulation of Linear Logic Based on Dependency-Relations (TB, VdP), pp. 129–148.
CSLCSL-1997-Hofmann #recursion #λ-calculus
A Mixed Modal/Linear λ Calculus with Applications to Bellantoni-Cook Safe Recursion (MH0), pp. 275–294.
CSLCSL-1997-Olive #logic #nondeterminism
A Conjunctive Logical Characterization of Nondeterministic Linear Time (FO), pp. 360–372.
LICSLICS-1997-BaillotDE #game studies #logic
Believe it or not, AJM’s Games Model is a Model of Classical Linear Logic (PB, VD, TE, LR), pp. 68–75.
LICSLICS-1997-CervesatoP #higher-order
Linear Higher-Order Pre-Unification (IC, FP), pp. 422–433.
LICSLICS-1997-KanovichI #concurrent #logic #process #specification
Temporal Linear Logic Specifications for Concurrent Processes (MIK, TI), pp. 48–57.
LICSLICS-1997-ThiagarajanW #logic
An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces (PST, IW), pp. 183–194.
PODSPODS-1996-StolboushkinT #database #order #query
Linear vs. Order Contstrained Queries Over Rational Databases (APS, MAT), pp. 17–27.
ICALPICALP-1996-BradfieldEM #calculus #effectiveness #μ-calculus
An Effective Tableau System for the Linear Time μ-Calculus (JCB, JE, AM), pp. 98–109.
ICALPICALP-1996-Lisovik #set
Hard Sets Method and Semilinear Reservoir Method with Applications (LPL), pp. 219–231.
RTARTA-1996-Levy #higher-order #unification
Linear Second-Order Unification (JL), pp. 332–346.
ICPRICPR-1996-BollackerG
Linear feature extractors based on mutual information (KDB, JG), pp. 720–724.
ICPRICPR-1996-ChaiZZS #algorithm #search-based
Binary linear decision tree with genetic algorithm (BBC, XZ, YZ, JS), pp. 530–534.
ICPRICPR-1996-LasakulAK #analysis #formal method #image #multi #using
A theory of image restoration for linear spatial degradation using multiresolution analysis (AL, KA, SK), pp. 422–426.
ICPRICPR-1996-MartinezST #performance #recursion
A recursive updating rule for efficient computation of linear moments in sliding-window applications (JM, ES, FT), pp. 295–299.
ICPRICPR-1996-RanganathanBV #array #image
A dynamic frequency linear array processor for image processing (NR, NB, NV), pp. 611–615.
ICPRICPR-1996-Raudys #classification #design
Linear classifiers in perceptron design (SR), pp. 763–767.
ICPRICPR-1996-VriesengaS #classification #modelling
Neural modeling of piecewise linear classifiers (MV, JS), pp. 281–285.
KDDKDD-1996-ArningAR #database #detection #scalability
A Linear Method for Deviation Detection in Large Databases (AA, RA, PR), pp. 164–169.
KDDKDD-1996-Domingos #induction
Linear-Time Rule Induction (PMD), pp. 96–101.
SIGIRSIGIR-1996-LewisSCP #algorithm #classification
Training Algorithms for Linear Text Classifiers (DDL, RES, JPC, RP), pp. 298–306.
POPLPOPL-1996-Steensgaard #analysis #points-to
Points-to Analysis in Almost Linear Time (BS), pp. 32–41.
DACDAC-1996-LiLLC #approach #clustering
New Spectral Linear Placement and Clustering Approach (JL, JL, LTL, CKC), pp. 88–93.
DACDAC-1996-LiM #adaptation #modelling #parametricity #using
Computing Parametric Yield Adaptively Using Local Linear Models (ML, LSM), pp. 831–836.
DACDAC-1996-MehendaleVS #code generation #multi
Optimized Code Generation of Multiplication-free Linear Transforms (MM, GV, SDS), pp. 41–46.
DACDAC-1996-OhPP #bound #programming #using
Constructing Lower and Upper Bounded Delay Routing Trees Using Linear Programming (JO, IP, MP), pp. 401–404.
DACDAC-1996-SrivastavaP #approach #implementation #optimisation #programmable
Power Optimization in Programmable Processors and ASIC Implementations of Linear Systems: Transformation-based Approach (MBS, MP), pp. 343–348.
PDPPDP-1996-Hegland #divide and conquer #equation
Divide and Conquer for the Solution of Banded Linear Systems of Equations (MH), pp. 394–403.
TAPSOFTTAPSOFT-J-1995-JonssonT96 #logic #specification
Assumption/Guarantee Specifications in Linear-Time Temporal Logic (BJ, YKT), pp. 47–72.
ESOPESOP-1996-Rose #functional
Linear Time Hierarchies for a Functional Language Machine Model (ER), pp. 311–325.
STOCSTOC-1996-AllenderBO #complexity #equation #matrix #rank
The Complexity of Matrix Rank and Feasible Systems of Linear Equations (EA, RB, MO), pp. 161–167.
STOCSTOC-1996-KushilevitzOR #privacy
Characterizing Linear Size Circuits in Terms of Privacy (EK, RO, AR), pp. 541–550.
STOCSTOC-1996-Milenkovic #programming #strict #using
Translational Polygon Containment and Minimal Enclosure using Linear Programming Based Restriction (VM), pp. 109–118.
STOCSTOC-1996-Mohar #graph
Embedding Graphs in an Arbitrary Surface in Linear Time (BM), pp. 392–397.
ISSTAISSTA-1996-HowdenS #analysis #sequence
Linear and Structural Event Sequence Analysis (WEH, GMS), pp. 98–106.
ICLPJICSLP-1996-BugliesiDML #calculus #logic
A Linear Logic Calculus Objects (MB, GD, LL, MM), pp. 67–81.
LICSLICS-1996-BentonW #logic #monad #λ-calculus
Linear Logic, Monads and the λ Calculus (PNB, PW), pp. 420–431.
LICSLICS-1996-CervesatoP #framework #logic
A Linear Logical Framework (IC, FP), pp. 264–275.
LICSLICS-1996-Narendran #equation #polynomial
Solving Linear Equations over Polynomial Semirings (PN), pp. 466–472.
LICSLICS-1996-Ramanujam #logic
Locally Linear Time Temporal Logic (RR), pp. 118–127.
LICSLICS-1996-WillemsW #branch #model checking #partial order
Partial-Order Methods for Model Checking: From Linear Time to Branching Time (BW, PW), pp. 294–303.
DLTDLT-1995-Cassaigne #complexity #sequence
Special Factors of Sequences with Linear Subword Complexity (JC), pp. 25–34.
DLTDLT-1995-Ito
Height Functions and Linear Languages (MI), pp. 98–101.
DLTDLT-1995-Nitsche #logic #semantics
A Finitary-Language Semantics for Propositional Linear Temporal Logic (UN), pp. 482–489.
ICALPICALP-1995-CorneilOS #algorithm #graph
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs (DGC, SO, LS), pp. 292–302.
RTARTA-1995-AbdulrabM #equation
General Solution of Systems of Linear Diophantine Equations and Inequations (HA, MM), pp. 339–351.
TLCATLCA-1995-Bierman #category theory #logic #question #what
What is a Categorical Model of Intuitionistic Linear Logic? (GMB), pp. 78–93.
CIKMCIKM-1995-Teuhola #clustering #effectiveness
Effective Clustering of Objects Stored by Linear Hashing (JT), pp. 274–280.
PPDPPLILP-1995-McEvoyH #locality #logic #multi
Local Linear Logic for Locality Consciousness in Multiset Transformation (HM, PHH), pp. 357–379.
POPLPOPL-1995-SreedharG #algorithm
A Linear Time Algorithm for Placing phi-nodes (VCS, GRG), pp. 62–73.
SACSAC-1995-BanachP #behaviour #graph grammar #source code
Linear behaviour of term graph rewriting programs (RB, GAP), pp. 157–163.
SACSAC-1995-Sabin #generative #parallel #using
The use of parallelization in the generation of binary linear codes (RES), pp. 215–220.
DACDAC-1995-FeldmannF #algorithm #modelling #scalability
Reduced-Order Modeling of Large Linear Subcircuits via a Block Lanczos Algorithm (PF, RWF), pp. 474–479.
PDPPDP-1995-DApuzzoL #parallel #scalability
A parallel row projection solver for large sparse linear systems (MD, ML), pp. 432–443.
PDPPDP-1995-GalliganiR #implementation
Implementation of splitting methods for solving block tridiagonal linear systems on transputers (EG, VR), pp. 409–415.
PDPPDP-1995-Pavani #algebra #parallel
Parallel Numerical Linear Algebra (RP), p. 400–?.
PPoPPPPoPP-1995-KennedyNS #algorithm #memory management #sequence #source code
A Linear-Time Algorithm for Computing the Memory Access Sequence in Data-Parallel Programs (KK, NN, AS), pp. 102–111.
STOCSTOC-1995-AnderssonHNR #question #sorting
Sorting in linear time? (AA, TH, SN, RR), pp. 427–436.
STOCSTOC-1995-Ergun #generative #multi #testing
Testing multivariate linear functions: overcoming the generator bottleneck (FE), pp. 407–416.
STOCSTOC-1995-KivinenW #predict
Additive versus exponentiated gradient updates for linear prediction (JK, MKW), pp. 209–218.
STOCSTOC-1995-Spielman
Linear-time encodable and decodable error-correcting codes (DAS), pp. 388–397.
TAPSOFTTAPSOFT-1995-JonssonT #logic #specification
Assumption/Guarantee Specifications in Linear-Time Temporal Logic (Extended Abstract) (BJ, YKT), pp. 262–276.
CAVCAV-1995-BouajjaniLR #automaton #calculus #hybrid
From Duration Calculus To Linear Hybrid Automata (AB, YL, RR), pp. 196–210.
CAVCAV-1995-BouajjaniR #hybrid #subclass #verification
Verifying ω-Regular Properties for a Subclass of Linear Hybrid Systems (AB, RR), pp. 437–450.
ICLPICLP-1995-BurgSTY #constraints #equation #logic programming
Linear Equation Solving for Constraint Logic Programming (JB, PJS, JCHT, RHCY), pp. 33–47.
ICLPICLP-1995-ChiuL #constraints #theorem proving #using
Interval Linear Constraint Solving Using the Preconditioned Interval Gauss-Seidel Method (CKC, JHML), pp. 17–31.
ICLPILPS-1995-TarauDF #backtracking #continuation
Backtrackable State with Linear Assumptions, Continuations and Hidden Accumulator Grammars (PT, VD, AF), p. 642.
ICLPILPS-1995-WinikoffH #implementation #logic programming #programming language
Implementing the Linear Logic Programming Language Lygon (MW, JH), pp. 66–80.
LICSLICS-1995-Kanovich #complexity #logic
The Complexity of Neutrals in Linear Logic (MIK), pp. 486–495.
LICSLICS-1995-Kopylov #decidability #logic
Decidability of Linear Affine Logic (APK), pp. 496–504.
LICSLICS-1995-Lamarche #game studies #logic #semantics
Games Semantics for Full Propositional Linear Logic (FL), pp. 464–473.
LICSLICS-1995-LincolnSS #higher-order #logic #problem
Decision Problems for Second-Order Linear Logic (PL, AS, NS), pp. 476–485.
ICALPICALP-1994-PlotkinW #logic
Bistructures, Bidomains and Linear Logic (GDP, GW), pp. 352–363.
ICGTTAGT-1994-BrandenburgS #automaton #graph
Graph Automata for Linear Graph Languages (FJB, KS), pp. 336–350.
CIKMCIKM-1994-ChenH #algorithm #graph #source code #traversal
An Optimal Graph Traversal Algorithm for Evaluating Linear Binary-Chain Programs (YC, TH), pp. 34–41.
SEKESEKE-1994-CookeDGK #concurrent #logic programming #source code
Bag languages, concurrency, Horn logic programs, and linear logic (DEC, RD, AQG, VK), pp. 289–297.
PPDPALP-1994-Volpe #concurrent #logic programming #proving
Concurrent Logic Programming as Uniform Linear Proofs (PV), pp. 133–149.
PLDIPLDI-1994-JohnsonPP
The Program Structure Tree: Computing Control Regions in Linear Time (RJ, DP, KP), pp. 171–185.
SASSAS-1994-HalbwachsPR #approximate #hybrid #verification
Verification of Linear Hybrid Systems by Means of Convex Approximations (NH, YEP, PR), pp. 223–237.
SACSAC-1994-ChaudhuriD #generative #sequence
A note on generating a worst case sequence for Quicksort in linear time (RC, ACD), pp. 566–567.
SACSAC-1994-RayJD #algorithm #array #graph #parallel
A parallel algorithm for mapping a special class of task graphs onto linear array multiprocessors (SR, HJ, JSD), pp. 473–477.
SACSAC-1994-RogersU #using
A deterrent to linear system inferential attacks using a mediator (DSR, EAU), pp. 15–19.
DATEEDAC-1994-SrivastavaP #latency #optimisation
Transforming Linear Systems for Joint Latency and Throughout Optimization (MBS, MP), pp. 267–271.
DATEEDAC-1994-WangD #approximate #optimisation #performance #using
An Efficient Yield Optimization Method Using A Two Step Linear Approximation of Circuit Performance (ZW, SWD), pp. 567–571.
PDPPDP-1994-Genco #parallel
Parallel Simulated Annealing: Getting Super Linear Speedups (AG), pp. 268–273.
PDPPDP-1994-MilliganMB #algebra #automation #empirical #parallel
The Mathematician’s Devil: An Experiment In Automating The Production Of Parallel Linear Algebra Software (PM, RM, TJGB), pp. 385–391.
PDPPDP-1994-StuartW #algorithm #approach #parallel #using #visualisation
The Enhancement Of Parallel Numerical Linear Algorithms Using A Visualization Approach (EJS, JSW), pp. 274–281.
STOCSTOC-1994-KleinT #algorithm #random
A randomized linear-time algorithm for finding minimum spanning trees (PNK, RET), pp. 9–15.
STOCSTOC-1994-Mulmuley #bound #parallel #problem #programming
Lower bounds for parallel linear programming and other problems (KM), pp. 603–614.
CAVCAV-1994-BouajjaniER #hybrid #using #verification
Verification of Context-Free Timed Systems Using Linear Hybrid Observers (AB, RE, RR), pp. 118–131.
CAVCAV-1994-OliveroSY #abstraction #hybrid #using #verification
Using Abstractions for the Verification of Linear Hybrid Systems (AO, JS, SY), pp. 81–94.
ICLPILPS-1994-Imbert #equation
Redundancy, Variable Elimination and Linear Disequations (JLI), pp. 139–153.
ICLPILPS-1994-MarriottS #approximate #constraints #interactive
Approximating Interaction between Linear Arithmetic Constraints (KM, PJS), pp. 571–585.
ICLPILPS-1994-MichaylovP #compilation #constraints #logic programming #optimisation #source code
Optimizing Compilation of Linear Arithmetic in a Class of Constraint Logic Programs (SM, BP), pp. 586–600.
LICSLICS-1994-HellaKL #finite #how #modelling #order
How to Define a Linear Order on Finite Models (LH, PGK, KL), pp. 40–49.
LICSLICS-1994-HuthJK #approximate
Linear Types, Approximation, and Topology (MH, AJ, KK), pp. 110–114.
LICSLICS-1994-LincolnS #calculus #first-order #logic #proving
Proof Search in First-Order Linear Logic and Other Cut-Free Sequent Calculi (PL, NS), pp. 282–291.
LICSLICS-1994-Loader #logic
Linear Logic, Totality and Full Completeness (RL), pp. 292–298.
LICSLICS-1994-Thiagarajan #logic
A Trace Based Extension of Linear Time Temporal Logic (PST), pp. 438–447.
ICDARICDAR-1993-TokahashiG #recognition #verification
Recognition enhancement by linear tournament verification (HT, TDG), pp. 585–588.
SIGMODSIGMOD-1993-LitwinNS #distributed
LH* — Linear Hashing for Distributed Files (WL, MAN, DAS), pp. 327–336.
RTARTA-1993-Martin
Linear Interpretations by Counting Patterns (UM), pp. 421–433.
TLCATLCA-1993-BentonBPH #calculus #logic
A Term Calculus for Intuitionistic Linear Logic (PNB, GMB, VdP, MH), pp. 75–90.
PPDPPLILP-1993-DarlingtonGK #functional #logic #perspective #programming language
Functional Programming Languages with Logical Variables: A Linear Logic View (JD, YG, MK), pp. 201–219.
SACSAC-1993-AcreeCUGS #adaptation #algorithm #analysis #parallel
Parallelization and Analysis of a Linear Adaptive Filtering Algorithm (RKA, DTC, NU, MJG, DMS), pp. 165–172.
SACSAC-1993-GrahamI #incremental
Double- and Triple-Step Incremental Linear Interpolation (PG, SSI), pp. 368–372.
SACSAC-1993-Konstam #algorithm #analysis #search-based #using
Linear Discriminant Analysis Using Genetic Algorithms (AHK), pp. 152–156.
DACDAC-1993-HamadaCC #approach #named #network #using
Prime: A Timing-Driven Placement Tool using A Piecewise Linear Resistive Network Approach (TH, CKC, PMC), pp. 531–536.
PDPPDP-1993-DaugerasBC #algebra #standard
Static computation of standard linear algebra subroutines for PTAH (ED, JLB, FC), pp. 30–34.
STOCSTOC-1993-BergMS
Piecewise linear paths among convex obstacles (MdB, JM, OS), pp. 505–514.
STOCSTOC-1993-Bodlaender #algorithm
A linear time algorithm for finding tree-decompositions of small treewidth (HLB), pp. 226–234.
STOCSTOC-1993-CooperL #performance #protocol
Fast perfection-information leader-election protocol with linear immunity (JC, NL), pp. 662–671.
STOCSTOC-1993-LubyN #algorithm #approximate #parallel #programming
A parallel approximation algorithm for positive linear programming (ML, NN), pp. 448–457.
STOCSTOC-1993-PapadimitriouY #matrix #programming
Linear programming without the matrix (CHP, MY), pp. 121–129.
TAPSOFTTAPSOFT-1993-AndreoliLPT #communication #concurrent #logic programming #programming language #semantics
True Concurrency Semantics for a Linear Logic Programming Language with Braodcast Communication (JMA, LLT, RP, BT), pp. 182–198.
TAPSOFTTAPSOFT-1993-Qian #higher-order #unification
Linear Unification of Higher-Order Patterns (ZQ), pp. 391–405.
ICLPICLP-1993-BackerB #constraints
A CLP Language Handling Disjunctions of Linear Constraints (BDB, HB), pp. 550–563.
ICLPICLP-1993-Contejean #constraints #incremental
Solving Linear Diophantine Constraints Incrementally (EC), pp. 532–549.
ICLPICLP-1993-HarlandR #constraints #recursion
Constraint Propagation for Linear Recursive Rules (JH, KR), pp. 683–699.
ICLPICLP-1993-Imbert #constraints
Variable Elimination for Generalized Linear Constraints (JLI), pp. 499–516.
ICLPILPS-1993-AndreoliCP #abstract interpretation #logic programming
Abstract Interpretation of Linear Logic Programming (JMA, TC, RP), pp. 295–314.
ICLPILPS-1993-KobayashiY #concurrent #logic programming #named #paradigm
ACL — A Concurrent Linear Logic Programming Paradigm (NK, AY), pp. 279–294.
PODSPODS-1992-BellNNS #database #deduction #implementation #programming
Implementing Deductive Databases by Linear Programming (CB, AN, RTN, VSS), pp. 283–292.
ICALPICALP-1992-Shallit #set
Numeration Systems, Linear Recurrences, and Regular Sets (JS), pp. 89–100.
LISPLFP-1992-ChirimarGR #invariant #logic #memory management #proving
Proving Memory Management Invariants for a Language Based on Linear Logic (JC, CAG, JGR), pp. 139–150.
SEKESEKE-1992-TuS #approach #petri net #programming #static analysis
Linear Programming Supporting Ada-Tasking Static Analysis: A Petri Net Approach (ST, WS), pp. 222–226.
PPDPPLILP-1992-VerschaetseS #abstract interpretation
Deriving of Linear Size Relations by Abstract Interpretation (KV, DDS), pp. 296–310.
POPLPOPL-1992-BatesL #lr #string
Recognizing Substrings of LR(k) Languages in Linear Time (JB, AL), pp. 235–245.
POPLPOPL-1992-Filinski #continuation
Linear Continuations (AF), pp. 27–38.
SASWSA-1992-MesnardM #automation #generative #metric #source code
Automatic Generation of Valid Linear Measures for CLP(Q) Programs (FM, MM), pp. 29–34.
ICSEICSE-1992-AfifiWZ #fault #source code #testing
Testing for Linear Errors in Nonlinear Computer Programs (FHA, LJW, SJZ), pp. 81–91.
DACDAC-1992-LeeR #analysis #evaluation #named #using
AWEsymbolic: Compiled Analysis of Linear(ized) Circuits using Asymptotic Waveform Evaluation (JYL, RAR), pp. 213–218.
DACDAC-1992-RoychowdhuryNP #simulation
Simulating Lossy Interconnect with High Frequency Nonidealities in Linear Time (JSR, ARN, DOP), pp. 75–80.
ESOPESOP-1992-Odersky
Observers for Linear Types (MO), pp. 390–407.
STOCSTOC-1992-AdlerB #algebra #algorithm #polynomial #programming
Polynomial Algorithms for Linear Programming over the Algebraic Numbers (IA, PAB), pp. 483–494.
STOCSTOC-1992-AjtaiM #algorithm #programming
A Deterministic Poly(log log N)-Time N-Processor Algorithm for Linear Programming in Fixed Dimension (MA, NM), pp. 327–338.
STOCSTOC-1992-BealsS #composition
Structure Forest and Composition Factors for Small Base Groups in Nearly Linear Time (RB, ÁS), pp. 116–125.
STOCSTOC-1992-BjornerLY #bound
Linear Decision Trees: Volume Estimates and Topological Bounds (AB, LL, ACCY), pp. 170–177.
CADECADE-1992-Sutcliffe92a #deduction #semantics
The Semantically Guided Linear Deduction System (GS), pp. 677–680.
CAVCAV-1992-Kaivola #composition #logic #model checking
Compositional Model Checking for Linear-Time Temporal Logic (RK), pp. 248–259.
CSLCSL-1992-AanderaaJ #logic #recursion
Recursive Inseparability in Linear Logic (SA, HRJ), pp. 5–13.
CSLCSL-1992-BentonBPH #modelling #revisited #λ-calculus
Linear λ-Calculus and Categorial Models Revisited (PNB, GMB, VdP, MH), pp. 61–84.
CSLCSL-1992-Creignou #problem #proving #satisfiability
The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness (NC), pp. 115–133.
CSLCSL-1992-Grandjean #algorithm #problem
Linear Time Algorithms and NP-Complete Problems (EG), pp. 248–273.
ICLPJICSLP-1992-Troelstra #logic #tutorial
Tutorial on Linear Logic (AST), pp. 30–31.
LICSLICS-1992-GonthierAL #logic
Linear Logic Without Boxes (GG, MA, JJL), pp. 223–234.
LICSLICS-1992-Kanovich #logic #programming
Horn Programming in Linear Logic Is NP-Complete (MIK), pp. 200–210.
LICSLICS-1992-LincolnM #aspect-oriented #λ-calculus
Operational aspects of linear λ calculus (PL, JCM), pp. 235–246.
LICSLICS-1992-Stolboushkin #axiom #finite #modelling #order
Axiomatizable Classes of Finite Models and Definability of Linear Order (APS), pp. 64–70.
LICSLICS-1992-Toyama #term rewriting
Strong Sequentiality of Left-Linear Overlapping Term Rewriting Systems (YT), pp. 274–284.
PODSPODS-1991-MumickP #bound #query
Overbound and Right-Linear Queries (ISM, HP), pp. 127–141.
ICALPICALP-1991-GalilM #algorithm #problem
An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem (ZG, OM), pp. 719–727.
ICALPICALP-1991-GrogerT #on the
On Linear Decision Trees Computing Boolean Functions (HDG, GT), pp. 707–718.
RTARTA-1991-Pottier #algorithm #bound
Minimal Solutions of Linear Diophantine Systems: Bounds and Algorithms (LP), pp. 162–173.
PEPMPEPM-1991-Wadler #logic #question
Is There a Use for Linear Logic? (PW), pp. 255–273.
PLDIPLDI-1991-ProebstingF #architecture #scheduling
Linear-Time, Optimal Code Scheduling for Delayed-Load Architectures (TAP, CNF), pp. 256–267.
DACDAC-1991-SiglDJ #polynomial #question
Analytical Placement: A Linear or a Quadratic Objective Function? (GS, KD, FMJ), pp. 427–432.
TAPSOFTCAAP-1991-Caron #automaton #bound #term rewriting
Linear Bounded Automata and Rewrite Systems: Influence of Initial Configurations on Decision Properties (ACC), pp. 74–89.
TAPSOFTCAAP-1991-Granger #congruence #static analysis
Static Analysis of Linear Congruence Equalities among Variables of a Program (PG), pp. 169–192.
STOCSTOC-1991-BlumJLTY #approximate #string
Linear Approximation of Shortest Superstrings (AB, TJ, ML, JT, MY), pp. 328–336.
STOCSTOC-1991-BrightwellW
Counting Linear Extensions is #P-Complete (GB, PW), pp. 175–181.
STOCSTOC-1991-CohenM #algorithm #difference
Improved Algorithms for Linear Inequalities with Two Variables per Inequality (EC, NM), pp. 145–155.
STOCSTOC-1991-LittlestoneLW #learning #online
On-Line Learning of Linear Functions (NL, PML, MKW), pp. 465–475.
CAVCAV-1991-CleavelandS #algorithm #calculus #model checking #μ-calculus
A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal μ-Calculus (RC, BS), pp. 48–58.
CAVCAV-1991-Jeffrey #algebra #process
A Linear Time Process Algebra (AJ), pp. 432–442.
ICLPICLP-1991-BrissetR
Naïve Reverse Can be Linear (PB, OR), pp. 857–870.
ICLPISLP-1991-HarlandP #logic programming
The Uniform Proof-Theoretic Foundation of Linear Logic Programming (JH, DJP), pp. 304–318.
LICSLICS-1991-HodasM #logic programming
Logic Programming in a Fragment of Intuitionistic Linear Logic (JSH, DM), pp. 32–42.
LICSLICS-1991-LafontS #game studies #logic #semantics
Games Semantics for Linear Logic (YL, TS), pp. 43–50.
SIGMODSIGMOD-1990-Jagadish #clustering #multi
Linear Clustering of Objects with Multiple Atributes (HVJ), pp. 332–342.
VLDBVLDB-1990-SeverancePW #database #distributed #in memory #memory management #parallel
Distributed Linear Hashing and Parallel Projection in Main Memory Databases (CS, SP, PW), pp. 674–682.
SEKESEKE-1990-Al-SukairiH #compilation #independence #recursion
Query-Independent Compilation of Linear Recursions (AAS, LJH), pp. 177–182.
PLDIPLDI-1990-Tseng #array #compilation #source code
Compiling Programs for a Linear Systolic Array (PST), pp. 311–321.
DACDAC-1990-KageyamaMS #algorithm #approach #logic #optimisation #programming
Logic Optimization Algorithm by Linear Programming Approach (NK, CM, TS), pp. 345–348.
DACDAC-1990-PapachristouK #algorithm #optimisation #scheduling
A Linear Program Driven Scheduling and Allocation Method Followed by an Interconnect Optimization Algorithm (CAP, HK), pp. 77–83.
STOCSTOC-1990-RazW
Monotone Circuits for Matching Require Linear Depth (RR, AW), pp. 287–292.
CAVCAV-1990-HamaguchiHY #branch #complexity #logic #model checking
Branching Time Regular Temporal Logic for Model Checking with Linear Time Complexity (KH, HH, SY), pp. 253–262.
ICLPCLP-1990-AndreoliP90 #inheritance #logic #process
Linear Objects in a Logic Processes with Built-in Inheritance (JMA, RP), pp. 495–510.
LICSLICS-1990-BrownG #category theory #framework #petri net
A Categorical Linear Framework for Petri Nets (CB, DG), pp. 208–218.
LICSLICS-1990-Cerrito #logic programming #semantics #source code
A Linear Semantics for Allowed Logic Programs (SC), pp. 219–227.
PODSPODS-1989-Bonner #datalog #recursion
Hypothetical Datalog: Negation and Linear Recursion (AJB), pp. 286–300.
VLDBVLDB-1989-Ioannidis #commutative #recursion
Commutativity and its Role in the Processing of Linear Recursion (YEI), pp. 155–163.
RTARTA-1989-AbdulrabP #equation #word
Solving Systems of Linear Diophantine Equations and Word Equations (HA, JPP), pp. 530–532.
RTARTA-1989-Dauchet #simulation #turing machine
Simulation of Turing Machines by a Left-Linear Rewrite Rule (MD), pp. 109–120.
RTARTA-1989-ToyamaKB #term rewriting #termination
Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft- (YT, JWK, HPB), pp. 477–491.
KRKR-1989-RossiM #constraints #network #using
Exact Solution in Linear Time of Networks of Constraints Using Perfect Relaxation (FR, UM), pp. 394–399.
OOPSLAOOPSLA-1989-McDonald #algebra #object-oriented #programming
Object-Oriented Programming for Linear Algebra (JAM), pp. 175–184.
STOCSTOC-1989-FortnowS #probability
Probabilistic Computation and Linear Time (LF, MS), pp. 148–156.
CSLCSL-1989-Dahlhaus #complexity
The Complexity of Subtheories of the Existential Linear Theory of Reals (ED), pp. 76–89.
ICLPNACLP-1989-HanL #multi #recursion
Processing Multiple Linear Recursions (JH, LL), pp. 816–830.
ICLPNACLP-1989-LassezHM #constraints
Simplification and Elimination of Redundant Linear Arithmetic Constraints (JLL, TH, KM), pp. 37–51.
PODSPODS-1988-Vardi #bound #decidability #query #recursion
Decidability and Undecidability Results for Boundedness of Linear Recursive Queries (MYV), pp. 341–351.
ICALPICALP-1988-Schafer #approach
A Kleene-Presburgerian Approach to Linear Production Systems (JS), pp. 525–534.
ICALPICALP-1988-Tao #automaton #finite
Invertibility of Linear Finite Automata Over a Ring (RjT), pp. 489–501.
SIGIRSIGIR-1988-WongYB #information retrieval
Linear Structure in Information Retrieval (SKMW, YY, PB), pp. 219–232.
PPDPALP-1988-FulopV #automaton #set #term rewriting
A Characterization of Irreducible Sets Modulo Left-Linear Term Rewriting Systems by Tree Automata (ZF, SV), p. 157.
PLDIPLDI-1988-CooperK #analysis #interprocedural
Interprocedural Side-Effect Analysis in Linear Time (KDC, KK), pp. 57–66.
PLDIBest-of-PLDI-1988-CooperK88a #analysis #interprocedural
Interprocedural side-effect analysis in linear time (with retrospective) (KDC, KK), pp. 217–228.
STOCSTOC-1988-GurevichS #nondeterminism #sublinear
Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space (YG, SS), pp. 281–289.
STOCSTOC-1988-Yannakakis #combinator #optimisation #problem #source code
Expressing Combinatorial Optimization Problems by Linear Programs (MY), pp. 223–228.
CADECADE-1988-CerroH #deduction
Linear Modal Deductions (LFdC, AH), pp. 487–499.
CADECADE-1988-Kafl #reasoning
Reasoning about Systems of Linear Inequalities (TK), pp. 563–572.
SIGMODSIGMOD-1987-ZhangY #recursion
A Necessary Condition for a Doubly Recursive Rule to be Equivalent to a Linear Recursive Rule (WZ, CTY), pp. 345–356.
RTARTA-1987-DauchetC #term rewriting
A Gap Between Linear and Non Linear Term-Rewriting Systems (1) (MD, FDC), pp. 95–104.
SIGIRSIGIR-1987-BollmannW #adaptation #information retrieval #modelling
Adaptive Linear Information Retrieval Models (PB, SKMW), pp. 157–163.
TAPSOFTCFLP-1987-GirardL #lazy evaluation #logic
Linear Logic and Lazy Computation (JYG, YL), pp. 52–66.
STOCSTOC-1987-AggarwalGSS #algorithm #diagrams
A Linear Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon (AA, LJG, JBS, PWS), pp. 39–45.
STOCSTOC-1987-Vaidya #algorithm #programming
An Algorithm for Linear Programming which Requires O(((m+n)n^2 + (m+n)^1.5 n)L) Arithmetic Operations (PMV), pp. 29–38.
PODSPODS-1986-Robinson #order #statistics #using
Order Preserving Linear Hashing Using Dynamic Key Statistics (JTR), pp. 91–99.
DACDAC-1986-BhaskerS #algorithm #graph
A linear algorithm to find a rectangular dual of a planar triangulated graph (JB, SS), pp. 108–114.
STOCSTOC-1986-LuekerMR #difference #programming
Linear Programming with Two Variables per Inequality in Poly-Log Time (GSL, NM, VR), pp. 196–205.
STOCSTOC-1986-TarjanW #algorithm
A Linear-Time Algorithm for Triangulating Simple Polygons (RET, CJVW), pp. 380–388.
CADECADE-1986-Kafl #reasoning #verification
Program Verifier “Tatzelwurm”: Reasoning about Systems of Linear Inequalities (TK), pp. 300–305.
PODSPODS-1985-Ellis #concurrent
Concurrency and Linear Hashing (CSE), pp. 1–7.
ICALPICALP-1985-Pnueli #branch #logic #semantics
Linear and Branching Structures in the Semantics and Logics of Reactive Systems (AP), pp. 15–32.
POPLPOPL-1985-LichtensteinP #concurrent #finite #source code #specification
Checking That Finite State Concurrent Programs Satisfy Their Linear Specification (OL, AP), pp. 97–107.
DACDAC-1985-SakataK #comparison
A circuit comparison system for bipolar linear LSI (TS, AK), pp. 429–434.
STOCSTOC-1985-AharoniEL #integer #source code
Dual Integer Linear Programs and the Relationship between their Optima (RA, PE, NL), pp. 476–483.
STOCSTOC-1985-Harel #algorithm #graph #problem
A Linear Time Algorithm for Finding Dominators in Flow Graphs and Related Problems (DH), pp. 185–194.
STOCSTOC-1985-PanR #parallel #performance
Efficient Parallel Solution of Linear Systems (VYP, JHR), pp. 143–152.
ICALPICALP-1984-BlumerBEHM #automaton #online #set #word
Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time (AB, JB, AE, DH, RMM), pp. 109–118.
ICALPICALP-1984-Crochemore #word
Linear Searching for a Square in a Word (MC), p. 137.
ICALPICALP-1984-PaigeT #algorithm #problem
A Linear Time Algorithm to Solve the Single Function Coarsest Partition Problem (RP, RET), pp. 371–379.
STOCSTOC-1984-BlumerBEHM #set
Building a Complete Inverted File for a Set of Text Files in Linear Time (AB, JB, AE, DH, RMM), pp. 349–358.
STOCSTOC-1984-Karmarkar #algorithm #polynomial #programming
A New Polynomial-Time Algorithm for Linear Programming (NK), pp. 302–311.
CADECADE-1984-CavalliC #logic
A Decision Method for Linear Temporal Logic (ARC, LFdC), pp. 113–127.
CADECADE-1984-Simon #algorithm #higher-order
A Linear Time Algorithm for a Subcase of Second Order Instantiation (DS), pp. 209–223.
CADECADE-1984-Ursic #problem
A Linear Characterization of NP-Complete Problems (SU), pp. 80–100.
PODSPODS-1983-OukselS #multi
Storage Mappings for Multidimensional Linear Dynamic Hashing (AMO, PS), pp. 90–105.
ICALPICALP-1983-BakkerBKM #branch #recursion #semantics
Linear Time and Branching Time Semantics for Recursion with Merge (JWdB, JAB, JWK, JJCM), pp. 39–51.
ICALPICALP-1983-MakedonS
Minimizing Width in Linear Layouts (FM, IHS), pp. 478–490.
POPLPOPL-1983-EmersonH #branch
“Sometimes” and “Not Never” Revisited: On Branching Versus Linear Time (EAE, JYH), pp. 127–140.
DACDAC-1983-Kang
Linear ordering and application to placement (SK), pp. 457–464.
STOCSTOC-1983-GabowT #algorithm #set
A Linear-Time Algorithm for a Special Case of Disjoint Set Union (HNG, RET), pp. 246–251.
STOCSTOC-1983-Heide #algorithm #polynomial #problem
A Polynomial Linear Search Algorithm for the N-Dimensional Knapsack Problem (FMadH), pp. 70–79.
STOCSTOC-1983-ReifV #network
A Logarithmic Time Sort for Linear Size Networks (JHR, LGV), pp. 10–16.
VLDBVLDB-1982-Larson
A Single-File Version of Linear Hashing with Partial Expansions (PÅL), pp. 300–309.
ICGTGG-1982-Kaul #graph #parsing
Parsing of graphs in linear time (MK), pp. 206–218.
PLDISCC-1982-Marshall #compilation #graph
The Linear Graph Package, a Compiler Building Environment (HZM), pp. 294–300.
DACDAC-1982-FiducciaM #heuristic #network
A linear-time heuristic for improving network partitions (CMF, RMM), pp. 175–181.
STOCSTOC-1982-SistlaC #complexity #logic
The Complexity of Propositional Linear Temporal Logics (APS, EMC), pp. 159–168.
ICALPICALP-1981-Dershowitz #term rewriting #termination
Termination of Linear Rewriting Systems (ND), pp. 448–458.
ICALPICALP-1981-ItzhaikY #equivalence
A Decision Procedure for the Equivalence of Two DPDAs, One of Which is Linear (YI, AY), pp. 229–237.
POPLPOPL-1981-Rosen #polynomial
Linear Cost is Sometimes Quadratic (BKR), pp. 117–124.
DACDAC-1981-Akers #algorithm #on the #using
On the use of the linear assignment algorithm in module placement (SBA), pp. 137–144.
STOCSTOC-1981-GonnetM #analysis
A Linear Probing Sort and its Analysis (GHG, JIM), pp. 90–95.
VLDBVLDB-1980-Larson
Linear Hashing with Partial Expansions (PÅL), pp. 224–232.
VLDBVLDB-1980-Litwin
Linear Hashing: A New Tool for File and Table Addressing (WL), pp. 212–223.
ICALPICALP-1980-Galil #algorithm #database #dependence #relational
An Almost Linear Time Algorithm for Computing a Dependency Basis in a Relational Data Base (ZG), pp. 246–256.
ICALPICALP-1980-Huynh #complexity #set
The Complexity of Semilinear Sets (TDH), pp. 324–337.
STOCSTOC-1980-KarpT #algorithm #problem
Linear Expected-Time Algorithms for Connectivity Problems (RMK, RET), pp. 368–377.
ICALPICALP-1979-Ury #automaton #composition
Optimal Decomposition of Linear Automata (), pp. 659–667.
POPLPOPL-1979-SavageS #recursion #trade-off
Space-Time Tradeoffs for Linear Recursion (SS, JES), pp. 135–142.
STOCSTOC-1979-GurariI #complexity #equivalence #problem #set #source code
The Complexity of the Equivalence Problem for Counter Machines, Semilinear Sets, and Simple Programs (EMG, OHI), pp. 142–152.
ICALPICALP-1978-Mignotte #effectiveness #recursion #sequence
Some Effective Results About Linear Recursive Sequences (MM), pp. 322–329.
POPLPOPL-1978-CousotH #automation
Automatic Discovery of Linear Restraints Among Variables of a Program (PC, NH), pp. 84–96.
POPLPOPL-1978-Reif #analysis #programming
Symbolic Programming Analysis in Almost Linear Time (JHR), pp. 76–83.
STOCSTOC-1978-BrownT #representation
A Representation for Linear Lists with Movable Fingers (MRB, RET), pp. 19–29.
ICALPICALP-1977-SavitchV #multi #simulation #turing machine
Linear Time Simulation of Multihead Turing Machines with Head-to-Head Jumps (WJS, PMBV), pp. 453–464.
STOCSTOC-1977-GuibasMPR #representation
A New Representation for Linear Lists (LJG, EMM, MFP, JRR), pp. 49–60.
ICALPICALP-1976-Fontet #algorithm #graph #morphism #testing
A Linear Algorithm for Testing Isomorphism of Planar Graphs (MF), pp. 411–424.
STOCSTOC-1976-PatersonW #unification
Linear Unification (MP, MNW), pp. 181–186.
POPLPOPL-1975-GrahamW #algorithm #analysis #performance
A Fast and Usually Linear Algorithm for Global Flow Analysis (SLG, MNW), pp. 22–34.
STOCSTOC-1975-BoothL #algorithm #graph
Linear Algorithms to Recognize Interval Graphs and Test for the Consecutive Ones Property (KSB, GSL), pp. 255–265.
STOCSTOC-1975-HyafilK #complexity #evaluation #parallel
The Complexity of Parallel Evaluation of Linear Recurrence (LH, HTK), pp. 12–22.
STOCSTOC-1974-BookNP #bound #context-free grammar #multi
Intersections of Linear Context-Free Languages and Reversal-Bounded Multipushdown Machines (RVB, MN, MP), pp. 290–296.
STOCSTOC-1974-HopcroftW #algorithm #graph #morphism
Linear Time Algorithm for Isomorphism of Planar Graphs (JEH, JKW), pp. 172–184.
ICALPICALP-1972-Kalman #commutative
Realization Theory of Linear Systems over a Commutative Ring (REK), pp. 61–65.
ICALPICALP-1972-PazR #approximate #automaton #problem
Linear Automata — Approximation Problem (AP, MR), pp. 99–102.
DACDAC-1972-SchulerU #clustering
Clustering and linear placement (DMS, EGU), pp. 50–56.
STOCSTOC-1972-BlumFPRT #bound
Linear Time Bounds for Median Computations (MB, RWF, VRP, RLR, RET), pp. 119–124.
STOCSTOC-1971-Meyers #representation
Linear Representation of Tree Structure: A Mathematical Theory of Parenthesis-Free Notations (WJM), pp. 50–62.

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.