BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
languag (164)
express (136)
use (53)
model (47)
tree (44)

Stem regular$ (all stems)

718 papers:

DACDAC-2015-WangLYSOC #grid #novel #power management #reduction
Novel power grid reduction method based on L1 regularization (YW, ML, XY, ZS, MO, CC), p. 6.
DACDAC-2015-XuYGHP #named #self
PARR: pin access planning and regular routing for self-aligned double patterning (XX, BY, JRG, CLH, DZP), p. 6.
ICPCICPC-2015-JbaraF #empirical #eye tracking #how #using
How programmers read regular code: a controlled experiment using eye tracking (AJ, DGF), pp. 244–254.
CIAACIAA-J-2013-JirasekJ15 #bound #on the #regular expression
On the boundary of regular languages (JJ, GJ), pp. 42–57.
CIAACIAA-2015-BerglundM #on the #parsing #regular expression #semantics
On the Semantics of Regular Expression Parsing in the Wild (MB, BvdM), pp. 292–304.
CIAACIAA-2015-BorsottiBCM #ambiguity #automaton #parsing #regular expression
From Ambiguous Regular Expressions to Deterministic Parsing Automata (AB, LB, SCR, AM), pp. 35–48.
CIAACIAA-2015-BorsottiBCM15a #ambiguity #named #parsing #regular expression
BSP: A Parsing Tool for Ambiguous Regular Expressions (AB, LB, SCR, AM), pp. 313–316.
CIAACIAA-2015-Hulden #automaton #finite #regular expression
From Two-Way to One-Way Finite Automata — Three Regular Expression-Based Methods (MH), pp. 176–187.
CIAACIAA-2015-Madejski #linear #permutation #problem
The Membership Problem for Linear and Regular Permutation Languages (GM), pp. 211–223.
CIAACIAA-2015-Watson #automaton #finite #hardware #implementation #regular expression
Hardware Implementations of Finite Automata and Regular Expressions — Extended Abstract (BWW), pp. 13–17.
ICALPICALP-v2-2015-SwernofskyW #complexity #on the
On the Complexity of Intersecting Regular, Context-Free, and Tree Languages (JS, MW), pp. 414–426.
LATALATA-2015-AllenderM #complexity
Complexity of Regular Functions (EA, IM), pp. 449–460.
LATALATA-2015-SulzmannT
Derivatives for Regular Shuffle Expressions (MS, PT), pp. 275–286.
LATALATA-2015-ThiemannS #automaton #regular expression
From ω-Regular Expressions to Büchi Automata via Partial Derivatives (PT, MS), pp. 287–298.
CHICHI-2015-ZgraggenDFD #query #regular expression #sequence #visual notation
(s|qu)eries: Visual Regular Expressions for Querying and Exploring Event Sequences (EZ, SMD, DF, RD), pp. 2683–2692.
HCIHCI-DE-2015-GrobelnyM #algorithm #analysis #comparative #design #grid #visual notation
Comparative Analysis of Regular Grid Based Algorithms in the Design of Graphical Control Panels (JG, RM), pp. 332–339.
HCIHCI-DE-2015-WatabeM #regular expression #user interface #visual notation
Graphical User Interface for Search of Mathematical Expressions with Regular Expressions (TW, YM), pp. 438–447.
ICMLICML-2015-FrostigGKS #algorithm #approximate #empirical #named #performance #probability
Un-regularizing: approximate proximal point and faster stochastic algorithms for empirical risk minimization (RF, RG, SK, AS), pp. 2540–2548.
ICMLICML-2015-LibbrechtHBN #graph
Entropic Graph-based Posterior Regularization (ML, MMH, JAB, WSN), pp. 1992–2001.
ICMLICML-2015-Yang0JZ15a #random #reduction
Theory of Dual-sparse Regularized Randomized Reduction (TY, LZ, RJ, SZ), pp. 305–314.
ICMLICML-2015-ZhangL #coordination #empirical #probability
Stochastic Primal-Dual Coordinate Method for Regularized Empirical Risk Minimization (YZ, XL), pp. 353–361.
ICMLICML-2015-ZhaoZ #optimisation #probability
Stochastic Optimization with Importance Sampling for Regularized Loss Minimization (PZ, TZ), pp. 1–9.
ICMLICML-2015-ZhouZ #problem
Safe Subspace Screening for Nuclear Norm Regularized Least Squares Problems (QZ, QZ), pp. 1103–1112.
ICMLICML-2015-ZhouZS #analysis #bound #convergence #fault #first-order
ℓ₁,p-Norm Regularization: Error Bounds and Convergence Rate Analysis of First-Order Methods (ZZ, QZ, AMCS), pp. 1501–1510.
KDDKDD-2015-WangYLXXCR #predict #using
Regularity and Conformity: Location Prediction Using Heterogeneous Mobility Data (YW, NJY, DL, LX, XX, EC, YR), pp. 1275–1284.
RecSysRecSys-2015-LiWTM #community #predict #rating #recommendation #social
Overlapping Community Regularization for Rating Prediction in Social Recommender Systems (HL, DW, WT, NM), pp. 27–34.
SIGIRSIGIR-2015-YaoSQWSH #recommendation #social #using
Context-aware Point-of-Interest Recommendation Using Tensor Factorization with Social Regularization (LY, QZS, YQ, XW, AS, QH), pp. 1007–1010.
POPLPOPL-2015-AlurDR #declarative #named #string
DReX: A Declarative Language for Efficiently Evaluating Regular String Transformations (RA, LD, MR), pp. 125–137.
SACSAC-2015-ChaudhuriMG #network #predict #using
QoS prediction for network data traffic using hierarchical modified regularized least squares rough support vector regression (AC, SM, SKG), pp. 659–661.
ICSEICSE-v1-2015-ZhangCWD0 #execution #symbolic computation
Regular Property Guided Dynamic Symbolic Execution (YZ, ZC, JW, WD, ZL), pp. 643–653.
PPoPPPPoPP-2015-RavishankarDEPRRS #code generation #distributed #memory management
Distributed memory code generation for mixed Irregular/Regular computations (MR, RD, VE, LNP, JR, AR, PS), pp. 65–75.
CADECADE-2015-Libal #higher-order #unification
Regular Patterns in Second-Order Unification (TL), pp. 557–571.
CAVCAV-2015-ZhengGSTDZ #constraints #effectiveness #equation #regular expression #string
Effective Search-Space Pruning for Solvers of String Equations, Regular Expressions and Length Constraints (YZ, VG, SS, OT, JD, XZ), pp. 235–254.
CSLCSL-2015-DuparcFH #ambiguity #on the
On Unambiguous Regular Tree Languages of Index (0, 2) (JD, KF, SH), pp. 534–548.
LICSLICS-2015-EndrullisGH #encoding
Regularity Preserving but Not Reflecting Encodings (JE, CG, DH), pp. 535–546.
LICSLICS-2015-Place #quantifier #regular expression
Separating Regular Languages with Two Quantifiers Alternations (TP), pp. 202–213.
FoSSaCSFoSSaCS-2014-AvniKT #game studies
Network-Formation Games with Regular Objectives (GA, OK, TT), pp. 119–133.
TACASTACAS-2014-MalerM #learning #regular expression #scalability
Learning Regular Languages over Large Alphabets (OM, IEM), pp. 485–499.
ICPCICPC-2014-JbaraF #comprehension #on the
On the effect of code regularity on comprehension (AJ, DGF), pp. 189–200.
STOCSTOC-2014-DingSS #random #satisfiability
Satisfiability threshold for random regular NAE-SAT (JD, AS, NS), pp. 814–822.
STOCSTOC-2014-KayalSS #bound
A super-polynomial lower bound for regular arithmetic formulas (NK, CS, RS), pp. 146–153.
FLOPSFLOPS-2014-SulzmannL #parsing #regular expression
POSIX Regular Expression Parsing with Derivatives (MS, KZML), pp. 203–220.
DLTDLT-J-2013-TanV14 #graph #query #regular expression
Regular Expressions for Querying Data graphs (TT, DV), pp. 971–986.
AFLAFL-2014-BerglundDM #backtracking #behaviour #regular expression
Analyzing Catastrophic Backtracking Behavior in Practical Regular Expression Matching (MB, FD, BvdM), pp. 109–123.
AFLAFL-2014-GruberH #automaton #complexity #finite #regular expression #summary
From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity (HG, MH), pp. 25–48.
AFLAFL-2014-Valdats #complexity #regular expression
Boolean Circuit Complexity of Regular Languages (MV), pp. 342–354.
CIAACIAA-2014-CevorovaJK #on the #regular expression
On the Square of Regular Languages (KC, GJ, IK), pp. 136–147.
CIAACIAA-2014-JiraskovaPS
Kleene Closure on Regular and Prefix-Free Languages (GJ, MP, JS), pp. 226–237.
CIAACIAA-2014-Maletti #bottom-up #multi #power of #transducer
The Power of Regularity-Preserving Multi Bottom-up Tree Transducers (AM), pp. 278–289.
DLTDLT-2014-Schmid #regular expression
Characterising REGEX Languages by Regular Languages Equipped with Factor-Referencing (MLS), pp. 142–153.
ICALPICALP-v1-2014-FialaKKN #algorithm #aspect-oriented #graph
Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs (JF, PK, JK, RN), pp. 489–501.
ICALPICALP-v2-2014-Chaturvedi #towards
Toward a Structure Theory of Regular Infinitary Trace Languages (NC), pp. 134–145.
LATALATA-2014-KoHS #top-down
Top-Down Tree Edit-Distance of Regular Tree Languages (SKK, YSH, KS), pp. 466–477.
LATALATA-2014-Weidner #probability #regular expression
Probabilistic ω-Regular Expressions (TW), pp. 588–600.
VISSOFTVISSOFT-2014-ToprakWS #assembly #control flow #lightweight #regular expression #visualisation
Lightweight Structured Visualization of Assembler Control Flow Based on Regular Expressions (ST, AW, SS), pp. 97–106.
CIKMCIKM-2014-YaoTYXZSL #collaboration
Dual-Regularized One-Class Collaborative Filtering (YY, HT, GY, FX, XZ, BKS, JL), pp. 759–768.
ICMLICML-c1-2014-Shalev-Shwartz0 #coordination #probability
Accelerated Proximal Stochastic Dual Coordinate Ascent for Regularized Loss Minimization (SSS, TZ), pp. 64–72.
ICMLICML-c1-2014-YogatamaS #multi #word
Making the Most of Bag of Words: Sentence Regularization with Alternating Direction Method of Multipliers (DY, NAS), pp. 656–664.
ICMLICML-c2-2014-BachmanFP #approximate
Sample-based approximate regularization (PB, AMF, DP), pp. 1926–1934.
ICMLICML-c2-2014-HonorioJ #consistency #framework
A Unified Framework for Consistency of Regularized Loss Minimizers (JH, TSJ), pp. 136–144.
ICMLICML-c2-2014-LiZ #higher-order #learning #problem
High Order Regularization for Semi-Supervised Learning of Structured Output Problems (YL, RSZ), pp. 1368–1376.
ICMLICML-c2-2014-MannMM
Time-Regularized Interrupting Options (TRIO) (TAM, DJM, SM), pp. 1350–1358.
ICMLICML-c2-2014-McGibbonRSKP #comprehension #markov #modelling
Understanding Protein Dynamics with L1-Regularized Reversible Hidden Markov Models (RM, BR, MS, GK, VSP), pp. 1197–1205.
ICMLICML-c2-2014-QuattoniBCG #sequence
Spectral Regularization for Max-Margin Sequence Tagging (AQ, BB, XC, AG), pp. 1710–1718.
ICMLICML-c2-2014-TaylorGP #analysis #approximate #linear #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-TorkamaniL #on the #robust
On Robustness and Regularization of Structural Support Vector Machines (MT, DL), pp. 577–585.
ICPRICPR-2014-BorgiLEA14a #multi #recognition #using
Sparse Multi-regularized Shearlet-Network Using Convex Relaxation for Face Recognition (MAB, DL, ME, CBA), pp. 4636–4641.
ICPRICPR-2014-DuanHZCZ #image #segmentation #using
A Two-Stage Image Segmentation Method Using Euler’s Elastica Regularized Mumford-Shah Model (YD, WH, JZ, HC, TZ), pp. 118–123.
ICPRICPR-2014-GienTCL #fuzzy #learning #multi #predict
Dual Fuzzy Hypergraph Regularized Multi-label Learning for Protein Subcellular Location Prediction (JG, YYT, CLPC, YL), pp. 512–516.
ICPRICPR-2014-HaoXPSK #automation #semantics #topic #using
Automated Chinese Essay Scoring from Topic Perspective Using Regularized Latent Semantic Indexing (SH, YX, HP, KS, DK), pp. 3092–3097.
ICPRICPR-2014-LiRPV #modelling #topic #using
Regularizing Topic Discovery in EMRs with Side Information by Using Hierarchical Bayesian Models (CL, SR, DQP, SV), pp. 1307–1312.
ICPRICPR-2014-LiuL0L #classification #image #learning
Regularized Hierarchical Feature Learning with Non-negative Sparsity and Selectivity for Image Classification (BL, JL, XB, HL), pp. 4293–4298.
ICPRICPR-2014-LuoYQY
Nuclear Norm Regularized Sparse Coding (LL, JY, JQ, JY), pp. 1834–1839.
ICPRICPR-2014-Nilsson #polynomial #using
Elastic Net Regularized Logistic Regression Using Cubic Majorization (MN), pp. 3446–3451.
ICPRICPR-2014-OlssonUE #refinement
Local Refinement for Stereo Regularization (CO, JU, APE), pp. 4056–4061.
ICPRICPR-2014-RenL14a #identification #matrix
Person Re-identification Based on Relaxed Nonnegative Matrix Factorization with Regularizations (WR, GL), pp. 4654–4659.
ICPRICPR-2014-SunTL #online #using
Sparse Online Co-regularization Using Conjugate Functions (BS, MT, GL), pp. 3666–3671.
ICPRICPR-2014-WenLWCW #classification #feature model #robust
Optimal Feature Selection for Robust Classification via l2, 1-Norms Regularization (JW, ZL, WKW, JC, MW), pp. 517–521.
ICPRICPR-2014-WuS #learning #multi #recognition
Regularized Multi-view Multi-metric Learning for Action Recognition (XW, SKS), pp. 471–476.
KDDKDD-2014-QianHJPZ #approach #distance #learning #metric #using
Distance metric learning using dropout: a structured regularization approach (QQ, JH, RJ, JP, SZ), pp. 323–332.
KDDKDD-2014-XieGFTY
Class-distribution regularized consensus maximization for alleviating overfitting in model combination (SX, JG, WF, DST, PSY), pp. 303–312.
KRKR-2014-BienvenuCOS #logic #query
Nested Regular Path Queries in Description Logics (MB, DC, MO, MS).
SACSAC-2014-PinisettyFJM #runtime
Runtime enforcement of regular timed properties (SP, YF, TJ, HM), pp. 1279–1286.
CCCC-2014-SulzmannS #flexibility #ml #performance #regular expression
A Flexible and Efficient ML Lexer Tool Based on Extended Regular Expression Submatching (MS, PvS), pp. 174–191.
CAVCAV-2014-LiangRTBD #formal method #regular expression #string
A DPLL(T) Theory Solver for a Theory of Strings and Regular Expressions (TL, AR, CT, CB, MD), pp. 646–662.
LICSLICS-CSL-2014-AlurFR #combinator #string
Regular combinators for string transformations (RA, AF, MR), p. 10.
LICSLICS-CSL-2014-BrenguierRS #complexity #game studies
The complexity of admissibility in ω-regular games (RB, JFR, MS), p. 10.
LICSLICS-CSL-2014-PlaceZ #first-order #logic #regular expression
Separating regular languages with first-order logic (TP, MZ), p. 10.
LICSLICS-CSL-2014-TsukadaO #composition #game studies #higher-order #model checking
Compositional higher-order model checking via ω-regular games over Böhm trees (TT, CHLO), p. 10.
VMCAIVMCAI-2014-Chatterjee0FR #game studies
Doomsday Equilibria for Omega-Regular Games (KC, LD, EF, JFR), pp. 78–97.
DATEDATE-2013-GaillardonABMSLM
Vertically-stacked double-gate nanowire FETs with controllable polarity: from devices to regular ASICs (PEG, LGA, SB, MDM, DS, YL, GDM), pp. 625–630.
ICDARICDAR-2013-KessentiniCP #detection #documentation #regular expression #word
Word Spotting and Regular Expression Detection in Handwritten Documents (YK, CC, TP), pp. 516–520.
PODSPODS-2013-BaganBG #graph #query
A trichotomy for regular simple path queries on graphs (GB, AB, BG), pp. 261–272.
SIGMODSIGMOD-2013-YangWQWL #string #using
Improving regular-expression matching on strings using negative factors (XY, BW, TQ, YW, CL), pp. 361–372.
CSEETCSEET-2013-JezekMP #automation #evaluation #experience #question
Automated evaluation of regular lab assignments: A bittersweet experience? (PJ, MM, TP), pp. 249–258.
FoSSaCSFoSSaCS-2013-CzerwinskiDLM #regular expression
Deciding Definability by Deterministic Regular Expressions (WC, CD, KL, WM), pp. 289–304.
TACASTACAS-2013-GangeNSSS #bound #constraints #model checking #regular expression
Unbounded Model-Checking with Interpolation for Regular Language Constraints (GG, JAN, PJS, HS, PS), pp. 277–291.
STOCSTOC-2013-BeckI
Strong ETH holds for regular resolution (CB, RI), pp. 487–494.
CIAACIAA-J-2012-Brzozowski13 #regular expression
In Search of Most Complex Regular Languages (JAB), pp. 691–708.
CIAACIAA-J-2012-Crespi-ReghizziP13 #strict #testing
Strict Local Testability with Consensus Equals Regularity, and Other Properties (SCR, PSP), pp. 747–764.
DLTDLT-J-2012-BrzozowskiT13 #complexity #regular expression
Complexity of atoms of Regular Languages (JAB, HT), pp. 1009–1028.
DLTDLT-J-2012-HanKS13 #context-free grammar #regular expression
The Edit-Distance between a Regular Language and a Context-Free Language (YSH, SKK, KS), pp. 1067–1082.
CIAACIAA-2013-BelliB #testing #using
Using Regular Grammars for Event-Based Testing (FB, MB), pp. 48–59.
CIAACIAA-2013-DreyfusHK #analysis #approximate #reachability
Enhancing Approximations for Regular Reachability Analysis (AD, PCH, OK), pp. 331–339.
CIAACIAA-2013-GrathwohlHNR #parsing #regular expression
Two-Pass Greedy Regular Expression Parsing (NBBG, FH, LN, UTR), pp. 60–71.
CIAACIAA-2013-JirasekJ #bound #on the #regular expression
On the Boundary of Regular Languages (JJ, GJ), pp. 208–219.
DLTDLT-2013-BerglundBDMW #regular expression
Cuts in Regular Expressions (MB, HB, FD, BvdM, BW), pp. 70–81.
DLTDLT-2013-LibkinTV #database #graph #query #regular expression #word
Regular Expressions with Binding over Data Words for Querying Graph Databases (LL, TT, DV), pp. 325–337.
DLTDLT-2013-Pin #regular expression
An Explicit Formula for the Intersection of Two Polynomials of Regular Languages (JÉP), pp. 31–45.
ICALPICALP-v2-2013-AlurR #problem
Decision Problems for Additive Regular Functions (RA, MR), pp. 37–48.
ICALPICALP-v2-2013-CzerwinskiMM #performance #regular expression #sequence
Efficient Separability of Regular Languages by Subsequences and Suffixes (WC, WM, TM), pp. 150–161.
ICALPICALP-v2-2013-DemriDS #complexity #on the #verification
On the Complexity of Verifying Regular Properties on Flat Counter Systems, (SD, AKD, AS), pp. 162–173.
ICALPICALP-v2-2013-EtessamiSY #context-free grammar #probability #regular expression
Stochastic Context-Free Grammars, Regular Languages, and Newton’s Method (KE, AS, MY), pp. 199–211.
ICALPICALP-v2-2013-Fu #similarity
Checking Equality and Regularity for Normed BPA with Silent Moves (YF), pp. 238–249.
LATALATA-2013-ChamparnaudDJM #regular expression
Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions (JMC, JPD, HJ, LM), pp. 202–213.
LATALATA-2013-HaberHMMR #performance #regular expression
Efficient Submatch Extraction for Practical Regular Expressions (SH, WH, PKM, MM, PR), pp. 323–334.
LATALATA-2013-LaugerotteSZ #automaton
From Regular Tree Expression to Position Tree Automaton (ÉL, NOS, DZ), pp. 395–406.
LATALATA-2013-MontanariS #logic #regular expression
Interval Logics and ωB-Regular Languages (AM, PS), pp. 431–443.
LATALATA-2013-SelivanovK #algebra
Boolean Algebras of Regular ω-Languages (VLS, AK), pp. 504–515.
LATALATA-2013-SippuS #multi #online
Online Matching of Multiple Regular Patterns with Gaps and Character Classes (SS, ESS), pp. 523–534.
ICFPICFP-2013-TraytelN #regular expression #word
Verified decision procedures for MSO on words based on derivatives of regular expressions (DT, TN), pp. 3–12.
CHICHI-2013-QuZ
Regularly visited patches in human mobility (YQ, JZ), pp. 395–398.
ICMLICML-c2-2013-GongZLHY #algorithm #optimisation #problem
A General Iterative Shrinkage and Thresholding Algorithm for Non-convex Regularized Optimization Problems (PG, CZ, ZL, JH, JY), pp. 37–45.
ICMLICML-c2-2013-MinhBM #framework #learning #multi
A unifying framework for vector-valued manifold regularization and multi-view learning (HQM, LB, VM), pp. 100–108.
ICMLICML-c3-2013-BryanM #interactive #performance
An Efficient Posterior Regularized Latent Variable Model for Interactive Sound Source Separation (NJB, GJM), pp. 208–216.
ICMLICML-c3-2013-NiuJDHS #approach #learning #novel
Squared-loss Mutual Information Regularization: A Novel Information-theoretic Approach to Semi-supervised Learning (GN, WJ, BD, HH, MS), pp. 10–18.
ICMLICML-c3-2013-WanZZLF #network #using
Regularization of Neural Networks using DropConnect (LW, MDZ, SZ, YL, RF), pp. 1058–1066.
ICMLICML-c3-2013-ZweigW #learning
Hierarchical Regularization Cascade for Joint Learning (AZ, DW), pp. 37–45.
KDDKDD-2013-ChengZGWSW #clustering #flexibility #graph #multi #robust
Flexible and robust co-regularized multi-domain graph clustering (WC, XZ, ZG, YW, PFS, WW), pp. 320–328.
KDDKDD-2013-GopalY #classification #dependence #recursion #scalability #visual notation
Recursive regularization for large-scale classification with hierarchical and graphical dependencies (SG, YY), pp. 257–265.
KDDKDD-2013-YangWFZWY #algorithm #multi #performance #problem
An efficient ADMM algorithm for multidimensional anisotropic total variation regularization problems (SY, JW, WF, XZ, PW, JY), pp. 641–649.
SEKESEKE-2013-ShamsHK #estimation #network #using
Software Effort Estimation using Regularized Radial Basis Function Neural Networks (KMS, HSH, AK), pp. 473–478.
PPDPPPDP-2013-MontenegroPS #analysis #functional #regular expression #using
Shape analysis in a functional language by using regular languages (MM, RP, CS), pp. 251–262.
SACSAC-PL-J-2012-Ancona13 #prolog #recursion
Regular corecursion in Prolog (DA), pp. 142–162.
SACSAC-2013-BlondelSU #classification #constraints #learning #using
Learning non-linear classifiers with a sparsity constraint using L1 regularization (MB, KS, KU), pp. 167–169.
SACSAC-2013-HorieS #difference
Extracting differences between regular tree grammars (KH, NS), pp. 859–864.
ASPLOSASPLOS-2013-ParkBCLN #harmful #manycore #memory management
Regularities considered harmful: forcing randomness to memory accesses to reduce row buffer conflicts for multi-core, multi-bank systems (HP, SB, JC, DL, SHN), pp. 181–192.
PPoPPPPoPP-2013-YuB #automaton #performance #regular expression
Exploring different automata representations for efficient regular expression matching on GPUs (XY, MB), pp. 287–288.
CSLCSL-2013-ChatterjeeCT #decidability #markov #process #what
What is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives (KC, MC, MT), pp. 165–180.
LICSLICS-2013-AlurDDRY #automaton
Regular Functions and Cost Register Automata (RA, LD, JVD, MR, YY), pp. 13–22.
LICSLICS-2013-ChaudhuriSV #analysis
Regular Real Analysis (SC, SS, MYV), pp. 509–518.
DACDAC-2012-PurandareAH #correctness #proving #regular expression
Proving correctness of regular expression accelerators (MP, KA, CH), pp. 350–355.
DATEDATE-2012-PonsMP #layout #metric
Fixed origin corner square inspection layout regularity metric (MP, MNM, CP), pp. 1397–1402.
PODSPODS-2012-GrozMS #linear #regular expression
Deterministic regular expressions in linear time (BG, SM, SS), pp. 49–60.
PODSPODS-2012-Mahoney #approximate #data analysis #scalability
Approximate computation and implicit regularization for very large-scale data analysis (MWM), pp. 143–154.
FASEFASE-2012-ErwigG #regular expression
Explanations for Regular Expressions (ME, RG), pp. 394–408.
FoSSaCSFoSSaCS-2012-KurzST #on the #regular expression
On Nominal Regular Languages with Binders (AK, TS, ET), pp. 255–269.
DLTDLT-J-2011-ChaturvediOT12 #game studies #infinity
Languages versus ω-Languages in Regular Infinite Games (NC, JO, WT), pp. 985–1000.
CIAACIAA-2012-Brzozowski #regular expression
In Search of Most Complex Regular Languages (JAB), pp. 5–24.
CIAACIAA-2012-Ceccherini-SilbersteinCFS #automaton
Cellular Automata on Regular Rooted Trees (TCS, MC, FF, ZS), pp. 101–112.
CIAACIAA-2012-Crespi-ReghizziP #strict #testing
Strict Local Testability with Consensus Equals Regularity (SCR, PSP), pp. 113–124.
CIAACIAA-2012-JahnKL
Regular Ideal Languages and Their Boolean Combinations (FJ, MK, AL), pp. 205–216.
CIAACIAA-2012-LiuSGF #automaton #named #regular expression
SDFA: Series DFA for Memory-Efficient Regular Expression Matching (TL, YS, LG, BF), pp. 337–344.
DLTDLT-2012-BealCDJL #decidability #geometry #regular expression
Decidability of Geometricity of Regular Languages (MPB, JMC, JPD, HJ, SL), pp. 62–72.
DLTDLT-2012-BrzozowskiT #regular expression
Quotient Complexities of Atoms of Regular Languages (JAB, HT), pp. 50–61.
DLTDLT-2012-ChenL #regular expression
Checking Determinism of Regular Expressions with Counting (HC, PL), pp. 332–343.
DLTDLT-2012-HanKS #context-free grammar #regular expression
Computing the Edit-Distance between a Regular Language and a Context-Free Language (YSH, SKK, KS), pp. 85–96.
DLTDLT-2012-ReidenbachS #pattern matching
Regular and Context-Free Pattern Languages over Small Alphabets (DR, MLS), pp. 130–141.
ICALPICALP-v2-2012-BojanczykP #infinity #regular expression #set
Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets (MB, TP), pp. 104–115.
ICALPICALP-v2-2012-DiekertKRW #regular expression
Regular Languages Are Church-Rosser Congruential (VD, MK, KR, TW), pp. 177–188.
LATALATA-2012-ChamparnaudJM #approximate #regular expression
Approximate Regular Expressions and Their Derivatives (JMC, HJ, LM), pp. 179–191.
LATALATA-2012-DubeLT #regular expression
Conservative Groupoids Recognize Only Regular Languages (DD, ML, PT), pp. 216–227.
LATALATA-2012-Hovland #constraints #problem #regular expression
The Membership Problem for Regular Expressions with Unordered Concatenation and Numerical Constraints (DH), pp. 313–324.
GT-VMTGT-VMT-2012-JalaliRG #incremental #pattern matching #regular expression
Incremental Pattern Matching for Regular Expressions (AJ, AR, AHG).
CHICHI-2012-KinHDA #gesture #multi #named #regular expression
Proton: multitouch gestures as regular expressions (KK, BH, TD, MA), pp. 2885–2894.
CIKMCIKM-2012-ZhangLZW #recommendation
Relation regularized subspace recommending for related scientific articles (QZ, JL, ZZ, LW), pp. 2503–2506.
ECIRECIR-2012-WuF
Relation Based Term Weighting Regularization (HW, HF), pp. 109–120.
ICMLICML-2012-AvronKKS #performance #probability
Efficient and Practical Stochastic Subgradient Descent for Nuclear Norm Regularization (HA, SK, SPK, VS), p. 46.
ICMLICML-2012-CrammerC #adaptation #metric #similarity
Adaptive Regularization for Similarity Measures (KC, GC), p. 27.
ICMLICML-2012-GuoX #classification #learning #multi
Cross Language Text Classification via Subspace Co-regularized Multi-view Learning (YG, MX), p. 120.
ICMLICML-2012-MairalY #analysis #complexity
Complexity Analysis of the Lasso Regularization Path (JM, BY), p. 238.
ICMLICML-2012-McDowellA #classification #hybrid
Semi-Supervised Collective Classification via Hybrid Label Regularization (LM, DWA), p. 162.
ICMLICML-2012-NeufeldYZKS #reduction
Regularizers versus Losses for Nonlinear Dimensionality Reduction: A Factored View with New Convex Relaxations (JN, YY, XZ, RK, DS), p. 191.
ICMLICML-2012-NiuDYS #learning #metric
Information-theoretic Semi-supervised Metric Learning via Entropy Regularization (GN, BD, MY, MS), p. 136.
ICMLICML-2012-PrasseSLS #email #identification #learning #regular expression
Learning to Identify Regular Expressions that Describe Email Campaigns (PP, CS, NL, TS), p. 146.
ICMLICML-2012-ScherrerHTH #algorithm #coordination #problem #scalability
Scaling Up Coordinate Descent Algorithms for Large ℓ1 Regularization Problems (CS, MH, AT, DH), p. 50.
ICMLICML-2012-XiaoZ #problem
A Proximal-Gradient Homotopy Method for the L1-Regularized Least-Squares Problem (LX, TZ), p. 160.
ICPRICPR-2012-BrownLG #linear #recognition
Locality-Regularized Linear Regression for face recognition (DB, HL, YG), pp. 1586–1589.
ICPRICPR-2012-DeyG #behaviour #consistency #topic #twitter
Discovering regular and consistent behavioral patterns in topical tweeting (LD, BG), pp. 3464–3467.
ICPRICPR-2012-DuanHC #approach #image #segmentation
Shape prior regularized continuous max-flow approach to image segmentation (YD, WH, HC), pp. 2516–2519.
ICPRICPR-2012-GuiST #analysis #estimation #parametricity
Regularization parameter estimation for spectral regression discriminant analysis based on perturbation theory (JG, ZS, TT), pp. 401–404.
ICPRICPR-2012-PanLS #kernel #learning
Learning kernels from labels with ideal regularization (BP, JHL, LS), pp. 505–508.
ICPRICPR-2012-RaketN #algorithm
A splitting algorithm for directional regularization and sparsification (LLR, MN), pp. 3094–3098.
ICPRICPR-2012-WangAG #adaptation #feature model #graph #matrix
Adaptive graph regularized Nonnegative Matrix Factorization via feature selection (JW, IA, XG), pp. 963–966.
ICPRICPR-2012-WangST #feature model #linear #programming #recognition #robust
Robust regularized feature selection for iris recognition via linear programming (LW, ZS, TT), pp. 3358–3361.
ICPRICPR-2012-ZarrouatiAR #robust
Robust depth regularization explicitly constrained by camera motion (NZ, EA, PR), pp. 3606–3609.
SIGIRSIGIR-2012-FangHC #graph
Confidence-aware graph regularization with heterogeneous pairwise features (YF, BJPH, KCCC), pp. 951–960.
PPDPPPDP-2012-SulzmannL #regular expression #using
Regular expression sub-matching using partial derivatives (MS, KZML), pp. 79–90.
SACSAC-2012-Ancona #prolog #recursion
Regular corecursion in Prolog (DA), pp. 1897–1902.
SACSAC-2012-ShahidPO #bound
Minimum bounding boxes for regular cross-polytopes (SS, SP, CBO), pp. 879–884.
SACSAC-2012-TangJ #analysis #precise
Exploiting regularity of user-defined types to improve precision of program analyses (XT, JJ), pp. 1743–1750.
PPoPPPPoPP-2012-ZuYXWTPD #automaton #implementation #memory management #nondeterminism #performance #regular expression
GPU-based NFA implementation for memory efficient high speed regular expression matching (YZ, MY, ZX, LW, XT, KP, QD), pp. 129–140.
IJCARIJCAR-2012-FosterS #algebra #analysis #automation
Automated Analysis of Regular Algebra (SF, GS), pp. 271–285.
LICSLICS-2012-AlurFT #infinity #string
Regular Transformations of Infinite Strings (RA, EF, AT), pp. 65–74.
ICSTSAT-2012-BonetB #learning
An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning (MLB, SRB), pp. 44–57.
SMTSMT-2012-BjornerGMV #regular expression #sequence
SMT-LIB Sequences and Regular Expressions (NB, VG, RM, MV), pp. 77–87.
DACDAC-2011-NandakumarM #3d #layout
Layout effects in fine grain 3D integrated regular microprocessor blocks (VSN, MMS), pp. 639–644.
DACDAC-2011-RyzhenkoB #geometry #layout #physics #synthesis
Physical synthesis onto a layout fabric with regular diffusion and polysilicon geometries (NR, SB), pp. 83–88.
FoSSaCSFoSSaCS-2011-CaucalH #term rewriting #word
Regularity and Context-Freeness over Word Rewriting Systems (DC, DTH), pp. 214–228.
WCREWCRE-2011-KellensRNSJ #evolution #quantifier #reasoning #source code #using
Reasoning over the Evolution of Source Code Using Quantified Regular Path Expressions (AK, CDR, CN, RS, VJ), pp. 389–393.
DLTDLT-J-2009-Fazekas11 #regular expression
Powers of Regular Languages (SZF), pp. 323–330.
CIAACIAA-J-2010-DiekertK11 #regular expression
It is NL-Complete to Decide Whether a Hairpin Completion of Regular Languages is Regular (VD, SK), pp. 1813–1828.
CIAACIAA-J-2010-DrosteM11 #automaton #monad #regular expression
Weighted Automata and Regular Expressions over Valuation Monoids (MD, IM), pp. 1829–1844.
DLTDLT-J-2010-HolzerK11 #complexity
The Complexity of Regular(-like) Expressions (MH, MK), pp. 1533–1548.
DLTDLT-J-2010-JiraskovaM11 #complexity #regular expression
Complexity in Union-Free Regular Languages (GJ, TM), pp. 1639–1653.
AFLAFL-2011-BrzozowskiJLS #complexity #regular expression
Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Languages (JAB, GJ, BL, JS), pp. 123–137.
DLTDLT-2011-BattaglinoFFR #encoding #regular expression
Encoding Centered Polyominoes by Means of a Regular Language (DB, JMF, AF, SR), pp. 464–465.
DLTDLT-2011-BonizzoniJ #constant
Regular Splicing Languages Must Have a Constant (PB, NJ), pp. 82–92.
DLTDLT-2011-ChaturvediOT #game studies #infinity
Languages vs. ω-Languages in Regular Infinite Games (NC, JO, WT), pp. 180–191.
DLTDLT-2011-HundeshagenO #automaton #regular expression
Characterizing the Regular Languages by Nonforgetting Restarting Automata (NH, FO), pp. 288–299.
DLTDLT-2011-SelivanovK #algebra #regular expression
Boolean Algebras of Regular Languages (VLS, AK), pp. 386–396.
DLTDLT-2011-Wilke #functional #regular expression
A Functional Program for Regular Expressions Matching — Abstract of Invited Talk (TW), pp. 44–45.
ICALPICALP-v1-2011-GoldbergJ #algorithm #polynomial
A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid (LAG, MJ), pp. 521–532.
ICALPICALP-v2-2011-CartonCP #linear #order #regular expression #word
Regular Languages of Words over Countable Linear Orderings (OC, TC, GP), pp. 125–136.
ICALPICALP-v2-2011-LohreyM #morphism #word
Isomorphism of Regular Trees and Words (ML, CM), pp. 210–221.
LATALATA-2011-CaronCM #regular expression
Partial Derivatives of an Extended Regular Expression (PC, JMC, LM), pp. 179–191.
LATALATA-2011-Gelderie #automaton #regular expression
Classifying Regular Languages via Cascade Products of Automata (MG), pp. 286–297.
LATALATA-2011-NielsenH #parsing #regular expression
Bit-coded Regular Expression Parsing (LN, FH), pp. 402–413.
LATALATA-2011-SalomaaSY #complexity
Undecidability of the State Complexity of Composed Regular Operations (AS, KS, SY), pp. 489–498.
CIKMCIKM-2011-BrauerRMB #information management #regular expression
Enabling information extraction by inference of regular expressions from sample entities (FB, RR, AM, WMB), pp. 1285–1294.
CIKMCIKM-2011-SzummerY #learning #rank
Semi-supervised learning to rank with preference regularization (MS, EY), pp. 269–278.
CIKMCIKM-2011-TsangC #query #regular expression #robust
A robust index for regular expression queries (DT, SC), pp. 2365–2368.
ICMLICML-2011-BradleyKBG #coordination #parallel
Parallel Coordinate Descent for L1-Regularized Loss Minimization (JKB, AK, DB, CG), pp. 321–328.
ICMLICML-2011-CrammerG #adaptation #classification #feedback #multi #using
Multiclass Classification with Bandit Feedback using Adaptive Regularization (KC, CG), pp. 273–280.
ICMLICML-2011-JimenezS #performance
Fast Newton-type Methods for Total Variation Regularization (ÁBJ, SS), pp. 313–320.
ICMLICML-2011-KadriRPDR #functional #kernel
Functional Regularized Least Squares Classication with Operator-valued Kernels (HK, AR, PP, ED, AR), pp. 993–1000.
ICMLICML-2011-LeeW #identification #learning #online #probability
Manifold Identification of Dual Averaging Methods for Regularized Stochastic Online Learning (SL, SJW), pp. 1121–1128.
ICMLICML-2011-MahoneyO #approximate #implementation
Implementing regularization implicitly via approximate eigenvector computation (MWM, LO), pp. 121–128.
ICMLICML-2011-MinhS
Vector-valued Manifold Regularization (HQM, VS), pp. 57–64.
KDDKDD-2011-MalbasaV #scalability
Spatially regularized logistic regression for disease mapping on large moving populations (VM, SV), pp. 1352–1360.
KDDKDD-2011-YuanHL
An improved GLMNET for l1-regularized logistic regression (GXY, CHH, CJL), pp. 33–41.
KDIRKDIR-2011-OlegA #analysis #approach #clustering
Methods for Discovering and Analysis of Regularities Systems — Approach based on Optimal Partitioning of Explanatory Variables Space (OVS, AVK), pp. 423–426.
RecSysRecSys-2011-YuanCZ #recommendation #social
Factorization vs. regularization: fusing heterogeneous social relationships in top-n recommendation (QY, LC, SZ), pp. 245–252.
SIGIRSIGIR-2011-JiYGHHZC #graph #learning #query #web
Learning search tasks in queries and web pages via graph regularization (MJ, JY, SG, JH, XH, WVZ, ZC), pp. 55–64.
SIGIRSIGIR-2011-WangXLC #semantics
Regularized latent semantic indexing (QW, JX, HL, NC), pp. 685–694.
SIGIRSIGIR-2011-WuW #collaboration
Rating-based collaborative filtering combined with additional regularization (SW, SW), pp. 1195–1196.
LOPSTRLOPSTR-2011-Gallagher #analysis #logic programming #source code #using
Analysis of Logic Programs Using Regular Tree Languages — (Extended Abstract) (JPG), pp. 1–3.
POPLPOPL-2011-HengleinN #axiom #induction #regular expression
Regular expression containment: coinductive axiomatization and computational interpretation (FH, LN), pp. 385–398.
CADECADE-2011-FontaineMP #proving
Compression of Propositional Resolution Proofs via Partial Regularization (PF, SM, BWP), pp. 237–251.
ICLPICLP-2011-JacksonBS #canonical
Canonical Regular Types (EKJ, NB, WS), pp. 73–83.
LICSLICS-2011-BenediktPR #specification
Regular Repair of Specifications (MB, GP, CR), pp. 335–344.
PODSPODS-2010-GeladeIMN #approximate #xml
Simplifying XML schema: single-type approximations of regular tree languages (WG, TI, WM, FN), pp. 251–260.
VLDBVLDB-2010-MozafariZZ #execution #query #regular expression #relational #sequence #word #xml
From Regular Expressions to Nested Words: Unifying Languages and Query Execution for Relational and XML Sequences (BM, KZ, CZ), pp. 150–161.
FoSSaCSFoSSaCS-2010-HoltmannKT #game studies #infinity #lookahead
Degrees of Lookahead in Regular Infinite Games (MH, LK, WT), pp. 252–266.
WCREWCRE-2010-LozanoKMA #mining #source code
Mining Source Code for Structural Regularities (AL, AK, KM, GA), pp. 22–31.
PEPMPEPM-2010-AndersonK #approximate #bound #termination
Regular approximation and bounded domains for size-change termination (HA, SCK), pp. 53–62.
STOCSTOC-2010-GoelKK #graph
Perfect matchings in o(n log n) time in regular bipartite graphs (AG, MK, SK), pp. 39–46.
AFLAFL-J-2008-AfoninK10 #on the #regular expression
On the Structure of Finitely Generated Semigroups of Unary Regular Languages (SA, EK), pp. 689–704.
AFLAFL-J-2008-Lohrey10 #automaton #problem #regular expression
Compressed Membership Problems for Regular Expressions and Hierarchical Automata (ML), pp. 817–841.
DLTDLT-J-2008-Ada10 #communication #complexity #nondeterminism #on the #regular expression
On the Non-Deterministic Communication Complexity of Regular Languages (AA), pp. 479–493.
DLTDLT-J-2008-GawrychowskiKRS10 #context-free grammar #polynomial
Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time (PG, DK, NR, JS), pp. 597–618.
CIAACIAA-2010-ChamparnaudDJ #geometry
Regular Geometrical Languages and Tiling the Plane (JMC, JPD, HJ), pp. 69–78.
CIAACIAA-2010-CimattiMRT #automaton #nondeterminism #regular expression
From Sequential Extended Regular Expressions to NFA with Symbolic Labels (AC, SM, MR, ST), pp. 87–94.
CIAACIAA-2010-DiekertK #complexity #regular expression
Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract) (VD, SK), pp. 105–114.
CIAACIAA-2010-DrosteM #regular expression
Regular Expressions on Average and in the Long Run (MD, IM), pp. 211–221.
CIAACIAA-2010-LiuGLT #automaton #composition #matrix #regular expression
Compressing Regular Expressions’ DFA Table by Matrix Decomposition (YL, LG, PL, JT), pp. 282–289.
CIAACIAA-2010-Maout #design #regular expression
Regular Expressions at Their Best: A Case for Rational Design (VLM), pp. 310–320.
CIAACIAA-2010-OkuiS #ambiguity #automaton #regular expression
Disambiguation in Regular Expression Matching via Position Automata with Augmented Transitions (SO, TS), pp. 231–240.
CIAACIAA-2010-ReidenbachS #polynomial #regular expression #scalability
A Polynomial Time Match Test for Large Classes of Extended Regular Expressions (DR, MLS), pp. 241–250.
DLTDLT-2010-ChambartS #problem #set
Computing Blocker Sets for the Regular Post Embedding Problem (PC, PS), pp. 136–147.
DLTDLT-2010-HolzerK #complexity
The Complexity of Regular(-Like) Expressions (MH, MK), pp. 16–30.
DLTDLT-2010-JiraskovaM #complexity #regular expression
Complexity in Union-Free Regular Languages (GJ, TM), pp. 255–266.
DLTDLT-2010-MarinK #revisited
Regular Hedge Language Factorization Revisited (MM, TK), pp. 328–339.
DLTDLT-2010-PribavkinaR #complexity #regular expression
State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages (EVP, ER), pp. 376–386.
ICALPICALP-v2-2010-ChambartS #problem
Pumping and Counting on the Regular Post Embedding Problem (PC, PS), pp. 64–75.
ICALPICALP-v2-2010-ColcombetKL #cost analysis
Regular Temporal Cost Functions (TC, DK, SL), pp. 563–574.
LATALATA-2010-ChamparnaudDJ #geometry #regular expression
Geometricity of Binary Regular Languages (JMC, JPD, HJ), pp. 178–189.
LATALATA-2010-GruberG #regular expression
Simplifying Regular Expressions (HG, SG), pp. 285–296.
LATALATA-2010-Hovland #problem #regular expression
The Inclusion Problem for Regular Expressions (DH), pp. 309–320.
LATALATA-2010-MiloPZ #constraints #named #regular expression #sequence
SA-REPC — Sequence Alignment with Regular Expression Path Constraint (NM, TP, MZU), pp. 451–462.
ICFPICFP-2010-FischerHW #functional #game studies #regular expression
A play on regular expressions: functional pearl (SF, FH, TW), pp. 357–368.
ICFPICFP-2010-KellerCLJL #array #haskell #parallel
Regular, shape-polymorphic, parallel arrays in Haskell (GK, MMTC, RL, SLPJ, BL), pp. 261–272.
CHICHI-2010-YangX #2d #bias #towards
Bias towards regular configuration in 2D pointing (HY, XX), pp. 1391–1400.
CIKMCIKM-2010-FeiQH #feature model
Regularization and feature selection for networked features (HF, BQ, JH), pp. 1893–1896.
ECIRECIR-2010-ZhengF #information retrieval #query
Query Aspect Based Term Weighting Regularization in Information Retrieval (WZ, HF), pp. 344–356.
ICMLICML-2010-JaggiS #algorithm #problem
A Simple Algorithm for Nuclear Norm Regularized Problems (MJ, MS), pp. 471–478.
ICMLICML-2010-NakajimaS #matrix
Implicit Regularization in Variational Bayesian Matrix Factorization (SN, MS), pp. 815–822.
ICMLICML-2010-PetrikTPZ #approximate #feature model #linear #markov #process #source code #using
Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes (MP, GT, RP, SZ), pp. 871–878.
ICPRICPR-2010-DupeBBLE #kernel
Kernel-Based Implicit Regularization of Structured Objects (FXD, SB, LB, OL, AE), pp. 2142–2145.
ICPRICPR-2010-HaindlH10a
Near-Regular BTF Texture Model (MH, MH), pp. 2114–2117.
ICPRICPR-2010-LotteG #classification
Spatially Regularized Common Spatial Patterns for EEG Classification (FL, CG), pp. 3712–3715.
ICPRICPR-2010-SenkoK #clustering #pattern matching #pattern recognition #recognition #using
Pattern Recognition Method Using Ensembles of Regularities Found by Optimal Partitioning (OVS, AVK), pp. 2957–2960.
KDDKDD-2010-Ruggieri #mining
Frequent regular itemset mining (SR), pp. 263–272.
PPDPPPDP-2010-BrabrandT #ambiguity #pattern matching #regular expression #string #using
Typed and unambiguous pattern matching on strings using regular expressions (CB, JGT), pp. 243–254.
LDTALDTA-2009-JimM10 #earley #parsing #performance
Efficient Earley Parsing with Regular Right-hand Sides (TJ, YM), pp. 135–148.
ICSTICST-2010-VeanesHT #named #regular expression
Rex: Symbolic Regular Expression Explorer (MV, PdH, NT), pp. 498–507.
ICTSSICTSS-2010-AartsJU #abstraction #communication #generative #infinity #modelling #protocol #using
Generating Models of Infinite-State Communication Protocols Using Regular Inference with Abstraction (FA, BJ, JU), pp. 188–204.
LICSLICS-2010-ColcombetL #cost analysis #finite
Regular Cost Functions over Finite Trees (TC, CL), pp. 70–79.
LICSLICS-2010-SchweikardtS #invariant
Addition-Invariant FO and Regularity (NS, LS), pp. 273–282.
RTARTA-2010-KutsiaM #order #regular expression #unification
Order-Sorted Unification with Regular Expression Sorts (TK, MM), pp. 193–208.
ICSTSAT-2010-RathiARS #bound #random #satisfiability
Bounds on Threshold of Regular Random k-SAT (VR, EA, LKR, MS), pp. 264–277.
VMCAIVMCAI-2010-SanchezL #linear #logic
Regular Linear Temporal Logic with Past (CS, ML), pp. 295–311.
ASEASE-2009-LiXTHS #automation #generative #named #regular expression #source code #testing #using
Reggae: Automated Test Generation for Programs Using Complex Regular Expressions (NL, TX, NT, JdH, WS), pp. 515–519.
CASECASE-2009-Morrison #clustering #modelling #process #tool support
Regular flow line models for semiconductor cluster tools: A case of lot dependent process times (JRM), pp. 561–566.
DATEDATE-2009-LudoviciVMRGLGB #constraints #design
Assessing fat-tree topologies for regular network-on-chip design under nanoscale technology constraints (DL, FGV, SM, CGR, MEG, PL, GNG, DB), pp. 562–565.
DocEngDocEng-2009-BalinskyWR
Aesthetic measure of alignment and regularity (HB, AW, MCR), pp. 56–65.
ICDARICDAR-2009-LeungL #generative #recognition
Recognition of Handwritten Chinese Characters by Combining Regularization, Fisher’s Discriminant and Distorted Sample Generation (KCL, CHL), pp. 1026–1030.
SIGMODSIGMOD-2009-BexGMN #nondeterminism #regular expression #xml
Simplifying XML schema: effortless handling of nondeterministic regular expressions (GJB, WG, WM, FN), pp. 731–744.
TACASTACAS-2009-Thierry-MiegPHK #diagrams #modelling #set
Hierarchical Set Decision Diagrams and Regular Models (YTM, DP, AH, FK), pp. 1–15.
ICPCICPC-2009-PierretP #empirical #open source
An empirical exploration of regularities in open-source software lexicons (DP, DP), pp. 228–232.
PLDIPLDI-2009-HooimeijerW #constraints #regular expression #set
A decision procedure for subset constraints over regular languages (PH, WW), pp. 188–198.
CIAACIAA-J-2008-ChamparnaudDJ09 #algorithm #geometry #performance #regular expression
An Efficient Algorithm to Test Whether a Binary and Prolongeable Regular Language is Geometrical (JMC, JPD, HJ), pp. 763–774.
CIAACIAA-J-2008-TsayW09 #automation #composition #reasoning
Automated Compositional Reasoning of Intuitionistically Closed Regular Properties (YKT, BYW), pp. 747–762.
CIAACIAA-2009-CleophasH #algorithm #automaton #tool support
Forest FIRE: A Taxonomy-based Toolkit of Tree Automata and Regular Tree Algorithms (LGC, KH), pp. 245–248.
CIAACIAA-2009-GruberHT #automaton #empirical #finite #regular expression
Short Regular Expressions from Finite Automata: Empirical Results (HG, MH, MT), pp. 188–197.
CIAACIAA-2009-InabaH #query #representation #set
Compact Representation for Answer Sets of n-ary Regular Queries (KI, HH), pp. 94–104.
CIAACIAA-2009-VuilleminG #automaton #normalisation #regular expression
Compact Normal Form for Regular Languages as Xor Automata (JV, NG), pp. 24–33.
DLTDLT-2009-BehleKR #quantifier #regular expression
Regular Languages Definable by Majority Quantifiers with Two Variables (CB, AK, SR), pp. 91–102.
DLTDLT-2009-Egecioglu #approximate #context-free grammar
Strongly Regular Grammars and Regular Approximation of Context-Free Languages (ÖE), pp. 207–220.
DLTDLT-2009-Fazekas #regular expression
Powers of Regular Languages (SZF), pp. 221–227.
DLTDLT-2009-GruberH #bound #complexity #regular expression
Tight Bounds on the Descriptional Complexity of Regular Expressions (HG, MH), pp. 276–287.
ICALPICALP-v1-2009-BilleT #performance #regular expression
Faster Regular Expression Matching (PB, MT), pp. 171–182.
ICALPICALP-v2-2009-BrancoP #equation #polynomial #regular expression
Equations Defining the Polynomial Closure of a Lattice of Regular Languages (MJJB, JÉP), pp. 115–126.
ICALPICALP-v2-2009-Colcombet #cost analysis #formal method #monad
The Theory of Stabilisation Monoids and Regular Cost Functions (TC), pp. 139–150.
ICALPICALP-v2-2009-DaxKL #logic #on the
On Regular Temporal Logics with Past, (CD, FK, ML), pp. 175–187.
LATALATA-2009-AfoninG #regular expression
Minimal Union-Free Decompositions of Regular Languages (SA, DG), pp. 83–92.
LATALATA-2009-Akama #commutative #learning
Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory (YA), pp. 93–104.
LATALATA-2009-BaaderBT #policy
Matching Trace Patterns with Regular Policies (FB, AB, AT), pp. 105–116.
LATALATA-2009-CarleN #on the #regular expression
On Extended Regular Expressions (BC, PN), pp. 279–289.
LATALATA-2009-HanSY #complexity #regular expression
State Complexity of Combined Operations for Prefix-Free Regular Languages (YSH, KS, SY), pp. 398–409.
LATALATA-2009-Kasprzik
Two Equivalent Regularizations for Tree Adjoining Grammars (AK), pp. 469–480.
CIKMCIKM-2009-ChenLQZ #classification
Instance- and bag-level manifold regularization for aggregate outputs classification (SC, BL, MQ, CZ), pp. 1593–1596.
CIKMCIKM-2009-ColazzoGPS #linear #regular expression #xml
Linear inclusion for XML regular expression types (DC, GG, LP, CS), pp. 137–146.
CIKMCIKM-2009-FeiH #graph #kernel
L2 norm regularized feature kernel regression for graph data (HF, JH), pp. 593–600.
ICMLICML-2009-DoLF #learning #online
Proximal regularization for online and batch learning (CBD, QVL, CSF), pp. 257–264.
ICMLICML-2009-HelleputteD #feature model #linear #modelling
Partially supervised feature selection with regularized linear models (TH, PD), pp. 409–416.
ICMLICML-2009-KolterN09a #difference #feature model #learning
Regularization and feature selection in least-squares temporal difference learning (JZK, AYN), pp. 521–528.
ICMLICML-2009-KowalskiSR #kernel #learning #multi
Multiple indefinite kernel learning with mixed norm regularization (MK, MS, LR), pp. 545–552.
ICMLICML-2009-QiTZCZ #learning #metric #performance
An efficient sparse metric learning in high-dimensional space via l1-penalized log-determinant regularization (GJQ, JT, ZJZ, TSC, HJZ), pp. 841–848.
ICMLICML-2009-QuattoniCCD #infinity #performance
An efficient projection for l1,infinity regularization (AQ, XC, MC, TD), pp. 857–864.
ICMLICML-2009-Shalev-ShwartzT #probability
Stochastic methods for l1 regularized loss minimization (SSS, AT), pp. 929–936.
KDDKDD-2009-ZhengWLL
Information theoretic regularization for semi-supervised boosting (LZ, SW, YL, CHL), pp. 1017–1026.
SACSAC-2009-MetivierBL
Softening Gcc and Regular with preferences (JPM, PB, SL), pp. 1392–1396.
CADECADE-2009-NguyenS #calculus #logic
A Tableau Calculus for Regular Grammar Logics with Converse (LAN, AS), pp. 421–436.
CAVCAV-2009-LammichMW #automaton #constraints #network #set
Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints (PL, MMO, AW), pp. 525–539.
VMCAIVMCAI-2009-GondiPS #monitoring #probability
Monitoring the Full Range of omega-Regular Properties of Stochastic Systems (KG, YP, APS), pp. 105–119.
ASEASE-2008-BrichauKM #source code #using
Enforcing Structural Regularities in Source Code using IntensiVE (JB, AK, KM), pp. 471–472.
CASECASE-2008-Morrison #evolution
Flow lines with regular service times: Evolution of delay, state dependent failures and semiconductor wafer fabrication (JRM), pp. 247–252.
DATEDATE-2008-BonesanaPS #adaptation #regular expression
An adaptable FPGA-based System for Regular Expression Matching (IB, MP, MDS), pp. 1262–1267.
DATEDATE-2008-CertnerLPTAD #approach #parallel #performance #predict #source code
A Practical Approach for Reconciling High and Predictable Performance in Non-Regular Parallel Programs (OC, ZL, PP, OT, FA, ND), pp. 740–745.
SIGMODSIGMOD-2008-MajumderRV #data type #regular expression #scalability
Scalable regular expression matching on data streams (AM, RR, SV), pp. 161–172.
ESOPESOP-2008-Cheney #query #regular expression #type system #xml
Regular Expression Subtyping for XML Query and Update Languages (JC), pp. 32–47.
FASEFASE-2008-BergJR #similarity #state machine #testing #using
Regular Inference for State Machines Using Domains with Equality Tests (TB, BJ, HR), pp. 317–331.
FoSSaCSFoSSaCS-2008-ChambartS #problem
The ω-Regular Post Embedding Problem (PC, PS), pp. 97–111.
FoSSaCSFoSSaCS-2008-ChatterjeeSH #markov #model checking
Model-Checking ω-Regular Properties of Interval Markov Chains (KC, KS, TAH), pp. 302–317.
FoSSaCSFoSSaCS-2008-GodoyMT #decidability #morphism
Classes of Tree Homomorphisms with Decidable Preservation of Regularity (GG, SM, ST), pp. 127–141.
FoSSaCSFoSSaCS-2008-GruberJ #bound #communication #complexity #regular expression #using
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity (HG, JJ), pp. 273–286.
TACASTACAS-2008-FarzanCCTW #automation #composition #regular expression #verification
Extending Automated Compositional Verification to the Full Class of ω-Regular Languages (AF, YFC, EMC, YKT, BYW), pp. 2–17.
WCREWCRE-2008-Zhang #source code
Exploring Regularity in Source Code: Software Science and Zipf’s Law (HZ), pp. 101–110.
DLTDLT-J-2007-Jez08 #boolean grammar
Conjunctive Grammars Generate Non-Regular Unary Languages (AJ), pp. 597–615.
DLTDLT-J-2007-Selivanov08
Fine Hierarchy of Regular Aperiodic ω-Languages (VLS), pp. 649–675.
AFLAFL-2008-AfoninK #regular expression
Semigroups of regular languages over a one letter alphabet are rational (SA, EK), pp. 61–73.
CIAACIAA-2008-ChamparnaudDJ #automaton #geometry #regular expression #testing
Testing Whether a Binary and Prolongeable Regular Language LIs Geometrical or Not on the Minimal Deterministic Automaton of Pref(L) (JMC, JPD, HJ), pp. 68–77.
CIAACIAA-2008-GarciaPAR #automaton #finite #learning #nondeterminism #regular expression #using
Learning Regular Languages Using Nondeterministic Finite Automata (PG, MVdP, GIA, JR), pp. 92–101.
CIAACIAA-2008-NishiyamaM #html
A Translation from the HTML DTD into a Regular Hedge Grammar (TN, YM), pp. 122–131.
CIAACIAA-2008-TsayW #automation #composition #reasoning
Automated Compositional Reasoning of Intuitionistically Closed Regular Properties (YKT, BYW), pp. 36–45.
DLTDLT-2008-Ada #communication #complexity #nondeterminism #on the #regular expression
On the Non-deterministic Communication Complexity of Regular Languages (AA), pp. 96–107.
DLTDLT-2008-GawrychowskiKRS #context-free grammar #polynomial
Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time (PG, DK, NR, JS), pp. 339–358.
DLTDLT-2008-GeffertMP #automaton #regular expression #representation
More Concise Representation of Regular Languages by Automata and Regular Expressions (VG, CM, BP), pp. 359–370.
DLTDLT-2008-GruberH #automaton #finite #regular expression
Provably Shorter Regular Expressions from Deterministic Finite Automata (HG, MH), pp. 383–395.
DLTDLT-2008-Jiraskova #complexity #on the #regular expression
On the State Complexity of Complements, Stars, and Reversals of Regular Languages (GJ), pp. 431–442.
DLTDLT-2008-KuskeM #automaton #regular expression
Construction of Tree Automata from Regular Expressions (DK, IM), pp. 491–503.
DLTDLT-2008-SelivanovW #complexity
Complexity of Topological Properties of Regular ω-Languages (VLS, KWW), pp. 529–542.
ICALPICALP-B-2008-GehrkeGP #equation #regular expression
Duality and Equational Theory of Regular Languages (MG, SG, JÉP), pp. 246–257.
ICALPICALP-B-2008-GomezGP #commutative #question
When Does Partial Commutative Closure Preserve Regularity? (ACG, GG, JÉP), pp. 209–220.
ICALPICALP-B-2008-GruberH #automaton #finite #regular expression
Finite Automata, Digraph Connectivity, and Regular Expression Size (HG, MH), pp. 39–50.
LATALATA-2008-Crespi-ReghizziP #set
Consensual Definition of Languages by Regular Sets (SCR, PSP), pp. 196–208.
LATALATA-2008-Leupold #on the #string #term rewriting
On Regularity-Preservation by String-Rewriting Systems (PL), pp. 345–356.
CIKMCIKM-2008-GhelliCS #linear #regular expression
Linear time membership in a class of regular expressions with interleaving and counting (GG, DC, CS), pp. 389–398.
CIKMCIKM-2008-LuoZHXH #learning #multi
Transfer learning from multiple source domains via consensus regularization (PL, FZ, HX, YX, QH), pp. 103–112.
ICMLICML-2008-SindhwaniR #learning #multi
An RKHS for multi-view learning and manifold co-regularization (VS, DSR), pp. 976–983.
ICPRICPR-2008-Adkins-HillFZS #comparison #empirical #video
An empirical comparison of high definition video and regular video in optical flow computation (JPAH, JMF, YZ, JRS), pp. 1–4.
ICPRICPR-2008-BattiatoPB #video
Regular texture removal for video stabilization (SB, GP, AB), pp. 1–4.
ICPRICPR-2008-GhoniemCE #graph #video
Video denoising via discrete regularization on graphs (MG, YC, AE), pp. 1–4.
ICPRICPR-2008-JiaZ #reduction
Local Regularized Least-Square Dimensionality Reduction (YJ, CZ), pp. 1–4.
ICPRICPR-2008-LezorayTE #clustering #graph
Impulse noise removal by spectral clustering and regularization on graphs (OL, VTT, AE), pp. 1–4.
ICPRICPR-2008-LezorayTE08a #graph #image
Nonlocal graph regularization for image colorization (OL, VTT, AE), pp. 1–4.
ICPRICPR-2008-NohHL #analysis #invariant #recognition
Regularized discriminant analysis for transformation-invariant object recognition (YKN, JH, DDL), pp. 1–5.
ICPRICPR-2008-Patanavijit #estimation #multi #probability #robust
A robust iterative multiframe SRR based on Hampel stochastic estimation with Hampel-Tikhonov regularization (VP), pp. 1–4.
KDDKDD-2008-HastieFT #coordination
Regularization paths and coordinate descent (TH, JF, RT), p. 3.
RecSysRecSys-2008-RendleS #kernel #matrix #modelling #recommendation #scalability
Online-updating regularized kernel matrix factorization models for large-scale recommender systems (SR, LST), pp. 251–258.
SIGIRSIGIR-2008-Diaz08a #feedback #modelling
Improving relevance feedback in language modeling with score regularization (FDD), pp. 807–808.
SIGIRSIGIR-2008-Diaz08b #bound #empirical #metric #robust #similarity
Theoretical bounds on and empirical robustness of score regularization to different similarity measures (FDD), pp. 809–810.
SIGIRSIGIR-2008-LiWA #graph #learning #query
Learning query intent from regularized click graphs (XL, YYW, AA), pp. 339–346.
SACSAC-2008-LoTP #detection #hardware #implementation #network #regular expression
Hardware implementation for network intrusion detection rules with regular expression support (CTDL, YGT, KP), pp. 1535–1539.
LCTESLCTES-2008-ChoPIDPK #array #compilation #data access #layout #optimisation
Compiler driven data layout optimization for regular/irregular array access patterns (DC, SP, II, ND, YP, SK), pp. 41–50.
LCTESLCTES-2008-CohenK #named #regular expression
EventScript: an event-processing language based on regular expressions with actions (NHC, KTK), pp. 111–120.
CAVCAV-2008-Legay #model checking
T(O)RMC: A Tool for (ω)-Regular Model Checking (AL), pp. 548–551.
ICSTSAT-2008-Urquhart
Regular and General Resolution: An Improved Separation (AU), pp. 277–290.
DACDAC-2007-TaylorP #combinator #design #logic #optimisation #physics
Exact Combinatorial Optimization Methods for Physical Design of Regular Logic Bricks (BT, LTP), pp. 344–349.
DATEDATE-2007-HosseinabadyDN #testing #using
Using the inter- and intra-switch regularity in NoC switch testing (MH, AD, ZN), pp. 361–366.
ICDARICDAR-2007-LebourgeoisE
Skeletonization by Gradient Regularization and Diffusion (FL, HE), pp. 1118–1122.
FoSSaCSFoSSaCS-2007-Rosu #algorithm #effectiveness #problem #regular expression
An Effective Algorithm for the Membership Problem for Extended Regular Expressions (GR), pp. 332–345.
TACASTACAS-2007-AbdullaDHR #model checking #performance #transducer #verification
Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems) (PAA, GD, NBH, AR), pp. 721–736.
PLDIPLDI-2007-KodumalA #constraints #set
Regularly annotated set constraints (JK, AA), pp. 331–341.
CIAACIAA-2007-AckermanS #performance #regular expression
Efficient Enumeration of Regular Languages (MA, JS), pp. 226–242.
DLTDLT-2007-BealBR #ambiguity
Coding Partitions: Regularity, Maximality and Global Ambiguity (MPB, FB, AR), pp. 48–59.
DLTDLT-2007-ChamparnaudOZ #equation #performance
An Efficient Computation of the Equation K-Automaton of a Regular K-Expression (JMC, FO, DZ), pp. 145–156.
DLTDLT-2007-Jez #boolean grammar
Conjunctive Grammars Can Generate Non-regular Unary Languages (AJ), pp. 242–253.
DLTDLT-2007-Selivanov
Fine Hierarchy of Regular Aperiodic ω-Languages (VLS), pp. 399–410.
ICALPICALP-2007-AlonCHKRS #algorithm #graph
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions (NA, ACO, HH, MK, VR, MS), pp. 789–800.
ICALPICALP-2007-ArenasBL #automaton #fixpoint #regular expression #word
Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization (MA, PB, LL), pp. 888–900.
LATALATA-2007-HanW #regular expression
Generalizations of One-Deterministic Regular Languages (YSH, DW), pp. 273–284.
LATALATA-2007-KutribR #automaton #regular expression
Succinct Description of Regular Languages by Weak Restarting Automata (MK, JR), pp. 343–354.
LATALATA-2007-Nemeth #approach #comparative #on the
On the Regularity of Binoid Languages: A Comparative Approach (ZLN), pp. 449–460.
LATALATA-2007-OgasawaraK #approximate #performance #product line
Stochastically Approximating Tree Grammars by Regular Grammars and Its Application to Faster ncRNA Family Annotation (KO, SK), pp. 461–472.
LATALATA-2007-Povarov #complexity #regular expression
Descriptive Complexity of the Hamming Neighborhood of a Regular Language (GP), pp. 509–520.
LATALATA-2007-Selivanov
Classifying ω-regular partitions (VLS), pp. 529–540.
IFLIFL-2007-SulzmannL #haskell #named #regular expression
XHaskell — Adding Regular Expression Types to Haskell (MS, KZML), pp. 75–92.
HCIHCI-MIE-2007-ChanCCHH #detection #multi #using
A New Method for Multi-finger Detection Using a Regular Diffuser (LWC, YFC, YWC, YPH, JYjH), pp. 573–582.
CIKMCIKM-2007-CaiHZH #locality
Regularized locality preserving indexing via spectral regression (DC, XH, WVZ, JH), pp. 741–750.
CIKMCIKM-2007-TamashiroTV #integration #query #towards
Towards practically feasible answering of regular path queries in lav data integration (MT, AT, SV), pp. 381–390.
ICMLICML-2007-AndrewG #modelling #scalability
Scalable training of L1-regularized log-linear models (GA, JG), pp. 33–40.
ICMLICML-2007-dAspremontBG #analysis #component
Full regularization path for sparse principal component analysis (Ad, FRB, LEG), pp. 177–184.
ICMLICML-2007-KropotovV #learning #on the
On one method of non-diagonal regularization in sparse Bayesian learning (DK, DV), pp. 457–464.
ICMLICML-2007-MannM #learning #robust #scalability
Simple, robust, scalable semi-supervised learning via expectation regularization (GSM, AM), pp. 593–600.
ICMLICML-2007-TomiokaA #matrix
Classifying matrices with a spectral regularization (RT, KA), pp. 895–902.
ICMLICML-2007-Tsuda #graph
Entire regularization paths for graph data (KT), pp. 919–926.
ICMLICML-2007-YeCJ #kernel #learning #parametricity #programming
Discriminant kernel and regularization parameter learning via semidefinite programming (JY, JC, SJ), pp. 1095–1102.
KDDKDD-2007-DingSJL #framework #kernel #learning #recommendation #using
A learning framework using Green’s function and kernel regularization with application to recommender system (CHQD, RJ, TL, HDS), pp. 260–269.
KDDKDD-2007-TeoSVL #composition #scalability
A scalable modular convex solver for regularized risk minimization (CHT, AJS, SVNV, QVL), pp. 727–736.
SIGIRSIGIR-2007-WangZL #clustering #documentation
Regularized clustering for documents (FW, CZ, TL), pp. 95–102.
PPDPPPDP-2007-Charatonik #logic programming #source code
Regular directional types for logic programs (WC), p. 209.
SACSAC-2007-LeeHPLJK #performance #regular expression #using
A high performance NIDS using FPGA-based regular expression matching (JL, SHH, NP, SWL, SJ, YSK), pp. 1187–1191.
CAVCAV-2007-JonssonS #model checking
Systematic Acceleration in Regular Model Checking (BJ, MS), pp. 131–144.
CSLCSL-2007-Kopczynski
ω-Regular Half-Positional Winning Conditions (EK), pp. 41–53.
ICLPICLP-2007-Nguyen #approximate #complexity #knowledge base #logic
Approximating Horn Knowledge Bases in Regular Description Logics to Have PTIME Data Complexity (LAN), pp. 438–439.
DATEDATE-2006-OgrasMLC #architecture #communication #optimisation
Communication architecture optimization: making the shortest path shorter in regular networks-on-chip (ÜYO, RM, HGL, NC), pp. 712–717.
DATEDATE-DF-2006-LinHJC #optimisation #pattern matching #regular expression
Optimization of regular expression pattern matching circuits on FPGA (CHL, CTH, CPJ, SCC), pp. 12–17.
ITiCSEITiCSE-2006-Gal-EzerT #algebra #how #question #regular expression
Algebraic characterization of regular languages: how to cope with all these equivalences? (JGE, MBT), p. 325.
FASEFASE-2006-BergJR #parametricity #state machine
Regular Inference for State Machines with Parameters (TB, BJ, HR), pp. 107–121.
TACASTACAS-2006-ChatterjeeH #game studies
Finitary Winning in ω-Regular Games (KC, TAH), pp. 257–271.
CSMRCSMR-2006-MensK #source code
IntensiVE, a toolsuite for documenting and checking structural source-code regularities (KM, AK), pp. 239–248.
SASSAS-2006-BouajjaniHRV #data type #model checking
Abstract Regular Tree Model Checking of Complex Dynamic Data Structures (AB, PH, AR, TV), pp. 52–70.
STOCSTOC-2006-ReingoldTV #graph #problem #pseudo
Pseudorandom walks on regular digraphs and the RL vs. L problem (OR, LT, SPV), pp. 457–466.
STOCSTOC-2006-Shapira #all about #combinator #graph
A combinatorial characterization of the testable graph properties: it’s all about regularity (NA, EF, IN, AS), pp. 251–260.
DLTDLT-J-2005-AfoninH06 #problem #regular expression #set
Membership and Finiteness Problems for Rational Sets of Regular Languages (SA, EH), pp. 493–506.
CIAACIAA-2006-PargaGR #algorithm #product line #regular expression
A Family of Algorithms for Non Deterministic Regular Languages Inference (MVdP, PG, JR), pp. 265–274.
CIAACIAA-2006-Thurston #automaton #parsing #regular expression
Parsing Computer Languages with an Automaton Compiled from a Single Regular Expression (ADT), pp. 285–286.
DLTDLT-2006-BonizzoniM #reflexive
A Decision Procedure for Reflexive Regular Splicing Languages (PB, GM), pp. 315–326.
DLTDLT-2006-HanSW #regular expression
Prime Decompositions of Regular Languages (YSH, KS, DW), pp. 145–155.
ICALPICALP-v1-2006-Bille #algorithm #regular expression
New Algorithms for Regular Expression Matching (PB), pp. 643–654.
CHICHI-2006-DillonKCB #using #visual notation
Visual search and reading tasks using ClearType and regular displays: two experiments (AD, LK, GOC, RGB), pp. 503–511.
CIKMCIKM-2006-YeXLJBCK #analysis #linear #performance
Efficient model selection for regularized linear discriminant analysis (JY, TX, QL, RJ, JB, VC, CK), pp. 532–539.
ICMLICML-2006-CheungK #framework #learning #multi
A regularization framework for multiple-instance learning (PMC, JTK), pp. 193–200.
ICMLICML-2006-KienzleC #personalisation #recognition
Personalized handwriting recognition via biased regularization (WK, KC), pp. 457–464.
ICPRICPR-v1-2006-LuT #documentation #grid #modelling
Document Flattening through Grid Modeling and Regularization (SL, CLT), pp. 971–974.
ICPRICPR-v2-2006-ChenH #bound #composition #image #segmentation
Boundary correction for total variation regularized L^1 function with applications to image decomposition and segmentation (TC, TSH), pp. 316–319.
ICPRICPR-v2-2006-ZhengL #analysis #component #kernel #learning #locality #problem
Regularized Locality Preserving Learning of Pre-Image Problem in Kernel Principal Component Analysis (WSZ, JHL), pp. 456–459.
ICPRICPR-v3-2006-HuS #complexity
Regularity and Complexity of Human Electroencephalogram Dynamics: Applications to Diagnosis of Alzheimers Disease (ZH, PS), pp. 245–248.
ICPRICPR-v3-2006-LiGYCG #feature model
Facial Feature Selection Based on SVMs by Regularized Risk Minimization (WL, WG, LY, WC, XG), pp. 540–543.
ICPRICPR-v3-2006-QinSL #analysis #feature model #performance
Efficient Feature Extraction Based on Regularized Uncorrelated Chernoff Discriminant Analysis (AKQ, PNS, ML), pp. 125–128.
ICPRICPR-v3-2006-VartiainenSLKK #detection
Detecting irregularities in regular patterns (JV, AS, LL, JKK, HK), pp. 926–929.
ICPRICPR-v3-2006-XueLF #image #using
Iterative Image Restoration using a Non-Local Regularization Function and a Local Regularization Operator (FX, QSL, WF), pp. 766–769.
KDDKDD-2006-YeW #analysis
Regularized discriminant analysis for high dimensional, low sample size data (JY, TW), pp. 454–463.
KDDKDD-2006-ZhangPD #categorisation #graph #linear #modelling #predict
Linear prediction models with graph regularization for web-page categorization (TZ, AP, BD), pp. 821–826.
SIGIRSIGIR-2006-TaoZ #estimation #feedback #modelling #pseudo #robust
Regularized estimation of mixture models for robust pseudo-relevance feedback (TT, CZ), pp. 162–169.
POPLPOPL-2006-Vouillon #polymorphism
Polymorphic regular tree types and patterns (JV), pp. 103–114.
CSLCSL-2006-ChatterjeeDHR #algorithm #game studies
Algorithms for ω-Regular Games with Imperfect Information (KC, LD, TAH, JFR), pp. 287–302.
LICSLICS-2006-BojanczykC #bound
Bounds in w-Regularity (MB, TC), pp. 285–296.
DACDAC-2005-KheterpalRHMTSP #design
Design methodology for IC manufacturability based on regular logic-bricks (VK, VR, TGH, DM, YT, AJS, LTP), pp. 353–358.
PODSPODS-2005-AbiteboulMB #ambiguity #xml
Regular rewriting of active XML and unambiguity (SA, TM, OB), pp. 295–303.
ITiCSEITiCSE-2005-MoreiraR #interactive
Interactive manipulation of regular objects with FAdo (NM, RR), pp. 335–339.
FASEFASE-2005-BergGJLRS #consistency #on the #testing
On the Correspondence Between Conformance Testing and Regular Inference (TB, OG, BJ, ML, HR, BS), pp. 175–189.
TACASTACAS-2005-BouajjaniHMV #model checking #source code #verification
Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking (AB, PH, PM, TV), pp. 13–29.
TACASTACAS-2005-VardhanSVA #using #verification
Using Language Inference to Verify ω-Regular Properties (AV, KS, MV, GA), pp. 45–60.
ICSMEICSM-2005-MensK #framework #source code #testing #towards
Towards a Framework for Testing Structural Source-Code Regularities (KM, AK), pp. 679–682.
STOCSTOC-2005-AchlioptasCKM #bias #graph #on the
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs (DA, AC, DK, CM), pp. 694–703.
STOCSTOC-2005-BojanczykC #automaton #regular expression
Tree-walking automata do not recognize all regular languages (MB, TC), pp. 234–243.
CIAACIAA-J-2004-Yli-Jyra05 #approximate #dependence #regular expression
Approximating dependency grammars through intersection of star-free regular languages (AYJ), pp. 565–579.
CIAACIAA-2005-CanoG #automaton #bound #constant #finite
Finite Automata and Unions of Regular Patterns with Bounded Constant Segments (AC, PG), pp. 104–115.
CIAACIAA-2005-HanW #automaton #finite #regular expression
Shorter Regular Expressions from Finite-State Automata (YSH, DW), pp. 141–152.
CIAACIAA-2005-MoraisMR #automaton #regular expression
Acyclic Automata with Easy-to-Find Short Regular Expressions (JJM, NM, RR), pp. 349–350.
DLTDLT-2005-AfoninH #problem #regular expression #set
Membership and Finiteness Problems for Rational Sets of Regular Languages (SA, EH), pp. 88–99.
DLTDLT-2005-Straubing #regular expression
Inexpressibility Results for Regular Languages in Nonregular Settings (HS), pp. 69–77.
ICALPICALP-2005-BeaudryLT #regular expression
Groupoids That Recognize Only Regular Languages (MB, FL, DT), pp. 421–433.
CIKMCIKM-2005-Diaz #ad hoc #retrieval
Regularizing ad hoc retrieval scores (FD), pp. 672–679.
ICMLICML-2005-Tsuda
Propagating distributions on a hypergraph by dual information regularization (KT), pp. 920–927.
ICMLICML-2005-WangWGSC #markov #modelling #random #semantics
Exploiting syntactic, semantic and lexical regularities in language modeling via directed Markov random fields (SW, SW, RG, DS, LC), pp. 948–955.
MLDMMLDM-2005-GhoshGYB05a #learning #parametricity
Determining Regularization Parameters for Derivative Free Neural Learning (RG, MG, JY, AMB), pp. 71–79.
MLDMMLDM-2005-NikulinS #clustering #probability
Universal Clustering with Regularization in Probabilistic Space (VN, AJS), pp. 142–152.
MODELSMoDELS-2005-CuccuruDMB #modelling #towards #uml
Towards UML 2 Extensions for Compact Modeling of Regular Complex Topologies (AC, JLD, PM, PB), pp. 445–459.
MODELSMoDELS-2005-CuccuruDMB #modelling #towards #uml
Towards UML 2 Extensions for Compact Modeling of Regular Complex Topologies (AC, JLD, PM, PB), pp. 445–459.
SACSAC-2005-Emir #compilation
Compiling regular patterns to sequential machines (BE), pp. 1385–1389.
CCCC-2005-Padovani #c++ #compilation #using
Compilation of Generic Regular Path Expressions Using C++ Class Templates (LP), pp. 27–42.
CADECADE-2005-Truderung #protocol
Regular Protocols and Attacks with Regular Knowledge (TT), pp. 377–391.
LICSLICS-2005-BaetenC #algebra #process #regular expression
Regular Expressions in Process Algebra (JCMB, FC), pp. 12–19.
LICSLICS-2005-BaierG #automaton #probability #regular expression
Recognizing ω-regular Languages with Probabilistic Automata (CB, MG), pp. 137–146.
VMCAIVMCAI-2005-Bozzelli #model checking #process #term rewriting
Model Checking for Process Rewrite Systems and a Class of Action-Based Regular Properties (LB), pp. 282–297.
DACDAC-2004-KheterpalSP #architecture
Routing architecture exploration for regular fabrics (VK, AJS, LTP), pp. 204–207.
DACDAC-2004-RanM #configuration management #design #on the
On designing via-configurable cell blocks for regular fabrics (YR, MMS), pp. 198–203.
DATEDATE-v1-2004-KoorapatyKGFP #logic
Exploring Logic Block Granularity for Regular Fabrics (AK, VK, PG, MF, LTP), pp. 468–473.
DATEDATE-v2-2004-ZieglerS #design #parallel
A Unified Design Space for Regular Parallel Prefix Adders (MMZ, MRS), pp. 1386–1387.
TACASTACAS-2004-BoigelotLW #model checking
ω-Regular Model Checking (BB, AL, PW), pp. 561–575.
PLDIPLDI-2004-LiuRYSH #parametricity #query
Parametric regular path queries (YAL, TR, FY, SDS, NH), pp. 219–230.
CIAACIAA-2004-DelgadoM #approximate #regular expression
Approximation to the Smallest Regular Expression for a Given Regular Language (MD, JM), pp. 312–314.
CIAACIAA-2004-FrishertCW #automaton #finite #regular expression
FIRE Station: An Environment for Manipulating Finite Automata and Regular Expression Views (MF, LGC, BWW), pp. 125–133.
CIAACIAA-2004-FrishertW #automaton #regular expression
Combining Regular Expressions with (Near-)Optimal Brzozowski Automata (MF, BWW), pp. 319–320.
CIAACIAA-2004-JirasekJS #complexity #regular expression
State Complexity of Concatenation and Complementation of Regular Languages (JJ, GJ, AS), pp. 178–189.
CIAACIAA-2004-LeeS #regular expression
Enumerating Regular Expressions and Their Languages (JL, JS), pp. 2–22.
CIAACIAA-2004-Yli-Jyra #approximate #dependence #regular expression
Approximating Dependency Grammars Through Intersection of Regular Languages (AYJ), pp. 281–292.
DLTDLT-2004-AnselmoGM #2d #regular expression
Regular Expressions for Two-Dimensional Languages Over One-Letter Alphabet (MA, DG, MM), pp. 63–75.
ICALPICALP-2004-FrischC #regular expression
Greedy Regular Expression Matching (AF, LC), pp. 618–629.
ICALPICALP-2004-Kunc
Regular Solutions of Language Inequalities and Well Quasi-orders (MK), pp. 870–881.
ICALPICALP-2004-MagniezR #testing
Property Testing of Regular Tree Languages (FM, MdR), pp. 932–944.
ICFPICFP-2004-BrobergFS #regular expression
Regular expression patterns (NB, AF, JS), pp. 67–78.
ICEISICEIS-v2-2004-HamzaY #constraints #mining #regular expression #using
Mining Sequential Patterns with Regular Expression Constraints Using Sequential Pattern Tree (MH, KM, MY), pp. 116–121.
CIKMCIKM-2004-KangJC #automation #image #modelling
Regularizing translation models for better automatic image annotation (FK, RJ, JYC), pp. 350–359.
ICPRICPR-v1-2004-ZhangP #classification
SVM vs Regularized Least Squares Classification (PZ, JP), pp. 176–179.
ICPRICPR-v2-2004-MachadoMC #adaptation #clustering #image #using
The Influence of the Noise in the Restoration of Solar Radio Images using Adaptive Regularization Techniques Based on Clustering (WRSM, NDAM, JERC), pp. 371–374.
ICPRICPR-v3-2004-LeymarieKG #towards
Towards Surface Regularization via Medial Axis Transitions (FFL, BBK, PJG), pp. 123–126.
ICPRICPR-v3-2004-WuWW #adaptation #image #parametricity
Regularized Image Restoration Based on Adaptively Selecting Parameter and Operator (XW, RW, CW), pp. 662–665.
ICPRICPR-v4-2004-Ben-AriS
Non-Isotropic Regularization of the Correspondence Space in Stereo-Vision (RBA, NAS), pp. 293–296.
KDDKDD-2004-EvgeniouP #learning #multi
Regularized multi--task learning (TE, MP), pp. 109–117.
SACSAC-2004-ZhouL #classification #network
Regularized B-spline network and its application to heart arrhythmia classification (JZ, LL), pp. 291–295.
CGOCGO-2004-WuPSRCA #memory management #profiling #using
Exposing Memory Access Regularities Using Object-Relative Memory Profiling (QW, AP, AS, ER, DWC, DIA), pp. 315–324.
CAVCAV-2004-AbdullaJNdS #ltl #model checking
Regular Model Checking for LTL(MSO) (PAA, BJ, MN, Jd, MS), pp. 348–360.
CAVCAV-2004-BouajjaniHV #model checking
Abstract Regular Model Checking (AB, PH, TV), pp. 372–386.
CAVCAV-2004-BustanRV #markov #verification
Verifying ω-Regular Properties of Markov Chains (DB, SR, MYV), pp. 189–201.
CAVCAV-2004-Lange #model checking
Symbolic Model Checking of Non-regular Properties (ML), pp. 83–95.
CSLCSL-2004-RychlikowskiT #constraints #set
Set Constraints on Regular Terms (PR, TT), pp. 458–472.
ICLPICLP-2004-GallagherH #abstract domain
Abstract Domains Based on Regular Types (JPG, KSH), pp. 27–42.
DACDAC-2003-PileggiSSGKKPRT #trade-off
Exploring regular fabrics to optimize the performance-cost trade-off (LTP, HS, AJS, PG, VK, AK, CP, VR, KYT), pp. 782–787.
DATEDATE-2003-HuM #architecture #energy #flexibility #performance
Exploiting the Routing Flexibility for Energy/Performance Aware Mapping of Regular NoC Architectures (JH, RM), pp. 10688–10693.
PODSPODS-2003-GrahneT #constraints #query #using
Query containment and rewriting using views for regular path queries under constraints (GG, AT), pp. 111–122.
STOCSTOC-2003-KimV #generative #graph #random
Generating random regular graphs (JHK, VHV), pp. 213–222.
CIAACIAA-2003-BravoN #parsing
Building Context-Sensitive Parsers from CF Grammars with Regular Control Language (CB, JJN), pp. 306–308.
CIAACIAA-2003-ChamparnaudLOZ #automaton #finite
From Regular Weighted Expressions to Finite Automata (JMC, ÉL, FO, DZ), pp. 49–60.
CIAACIAA-2003-FrishertCW #automaton #regular expression
The Effect of Rewriting Regular Expressions on Their Accepting Automata (MF, LGC, BWW), pp. 304–305.
CIAACIAA-2003-TammU #automaton #regular expression
Bideterministic Automata and Minimal Representations of Regular Languages (HT, EU), pp. 61–71.
CIAACIAA-2003-Zijl #regular expression
Succinct Descriptions of Regular Languages with Binary +-NFAs (LvZ), pp. 72–82.
DLTDLT-2003-BonizzoniFMZ #finite #reflexive #regular expression
Regular Languages Generated by Reflexive Finite Splicing Systems (PB, CdF, GM, RZ), pp. 134–145.
DLTDLT-2003-ChamparnaudC #algorithm #automaton #nondeterminism #reduction
NFA Reduction Algorithms by Means of Regular Inequalities (JMC, FC), pp. 194–205.
DLTDLT-2003-DrewesH #education #learning
Learning a Regular Tree Language from a Teacher (FD, JH), pp. 279–291.
DLTDLT-2003-HofbauerW #string #term rewriting
Deleting String Rewriting Systems Preserve Regularity (DH, JW), pp. 337–348.
ICFPICFP-2003-Levin #compilation
Compiling regular patterns (MYL), pp. 65–77.
CAiSECAiSE-2003-WangL #optimisation #query
Query Processing and Optimization for Regular Path Expressions (GW, ML), pp. 30–45.
SIGIRSIGIR-2003-ZhangY #categorisation #classification #linear #robust
Robustness of regularized linear classification methods in text categorization (JZ, YY), pp. 190–197.
ECOOPECOOP-2003-GapeyevP
Regular Object Types (VG, BCP), pp. 151–175.
CCCC-2003-JohnstoneS #generalised parsing #parsing
Generalised Regular Parsers (AJ, ES), pp. 232–246.
CAVCAV-2003-AbdullaJNd #algorithm #model checking
Algorithmic Improvements in Regular Model Checking (PAA, BJ, MN, Jd), pp. 236–248.
RTARTA-2003-RouV #incremental #regular expression #testing
Testing Extended Regular Language Membership Incrementally by Rewriting (GR, MV), pp. 499–514.
DACDAC-2002-MadesG #graph #modelling #using
Regularization of hierarchical VHDL-AMS models using bipartite graphs (JM, MG), pp. 548–551.
DACDAC-2002-MoB
River PLAs: a regular circuit structure (FM, RKB), pp. 201–206.
DACDAC-2002-ZhengP #analysis #modelling #network #symmetry
Modeling and analysis of regular symmetrically structured power/ground distribution networks (HZ, LTP), pp. 395–398.
PODSPODS-2002-CalvaneseGLV
Lossless Regular Views (DC, GDG, ML, MYV), pp. 247–258.
VLDBVLDB-2002-ChanGR #named #performance #regular expression
RE-Tree: An Efficient Index Structure for Regular Expressions (CYC, MNG, RR), pp. 263–274.
FASEFASE-2002-HagererHNS #generative
Model Generation by Moderated Regular Extrapolation (AH, HH, ON, BS), pp. 80–95.
FoSSaCSFoSSaCS-2002-BolligLN
Generalised Regular MSC Languages (BB, ML, TN), pp. 52–66.
WCREWCRE-2002-BullTMG #abstraction #regular expression #relational #semantics
Semantic Grep: Regular Expressions + Relational Abstraction (RIB, AT, AJM, MWG), pp. 267–276.
PLDIPLDI-2002-Wu #performance #source code
Efficient Discovery of Regular Stride Patterns in Irregular Programs (YW), pp. 210–221.
STOCSTOC-2002-AlekhnovichJPU #exponential
An exponential separation between regular and general resolution (MA, JJ, TP, AU), pp. 448–456.
STOCSTOC-2002-Holmerin #approximate
Vertex cover on 4-regular hyper-graphs is hard to approximate within 2-epsilon (JH), pp. 544–552.
CIAACIAA-J-2000-Bruggemann-KleinW02 #automaton #nondeterminism
The Regularity of Two-Way Nondeterministic Tree Automata Languages (ABK, DW), pp. 67–81.
CIAACIAA-J-2000-Champarnaud02 #automaton #evaluation #nondeterminism #regular expression
Evaluation of Three Implicit Structures to Implement Nondeterministic Automata From Regular Expressions (JMC), pp. 99–113.
CIAACIAA-2002-CzyzowiczFPR
Prime Decompositions of Regular Prefix Codes (JC, WF, AP, WR), pp. 85–94.
DLTDLT-2002-HorvathLL #regular expression
Roots and Powers of Regular Languages (SH, PL, GL), pp. 220–230.
DLTDLT-2002-Seibert #automaton #finite #performance #regular expression
Efficient Transformations from Regular Expressions to Finite Automata (SS), pp. 28–42.
ICALPICALP-2002-Bala #regular expression
Intersection of Regular Languages and Star Hierarchy (SB), pp. 159–169.
ICALPICALP-2002-Srba #algebra #process #similarity
Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard (JS), pp. 716–727.
ICPRICPR-v1-2002-CarvalhoSDR #constraints #estimation #linear
Bayes Information Criterion for Tikhonov Regularization with Linear Constraints: Application to Spectral Data Estimation (PDC, AS, AD, BR), pp. 696–700.
ICPRICPR-v1-2002-PatrasW #estimation
Regularized Patch Motion Estimation (IP, MW), pp. 323–326.
ICPRICPR-v1-2002-YangP #locality
Harmonic Cut and Regularized Centroid Transform for Localization of Subcellular Structures (QY, BP), pp. 788–791.
ICPRICPR-v2-2002-Guskov #geometry #performance
Efficient Tracking of Regular Patterns on Non-Rigid Geometry (IG), pp. 1057–1060.
ICPRICPR-v2-2002-YangDD #parametricity
Near-Optimal Regularization Parameters for Applications in Computer Vision (CY, RD, LSD), pp. 569–573.
CAVCAV-2002-AbdullaJMd #model checking
Regular Tree Model Checking (PAA, BJ, PM, Jd), pp. 555–568.
RTARTA-2002-RetyV #set
Regular Sets of Descendants by Some Rewrite Strategies (PR, JV), pp. 129–143.
DATEDATE-2001-DoboliV #analysis #network #scalability
A regularity-based hierarchical symbolic analysis method for large-scale analog networks (AD, RV), p. 806.
VLDBVLDB-2001-LiM #query #xml
Indexing and Querying XML Data for Regular Path Expressions (QL, BM), pp. 361–370.
FoSSaCSFoSSaCS-2001-Morin #on the #sequence chart #traceability
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory (RM), pp. 332–346.
SASSAS-2001-LiuLS #constraints #grammarware
Solving Regular Tree Grammar Based Constraints (YAL, NL, SDS), pp. 213–233.
STOCSTOC-2001-AlfaroM #game studies
Quantitative solution of ω-regular games (LdA, RM), pp. 675–683.
STOCSTOC-2001-PitassiR #bound #principle
Regular resolution lower bounds for the weak pigeonhole principle (TP, RR), pp. 347–355.
DLTDLT-2001-EiterGS #higher-order #logic #string
Second-Order Logic over Strings: Regular and Non-regular Fragments (TE, GG, TS), pp. 37–56.
DLTDLT-2001-NiemannW01a #regular expression
Some Regular Languages That Are Church-Rosser Congruential (GN, JW), pp. 330–339.
LOPSTRLOPSTR-2001-LeuschelG #deduction #model checking #using
Abstract Conjunctive Partial Deduction Using Regular Types and Its Application to Model Checking (ML, SG), pp. 91–110.
PPDPPPDP-2001-TurbakW
Cycle Therapy: A Prescription for Fold and Unfold on Regular Trees (FAT, JBW), pp. 137–149.
POPLPOPL-2001-HosoyaP #pattern matching #regular expression #xml
Regular expression pattern matching for XML (HH, BCP), pp. 67–80.
RERE-2001-RidaoDL #independence
Domain Independent Regularities in Scenarios (MR, JHD, JCSdPL), pp. 120–127.
CCCC-2001-FarreG #bound #parsing
A Bounded Graph-Connect Construction for LR-regular Parsers (JF, JFG), pp. 244–258.
CSLCSL-2001-Ohsaki #automaton #commutative #equation
Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories (HO), pp. 539–553.
LICSLICS-2001-AlfaroHM #source code #verification
From Verification to Control: Dynamic Programs for ω-Regular Objectives (LdA, TAH, RM), pp. 279–290.
LICSLICS-2001-BenediktLSS #approach #string
A Model-Theoretic Approach to Regular String Relations (MB, LL, TS, LS), pp. 431–440.
RTARTA-2001-LimetRS
Weakly Regular Relations and Applications (SL, PR, HS), pp. 185–200.
PODSPODS-2000-CalvaneseGLV #query
View-Based Query Processing for Regular Path Queries with Inverse (DC, GDG, ML, MYV), pp. 58–66.
ITiCSEITiCSE-2000-Ginat
Colorful examples for elaborating exploration of regularities in high-school CS1 (DG), pp. 81–84.
TACASTACAS-2000-JonssonN #infinity #transitive #verification
Transitive Closures of Regular Relations for Verifying Infinite-State Systems (BJ, MN), pp. 220–234.
PEPMPEPM-2000-GallagherP #approximate #using
Using Regular Approximations for Generalisation During Partial Evalution (JPG, JCP), pp. 44–51.
CIAACIAA-2000-Bruggemann-KleinW #automaton #nondeterminism
Regularly Extended Two-Way Nondeterministic Tree Automata (ABK, DW), pp. 57–66.
CIAACIAA-2000-Champarnaud #automaton #nondeterminism #regular expression
Implicit Structures to Implement NFA’s from Regular Expressions (JMC), pp. 80–93.
ICALPICALP-2000-GhicaM #algol #reasoning #regular expression #using
Reasoning about Idealized ALGOL Using Regular Languages (DRG, GM), pp. 103–115.
ICALPICALP-2000-HenriksenMKT #graph #on the #sequence
On Message Sequence Graphs and Finitely Generated Regular MSC Languages (JGH, MM, KNK, PST), pp. 675–686.
WLCWLC-2000-Saito
Acts over Right, Left Regular Bands and Semilattices Types (TS), pp. 396–402.
ICFPICFP-2000-HosoyaVP #regular expression #xml
Regular expression types for XML (HH, JV, BCP), pp. 11–22.
ICMLICML-2000-SchuurmansS #adaptation #learning
An Adaptive Regularization Criterion for Supervised Learning (DS, FS), pp. 847–854.
ICMLICML-2000-SlatteryM #relational #testing
Discovering Test Set Regularities in Relational Domains (SS, TMM), pp. 895–902.
ICPRICPR-v2-2000-KeglKN #classification #complexity #learning #network
Radial Basis Function Networks and Complexity Regularization in Function Learning and Classification (BK, AK, HN), pp. 2081–2086.
ICPRICPR-v3-2000-JeonY #adaptation #image #using
Image Restoration Using Dual Adaptive Regularization Operators (WJ, TY), pp. 3049–3052.
ICPRICPR-v3-2000-Rocha #composition #diagrams #performance
Efficient Polygonal Decomposition into Singular and Regular Regions via Voronoi Diagrams (JR), pp. 3770–3773.
ICPRICPR-v3-2000-RoullotHBNM #3d #image #re-engineering
Regularized Reconstruction of 3D High-Resolution Magnetic Resonance Images from Acquisitions of Anisotropically Degraded Resolutions (ER, AH, IB, MN, ÉM), pp. 3350–3353.
KRKR-2000-CalvaneseGLV #query
Containment of Conjunctive Regular Path Queries with Inverse (DC, GDG, ML, MYV), pp. 176–185.
CAVCAV-2000-BouajjaniJNT #model checking
Regular Model Checking (AB, BJ, MN, TT), pp. 403–418.
LICSLICS-2000-AlfaroH #concurrent #game studies
Concurrent ω-Regular Games (LdA, TAH), pp. 141–154.
RTARTA-2000-LevyV #constraints #higher-order #linear #unification
Linear Second-Order Unification and Context Unification with Tree-Regular Constraints (JL, MV), pp. 156–171.
PODSPODS-1999-CalvaneseGLV #query #regular expression
Rewriting of Regular Expressions and Regular Path Queries (DC, GDG, ML, MYV), pp. 194–204.
VLDBVLDB-1999-GarofalakisRS #constraints #mining #named #regular expression
SPIRIT: Sequential Pattern Mining with Regular Expression Constraints (MNG, RR, KS), pp. 223–234.
STOCSTOC-1999-CohenK #web
Exploiting Regularities in Web Traffic Patterns for Cache Replacement (EC, HK), pp. 109–118.
STOCSTOC-1999-CrescenzoI
Security-Preserving Hardness-Amplification for Any Regular One-Way Function (GDC, RI), pp. 169–178.
DLTDLT-1999-AndreBC #bound #decidability #on the #query
On decidability of boundedness property for regular path queries (YA, FB, ACC), pp. 245–256.
ICALPICALP-1999-FlescaG #graph #order #query #regular expression
Partially Ordered Regular Languages for Graph Queries (SF, SG), pp. 321–330.
CIAAWIA-1999-NoordG #compilation #finite #natural language #regular expression
An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing (GvN, DG), pp. 122–139.
ICLPICLP-1999-LuC #analysis #logic programming #source code
A Regular Type Analysis of Logic Programs (LL, JGC), p. 613.
LICSLICS-1999-GradelR
Two-Variable Descriptions of Regularity (EG, ER), pp. 14–23.
RTARTA-1999-HofbauerH #testing
Test Sets for the Universal and Existential Closure of Regular Tree Languages (DH, MH), pp. 205–219.
DACDAC-1998-IenneG #case study #design #experience #question #standard #tool support
Practical Experiences with Standard-Cell Based Datapath Design Tools: Do We Really Need Regular Layouts? (PI, AG), pp. 396–401.
DATEDATE-1998-SchneiderKHD #algorithm #architecture #comparison #hardware
From Algorithms to Hardware Architectures: A Comparison of Regular and Irregular Structured IDCT Algorithms (CS, MK, TH, JD), pp. 186–190.
PODSPODS-1998-FlorescuLS #query #regular expression
Query Containment for Conjunctive Queries with Regular Expressions (DF, AYL, DS), pp. 139–148.
ICALPICALP-1998-HenzingerRS #realtime
The Regular Real-Time Languages (TAH, JFR, PYS), pp. 580–591.
ICPRICPR-1998-HaraZH #3d #image #modelling #multi
Regularization-based 3D object modeling from multiple range images (KH, HZ, TH), pp. 964–968.
ICPRICPR-1998-MaedaKIZ #analysis #multi #using
Surface recovery by using regularization theory and its application to multiresolution analysis (MM, KK, KI, HZ), pp. 19–23.
CAVCAV-1998-WolperB #infinity #verification
Verifying Systems with Infinite but Regular State Spaces (PW, BB), pp. 88–97.
ICLPJICSLP-1998-YouYG #semantics
Regular Extension Semantics and Disjunctive Eshghi Kowalski Procedure (JHY, LYY, RG), pp. 175–189.
ICDARICDAR-1997-RochaB #symmetry
Singularities and Regularities on Line Pictures via Symmetrical Trapezoids (JR, RB), pp. 809–812.
PODSPODS-1997-AbiteboulV #constraints #query
Regular Path Queries with Constraints (SA, VV), pp. 122–133.
DLTDLT-1997-Moshkov #complexity #nondeterminism #recognition #regular expression #word
Complexity of Deterministic and Nondeterministic Decision Trees for Regular Language Word Recognition (MM), pp. 343–349.
DLTDLT-1997-NiessnerNO #liveness
Deterministic ω-regular liveness properties (FN, UN, PO), pp. 237–248.
ICALPICALP-1997-BeaudryLT #finite
Finite Loops Recognize Exactly the Regular Open Languages (MB, FL, DT), pp. 110–120.
CIAAWIA-1997-Caron #automaton #named #regular expression
LANGAGE: A Maple Package for Automaton Characterization of Regular Languages (PC), pp. 46–55.
CIAAWIA-1997-Ponty #performance #regular expression
An Efficient Null-Free Procedure for Deciding Regular Language Membership (JLP), pp. 159–170.
CIAAWIA-1997-SalomaaWY #implementation #performance #regular expression #using
Efficient Implementation of Regular Languages Using R-AFA (KS, XW, SY), pp. 176–184.
CIKMCIKM-1997-NakayamaYK #constraints #regular expression
I-Regular Expression: Regular Expression with Continuous Interval Constraints (KN, KY, SK), pp. 40–50.
LOPSTRLOPSTR-1997-SaglamG #approximate #logic programming #source code
Constrained Regular Approximation of Logic Programs (HS, JPG), pp. 282–299.
CAVCAV-1997-Fisler #decidability #diagrams #regular expression
Containing of Regular Languages in Non-Regular Timing Diagram Languages is Decidable (KF), pp. 155–166.
RTARTA-1997-Otto #on the #string #term rewriting
On the Property of Preserving Regularity for String-Rewriting Systems (FO), pp. 83–97.
DACDAC-1996-Koch
Module Compaction in FPGA-based Regular Datapaths (AK), pp. 471–476.
WRLARWLW-1996-Eker #equation #performance
Fast matching in combinations of regular equational theories (SE), pp. 90–109.
STOCSTOC-1996-Spielman #graph #morphism #performance #testing
Faster Isomorphism Testing of Strongly Regular Graphs (DAS), pp. 576–584.
ICALPICALP-1996-BosscherG #decidability #process #scalability
Regularity for a Large Class of Context-Free Processes is Decidable (DJBB, WODG), pp. 182–193.
ICALPICALP-1996-Raymond #data flow #network #regular expression
Recognizing Regular Expressions by Means of Dataflow Networks (PR), pp. 336–347.
CIAAWIA-1996-PontyZC #algorithm #automaton #polynomial #regular expression
A New Quadratic Algorithm to Convert a Regular Expression into an Automaton (JLP, DZ, JMC), pp. 109–119.
ICMLICML-1996-Bostrom #induction #logic programming #regular expression #source code
Theory-Guideed Induction of Logic Programs by Inference of Regular Languages (HB), pp. 46–53.
ICPRICPR-1996-AlquezarS #context-sensitive grammar #learning #regular expression
Learning of context-sensitive languages described by augmented regular expressions (RA, AS), pp. 745–749.
ICPRICPR-1996-BasuEP #modelling
Motion regularization for model-based head tracking (SB, IAE, AP), pp. 611–616.
ICPRICPR-1996-FrohlinghausB
Regularizing phase-based stereo (TF, JMB), pp. 451–455.
ICPRICPR-1996-HamamotoMIHT #anti #evaluation #network
Evaluation of an anti-regularization technique in neural networks (YH, YM, HI, TH, ST), pp. 205–208.
ICPRICPR-1996-KrzyzakL #classification #complexity #convergence #network #parametricity
Radial basis function networks and nonparametric classification: complexity regularization and rates of convergence (AK, TL), pp. 650–653.
ICPRICPR-1996-RebuffelS #estimation #framework #predict
Estimation of depth-from-motion combining iterative prediction scheme and regularization framework (VR, JLS), pp. 466–470.
DLTDLT-1995-Cai #complexity #component
The Computational Complexity of PCGS with Regular Components (LC), pp. 209–219.
PPDPPLILP-1995-SaglamG #approximate #constraints #logic programming #polymorphism #source code #using
Approximating Constraint Logic Programs Using Polymorphic Types and Regular Descriptions (HS, JPG), pp. 461–462.
CAVCAV-1995-BouajjaniR #hybrid #linear #subclass #verification
Verifying ω-Regular Properties for a Subclass of Linear Hybrid Systems (AB, RR), pp. 437–450.
ICLPILPS-1995-MessingS #logic programming #source code
Regular Signed Resolution Applied to Annotated Logic Programs (BM, PvS), p. 638.
RTARTA-1995-Burghardt #set
Regular Substitution Sets: A Means of Controlling E-Unification (JB), pp. 382–396.
DACDAC-1994-AloqeelyC #algorithm #synthesis
Sequencer-Based Data Path Synthesis of Regular Iterative Algorithms (MA, CYRC), pp. 155–160.
KDDKDD-1994-HuCX #database #learning
Learning Data Trend Regularities From Databases in a Dynamic Environment (XH, NC, JX), pp. 323–334.
CAVCAV-1994-CousinH #performance
Performance Improvement of State Space Exploration by Regular & Diffrential Hashing Functions (BC, JMH), pp. 364–376.
ICLPICLP-1994-GallagherW #approximate #logic programming #performance #precise #source code
Fast and Precise Regular Approximations of Logic Programs (JPG, DAdW), pp. 599–613.
DLTDLT-1993-AntimirovM #regular expression
Rewriting Extended Regular Expressions (VMA, PDM), pp. 195–209.
DLTDLT-1993-JurvanenPT
Tree Languages Recognizable by Regular Frontier Check (EJ, AP, WT), pp. 3–17.
ICALPICALP-1993-Dumas #algebra #aspect-oriented
Algebraic Aspects of B-regular Series (PD), pp. 457–468.
ICALPICALP-1993-OchmanskiW #on the
On Regular Compatibility of Semi-Commutations (EO, PAW), pp. 445–456.
ICALPICALP-1993-Wilke #algebra #testing
Algebras for Classifying Regular Tree Languages and an Application to Frontier Testability (TW), pp. 347–358.
OOPSLAOOPSLA-1993-Nierstrasz
Regular Types for Active Objects (ON), pp. 1–15.
ICLPILPS-1993-HanL #evaluation #recursion #source code
Evaluation of Regular Nonlinear Recursive Programs (JH, LVSL), p. 648.
RTARTA-1993-Backofen #logic
Regular Path Expression in Feature Logic (RB), pp. 121–135.
DACDAC-1992-RaoK #clustering
Partitioning by Regularity Extraction (DSR, FJK), pp. 235–238.
ICALPICALP-1992-Shallit #linear #set
Numeration Systems, Linear Recurrences, and Regular Sets (Extended Abstract) (JS), pp. 89–100.
CAVCAV-1992-HamaguchiHY #branch #design #logic #using #verification
Design Verification of a Microprocessor Using Branching Time Regular Temporal Logic (KH, HH, SY), pp. 206–219.
CAVCAV-1992-HojatiTKB #performance #regular expression
Efficient ω-Regular Language Containment (RH, HJT, RPK, RKB), pp. 396–409.
ICALPICALP-1991-Hashiguchi #algorithm #generative #regular expression
Algorithms for Determining the Smallest Number of Nonterminals (States) Sufficient for Generating (Accepting) a Regular Language (KH), pp. 641–648.
ICALPICALP-1991-HonkalaS #ambiguity #bound #morphism
L Morphisms: Bounded Delay and Regularity of Ambiguity (JH, AS), pp. 566–574.
FPCAFPCA-1991-AikenM #implementation
Implementing Regular Tree Expressions (AA, BRM), pp. 427–447.
KDDKDD-1991-ZytkowB #database #interactive #mining
Interactive Mining of Regularities in Databases (JMZ, JB), pp. 31–54.
ICMLML-1991-Shen #knowledge base #scalability
Discovering Regularities from Large Knowledge Bases (WMS), pp. 539–543.
CAVCAV-1991-HamaguchiHY #branch #logic #model checking #using #verification
Formal Verification of Speed-Dependent Asynchronous Cicuits Using Symbolic Model Checking of branching Time Regular Temporal Logic (KH, HH, SY), pp. 410–420.
CAVCAV-1991-HolmerLY #process #realtime
Deciding Properties of Regular Real Time Processes (UH, KGL, WY), pp. 443–453.
LICSLICS-1991-Kozen #algebra #theorem
A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events (DK), pp. 214–225.
RTARTA-1991-Kucherov #on the #term rewriting
On Relationship Between Term Rewriting Systems and Regular Tree Languages (GK), pp. 299–311.
VLDBVLDB-1990-Wood #source code
Factoring Augmented Regular Chain Programs (PTW), pp. 255–263.
ICALPICALP-1990-CourcoubetisY #markov #process
Markov Decision Processes and Regular Events (Extended Abstract) (CC, MY), pp. 336–349.
ICALPICALP-1990-LucaV #on the
On Non-Counting Regular Classes (AdL, SV), pp. 74–87.
CAVCAV-1990-HamaguchiHY #branch #complexity #linear #logic #model checking
Branching Time Regular Temporal Logic for Model Checking with Linear Time Complexity (KH, HH, SY), pp. 253–262.
DACDAC-1989-VandweerdCRSM #automation #generative #named
REDUSA: Module Generation by Automatic Elimination of Superfluous Blocks in Regular Structures (IV, KC, LR, PS, HDM), pp. 694–697.
VLDBVLDB-1989-MendelzonW #database #graph
Finding Regular Simple Paths in Graph Databases (AOM, PTW), pp. 185–193.
STOCSTOC-1989-FriedmanKS #graph #on the #random
On the Second Eigenvalue in Random Regular Graphs (JF, JK, ES), pp. 587–598.
ICALPICALP-1989-Baeza-YatesG #performance #regular expression
Efficient Text Searching of Regular Expressions (Extended Abstract) (RABY, GHG), pp. 46–62.
ICALPICALP-1989-CulikH
Dominoes and the Regularity of DNS Splicing Languages (KCI, TH), pp. 222–233.
ICALPICALP-1988-StraubingTT #quantifier #regular expression
regular Languages Defined with Generalized Quantifiers (HS, DT, WT), pp. 561–575.
ICMLML-1988-Wu #named #reduction
Reduction: A Practical Mechanism of Searching for Regularity in Data (YHW), pp. 374–380.
ICALPICALP-1987-AalbersbergH #problem
Decision Problems for Regular Trace Languages (IJA, HJH), pp. 250–259.
ICALPICALP-1987-GrafS #process #semantics
Readiness Semantics for Regular Processes with Silent Actions (SG, JS), pp. 115–125.
RTARTA-1987-Benois #algorithm #automaton #complexity #regular expression #term rewriting
Descendants of Regular Language in a Class of Rewriting Systems: Algorithm and Complexity of an Automata Construction (MB), pp. 121–132.
ICGTGG-1986-AalbersbergER #complexity #strict
Restricting the complexity of regular DNLC languages (IJA, JE, GR), pp. 147–166.
DACDAC-1985-BamjiHA #design #generative
A design by example regular structure generator (CB, CEH, JA), pp. 16–22.
STOCSTOC-1985-RaghavanT #array #graph
Provably Good Routing in Graphs: Regular Arrays (PR, CDT), pp. 79–87.
ICALPICALP-1985-Hortala-GonzalezR #hoare #logic #nondeterminism #source code #standard #theorem
Hoare’s Logic for Nondeterministic Regular Programs: A Nonstandard Completeness Theorem (MTHG, MRA), pp. 270–280.
ICALPICALP-1985-Johnson #equivalence #question
Do Rational Equivalence Relations have Regular Cross-Sections? (JHJ), pp. 300–309.
ICALPICALP-1985-Kortelainen #commutative #regular expression
Every Commutative Quasirational Language is Regular (JK), pp. 348–355.
FPCAFPCA-1985-Sheeran85 #architecture #array #design #higher-order #using
Designing Regular Array Architectures using Higher Order Functions (MS), pp. 220–237.
RTARTA-1985-Yelick #algorithm #equation #unification
Combining Unification Algorithms for Confined Regular Equational Theories (KAY), pp. 365–380.
RTARTA-1985-Zaionc #regular expression #set #λ-calculus
The Set of Unifiers in Typed λ-Calculus as Regular Expression (MZ), pp. 430–440.
PLDISCC-1984-JulligD #attribute grammar
Regular right-part attribute grammars (RJ, FD), pp. 171–178.
ICALPICALP-1984-BergstraK #algebra #process #recursion
The Algebra of Recursively Defined Processes and the Algebra of Regular Processes (JAB, JWK), pp. 82–94.
ICALPICALP-1984-IzumiIH #algebra #axiom #regular expression
A Complete Axiom System for Algebra of Closed-Regular Expression (HI, YI, NH), pp. 260–269.
POPLPOPL-1983-Wegman #graph #regular expression
Summarizing Graphs by Regular Expressions (MNW), pp. 203–216.
ICALPICALP-1982-BertoniMS #equivalence #problem
Equivalence and Membership Problems for Regular Trace Languages (AB, GM, NS), pp. 61–71.
ICALPICALP-1982-EhrenfeuchtHR #context-free grammar
Conditions Enforcing Regularity of Context-Free Languages (AE, DH, GR), pp. 187–191.
STOCSTOC-1981-ChandraHMP #equation #logic #process
Equations between Regular Terms and an Application to Process Logic (AKC, JYH, ARM, RP), pp. 384–390.
STOCSTOC-1981-Parisi-Presicce #algebra #on the
On the Faithful Regular Extensions of Iterative Algebras (FPP), pp. 368–374.
ICALPICALP-1981-Reutenauer #regular expression
A New Characterization of the Regular Languages (CR), pp. 177–183.
ICALPICALP-1980-Furer #complexity #problem #regular expression
The Complexity of the Inequivalence Problem for Regular Expressions with Intersection (MF), pp. 234–245.
ICALPICALP-1979-Kemp #distributed #on the #stack
On the Average Stack Size of Regularly Distributed Binary Trees (RK), pp. 340–355.
STOCSTOC-1974-EhrenfeuchtZ #complexity #metric #regular expression
Complexity Measures for Regular Expressions (AE, HPZ), pp. 75–79.
STOCSTOC-1974-HuntR #context-free grammar
Computational Parallels between the Regular and Context-Free Languages (HBHI, DJR), pp. 64–74.
ICALPICALP-1972-Linna #finite #regular expression
Finite Power Property of Regular Languages (ML), pp. 87–98.
ICALPICALP-1972-Reghizzi #approximate #set
Approximation of Phrase Markers by Regular Sets (SCR), pp. 367–376.
ICALPICALP-1972-Takahashi #set
Primitive Tranformations of Regular Sets and Recognizable Sets (MT), pp. 475–480.
STOCSTOC-1971-McNaughton #set
A Decision Procedure for Generalized Sequential Mapability-onto of Regular Sets (RM), pp. 206–218.
STOCSTOC-1969-Johansen #regular expression
Free Groups and Regular Expressions (PJ), pp. 113–128.

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.