## Stem simplifi$ (all stems)

### 107 papers:

- STOC-2015-Chuzhoy #grid #theorem
- Excluded Grid Theorem: Improved and Simplified (JC), pp. 645–654.
- DUXU-UI-2015-HigashidaI #information retrieval #interface #keyword #smarttech
- Keyword Input via Digits: Simplified Smartphone Interface for Information Retrieval (MH, TI), pp. 530–540.
- CASE-2014-HuYLC #analysis #automation #modelling #multi #petri net
- Simplifying supervisory controllers of automated manufacturing systems via Petri net modeling and multiset analysis (HH, YY, YL, CC), pp. 449–454.
- AFL-2014-Campeanu #automaton #finite #nondeterminism
- Simplifying Nondeterministic Finite Cover Automata (CC), pp. 162–173.
- FM-2014-BowenR #interactive #modelling #semantics
- A Simplified Z Semantics for Presentation Interaction Models (JB, SR), pp. 148–162.
- CHI-2014-HellerKB #artificial reality #metric #mobile
- Simplifying orientation measurement for mobile audio augmented reality applications (FH, AK, JOB), pp. 615–624.
- CHI-2014-MengZHZES #development #named #user interface
- WADE: simplified GUI add-on development for third-party software (XM, SZ, YH, ZZ, JE, RS), pp. 2221–2230.
- DUXU-DI-2014-MushtahaT #concept #design #locality
- The Cultural Conceptual Model for Simplifying the Design of Localized Websites (AM, ODT), pp. 158–169.
- ICEIS-v3-2014-DavidAC
- Simplified Business Information — A Technical Position in Accounting and Taxation (FD, RA, FC), pp. 502–507.
- CGO-2014-HongSWO #domain-specific language #graph #scalability
- Simplifying Scalable Graph Processing with a Domain-Specific Language (SH, SS, JW, KO), p. 208.
- SAT-2014-FeketeC #constraints #pseudo
- Simplifying Pseudo-Boolean Constraints in Residual Number Systems (YF, MC), pp. 351–366.
- DATE-2013-VenkataramaniRR #approximate #configuration management #design #named #paradigm #quality
- Substitute-and-simplify: a unified design paradigm for approximate and quality configurable circuits (SV, KR, AR), pp. 1367–1372.
- ICDAR-2013-GaoJY #case study #comparative #empirical #online #recognition
- An Empirical Comparative Study of Online Handwriting Chinese Character Recognition: Simplified vs. Traditional (YG, LJ, WY), pp. 862–866.
- PPoPP-2013-DiceLLLM #algorithm #hardware #memory management #transaction #using
- Using hardware transactional memory to correct and simplify and readers-writer lock algorithm (DD, YL, YL, VL, MM), pp. 261–270.
- CASE-2012-EndoNH #energy #estimation
- Simplified Factory Energy Management System based on operational condition estimation by sensor data (ME, HN, YH), pp. 14–19.
- CASE-2012-JungBT
- A simplified time-delayed disturbance observer for position control of robot manipulators (SJ, YGB, MT), pp. 555–560.
- STOC-2012-VadhanZ #generative #pseudo
- Characterizing pseudoentropy and simplifying pseudorandom generator constructions (SPV, CJZ), pp. 817–836.
- MoDELS-2012-KainzBK #approach #model transformation
- A Generic Approach Simplifying Model-to-Model Transformation Chains (GK, CB, AK), pp. 579–594.
- MoDELS-2012-KainzBK #approach #model transformation
- A Generic Approach Simplifying Model-to-Model Transformation Chains (GK, CB, AK), pp. 579–594.
- OOPSLA-2012-HuangZ #agile #concurrent #debugging #execution #named #reduction
- LEAN: simplifying concurrency bug reproduction via replay-supported execution reduction (JH, CZ), pp. 451–466.
- LOPSTR-2012-SeghirB #array #program transformation #quantifier #verification
- Simplifying the Verification of Quantified Array Assertions via Code Transformation (MNS, MB), pp. 194–212.
- PPoPP-2012-ZhongH #bibliography #graph
- An overview of Medusa: simplified graph processing on GPUs (JZ, BH), pp. 283–284.
- ICST-2012-SegallTZ #combinator #modelling
- Simplified Modeling of Combinatorial Test Spaces (IS, RTB, AZ), pp. 573–579.
- SAT-2012-Manthey #flexibility
- Coprocessor 2.0 — A Flexible CNF Simplifier — (Tool Presentation) (NM), pp. 436–441.
- DATE-2011-BaiDDC #network #program transformation #programming #runtime
- Simplified programming of faulty sensor networks via code transformation and run-time interval computation (LSB, RPD, PAD, PHC), pp. 88–93.
- LATA-2011-LabathR #information management #using
- Simplifying DPDA Using Supplementary Information (PL, BR), pp. 342–353.
- LOPSTR-2011-CaballeroRVM #debugging #declarative #maude #proving
- Simplifying Questions in Maude Declarative Debugger by Transforming Proof Trees (RC, AR, AV, NMO), pp. 73–89.
- ICSE-2011-AndroutsopoulosBCGHLL #modelling #strict
- Model projection: simplifying models in response to restricting the environment (KA, DB, DC, NG, MH, KL, ZL), pp. 291–300.
- CAV-2011-SharmaDDA #generative #invariant #using
- Simplifying Loop Invariant Generation Using Splitter Predicates (RS, ID, TD, AA), pp. 703–719.
- DocEng-2010-StoppeG
- Down to the bone: simplifying skeletons (JS, BG), pp. 215–218.
- PODS-2010-GeladeIMN #approximate #xml
- Simplifying XML schema: single-type approximations of regular tree languages (WG, TI, WM, FN), pp. 251–260.
- TACAS-2010-ElmasQSST #abstraction #proving #reduction
- Simplifying Linearizability Proofs with Reduction and Abstraction (TE, SQ, AS, OS, ST), pp. 296–311.
- LATA-2010-GruberG #regular expression
- Simplifying Regular Expressions (HG, SG), pp. 285–296.
- SAC-2010-PaolinoSVT #empirical #evaluation #visualisation
- An evaluation of the sinuosity effect on visualization of RDP simplified maps: an empirical study (LP, MS, GV, GT), pp. 1919–1923.
- ASE-2009-Balagtas-FernandezH #analysis #framework #mobile #usability
- A Methodology and Framework to Simplify Usability Analysis of Mobile Applications (FTBF, HH), pp. 520–524.
- SIGMOD-2009-BexGMN #nondeterminism #regular expression #xml
- Simplifying XML schema: effortless handling of nondeterministic regular expressions (GJB, WG, WM, FN), pp. 731–744.
- SAC-2009-YokoyamaHSK #internet #operating system #policy #security
- Simplifying security policy descriptions for internet servers in secure operating systems (TY, MH, MS, KK), pp. 326–333.
- STOC-2008-ImpagliazzoJKW #theorem
- Uniform direct product theorems: simplified, optimized, and derandomized (RI, RJ, VK, AW), pp. 579–588.
- SAC-2008-FabreS
- Combining symbolic and numerical solvers to simplify indecomposable systems solving (AF, PS), pp. 1838–1842.
- SAC-2008-Willassen #calculus #using
- Using simplified event calculus in digital investigation (SYW), pp. 1438–1442.
- ISSTA-2008-DoR #analysis #modelling #testing #using
- Using sensitivity analysis to create simplified economic models for regression testing (HD, GR), pp. 51–62.
- VMCAI-2008-Mastroeni #bisimulation
- Deriving Bisimulations by Simplifying Partitions (IM), pp. 157–171.
- HT-2007-DoerrDD #behaviour #traversal #web
- Simplifying web traversals by recognizing behavior patterns (CD, DvD, AD), pp. 105–114.
- SIGMOD-2007-YangDHP #clustering #named #relational #scalability
- Map-reduce-merge: simplified relational data processing on large clusters (HcY, AD, RLH, DSPJ), pp. 1029–1040.
- ICSM-2007-GustavssonLLMB #development #distributed #maintenance #modelling #uml #using
- Simplifying maintenance by using XSLT to unlock UML models in a distributed development environment (HG, BL, BL, AM, MB), pp. 465–468.
- ICSM-2007-OezbekP #comprehension #documentation #named #source code
- JTourBus: Simplifying Program Understanding by Documentation that Provides Tours Through the Source Code (CO, LP), pp. 64–73.
- IFL-2007-VriesPA #type system
- Uniqueness Typing Simplified (EdV, RP, DMA), pp. 201–218.
- ICEIS-DISI-2007-ArshinoffRSAO #query
- Simplified query construction — queries made as easy as possible (BA, DR, MS, RA, TÖ), pp. 125–130.
- POPL-2006-GuptaR #reduction
- Simplifying reductions (GG, SVR), pp. 30–41.
- RE-2006-AlencarMACSM #aspect-oriented #using
- Using Aspects to Simplify iModels (FMRA, AMDM, JA, JC, CTLLS, JM), pp. 328–329.
- SAC-2006-TibermacineFS #architecture #constraints
- Simplifying transformation of software architecture constraints (CT, RF, SS), pp. 1240–1244.
- SAC-2006-WongZC #metric #modelling #statistics
- Applying statistical methodology to optimize and simplify software metric models with missing data (WEW, JZ, VKYC), pp. 1728–1733.
- SAT-2006-SheiniS06a #modulo theories #satisfiability
- A Progressive Simplifier for Satisfiability Modulo Theories (HMS, KAS), pp. 184–197.
- CASE-2005-AlenljungL #graph #modelling
- Simplified modeling of manufacturing systems: an introduction to sensor activation graphs (TA, BL), pp. 261–266.
- ICDAR-2005-YingsaereeK #analysis #detection #documentation #layout #rule-based
- Rule-based Middle-level Character Detection for Simplifying Thai Document Layout Analysis (CY, AK), pp. 888–892.
- ICML-2005-NguyenH #performance
- An efficient method for simplifying support vector machines (DN, TBH), pp. 617–624.
- SIGIR-2005-AnhM #similarity #using
- Simplified similarity scoring using term ranks (VNA, AM), pp. 226–233.
- MoDELS-2005-GieseL #constraints #ocl
- Simplifying Transformations of OCL Constraints (MG, DL), pp. 309–323.
- MoDELS-2005-WhiteSG #case study #development #enterprise #java #modelling
- Simplifying Autonomic Enterprise Java Bean Applications Via Model-Driven Development: A Case Study (JW, DCS, ASG), pp. 601–615.
- MoDELS-2005-GieseL #constraints #ocl
- Simplifying Transformations of OCL Constraints (MG, DL), pp. 309–323.
- MoDELS-2005-WhiteSG #case study #development #enterprise #java #modelling
- Simplifying Autonomic Enterprise Java Bean Applications Via Model-Driven Development: A Case Study (JW, DCS, ASG), pp. 601–615.
- DATE-v1-2004-PomeranzVRS #detection #fault
- Z-Sets and Z-Detections: Circuit Characteristics that Simplify Fault Diagnosis (IP, SV, SMR, BS), pp. 68–75.
- ICPR-v4-2004-TaguchiOA #performance #using #visual notation
- Fast Visual Search Using Simplified Pruning Rules — Streamlined Active Search (ST, SO, HA), pp. 937–940.
- PADL-2004-GuoG #programming
- Simplifying Dynamic Programming via Tabling (HFG, GG), pp. 163–177.
- SAC-2004-HassanARB #adaptation #database #keyword
- Simplified access to structured databases by adapting keyword search and database selection (MH, RA, MJR, KB), pp. 674–678.
- OSDI-2004-DeanG #clustering #named #pipes and filters #scalability
- MapReduce: Simplified Data Processing on Large Clusters (JD, SG), pp. 137–150.
- ICLP-2004-Pearce #logic programming #semantics #set #source code
- Simplifying Logic Programs Under Answer Set Semantics (DP), pp. 210–224.
- HT-2003-Obendorf #case study #comparative
- Simplifying annotation support for real-world-settings: a comparative study of active reading (HO), pp. 120–121.
- LDTA-2003-SanchezCMN #coordination #named #specification
- CoordMaude: Simplifying Formal Coordination Specifications of Cooperation Environment (MS, PJC, JMM, JHN), pp. 643–658.
- PPoPP-2003-PrabhuO #concurrent #parallel #thread #using
- Using thread-level speculation to simplify manual parallelization (MKP, KO), pp. 1–12.
- ICLP-2003-BackofenW #approach #constraints #modelling #predict
- A Constraint-Based Approach to Structure Prediction for Simplified Protein Models That Outperforms Other Existing Methods (RB, SW), pp. 49–71.
- DAC-2002-LinBP #2d #modelling #on the
- On the efficacy of simplified 2D on-chip inductance models (TL, MWB, LTP), pp. 757–762.
- IWPC-2002-Hamou-LhadjL #analysis #execution #scalability
- Compression Techniques to Simplify the Analysis of Large Execution Traces (AHL, TCL), pp. 159–168.
- KR-2002-Fruhwirth #analysis #automation #complexity
- As Time Goes by: Automatic Complexity Analysis of Simplified Rules (TWF), pp. 547–557.
- ICEIS-2000-Newman #database #design #web
- Simplifying Database Design and Integrating it Into Dynamic Web Site Construction (IN), pp. 64–70.
- ICML-2000-SilvaL #hybrid #learning
- Obtaining Simplified Rule Bases by Hybrid Learning (RBdAeS, TBL), pp. 879–886.
- PPDP-2000-Gramlich #preprocessor #proving #term rewriting #termination
- Simplifying termination proofs for rewrite systems by preprocessing (BG), pp. 139–150.
- ICSE-2000-Paralic #mobile #programming
- Contribution to simplifying the mobile agent programming (MP), pp. 716–718.
- ISSTA-2000-HildebrandtZ
- Simplifying failure-inducing input (RH, AZ), pp. 135–145.
- STOC-1999-HalesH #fourier #quantum
- Quantum Fourier Sampling Simplified (LH, SH), pp. 330–338.
- FLOPS-1999-Ohlebusch #on the #term rewriting
- On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems (EO), pp. 179–193.
- VLDB-1998-MiloZ #semistructured data #using
- Using Schema Matching to Simplify Heterogeneous Data Translation (TM, SZ), pp. 122–133.
- ICALP-1998-Touzet #term rewriting
- A Complex Example of a Simplifying Rewrite System (HT), pp. 507–517.
- CHI-1998-Johnson #game studies #interactive
- Simplifying the Controls of an Interactive Movie Game (JAJ), pp. 65–72.
- IFL-1997-HolyerS
- The Brisk Machine: A Simplified STG Machine (IH, ES), pp. 20–38.
- CHI-1997-GentnerLR #network
- Simplified Applications for Network Computers (DG, FL, CR), pp. 439–446.
- HCI-CC-1997-MillsC
- Simplified English for Computer Displays (JAM, BSC), pp. 133–136.
- ICSE-1997-SeiterLO #evolution #java #source code #tutorial
- Simplifying the Evolution of Java Programs (Tutorial) (LMS, KJL, DO), pp. 655–656.
- ICFP-1996-Pottier #constraints #type system
- Simplifying Subtyping Constraints (FP), pp. 122–133.
- ICML-1996-Burges
- Simplified Support Vector Decision Rules (CJCB), pp. 71–77.
- ICPR-1996-Zhao0C #image #segmentation
- Simplified Gaussian and mean curvatures to range image segmentation (CZ, DZ, YC), pp. 427–431.
- KDD-1996-Fahner #data mining #interactive #mining
- Data Mining with Sparse and Simplified Interaction Selection (GF), pp. 359–362.
- ICSE-1996-Reiss #design #development #integration
- Simplifying Data Integration: The Design of the Desert Software Development Environment (SPR), pp. 398–407.
- ICDAR-v2-1995-Baumann #graph grammar #music #recognition
- A simplified attributed graph grammar for high-level music recognition (SB), pp. 1080–1083.
- FPCA-1995-Jones
- Simplifying and Improving Qualified Types (MPJ), pp. 160–169.
- CHI-1995-Perkins #information management #network #online
- The Interchange Online Network: Simplifying Information Access (RP), pp. 558–565.
- DAC-1992-KimLS #graph #layout #modelling #using
- A New Hierarchical Layout Compactor Using Simplified Graph Models (WK, JL, HS), pp. 323–326.
- DAC-1989-MaoC #fault #testing
- A Simplified Six-waveform Type Method for Delay Fault Testing (WM, MDC), pp. 730–733.
- JICSCP-1988-CarlssonDO88 #approach #implementation
- A Simplified Approach to the Implementation of AND-Parallelism in an OR-Parallel Environment (MC, KJD, RAO), pp. 1565–1577.
- SIGMOD-1984-Chang #database #design #distributed #network #using
- Simplifying Distributed Database Systems Design by Using a Broadcast Network (JMC), pp. 223–233.
- VLDB-1983-Pilote #approach #design #modelling #user interface
- A Data Modeling Approach to Simplify the Design of User Interfaces (MP), pp. 290–301.
- DAC-1982-Peled #data type
- Simplified data structure for “mini-based” turnkey CAD systems (JP), pp. 636–642.
- CADE-1980-LovelandS
- Simplifying Interpreted Formulas (DWL, RES), pp. 97–109.
- POPL-1978-NelsonO #algorithm #performance
- A Simplifier Based on Efficient Decision Algorithms (CGN, DCO), pp. 141–150.
- VLDB-1977-KambayashiTY #relational
- A Relational Data Language with Simplified Binary Relation Handling Capability (YK, KT, SY), pp. 338–350.
- STOC-1974-GareyJS #problem
- Some Simplified NP-Complete Problems (MRG, DSJ, LJS), pp. 47–63.
- LISP-1963-Wooldridge #algebra #lisp
- An Algebraic Simplify Program in LISP (DW), p. 14.