Stem string$ (all stems)

356 papers:

SIGMOD-2015-YangWWW #approximate #performance #query #string

Local Filtering: Improving the Performance of Approximate Queries on String Collections (XY, YW, BW, WW), pp. 377–392.

VLDB-2015-SahliMK #named #scalability #string

StarDB: A Large-Scale DBMS for Strings (MS, EM, PK), pp. 1844–1855.

VLDB-2015-WandeltL #multi #named #string

MRCSI: Compressing and Searching String Collections with Multiple References (SW, UL), pp. 461–472.

LATA-2015-BartonIP #approximate #string

Average-Case Optimal Approximate Circular String Matching (CB, CSI, SPP), pp. 85–96.

ICGT-2015-KissingerZ #diagrams #equation #product line #reasoning #string

Equational Reasoning with Context-Free Families of String Diagrams (AK, VZ), pp. 138–154.

HCI-IT-2015-JinL #framework #generative #interface #named #physics #research #string

StringWeaver: Research on a Framework with an Alterable Physical Interface for Generative Art (YJ, ZL), pp. 292–304.

ECIR-2015-Dutta #approximate #mining #named #statistics #string #using

MIST: Top-k Approximate Sub-string Mining Using Triplet Statistical Significance (SD), pp. 284–290.

ICML-2015-GiguereRLM #algorithm #kernel #predict #problem #string

Algorithms for the Hard Pre-Image Problem of String Kernels and the General Problem of String Prediction (SG, AR, FL, MM), pp. 2021–2029.

ECMFA-J-2012-ButtnerC15 #lightweight #reasoning #string

Lightweight string reasoning in model finding (FB, JC), pp. 413–427.

POPL-2015-AlurDR #declarative #named #string

DReX: A Declarative Language for Efficiently Evaluating Regular String Transformations (RA, LD, MR), pp. 125–137.

POPL-2015-VeanesMML #source code #string

Data-Parallel String-Manipulating Programs (MV, TM, DM, BL), pp. 139–152.

SAC-2015-MergelSS #mining #string #visual notation

A method to support search string building in systematic literature reviews through visual text mining (GDM, MSS, TSdS), pp. 1594–1601.

ESEC-FSE-2015-DharPDR #named #source code #string

CLOTHO: saving programs from malformed strings and incorrect string-handling (AD, RP, MD, SR), pp. 555–566.

ESEC-FSE-2015-LiLWH #analysis #android #java #string

String analysis for Java and Android applications (DL, YL, MW, WGJH), pp. 661–672.

CAV-2015-AbdullaACHRRS #constraints #named #smt #string

Norn: An SMT Solver for String Constraints (PAA, MFA, YFC, LH, AR, PR, JS), pp. 462–469.

CAV-2015-AydinBB #constraints #string

Automata-Based Model Counting for String Constraints (AA, LB, TB), pp. 255–272.

CAV-2015-ZhengGSTDZ #constraints #effectiveness #equation #regular expression #string

Effective Search-Space Pruning for Solvers of String Equations, Regular Expressions and Length Constraints (YZ, VG, SS, OT, JD, XZ), pp. 235–254.

ISSTA-2015-XieLLLC #automation #multi #named #string #summary

S-looper: automatic summarization for multipath string loops (XX, YL, WL, XL, HC), pp. 188–198.

RTA-2015-SabelZ #string

Transforming Cycle Rewriting into String Rewriting (DS, HZ), pp. 285–300.

ASE-2014-KauslerS #constraints #evaluation #execution #string #symbolic computation #theorem proving

Evaluation of string constraint solvers in the context of symbolic execution (SK, ES), pp. 259–270.

SIGMOD-2014-DengLF #algorithm #similarity #string

A pivotal prefix based filtering algorithm for string similarity search (DD, GL, JF), pp. 673–684.

SIGMOD-2014-PatilS #nondeterminism #similarity #string

Similarity joins for uncertain strings (MP, RS), pp. 1471–1482.

VLDB-2014-JiangLFL #evaluation #similarity #string

String Similarity Joins: An Experimental Evaluation (YJ, GL, JF, WSL), pp. 625–636.

PLDI-2014-LuuSSD #bound #constraints #string

A model counter for constraints over unbounded strings (LL, SS, PS, BD), p. 57.

AFL-2014-Valmari #proving #string

Character Strings and Gödel’s Incompleteness Proof (AV), pp. 355–369.

LATA-2014-BellaouarCZ #kernel #performance #sequence #string

Efficient List-Based Computation of the String Subsequence Kernel (SB, HC, DZ), pp. 138–148.

ICEIS-v1-2014-PengM #approximate #string

Approximate String Matching Techniques (TP, CM), pp. 217–224.

CIKM-2014-HoffartMW #named #string

AESTHETICS: Analytics with Strings, Things, and Cats (JH, DM, GW), pp. 2018–2020.

ICPR-2014-DamoulasHBGA #kernel #string

String Kernels for Complex Time-Series: Counting Targets from Sensed Movement (TD, JH, RB, CPG, AA), pp. 4429–4434.

KDIR-2014-Nakano #induction #string

Emergent Induction of L-system Grammar from a String with Deletion-type Transmutation (RN), pp. 397–402.

MLDM-2014-MazzolaCTP #string

Resolution of Geographical String Name through Spatio-Temporal Information (LM, PC, AT, MP), pp. 498–512.

SIGIR-2014-HoffartMW #named #string

STICS: searching with strings, things, and cats (JH, DM, GW), pp. 1247–1248.

ICMT-2014-InostrozaSE #program transformation #string

Tracing Program Transformations with String Origins (PI, TvdS, SE), pp. 154–169.

CC-2014-MadsenA #analysis #string

String Analysis for Dynamic Field Access (MM, EA), pp. 197–217.

CAV-2014-AbdullaACHRRS #constraints #string #verification

String Constraints for Verification (PAA, MFA, YFC, LH, AR, PR, JS), pp. 150–166.

CAV-2014-LiangRTBD #formal method #regular expression #string

A DPLL(T) Theory Solver for a Theory of Strings and Regular Expressions (TL, AR, CT, CB, MD), pp. 646–662.

ISSTA-2014-WeitzKSE #string #type system

A type system for format strings (KW, GK, SS, MDE), pp. 127–137.

ISSTA-2014-WeitzSKE #java #string

A format string checker for Java (KW, SS, GK, MDE), pp. 441–444.

LICS-CSL-2014-AlurFR #combinator #string

Regular combinators for string transformations (RA, AF, MR), p. 10.

RTA-TLCA-2014-Mellies #diagrams #string

Local States in String Diagrams (PAM), pp. 334–348.

ASE-2013-MeredithR #parametricity #performance #runtime #string #verification

Efficient parametric runtime verification with deterministic string rewriting (POM, GR), pp. 70–80.

CASE-2013-ShisheieJBC #design #string #using

Design and fabrication of an assistive device for arm rehabilitation using twisted string system (RS, LJ, LEB, MHMC), pp. 255–260.

ICDAR-2013-0001LBP #approximate #documentation #graph #string #visual notation

Near Convex Region Adjacency Graph and Approximate Neighborhood String Matching for Symbol Spotting in Graphical Documents (AD, JL, HB, UP), pp. 1078–1082.

ICDAR-2013-AldavertRTL #string #visual notation #word

Integrating Visual and Textual Cues for Query-by-String Word Spotting (DA, MR, RT, JL), pp. 511–515.

SIGMOD-2013-LuLWLW #metric #similarity #string

String similarity measures and joins with synonyms (JL, CL, WW, CL, HW), pp. 373–384.

SIGMOD-2013-YangWQWL #string #using

Improving regular-expression matching on strings using negative factors (XY, BW, TQ, YW, CL), pp. 361–372.

FASE-2013-LinPEHR #analysis #behaviour #requirements #sequence #specification #string

Augmenting Sequence Enumeration with String-Rewriting for Requirements Analysis and Behavioral Specification (LL, JHP, RE, RMH, CRM), pp. 179–193.

DLT-J-2012-IwamaN13 #quantum #string

Recovering Strings in Oracles: Quantum and Classic (KI, HN), pp. 979–994.

ICALP-v1-2013-GrossiRRV #random #string

Dynamic Compressed Strings with Random Access (RG, RR, SRS, RV), pp. 504–515.

CHI-2013-PohlHHVP #interactive #string

An interactive belt-worn badge with a retractable string-based input mechanism (NP, SH, JH, NV, TP), pp. 1465–1468.

ESEC-FSE-2013-ZhengZG #analysis #named #string #web

Z3-str: a z3-based string solver for web application analysis (YZ, XZ, VG), pp. 114–124.

ICSE-2013-GhoshSLC #automation #generative #industrial #java #named #string #testing

JST: an automatic test generation tool for industrial Java applications with strings (IG, NS, GL, WFC), pp. 992–1001.

ICST-2013-AfshanMS #evolution #natural language #string #testing #using

Evolving Readable String Test Inputs Using a Natural Language Model to Reduce Human Oracle Cost (SA, PM, MS), pp. 352–361.

LICS-2013-AlurDT #higher-order #monad #string #transducer

From Monadic Second-Order Definable String Transformations to Transducers (RA, ADG, AT), pp. 458–467.

VMCAI-2013-DAntoniV #static analysis #string

Static Analysis of String Encoders and Decoders (LD, MV), pp. 209–228.

DRR-2012-WangDL #recognition #string

Post processing for offline Chinese handwritten character string recognition (YW, XD, CL).

PODS-2012-GrossiO #maintenance #sequence #string

The wavelet trie: maintaining an indexed sequence of strings in compressed space (RG, GO), pp. 203–214.

VLDB-2012-SinghG #learning #semantics #string

Learning Semantic String Transformations from Examples (RS, SG), pp. 740–751.

CIAA-2012-FaroL #algorithm #automaton #online #performance #string

A Fast Suffix Automata Based Algorithm for Exact Online String Matching (SF, TL), pp. 149–158.

DLT-2012-Iwama #quantum #string

Recovering Strings in Oracles: Quantum and Classic (KI), p. 23.

DLT-2012-KetemaS #normalisation #string #termination

Characterizing Languages by Normalization and Termination in String Rewriting — (Extended Abstract) (JK, JGS), pp. 459–464.

ICPR-2012-WangL12b #learning #recognition #string

String-level learning of confidence transformation for Chinese handwritten text recognition (DHW, CLL), pp. 3208–3211.

KDIR-2012-WandeltL #string

String Searching in Referentially Compressed Genomes (SW, UL), pp. 95–102.

SIGIR-2012-JiangWLAW #alias #approach #detection #learning #similarity #string #towards

Towards alias detection without string similarity: an active learning based approach (LJ, JW, PL, NA, MW), pp. 1155–1156.

ECMFA-2012-ButtnerC #lightweight #ocl #reasoning #string

Lightweight String Reasoning for OCL (FB, JC), pp. 244–258.

ICSE-2012-AlkhalafBG #analysis #string #using #validation #verification

Verifying client-side input validation functions using string analysis (MA, TB, JLG), pp. 947–957.

ICSE-2012-SamirniSAMTH #automation #constraints #fault #generative #html #php #string #theorem proving #using

Automated repair of HTML generation errors in PHP applications using string constraint solving (HS, MS, SA, TDM, FT, LJH), pp. 277–287.

ICST-2012-BeyeneA #generative #string #test coverage #testing

Generating String Test Data for Code Coverage (MB, JHA), pp. 270–279.

ICST-2012-McMinnSS #data type #generative #query #search-based #string #using #web

Search-Based Test Input Generation for String Data Types Using the Results of Web Queries (PM, MS, MS), pp. 141–150.

ISSTA-2012-AlkhalafCFBOK #analysis #consistency #difference #named #nondeterminism #string #validation

ViewPoints: differential string analysis for discovering client- and server-side input validation inconsistencies (MA, SRC, MF, TB, AO, CK), pp. 56–66.

LICS-2012-AlurFT #infinity #string

Regular Transformations of Infinite Strings (RA, EF, AT), pp. 65–74.

LICS-2012-Mellies #diagrams #game studies #semantics #string

Game Semantics in String Diagrams (PAM), pp. 481–490.

DRR-2011-HajiBS #automation #documentation #image #string

Automatic extraction of numeric strings in unconstrained handwritten document images (MMH, TDB, CYS), pp. 1–10.

ICDAR-2011-AbediF #analysis #documentation #image #locality #string #using

Localization of Digit Strings in Farsi/Arabic Document Images Using Structural Features and Syntactical Analysis (AA, KF), pp. 728–733.

ICDAR-2011-JiangDLW #algorithm #markov #novel #segmentation #string #using

A Novel Short Merged Off-line Handwritten Chinese Character String Segmentation Algorithm Using Hidden Markov Model (ZJ, XD, CL, YW), pp. 668–672.

ICDAR-2011-WakaharaK #clustering #image #string #using

Binarization of Color Character Strings in Scene Images Using K-Means Clustering and Support Vector Machines (TW, KK), pp. 274–278.

VLDB-2011-GeL #approximate #nondeterminism #string

Approximate Substring Matching over Uncertain Strings (TG, ZL), pp. 772–782.

VLDB-2012-MansourASK11 #named #parallel #performance #string

ERA: Efficient Serial and Parallel Suffix Tree Construction for Very Long Strings (EM, AA, SS, PK), pp. 49–60.

CIAA-J-2010-YuBI11 #automaton #multi #relational #string #using #verification

Relational String Verification Using Multi-Track Automata (FY, TB, OHI), pp. 1909–1924.

CIAA-2011-Buchnik #algorithm #multi #named #string

Bouma2 — A High-Performance Input-Aware Multiple String-Match Algorithm (EB), pp. 53–64.

DLT-2011-BadkobehCC #string

Hunting Redundancies in Strings (GB, SC, MC), pp. 1–14.

ICALP-v1-2011-AllenderFG #power of #random #string

Limits on the Computational Power of Random Strings (EA, LF, WIG), pp. 293–304.

ICALP-v2-2011-AlurD #nondeterminism #streaming #string #transducer

Nondeterministic Streaming String Transducers (RA, JVD), pp. 1–20.

LATA-2011-AnselmoGM #classification #string

Classification of String Languages via Tiling Recognizable Picture Languages (MA, DG, MM), pp. 105–116.

SEFM-2011-BubelHG #formal method #java #specification #string #verification

A Formalisation of Java Strings for Program Specification and Verification (RB, RH, UG), pp. 90–105.

CIKM-2011-PeelWZ #string #using

Collection-based compression using discovered long matching strings (AP, AW, JZ), pp. 2361–2364.

SIGIR-2011-PatilTSHVC #string

Inverted indexes for phrases and strings (MP, SVT, RS, WKH, JSV, SC), pp. 555–564.

SIGIR-2011-ZhouCZ #algorithm #approximate #named #performance #string #towards

SEJoin: an optimized algorithm towards efficient approximate string searches (JZ, ZC, JZ), pp. 1249–1250.

POPL-2011-Gulwani #automation #spreadsheet #string #using

Automating string processing in spreadsheets using input-output examples (SG), pp. 317–330.

CGO-2011-RusAL #automation #distance #locality #optimisation #reuse #string

Automated locality optimization based on the reuse distance of string operations (SR, RA, DXL), pp. 181–190.

CAV-2011-GaneshKAGHE #analysis #detection #named #string #testing

HAMPI: A String Solver for Testing, Analysis and Vulnerability Detection (VG, AK, SA, PJG, PH, MDE), pp. 1–19.

ISSTA-2011-TateishiPT #analysis #higher-order #logic #monad #string

Path- and index-sensitive string analysis based on monadic second-order logic (TT, MP, OT), pp. 166–176.

VMCAI-2011-HooimeijerV #algorithm #analysis #automaton #evaluation #string

An Evaluation of Automata Algorithms for String Analysis (PH, MV), pp. 248–262.

VMCAI-2011-KimC #abstract interpretation #analysis #string

String Analysis as an Abstract Interpretation (SWK, KMC), pp. 294–308.

ASE-2010-HooimeijerW #constraints #string

Solving string constraints lazily (PH, WW), pp. 377–386.

DATE-2010-KennedyWLL #string #throughput

Ultra-high throughput string matching for Deep Packet Inspection (AK, XW, ZL, BL), pp. 399–404.

SIGMOD-2010-JestesLYY #probability #similarity #string

Probabilistic string similarity joins (JJ, FL, ZY, KY), pp. 327–338.

SIGMOD-2010-ZhangHOS #distance #edit distance #named #similarity #string

Bed-tree: an all-purpose index structure for string similarity search based on edit distance (ZZ, MH, BCO, DS), pp. 915–926.

VLDB-2010-WangLF #constraints #named #performance #similarity #string

Trie-Join: Efficient Trie-based String Similarity Joins with Edit-Distance Constraints (JW, GL, JF), pp. 1219–1230.

TACAS-2010-YuAB #analysis #named #php #string

Stranger: An Automata-Based String Analysis Tool for PHP (FY, MA, TB), pp. 154–157.

DLT-J-2008-CrochemoreFIJ10 #string

Number of Occurrences of powers in Strings (MC, SZF, CSI, IJ), pp. 535–547.

CIAA-2010-YuBI #automaton #multi #relational #string #using #verification

Relational String Verification Using Multi-track Automata (FY, TB, OHI), pp. 290–299.

ICALP-v1-2010-GrossiOR #string #trade-off

Optimal Trade-Offs for Succinct String Indexes (RG, AO, RR), pp. 678–689.

LATA-2010-Arslan #algorithm #performance #sequence #string

A Fast Longest Common Subsequence Algorithm for Similar Strings (ANA), pp. 82–93.

LATA-2010-CrochemoreIKRRW #on the #polynomial #string

On the Maximal Number of Cubic Runs in a String (MC, CSI, MK, JR, WR, TW), pp. 227–238.

LATA-2010-KasprzikK #learning #string #using

String Extension Learning Using Lattices (AK, TK), pp. 380–391.

ICPR-2010-Gonzalez-RubioC #multi #on the #string

On the Use of Median String for Multi-source Translation (JGR, FC), pp. 4328–4331.

ICPR-2010-LiuC #classification #image #string

Spatial String Matching for Image Classification (YL, VC), pp. 2937–2940.

SEKE-2010-FuL #constraints #detection #string #theorem proving #web

A String Constraint Solver for Detecting Web Application Vulnerability (XF, CCL), pp. 535–542.

SIGIR-2010-Huerta #approach #approximate #stack #string

A stack decoder approach to approximate string matching (JMH), pp. 823–824.

PPDP-2010-BrabrandT #ambiguity #pattern matching #regular expression #string #using

Typed and unambiguous pattern matching on strings using regular expressions (CB, JGT), pp. 243–254.

FSE-2010-WangZXMS #constant #string #web

Locating need-to-translate constant strings in web applications (XW, LZ, TX, HM, JS), pp. 87–96.

ASE-2009-LedruPB #string #testing #using

Using String Distances for Test Case Prioritisation (YL, AP, SB), pp. 510–514.

ASE-2009-YuAB #analysis #generative #source code #string #using

Generating Vulnerability Signatures for String Manipulating Programs Using Automata-Based Forward and Backward Symbolic Analyses (FY, MA, TB), pp. 605–609.

ICDAR-2009-ImuraT #documentation #image #string

Compression and String Matching Method for Printed Document Images (HI, YT), pp. 291–295.

ICDAR-2009-PalRRK #automation #multi #recognition #string

Indian Multi-Script Full Pin-code String Recognition for Postal Automation (UP, RKR, KR, FK), pp. 456–460.

ICDAR-2009-SunNFTH #detection #image #string

Trinary Image Mosaicing Based Watermark String Detection (JS, SN, YF, HT, YH), pp. 306–310.

ICDAR-2009-WangLJ #learning #modelling #segmentation #statistics #string

Statistical Modeling and Learning for Recognition-Based Handwritten Numeral String Segmentation (YW, XL, YJ), pp. 421–425.

ICDAR-2009-ZhouLN #online #random #recognition #string #using

Online Handwritten Japanese Character String Recognition Using Conditional Random Fields (XDZ, CLL, MN), pp. 521–525.

SIGMOD-2009-BinnigHF #in memory #memory management #string

Dictionary-based order-preserving string compression for main memory column stores (CB, SH, FF), pp. 283–296.

SIGMOD-2009-HadjieleftheriouKS #approximate #incremental #maintenance #normalisation #string

Incremental maintenance of length normalized indexes for approximate string matching (MH, NK, DS), pp. 429–440.

VLDB-2009-ArasuCK #learning #string

Learning String Transformations From Examples (AA, SC, RK), pp. 514–525.

VLDB-2009-HadjieleftheriouL #approximate #performance #string

Efficient Approximate Search on String Collections (MH, CL), pp. 1660–1661.

TACAS-2009-BjornerTV #analysis #source code #string

Path Feasibility Analysis for String-Manipulating Programs (NB, NT, AV), pp. 307–321.

TACAS-2009-YuBI #analysis #string #verification

Symbolic String Verification: Combining String Analysis and Size Analysis (FY, TB, OHI), pp. 322–336.

SAS-2009-DohKS #parsing #static analysis #string #using

Abstract Parsing: Static Analysis of Dynamically Generated String Output Using LR-Parsing Technology (KGD, HK, DAS), pp. 256–272.

CIAA-2009-Navarro #automaton #implementation #string

Implementation and Application of Automata in String Processing (GN), p. 1.

LATA-2009-FredrikssonG #string

Nested Counters in Bit-Parallel String Matching (KF, SG), pp. 338–349.

LATA-2009-MatsubaraKBS #string

A Series of Run-Rich Strings (WM, KK, HB, AS), pp. 578–587.

HIMI-II-2009-BergerKE #string #visual notation

Visual String of Reformulation (AB, JK, ME), pp. 239–248.

CIKM-2009-MouzaLRS #algebra #n-gram #named #string #using

AS-index: a structure for string search using n-grams and algebraic signatures (CdM, WL, PR, TJES), pp. 295–304.

SIGIR-2009-SubramaniamSDV #fuzzy #similarity #string #using

Experiments in CLIR using fuzzy string search based on surface similarity (SS, AKS, PD, VV), pp. 682–683.

SAC-2009-WeiSW #algorithm #clustering #email #fuzzy #novel #string

Clustering malware-generated spam emails with a novel fuzzy string matching algorithm (CW, AS, GW), pp. 889–890.

ICSE-2009-GeayPTRD #analysis #composition #precise #string

Modular string-sensitive permission analysis with demand-driven precision (EG, MP, TT, BGR, JD), pp. 177–187.

ICSE-2009-WangZXMS #constant #string

Locating need-to-translate constant strings for software internationalization (XW, LZ, TX, HM, JS), pp. 353–363.

ICSE-2009-WangZXMS09a #automation #named #string

TranStrL: An automatic need-to-translate string locator for software internationalization (XW, LZ, TX, HM, JS), pp. 555–558.

ISSTA-2009-KiezunGGHE #constraints #named #string

HAMPI: a solver for string constraints (AK, VG, PJG, PH, MDE), pp. 105–116.

PODS-2008-FerraginaGGSV #on the #string

On searching compressed string collections cache-obliviously (PF, RG, AG, RS, JSV), pp. 181–190.

SIGMOD-2008-ArasuCGK #string

Incorporating string transformations in record matching (AA, SC, KG, RK), pp. 1231–1234.

SIGMOD-2008-YangWL #approximate #cost analysis #query #string

Cost-based variable-length-gram selection for string collections to support approximate queries efficiently (XY, BW, CL), pp. 353–364.

DLT-2008-CaludeNSS #recursion #set #string

Universal Recursively Enumerable Sets of Strings (CSC, AN, LS, FS), pp. 170–182.

DLT-2008-CrochemoreFIJ #bound #string

Bounds on Powers in Strings (MC, SZF, CSI, IJ), pp. 206–215.

LATA-2008-Giraud #string

Not So Many Runs in Strings (MG), pp. 232–239.

LATA-2008-Leupold #on the #string #term rewriting

On Regularity-Preservation by String-Rewriting Systems (PL), pp. 345–356.

CIKM-2008-StroeBNP #approach #approximate #string

An approximate string matching approach for handling incorrectly typed urls (MS, RB, CN, DP), pp. 1339–1340.

ICPR-2008-RebecchiJ #on the #string

On the gaussian distribution of strings (SR, JMJ), pp. 1–4.

ICPR-2008-Wang #algorithm #string

A new method to obtain the shift-table in Boyer-Moore’s string matching algorithm (YW), pp. 1–4.

KDD-2008-KoenigsteinST #analysis #query #string #using

Spotting out emerging artists using geo-aware analysis of P2P query strings (NK, YS, TT), pp. 937–945.

OOPSLA-2008-KawachiyaOO #analysis #java #memory management #reduction #string

Analysis and reduction of memory inefficiencies in Java strings (KK, KO, TO), pp. 385–402.

POPL-2008-BohannonFPPS #lens #named #string

Boomerang: resourceful lenses for string data (AB, JNF, BCP, AP, AS), pp. 407–419.

CC-2008-KhedkerK #analysis #data flow #interprocedural #performance #precise #string

Efficiency, Precision, Simplicity, and Generality in Interprocedural Data Flow Analysis: Resurrecting the Classical Call Strings Method (UPK, BK), pp. 213–228.

CSL-2008-Curien #diagrams #string

The Joy of String Diagrams (PLC), pp. 15–22.

ICDAR-2007-HuangLM #string #using

Cryptogram Decoding for OCR Using Numerization Strings (GBH, EGLM, AM), pp. 208–212.

ICDAR-2007-ZhouYLNM #geometry #online #recognition #string

Online Handwritten Japanese Character String Recognition Incorporating Geometric Context (XDZ, JLY, CLL, TN, KM), pp. 48–52.

VLDB-2007-LeeNS #distance #edit distance #string

Extending Q-Grams to Estimate Selectivity of String Matching with Low Edit Distance (HL, RTN, KS), pp. 195–206.

VLDB-2007-LitwinMRS #algebra #performance #string #using

Fast nGram-Based String Search Over Data Encoded Using Algebraic Signatures (WL, RM, PR, TJES), pp. 207–218.

VLDB-2007-LiWY #approximate #named #performance #query #string #using

VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams (CL, BW, XY), pp. 303–314.

CIAA-2007-IliopoulosRVV #problem #sequence #string

The Constrained Longest Common Subsequence Problem for Degenerate Strings (CSI, MSR, MV, LV), pp. 309–311.

CIAA-2007-PeltolaT #on the #string

On String Matching in Chunked Texts (HP, JT), pp. 157–167.

LATA-2007-AntoniouCIP #set #string

Application of suffix trees for the acquisition of common motifs with gaps in a set of strings (PA, MC, CSI, PP), pp. 57–66.

KDD-2007-AggarwalY #classification #data type #on the #string

On string classification in data streams (CCA, PSY), pp. 36–45.

PADL-2007-CouttsSL #haskell #string

Rewriting Haskell Strings (DC, DS, RL), pp. 50–64.

DRR-2006-BentleyM #challenge #problem #string

CAPTCHA challenge strings: problems and improvements (JLB, CLM).

HT-2006-Ruddle #hypermedia #navigation #string #using

Using string-matching to analyze hypertext navigation (RAR), pp. 49–52.

PODS-2006-BenderFK #string

Cache-oblivious string B-trees (MAB, MFC, BCK), pp. 233–242.

SAS-2006-AllamigeonGH #c #embedded #source code #static analysis #string

Static Analysis of String Manipulations in Critical Embedded C Programs (XA, WG, CH), pp. 35–51.

DLT-J-2005-FreydenbergerRS06 #ambiguity #image #string

Unambiguous Morphic Images of Strings (DDF, DR, JCS), pp. 601–628.

CIAA-2006-Hyyro #approximate #automaton #nondeterminism #string

Tighter Packed Bit-Parallel NFA for Approximate String Matching (HH), pp. 287–289.

DLT-2006-DassowV #finite #multi #string

Ciliate Bio-operations on Finite String Multisets (JD, GV), pp. 168–179.

ICGT-2006-RiedlSF #generative #graph grammar #order #strict #string #word

String Generating Hypergraph Grammars with Word Order Restrictions (MR, SS, IF), pp. 138–152.

CHI-2006-BlaskoNF #interactive #mobile #prototype #string

Prototyping retractable string-based interaction techniques for dual-display mobile devices (GB, CN, SF), pp. 369–372.

CIKM-2006-AssfalgBK #3d #classification #kernel #named #string

3DString: a feature string kernel for 3D object classification on voxelized data (JA, KMB, HPK), pp. 198–207.

CIKM-2006-GollapudiP06a #approximate #string #taxonomy

A dictionary for approximate string search and longest prefix search (SG, RP), pp. 768–775.

ECIR-2006-FreschiSB #email #obfuscation #string

Filtering Obfuscated Email Spam by means of Phonetic String Matching (VF, AS, AB), pp. 505–509.

ICML-2006-TeoV #array #kernel #performance #string #using

Fast and space efficient string kernels using suffix arrays (CHT, SVNV), pp. 929–936.

ICPR-v2-2006-FuDLJR #algorithm #novel #recognition #segmentation #string

A Novel Segmentation and Recognition Algorithm for Chinese Handwritten Address Character Strings (QF, XQD, TL, YJ, ZR), pp. 974–977.

ICPR-v2-2006-InoueNK #analysis #feature model #kernel #recognition #string #using

Historical Hand-Written String Recognition by Non-linear Discriminant Analysis using Kernel Feature Selection (RI, HN, NK), pp. 1094–1097.

ICPR-v2-2006-JiangDR #recognition #string

Substring Alignment Method for Lexicon Based Handwritten Chinese String Recognition and Its Application to Address Line Recognition (YJ, XD, ZR), pp. 683–686.

ICPR-v3-2006-TamakiSY #string

String-Like Occluding Region Extraction for Background Restoration (TT, HS, MY), pp. 615–618.

ICPR-v3-2006-WangB06a #challenge #image #string #trade-off

CAPTCHA Challenge Tradeoffs: Familiarity of Strings versus Degradation of Images (SYW, JLB), pp. 164–167.

ICPR-v4-2006-YuH #graph #kernel #string

String Kernels for Matching Seriated Graphs (HY, ERH), pp. 224–228.

SAC-2006-CavalinBBSO #recognition #string

An implicit segmentation-based method for recognition of handwritten strings of characters (PRC, AdSBJ, FB, RS, LESdO), pp. 836–840.

ICSE-2006-MartinX #analysis #comprehension #interface #string

Understanding software application interfaces via string analysis (EM, TX), pp. 901–904.

CSL-2006-Mellies #diagrams #string

Functorial Boxes in String Diagrams (PAM), pp. 1–30.

RTA-2006-HofbauerW #matrix #string #termination

Termination of String Rewriting with Matrix Interpretations (DH, JW), pp. 328–342.

DRR-2005-SadriSB #approach #recognition #segmentation #string

New approach for segmentation and recognition of handwritten numeral strings (JS, CYS, TDB), pp. 92–100.

ICDAR-2005-FuDLJ #algorithm #markov #modelling #recognition #segmentation #string

A Hidden Markov Model Based Segmentation and Recognition Algorithm for Chinese Handwritten Address Character Strings (QF, XQD, CSL, YJ), pp. 590–594.

ICDAR-2005-HepingWG #evaluation #string

An Evaluation System for String Extraction in the Airline Coupon Project (YH, ZW, SG), pp. 930–934.

VLDB-2005-JinL #estimation #fuzzy #scalability #set #string

Selectivity Estimation for Fuzzy String Predicates in Large Data Sets (LJ, CL), pp. 397–408.

VLDB-2005-LimWV #classification #estimation #online #string #xml

CXHist : An On-line Classification-Based Histogram for XML String Selectivity Estimation (LL, MW, JSV), pp. 1187–1198.

FoSSaCS-2005-AehligMO #safety #strict #string

Safety Is not a Restriction at Level 2 for String Languages (KA, JGdM, CHLO), pp. 490–504.

PASTE-2005-ChristodorescuKG #analysis #string

String analysis for x86 binaries (MC, NK, WHG), pp. 88–95.

CIAA-J-2004-GeserHWZ05 #automaton #finite #string #term rewriting #termination

Finding finite automata that certify termination of string rewriting systems (AG, DH, JW, HZ), pp. 471–486.

DLT-J-2004-Freund05 #array #string

P Systems working in the sequential mode on arrays and strings (RF), pp. 663–682.

DLT-2005-BatuS #approximate #consistency #parsing #string

Locally Consistent Parsing and Applications to Approximate String Comparisons (TB, SCS), pp. 22–35.

DLT-2005-FreydenbergerRS #ambiguity #image #string

Unambiguous Morphic Images of Strings (DDF, DR, JCS), pp. 248–259.

ICALP-2005-Farach-ColtonLST #approximate #performance #string

Optimal Spaced Seeds for Faster Approximate String Matching (MFC, GML, SCS, DT), pp. 1251–1262.

ICEIS-v1-2005-XuePQZ #database #hybrid #scalability #string

The Hybrid Digital Tree: A New Indexing Technique for Large String Databases (QX, SP, GQ, QZ), pp. 115–121.

CIKM-2005-AekaterinidisT #internet #network #string

Internet scale string attribute publish/subscribe data networks (IA, PT), pp. 44–51.

SAC-2005-BellaachiaR #database #performance #string

Efficiency of prefix and non-prefix codes in string matching over compressed databases on handheld devices (AB, IAR), pp. 993–997.

VLDB-2004-KoudasMS #database #flexibility #scalability #string

Flexible String Matching Against Large Databases in Practice (NK, AM, DS), pp. 1078–1086.

CIAA-2004-GeserHWZ #automaton #finite #string #termination

Finding Finite Automata That Certify Termination of String Rewriting (AG, DH, JW, HZ), pp. 134–145.

DLT-2004-Freund #array #string

P Systems Working in the Sequential Mode on Arrays and Strings (RF), pp. 188–199.

ICALP-2004-FranceschiniG #data type #string

A General Technique for Managing Strings in Comparison-Driven Data Structures (GF, RG), pp. 606–617.

ICALP-2004-Rytter #algorithm #encoding #string

Grammar Compression, LZ-Encodings, and String Algorithms with Implicit Input (WR), pp. 15–27.

ICALP-2004-SahinalpU #problem #similarity #string

Hardness of String Similarity Search and Other Indexing Problems (SCS, AU), pp. 1080–1098.

ICGT-2004-SeifertF #generative #graph grammar #parsing #string

Parsing String Generating Hypergraph Grammars (SS, IF), pp. 352–367.

ICPR-v1-2004-LiuM #classification #recognition #string

Handwritten Numeral String Recognition: Character-Level vs. String-Level Classifier Training (CLL, KM), pp. 405–408.

ICPR-v2-2004-ParkYKJ #approach #recognition #segmentation #string

A Two-Stage Approach for Segmentation and Recognition of Handwritten Digit Strings Collected from Mail Pieces (SP, YY, GK, SHJ), pp. 626–629.

ICPR-v4-2004-Cardenas #classification #learning #multi #prototype #string

A Learning Model for Multiple-Prototype Classification of Strings (RAM), pp. 420–423.

HPCA-2004-NarayanasamyHSC #convergence #string #using

Creating Converged Trace Schedules Using String Matching (SN, YH, SS, BC), pp. 210–221.

RTA-2004-Waldmann #bound #named #string

Matchbox: A Tool for Match-Bounded String Rewriting (JW), pp. 85–94.

ICDAR-2003-LiWZ #approach #image #statistics #string #using

String Extraction From Color Airline Coupon Image Using Statistical Approach (YL, ZW, HZ), pp. 289–293.

ICDAR-2003-YouK #approach #network #segmentation #string #using

An approach for locating segmentation points of handwritten digit strings using a neural network (DY, GK), p. 142–?.

PEPM-2003-AgerDR #partial evaluation #pattern matching #performance #string

Fast partial evaluation of pattern matching in strings (MSA, OD, HKR), pp. 3–9.

SAS-2003-ChristensenMS #analysis #precise #string

Precise Analysis of String Expressions (ASC, AM, MIS), pp. 1–18.

DLT-2003-HofbauerW #string #term rewriting

Deleting String Rewriting Systems Preserve Regularity (DH, JW), pp. 337–348.

KDD-2003-BilenkoM #adaptation #detection #metric #similarity #string #using

Adaptive duplicate detection using learnable string similarity measures (MB, RJM), pp. 39–48.

CSL-2003-LeissR #automaton #string

Automata on Lempel-ziv Compressed Strings (HL, MdR), pp. 384–396.

RTA-2003-Geser #string #termination

Termination of String Rewriting Rules That Have One Pair of Overlaps (AG), pp. 410–423.

RTA-2003-SinotFM #performance #reduction #string

Efficient Reductions with Director Strings (FRS, MF, IM), pp. 46–60.

ASIA-PEPM-2002-AgerDR #on the #partial evaluation #string

On obtaining Knuth, Morris, and Pratt’s string matcher by partial evaluation (MSA, OD, HKR), pp. 32–46.

ASIA-PEPM-2002-FutamuraKG #algorithm #automation #generative #performance #string

Automatic generation of efficient string matching algorithms by generalized partial computation (YF, ZK, RG), pp. 1–8.

STOC-2002-SchaeferSS #graph #string

Recognizing string graphs in NP (MS, ES, DS), pp. 1–6.

CIAA-J-2000-BergeronH02 #algorithm #approximate #string

Vector Algorithms for Approximate String Matching (AB, SH), pp. 53–66.

CIAA-2002-Daciuk #algorithm #automaton #comparison #finite #set #string

Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings (JD), pp. 255–261.

CIAA-2002-Melichar #parsing #string

Deterministic Parsing of Cyclic Strings (BM), pp. 301–306.

ICALP-2002-BrodalLOP #problem #statistics #string

Solving the String Statistics Problem in Time O(n log n) (GSB, RBL, AÖ, CNSP), pp. 728–739.

ICALP-2002-DengLLMW #string

A PTAS for Distinguishing (Sub)string Selection (XD, GL, ZL, BM, LW), pp. 740–751.

ICML-2002-SaundersTS #kernel #string

Syllables and other String Kernel Extensions (CS, HT, JST), pp. 530–537.

ICPR-v3-2002-KimCS #performance #recognition #string

Post-Processing Scheme for Improving Recognition Performance of Touching Handwritten Numeral Strings (KKK, YC, CYS), pp. 327–330.

ICPR-v4-2002-BrittoSBS #predict #recognition #string

A String Length Predictor to Control the Level Building of HMMs for Handwritten Numeral Recognition (AdSBJ, RS, FB, CYS), pp. 31–34.

ICPR-v4-2002-JiangBAK #string

Curve Morphing by Weighted Mean of Strings (XJ, HB, KA, AK), p. 192–?.

ICPR-v4-2002-MollinedaVC #approach #approximate #string

A Windowed Weighted Approach for Approximate Cyclic String Matching (RAM, EV, FC), pp. 188–191.

KDD-2002-Aggarwal #classification #effectiveness #on the #string

On effective classification of strings with wavelets (CCA), pp. 163–172.

KDD-2002-TejadaKM #identification #independence #learning #string

Learning domain-independent string transformation weights for high accuracy object identification (ST, CAK, SM), pp. 350–359.

SIGIR-2002-TakedaU #adaptation #string #using

Selecting indexing strings using adaptation (YT, KU), pp. 427–428.

SIGIR-2002-Yang #documentation #keyword #string

Chinese keyword extraction based on max-duplicated strings of the documents (WY), pp. 439–440.

RTA-2002-Geser #string

Loops of Superexponential Lengths in One-Rule String Rewriting (AG), pp. 267–280.

ICDAR-2001-Breuel #algorithm #programming #segmentation #string #using

Segmentation of Handprinted Letter Strings Using a Dynamic Programming Algorithm (TMB), pp. 821–826.

ICDAR-2001-BrittoSBS #string

A Two-Stage HMM-Based System for Recognizing Handwritten Numeral Strings (AdSBJ, RS, FB, CYS), pp. 396–400.

ICDAR-2001-KimCKS #generative #recognition #string #using

Recognition of Unconstrained Handwritten Numeral Strings Using Decision Value Generator (KKK, YC, JHK, CYS), pp. 14–17.

ICDAR-2001-LiuKF #recognition #string

Lexicon-Driven Handwritten Character String Recognition for Japanese Address Reading (CLL, MK, HF), pp. 877–881.

ICDAR-2001-Takasu #approximate #documentation #performance #string

Document Filtering for Fast Approximate String Matching of Errorneous Text (AT), pp. 916–920.

ICDAR-2001-YoonLKC #paradigm #recognition #segmentation #string

New Paradigm for Segmentation and Recognition of Handwritten Numeral String (SY, YL, GK, YC), pp. 205–209.

PODS-2001-BenediktLSS #query #string

String Operations in Query Languages (MB, LL, TS, LS).

VLDB-2001-GravanoIJKMS #approximate #database #for free #string

Approximate String Joins in a Database (Almost) for Free (LG, PGI, HVJ, NK, SM, DS), pp. 491–500.

VLDB-2001-KahveciS #database #performance #string

Efficient Index Structures for String Databases (TK, AKS), pp. 351–360.

SAS-2001-DorRS #analysis #c #integer #source code #string

Cleanness Checking of String Manipulations in C Programs via Integer Analysis (ND, MR, SS), pp. 194–212.

STOC-2001-SchaeferS #decidability #graph #string

Decidability of string graphs (MS, DS), pp. 241–246.

DLT-2001-EiterGS #higher-order #logic #string

Second-Order Logic over Strings: Regular and Non-regular Fragments (TE, GG, TS), pp. 37–56.

DLT-2001-EngelfrietM #string #transducer

Hierarchies of String Languages Generated by Deterministic Tree Transducers (JE, SM), pp. 228–238.

DLT-2001-SosikF #string

String Rewriting Sequential P-Systems and Regulated Rewriting (PS, RF), pp. 379–388.

ICALP-2001-RivalsR #combinator #string

Combinatorics of Periods in Strings (ER, SR), pp. 615–626.

CIKM-2001-Collins-ThompsonSD #string

Improved String Matching Under Noisy Channel Conditions (KCT, CS, STD), pp. 357–364.

PPDP-2001-HernandezR #algorithm #development #logic programming #reuse #string

Development Reuse and the Logic Program Derivation of Two String-Matching Algorithms (MH, DAR), pp. 38–48.

LICS-2001-BenediktLSS #approach #string

A Model-Theoretic Approach to Regular String Relations (MB, LL, TS, LS), pp. 431–440.

SIGMOD-2000-JagadishKS #effectiveness #multi #on the #string

On Effective Multi-Dimensional Indexing for Strings (HVJ, NK, DS), pp. 403–414.

STOC-2000-GrossiV #array #string

Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract) (RG, JSV), pp. 397–406.

WLC-2000-ChoffrutG #formal method #string

The Theory of Rational Relations on Transfinite Strings (CC, SG), pp. 103–133.

ICPR-v2-2000-ChenW #analysis #segmentation #string #using

Segmentation of Handwritten Connected Numeral String Using Background and Foreground Analysis (YKC, JFW), pp. 2598–2601.

ICPR-v2-2000-JuanV #classification #edit distance #normalisation #on the #performance #string

On the Use of Normalized Edit Distances and an Efficient k-NN Search Technique (k-AESA) for Fast and Accurate String Classification (AJ, EV), pp. 2676–2679.

ICPR-v2-2000-KimSK #recognition #segmentation #string

Recognition of Unconstrained Handwritten Numeral Strings by Composite Segmentation Method (KKK, CYS, JHK), pp. 2594–2597.

ICPR-v2-2000-Martinez-HinarejosJC #classification #string

Use of Median String for Classification (CDMH, AJ, FC), pp. 2903–2906.

ICPR-v2-2000-MarzalB #distance #edit distance #string

Speeding Up the Computation of the Edit Distance for Cyclic Strings (AM, SB), pp. 2891–2894.

ICDAR-1999-BansalS99a #clustering #string #taxonomy

Partitioning and Searching Dictionary for Correction of Optically Read Devanagari Character Strings (VB, RMKS), pp. 653–656.

ICDAR-1999-ChaSS #algorithm #analysis #approximate #recognition #sequence #string

Approximate Stroke Sequence String Matching Algorithm for Character Recognition and Analysis (SHC, YCS, SNS), pp. 53–56.

ICDAR-1999-CheongKSK #recognition #string

Handwritten Numeral String Recognition with Stroke Grouping (CEC, HYK, JWS, HK), pp. 745–748.

ICDAR-1999-GaoDW #algorithm #segmentation #string

A Segmentation Algorithm for Handwritten Chinese Character Strings (JG, XD, YW), pp. 633–636.

ICDAR-1999-HaseSYSM #documentation #string

Character String Extraction from a Color Document (HH, TS, MY, MS, HM), pp. 75–78.

ICDAR-1999-WangGS #multi #recognition #string

Multi-experts for Touching Digit String Recognition (XW, VG, SNS), pp. 800–803.

FoSSaCS-1999-Maneth #metaprogramming #string #transducer

String Languages Generated by Total Deterministic Macro Tree Transducers (SM), pp. 258–272.

STOC-1999-FerraginaMB #approach #geometry #multi #problem #string

Multi-Method Dispatching: A Geometric Approach With Applications to String Matching Problems (PF, SM, MdB), pp. 483–491.

STOC-1999-LiMW #string

Finding Similar Regions in Many Strings (ML, BM, LW), pp. 473–482.

DLT-1999-KarhumakiP #complexity #on the #order #string

On the complexity of computing the order of repetition of a string (JK, WP), pp. 178–184.

CIKM-1999-DelisH #information management #representation #string

Binary String Relations: A Foundation for Spatiotemporal Knowledge Representation (VD, TH), pp. 27–37.

PADL-1999-HakliNTU #declarative #implementation #query #string

Implementing a Declarative String Query Language with String Restructuring (RH, MN, HT, EU), pp. 179–195.

CC-1999-Martin #analysis #comparison #functional #interprocedural #string

Experimental Comparison of call string and functional Approaches to Interprocedural Analysis (FM), pp. 63–75.

ICPR-1998-HuYY #algorithm #clustering #string

Algorithms for partitioning path construction of handwritten numeral strings (JH, DY, HY), pp. 372–374.

ICPR-1998-ProcterIE #markov #modelling #recognition #string #using

The recognition of handwritten digit strings of unknown length using hidden Markov models (SP, JI, AJE), pp. 1515–1517.

ICPR-1998-ShikuKN #string #using

A method for character string extraction using local and global segment crowdedness (OS, KK, AN), pp. 1077–1080.

HPDC-1998-RoyC #clustering #distributed #memory management #multi #named #string #symmetry

Strings: A High-Performance Distributed Shared Memory for Symmetrical Multiprocessor Clusters (SR, VC), pp. 90–97.

LICS-1998-EiterGG #higher-order #logic #string

Existential Second-Order Logic over Strings (TE, GG, YG), pp. 16–27.

ICDAR-1997-ChenW #string

A System for Extracting and Recognizing Numeral Strings on Maps (LHC, JYW), pp. 337–341.

ICDAR-1997-Favata #approximate #recognition #string #using #word

General word recognition using approximate segment-string matching (JTF), pp. 92–96.

ICDAR-1997-HaseSYSM #multi #string

Character String Extraction by Multi-stage Relaxation (HH, TS, MY, MS, HM), pp. 298–302.

ICDAR-1997-SawaTWKM #automation #quality #recognition #string

Low Quality String Recognition for Factory Automation (KS, ST, TW, FK, YM), pp. 475–478.

ICDAR-1997-Takasu #approximate #string

An Approximate String Match for Garbled Text with Various Accuracy (AT), pp. 957–961.

ICDAR-1997-WatanabeZ #recognition #string #validation

Recognition of Character Strings from Color Urban Map Imageson the Basis of Validation Mechanism (TW, RZ), pp. 805–808.

ICDAR-1997-ZhaoSX #string

A New Method for Segmenting Unconstrained Handwritten Numeral String (BZ, HS, SX), pp. 524–527.

STOC-1997-ArgeFGV #memory management #on the #sorting #string

On Sorting Strings in External Memory (Extended Abstract) (LA, PF, RG, JSV), pp. 540–548.

DLT-1997-DavidES #learning #string

Learning String Adjunct and Tree Adjunct Languages (NGD, JDE, KGS), pp. 411–427.

ICALP-1997-NarendranO #confluence #decidability #finite #problem #string #term rewriting #word

The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent (PN, FO), pp. 638–648.

ICFP-1997-KrasnogorLMP97a #modelling #string

Modelling String Folding with G2L Grammars (NK, PEML, PM, DAP), p. 314.

ICML-1997-RistadY #distance #edit distance #learning #string

Learning String Edit Distance (ESR, PNY), pp. 287–295.

SAC-1997-KhuriSC #approach #finite #string

Randomness of finite strings: a reconstructive approach (SK, FS, TC), pp. 527–531.

RTA-1997-Otto #on the #string #term rewriting

On the Property of Preserving Regularity for String-Rewriting Systems (FO), pp. 83–97.

STOC-1996-KosarajuD #assembly #scalability #string

Large-Scale Assembly of DNA Strings and Space-Efficient Construction of Suffix Trees (Correction) (SRK, ALD), p. 659.

ICALP-1996-PatersonP #complexity #on the #string

On the Complexity of String Folding (MP, TMP), pp. 658–669.

ICPR-1996-HeA #approach #clustering #documentation #string

A clustering-based approach to the separation of text strings from mixed text/graphics documents (SH, NA), pp. 706–710.

ICPR-1996-Melichar #automaton #difference #finite #string

String matching with k differences by finite automata (BM), pp. 256–260.

ICPR-1996-OkamotoYSY #network #online #string #using

On-line handwriting character string separation method using network expression (MO, HY, KS, KY), pp. 422–425.

ICPR-1996-Oncina #algorithm #string

The Cocke-Younger-Kasami algorithm for cyclic strings (JO), pp. 413–416.

ICPR-1996-TingL #classification #string #using

Business form classification using strings (AT, MKHL), pp. 690–694.

SIGIR-1996-ZobelD #information retrieval #lessons learnt #string

Phonetic String Matching: Lessons from Information Retrieval (JZ, PWD), pp. 166–172.

JICSLP-1996-PettorossiPR #algorithm #deduction #how #specification #string

How to Extend Partial Deduction to Derive the KMP String-Matching Algorithm from a Naive Specification (Poster Abstract) (AP, MP, SR), p. 539.

ICDAR-v1-1995-DeseillignyMS #re-engineering #recognition #string

Characters string recognition on maps, a method for high level reconstruction (MPD, HLM, GS), pp. 249–252.

ICDAR-v1-1995-LuoAD #approach #string

Directional mathematical morphology approach for line thinning and extraction of character strings from maps and line drawings (HL, GA, ID), pp. 257–260.

ICDAR-v2-1995-AnegawaSNOK #string

A system for recognizing numeric strings from topographical maps (MA, OS, AN, TO, HK), pp. 940–943.

ICDAR-v2-1995-CongedoDIP95a #segmentation #string

Segmentation of numeric strings (GC, GD, SI, GP), pp. 1038–1041.

ICDAR-v2-1995-FilatovGK #graph #recognition #string

Graph-based handwritten digit string recognition (AF, AG, IK), pp. 845–848.

ICDAR-v2-1995-HaNB #string

A system for segmenting and recognising totally unconstrained handwritten numeral strings (TMH, DN, HB), pp. 1003–1009.

ICDAR-v2-1995-KiseYTF #concept #diagrams #string

Interpretation of conceptual diagrams from line segments and strings (KK, NY, ST, KF), pp. 960–963.

ICDAR-v2-1995-RheePK #invariant #recognition #string

Rotation-invariant recognition of character strings for Korean cadastral map digitizing (PKR, JSP, YGK), pp. 944–947.

STOC-1995-CzumajGGPP #algorithm #parallel #problem #string

Work-time-optimal parallel algorithms for string problems (AC, ZG, LG, KP, WP), pp. 713–722.

STOC-1995-FarachT #string

String matching in Lempel-Ziv compressed strings (MF, MT), pp. 703–712.

STOC-1995-KosarajuD #assembly #scalability #string

Large-scale assembly of DNA strings and space-efficient construction of suffix trees (SRK, ALD), pp. 169–177.

ICALP-1995-Chen #algorithm #set #string

NC Algorithms for Finding a Maximal Set of Paths with Application to Compressing Strings (ZZC), pp. 99–110.

PODS-1994-GrahneNU #database #reasoning #string

Reasoning about Strings in Databases (GG, MN, EU), pp. 303–312.

STOC-1994-AnderssonHHP #array #complexity #string

The complexity of searching a sorted array of strings (AA, TH, JH, OP), pp. 317–325.

STOC-1994-Hagerup #algorithm #parallel #sorting #string

Optimal parallel string algorithms: sorting, merging and computing the minimum (TH), pp. 382–391.

ILPS-1994-Rajasekar #constraints #logic programming #string #theory and practice

Constraint Logic Programming on Strings: Theory and Applications (AR), p. 681.

ICDAR-1993-HonesL #documentation #string

Text string extraction within mixed-mode documents (FH, JL), pp. 655–659.

ICDAR-1993-NakamuraSANK #string #using

A method for recognizing character strings from maps using linguistic knowledge (AN, OS, MA, CN, HK), pp. 561–564.

ICDAR-1993-TakizawaAMI #documentation #image #string

Extraction of character strings from unformed document images (KT, DA, MM, KI), pp. 660–663.

ICDAR-1993-XuL #algorithm #image #string

A new algorithm separating text strings from map images (TX, XL), pp. 910–913.

STOC-1993-JiangL #string

k one-way heads cannot do string-matching (TJ, ML), pp. 62–70.

SIGIR-1993-OgawaBH #keyword #ranking #string #word

Simple Word Strings as Compound Keywords: An Indexing and Ranking Method for Japanese Texts (YO, AB, MH), pp. 227–236.

STOC-1992-Galil #algorithm #parallel #string

A Constant-Time Optimal Parallel String-Matching Algorithm (ZG), pp. 69–76.

STOC-1991-BreslauerG #bound #parallel #string

A Lower Bound for Parallel String Matching (DB, ZG), pp. 439–443.

ICALP-1991-MadlenerNO #monad #string #term rewriting

A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups (KM, PN, FO), pp. 279–290.

ICALP-1991-Naor #preprocessor #string

String Matching with Preprocessing of Text and Pattern (MN), pp. 739–750.

ML-1990-KoMT #learning #string

Learning String Patterns and Tree Patterns from Examples (KIK, AM, WGT), pp. 384–391.

ICALP-1989-GalilP #algorithm #approximate #string

An Improved Algorithm for Approximate String Matching (ZG, KP), pp. 394–404.

RTA-1989-Otto #canonical #congruence #finite #strict #string #term rewriting

Restrictions of Congruence Generated by Finite Canonical String-Rewriting Systems (FO), pp. 359–370.

ESEC-1987-Obst #string

Delta Technique and String-to-String Correction (WO), pp. 64–68.

RTA-1987-MadlenerO #finite #string #term rewriting

Groups Presented by Certain Classes of Finite Length-Reducing String-Rewriting Systems (KM, FO), pp. 133–144.

STOC-1986-LandauV #algorithm #approximate #parallel #performance #string

Introducing Efficient Parallelism into Approximate String Matching and a New Serial Algorithm (GML, UV), pp. 220–230.

ICALP-1985-Vishkin #parallel #pattern matching #string #summary

Optimal Parallel Pattern Matching in Strings (Extended Summary) (UV), pp. 497–508.

STOC-1984-Galil #algorithm #parallel #string

Optimal Parallel Algorithms for String Matching (ZG), pp. 240–248.

STOC-1983-Iwama #communication #multi #string

Unique Decomposability of Shuffled Strings: A Formal Treatment of Asynchronous Time-Multiplexed Communication (KI), pp. 374–381.

CADE-1982-Book #power of #string #term rewriting

The Power of the Church-Rosser Property for String Rewriting Systems (RVB), pp. 360–368.

STOC-1981-GalilS #string

Time-Space-Optimal String Matching (ZG, JIS), pp. 106–113.

POPL-1980-MorrisSW #experience #string

Experience with an Applicative String Processing Language (JHMJ, ES, PW), pp. 32–46.

STOC-1979-Angluin #set #string

Finding Patterns Common to a Set of Strings (Extended Abstract) (DA), pp. 130–141.

ICALP-1979-Commentz-Walter #algorithm #performance #string

A String Matching Algorithm Fast on the Average (BCW), pp. 118–132.

POPL-1979-LiuF #pattern matching #polynomial #string

String Pattern Matching in Polynomial Time (KCL, ACF), pp. 222–225.

ICALP-1978-Galil #algorithm #on the #string

On Improving the Worst Case Running Time of the Boyer-Moore String Matching Algorithm (ZG), pp. 241–250.

ICALP-1977-ChytilJ #composition #finite #source code #string #transducer

Serial Composition of 2-Way Finite-State Transducers and Simple Programs on Strings (MC, VJ), pp. 135–147.

DAC-1976-Persky #automation #layout #named #string

PRO — an automatic string placement program for polycell layout (GP), pp. 417–424.

STOC-1976-Galil #algorithm #realtime #recognition #string

Real-Time Algorithms for String-Matching and Palindrome Recognition (ZG), pp. 161–173.

STOC-1975-Wagner #complexity #on the #problem #string

On the Complexity of the Extended String-to-String Correction Problem (RAW), pp. 218–223.

POPL-1975-Stewart #algebra #string

An Algebraic Model for String Patterns (GFS), pp. 167–184.

SOSP-1973-ArvindKS #generative #on the #process #string

On Reference String Generation Processes (A, RYK, ES), pp. 80–87.

STOC-1972-KarpMR #agile #array #identification #string

Rapid Identification of Repeated Patterns in Strings, Trees and Arrays (RMK, REM, ALR), pp. 125–136.

LISP-1963-Evans #lisp #string

Character String manipulation in LISP (TE), p. 3.