Stem simplif$ (all stems)

73 papers:

FM-2015-DiekmannHC #semantics #set

Semantics-Preserving Simplification of Real-World Firewall Rule Sets (CD, LH, GC), pp. 195–212.

ICSE-v1-2015-RheinGAS0B #configuration management

Presence-Condition Simplification in Highly Configurable Systems (AvR, AG, SA, NS, DB, TB), pp. 178–188.

SLE-2015-UmuhozaBRC #empirical #modelling #process

An empirical study on simplification of business process modeling languages (EU, MB, DR, JC), pp. 13–24.

SAT-2015-IgnatievPM #satisfiability

SAT-Based Formula Simplification (AI, AP, JMS), pp. 287–298.

CASE-2014-HuCLY #approach #automation #comparative #petri net #using

A comparative approach to supervisor simplification in automated manufacturing systems using Petri nets (HH, CC, YL, YY), pp. 619–625.

VLDB-2015-LongWJ14 #fault

Trajectory Simplification: On Minimizing the Direction-based Error (CL, RCWW, HVJ), pp. 49–60.

ICPR-2014-SouzaRML

Maximal Max-Tree Simplification (RS, LR, RCM, RdAL), pp. 3132–3137.

VLDB-2013-LongWGJ

Direction-Preserving Trajectory Simplification (CL, RCWW, HVJ), pp. 949–960.

CHI-2013-DunneS #clique #network #readability #visualisation

Motif simplification: improving network visualization readability with fan, connector, and clique glyphs (CD, BS), pp. 3247–3256.

HCI-AMTE-2013-IglesiasT #component #design #interface #reuse #visual notation

Visual Interfaces Design Simplification through Components Reuse (JRI, PMTF), pp. 441–450.

KDIR-KMIS-2013-BanerjeeKM #readability

Text Simplification for Enhanced Readability (SB, NK, CEVM), pp. 202–207.

MoDELS-2013-BalabanM #composition #constraints #correctness #diagrams #multi #uml

Simplification and Correctness of UML Class Diagrams — Focusing on Multiplicity and Aggregation/Composition Constraints (MB, AM), pp. 454–470.

MoDELS-2013-BalabanM #composition #constraints #correctness #diagrams #multi #uml

Simplification and Correctness of UML Class Diagrams — Focusing on Multiplicity and Aggregation/Composition Constraints (MB, AM), pp. 454–470.

ICSE-2013-Zhang #semantics

Practical semantic test simplification (SZ), pp. 1173–1176.

ICTSS-2013-ElyasovPH #algebra #mining #specification

Guided Algebraic Specification Mining for Failure Simplification (AE, ISWBP, JH), pp. 223–238.

PEPM-2012-Xu #contract #hybrid

Hybrid contract checking via symbolic simplification (DNX), pp. 107–116.

ICPR-2012-ZhaoL #3d #detection

Patch based saliency detection method for 3D surface simplification (YZ, YL), pp. 845–848.

SAC-2012-HojsgaardH

Core BPEL: syntactic simplification of WS-BPEL 2.0 (EH, TH), pp. 1984–1991.

DATE-2011-HanJS #analysis

Clause simplification through dominator analysis (HH, HJ, FS), pp. 143–148.

DATE-2011-ShinG #fault

A new circuit simplification method for error tolerant applications (DS, SKG), pp. 1566–1571.

SAS-2011-HuangZ #concurrent #debugging #performance #source code

An Efficient Static Trace Simplification Technique for Debugging Concurrent Programs (JH, CZ), pp. 163–179.

CIKM-2011-GuYLHJLC

Extract knowledge from semi-structured websites for search task simplification (YG, JY, HL, JH, LJ, NL, ZC), pp. 1883–1888.

SAT-2011-HeuleJB #graph #performance

Efficient CNF Simplification Based on Binary Implication Graphs (MH, MJ, AB), pp. 201–215.

SAS-2010-DilligDA #constraints #online #scalability #source code #static analysis

Small Formulas for Large Programs: On-Line Constraint Simplification in Scalable Static Analysis (ID, TD, AA), pp. 236–252.

ICALP-v2-2010-GiacobazziR #abstraction

Example-Guided Abstraction Simplification (RG, FR), pp. 211–222.

ICPR-2010-GrazziniS #image

Iterative Ramp Sharpening for Structure/Signature-Preserving Simplification of Images (JG, PS), pp. 4585–4588.

ICPR-2010-NielsenBS #clustering

Bhattacharyya Clustering with Applications to Mixture Simplifications (FN, SB, OS), pp. 1437–1440.

KDIR-2010-BallesterosBG #dependence #parsing #using

Text Simplification using Dependency Parsing for Spanish (MB, SB, PG), pp. 330–335.

FSE-2010-JalbertS #concurrent #debugging #effectiveness #source code

A trace simplification technique for effective debugging of concurrent programs (NJ, KS), pp. 57–66.

SIGMOD-2009-Neumann #optimisation #query

Query simplification: graceful degradation for join-order optimization (TN0), pp. 403–414.

DocEng-2008-AluisioSPMF #automation #towards

Towards Brazilian Portuguese automatic text simplification systems (SMA, LS, TASP, EGM, RPdMF), pp. 240–248.

MSR-2008-HerraizGGR #debugging #eclipse #towards

Towards a simplification of the bug report form in eclipse (IH, DMG, JMGB, GR), pp. 145–148.

FSE-2008-JiangS #analysis #effectiveness #testing

Profile-guided program simplification for effective testing and analysis (LJ, ZS), pp. 48–58.

SIGMOD-2007-HeWCLR #automation #named #tool support

BIwTL: a business information warehouse toolkit and language for warehousing simplification and automation (BH, RW, YC, AL, JR), pp. 1041–1052.

STOC-2007-Holenstein #parallel

Parallel repetition: simplifications and the no-signaling case (TH), pp. 411–419.

ICPR-v4-2006-FeiLWL #image

Discontinuity-Based Simplification of Free Form Surface From a Range Image (GF, YL, BW, LL), pp. 13–16.

DATE-2005-MaslovYMD #quantum #using

Quantum Circuit Simplification Using Templates (DM, CY, DMM, GWD), pp. 1208–1213.

SAT-2005-Kulikov #automation #generative #satisfiability

Automated Generation of Simplification Rules for SAT and MAXSAT (ASK), pp. 430–436.

SAT-2005-Zhang #on the #on the fly

On Subsumption Removal and On-the-Fly CNF Simplification (LZ), pp. 482–489.

MLDM-2003-CeciAM

Simplification Methods for Model Trees with Regression and Splitting Nodes (MC, AA, DM), pp. 20–34.

LOPSTR-2003-ChristiansenM #approach #constraints #database

Simplification of Database Integrity Constraints Revisited: A Transformational Approach (HC, DM), pp. 178–197.

PPDP-2003-FissoreGK #rule-based #termination

Simplification and termination of strategies in rule-based languages (OF, IG, HK), pp. 124–135.

ICPR-v2-2002-GuangmingJMHX #algorithm #data type #fault #metric

A New Mesh Simplification Algorithm Combining Half-Edge Data Structure with Modified Quadric Error Metric (GL, JT, MZ, HH, XZ), pp. 659–658.

CC-2001-SchuppGML #generative #type system

User-Extensible Simplification — Type-Based Optimizer Generators (SS, DG, DRM, SML), pp. 86–101.

CHI-2000-WatsonFM #predict #quality #using

Using naming time to evaluate quality predictors for model simplification (BW, AF, AM), pp. 113–120.

ICPR-v4-2000-BrunelliM #image #query #retrieval

Query Simplification and Strategy Selection for Image Retrieval (RB, OM), pp. 4279–4282.

DATE-1999-GuerraRRFR #fault #generative

An Accurate Error Control Mechanism for Simplification Before Generation Algorihms (OG, JDRG, ER, FVF, ÁRV), p. 412–?.

IWPC-1999-HarmanFHBD #approximate #decidability

Program Simplification as a Means of Approximating Undecidable Propositions (MH, CF, RMH, DB, SD), pp. 208–217.

PLDI-1998-PaekHP #array #compilation #data access #optimisation

Simplification of Array Access Patterns for Compiler Optimizations (YP, JH, DAP), pp. 60–71.

LICS-1998-Needham #logic

Logic and Over-Simplification (RMN), pp. 2–3.

TACAS-1995-EngbergL #bisimulation #performance

Efficient Simplification of Bisimulation Formulas (UE, KSL), pp. 111–132.

KDD-1995-Fisher #clustering #optimisation

Optimization and Simplification of Hierarchical Clusterings (DF), pp. 118–123.

ICLP-1995-PodelskiS95a

Situated Simplification (AP, GS), p. 826.

TLCA-1995-Hurkens

A Simplification of Girard’s Paradox (AJCH), pp. 266–278.

ESOP-1994-Hanus #lazy evaluation #unification

Lazy Unification with Simplification (MH), pp. 272–286.

PLILP-1994-Hanus #lazy evaluation

Combining Lazy Narrowing and Simplification (MH), pp. 370–384.

PLILP-1991-CheongF #integration #performance #prolog

Efficient Integration of Simplifications into Prolog (PHC, LF), pp. 359–370.

ISLP-1991-Fribourg #automation #generative #induction #proving

Automatic Generation of Simplification Lemmas for Inductive Proofs (LF), pp. 103–116.

DAC-1990-SavojB #multi #network

The Use of Observability and External Don’t Cares for the Simplification of Multi-Level Networks (HS, RKB), pp. 297–301.

ML-1990-Flann #abstraction

Applying Abstraction and Simplification to Learn in Intractable Domains (NSF), pp. 277–285.

CADE-1990-BachmairG #on the #order #strict

On Restrictions of Ordered Paramodulation with Simplification (LB, HG), pp. 427–441.

CADE-1990-PfenningN #deduction #symmetry

Presenting Intuitive Deductions via Symmetric Simplification (FP, DN), pp. 336–350.

DAC-1989-SaldanhaWBS #logic #multi #using

Multi-level Logic Simplification Using Don’t Cares and Filters (AS, ARW, RKB, ALSV), pp. 277–282.

NACLP-1989-LassezHM #constraints #linear

Simplification and Elimination of Redundant Linear Arithmetic Constraints (JLL, TH, KM), pp. 37–51.

RTA-1989-Steinbach #comparison #order

Extensions and Comparison of Simplification Orderings (JS), pp. 434–448.

ML-1988-FisherS #concept #predict

Concept Simplification and Prediction Accuracy (DHF, JCS), pp. 22–28.

PODS-1987-KarabegKPV #axiom #relational #transaction

Axiomatization and Simplification Rules for Relational Transactions (AK, DK, KP, VV), pp. 254–259.

ECOOP-1987-BorningO #empirical #motivation #named

Deltatalk: An Empirically and Aesthetically Motivated Simplification of the Smalltalk-80 Language (AB, TO), pp. 1–10.

RTA-1987-Purdom #detection

Detecting Looping Simplifications (PWPJ), pp. 54–61.

DAC-1983-Drier #programming

Simplification of CNC programming for PWB routing (JD), p. 448.

ICALP-1981-Pettorossi #order #proving #recursion #term rewriting #termination

Comparing and Putting Together Recursive Path Ordering, Simplification Orderings and Non-Ascending Property for Termination Proofs of Term Rewriting Systems (AP), pp. 432–447.

VLDB-1978-Grishman #retrieval

The Simplification of Retrieval Requests Generated by Question-Answering Systems (RG), pp. 400–406.

DAC-1970-SmithT #heuristic #scalability

A simplification heuristic for large flow tables (RJSI, JHT), pp. 47–53.