Stem generalis$ (all stems)

49 papers:

PEPM-2015-BahrA #graph #traversal

Generalising Tree Traversals to DAGs: Exploiting Sharing without the Pain (PB, EA), pp. 27–38.

LATA-2015-JanickiKKM #order #subclass

Order Structures for Subclasses of Generalised Traces (RJ, JK, MK, LM), pp. 689–700.

FoSSaCS-2013-Clouston #abstraction #set

Generalised Name Abstraction for Nominal Sets (RC), pp. 434–449.

AMT-2013-Gottmann0NBEEE #concurrent #correctness #graph grammar

Correctness and Completeness of Generalised Concurrent Model Synchronisation Based on Triple Graph Grammars (SG, FH, NN, BB, CE, HE, TE), pp. 62–71.

ICALP-v2-2012-Fiore #polynomial

Discrete Generalised Polynomial Functors — (Extended Abstract) (MPF), pp. 214–226.

ICGT-2012-GhamarianR #composition #graph transformation

Generalised Compositionality in Graph Transformation (AHG, AR), pp. 234–248.

ICFP-2011-MuM #functional #morphism #theorem

Generalising and dualising the third list-homomorphism theorem: functional pearl (SCM, AM), pp. 385–391.

ICALP-v2-2010-DuncanP #quantum

Rewriting Measurement-Based Quantum Computations with Generalised Flow (RD, SP), pp. 285–296.

DAC-2009-BawiecN #logic #synthesis

Boolean logic function synthesis for generalised threshold gate circuits (MAB, MN), pp. 83–86.

ITiCSE-2009-ThomasWS #automation #diagrams #tool support

Generalised diagram revision tools with automatic marking (PGT, KGW, NS), pp. 318–322.

SIGIR-2008-Thomas #multi

Generalising multiple capture-recapture to non-uniform sample sizes (PT), pp. 839–840.

ICLP-2008-Triska #constraints #finite #theorem proving

Generalising Constraint Solving over Finite Domains (MT), pp. 820–821.

ICPR-v2-2006-PriorW #fault #parametricity #probability #random #using

Parameter Tuning using the Out-of-Bootstrap Generalisation Error Estimate for Stochastic Discrimination and Random Forests (MP, TW), pp. 498–501.

ICFP-2005-GhaniJUV #monad

Monadic augment and generalised short cut fusion (NG, PJ, TU, VV), pp. 294–305.

ICALP-2004-Katsumata

A Generalisation of Pre-logical Predicates to Simply Typed Formal Systems (SyK), pp. 831–845.

IFM-2004-Dunne #comprehension

Understanding Object-Z Operations as Generalised Substitutions (SD), pp. 328–342.

ICFP-2004-LammelJ #scrap your boilerplate

Scrap more boilerplate: reflection, zips, and generalised casts (RL, SLPJ), pp. 244–255.

ICPR-v1-2004-Hanbury #image #multi

The Morphological Top-Hat Operator Generalised to Multi-Channel Images (AH), pp. 672–675.

CC-2004-JohnstoneSE #generalised parsing #parsing

Generalised Parsing: Some Costs (AJ, ES, GRE), pp. 89–103.

ICLP-2004-RayBR #kernel #set

Generalised Kernel Sets for Inverse Entailment (OR, KB, AR), pp. 165–179.

IJCAR-2004-LetzS

Generalised Handling of Variables in Disconnection Tableaux (RL, GS), pp. 289–306.

CC-2003-JohnstoneS #generalised parsing #parsing

Generalised Regular Parsers (AJ, ES), pp. 232–246.

FoSSaCS-2002-BolligLN

Generalised Regular MSC Languages (BB, ML, TN), pp. 52–66.

SAS-2002-LuK #type checking #type inference

Backward Type Inference Generalises Type Checking (LL, AK), pp. 85–101.

ICALP-2002-Radzik #bound #network

Improving Time Bounds on Maximum Generalised Flow Computations by Contracting the Network (TR), pp. 611–622.

FME-2002-KristensenM #safety

A Generalised Sweep-Line Method for Safety Properties (LMK, TM), pp. 549–567.

CIKM-2001-NanavatiCJK #mining

Mining Generalised Disjunctive Association Rules (AAN, KPC, SJ, RK), pp. 482–489.

ECOOP-2001-BoylandNR

Capabilities for Sharing: A Generalisation of Uniqueness and Read-Only (JB, JN, WR), pp. 2–27.

CSL-2001-BaazM #on the #theorem

On a Generalisation of Herbrand’s Theorem (MB, GM), pp. 469–483.

PEPM-2000-GallagherP #approximate #using

Using Regular Approximations for Generalisation During Partial Evalution (JPG, JCP), pp. 44–51.

VLDB-1999-KemperKW

Generalised Hash Teams for Join and Group-by (AK, DK, CW), pp. 30–41.

FLOPS-1999-BakewellR #automation

Automated Generalisation of Function Definitions (AB, CR), pp. 225–240.

ICALP-1998-MalacariaH #game studies

Generalised Flowcharts and Games (PM, CH), pp. 363–374.

ICPR-1998-VesWH #algorithm

Matching blood vessel patterns with the generalised EM algorithm (EdV, RCW, ERH), pp. 364–367.

CC-1998-JohnstoneS #generalised parsing #parsing #recursion

Generalised Recursive Descent parsing and Fellow-Determinism (AJ, ES), pp. 16–30.

HT-1997-Chen #analysis #similarity #visualisation

Structuring and Visualising the WWW by Generalised Similarity Analysis (CC), pp. 177–186.

FME-1997-DierksD #case study #reasoning #specification #visual notation

Graphical Specification and Reasoning: Case Study Generalised Railroad Crossing (HD, CD), pp. 20–39.

LOPSTR-1997-BuyukyildizF #logic programming #program transformation

Generalised Logic Program Transformation Schemas (HB, PF), pp. 49–68.

CADE-1997-DennisBG #bisimulation #induction #proving #using

Using A Generalisation Critic to Find Bisimulations for Coinductive Proofs (LAD, AB, IG), pp. 276–290.

ECOOP-1996-BrandtK #type system

Generalising the BETA Type System (SB, JLK), pp. 421–448.

PLILP-1996-FernandezM #interactive #term rewriting

From Term Rewriting to Generalised Interaction Nets (MF, IM), pp. 319–333.

CADE-1994-Baker #automation #deduction

A New Application for Explanation-Based Generalisation within Automated Deduction (SB), pp. 177–191.

CADE-1994-Bundgen #how #on the

On Pot, Pans and Pudding or How to Discover Generalised Critical Pairs (RB), pp. 693–707.

WSA-1991-Chin #deforestation #first-order #functional #source code

Generalising Deforestation for All First-Order Functional Programs (WNC), pp. 173–181.

LICS-1991-Aczel #logic

Term Declaration Logic and Generalised Composita (PA), pp. 22–30.

CADE-1988-DonatW #higher-order #learning #using

Learning and Applying Generalised Solutions using Higher Order Resolution (MRD, LAW), pp. 41–60.

DAC-1985-Bergmann #design #independence

Generalised CMOS-a technology independent CMOS IC design style (NB), pp. 273–278.

ICALP-1979-Jeanrond #axiom #commutative #termination #theorem

A Unique Termination Theorem for a Theory with Generalised Commutative Axioms (HJJ), pp. 316–330.

ICALP-1974-Leeuwen #formal method #theorem

A Generalisation of Parikh’s Theorem in Formal Language Theory (JvL), pp. 17–26.