Stem term$ (all stems)

675 papers:

HT-2015-ChungL #framework #predict

A Long-Term Study of a Crowdfunding Platform: Predicting Project Success and Fundraising Amount (JC, KL), pp. 211–220.

ESOP-2015-FetscherCPHF #automation #generative #random #type system

Making Random Judgments: Automatically Generating Well-Typed Terms from the Definition of a Type-System (BF, KC, MHP, JH, RBF), pp. 383–405.

SANER-2015-RahmanR #identification

TextRank based search term identification for software change tasks (MMR, CKR), pp. 540–544.

ICALP-v1-2015-Sanyal #bound #fourier

Near-Optimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity (SS), pp. 1035–1045.

CHI-2015-GerlingML #game studies #video

Long-Term Use of Motion-Based Video Games in Care Home Settings (KMG, RLM, CL), pp. 1573–1582.

CHI-2015-Odom #case study #comprehension #experience #interactive

Understanding Long-Term Interactions with a Slow Technology: an Investigation of Experiences with FutureMe (WO), pp. 575–584.

CHI-2015-SmeddinckHM #aspect-oriented #functional #game studies

Exergames for Physiotherapy and Rehabilitation: A Medium-term Situated Study of Motivational Aspects and Impact on Functional Reach (JDS, MH, RM), pp. 4143–4146.

LCT-2015-FardounAC15a #self #student

Construction of Educative Micro-Worlds to Build Students’ Creativity in Terms of Their Own Self-Learning (HMF, AAMAG, APC), pp. 349–360.

ICEIS-v1-2015-PfaffK #automation #benchmark #classification #documentation #identification #metric #natural language

Natural Language Processing Techniques for Document Classification in IT Benchmarking — Automated Identification of Domain Specific Terms (MP, HK), pp. 360–366.

ICEIS-v2-2015-McharfiADBK #product line #traceability

Return on Investment of Software Product Line Traceability in the Short, Mid and Long Term (ZM, BEA, ID, AB, AK), pp. 463–468.

ICEIS-v3-2015-PonsardM #architecture #case study #enterprise #lessons learnt

Driving the Adoption of Enterprise Architecture Inside Small Companies — Lessons Learnt from a Long Term Case Study (CP, AM), pp. 334–339.

ICML-2015-ZhuSG #memory management #recursion

Long Short-Term Memory Over Recursive Structures (XDZ, PS, HG), pp. 1604–1612.

KDD-2015-HohnholdOT

Focusing on the Long-term: It’s Good for Users and Business (HH, DO, DT), pp. 1849–1858.

KDD-2015-UlanovaYCJKZ #performance #physics #profiling

Efficient Long-Term Degradation Profiling in Time Series for Complex Physical Systems (LU, TY, HC, GJ, EJK, KZ), pp. 2167–2176.

RecSys-2015-JannachLJ #adaptation #evaluation #recommendation

Adaptation and Evaluation of Recommendations for Short-term Shopping Goals (DJ, LL, MJ), pp. 211–218.

SIGIR-2015-EickhoffVH #dependence #modelling

Modelling Term Dependence with Copulas (CE, APdV, TH), pp. 783–786.

SIGIR-2015-FarSBFH #on the

On Term Selection Techniques for Patent Prior Art Search (MGF, SS, MRB, GF, DH), pp. 803–806.

SIGIR-2015-LiomaSLH #dependence #information retrieval

Non-Compositional Term Dependence for Information Retrieval (CL, JGS, BL, NDH), pp. 595–604.

SIGIR-2015-LiuAH #information retrieval #probability #using

Using Term Location Information to Enhance Probabilistic Information Retrieval (BL, XA, JXH), pp. 883–886.

SIGIR-2015-ZhengC #distributed #learning

Learning to Reweight Terms with Distributed Representations (GZ, JC), pp. 575–584.

AMT-2015-HilkenBGV #development #modelling #using

Iterative Development of Transformation Models by Using Classifying Terms (FH, LB, MG, AV), pp. 1–6.

MoDELS-2015-GogollaVBH #model transformation #testing

Employing classifying terms for testing model transformations (MG, AV, LB, FH), pp. 312–321.

PPDP-2015-Tarau #combinator #on the #representation

On a uniform representation of combinators, arithmetic, λ terms and types (PT), pp. 244–255.

PADL-2015-Tarau #combinator #generative #logic programming #normalisation #on the #type inference

On Logic Programming Representations of λ Terms: de Bruijn Indices, Compression, Type Inference, Combinatorial Generation, Normalization (PT), pp. 115–131.

CADE-2015-JacquemardKS #bottom-up #constraints #term rewriting

Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies (FJ, YK, MS), pp. 137–151.

CADE-2015-ShintaniH #confluence #linear #named #term rewriting

CoLL: A Confluence Tool for Left-Linear Term Rewrite Systems (KS, NH), pp. 127–136.

ICLP-2015-Tarau #generative #on the

On Type-directed Generation of λ Terms (PT).

LICS-2015-CrubilleL #metric #reasoning

Metric Reasoning about ?-Terms: The Affine Case (RC, UDL), pp. 633–644.

RTA-2015-CirsteaLM #encoding #programmable #term rewriting

A faithful encoding of programmable strategies into term rewriting systems (HC, SL, PEM), pp. 74–88.

RTA-2015-Czajka #confluence #orthogonal #term rewriting

Confluence of nearly orthogonal infinitary term rewriting systems (LC), pp. 106–126.

RTA-2015-DasS #linear #logic #term rewriting

No complete linear term rewriting system for propositional logic (AD, LS), pp. 127–142.

TLCA-2015-FairweatherFST #dependent type

Dependent Types for Nominal Terms with Atom Substitutions (EF, MF, NS, AT), pp. 180–195.

TLCA-2015-HofmannM #analysis #multi #term rewriting

Multivariate Amortised Resource Analysis for Term Rewrite Systems (MH, GM), pp. 241–256.

FLOPS-2014-Parys #how #question

How Many Numbers Can a λ-Term Contain? (PP), pp. 302–318.

CHI-2014-FritzHMZ #case study #persuasion #process

Persuasive technology in the real world: a study of long-term use of activity sensing devices for fitness (TF, EMH, GCM, TZ), pp. 487–496.

CHI-2014-OdomSBKRSFZ #case study #design

Designing for slowness, anticipation and re-visitation: a long term field study of the photobox (WO, AS, RB, DSK, TR, MS, JF, JZ), pp. 1961–1970.

CHI-2014-UzorB #game studies

Investigating the long-term use of exergames in the home with elderly fallers (SU, LB), pp. 2813–2822.

HIMI-AS-2014-AbujaradSDP #online #safety

Management of On-Line Registries Information for Patient Safety in Long-Term Care (FA, SJS, TAD, LAP), pp. 307–316.

CIKM-2014-CarmelMPS #analysis #community #using

Improving Term Weighting for Community Question Answering Search Using Syntactic Analysis (DC, AM, YP, IS), pp. 351–360.

CIKM-2014-ChanDYTZ #classification #ranking #retrieval

Term Selection and Result Reranking for Question Retrieval by Exploiting Hierarchical Classification (WC, JD, WY, JT, XZ), pp. 141–150.

CIKM-2014-HustonC #comparison #dependence #modelling #retrieval #using

A Comparison of Retrieval Models using Term Dependencies (SH, WBC), pp. 111–120.

CIKM-2014-PaikO #fixpoint #query

A Fixed-Point Method for Weighting Terms in Verbose Informational Queries (JHP, DWO), pp. 131–140.

ECIR-2014-VerberneSK #query

Query Term Suggestion in Academic Search (SV, MS, WK), pp. 560–566.

ECIR-2014-WangL #realtime #statistics #twitter

The Impact of Future Term Statistics in Real-Time Tweet Search (YW, JL), pp. 567–572.

ECIR-2014-YangPSS #case study #e-commerce #query #scalability #using

A Study of Query Term Deletion Using Large-Scale E-commerce Search Logs (BY, NP, GS, NS), pp. 235–246.

ICPR-2014-KacheleZMS #feature model #quality #recognition #using

Prosodic, Spectral and Voice Quality Feature Selection Using a Long-Term Stopping Criterion for Audio-Based Emotion Recognition (MK, DZ, SM, FS), pp. 803–808.

KDD-2014-ChiaS #mining #predict #scalability

Scalable noise mining in long-term electrocardiographic time-series to predict death following heart attacks (CCC, ZS), pp. 125–134.

KDD-2014-YaoTXL #predict

Predicting long-term impact of CQA posts: a comprehensive viewpoint (YY, HT, FX, JL), pp. 1496–1505.

KDIR-2014-SourourL #information retrieval #query

Association Rules Between Terms Appreciated by EII for Query Expansion in IR (BRS, CL), pp. 381–387.

MLDM-2014-OtteLK #memory management #network #pattern matching #pattern recognition #problem #recognition

Investigating Long Short-Term Memory Networks for Various Pattern Recognition Problems (SO, ML, DK), pp. 484–497.

SEKE-2014-GayedLB #case study #forensics #lightweight #ontology #process #using

Creating Proprietary Terms Using Lightweight Ontology: A Case Study on Acquisition Phase in a Cyber Forensic Process (TFG, HL, MB), pp. 76–81.

SIGIR-2014-EugsterRSKBRJK #predict

Predicting term-relevance from brain signals (MJAE, TR, MMAS, IK, OB, NR, GJ, SK), pp. 425–434.

SIGIR-2014-Gupta #modelling

Modelling of terms across scripts through autoencoders (PG), p. 1279.

SIGIR-2014-JiangA #query

Necessary and frequent terms in queries (JJ, JA), pp. 1167–1170.

SIGIR-2014-PetriMC #hybrid

Score-safe term-dependency processing with hybrid indexes (MP, AM, JSC), pp. 899–902.

SIGIR-2014-YeH #effectiveness #feedback #pseudo

A simple term frequency transformation model for effective pseudo relevance feedback (ZY, JXH), pp. 323–332.

LOPSTR-2014-LucasMG #2d #dependence #framework #term rewriting

Extending the 2D Dependency Pair Framework for Conditional Term Rewriting Systems (SL, JM, RG), pp. 113–130.

LOPSTR-2014-MoralesH #prolog

Pre-indexed Terms for Prolog (JFM, MVH), pp. 317–331.

SLE-J-2012-SloaneR #attribute grammar #domain-specific language #profiling #term rewriting

Domain-specific program profiling and its application to attribute grammars and term rewriting (AMS, MR), pp. 488–510.

ASPLOS-2014-ArulrajJL #hardware #memory management

Leveraging the short-term memory of hardware to diagnose production-run software failures (JA, GJ, SL), pp. 207–222.

ICLP-J-2014-MantadelisRM #exclamation #induction

Tabling, Rational Terms, and Coinduction Finally Together! (TM, RR, PM), pp. 429–443.

RTA-TLCA-2014-AotoTU #confluence #diagrams #proving #term rewriting

Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams (TA, YT, KU), pp. 46–60.

RTA-TLCA-2014-LombardiRV #proving

Proof Terms for Infinitary Rewriting (CL, AR, RdV), pp. 303–318.

SMT-2014-BonichonDT #morphism #polymorphism

Extending SMT-LIB v2 with λ-Terms and Polymorphism (RB, DD, CT), pp. 53–62.

CASE-2013-ZhangPJST #energy #interface #monitoring #scalability #using

A secure and scalable telemonitoring system using ultra-low-energy wireless sensor interface for long-term monitoring in life science applications (WZ, PP, EJ, RS, KT), pp. 617–622.

DocEng-2013-HarinekS

Improving term extraction by utilizing user annotations (JH, MS), pp. 185–188.

DocEng-2013-YelogluMZ #clustering #concept #documentation #wiki

Beyond term clusters: assigning Wikipedia concepts to scientific documents (OY, EEM, ANZH), pp. 233–234.

DRR-2013-SchusterHME #documentation #how #rule-based

Rule-based versus training-based extraction of index terms from business documents: how to combine the results (DS, MH, KM, DE).

HT-2013-RuoccoR #image #proximity

Exploring temporal proximity and spatial distribution of terms in web-based search of event-related images (MR, HR), pp. 248–252.

ICPC-2013-BassettK #feature model #retrieval

Structural information based term weighting in text retrieval for feature location (BB, NAK), pp. 133–141.

MSR-2013-ShokripourAKZ #debugging #recommendation #why

Why so complicated? simple term filtering and weighting for location-based bug report assignment recommendation (RS, JA, ZMK, SZ), pp. 2–11.

PEPM-2013-CominiT #automation #equivalence #linear #named #term rewriting

TRSynth: a tool for automatic inference of term equivalence in left-linear term rewriting systems (MC, LT), pp. 67–70.

SAS-2013-Komondoor #abstract interpretation #imperative #precise #slicing #source code

Precise Slicing in Imperative Programs via Term-Rewriting and Abstract Interpretation (RK), pp. 259–282.

CHI-2013-LugerMR #complexity

Consent for all: revealing the hidden complexity of terms and conditions (EL, SM, TR), pp. 2687–2696.

CHI-2013-MollerKSRD #behaviour #self

Investigating self-reporting behavior in long-term studies (AM, MK, BS, LR, SD), pp. 2931–2940.

CHI-2013-OgonowskiLHWW #design

Designing for the living room: long-term user involvement in a living lab (CO, BL, JH, LW, VW), pp. 1539–1548.

DUXU-NTE-2013-AbujaradSDP #monitoring #safety

Rap Backs: Continuous Workforce Monitoring to Improve Patient Safety in Long-Term Care (FA, SJS, TAD, LAP), pp. 3–9.

DUXU-NTE-2013-StillwaterK #design #empirical #feedback #matter #multi

Design Matters: Mid-Term Results from a Multi-Design Fuel Economy Feedback Experiment (TS, KSK), pp. 578–584.

HCI-III-2013-KunoST

Long-Term Study of a Software Keyboard That Places Keys at Positions of Fingers and Their Surroundings (YK, BS, JT), pp. 72–81.

HCI-III-2013-NaganoHT #interactive

Developing Sophisticated Robot Reactions by Long-Term Human Interaction (HN, MH, MT), pp. 319–328.

CAiSE-2013-AgtK #automation #modelling #network #scalability #semantics

Automated Construction of a Large Semantic Network of Related Terms for Domain-Specific Modeling (HA, RDK), pp. 610–625.

EDOC-2013-GallegeGHR #contract #monitoring #trust #using

Trustworthy Service Selection Using Long-Term Monitoring of Trust Contracts (LSG, DG, JHH, RRR), pp. 195–200.

CIKM-2013-LiWZWW #probability #scalability #similarity

Computing term similarity by large probabilistic isA knowledge (PPL, HW, KQZ, ZW, XW), pp. 1401–1410.

CIKM-2013-SymondsZKBS #perspective #query

Term associations in query expansion: a structural linguistic perspective (MS, GZ, BK, PB, LS), pp. 1189–1192.

ECIR-2013-BolshakovaLN #modelling #topic

Topic Models Can Improve Domain Term Extraction (EIB, NVL, MN), pp. 684–687.

SIGIR-2013-DangC

Term level search result diversification (VD, WBC), pp. 603–612.

SIGIR-2013-LiLSLC #automation #novel #topic

A novel topic model for automatic term extraction (SL, JL, TS, WL, BC), pp. 885–888.

SIGIR-2013-LukeSM #framework #recommendation

A framework for specific term recommendation systems (TL, PS, PM), pp. 1093–1094.

SIGIR-2013-MaxwellC #query #topic #using

Compact query term selection using topically related text (KTM, WBC), pp. 583–592.

SIGIR-2013-SordoniNB #dependence #information retrieval #modelling #quantum

Modeling term dependencies with quantum language models for IR (AS, JYN, YB), pp. 653–662.

LOPSTR-2013-Vidal #erlang #term rewriting #towards #verification

Towards Erlang Verification by Term Rewriting (GV), pp. 109–126.

RE-2013-DwarakanathRS #automation #natural language #requirements #taxonomy

Automatic extraction of glossary terms from natural language requirements (AD, RRR, SS), pp. 314–319.

ESEC-FSE-2013-BraioneDP #execution #lazy evaluation #symbolic computation #term rewriting

Enhancing symbolic execution with built-in term rewriting and constrained lazy initialization (PB, GD, MP), pp. 411–421.

CSL-2013-BoudesHP

A characterization of the Taylor expansion of λ-terms (PB, FH, MP), pp. 101–115.

CSL-2013-Statman #normalisation

A New Type Assignment for Strongly Normalizable Terms (RS), pp. 634–652.

ICLP-J-2013-Tarau #prolog

Compact serialization of Prolog terms (with catalan skeletons, cantor tupling and Gödel numberings) (PT), pp. 847–861.

RTA-2013-Okada #multi #term rewriting

Husserl and Hilbert on Completeness and Husserl’s Term Rewrite-based Theory of Multiplicity (Invited Talk) (MO), pp. 4–19.

TLCA-2013-Clairambault #bound #linear #reduction

Bounding Skeletons, Locally Scoped Terms and Exact Bounds for Linear Head Reduction (PC), pp. 109–124.

VLDB-2012-LappasVGT #on the

On The Spatiotemporal Burstiness of Terms (TL, MRV, DG, VJT), pp. 836–847.

ITiCSE-2012-ShmalloRG #fuzzy #object-oriented

Fuzzy OOP: expanded and reduced term interpretations (RS, NR, DG), pp. 309–314.

ICSM-2012-WangLJ #collaboration #semantics #taxonomy

Inferring semantically related software terms and their taxonomy by leveraging collaborative tagging (SW, DL, LJ), pp. 604–607.

FLOPS-2012-Hamana #category theory #haskell

Correct Looping Arrows from Cyclic Terms — Traced Categorical Interpretation in Haskell (MH), pp. 136–150.

ICGT-2012-AotoK #confluence #decidability #term rewriting

Rational Term Rewriting Revisited: Decidability and Confluence (TA, JK), pp. 172–186.

CHI-2012-BaurBB #analysis #component #music #scalability

Listening factors: a large-scale principal components analysis of long-term music listening histories (DB, JB, AB), pp. 1273–1276.

CIKM-2012-QureshiOP #n-gram #using #wiki

Short-text domain specific key terms/phrases extraction using an n-gram model with wikipedia (MAQ, CO, GP), pp. 2515–2518.

CIKM-2012-WangZLL #categorisation #feature model

Feature selection based on term frequency and T-test for text categorization (DW, HZ, RL, WL), pp. 1482–1486.

CIKM-2012-YueJHH #analysis #collaboration #query #web

Where do the query terms come from?: an analysis of query reformulation in collaborative web search (ZY, JJ, SH, DH), pp. 2595–2598.

CIKM-2012-ZhangWH #integer #linear #programming #set

Selecting expansion terms as a set via integer linear programming (QZ, YW, XH), pp. 2399–2402.

ECIR-2012-FergusonOLPM #microblog #retrieval

An Investigation of Term Weighting Approaches for Microblog Retrieval (PF, NO, JL, OP, KM), pp. 552–555.

ECIR-2012-HollinkHV #query

Explaining Query Modifications — An Alternative Interpretation of Term Addition and Removal (VH, JH, APdV), pp. 1–12.

ECIR-2012-WuF

Relation Based Term Weighting Regularization (HW, HF), pp. 109–120.

ICPR-2012-FrinkenZBBFB #memory management #modelling #network #recognition

Long-short term memory neural networks language modeling for handwriting recognition (VF, FZM, SEB, MJCB, AF, HB), pp. 701–704.

ICPR-2012-WuW #classification #dependence

Term relevance dependency model for text classification (MSW, HMW), pp. 1064–1067.

KEOD-2012-MykowieckaM #clustering

Clustering of Medical Terms based on Morpho-syntactic Features (AM, MM), pp. 214–219.

SIGIR-2012-BenderskyC #dependence #higher-order #information retrieval #modelling #query #using

Modeling higher-order term dependencies in information retrieval using query hypergraphs (MB, WBC), pp. 941–950.

SIGIR-2012-BennettWCDBBC #behaviour #modelling #personalisation

Modeling the impact of short- and long-term behavior on search personalization (PNB, RWW, WC, STD, PB, FB, XC), pp. 185–194.

SIGIR-2012-Ko #case study #classification #using

A study of term weighting schemes using class information for text classification (YK), pp. 1029–1030.

SIGIR-2012-LimsopathamMMO #dependence

Exploiting term dependence while handling negation in medical search (NL, CM, RM, IO), pp. 1065–1066.

SIGIR-2012-LuCL #information retrieval

Fixed versus dynamic co-occurrence windows in TextRank term weights for information retrieval (WL, QC, CL), pp. 1079–1080.

SIGIR-2012-YangCZY #collaboration #mining

Collaborative filtering with short term preferences mining (DY, TC, WZ, YY), pp. 1043–1044.

SIGIR-2012-ZhaoC #automation #query

Automatic term mismatch diagnosis for selective query expansion (LZ, JC), pp. 515–524.

SIGIR-2012-ZhaoHW #information retrieval #probability

Rewarding term location information to enhance probabilistic information retrieval (JZ, JXH, SW), pp. 1137–1138.

LOPSTR-2012-GieslSSEF #evaluation #graph #logic programming #source code #symbolic computation #term rewriting

Symbolic Evaluation Graphs and Term Rewriting — A General Methodology for Analyzing Logic Programs (JG, TS, PSK, FE, CF), p. 1.

PPDP-2012-GieslSSEF #evaluation #graph #logic programming #source code #symbolic computation #term rewriting

Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs (JG, TS, PSK, FE, CF), pp. 1–12.

ICSE-2012-ZhouM #community #what

What make long term contributors: Willingness and opportunity in OSS community (MZ, AM), pp. 518–528.

SPLC-2012-TischerBMTAS #architecture #product line

Developing long-term stable product line architectures (CT, BB, AM, AT, RA, KS), pp. 86–95.

LICS-2012-Klop #term rewriting #λ-calculus

Term Rewriting and λ Calculus (JWK), p. 12.

RTA-2012-Al-HassaniMCS #problem #term rewriting

A Term Rewriting System for Kuratowski’s Closure-Complement Problem (OAH, QaM, CSC, VS), pp. 38–52.

RTA-2012-AndersenS #term rewriting

Term Rewriting Systems as Topological Dynamical Systems (SBA, JGS), pp. 53–68.

RTA-2012-Bahr #graph grammar

Infinitary Term Graph Rewriting is Simple, Sound and Complete (PB), pp. 69–84.

RTA-2012-CreusGG #unification

One-context Unification with STG-Compressed Terms is in NP (CC, AG, GG), pp. 149–164.

RTA-2012-Felgenhauer #confluence #polynomial #term rewriting

Deciding Confluence of Ground Term Rewrite Systems in Cubic Time (BF), pp. 165–175.

SAT-2012-AbalCHP #problem #term rewriting #using

Using Term Rewriting to Solve Bit-Vector Arithmetic Problems — (Poster Presentation) (IA, AC, JH, JSP), pp. 493–495.

CASE-2011-YonezawaKZIHSIYF #approach #experience #performance

Long-term operational experience with a robot cell production system controlled by low carbon-footprint Senju (thousand-handed) Kannon Model robots and an approach to improving operating efficiency (HY, HK, MZ, KI, NH, YS, MY, TF), pp. 291–298.

HT-2011-SimkoTB #game studies #network

Little search game: term network acquisition via a human computation game (JS, MT, MB), pp. 57–62.

FoSSaCS-2011-BernadetL #complexity #normalisation

Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types (AB, SL), pp. 88–107.

CSMR-2011-GieseckeFF #architecture #multi #tool support

Long-Term Software Architecture Management with Multi-technology Tool Support (SG, JF, MF), pp. 321–324.

CSMR-2011-SiddiqueM #clustering

Analyzing Term Weighting Schemes for Labeling Software Clusters (FS, OM), pp. 85–88.

WCRE-2011-NonnenSI #research #source code

Locating the Meaning of Terms in Source Code Research on “Term Introduction” (JN, DS, PI), pp. 99–108.

DLT-2011-Fujioka

Morphic Characterizations in Terms of Insertion Systems with a Context of Length One (KF), pp. 474–475.

CHI-2011-MorrisonVM #interactive

Building sensitising terms to understand free-play in open-ended interactive art environments (AJM, SV, PM), pp. 2335–2344.

DUXU-v1-2011-KashiwaseKKFYJ #mobile

Comparisons on Kansei Factors of Attractiveness between Initial and Long Term Use of Mobile Phone (NK, KK, HK, SF, MY, HJ), pp. 593–601.

DUXU-v1-2011-KisoKKYJF #mobile #usability

Clarification of Kansei Elements of Attractiveness Related to Usability for Long Term Mobile Phone Users (HK, NK, KK, MY, HJ, SF), pp. 602–610.

ICEIS-v2-2011-BadarudinSSMM #algorithm #memory management #problem #representation #search-based

An Improved Genetic Algorithm with Gene Value Representation and Short Term Memory for Shape Assignment Problem (IB, ABMS, MNS, AM, MTMM), pp. 178–183.

ICEIS-v4-2011-ZhouZ #case study #scalability

Study on the Long-term Incentive Mechanism of the Large-scale Dredging Project (BZ, ZZ), pp. 574–580.

CIKM-2011-CarmelUGMR #generative #word

Folksonomy-based term extraction for word cloud generation (DC, EU, IG, YM, HR), pp. 2437–2440.

CIKM-2011-FontouraGJV #encoding

Efficiently encoding term co-occurrences in inverted indexes (MF, MG, VJ, SV), pp. 307–316.

CIKM-2011-HuiHLW #statistics #using

Relevance weighting using within-document term statistics (KH, BH, TL, BW), pp. 99–104.

CIKM-2011-LvZ #bound #normalisation

Lower-bounding term frequency normalization (YL, CZ), pp. 7–16.

CIKM-2011-LvZ11a #adaptation #normalisation

Adaptive term frequency normalization for BM25 (YL, CZ), pp. 1985–1988.

CIKM-2011-MaLL #using

Selecting related terms in query-logs using two-stage SimRank (YM, HL, YL), pp. 1969–1972.

CIKM-2011-OkamotoWNC #information management

Annotating knowledge work lifelog: term extraction from sensor and operation history (MO, NW, SN, KC), pp. 2581–2584.

CIKM-2011-SeguelaS #hybrid #recommendation

A semi-supervised hybrid system to enhance the recommendation of channels in terms of campaign roi (JS, GS), pp. 2265–2268.

CIKM-2011-TariqK #feature model #performance

Fast supervised feature extraction by term discrimination information pooling (AT, AK), pp. 2233–2236.

CIKM-2011-VliegendhartLKP #network #peer-to-peer

A peer’s-eye view: network term clouds in a peer-to-peer system (RV, ML, CK, JAP), pp. 1909–1912.

ECIR-2011-PhelanMBS #recommendation #twitter #using

Terms of a Feather: Content-Based News Recommendation and Discovery Using Twitter (OP, KM, MB, BS), pp. 448–459.

ECIR-2011-ThotaC #statistics #testing

Within-Document Term-Based Index Pruning with Statistical Hypothesis Testing (SLT, BC), pp. 543–554.

KDD-2011-HongYGD #modelling #roadmap #topic

Tracking trends: incorporating term volume into temporal topic models (LH, DY, JG, BDD), pp. 484–492.

KDIR-2011-ClariziaCSGN #graph #novel #query

A Novel Query Expansion Technique based on a Mixed Graph of Terms (FC, FC, MDS, LG, PN), pp. 84–93.

KDIR-2011-PaliwalP #clustering #documentation #proximity

Utilizing Term Proximity based Features to Improve Text Document Clustering (SP, VP), pp. 537–544.

KEOD-2011-SuzukiF #classification #documentation #multi #using

Multi-labeled Patent Document Classification using Technical Term Thesaurus (YS, FF), pp. 425–428.

KMIS-2011-UrdzikovaJ #research

Complaints Management in Terms of Business Practice in Slovakia — Research Results (JU, MJ), pp. 302–305.

SIGIR-2011-SongZXLL #query #ranking

Query term ranking based on search results overlap (WS, YZ, YX, TL, SL), pp. 1253–1254.

SIGIR-2011-WhitingMJ #feedback #pseudo

Exploring term temporality for pseudo-relevance feedback (SW, YM, JMJ), pp. 1245–1246.

SIGIR-2011-ZhaoHH #information retrieval #named #probability #using

CRTER: using cross terms to enhance probabilistic information retrieval (JZ, JXH, BH), pp. 155–164.

SAC-2011-SasakiOWKIH #web

Extracting preference terms from web browsing histories excluding pages unrelated to users’ interests (KS, MO, NW, MK, TI, MH), pp. 823–824.

ICSE-2011-Sultanov #documentation #proximity #requirements

Requirements tracing: discovering related documents through artificial pheromones and term proximity (HS), pp. 1173–1175.

ISMM-2011-AignerHKLSSU #memory management #self

Short-term memory for self-collecting mutators (MA, AH, CMK, ML, AS, SS, AU), pp. 99–108.

CADE-2011-NoschinskiEG #analysis #complexity #dependence #framework #term rewriting

A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems (LN, FE, JG), pp. 422–438.

ICTSS-2011-MeinkeN #term rewriting #testing #using

Learning-Based Testing for Reactive Systems Using Term Rewriting Technology (KM, FN), pp. 97–114.

RTA-2011-AotoT #confluence #proving #term rewriting

A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems (TA, YT), pp. 91–106.

RTA-2011-Bahr #convergence #graph grammar

Modes of Convergence for Term Graph Rewriting (PB), pp. 139–154.

RTA-2011-BrockschmidtOG #bytecode #composition #java #proving #recursion #source code #term rewriting #termination

Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting (MB, CO, JG), pp. 155–170.

RTA-2011-GasconMR #first-order #unification

First-Order Unification on Compressed Terms (AG, SM, LR), pp. 51–60.

RTA-2011-GrathwohlKPS #graph #named #reduction #term rewriting #visualisation #λ-calculus

Anagopos: A Reduction Graph Visualizer for Term Rewriting and λ Calculus (NBBG, JK, JDP, JGS), pp. 61–70.

RTA-2011-KutsiaLV

Anti-Unification for Unranked Terms and Hedges (TK, JL, MV), pp. 219–234.

RTA-2011-NeurauterM #matrix #proving #term rewriting #termination

Revisiting Matrix Interpretations for Proving Termination of Term Rewriting (FN, AM), pp. 251–266.

RTA-2011-NishidaSS #term rewriting

Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity (NN, MS, TS), pp. 267–282.

RTA-2011-Tison #automaton #constraints #question #similarity #term rewriting #what

Tree Automata, (Dis-)Equality Constraints and Term Rewriting: What’s New? (ST), pp. 1–2.

TLCA-2011-Tison #automaton #constraints #question #similarity #term rewriting #what

Tree Automata, (Dis-)Equality Constraints and Term Rewriting — What’s New? (ST), pp. 3–5.

DocEng-2010-NunesRD #collaboration

Term frequency dynamics in collaborative articles (SN, CR, GD), pp. 267–270.

FLOPS-2010-KetemaS #bound #diagrams #term rewriting #λ-calculus

Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus (JK, JGS), pp. 272–287.

FLOPS-2010-NishidaS #injection #proving #term rewriting

Proving Injectivity of Functions via Program Inversion in Term Rewriting (NN, MS), pp. 288–303.

ICFP-2010-StampoulisS #logic #named

VeriML: typed computation of logical terms inside a language with effects (AS, ZS), pp. 333–344.

ICEIS-DISI-2010-KasprzakBCO #effectiveness #enterprise #scalability #using

Access Rights in Enterprise Full-text Search — Searching Large Intranets Effectively using Virtual Terms (JK, MB, MC, TO), pp. 32–39.

CIKM-2010-AjiWAG #analysis #modelling #using

Using the past to score the present: extending term weighting models through revision history analysis (AA, YW, EA, EG), pp. 629–638.

CIKM-2010-MadaniY #analysis #topic

Discovery of numerous specific topics via term co-occurrence analysis (OM, JY), pp. 1841–1844.

CIKM-2010-MingCC

Exploring domain-specific term weight in archived question search (ZM, TSC, GC), pp. 1605–1608.

CIKM-2010-ShiN #dependence #using

Using various term dependencies according to their utilities (LS, JYN), pp. 1493–1496.

CIKM-2010-WhiteBD #predict #using

Predicting short-term interests using activity-based search context (RWW, PNB, STD), pp. 1009–1018.

CIKM-2010-YanSZSW #performance #proximity

Efficient term proximity search with term-pair indexes (HY, SS, FZ, TS, JRW), pp. 1229–1238.

CIKM-2010-ZhaoC #predict

Term necessity prediction (LZ, JC), pp. 259–268.

ECIR-2010-MullerG #semantics

Semantically Enhanced Term Frequency (CM, IG), pp. 598–601.

ECIR-2010-SahibTR #elicitation #interactive #query

Enabling Interactive Query Expansion through Eliciting the Potential Effect of Expansion Terms (NGS, AT, IR), pp. 532–543.

ECIR-2010-ZhangWCL #documentation

Laplacian Co-hashing of Terms and Documents (DZ, JW, DC, JL), pp. 577–580.

ECIR-2010-ZhengF #information retrieval #query

Query Aspect Based Term Weighting Regularization in Information Retrieval (WZ, HF), pp. 344–356.

ICPR-2010-SeppkeDH #detection #energy #image #symmetry #using

Using Snakes with Asymmetric Energy Terms for the Detection of Varying-Contrast Edges in SAR Images (BS, LSDF, NH), pp. 2792–2795.

KDD-2010-XiangYZCZYS #graph #recommendation

Temporal recommendation on graphs via long- and short-term preference fusion (LX, QY, SZ, LC, XZ, QY, JS), pp. 723–732.

KDIR-2010-Schoneberg #classification #evaluation

Context Vector Classification — Term Classification with Context Evaluation (HS), pp. 387–391.

KDIR-2010-ThanhYU #clustering #documentation #scalability #set #similarity

Clustering Documents with Large Overlap of Terms into Different Clusters based on Similarity Rough Set Model (NCT, KY, MU), pp. 396–399.

KDIR-2010-ZhangSF #random

Conditional Random Fields for Term Extraction (XZ, YS, ACF), pp. 414–417.

KMIS-2010-ChakrabortyZ #approach #process #towards

A Systematic Approach Towards Collection, Processing & Distribution of Information about Competitor Activities & Customer Needs in Terms of Products & Services (SC, MZ), pp. 348–353.

SEKE-2010-MarcaciniR #clustering #incremental #topic #using

Incremental Construction of Topic Hierarchies using Hierarchical Term Clustering (RMM, SOR), p. 553.

SIGIR-2010-ParkC #dependence #parsing #query #ranking

Query term ranking based on dependency parsing of verbose queries (JHP, WBC), pp. 829–830.

SIGIR-2010-SvoreKK #how #proximity #retrieval #web

How good is a span of terms?: exploiting proximity to improve web retrieval (KMS, PHK, NK), pp. 154–161.

SIGIR-2010-WangH #distance #effectiveness #metric #query #similarity

Effective query expansion with the resistance distance based term similarity metric (SW, MH), pp. 715–716.

SIGIR-2010-WooLLSR #ranking #retrieval #using

Achieving high accuracy retrieval using intra-document term ranking (HWW, JTL, SWL, YIS, HCR), pp. 885–886.

MoDELS-v2-2010-GerthKLE #detection #precise #process #using

Precise Detection of Conflicting Change Operations Using Process Model Terms (CG, JMK, ML, GE), pp. 93–107.

SAC-2010-MatteoPTV #algorithm #ambiguity #clustering #folksonomy

Of mice and terms: clustering algorithms on ambiguous terms in folksonomies (NRDM, SP, FT, FV), pp. 844–848.

ICSE-2010-Herzig #impact analysis

Capturing the long-term impact of changes (KSH), pp. 393–396.

HPDC-2010-BuiWHWFT #empirical #quality #scalability #towards

Towards long term data quality in a large scale biometrics experiment (HB, DW, CH, RW, PJF, DT), pp. 565–572.

CSL-2010-Hetzl #calculus #representation

A Sequent Calculus with Implicit Term Representation (SH), pp. 351–365.

IJCAR-2010-BensaidCP #graph #integer

Perfect Discrimination Graphs: Indexing Terms with Integer Exponents (HB, RC, NP), pp. 369–383.

LICS-2010-Ehrhard

A Finiteness Structure on Resource Terms (TE), pp. 402–410.

RTA-2010-Bahr10a #partial order #term rewriting

Partial Order Infinitary Term Rewriting and Böhm Trees (PB), pp. 67–84.

RTA-2010-DurandSS #bound #linear #term rewriting #termination

Termination of linear bounded term rewriting systems (ID, GS, MS), pp. 341–356.

RTA-2010-OttoBEG #analysis #automation #bytecode #java #term rewriting #termination

Automated Termination Analysis of Java Bytecode by Term Rewriting (CO, MB, CvE, JG), pp. 259–276.

ITiCSE-2009-HabermanY #development #self #student

Long-term software projects development: the affect of students’ self-appreciation and initial expectations (BH, CY), p. 363.

ITiCSE-2009-Lasserre #adaptation #learning #programming

Adaptation of team-based learning on a first term programming class (PL), pp. 186–190.

HCD-2009-MarcengoGR #design #effectiveness #research

Personas Layering: A Cost Effective Model for Service Design in Medium-Long Term Telco Research Projects (AM, EG, AR), pp. 256–265.

HCD-2009-SimoesP #adaptation

Older Drivers and New In-Vehicle Technologies: Adaptation and Long-Term Effects (AS, MP), pp. 552–561.

CAiSE-2009-KaiyaTSSK #analysis #quality #requirements #using

Spectrum Analysis for Quality Requirements by Using a Term-Characteristics Map (HK, MT, SS, TS, KK), pp. 546–560.

ICEIS-AIDSS-2009-RoperoGLC #fuzzy #information management #logic #novel #web

Term Weighting: Novel Fuzzy Logic based Method Vs. Classical TF-IDF Method for Web Information Extraction (JR, AG, CL, AC), pp. 130–137.

CIKM-2009-BatalH #classification #using

Boosting KNN text classification accuracy by using supervised term weighting schemes (IB, MH), pp. 2041–2044.

CIKM-2009-LeeCKC #approach #dependence #query #ranking

A term dependency-based approach for query terms ranking (CJL, RCC, SHK, PJC), pp. 1267–1276.

CIKM-2009-ShenWCSYCL #classification

Exploiting term relationship to boost text classification (DS, JW, BC, JTS, QY, ZC, YL), pp. 1637–1640.

ECIR-2009-KleinN #correlation #documentation #n-gram

Correlation of Term Count and Document Frequency for Google N-Grams (MK, MLN), pp. 620–627.

ECIR-2009-LiomaB #information retrieval #speech

Part of Speech Based Term Weighting for Information Retrieval (CL, RB), pp. 412–423.

ECIR-2009-UdupaSBB #information retrieval #mining #query #quote

“They Are Out There, If You Know Where to Look”: Mining Transliterations of OOV Query Terms for Cross-Language Information Retrieval (RU, KS, AB, AB), pp. 437–448.

KDD-2009-JiYLZKY #interactive #using

Drosophila gene expression pattern annotation using sparse features and term-term interactions (SJ, LY, YXL, ZHZ, SK, JY), pp. 407–416.

KDIR-2009-SaneifarBLPR #mining

Mining for Relevant Terms from Log Files (HS, SB, AL, PP, MR), pp. 77–84.

SEKE-2009-XuZW #network #predict

Long-term Prediction of Wireless Network Traffic (ZX, ZZ, WW), pp. 473–479.

SIGIR-2009-AshkanC #analysis

Term-based commercial intent analysis (AA, CLAC), pp. 800–801.

SIGIR-2009-CanCGJKRRSSUW #detection #web

Web derived pronunciations for spoken term detection (DC, EC, AG, MJ, SK, BR, MR, MS, AS, MU, CMW), pp. 83–90.

SIGIR-2009-CumminsO #framework #information retrieval #learning #proximity

Learning in a pairwise term-term proximity framework for information retrieval (RC, CO), pp. 251–258.

SIGIR-2009-KellyGB #comparison #interactive #query

A comparison of query and term suggestion features for interactive searching (DK, KG, EWB), pp. 371–378.

SIGIR-2009-LeeLP #reduction #similarity #using

Tag-based object similarity computation using term space dimension reduction (YKL, SJL, JP), pp. 790–791.

SIGIR-2009-YanDS #web

Compressing term positions in web indexes (HY, SD, TS), pp. 147–154.

PPDP-2009-FeltyM #hybrid #reasoning

Reasoning with hypothetical judgments and open terms in hybrid (APF, AM), pp. 83–92.

SAC-2009-SchwartzHL #visualisation

Term distribution visualizations with Focus+Context (MS, CH, LML), pp. 1792–1799.

CADE-2009-BensaidCP #integer #named #proving #theorem proving

Dei: A Theorem Prover for Terms with Integer Exponents (HB, RC, NP), pp. 146–150.

CADE-2009-FalkeK #analysis #approach #automation #imperative #source code #term rewriting #termination

A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs (SF, DK), pp. 277–293.

CSL-2009-EndrullisGZ #term rewriting

Degrees of Undecidability in Term Rewriting (JE, HG, HZ), pp. 255–270.

ICLP-2009-CostaRR #logic programming #source code

A Term-Based Global Trie for Tabled Logic Programs (JC, JR, RR), pp. 205–219.

ICLP-2009-KoninckDS #normalisation #term rewriting

Demand-Driven Normalisation for ACD Term Rewriting (LDK, GJD, PJS), pp. 484–488.

LICS-2009-Lataillade #system f

Dinatural Terms in System F (JDL), pp. 267–276.

RTA-2009-AotoYT #automation #confluence #proving #term rewriting

Proving Confluence of Term Rewriting Systems Automatically (TA, JY, YT), pp. 93–102.

RTA-2009-DuvalEP #approach #category theory #graph transformation

A Heterogeneous Pushout Approach to Term-Graph Transformation (DD, RE, FP), pp. 194–208.

RTA-2009-FuhsGPSF #integer #proving #term rewriting #termination

Proving Termination of Integer Term Rewriting (CF, JG, MP, PSK, SF), pp. 32–47.

SAT-2009-KimSJ #modulo theories #performance #satisfiability

Efficient Term-ITE Conversion for Satisfiability Modulo Theories (HK, FS, HJ), pp. 195–208.

TLCA-2009-FujitaS #type system

Existential Type Systems with No Types in Terms (KeF, AS), pp. 112–126.

DRR-2008-KimLT #approach #hybrid #identification #statistics

Hybrid approach combining contextual and statistical information for identifying MEDLINE citation terms (ICK, DXL, GRT), p. 68150.

CSMR-2008-KanellopoulosTHV #clustering #maintenance #source code

Interpretation of Source Code Clusters in Terms of the ISO/IEC-9126 Maintainability Characteristics (YK, CT, IH, JV), pp. 63–72.

ICPC-2008-HaiducM #on the #source code

On the Use of Domain Terms in Source Code (SH, AM), pp. 113–122.

FLOPS-2008-Tatsuta #normalisation

Types for Hereditary Head Normalizing Terms (MT), pp. 195–209.

ICGT-2008-Echahed #graph grammar #term rewriting

Inductively Sequential Term-Graph Rewrite Systems (RE), pp. 84–98.

CIKM-2008-WangZ #effectiveness #mining #query

Mining term association patterns from search logs for effective query reformulation (XW, CZ), pp. 479–488.

ECIR-2008-AmatiABGG #ad hoc #automation #retrieval

Automatic Construction of an Opinion-Term Vocabulary for Ad Hoc Retrieval (GA, EA, MB, CG, GG), pp. 89–100.

ECIR-2008-LangWJLX #ad hoc #analysis #dependence #evaluation #retrieval

An Evaluation and Analysis of Incorporating Term Dependency for Ad-Hoc Retrieval (HL, BW, GJFJ, JL, YX), pp. 602–606.

ECIR-2008-NaKL #documentation #modelling #multi #normalisation #topic

Improving Term Frequency Normalization for Multi-topical Documents and Application to Language Modeling Approaches (SHN, ISK, JHL), pp. 382–393.

ECIR-2008-RitchieTR #information retrieval #using

Using Terms from Citations for IR: Some First Results (AR, ST, SR), pp. 211–221.

ECIR-2008-SongTWHY #perspective #proximity

Viewing Term Proximity from a Different Perspective (RS, MJT, JRW, HWH, YY), pp. 346–357.

KDD-2008-ChengT #learning

Semi-supervised learning with data calibration for long-term time series forecasting (HC, PNT), pp. 133–141.

SIGIR-2008-CaoNGR #feedback #pseudo

Selecting good expansion terms for pseudo-relevance feedback (GC, JYN, JG, SR), pp. 243–250.

SIGIR-2008-TsagiasLR #speech

Term clouds as surrogates for user generated speech (MT, ML, MdR), pp. 773–774.

SIGIR-2008-XuDW #dependence #semantics

Utilizing phrase based semantic information for term dependency (YX, FD, BW), pp. 855–856.

SAC-2008-AssisLSG #crawling

The impact of term selection in genre-aware focused crawling (GTdA, AHFL, ASdS, MAG), pp. 1158–1163.

ICLP-2008-DuckKS #implementation #named #term rewriting

Cadmium: An Implementation of ACD Term Rewriting (GJD, LDK, PJS), pp. 531–545.

LICS-2008-GasconGS

Context Matching for Compressed Terms (AG, GG, MSS), pp. 93–102.

RTA-2008-BallandM #graph grammar

Term-Graph Rewriting Via Explicit Paths (EB, PEM), pp. 32–47.

RTA-2008-KojimaS #decidability #linear #reachability #term rewriting

Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems (YK, MS), pp. 187–201.

RTA-2008-Zantema #infinity #normalisation

Normalization of Infinite Terms (HZ), pp. 441–455.

CASE-2007-HablaDMPE

A Short-Term Forecast Method for Demand Quantities in Semiconductor Manufacturing (CH, RD, LM, TP, HE), pp. 94–99.

CASE-2007-RabindranT #parallel

Study of the dynamic coupling term (μ) in parallel force/velocity actuated systems (DR, DT), pp. 418–423.

FASE-2007-RatzingerPG #evolution #fault #named #predict

EQ-Mine: Predicting Short-Term Defects for Software Evolution (JR, MP, HCG), pp. 12–26.

AGTIVE-2007-MolEP #proving #reduction

A Single-Step Term-Graph Reduction System for Proof Assistants (MdM, MCJDvE, RP), pp. 184–200.

CHI-2007-ObendorfWHM #web

Web page revisitation revisited: implications of a long-term click-stream study of browser usage (HO, HW, EH, MM), pp. 597–606.

HCI-IDU-2007-AndoK #approach #concept #research #towards #usability

Long Term Usability; Its Concept and Research Approach — The Origin of the Positive Feeling Toward the Product (MA, MK), pp. 393–396.

HIMI-IIE-2007-WangCH #memory management #using

Using Long Term Memory for Bookmark Management (MJW, KMC, TKH), pp. 812–820.

ICEIS-DISI-2007-DangelmaierRHBKDT #information management #named #reliability

OOPUS — a production planning information system to assure high delivery reliability under short-term demand changes and production disturbances (WD, TR, TH, DB, DK, AD, TT), pp. 423–432.

ICEIS-HCI-2007-MelguizoBDBB #memory management #recommendation #what

What a Proactive Recommendation System Needs — Relevance, Non-Intrusiveness, and a New Long-Term Memory (MCPM, TB, AD, LB, AvdB), pp. 86–91.

CIKM-2007-PragerLC #comparison #framework

Type nanotheories: a framework for term comparison (JMP, SL, JCC), pp. 701–710.

CIKM-2007-ZhuSLW #documentation #effectiveness

Effective top-k computation in retrieving structured documents with term-proximity support (MZ, SS, ML, JRW), pp. 771–780.

ECIR-2007-BlancoB

Static Pruning of Terms in Inverted Files (RB, AB), pp. 64–75.

ECIR-2007-DalmauF #approach #clustering

Experimental Results of the Signal Processing Approach to Distributional Clustering of Terms on Reuters-21578 Collection (MCD, ÓWMF), pp. 678–681.

ECIR-2007-HuurninkR #query #retrieval #video

Term Selection and Query Operations for Video Retrieval (BH, MdR), pp. 708–711.

ECIR-2007-Monz #learning #query

Model Tree Learning for Query Term Weighting in Question Answering (CM), pp. 589–596.

ECIR-2007-WeiC #ad hoc #framework #modelling #performance #retrieval

Modeling Term Associations for Ad-Hoc Retrieval Performance Within Language Modeling Framework (XW, WBC), pp. 52–63.

SEKE-2007-SabucedoA #semantics

Semantic Support to Reformulate Public Services in Terms of Life Events (LÁS, LEAR), pp. 632–636.

SIGIR-2007-BlancoL #information retrieval #random

Random walk term weighting for information retrieval (RB, CL), pp. 829–830.

SIGIR-2007-CustisA #approach #query

A new approach for evaluating query expansion: query-document term mismatch (TC, KAK), pp. 575–582.

SIGIR-2007-MamouRS #detection #independence

Vocabulary independent spoken term detection (JM, BR, OS), pp. 615–622.

SIGIR-2007-PengMHPO #dependence #framework

Incorporating term dependency in the dfr framework (JP, CM, BH, VP, IO), pp. 843–844.

SIGIR-2007-TanVFZ #feedback #information retrieval #modelling

Term feedback for information retrieval with language models (BT, AV, HF, CZ), pp. 263–270.

SIGIR-2007-TroyZ #rank

Enhancing relevance scoring with chronological term rank (ADT, GQZ), pp. 599–606.

SIGIR-2007-WiegandLK

Combining term-based and event-based matching for question answering (MW, JLL, DK), pp. 715–716.

RE-2007-LehtolaKV

Strengthening the link between business decisions and RE: Long-term product planning in software product companies (LL, MK, JV), pp. 153–162.

CADE-2007-GodoyT #normalisation #on the #term rewriting

On the Normalization and Unique Normalization Properties of Term Rewrite Systems (GG, ST), pp. 247–262.

RTA-2007-GodoyH #decidability #term rewriting

Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems (GG, EH), pp. 184–199.

RTA-2007-Vaux #linear #on the

On Linear Combinations of λ-Terms (LV), pp. 374–388.

DATE-2006-HosangadiFK #optimisation #using

Optimizing high speed arithmetic circuits using three-term extraction (AH, FF, RK), pp. 1294–1299.

ICSM-2006-Kajko-MattssonLSNCHNS #agile #lifecycle

Long-term Life Cycle Impact of Agile Methodologies (MKM, GAL, DS, TN, NC, MH, JN, HS), pp. 422–425.

SCAM-2006-WalensteinMCL #normalisation #term rewriting #using

Normalizing Metamorphic Malware Using Term Rewriting (AW, RM, MRC, AL), pp. 75–84.

CIKM-2006-EguchiC #dependence #performance #query

Boosting relevance model performance with query term dependence (KE, WBC), pp. 792–793.

CIKM-2006-PickensM #information retrieval #modelling

Term context models for information retrieval (JP, AM), pp. 559–566.

ECIR-2006-Ernst-GerlachF #generative

Generating Search Term Variants for Text Collections with Historic Spellings (AEG, NF), pp. 49–60.

ECIR-2006-KarbasiB #documentation #effectiveness #normalisation #scalability #using

Document Length Normalization Using Effective Level of Term Frequency in Large Collections (SK, MB), pp. 72–83.

ECIR-2006-ZhangDC #detection

Combining Short and Long Term Audio Features for TV Sports Highlight Detection (BZ, WD, LC), pp. 472–475.

ICPR-v1-2006-Morita #3d #image #memory management

Three Dimensional Short-term Memory Image (SM), pp. 1226–1230.

KDD-2006-TanSZ #mining

Mining long-term search history to improve search accuracy (BT, XS, CZ), pp. 718–723.

SIGIR-2006-ButtcherCL06a #ad hoc #proximity #retrieval #scalability

Term proximity scoring for ad-hoc retrieval on very large text collections (SB, CLAC, BL), pp. 621–622.

SIGIR-2006-FangZ #axiom #information retrieval #semantics

Semantic term matching in axiomatic approaches to information retrieval (HF, CZ), pp. 115–122.

SIGIR-2006-FuK #query

Evaluating sources of query expansion terms (XF, DK), pp. 647–648.

SIGIR-2006-KellyF #elicitation #feedback

Elicitation of term relevance feedback: an investigation of term source and context (DK, XF), pp. 453–460.

SIGIR-2006-MoffatWZ #parallel #retrieval

Load balancing for term-distributed parallel retrieval (AM, WW, JZ), pp. 348–355.

LOPSTR-2006-Payet #detection #term rewriting #using

Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator (ÉP), pp. 194–209.

LOPSTR-2006-Schneider-KampGST #analysis #automation #logic programming #source code #term rewriting #termination

Automated Termination Analysis for Logic Programs by Term Rewriting (PSK, JG, AS, RT), pp. 177–193.

PPDP-2006-CaferraEP

Rewriting term-graphs with priority (RC, RE, NP), pp. 109–120.

SAC-2006-SchultS #persistent #taxonomy

Expanding the taxonomies of bibliographic archives with persistent long-term themes (RS, MS), pp. 627–634.

CSL-2006-Aehlig #automaton #finite #infinity #semantics

A Finite Semantics of Simply-Typed λ Terms for Infinite Runs of Automata (KA), pp. 104–118.

CSL-2006-AtassiBT #logic #system f #verification

Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic (VA, PB, KT), pp. 150–166.

ICLP-2006-DuckSB #term rewriting

ACD Term Rewriting (GJD, PJS, SB), pp. 117–131.

IJCAR-2006-EndrullisWZ #matrix #proving #term rewriting #termination

Matrix Interpretations for Proving Termination of Term Rewriting (JE, JW, HZ), pp. 574–588.

LICS-2006-TatsutaD #difference #normalisation

Normalisation is Insensible to λ-Term Identity or Difference (MT, MDC), pp. 327–338.

RTA-2006-ChibaA #named #program transformation #term rewriting

RAPT: A Program Transformation System Based on Term Rewriting (YC, TA), pp. 267–276.

RTA-2006-GieslSST #analysis #automation #haskell #programming language #term rewriting #termination

Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages (JG, SS, PSK, RT), pp. 297–312.

FoSSaCS-2005-Kaiser #confluence #decidability #term rewriting

Confluence of Right Ground Term Rewriting Systems Is Decidable (LK), pp. 470–489.

ICALP-2005-BaldamusPV #encoding #π-calculus

A Fully Abstract Encoding of the π-Calculus with Data Terms (MB, JP, BV), pp. 1202–1213.

FM-2005-AlvesSVO #sql #term rewriting

Strategic Term Rewriting and Its Application to a VDMSL to SQL Conversion (TLA, PFS, JV, JNO), pp. 399–414.

ICEIS-v1-2005-FeiTALBN #framework #grid #library #named

ARCO: A Long-term Digital Library Storage System Based on Grid Computational Infrastructure (HF, PT, NA, ML, JLB, JN), pp. 44–51.

CIKM-2005-BaiSBNC #information retrieval #modelling #query #using

Query expansion using term relationships in language models for information retrieval (JB, DS, PB, JYN, GC), pp. 688–695.

CIKM-2005-CumminsO #evaluation #information retrieval

An evaluation of evolved term-weighting schemes in information retrieval (RC, CO), pp. 305–306.

CIKM-2005-EsuliS #classification #semantics

Determining the semantic orientation of terms through gloss classification (AE, FS), pp. 617–624.

CIKM-2005-MiaoKM #clustering #comparative #documentation #evaluation #n-gram #using

Document clustering using character N-grams: a comparative evaluation with term-based and word-based clustering (YM, VK, EEM), pp. 357–358.

ECIR-2005-HeO #modelling #normalisation

Term Frequency Normalisation Tuning for BM25 and DFR Models (BH, IO), pp. 200–214.

ECIR-2005-YangJZY #documentation #effectiveness #retrieval #using

Improving Retrieval Effectiveness by Using Key Terms in Top Retrieved Documents (LY, DHJ, GZ, NY), pp. 169–184.

ICML-2005-JinCS #information retrieval #using

Learn to weight terms in information retrieval using category information (RJ, JYC, LS), pp. 353–360.

KDD-2005-PowersGC #enterprise #performance

Short term performance forecasting in enterprise systems (RP, MG, IC), pp. 801–807.

SIGIR-2005-AnhM #similarity #using

Simplified similarity scoring using term ranks (VNA, AM), pp. 226–233.

SIGIR-2005-HeO #case study #normalisation

A study of the dirichlet priors for term frequency normalisation (BH, IO), pp. 465–471.

SIGIR-2005-KellyDF #independence #query

The loquacious user: a document-independent source of terms for query expansion (DK, VDD, XF), pp. 457–464.

SIGIR-2005-LiangDT #order #query #summary #using

Using query term order for result summarisation (SFL, SD, JT), pp. 629–630.

SIGIR-2005-LinM #feedback #independence

Assessing the term independence assumption in blind relevance feedback (JJL, GCM), pp. 635–636.

SIGIR-2005-MetzlerC #dependence #markov #random

A Markov random field model for term dependencies (DM, WBC), pp. 472–479.

SIGIR-2005-RennieJ #detection #using

Using term informativeness for named entity detection (JDMR, TSJ), pp. 353–360.

SIGIR-2005-ZhangCJ #feedback #image #interactive #retrieval

User term feedback in interactive text-based image retrieval (CZ, JYC, RJ), pp. 51–58.

SIGIR-2005-ZhangHV #mining #query #web

Mining translations of OOV terms from the web through cross-lingual query expansion (YZ, FH, SV), pp. 669–670.

PPDP-2005-ChibaAT #program transformation #term rewriting

Program transformation by templates based on term rewriting (YC, TA, YT), pp. 59–69.

RE-2005-LehtolaKK #requirements

Linking the Business View to Requirements Engineering: Long-Term Product Planning by Roadmapping (LL, MK, SK), pp. 439–446.

SAC-2005-BeigbederM #fuzzy #information retrieval #proximity #using

An information retrieval model using the fuzzy proximity degree of term occurences (MB, AM), pp. 1018–1022.

SAC-2005-SunZ #approach #semantics

An approach to acquire semantic relationships between terms (XS, QZ), pp. 1630–1633.

CSL-2005-KhoussainovR #algebra #decidability

Decidability of Term Algebras Extending Partial Algebras (BK, SR), pp. 292–308.

RTA-2005-AotoY #dependence #term rewriting

Dependency Pairs for Simply Typed Term Rewriting (TA, TY), pp. 120–134.

RTA-2005-EscobarMT #term rewriting

Natural Narrowing for General Term Rewriting Systems (SE, JM, PT), pp. 279–293.

RTA-2005-GeserHWZ #automaton #linear #on the #term rewriting #termination

On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems (AG, DH, JW, HZ), pp. 353–367.

RTA-2005-NishidaSS #term rewriting

Partial Inversion of Constructor Term Rewriting Systems (NN, MS, TS), pp. 264–278.

RTA-2005-Toyama #confluence #term rewriting

Confluent Term Rewriting Systems (YT), p. 1.

CSEET-2004-McKimE #design #education #multi #object-oriented #programming #using

Using a Multiple Term Project to Teach Object Oriented Programming and Design (JCM, HJCE), pp. 59–64.

FoSSaCS-2004-Meyer #on the #term rewriting

On Term Rewriting Systems Having a Rational Derivation (AM), pp. 378–392.

ICSM-2004-RostkowyczRM #case study #documentation

A Case Study on the Long-Term Effects of Software Redocumentation (AJR, VR, AM), pp. 92–101.

WCRE-2004-Kollmann #case study #experience #industrial #re-engineering

Experiences with an Industrial Long-Term Reengineering Project (RK), pp. 8–16.

CIKM-2004-LavelliSZ #comparison

Distributional term representations: an experimental comparison (AL, FS, RZ), pp. 615–624.

CIKM-2004-LynamBCC #analysis #documentation #feedback #multi

A multi-system analysis of document and term selection for blind feedback (TRL, CB, CLAC, GVC), pp. 261–269.

CIKM-2004-TerraC #information retrieval

Scoring missing terms in information retrieval tasks (ET, CLAC), pp. 50–58.

ICPR-v4-2004-ChenC04a #bidirectional #dependence #learning #network

Improvement of Bidirectional Recurrent Neural Network for Learning Long-Term Dependencies (JC, NSC), pp. 593–596.

KR-2004-LakemeyerL #exclamation

Situations, Si! Situation Terms, No! (GL, HJL), pp. 516–526.

SEKE-2004-FoxF #adaptation #clustering #documentation #reduction

Document Clustering with Adaptive Term Weighting and Feature Reduction Capabilities (TWF, BJF), pp. 142–147.

SIGIR-2004-AmitayCLS #evaluation #scalability #set #using

Scaling IR-system evaluation using term relevance sets (EA, DC, RL, AS), pp. 10–17.

SIGIR-2004-KimCK #dependence #documentation #using

Refining term weights of documents using term dependencies (HSK, IC, MK), pp. 552–553.

SIGIR-2004-ZhangV04a #detection #query

Detection and translation of OOV terms prior to query time (YZ, PV), pp. 524–525.

LOPSTR-2004-EscobarMT #term rewriting

Natural Rewriting for General Term Rewriting Systems (SE, JM, PT), pp. 101–116.

CSL-2004-RychlikowskiT #constraints #set

Set Constraints on Regular Terms (PR, TT), pp. 458–472.

IJCAR-2004-RiazanovV #constraints #performance

Efficient Checking of Term Ordering Constraints (AR, AV), pp. 60–74.

RTA-2004-Ketema #term rewriting

Böhm-Like Trees for Term Rewriting Systems (JK), pp. 233–248.

RTA-2004-LimetS #logic programming #proving #source code #term rewriting

Proving Properties of Term Rewrite Systems via Logic Programs (SL, GS), pp. 170–184.

RTA-2004-Lucas #named #proving #termination

mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting (SL), pp. 200–209.

RTA-2004-MatthewsFFF #term rewriting #visual notation

A Visual Environment for Developing Context-Sensitive Term Rewriting Systems (JM, RBF, MF, MF), pp. 301–311.

RTA-2004-Simonsen #composition #confluence #on the #term rewriting

On the Modularity of Confluence in Infinitary Term Rewriting (JGS), pp. 185–199.

RTA-2004-Takai #abstract interpretation #term rewriting #using #verification

A Verification Technique Using Term Rewriting Systems and Abstract Interpretation (TT), pp. 119–133.

RTA-2004-Toyama #higher-order #lisp #term rewriting #termination

Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms (YT), pp. 40–54.

ICDAR-2003-KiseYM #2d #documentation #feedback #image #pseudo #retrieval

Document Image Retrieval Based on 2D Density Distributions of Terms with Pseudo Relevance Feedback (KK, WY, KM), pp. 488–492.

CIKM-2003-AmitayNNSS #ambiguity #multi

Multi-resolution disambiguation of term occurrences (EA, RN, WN, RS, AS), pp. 255–262.

CIKM-2003-HeO #case study #normalisation #parametricity

A study of parameter tuning for term frequency normalization (BH, IO), pp. 10–16.

ECIR-2003-MacFarlaneRM #parallel

Parallel Computing for Term Selection in Routing/Filtering (AM, SER, JAM), pp. 537–545.

ECIR-2003-RasolofoS #keyword #proximity #retrieval

Term Proximity Scoring for Keyword-Based Retrieval Systems (YR, JS), pp. 207–218.

ICML-2003-KennedyJ #learning #problem

Characteristics of Long-term Learning in Soar and its Application to the Utility Problem (WGK, KADJ), pp. 337–344.

ICML-2003-RuckertK #learning #probability

Stochastic Local Search in k-Term DNF Learning (UR, SK), pp. 648–655.

MLDM-2003-ArmengolP

Remembering Similitude Terms in CBR (EA, EP), pp. 121–130.

SEKE-2003-JiehanL

Relative Index Term Frequency (RITF) Method (ZJ, HL), pp. 427–431.

SIGIR-2003-EvansBH #optimisation #performance #robust

Optimizing term vectors for efficient and robust filtering (DAE, JB, DAH), pp. 451–452.

SIGIR-2003-SrikanthS #dependence #documentation #modelling #query #retrieval

Incorporating query term dependencies in language models for document retrieval (MS, RKS), pp. 405–406.

SIGIR-2003-TsuruokaT #generative #probability

Probabilistic term variant generator for biomedical terms (YT, JT), pp. 167–173.

PPDP-2003-Hamana #algebra #approach #term rewriting

Term rewriting with variable binding: an initial algebra approach (MH), pp. 148–159.

PPDP-2003-NadathurQ #reduction

Explicit substitutions in the reduction of λ terms (GN, XQ), pp. 195–206.

SAC-2003-AvanciniLMSZ #categorisation

Expanding Domain-Specific Lexicons by Term Categorization (HA, AL, BM, FS, RZ), pp. 793–797.

SAC-2003-DeboleS #automation #categorisation

Supervised Term Weighting for Automated Text Categorization (FD, FS), pp. 784–788.

LDTA-2003-BrandKMV #ambiguity #generalised parsing #parsing #semantics #term rewriting

Generalized Parsing and Term Rewriting: Semantics Driven Disambiguation (MvdB, SK, LM, JJV), pp. 575–591.

RTA-2003-AotoY #term rewriting #termination

Termination of Simply Typed Term Rewriting by Translation and Labelling (TA, TY), pp. 380–394.

RTA-2003-BrandMV #exclamation #for free #term rewriting

Environments for Term Rewriting Engines for Free! (MvdB, PEM, JJV), pp. 424–435.

RTA-2003-Eker #commutative #scalability

Associative-Commutative Rewriting on Large Terms (SE), pp. 14–29.

RTA-2003-ThiemannG #term rewriting #termination

Size-Change Termination for Term Rewriting (RT, JG), pp. 264–278.

RTA-2003-UrsoK #induction

“Term Partition” for Mathematical Induction (PU, EK), pp. 352–366.

ITiCSE-2002-KesslerN

Mid-term course evaluations with muddy cards (CWK, SNT), p. 233.

WRLA-2002-DenkerM #communication #modelling #multi #protocol #term rewriting #using

Modeling Group Communication Protocols Using Multiset Term Rewriting (GD, JKM), pp. 20–39.

FLOPS-2002-Garcia-DiazN #constraints #quantifier

Solving Mixed Quantified Constraints over a Domain Based on Real Numbers and Herbrand Terms (MGD, SN), pp. 103–118.

CIAA-2002-LargeteauG #distributed #realtime #validation

Term Validation of Distributed Hard Real-Time Applications (GL, DG), pp. 262–269.

CSCW-2002-WhittakerJT #communication #identification

Contact management: identifying contacts to support long-term communication (SW, QJ, LGT), pp. 216–225.

VISSOFT-2002-Francik #algorithm #data flow #specification #visualisation

Specifying Algorithm Visualizations in Terms of Data Flow (JF), p. 110–?.

ICEIS-2002-Lopez #using

Strategic Position of Firms in Terms of Client’s Needs Using Linguistic and Numerical Information through a New Model of SOFM (RFL), pp. 382–390.

CIKM-2002-CooperCB #detection #documentation #using

Detecting similar documents using salient terms (JWC, AC, EWB), pp. 245–251.

CIKM-2002-GreiffMP #information retrieval #probability

The role of variance in term weighting for probabilistic information retrieval (WRG, WTM, JMP), pp. 252–259.

CIKM-2002-NallapatiA #dependence #modelling #using

Capturing term dependencies using a language model based on sentence trees (RN, JA), pp. 383–390.

ECIR-2002-AmatiR #normalisation

Term Frequency Normalization via Pareto Distributions (GA, CJvR), pp. 183–192.

ECIR-2002-PetersK #categorisation #reduction

Uncertainty-Based Noise Reduction and Term Selection in Text Categorization (CMEEP, CHAK), pp. 248–267.

ECIR-2002-Vakkari #query

Subject Knowledge, Source of Terms, and Term Selection in Query Expansion: An Analytical Study (PV), pp. 110–123.

ICPR-v3-2002-YinBCD #performance #retrieval

Improving Retrieval Performance by Long-term Relevance Information (PYY, BB, KCC, AD), p. 533–?.

KDD-2002-BeilEX #clustering

Frequent term-based text clustering (FB, ME, XX), pp. 436–442.

KDD-2002-ChungC #clustering #cvs #information retrieval #named

CVS: a Correlation-Verification based Smoothing technique on information retrieval and term clustering (CYC, BC), pp. 469–474.

SIGIR-2002-DarwishO

Term selection for searching printed Arabic (KD, DWO), pp. 261–268.

SIGIR-2002-FranzM #how #question

How Many Bits are Needed to Store Term Frequencies? (MF, JSM), pp. 377–378.

SIGIR-2002-Hiemstra #approach #information retrieval #modelling #query

Term-specific smoothing for the language modeling approach to information retrieval: the importance of a query term (DH), pp. 35–41.

SIGIR-2002-JohoSB #approach

Hierarchical approach to term suggestion device (HJ, MS, MB), p. 454.

SIGIR-2002-LavelliMS #categorisation

Building thematic lexical resources by term categorization (AL, BM, FS), pp. 415–416.

SIGIR-2002-SakaiR #case study #comparative #information retrieval

Relative and absolute term selection criteria: a comparative study for English and Japanese IR (TS, SER), pp. 411–412.

PPDP-2002-HiguchiO #bytecode #calculus #java

Java bytecode as a typed term calculus (TH, AO), pp. 201–211.

SAC-2002-JohoCSB

Hierarchical presentation of expansion terms (HJ, CC, MS, MHB), pp. 645–649.

CSL-2002-BaazM #on the

On Generalizations of Semi-terms of Particularly Simple Form (MB, GM), pp. 382–396.

CSL-2002-GeuversJ #interactive #logic #proving

Open Proofs and Open Terms: A Basis for Interactive Logic (HG, GIJ), pp. 537–552.

LICS-2002-Tiwari #confluence #polynomial #term rewriting

Deciding Confluence of Certain Term Rewriting Systems in Polynomial Time (AT), p. 447–?.

RTA-2002-Durand #named #term rewriting

Autowrite: A Tool for Checking Properties of Term Rewriting Systems (ID), pp. 371–375.

RTA-2002-LiangN #representation #trade-off

Tradeoffs in the Intensional Representation of λ Terms (CL, GN), pp. 192–206.

RTA-2002-SekiTFK #term rewriting

Layered Transducing Term Rewriting System and Its Recognizability Preserving Property (HS, TT, YF, YK), pp. 98–113.

RTA-2002-Tahhan-Bittar #bound #confluence #recursion #term rewriting

Recursive Derivational Length Bounds for Confluent Term Rewrite Systems (ETB), pp. 281–295.

VLDB-2001-Duranti #authentication

The Long-Term Preservation of Authentic Electronic Records (LD), pp. 625–628.

ICSM-2001-LehmanRS #approach #modelling #roadmap

An Approach to Modelling Long-Term Growth Trends in Software Systems (MML, JFR, US), p. 219–?.

FLOPS-J1-1998-Takahashi01 #algebra

λ-Representable Functions Over Term Algebras (MT), pp. 3–29.

CIAA-2001-NedjahM #adaptation #automaton #pattern matching #performance #term rewriting

Minimal Adaptive Pattern-Matching Automata for Efficient Term Rewriting (NN, LdMM), pp. 221–233.

SIGIR-2001-JinFH #automation #information retrieval #named

Meta-scoring: Automatically Evaluating Term Weighting Schemes in IR without Precision-Recall (RJ, CF, AGH), pp. 83–89.

SIGIR-2001-Lam-AdesinaJ #feedback #summary

Applying Summarization Techniques for Term Selection in Relevance Feedback (AMLA, GJFJ), pp. 1–9.

SIGIR-2001-LuLC #mining #query

Anchor Text Mining for Translation Extraction of Query Terms (WHL, HJL, LFC), pp. 388–389.

SIGIR-2001-ManoO #automation #query

Selecting Expansion Terms in Automatic Query Expansion (HM, YO), pp. 390–391.

PPDP-2001-KamareddineBN #equivalence #syntax

De Bruijn’s Syntax and Reductional Equivalence of λ-Terms (FK, RB, RN), pp. 16–27.

IJCAR-2001-Urbain #automation #incremental #proving #term rewriting #termination

Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems (XU), pp. 485–498.

RTA-2001-BerarducciB #algebra #higher-order #recursion

General Recursion on Second Order Term Algebras (AB, CB), pp. 15–30.

RTA-2001-Lucas #semantics #term rewriting

Transfinite Rewriting Semantics for Term Rewriting Systems (SL), pp. 216–230.

RTA-2001-OyamaguchiO #confluence #problem #term rewriting #unification

The Unification Problem for Confluent Right-Ground Term Rewriting Systems (MO, YO), pp. 246–260.

RTA-2001-Yamada #confluence #term rewriting #termination

Confluence and Termination of Simply Typed Term Rewriting Systems (TY), pp. 338–352.

TLCA-2001-CoppolaM #constraints #linear #logic #type system

Typing λ Terms in Elementary Logic with Linear Constraints (PC, SM), pp. 76–90.

TLCA-2001-deLiguoro #calculus #convergence

Characterizing Convergent Terms in Object Calculi via Intersection Types (Ud), pp. 315–328.

WRLA-2000-Millen #analysis #bibliography #encryption #protocol #term rewriting

Applications of Term Rewriting to Cryptographic Protocol Analysis overview of the invited talk (JKM), pp. 229–234.

SAS-2000-ClarkHH #analysis #graph grammar #safety #strict

Safety of Strictness Analysis via Term Graph Rewriting (DC, CH, SH), pp. 95–114.

WLC-2000-Steinby #automaton #formal method #term rewriting

Tree Automata in the Theory of Term Rewriting (MS), pp. 434–449.

ICPR-v2-2000-JainJV #experience #network #using

Short-Term Water Demand Forecasting Using Artificial Neural Networks: IIT Kanpur Experience (AJ, UCJ, AKV), pp. 2459–2462.

KR-2000-RychtyckyjR #information management #representation

Long-Term Maintanability of Deployed Knowledge Representation Systems (NR, RGR), pp. 494–504.

SIGIR-2000-ChuangPLC #interactive #web

Auto-construction of a live thesaurus from search term logs for interactive Web search (SLC, HTP, WHL, LFC), pp. 334–336.

LOPSTR-2000-SerebrenikS #analysis #logic programming #source code #termination

Non-tranformational termination analysis of logic programs, based on general term-orderings (AS, DDS).

LOPSTR-J-2000-SerebrenikS #analysis #logic programming #source code #termination

Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings (AS, DDS), pp. 69–85.

LICS-2000-KorovinV #algebra

A Decision Procedure for the Existential Theory of Term Algebras with the Knuth-Bendix Ordering (KK, AV), pp. 291–302.

LICS-2000-RybinaV #algebra

A Decision Procedure for Term Algebras with Queues (TR, AV), pp. 279–290.

RTA-2000-Stuber #calculus #convergence #term rewriting

Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems (JS), pp. 229–245.

RTA-2000-TakaiKS #effectiveness #finite #linear #term rewriting

Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability (TT, YK, HS), pp. 246–260.

RTA-2000-Tison #automaton #term rewriting

Tree Automata and Term Rewrite Systems (ST), pp. 27–30.

FASE-1999-FokkinkV #legacy #term rewriting

Conservative Extension in Positive/Negative Conditional Term Rewriting with Applications to Software Renovation Factories (WF, CV), pp. 98–113.

AGTIVE-1999-PlasmeijerE #functional #graph grammar #mobile

Term Graph Rewriting and Mobile Expressions in Functional Languages (MJP, MCJDvE), pp. 1–13.

HCI-EI-1999-DzidaF #documentation #prototype #question

Documentation of Prototypes in Terms of Use Scenarios: Nice to Have or Indispensable? (WD, RF), pp. 905–908.

SAC-1999-OgataIF #optimisation #term rewriting #using

Optimizing Term Rewriting Using Discrimination Nets With Specialization (KO, SI, KF), pp. 511–518.

CSL-1999-AltenkirchR #induction #monad #using

Monadic Presentations of λ Terms Using Generalized Inductive Types (TA, BR), pp. 453–468.

CSL-1999-Middeldorp #term rewriting

Term Rewriting (AM), p. 577.

ICLP-1999-CuiW #logic programming #multi

Multiple Terms in a Tabled Logic Programming System (BC, DSW), pp. 305–319.

RTA-1999-Marcinkowski #algebra #formal method

Undecidability of the exists*forall* Part of the Theory of Ground Term Algebra Modulo an AC Symbol (JM), pp. 92–102.

RTA-1999-NagayaT #decidability #term rewriting

Decidability for Left-Linaer Growing Term Rewriting Systems (TN, YT), pp. 256–270.

RTA-1999-VermaS #agile #graph grammar #named

L^arrowR²: A Laboratory fro Rapid Term Graph Rewriting (RMV, SS), pp. 252–255.

TLCA-1999-David

Every Unsolvable λ Term has a Decoration (RD), pp. 98–113.

FoSSaCS-1998-CorradiniG #term rewriting

Rational Term Rewriting (AC, FG), pp. 156–171.

WRLA-1998-BrandKV #term rewriting

Term rewriting for sale (MvdB, PK, CV), pp. 218–241.

WRLA-1998-Eker #evaluation #term rewriting

Term rewriting with operator evaluation strategies (SE), pp. 311–330.

ICALP-1998-Walukiewicz98a #higher-order #reduction

A Total AC-Compatible Reduction Ordering on Higher-Order Terms (DW), pp. 530–542.

ICFP-1998-Faggian #approach #calculus

A Term Calculus for Unitary Approach to Nomalization (CF), p. 347.

ICML-1998-LittmanJK #corpus #independence #learning #representation

Learning a Language-Independent Representation for Terms from a Partially Aligned Corpus (MLL, FJ, GAK), pp. 314–322.

SIGIR-1998-Greiff #data analysis #formal method

A Theory of Term Weighting Based on Exploratory Data Analysis (WRG), pp. 11–19.

SIGIR-1998-KaszkielZ #database #documentation #evaluation #query #scalability

Term-Ordered Query Evaluation versus Document-Ordered Query Evaluation for Large Document Databases (MK, JZ), pp. 343–344.

SIGIR-1998-LinSCHKH #approach #classification #documentation #internet #mining #semantics

Extracting Classification Knowledge of Internet Documents with Mining Term Associations: A Semantic Approach (SHL, CSS, MCC, JMH, MTK, YMH), pp. 241–249.

SIGIR-1998-SuzukiFS #keyword #using

Keyword Extraction of Radio News Using Term Weighting with an Encyclopedia and Newspaper Articles (YS, FF, YS), pp. 373–374.

SIGIR-1998-Tseng #keyword #multi

Multilingual Keyword Extraction for Term Suggestion (YHT), pp. 377–378.

TOOLS-USA-1998-McKim #design #education #multi #object-oriented #programming #using

Using a Multi-Term Project to Teach Object Oriented Programming and Design (JCM), p. 468–?.

ALP-PLILP-1998-Aoto #persistent #problem #term rewriting

Solution to the Problem of Zantema on a Persistent Property of Term Rewriting Systems (TA), pp. 250–265.

CSL-1998-KhasidashviliP #normalisation

Normalization of Typable Terms by Superdevelopments (ZK, AP), pp. 260–282.

RTA-1998-Klop #term rewriting

Origin Tracking in Term Rewriting (Abstract) (JWK), p. 1.

RTA-1998-Waldmann #decidability #normalisation

Normalization of S-Terms is Decidable (JW), pp. 138–150.

HT-1997-HusemannPKKH #adaptation #navigation

An User Adaptive Navigation Metaphor to Connect and Rate the Coherence of Terms and Complex Objects (HH, JP, CK, HDK, PH), pp. 214–215.

TACAS-1997-EijkBEA #generative

The Term Processor Generator Kimwitu (PvE, AB, HE, HA), pp. 96–111.

SAS-1997-FahndrichA #constraints #program analysis #set #using

Program Analysis Using Mixed Term and Set Constraints (MF, AA), pp. 114–126.

ICALP-1997-Bernardo #algebra

An Algebra-Based Method to Associate Rewards with EMPA Terms (MB), pp. 358–368.

FME-1997-CazierD #2d #set #term rewriting

Term Rewrite Systems to Derive Set Boolean Operations on 2D Objects (DC, JFD), pp. 605–623.

HCI-SEC-1997-PedottiFB

Human Motor Strategies in Long Term Space Flights (AP, GF, GB), pp. 1009–1012.

ACIR-1997-Wilkinson #using

Using Combination of Evidence for Term Expansion (RW).

KDD-1997-KahngM #algorithm #mining

Mining Generalized Term Associations: Count Propagation Algorithm (JK, WHKL, DM), pp. 203–206.

SIGIR-1997-Jacquemin #corpus

Guessing Morphology from Terms and Corpora (CJ), pp. 156–165.

SIGIR-1997-KlavansTJ #automation #effectiveness #multi #natural language #semiparsing #speech

Effective Use of Natural Language Processing Techniques for Automatic Conflation of Multi-Word Terms: The Role of Derivational Morphology, Part of Speech Tagging, and Shallow Parsing (ET, JK, CJ), pp. 148–155.

ALP-1997-AotoT #composition #on the #term rewriting

On Composable Properties of Term Rewriting Systems (TA, YT), pp. 114–128.

ALP-1997-Ohlebusch #graph grammar

Conditional Term Graph Rewriting (EO), pp. 144–158.

PLILP-1997-OgataF #evaluation #implementation #term rewriting

Implementation of Term Rewritings with the Evaluation Strategy (KO, KF), pp. 225–239.

POPL-1997-WandS #semantics #using

Denotational Semantics Using an Operationally-Based Term Model (MW, GTS), pp. 386–399.

CADE-1997-DurandM #call-by #decidability #term rewriting

Decidable Call by Need Computations in term Rewriting (Extended Abstract) (ID, AM), pp. 4–18.

LICS-1997-Baader #order #reduction

Combination of Compatible Reduction Orderings that are Total on Ground Terms (FB), pp. 2–13.

RTA-1997-OgataOF #automaton #named #order #term rewriting

TRAM: An Abstract Machine for Order-Sorted Conditioned Term Rewriting Systems (KO, KO, KF), pp. 335–338.

RTA-1997-OyamaguchiO #linear #parallel #term rewriting

A New Parallel Closed Condition for Church-Rossser of Left-Linear Term Rewriting Systems (MO, YO), pp. 187–201.

SAS-1996-Emeljanov #analysis #similarity

Analysis of the Equality Relations for the Program Terms (PGE), pp. 174–188.

STOC-1996-KushilevitzOR #linear #privacy

Characterizing Linear Size Circuits in Terms of Privacy (EK, RO, AR), pp. 541–550.

CHI-1996-Erickson #analysis #design

The Design and Long-Term Use of a Personal Electronic Notebook: A Teflective Analysis (TE), pp. 11–18.

CIKM-1996-Greco #bound #set #unification

Optimal Unification of Bounded Simple Set Terms (SG), pp. 326–336.

SIGIR-1996-Kwok #ad hoc #query #retrieval

A New Method of Weighting Query Terms for Ad-Hoc Retrieval (KLK), pp. 187–195.

ALP-1996-KennawayOV #term rewriting

Meaningless Terms in Rewriting (RK, VvO, FJdV), pp. 254–268.

PLILP-1996-FernandezM #interactive #term rewriting

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

CADE-1996-RitterPW

Proof-Terms for Classical and Intuitionistic Resolution (Extended Abstract) (ER, DJP, LAW), pp. 17–31.

CSL-1996-GeserMOZ #term rewriting

Relative Undecidability in Term Rewriting (AG, AM, EO, HZ), pp. 150–166.

RTA-1996-Jacquemard #approximate #decidability #term rewriting

Decidable Approximations of Term Rewriting Systems (FJ), pp. 362–376.

RTA-1996-JouannaudR #higher-order #normalisation #recursion

A Recursive Path Ordering for Higher-Order Terms in η-Long β-Normal Form (JPJ, AR), pp. 108–122.

RTA-1996-Luth #algebra #composition #proving #term rewriting #theorem

Compositional Term Rewriting: An Algebraic Proof of Toyama’s Theorem (CL), pp. 261–275.

RTA-1996-Rao #composition #graph grammar #termination

Modularity of Termination in Term Graph Rewriting (MRKKR), pp. 230–244.

RTA-1996-SakaiT #semantics #term rewriting

Semantics and Strong Sequentiality of Priority Term Rewriting Systems (MS, YT), pp. 377–391.

RTA-1996-Vittek #compilation #nondeterminism #term rewriting

A Compiler for Nondeterministic Term Rewriting Systems (MV), pp. 154–167.

SAS-1995-Giesl #analysis #functional #order #source code #termination #using

Termination Analysis for Functional Programs using Term Orderings (JG), pp. 154–171.

CHI-1995-Hearst #information management #named #visualisation

TileBars: Visualization of Term Distribution Information in Full Text Information Access (MAH), pp. 59–66.

CHI-1995-MalinowskiN #collaboration #design #user interface #using

Using Computational Critics to Facilitate Long-Term Collaboration in User Interface Design (UM, KN), pp. 385–392.

CIKM-1995-VilesF #information management #information retrieval #on the

On the Update of Term Weights in Dynamic Information Retrieval Systems (CLV, JCF), pp. 167–174.

SIGIR-1995-Church #question

One Term Or Two? (KWC), pp. 310–318.

SIGIR-1995-MittendorfSS #library #probability #scalability

Applying Probabilistic Term Weighting to OCR Text in the Case of a Large Alphabetic Library Catalogue (EM, PS, PS), pp. 328–335.

SIGIR-1995-Ruge #memory management #modelling

Human Memory Models and Term Association (GR), pp. 219–227.

SAC-1995-BanachP #behaviour #graph grammar #linear #source code

Linear behaviour of term graph rewriting programs (RB, GAP), pp. 157–163.

CAV-1995-DsouzaB #algebra #generative #modelling #process

Generating BDD Models for Process Algebra Terms (AD, BB), pp. 16–30.

ICLP-1995-HermenegildoL #performance

Efficient Term Size Computation for Granularity Control (MVH, PLG), pp. 647–661.

ILPS-1995-DidierE #abstraction #term rewriting

Abstraction of Conditional Term Rewriting Systems (DB, RE), pp. 162–176.

RTA-1995-CorradiniGM #modelling #term rewriting

Relating Two Categorial Models of Term Rewriting (AC, FG, UM), pp. 225–240.

RTA-1995-Paccanaro #network #reduction

Guiding Term Reduction Through a Neural Network: Some Prelimanary Results for the Group Theory (AP), pp. 444–449.

RTA-1995-Stickel #proving #term rewriting #theorem proving

Term Rewriting in Contemporary Resolution Theorem Proving (Abstract) (MES), p. 101.

TLCA-1995-Leclerc #coq #development #multi #order #proving #term rewriting #termination

Termination Proof of Term Rewriting System with the Multiset Path Ordering. A Complete Development in the System Coq (FL), pp. 312–327.

ESOP-1994-Buth #simulation #term rewriting

Simulation of SOS Definitions with Term Rewriting Systems (KHB), pp. 150–164.

LFP-1994-Cosmadakis #algebra #proving

Complete Proof Systems for Algebraic Simply-Typed Terms (SSC), pp. 220–226.

SIGIR-1994-Aalbersberg #documentation #modelling #retrieval

A Document Retrieval Model Based on Term Frequency Ranks (IJA), pp. 163–172.

SIGIR-1994-JacqueminR #framework

Retrieving Terms and their Variants in a Lexicalised Unification-Based Framework (CJ, JR), pp. 132–141.

SIGIR-1994-Spink #design #feedback #query

Term Relevance Feedback and Query Expansion: Relation to Design (AS), pp. 81–90.

ALP-1994-Marchiori #logic programming #source code #term rewriting

Logic Programs as term Rewriting Systems (MM), pp. 223–241.

PLILP-1994-FieldT #dependence #slicing #term rewriting

Dynamic Dependence in Term rewriting Systems and its Application to Program Slicing (JF, FT), pp. 415–431.

PLILP-1994-TarauN #data transformation #novel #representation

A Novel Term Compression Scheme and Data Representation in the BinWAM (PT, UN), pp. 73–87.

CADE-1994-BronsardRH #induction #order #using

Induction using Term Orderings (FB, USR, RWH), pp. 102–117.

LICS-1994-Burstall #proving #refinement

Terms, Proofs, and Refinement (Extended abstract) (RMB), pp. 2–7.

VLDB-1993-ZobelMS #scalability #using

Searching Large Lexicons for Partially Specified Terms using Compressed Inverted Files (JZ, AM, RSD), pp. 290–301.

DLT-1993-HromkovicRS #nondeterminism

Deterministic Versus Nondeterministic Space in Terms of Synchronized Alternating Machines (JH, BR, AS), pp. 314–325.

SIGIR-1993-WongCY #network

Computation of Term Associations by a Neural Network (SKMW, YJC, YY), pp. 107–115.

LOPSTR-1993-Neumerkel #similarity

A Transformation Based in the Equality Between Terms (UN), pp. 162–176.

ILPS-1993-SudarshanR #bottom-up #evaluation #optimisation

Optimizations of Bottom-Up Evaluation with Non-Ground Terms (SS, RR), pp. 557–574.

RTA-1993-Ariola #graph #modelling #term rewriting

Relating Graph and Term Rewriting via Böhm Models (ZMA), pp. 183–197.

RTA-1993-FerreiraZ #term rewriting #termination

Total Termination of Term Rewriting (MCFF, HZ), pp. 213–227.

RTA-1993-Field #approach #graph #incremental #reduction #term rewriting

A Graph Reduction Approach to Incremental Term Rewriting (Preliminary Report) (JF), pp. 259–273.

RTA-1993-Gallier #proving

Proving Properties of Typed λ Terms: Realizability, Covers, and Sheaves (Abstract) (JHG), p. 136.

RTA-1993-Khasidashvili #normalisation #orthogonal #term rewriting

Optimal Normalization in Orthogonal Term Rewriting Systems (ZK), pp. 243–258.

RTA-1993-LevyA #order #term rewriting

Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations (JL, JAC), pp. 17–31.

TLCA-1993-Bakel #term rewriting

Partial Intersection Type Assignment in Applicative Term Rewriting Systems (SvB), pp. 29–44.

TLCA-1993-BentonBPH #calculus #linear #logic

A Term Calculus for Intuitionistic Linear Logic (PNB, GMB, VdP, MH), pp. 75–90.

SIGMOD-1992-Ley #retrieval

The Term Retrieval Machine (ML), pp. 154–163.

STOC-1992-BlumR #learning #performance #query

Fast Learning of k-Term DNF Formulas with Queries (AB, SR), pp. 382–389.

ICALP-1992-Bundgen #algorithm #term rewriting

Buchberger’s Algorithm: The Term Rewriter’s Point of View (Extended Abstract) (RB), pp. 380–391.

ML-1992-Markov #approach #concept #learning

An Approach to Concept Learning Based on Term Generalization (ZM), pp. 310–315.

SEKE-1992-Huai #knowledge base #term rewriting

A Knowledge Base Management System on Relation Model and Term Rewriting (JH), pp. 102–108.

SIGIR-1992-Grefenstette #retrieval

Use of Syntactic Context to Produce Term Association Lists for Text Retrieval (GG), pp. 89–97.

SIGIR-1992-Keen #ranking

Term Position Ranking: Some New Test Results (EMK), pp. 66–76.

ALP-1992-Hoffmann #term rewriting

Term Rewriting with Sharing and Memoïzation (BH), pp. 128–142.

LOPSTR-1992-LammaM #partial evaluation

A Rationalisation of the ATMS in Terms of Partial Evaluation (EL, PM), pp. 118–131.

CC-1992-Pettersson #automaton #compilation #finite

A Term Pattern-Match Compiler Inspired by Finite Automata Theory (MP), pp. 258–270.

CADE-1992-YelickG #parallel #term rewriting

A Parallel Completion Procedure for Term Rewriting Systems (KAY, SJG), pp. 109–123.

CSL-1992-Smith #type system

Kleene’s Slash and Existence of Values of Open Terms in Type Theory (JMS), pp. 395–402.

LICS-1992-Caucal #monad #term rewriting

Monadic Theory of Term Rewritings (DC), pp. 266–273.

LICS-1992-Toyama #linear #term rewriting

Strong Sequentiality of Left-Linear Overlapping Term Rewriting Systems (YT), pp. 274–284.

ICALP-1991-Comon #algebra #axiom

Complete Axiomatizations of Some Quotient Term Algebras (HC), pp. 469–480.

ML-1991-MurphyP #induction

Constructive Induction of M-of-N Terms (PMM, MJP), pp. 183–187.

POPL-1991-Maranget #orthogonal #term rewriting #λ-calculus

Optimal Derivations in Weak λ-calculi and in Orthogonal Terms Rewriting Systems (LM), pp. 255–269.

CAV-1991-Mutz #behaviour #correctness #proving #term rewriting #using

Using the HOL Prove Assistant for proving the Correctness of term Rewriting Rules reducing Terms of Sequential Behavior (MM), pp. 277–287.

CSL-1991-Weiermann #proving #term rewriting #termination

Proving Termination for Term Rewriting Systems (AW), pp. 419–428.

ICLP-1991-Miller #logic programming #unification

Unification of Simply Typed Lamda-Terms as Logic Programming (DM), pp. 255–269.

ISLP-1991-Carpenter #first-order

Typed Feature Structures: A Generalization of First-Order Terms (BC), pp. 187–201.

ISLP-1991-Plumer #automation #prolog #proving #source code #termination

Automatic Termination Proofs for Prolog Programs Operating on Nonground Terms (LP), pp. 503–517.

LICS-1991-Aczel #logic

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

RTA-1991-ChabinR #graph

Narrowing Directed by a Graph of Terms (JC, PR), pp. 112–123.

RTA-1991-CohenW #performance #representation #term rewriting

An Efficient Representation of Arithmetic for Term Rewriting (DC, PW), pp. 240–251.

RTA-1991-FarmerW #graph grammar

Redex Capturing in Term Graph Rewriting (Concise Version) (WMF, RJW), pp. 13–24.

RTA-1991-KennawayKSV #orthogonal #reduction #term rewriting

Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract) (RK, JWK, MRS, FJdV), pp. 1–12.

RTA-1991-Kucherov #on the #term rewriting

On Relationship Between Term Rewriting Systems and Regular Tree Languages (GK), pp. 299–311.

RTA-1991-Salomaa #confluence #decidability #monad #term rewriting #termination

Decidability of Confluence and Termination of Monadic Term Rewriting Systems (KS), pp. 275–286.

RTA-1991-Socher-Ambrosius #algebra #convergence #term rewriting

Boolean Algebra Admits No Convergent Term Rewriting System (RSA), pp. 264–274.

ESOP-1990-Kennaway #ambiguity #lazy evaluation #pattern matching #term rewriting

The Specificity Rule for Lazy Pattern-Matching in Ambiguous Term Rewrite Systems (RK), pp. 256–270.

ICALP-1990-Klop #term rewriting

Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond (JWK), pp. 350–369.

ICALP-1990-Malecki #polymorphism

Generic Terms Having No Polymorphic Types (SM), pp. 46–59.

LFP-1990-Cregut #automaton #normalisation

An Abstract Machine for λ-Terms Normalization (PC), pp. 333–340.

LFP-1990-NadathurW #representation

A Representation of λ Terms Suitable for Operations on Their Intensions (GN, DSW), pp. 341–348.

LFP-1990-PuelS #compilation #composition #pattern matching

Compiling Pattern Matching by Term Decomposition (LP, AS), pp. 273–281.

GG-1990-EngelfrietH #generative #graph grammar #power of

The Term Generating Power of Context-Free Hypergraph Grammars (JE, LH), pp. 328–243.

GG-1990-Plump #term rewriting

Graph-Reducible Term Rewriting Systems (DP), pp. 622–636.

SIGIR-1990-LewisC #clustering

Term Clustering of Syntactic Phrases (DDL, WBC), pp. 385–404.

ALP-1990-Bundgen #finite #term rewriting

Applying Term Rewriting Methods to Finite Groups (RB), pp. 332–346.

CC-1990-DesplandMR #generative #named #term rewriting #using

PAGODE: A Back End Generator Using Attribute Abstract Syntaxes and Term Rewritings (AD, MM, RR), pp. 86–105.

CADE-1990-Basin #commutative #morphism #similarity

Equality of Terms Containing Associative-Commutative Functions and Commutative Binding Operators in Isomorphism Complete (DAB), pp. 251–260.

CADE-1990-Reddy #induction #term rewriting

Term Rewriting Induction (USR), pp. 162–177.

CLP-1990-DelcherK90 #anti #parallel #performance

Efficient Parallel Term Matching and Anti-Unification (ALD, SK), pp. 355–369.

LICS-1990-Comon #algebra #equation

Solving Inequations in Term Algebras (Extended Abstract) (HC), pp. 62–69.

NACLP-1990-Meier #compilation #prolog

Compilation of Compound Terms in Prolog (MM), pp. 63–79.

KR-1989-Schmolze #information management #representation

Terminological Knowledge Representation Systems Supporting N-ary Terms (JGS), pp. 432–443.

SIGIR-1989-ChangLL #clustering #data access #multi

Multikey Access Methods Based on Term Discrimination and Signature Clustering (JWC, JHL, YJL), pp. 176–185.

LICS-1989-Middeldorp #term rewriting #termination

A Sufficient Condition for the Termination of the Direct Sum of Term Rewriting Systems (AM), pp. 396–401.

RTA-1989-AnantharamanHM #named #term rewriting

SbReve2: A Term Rewriting Laboratory with (AC-) Unfailing Completion (SA, JH, JM), pp. 533–537.

RTA-1989-AvenhausMS #named #term rewriting

COMTES — An Experimental Environment for the Completion of Term Rewriting Systems (JA, KM, JS), pp. 542–546.

RTA-1989-Birkhoff #algebra #term rewriting

Term Rewriting and Universal Algebra in Historical Perspective (Abstract of Invited Lecture) (GB), p. 1.

RTA-1989-DauchetD #compilation #term rewriting

Compilation of Ground Term Rewriting Systems and Applications (MD, AD), pp. 556–558.

RTA-1989-LatchS #term rewriting #termination

A Local Termination Property for Term Rewriting Systems (DML, RS), pp. 222–233.

RTA-1989-Middeldorp #aspect-oriented #composition #normalisation #term rewriting

Modular Aspects of Properties of Term Rewriting Systems Related to Normal Forms (AM), pp. 263–277.

RTA-1989-NaoiI #algebra #complexity #semantics #term rewriting

Algebraic Semantics and Complexity of Term Rewriting Systems (TN, YI), pp. 311–325.

RTA-1989-ToyamaKB #linear #term rewriting #termination

Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft- (YT, JWK, HPB), pp. 477–491.

PODS-1988-ShmueliTZ #logic #set

Rewriting of Rules Containing Set Terms in a Logic Data Model (LDL) (OS, ST, CZ), pp. 15–28.

VDME-1988-ButhB #code generation #correctness #proving #specification #term rewriting #using

Correctness Proofs for Meta IV Written Code Generator Specification using Term Rewriting (BB, KHB), pp. 406–433.

SIGIR-1988-Schauble #dependence

An Information Structure Dealing with Term Dependence and Polysemy (PS), pp. 519–533.

ALP-1988-FulopV #automaton #linear #set #term rewriting

A Characterization of Irreducible Sets Modulo Left-Linear Term Rewriting Systems by Tree Automata (ZF, SV), p. 157.

ALP-1988-Goltz #functional #modelling #semantics #unification

Functional Data Term Models and Semantic Unification (HJG), pp. 158–167.

ALP-1988-HofbauerK #induction #proving #term rewriting #theorem

Proving Inductive Theorems Based on Term Rewriting Systems (DH, RDK), pp. 180–190.

ALP-1988-HoffmannP #evaluation #performance #term rewriting

Jungle Evaluation for Efficient Term Rewriting (BH, DP), pp. 191–203.

ALP-1988-Hussmann #algebra #nondeterminism #specification #term rewriting

Nondeterministic Algebraic Specifications and Nonconfluent Term Rewriting (HH), pp. 31–40.

CADE-1988-PotterP #term rewriting

Term Rewriting: Some Experimental Results (RCP, DAP), pp. 435–453.

CADE-1988-VermaR #bound #parallel

Optimal Time Bounds for Parallel Term Matching (RMV, IVR), pp. 694–703.

LICS-1988-DershowitzO #term rewriting

Proof-Theoretic Techniques for Term Rewriting Theory (ND, MO), pp. 104–111.

LICS-1988-Vorobyov #on the #term rewriting

On the Arithmetic Inexpressiveness of Term Rewriting Systems (SGV), pp. 212–217.

DAC-1987-ChandrasekharPC #design #hardware #term rewriting #verification

Application of Term Rewriting Techniques to Hardware Design Verification (MSC, JPP, KWC), pp. 277–282.

ICALP-1987-RameshVKR #parallel

Term Matching on Parallel Computers (RR, RMV, KT, IVR), pp. 336–346.

SIGIR-1987-FuhrM #probability

Probabilistic Search Term Weighting-Some Negative Results (NF, PM), pp. 13–18.

LICS-1987-DauchetTHL #confluence #decidability #term rewriting

Decidability of the Confluence of Ground Term Rewriting Systems (MD, ST, TH, PL), pp. 353–359.

LICS-1987-Goerdt #hoare #imperative #logic

Hoare Logic for λ-Terms as Basis of Hoare Logic for Imperative Languages (AG), pp. 293–299.

RTA-1987-BaetenBK #term rewriting

Term Rewriting Systems with Priorities (JCMB, JAB, JWK), pp. 83–94.

RTA-1987-ChoppyKS #algorithm #complexity #term rewriting

Algorithmic Complexity of Term Rewriting Systems (CC, SK, MS), pp. 256–273.

RTA-1987-DauchetC #linear #term rewriting

A Gap Between Linear and Non Linear Term-Rewriting Systems (1) (MD, FDC), pp. 95–104.

RTA-1987-DesplandMR #code generation #generative #term rewriting

Code Generator Generation Based on Template-Driven Target Term Rewriting (AD, MM, RR), pp. 105–120.

RTA-1987-Kaplan #compilation #term rewriting

A Compiler for Conditional Term Rewriting Systems (SK), pp. 25–41.

RTA-1987-ODonnell #equation #implementation #logic programming

Term-Rewriting Implementation of Equational Logic Programming (MJO), pp. 1–12.

ESOP-1986-GeserH #case study #experience #interpreter #specification #term rewriting

Experiences with the RAP System — A Specification Interpreter Combining Term Rewriting and Resolution (AG, HH), pp. 339–350.

ICALP-1986-YouS #algorithm #confluence #term rewriting

E-Unification Algorithms for a Class of Confluent Term Rewriting Systems (JHY, PAS), pp. 454–463.

SIGIR-1986-Kwok #component #documentation

An Interpretation of Index Term Weighting Schemes Based on Document Components (KLK), pp. 275–283.

CADE-1986-AvenhausBGM #algebra #named #specification #term rewriting

TRSPEC: A Term Rewriting Based System for Algebraic Specifications (JA, BB, RG, KM), pp. 665–667.

CADE-1986-Comon #anti #term rewriting

Sufficient Completeness, Term Rewriting Systems and “Anti-Unification” (HC), pp. 128–140.

CADE-1986-DworkCKS #algorithm #parallel

Parallel Algorithms for Term Matching (CD, PCK, LJS), pp. 416–430.

CADE-1986-PoratF #equation #term rewriting

Full-Commutation and Fair-Termination in Equational (and Combined) Term-Rewriting Systems (SP, NF), pp. 21–41.

CADE-1986-Toyama #equivalence #how #induction #term rewriting

How to Prove Equivalence of Term Rewriting Systems without Induction (YT), pp. 118–127.

LICS-1986-Statman #combinator #on the #problem

On Translating λ Terms into Combinators; The Basis Problem (RS), pp. 378–382.

SLP-1986-MannilaU86 #implementation #prolog #representation

Timestamped Term Representation for Implementing Prolog (HM, EU), pp. 159–165.

RTA-1985-Hsiang #proving #term rewriting #theorem proving

Two Results in Term Rewriting Theorem Proving (JH), pp. 301–324.

RTA-1985-PoratF #term rewriting

Fairness in Term Rewriting Systems (SP, NF), pp. 287–300.

ICALP-1984-GrafS #congruence #finite

A Modal Characterization of Observational Congruence on Finite Terms of CCS (SG, JS), pp. 222–234.

SIGIR-1984-Frakes #information retrieval

Term Conflation for Information Retrieval (WBF), pp. 383–389.

CADE-1984-Lescanne #algebra #term rewriting

Term Rewriting Systems and Algebra (PL), pp. 166–174.

SIGIR-1983-RaghavanSY #evaluation #using

Evaluation of The 2-Poisson Model as a Basis for Using Term Frequency Data in Searching (VVR, HPS, CTY), pp. 88–100.

POPL-1983-Lescanne #generative #term rewriting

Computer Experiments with the Reve Term Rewriting System Generator (PL), pp. 99–108.

ICALP-1982-GuttagKM #term rewriting #tool support

Derived Pairs, Overlap Closures, and Rewrite Dominoes: New Tools for Analyzing Term rewriting Systems (JVG, DK, DRM), pp. 300–312.

SIGIR-1982-SaltonBY #dependence #evaluation #information retrieval #modelling

An Evaluation of Term Dependence Models in Information Retrieval (GS, CB, CTY), pp. 151–173.

STOC-1981-ChandraHMP #equation #logic #process

Equations between Regular Terms and an Application to Process Logic (AKC, JYH, ARM, RP), pp. 384–390.

STOC-1981-Chew #normalisation #term rewriting

Unique Normal Forms in Term Rewriting Systems with Repeated Variables (PC), pp. 7–18.

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.

SIGIR-1981-Robertson

Term Frequency and Term Value (SER), pp. 22–29.

SIGIR-1981-WuS #comparison #documentation

A Comparison of Search Term Weighting: Term Relevance vs. Inverse Document Frequency (HW, GS), pp. 30–39.

SIGIR-1980-NoreaultMK #documentation #evaluation #metric #performance #similarity

A Performance Evaluation of Similarity Measures, Document Term Weighting Schemes and Representations in a Boolean Environment (TN, MM, MBK), pp. 57–76.

SIGIR-1980-SaltonW #modelling

A Term Weighting Model Based on Utility Theory (GS, HW), pp. 9–22.

CADE-1980-Jeanrond #algebra #term rewriting #termination

Deciding Unique Termination of Permutative Rewriting Systems: Choose Your Term Algebra Carefully (HJJ), pp. 335–355.

ICALP-1979-Schmidt #graph #source code

Investigating Programs in Terms of Partial Graphs (GS), pp. 505–519.

ICALP-1978-CoppoDR #finite #set #λ-calculus

(Semi)-separability of Finite Sets of Terms in Scott’s D∞-Models of the λ-Calculus (MC, MDC, SRDR), pp. 142–164.

ICALP-1978-Zilli #combinator #logic #normalisation

Head Recurrent Terms in Combinatory Logic: A Generalization of the Notion of Head Normal Form (MVZ), pp. 477–493.

SIGIR-1978-YuR

Experiments on the Determination of the Reltionships Between Terms (CTY, VVR), p. 150.

ICALP-1974-CulikM #parallel #term rewriting

Parallel Rewriting Systems on terms (KCI, TSEM), pp. 495–510.

ICALP-1972-Turner #approach #complexity #infinity

An Infinite Hierarchy of Term Languages — An Approach to Mathematical Complexity (RT), pp. 593–608.

SOSP-1971-Easton #process

Process Synchronization without Long-Term Interlock (WBE), pp. 95–100.

SOSP-1971-Hansen #multi #scheduling

Short Term Scheduling in Multiprogramming Systems (PBH), pp. 101–105.