BibSLEIGH — match stem

Used together with:

pattern (192)
base (169)
use (166)
graph (118)
imag (109)

Stem match$ (all stems)

1233 papers:

CBSE-2015-PlateniusSA #framework #named #process: MatchBox: A Framework for Dynamic Configuration of Service Matching Processes (MCP, WS, SA), pp. 75–84.
DAC-2015-YaoHC #constraints #named: PACOR: practical control-layer routing flow with length-matching constraint for flow-based microfluidic biochips (HY, TYH, YC), p. 6.
VLDB-2015-ChangLZYZQ #performance: Optimal Enumeration: Efficient Top-k Tree Matching (LC, XL, WZ, JXY, YZ, LQ), pp. 533–544.
VLDB-2015-KazemiHG #graph: Growing a Graph Matching from a Handful of Seeds (EK, SHH, MG), pp. 1010–1021.
VLDB-2015-PapadopoulosPTT #authentication #pattern matching #proving: Practical Authenticated Pattern Matching with Optimal Proof Size (DP, CP, RT, NT), pp. 750–761.
ESOP-2015-CastagnaI0B #calculus #pattern matching #xquery: A Core Calculus for XQuery 3.0 — Combining Navigational and Pattern Matching Approaches (GC, HI, KN, VB), pp. 232–256.
MSR-2015-HauffG #developer #git: Matching GitHub Developer Profiles to Job Advertisements (CH, GG), pp. 362–366.
STOC-2015-AbboudWY: Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (AA, VVW, HY), pp. 41–50.
CIAA-J-2013-INIBT15 #automaton #taxonomy: Compressed automata for dictionary matching (TI, TN, SI, HB, MT), pp. 30–41.
DLT-2015-NgRS #approximate #complexity #pattern matching: State Complexity of Neighbourhoods and Approximate Pattern Matching (TN, DR, KS), pp. 389–400.
ICALP-v1-2015-BernsteinS #graph: Fully Dynamic Matching in Bipartite Graphs (AB, CS), pp. 167–179.
ICALP-v1-2015-CsehHK: Popular Matchings with Two-Sided Preferences and One-Sided Ties (ÁC, CCH, TK), pp. 367–379.
ICALP-v1-2015-WangW #algorithm #online: Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm (YW, SCwW), pp. 1070–1081.
ICALP-v2-2015-BhattacharyaHHK #maintenance: Maintaining Near-Popular Matchings (SB, MH, CCH, TK, LW), pp. 504–515.
LATA-2015-BartonIP #approximate #string: Average-Case Optimal Approximate Circular String Matching (CB, CSI, SPP), pp. 85–96.
LATA-2015-TravnicekJMC #pattern matching: Backward Linearised Tree Pattern Matching (JT, JJ, BM, LGC), pp. 599–610.
ICFP-2015-KarachaliasSVJ #data type #lazy evaluation #pattern matching: GADTs meet their match: pattern-matching warnings that account for GADTs, guards, and laziness (GK, TS, DV, SLPJ), pp. 424–436.
ICFP-2015-RendelTO #automation #pattern matching #problem: Automatic refunctionalization to a language with copattern matching: with applications to the expression problem (TR, JT, KO), pp. 269–279.
ICGT-2015-BurUHV #pattern matching #search-based: Local Search-Based Pattern Matching Features in EMF-IncQuery (MB, ZU, ÁH, DV), pp. 275–282.
ICGT-2015-Horn #clojure #domain-specific language #embedded #graph #pattern matching: Graph Pattern Matching as an Embedded Clojure DSL (TH), pp. 189–204.
CHI-2015-AndristMT #motivation: Look Like Me: Matching Robot Personality via Gaze to Increase Motivation (SA, BM, AT), pp. 3603–3612.
CHI-2015-MayerHJ #challenge #concept #design #social: Making Social Matching Context-Aware: Design Concepts and Open Challenges (JMM, SRH, QJ), pp. 545–554.
HIMI-IKC-2015-NoridukiSIT #fault: Map Matching to Correct Location Error in an Electric Wheel Chair (YN, HS, SI, HT), pp. 243–252.
ICML-2015-LiSZ #generative #network: Generative Moment Matching Networks (YL, KS, RSZ), pp. 1718–1727.
KDD-2015-GogaLSTG #network #on the #online #reliability #scalability #social: On the Reliability of Profile Matching Across Large Online Social Networks (OG, PL, RS, RT, KPG), pp. 1799–1808.
KDD-2015-JohanssonD #geometry #graph #learning #similarity #using: Learning with Similarity Functions on Graphs using Matchings of Geometric Embeddings (FDJ, DPD), pp. 467–476.
KDD-2015-YangSTML: Entity Matching across Heterogeneous Sources (YY, YS, JT, BM, JZL), pp. 1395–1404.
SEKE-2015-ZouCH #impact analysis #mobile #topic #user interface: Topic Matching Based Change Impact Analysis from Feature on User Interface of Mobile Apps (QZ, XC, YH), pp. 477–482.
SIGIR-2015-Gupta #named: CricketLinking: Linking Event Mentions from Cricket Match Reports to Ball Entities in Commentaries (MG), pp. 1033–1034.
ICMT-J-2012-VarroDWS15 #algorithm #emf #generative #modelling #pattern matching: An algorithm for generating model-sensitive search plans for pattern matching on EMF models (GV, FD, MW, AS), pp. 597–621.
SAC-2015-0001RMW #approach #behaviour #constraints #process: Matching of events and activities: an approach based on behavioral constraint satisfaction (TB, ARS, JM, MW), pp. 1225–1230.
SAC-2015-MestrePN #adaptation #pipes and filters: Adaptive sorted neighborhood blocking for entity matching with MapReduce (DGM, CESP, DCN), pp. 981–987.
ESEC-FSE-2015-BordingBP: Comprehensive service matching with MatchBox (PB, MB, MCP), pp. 974–977.
CAV-2015-BansalR0BW: Deciding Local Theory Extensions via E-matching (KB, AR, TK, CWB, TW), pp. 87–105.
RTA-2015-Rosu #logic: Matching Logic — Extended Abstract (Invited Talk) (GR), pp. 5–21.
ECSA-2014-NoiaMS #design: Ontology-Driven Pattern Selection and Matching in Software Design (TDN, MM, EDS), pp. 82–89.
CASE-2014-ChouW #image #locality: 1-point affine RANSAC for scene image matching in appearance-based localization (CCC, CCW), pp. 1194–1199.
CASE-2014-HuangJXGX #energy #nondeterminism #probability #scheduling: EV charging load scheduling following uncertain renewable energy supply by stochastic matching (QH, QSJ, LX, XG, XX), pp. 137–142.
DATE-2014-TtofisT #hardware #image #realtime: High-quality real-time hardware stereo matching based on guided image filtering (CT, TT), pp. 1–6.
DRR-2014-GaoRKL #database #documentation #image #performance #retrieval: Fast structural matching for document image retrieval through spatial databases (HG, MR, DK, JL), p. ?–10.
SIGMOD-2014-ChiangDN #evolution #modelling: Modeling entity evolution for temporal record matching (YHC, AD, JFN), pp. 1175–1186.
SIGMOD-2014-GokhaleDDNRSZ #crowdsourcing #named: Corleone: hands-off crowdsourcing for entity matching (CG, SD, AD, JFN, NR, JWS, XZ), pp. 601–612.
SIGMOD-2014-ZhangZCJC #named: CrowdMatcher: crowd-assisted schema matching (CJZ, ZZ, LC, HVJ, CCC), pp. 721–724.
SIGMOD-2014-ZhuSL0Z: Matching heterogeneous event data (XZ, SS, XL, JW, LZ), pp. 1211–1222.
VLDB-2014-ChiangDN #algorithm #performance: Tracking Entities in the Dynamic World: A Fast Algorithm for Matching Temporal Records (YHC, AD, JFN), pp. 469–480.
VLDB-2014-LondheGZNS #community #detection: Matching Titles with Cross Title Web-Search Enrichment and Community Detection (NL, VG, AZ, HQN, RKS), pp. 1167–1178.
VLDB-2015-SongGCW14 #graph #pattern matching: Event Pattern Matching over Graph Streams (CS, TG, CXC, JW), pp. 413–424.
STOC-2014-AgarwalS #algorithm #approximate #geometry #metric: Approximation algorithms for bipartite matching with metric and geometric costs (PKA, RS), pp. 555–564.
STOC-2014-HsuHRRW: Private matchings and allocations (JH, ZH, AR, TR, ZSW), pp. 21–30.
STOC-2014-Rothvoss #complexity #exponential: The matching polytope has exponential extension complexity (TR), pp. 263–272.
FLOPS-2014-NaR #formal method #subclass #type system: A New Formalization of Subtyping to Match Subclasses to Subtypes (HN, SR), pp. 238–252.
AFL-2014-BerglundDM #backtracking #behaviour #regular expression: Analyzing Catastrophic Backtracking Behavior in Practical Regular Expression Matching (MB, FD, BvdM), pp. 109–123.
DLT-2014-EhlersMMN #pattern matching: k-Abelian Pattern Matching (TE, FM, RM, DN), pp. 178–190.
ICALP-v1-2014-GuptaTW #multi #optimisation: Changing Bases: Multistage Optimization for Matroids and Matchings (AG, KT, UW), pp. 563–575.
LATA-2014-Khanna #random: Matchings, Random Walks, and Sampling (SK), pp. 32–33.
ICFP-2014-CockxDP #pattern matching: Pattern matching without K (JC, DD, FP), pp. 257–268.
CHI-2014-PasqualW #predict #using: Mouse pointing endpoint prediction using kinematic template matching (PTP, JOW), pp. 743–752.
CHI-2014-VlahovicWKL #community #online: Support matching and satisfaction in an online breast cancer support community (TAV, YCW, REK, JML), pp. 1625–1634.
CSCW-2014-MillerZGG #collaboration #learning #people #research: Pair research: matching people for collaboration, learning, and productivity (RCM, HZ, EG, EG), pp. 1043–1048.
CAiSE-2014-BennacerJPQ #network #social: Matching User Profiles Across Social Networks (NB, CNJ, AP, GQ), pp. 424–438.
ICEIS-v1-2014-PengM #approximate #string: Approximate String Matching Techniques (TP, CM), pp. 217–224.
ICEIS-v2-2014-ZhengJL #hybrid #learning #taxonomy #using: Cross-Sensor Iris Matching using Patch-based Hybrid Dictionary Learning (BRZ, DYJ, YHL), pp. 169–174.
CIKM-2014-YuanW0 #graph #nondeterminism #query #scalability: Pattern Match Query in a Large Uncertain Graph (YY, GW, LC), pp. 519–528.
CIKM-2014-ZhaoCCY #query: Query Augmentation based Intent Matching in Retail Vertical Ads (HZ, YC, JFC, TWY), pp. 619–628.
ECIR-2014-GhamdiG #graph #retrieval #video: Video Clip Retrieval by Graph Matching (MAG, YG), pp. 412–417.
ICML-c2-2014-ChenGH: Near-Optimal Joint Object Matching via Convex Relaxation (YC, LJG, QXH), pp. 100–108.
ICPR-2014-BekhetA #using #video: Compact Signature-Based Compressed Video Matching Using Dominant Color Profiles (DCP) (SB, AA), pp. 3933–3938.
ICPR-2014-ChengZSWY: Cross-Trees for Stereo Matching with Priors (FC, HZ, MS, HW, DY), pp. 208–213.
ICPR-2014-DhamechaSSV #effectiveness #on the: On Effectiveness of Histogram of Oriented Gradient Features for Visible to Near Infrared Face Matching (TID, PS, RS, MV), pp. 1788–1793.
ICPR-2014-DuDA #modelling #topic #using: Signature Matching Using Supervised Topic Models (XD, DSD, WAA), pp. 327–332.
ICPR-2014-GeXYS #image #synthesis #using: Image Completion Using Global Patch Matching and Optimal Seam Synthesis (SG, KX, RY, ZS), pp. 871–876.
ICPR-2014-Hast #invariant #robust: Robust and Invariant Phase Based Local Feature Matching (AH), pp. 809–814.
ICPR-2014-HuangCZ #performance: An Improved Filtering for Fast Stereo Matching (XH, GC, YZ), pp. 2448–2452.
ICPR-2014-HuangW #image: A Filtration Strategy Based on FD-CRF for Image Matching (SH, WW), pp. 3286–3291.
ICPR-2014-KimK #estimation #image #multi #pattern matching #robust: Robust Surface Pattern Matching for Ball Spin Estimation with Multi-exposed Images Under Varying Illumination Conditions (JK, MK), pp. 4560–4563.
ICPR-2014-Kobayashi #named #pattern matching: S3CCA: Smoothly Structured Sparse CCA for Partial Pattern Matching (TK), pp. 1981–1986.
ICPR-2014-KristoC: Optimized Window Arrangement for Spatial Pyramid Matching Scheme (K, CSC), pp. 1395–1400.
ICPR-2014-LeNVOT #documentation #retrieval #using: Document Retrieval Based on Logo Spotting Using Key-Point Matching (VPL, NN, MV, JMO, CDT), pp. 3056–3061.
ICPR-2014-LiuLFQGT #geometry #graph #retrieval: Plane Geometry Figure Retrieval Based on Bilayer Geometric Attributed Graph Matching (LL, XL, SF, JQ, LG, ZT), pp. 309–314.
ICPR-2014-LiuLS #documentation #image #novel: Novel Global and Local Features for Near-Duplicate Document Image Matching (LL, YL, CYS), pp. 4624–4629.
ICPR-2014-MesterC #statistics: When Patches Match — A Statistical View on Matching under Illumination Variation (RM, CC), pp. 4364–4369.
ICPR-2014-NakayamaHSSY #estimation: Accurate Camera Pose Estimation for KinectFusion Based on Line Segment Matching by LEHF (YN, TH, HS, MS, NY), pp. 2149–2154.
ICPR-2014-QuLWXT #framework #robust #set: Robust Point Set Matching under Variational Bayesian Framework (HBQ, JCL, JQW, LX, HJT), pp. 58–63.
ICPR-2014-ReschLL #image: Local Image Feature Matching Improvements for Omnidirectional Camera Systems (BR, JL, HPAL), pp. 918–923.
ICPR-2014-SaleemBS #image #robust #symmetry: A Gradient Extension of Center Symmetric Local Binary Patterns for Robust RGB-NIR Image Matching (SS, AB, RS), pp. 815–820.
ICPR-2014-ScottEMFA #pattern matching #scalability: GPU-Based PostgreSQL Extensions for Scalable High-Throughput Pattern Matching (GJS, ME, KM, ZF, DTA), pp. 1880–1885.
ICPR-2014-SilvaTT #approach #graph #named: BoG: A New Approach for Graph Matching (FBS, ST, RdST), pp. 82–87.
ICPR-2014-SongLZC #adaptation #performance #using: Scale Adaptive Tracking Using Mean Shift and Efficient Feature Matching (YS, SL, JZ, HC), pp. 2233–2238.
ICPR-2014-WakaharaY #2d #correlation #invariant: GPT Correlation for 2D Projection Transformation Invariant Template Matching (TW, YY), pp. 3810–3815.
ICPR-2014-YamashitaW #classification #using: k-NN Classification of Handwritten Characters Using a New Distortion-Tolerant Matching Measure (YY, TW), pp. 262–267.
ICPR-2014-ZambaniniKK #consistency #evaluation #geometry: Classifying Ancient Coins by Local Feature Matching and Pairwise Geometric Consistency Evaluation (SZ, AK, MK), pp. 3032–3037.
KDD-2014-LiL #quality #recommendation: Matching users and items across domains to improve the recommendation quality (CYL, SDL), pp. 801–810.
KDIR-2014-Bleiweiss #execution #machine learning #using: SoC Processor Discovery for Program Execution Matching Using Unsupervised Machine Learning (AB), pp. 192–201.
KEOD-2014-Otero-CerdeiraR #named #ontology: OntoPhil — Exploitation of Binding Points for Ontology Matching (LOC, FJRM, TVR, AMGR), pp. 5–15.
MLDM-2014-MalenichevSKMM #automation: An Automatic Matching Procedure of Ultrasonic Railway Defectograms (AM, VS, OK, VM, AM), pp. 315–327.
SIGIR-2014-Song #enterprise #multi #network #online #social #volunteer: Enrichment of user profiles across multiple online social networks for volunteerism matching for social enterprise (XS), p. 1282.
MoDELS-2014-GomesBA #classification #model transformation #pattern matching #tool support: Classification of Model Transformation Tools: Pattern Matching Techniques (CG, BB, VA), pp. 619–635.
MoDELS-2014-GomesBA #classification #model transformation #pattern matching #tool support: Classification of Model Transformation Tools: Pattern Matching Techniques (CG, BB, VA), pp. 619–635.
PPDP-2014-GiavittoE #realtime: Real-Time Matching of Antescofo Temporal Patterns (JLG, JE), pp. 93–104.
SAC-2014-A #authentication #health #mobile #network #privacy #research #student: Student research abstract: a privacy-preserving profile matching based authentication system for mobile health networks (DHA), pp. 196–197.
ISSTA-2014-ChoudharyPO #web: Cross-platform feature matching for web applications (SRC, MRP, AO), pp. 82–92.
CBSE-2013-PlateniusDBSE #bibliography #fuzzy #on the fly: A survey of fuzzy service matching approaches in the context of on-the-fly computing (MCP, MvD, SB, WS, GE), pp. 143–152.
DAC-2013-DinakarraoWY #3d #multi #reduction: Peak power reduction and workload balancing by space-time multiplexing based demand-supply matching for 3D thousand-core microprocessor (SMPD, KW, HY), p. 6.
DAC-2013-HoOCT #array: Coupling-aware length-ratio-matching routing for capacitor arrays in analog integrated circuits (KHH, HCO, YWC, HFT), p. 6.
DAC-2013-LinCLWC #detection #fuzzy #novel: A novel fuzzy matching model for lithography hotspot detection (SYL, JYC, JCL, WYW, SCC), p. 6.
DATE-2013-WangYWZ #3d #configuration management #manycore #network: 3D reconfigurable power switch network for demand-supply matching between multi-output power converters and many-core microprocessors (KW, HY, BW, CZ), pp. 1643–1648.
DRR-2013-AugereauJD #documentation #image #recognition: Semi-structured document image matching and recognition (OA, NJ, JPD).
DRR-2013-NayefB #geometry: Combining geometric matching with SVM to improve symbol spotting (NN, TMB).
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-DuAD #multi #scalability #using: Large-Scale Signature Matching Using Multi-stage Hashing (XD, WAA, DSD), pp. 976–980.
ICDAR-2013-LeVTO #categorisation #documentation: Improving Logo Spotting and Matching for Document Categorization by a Post-Filter Based on Homography (VPL, MV, DCT, JMO), pp. 270–274.
ICDAR-2013-SunBOK #detection #using: Specific Comic Character Detection Using Local Feature Matching (WS, JCB, JMO, KK), pp. 275–279.
SIGMOD-2013-KimS #algorithm #approximate #performance #string: Efficient top-k algorithms for approximate substring matching (YK, KS), pp. 385–396.
SIGMOD-2013-LiGC #named #realtime #sequence: ε-Matching: event processing over noisy sequences in real time (ZL, TG, CXC), pp. 601–612.
SIGMOD-2013-LongWYJ #on the #worst-case: On optimal worst-case matching (CL, RCWW, PSY, MJ), pp. 845–856.
SIGMOD-2013-YangWQWL #string #using: Improving regular-expression matching on strings using negative factors (XY, BW, TQ, YW, CL), pp. 361–372.
SIGMOD-2013-ZhangC #semantics #web: InfoGather+: semantic matching and annotation of numeric and time-varying attributes in web tables (MZ, KC), pp. 145–156.
VLDB-2013-FanWW #graph #pattern matching: Diversified Top-k Graph Pattern Matching (WF, XW, YW), pp. 1510–1521.
VLDB-2013-ManshadiAGKMS #algorithm #distributed #scalability: A Distributed Algorithm for Large-Scale Generalized Matching (FMM, BA, RG, RK, JM, MS), pp. 613–624.
VLDB-2013-WangWPWH #adaptation #segmentation: A Data-adaptive and Dynamic Segmentation Index for Whole Matching on Time Series (YW, PW, JP, WW, SH), pp. 793–804.
VLDB-2013-ZhangCJC #crowdsourcing #nondeterminism: Reducing Uncertainty of Schema Matching via Crowdsourcing (CJZ, LC, HVJ, CCC), pp. 757–768.
ICSM-2013-LeTL #fault #locality #theory and practice: Theory and Practice, Do They Match? A Case with Spectrum-Based Fault Localization (TDBL, FT, DL), pp. 380–383.
PASTE-2013-Lu #automation #mining: Automatically mining program build information via signature matching (CDL), pp. 25–32.
WCRE-2013-BernardiCL #approach #design pattern #detection #graph #modelling: A model-driven graph-matching approach for design pattern detection (MLB, MC, GADL), pp. 172–181.
WCRE-2013-KomondoorBDK #domain model #modelling #using: Using relationships for matching textual domain models with existing code (RK, IB, DD, SK), pp. 371–380.
PEPM-2013-AlpuenteFV #automation #logic #specification #using: Automatic inference of specifications using matching logic (MA, MAF, AV), pp. 127–136.
PLDI-2013-IsradisaikulM #pattern matching: Reconciling exhaustive pattern matching with objects (CI, ACM), pp. 343–354.
STOC-2013-BhowmickDL #bound #product line: New bounds for matching vector families (AB, ZD, SL), pp. 823–832.
STOC-2013-CyganKN #performance: Fast hamiltonicity checking via bases of perfect matchings (MC, SK, JN), pp. 301–310.
STOC-2013-KeevashKM #polynomial: Polynomial-time perfect matchings in dense hypergraphs (PK, FK, RM), pp. 311–320.
STOC-2013-NeimanS #algorithm: Simple deterministic algorithms for fully dynamic maximal matching (ON, SS), pp. 745–754.
CIAA-2013-Crespi-ReghizziP #parallel: Deterministic Counter Machines and Parallel Matching Computations (SCR, PSP), pp. 280–291.
CIAA-2013-HanKS #approximate #automaton #context-free grammar #finite: Approximate Matching between a Context-Free Grammar and a Finite-State Automaton (YSH, SKK, KS), pp. 146–157.
CIAA-2013-INIBT #automaton #taxonomy: Compressed Automata for Dictionary Matching (TI, TN, SI, HB, MT), pp. 319–330.
ICALP-v1-2013-Curticapean: Counting Matchings of Size k Is W[1]-Hard (RC), pp. 352–363.
ICALP-v1-2013-KonradR #approximate #communication #streaming: Approximating Semi-matchings in Streaming and in Two-Party Communication (CK, AR), pp. 637–649.
ICALP-v2-2013-FaustHV #outsourcing #pattern matching: Outsourced Pattern Matching (SF, CH, DV), pp. 545–556.
LATA-2013-SippuS #multi #online: Online Matching of Multiple Regular Patterns with Gaps and Character Classes (SS, ESS), pp. 523–534.
SEFM-2013-SargolzaeiSAA #approximate #behaviour #web #web service: A Tool for Behaviour-Based Discovery of Approximately Matching Web Services (MS, FS, FA, HA), pp. 152–166.
DUXU-WM-2013-KondoK #development #evaluation #image #interactive #prototype #using #visual notation: Trial of Diagnostic to Find Preferable Job Using the Visual Image Information Interaction: Prototype Development and Evaluation in Global Human Resources Matching Site (AK, NK), pp. 525–532.
HCI-AS-2013-JonssonD #information management: In-Car Information Systems: Matching and Mismatching Personality of Driver with Personality of Car Voice (IMJ, ND), pp. 586–595.
HCI-III-2013-JuL #algorithm: A Dense Stereo Matching Algorithm with Occlusion and Less or Similar Texture Handling (HJ, CL), pp. 171–177.
CIKM-2013-ThostVS #query #recommendation: Query matching for report recommendation (VT, KV, DS), pp. 1391–1400.
KDD-2013-BaiJS #automation #generative #set: Exploiting user clicks for automatic seed set generation for entity matching (XB, FPJ, SHS), pp. 980–988.
KDD-2013-Lacoste-JulienPDKGG #knowledge base #named #scalability: SIGMa: simple greedy matching for aligning large knowledge bases (SLJ, KP, AD, GK, TG, ZG), pp. 572–580.
KEOD-2013-ChaabaneG #challenge #formal method #ontology: Matching Spatial Ontologies — A Challenge of Formalization (SC, FG), pp. 355–360.
KEOD-2013-SagaeF #development #identification #image: Knowledge Resource Development for Identifying Matching Image Descriptions (AS, SEF), pp. 100–108.
RecSys-2013-KaminskasRS #hybrid #music #recommendation #using: Location-aware music recommendation using auto-tagging and hybrid matching (MK, FR, MS), pp. 17–24.
SIGIR-2013-AbdulahhadCB #nondeterminism #probability #question: Is uncertain logical-matching equivalent to conditional probability? (KA, JPC, CB), pp. 825–828.
SIGIR-2013-CastilloMS #online #web: Online matching of web content to closed captions in IntoNow (CC, GDFM, AS), pp. 1115–1116.
SIGIR-2013-KarkaliPV #realtime #recommendation: Match the news: a firefox extension for real-time news recommendation (MK, DP, MV), pp. 1117–1118.
ICMT-2013-VarroD #algorithm #incremental #network #pattern matching: A Rete Network Construction Algorithm for Incremental Pattern Matching (GV, FD), pp. 125–140.
GPCE-2013-SolodkyyRS #c++ #pattern matching: Open pattern matching for C++ (YS, GDR, BS), pp. 33–42.
SAC-OOPS-J-2009-SaitoI13 #type system: Matching MyType to subtyping (CS, AI), pp. 933–952.
SAC-2013-BhattacharjeeJ #algorithm #named #repository #scalability #similarity: CodeBlast: a two-stage algorithm for improved program similarity matching in large software repositories (AB, HMJ), pp. 846–852.
ESEC-FSE-2013-Platenius #fuzzy #on the fly: Fuzzy service matching in on-the-fly computing (MCP), pp. 715–718.
PPoPP-2013-YuB #automaton #performance #regular expression: Exploring different automata representations for efficient regular expression matching on GPUs (XY, MB), pp. 287–288.
LICS-2013-AndersonDH #fixpoint #linear #logic #programming: Maximum Matching and Linear Programming in Fixed-Point Logic with Counting (MA, AD, BH), pp. 173–182.
TLCA-2013-DudderMR #type system: Intersection Type Matching with Subtyping (BD, MM, JR), pp. 125–139.
CASE-2012-YanG #estimation #physics: Time-delay estimation of ultrasonic echoes based on the physical model matching (XY, LG), pp. 469–473.
DAC-2012-OuCC #constraints #multi: Non-uniform multilevel analog routing with matching constraints (HCO, HCCC, YWC), pp. 549–554.
DATE-2012-SahlbachWE: A high-performance dense block matching solution for automotive 6D-vision (HS, SW, RE), pp. 268–271.
DocEng-2012-WorchLG: Glyph spotting for mediaeval handwritings by template matching (JHW, ML, BG), pp. 213–216.
SIGMOD-2012-LiG #online #probability #sequence: Online windowed subsequence matching over probabilistic sequences (ZL, TG), pp. 277–288.
SIGMOD-2012-YakoutGCC #named #web: InfoGather: entity augmentation and attribute discovery by holistic matching with web tables (MY, KG, KC, SC), pp. 97–108.
SIGMOD-2012-ZhuLZZY #named #similarity: TreeSpan: efficiently computing similarity all-matching (GZ, XL, KZ, WZ, JXY), pp. 529–540.
VLDB-2012-KotsifakosPHGAK #named #sequence: Hum-a-song: A Subsequence Matching with Gaps-Range-Tolerances Query-By-Humming System (AK, PP, JH, DG, VA, GK), pp. 1930–1933.
VLDB-2012-SunWWSL #graph #performance: Efficient Subgraph Matching on Billion Node Graphs (ZS, HW, HW, BS, JL), pp. 788–799.
VLDB-2012-ZengH #algorithm #graph #pattern matching: Comments on “Stack-based Algorithms for Pattern Matching on DAGs” (QZ, HZ), pp. 668–679.
ITiCSE-2012-MehtaKP #algorithm #learning #network: Forming project groups while learning about matching and network flows in algorithms (DPM, TMK, IP), pp. 40–45.
WCRE-2012-VonkenZ #question #refactoring #testing: Refactoring with Unit Testing: A Match Made in Heaven? (FV, AZ), pp. 29–38.
STOC-2012-AlonMS #graph #scalability: Nearly complete graphs decomposable into large induced matchings and their applications (NA, AM, BS), pp. 1079–1090.
STOC-2012-DevanurJ #online: Online matching with concave returns (NRD, KJ), pp. 137–144.
STOC-2012-SharathkumarA #algorithm #approximate #geometry: A near-linear time ε-approximation algorithm for geometric bipartite matching (RS, PKA), pp. 385–394.
CIAA-2012-FaroL #algorithm #automaton #online #performance #string: A Fast Suffix Automata Based Algorithm for Exact Online String Matching (SF, TL), pp. 149–158.
CIAA-2012-LiuSGF #automaton #named #regular expression: SDFA: Series DFA for Memory-Efficient Regular Expression Matching (TL, YS, LG, BF), pp. 337–344.
ICALP-v1-2012-CostelloTT #probability: Stochastic Matching with Commitment (KPC, PT, PT), pp. 822–833.
ICALP-v1-2012-GuptaL #metric #online #problem: The Online Metric Matching Problem for Doubling Metrics (AG, KL), pp. 424–435.
ICALP-v1-2012-Jez #pattern matching #performance: Faster Fully Compressed Pattern Matching by Recompression (AJ), pp. 533–544.
LATA-2012-BolligP #algorithm #performance: An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings (BB, TP), pp. 143–154.
FM-2012-RosuS #hoare #logic #reachability: From Hoare Logic to Matching Logic Reachability (GR, AS), pp. 387–402.
GT-VMT-2012-JalaliRG #incremental #pattern matching #regular expression: Incremental Pattern Matching for Regular Expressions (AJ, AR, AHG).
ICGT-2012-BergmannRSTV #incremental #pattern matching #performance #transitive: Incremental Pattern Matching for the Efficient Computation of Transitive Closure (GB, IR, TS, PT, DV), pp. 386–400.
CAiSE-2012-DaskalakiP #approach #multi: OtO Matching System: A Multi-strategy Approach to Instance Matching (ED, DP), pp. 286–300.
ICEIS-J-2012-NikovskiEYST12a #automation #composition: Matcher Composition Methods for Automatic Schema Matching (DN, AE, XY, MS, ST), pp. 108–123.
ICEIS-v1-2012-NikovskiEYST #automation #composition #network: Bayesian Networks for Matcher Composition in Automatic Schema Matching (DN, AE, XY, MS, ST), pp. 48–55.
CIKM-2012-AltingovdeBCOSU #query #web: Characterizing web search queries that match very few or no results (ISA, RB, BBC, RO, ES, ÖU), pp. 2000–2004.
CIKM-2012-BohmMNW #distributed #named: LINDA: distributed web-of-data-scale entity matching (CB, GdM, FN, GW), pp. 2104–2108.
CIKM-2012-ChongCZSQZ #pattern matching #rdf #using: RDF pattern matching using sortable views (ZC, HC, ZZ, HS, GQ, AZ), pp. 315–324.
CIKM-2012-GopalakrishnanIMRS #using: Matching product titles using web-based enrichment (VG, SPI, AM, RR, SHS), pp. 605–614.
CIKM-2012-NiuRWY #effectiveness #mining #web: An effective rule miner for instance matching in a web of data (XN, SR, HW, YY), pp. 1085–1094.
CIKM-2012-ShenDZT #multi #network #online #social: Interest-matching information propagation in multiple online social networks (YS, TND, HZ, MTT), pp. 1824–1828.
ICML-2012-AzimiFFBH #coordination #learning: Batch Active Learning via Coordinated Matching (JA, AF, XZF, GB, BH), p. 44.
ICML-2012-CharlinZB #learning #problem: Active Learning for Matching Problems (LC, RSZ, CB), p. 23.
ICML-2012-KriegeM #graph #kernel: Subgraph Matching Kernels for Attributed Graphs (NK, PM), p. 42.
ICML-2012-PachauriCS #analysis #problem: Incorporating Domain Knowledge in Matching Problems via Harmonic Analysis (DP, MDC, VS), p. 112.
ICML-2012-PlessisS #learning: Semi-Supervised Learning of Class Balance under Class-Prior Change by Distribution Matching (MCdP, MS), p. 159.
ICML-2012-YuS #analysis #kernel: Analysis of Kernel Mean Matching under Covariate Shift (YY, CS), p. 150.
ICPR-2012-AfzalBKSB #documentation #image #parametricity #robust #using: Robust stereo matching for document images using parameter selection of text-line extraction (MZA, SSB, MK, FS, TMB), pp. 331–334.
ICPR-2012-AlbarelliBRVT #graph #higher-order #recognition #representation: A stable graph-based representation for object recognition through high-order matching (AA, FB, LR, SV, AT), pp. 3341–3344.
ICPR-2012-ChauhanL #distance: Manhattan-Pyramid Distance: A solution to an anomaly in pyramid matching by minimization (AC, LSL), pp. 2668–2672.
ICPR-2012-ChenH0N #classification #documentation: Structured document classification by matching local salient features (SC, YH, JS, SN), pp. 653–656.
ICPR-2012-CoustatyUO #image: Extraction of light and specific features for historical image indexing and matching (MC, SU, JMO), pp. 1326–1329.
ICPR-2012-FuLBF: Spectral correspondence method for fingerprint minutia matching (XF, CL, JB, JF), pp. 1743–1746.
ICPR-2012-GuermaziVB #detection #image #multi: Matching of multi-resolution image for remote sensing glacier detection (AG, LV, PB), pp. 3406–3410.
ICPR-2012-HongZSW #realtime #robust: Realtime object matching with robust dominant orientation templates (CH, JZ, MS, YW), pp. 1152–1155.
ICPR-2012-HouZQ #higher-order: Diffusion-driven high-order matching of partial deformable shapes (TH, MZ, HQ), pp. 137–140.
ICPR-2012-JiaYZZT #database #multi: A cross-device matching fingerprint database from multi-type sensors (XJ, XY, YZ, NZ, JT), pp. 3001–3004.
ICPR-2012-KramerABSB #component #documentation #programming #robust: Robust stereo correspondence for documents by matching connected components of text-lines with dynamic programming (MK, MZA, SSB, FS, TMB), pp. 734–737.
ICPR-2012-LankinenKK #categorisation #comparison #detection #visual notation: A comparison of local feature detectors and descriptors for visual object categorization by intra-class repeatability and matching (JL, VK, JKK), pp. 780–783.
ICPR-2012-LinC #image: Stereo matching on low intensity quantization images (HYL, XHC), pp. 2618–2621.
ICPR-2012-LiuDHZL #linear: A cost construction via MSW and linear regression for stereo matching (TL, XD, ZH, XZ, LL), pp. 914–917.
ICPR-2012-LiuLS #documentation #image #modelling #probability #using #visual notation: Document image matching using probabilistic graphical models (LL, YL, CYS), pp. 637–640.
ICPR-2012-MaedaNI #image #modelling: Surface matching by curvature distribution images generated via gaze modeling (MM, TN, KI), pp. 2194–2197.
ICPR-2012-MazinDG #geometry #image: Combining color and geometry for local image matching (BM, JD, YG), pp. 2667–2680.
ICPR-2012-MiksikM #detection #evaluation #performance: Evaluation of local detectors and descriptors for fast feature matching (OM, KM), pp. 2681–2684.
ICPR-2012-PiroSM #orthogonal: Inner product tree for improved Orthogonal Matching Pursuit (PP, DS, VM), pp. 429–432.
ICPR-2012-RaymondMOH #markov #network: Map matching with Hidden Markov Model on sampled road network (RR, TM, TO, NH), pp. 2242–2245.
ICPR-2012-RiechertZMK #estimation #hybrid #realtime #recursion #using: Real-time disparity estimation using line-wise hybrid recursive matching and cross-bilateral median up-sampling (CR, FZ, MM, PK), pp. 3168–3171.
ICPR-2012-RubioSLP #graph #higher-order #image #representation: Image contextual representation and matching through hierarchies and higher order graphs (JCR, JS, AML, NP), pp. 2664–2667.
ICPR-2012-SerratosaCS #graph #interactive: Interactive graph matching by means of imposing the pairwise costs (FS, XC, ASR), pp. 1298–1301.
ICPR-2012-SuDRH: Hypergraph matching based on Marginalized Constrained Compatibility (JS, LD, PR, ERH), pp. 2922–2925.
ICPR-2012-TangHW #detection #multi #recognition: Hand-dorsa vein recognition based on multi-level keypoint detection and local feature matching (YT, DH, YW), pp. 2837–2840.
ICPR-2012-TopcuKYU: Fingerprint matching utilizing non-distal phalanges (BT, MK, MKY, UU), pp. 2400–2403.
ICPR-2012-VitaladevuniCPN #detection #documentation #image #using: Detecting near-duplicate document images using interest point matching (SNPV, FC, RP, PN), pp. 347–350.
ICPR-2012-WakaharaY #correlation #image: Acceleration of GAT correlation for distortion-tolerant image matching (TW, YY), pp. 746–749.
ICPR-2012-WeberT #approach #documentation #performance: Symbol spotting for technical documents: An efficient template-matching approach (JW, ST), pp. 669–672.
ICPR-2012-YlimakiKHHB #multi #re-engineering #robust: Robust and accurate multi-view reconstruction by prioritized matching (MY, JK, JH, JH, SSB), pp. 2673–2676.
ICPR-2012-ZangY0JZT #information management: A score-level fusion method with prior knowledge for fingerprint matching (YZ, XY, KC, XJ, NZ, JT), pp. 2379–2382.
ICPR-2012-ZhangCYLS #constraints #graph: Stereo matching with Global Edge Constraint and Graph Cuts (HZ, FC, DY, YL, MS), pp. 372–375.
ICPR-2012-ZhangLLHSY: Binary stereo matching (KZ, JL, YL, WH, LS, SY), pp. 356–359.
ICPR-2012-ZhangSSLWTBC #category theory #image #kernel: Spatial graphlet matching kernel for recognizing aerial image categories (LZ, MS, LS, XL, YW, DT, JB, CC), pp. 2813–2816.
KDD-2012-BellareIPR: Active sampling for entity matching (KB, SI, AGP, VR), pp. 1131–1139.
KDD-2012-CadonnaGB #pattern matching #performance: Efficient event pattern matching with match windows (BC, JG, MHB), pp. 471–479.
KDD-2012-ChattopadhyayWFDPY #probability: Batch mode active sampling based on marginal probability distribution matching (RC, ZW, WF, ID, SP, JY), pp. 741–749.
KDD-2012-GuptaGSH #community #detection #mining: Integrating community matching and outlier detection for mining evolutionary community outliers (MG, JG, YS, JH), pp. 859–867.
KDIR-2012-LemnaruSVP #classification #documentation #taxonomy: A System for Historical Documents Transcription based on Hierarchical Classification and Dictionary Matching (CL, ASN, MAV, RP), pp. 353–357.
KDIR-2012-NguyenC #automation #ontology #similarity: A New Structure-based Similarity Measure for Automatic Ontology Matching (TTAN, SC), pp. 443–449.
KMIS-2012-SmirnovKS #collaboration #ontology #recommendation: Ontology Matching in Context-driven Collaborative Recommending Systems (AVS, AK, NS), pp. 139–144.
KR-2012-BahmaniBKL #declarative #dependence #set #source code: Declarative Entity Resolution via Matching Dependencies and Answer Set Programs (ZB, LEB, SK, LVSL).
SIGIR-2012-LiX #machine learning #web: Beyond bag-of-words: machine learning for query-document matching in web search (HL, JX), p. 1177.
ECMFA-2012-VarroAS #pattern matching #unification: Unification of Compiled and Interpreter-Based Pattern Matching Techniques (GV, AA, AS), pp. 368–383.
ICMT-2012-Trancon-y-WidemannL #named #pattern matching: Paisley: Pattern Matching à la Carte (BTyW, ML), pp. 240–247.
MoDELS-2012-BrancoTCKV #abstraction #process #workflow: Matching Business Process Workflows across Abstraction Levels (MCB, JT, KC, JMK, HV), pp. 626–641.
MoDELS-2012-GrammelKV #development #generative #modelling: Model Matching for Trace Link Generation in Model-Driven Software Development (BG, SK, KV), pp. 609–625.
MoDELS-2012-BrancoTCKV #abstraction #process #workflow: Matching Business Process Workflows across Abstraction Levels (MCB, JT, KC, JMK, HV), pp. 626–641.
MoDELS-2012-GrammelKV #development #generative #modelling: Model Matching for Trace Link Generation in Model-Driven Software Development (BG, SK, KV), pp. 609–625.
OOPSLA-2012-RosuS #logic #reachability #using: Checking reachability using matching logic (GR, AS), pp. 555–574.
PPDP-2012-SulzmannL #regular expression #using: Regular expression sub-matching using partial derivatives (MS, KZML), pp. 79–90.
SAC-2012-AbdullahRTN #performance #using: Efficient matching of SPARQL subscriptions using rete (HA, MR, ST, EN), pp. 372–377.
SAC-2012-CappelloQ: Expressing global priorities by best-matching (IC, PQ), pp. 1544–1550.
SAC-2012-HasegawaT #distance #invariant #using: Affine invariant shape matching using radon transform and dynamic time warping distance (MH, ST), pp. 777–781.
SAC-2012-LocoroMS #collaboration #evolution #ontology #validation: Evolving and validating annotations in web-based collaborative environments through ontology matching (AL, VM, AMS), pp. 725–727.
SAC-2012-ParadiesMSKS #in the cloud #semistructured data: Entity matching for semistructured data in the Cloud (MP, SM, JS, SK, KUS), pp. 453–458.
SAC-2012-VirgilioR #approximate #biology #graph #rdf: Approximate matching over biological RDF graphs (RDV, SER), pp. 1413–1414.
ICSE-2012-MengWZM #approach #evolution #framework #identification: A history-based matching approach to identification of framework evolution (SM, XW, LZ, HM), pp. 353–363.
CGO-2012-MajoG #data access #memory management: Matching memory access patterns and data placement for NUMA systems (ZM, TRG), pp. 230–241.
PPoPP-2012-ZuYXWTPD #automaton #implementation #memory management #nondeterminism #performance #regular expression: GPU-based NFA implementation for memory efficient high speed regular expression matching (YZ, MY, ZX, LW, XT, KP, QD), pp. 129–140.
RTA-2012-Schmidt-Schauss: Matching of Compressed Patterns with Character-Variables (MSS), pp. 272–287.
DAC-2011-ChoiYLA #behaviour #fault #performance: Matching cache access behavior and bit error pattern for high performance low Vcc L1 cache (YGC, SY, SL, JHA), pp. 978–983.
DATE-2011-HsuL #optimisation: Clock gating optimization with delay-matching (SJH, RBL), pp. 643–648.
DATE-2011-NarayananZT #correctness #pattern matching #process #using: Ensuring correctness of analog circuits in presence of noise and process variations using pattern matching (RN, MHZ, ST), pp. 1188–1191.
DocEng-2011-GippM #algorithm #detection #pattern matching #sequence: Citation pattern matching algorithms for citation-based plagiarism detection: greedy citation tiling, citation chunking and longest common citation sequence (BG, NM), pp. 249–258.
ICDAR-2011-LiuLS #graph #image #retrieval #using: Retrieval of Envelope Images Using Graph Matching (LL, YL, CYS), pp. 99–103.
ICDAR-2011-LuangvilayZN #online: An On-line Handwritten Text Search Method Based on Directional Feature Matching (PL, BZ, MN), pp. 683–686.
ICDAR-2011-SuLY #multi #recognition: Symbol Recognition by Multiresolution Shape Context Matching (FS, TL, RY), pp. 1319–1323.
ICDAR-2011-WangWZ #graph #online #using #verification: On-line Signature Verification Using Segment-to-Segment Graph Matching (KW, YW, ZZ), pp. 804–808.
SIGMOD-2011-ElmeleegyLROE #named: U-MAP: a system for usage-based schema matching and mapping (HE, JL, EKR, MO, AKE), pp. 1287–1290.
SIGMOD-2011-FanLLTWW #graph #incremental #pattern matching: Incremental graph pattern matching (WF, JL, JL, ZT, XW, YW), pp. 925–936.
SIGMOD-2011-FanLMTY #interactive #program repair: Interaction between record matching and data repairing (WF, JL, SM, NT, WY), pp. 469–480.
SIGMOD-2011-HanLMHY #approach #sequence: A new approach for processing ranked subsequence matching based on ranked union (WSH, JL, YSM, SwH, HY), pp. 457–468.
SIGMOD-2011-SadoghiJ #named: BE-tree: an index structure to efficiently match boolean expressions over high-dimensional discrete space (MS, HAJ), pp. 637–648.
VLDB-2011-BernsteinMR #years after: Generic Schema Matching, Ten Years Later (PAB, JM, ER), pp. 695–701.
VLDB-2011-GeL #approximate #nondeterminism #string: Approximate Substring Matching over Uncertain Strings (TG, ZL), pp. 772–782.
VLDB-2011-KotsifakosPHG #framework #sequence: A Subsequence Matching with Gaps-Range-Tolerances Framework: A Query-By-Humming Application (AK, PP, JH, DG), pp. 761–771.
VLDB-2011-MoralesGS #pipes and filters #social: Social Content Matching in MapReduce (GDFM, AG, MS), pp. 460–469.
VLDB-2011-RastogiDG #scalability: Large-Scale Collective Entity Matching (VR, NND, MNG), pp. 208–218.
VLDB-2011-WangLYF #how: Entity Matching: How Similar Is Similar (JW, GL, JXY, JF), pp. 622–633.
VLDB-2011-ZouMCOZ #named #query: gStore: Answering SPARQL Queries via Subgraph Matching (LZ, JM, LC, MTÖ, DZ), pp. 482–493.
VLDB-2012-MaCFHW11 #graph #pattern matching: Capturing Topology in Graph Pattern Matching (SM, YC, WF, JH, TW), pp. 310–321.
VLDB-2012-NguyenMNNF11 #multi #wiki: Multilingual Schema Matching for Wikipedia Infoboxes (THN, VM, HN, HN, JF), pp. 133–144.
VLDB-2012-QumsiyehPN11 #generative: Generating Exact- and Ranked Partially-Matched Answers to Questions in Advertisements (RQ, MSP, YKN), pp. 217–228.
VLDB-2012-YangRW11 #clustering #streaming #summary: Summarization and Matching of Density-Based Clusters in Streaming Environments (DY, EAR, MOW), pp. 121–132.
WCRE-2011-WangLJ #code search #dependence #graph #topic: Code Search via Topic-Enriched Dependence Graph Matching (SW, DL, LJ), pp. 119–123.
STOC-2011-KarandeMT #online: Online bipartite matching with unknown distributions (CK, AM, PT), pp. 587–596.
STOC-2011-MahdianY #approach #online #random: Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs (MM, QY), pp. 597–606.
CIAA-2011-Buchnik #algorithm #multi #named #string: Bouma2 — A High-Performance Input-Aware Multiple String-Match Algorithm (EB), pp. 53–64.
CIAA-2011-FlouriJMIP #automaton #order: Tree Template Matching in Ranked Ordered Trees by Pushdown Automata (TF, JJ, BM, CSI, SPP), pp. 273–281.
DLT-2011-Wilke #functional #regular expression: A Functional Program for Regular Expressions Matching — Abstract of Invited Talk (TW), pp. 44–45.
ICALP-v1-2011-CanzarEKM #on the: On Tree-Constrained Matchings and Generalizations (SC, KME, GWK, JM), pp. 98–109.
ICALP-v1-2011-ChengMS #graph: Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices (CTC, EM, IS), pp. 678–689.
ICALP-v1-2011-HuangK #problem: Popular Matchings in the Stable Marriage Problem (CCH, TK), pp. 666–677.
ICALP-v2-2011-AhnG #linear #problem #programming: Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem (KJA, SG), pp. 526–538.
ICALP-v2-2011-Hoefer #network #social: Local Matching Dynamics in Social Networks (MH), pp. 113–124.
ICFP-2011-JayP #pattern matching #self: Typed self-interpretation by pattern matching (CBJ, JP), pp. 247–258.
CHI-2011-BillmanAFLST: Benefits of matching domain structure for planning software: the right stuff (DB, LA, MF, JL, AS, RT), pp. 2521–2530.
HCI-MIIE-2011-ChenCSL #design #mobile #volunteer: Finding Suitable Candidates: The Design of a Mobile Volunteering Matching System (WCC, YMC, FES, CLL), pp. 21–29.
CIKM-2011-Gal #nondeterminism #power of: Uncertain schema matching: the power of not knowing (AG), pp. 2615–2616.
CIKM-2011-LeeLH #scalability: Scalable entity matching computation with materialization (SL, JL, SwH), pp. 2353–2356.
CIKM-2011-MaZSDC #query: Matching query processing in high-dimensional space (CM, YZ, LS, DD, GC), pp. 1589–1594.
CIKM-2011-PeelWZ #string #using: Collection-based compression using discovered long matching strings (AP, AW, JZ), pp. 2361–2364.
CIKM-2011-PeukertER #process #rule-based: Rule-based construction of matching processes (EP, JE, ER), pp. 2421–2424.
CIKM-2011-SilSB: Supervised matching of comments with news article segments (DKS, SHS, CB), pp. 2125–2128.
CIKM-2011-WongTP #health: Health conversational system based on contextual matching of community-driven question-answer pairs (WW, JT, LP), pp. 2577–2580.
CIKM-2011-ZhuQYKL #graph #performance #quality #scalability: High efficiency and quality: large graphs matching (YZ, LQ, JXY, YK, XL), pp. 1755–1764.
ICML-2011-SwerskyRBMF #energy #modelling #on the: On Autoencoders and Score Matching for Energy Based Models (KS, MR, DB, BMM, NdF), pp. 1201–1208.
KDD-2011-KannanGAF #specification: Matching unstructured product offers to structured product specifications (AK, IEG, RA, AF), pp. 404–412.
KEOD-2011-AarnioSK #industrial #lightweight #semantics: A Lightweight Element Matching Method for Industrial Terminology Harmonization — Exploiting Minimal Semantics based on Naming Conventions (PA, SS, KK), pp. 390–395.
KEOD-2011-ScharffeE #linked data #ontology #open data: Linked Data Meets Ontology Matching — Enhancing Data Linking through Ontology Alignments (FS, JE), pp. 279–284.
RecSys-2011-PizzatoS #collaboration #people #probability #recommendation: Stochastic matching and collaborative filtering to recommend people to people (LASP, CS), pp. 341–344.
POPL-2011-OngR #algebra #data type #functional #higher-order #pattern matching #source code #verification: Verifying higher-order functional programs with pattern-matching algebraic data types (CHLO, SJR), pp. 587–598.
REFSQ-2011-AdamUR #question #reuse: Is It Beneficial to Match Reusable Services Earlier? (SA, ÖÜ, NR), pp. 136–150.
SAC-2011-LiuSGF #classification #performance: Improving matching performance of DPI traffic classifier (TL, YS, LG, BF), pp. 514–519.
SAC-2011-TillyR #realtime: Matching customer requests to service offerings in real-time (MT, SRM), pp. 456–461.
ICSE-2011-RosuS #approach #logic #verification: Matching logic: a new program verification approach (GR, AS), pp. 868–871.
CADE-2011-FredriksonCJ #algorithm #analysis #approximate #behaviour #complexity: Dynamic Behavior Matching: A Complexity Analysis and New Approximation Algorithms (MF, MC, SJ), pp. 252–267.
LICS-2011-LeC #algorithm #formal method #random: Formalizing Randomized Matching Algorithms (DTML, SAC), pp. 185–194.
ASE-2010-GermanMI #automation #identification #source code: A sentence-matching method for automatic license identification of source code files (DMG, YM, KI), pp. 437–446.
ASE-2010-WangLCZMY #dependence #graph #query: Matching dependence-related queries in the system dependence graph (XW, DL, JC, LZ, HM, JXY), pp. 457–466.
CASE-2010-MaFW #re-engineering: Delaunay-based triangular surface reconstruction from points via Umbrella Facet Matching (JM, HYF, LW), pp. 580–585.
DAC-2010-LaiJW #abstraction #learning #named: BooM: a decision procedure for boolean matching with abstraction and dynamic learning (CFL, JHRJ, KHW), pp. 499–504.
DATE-2010-KatebiM #scalability: Large-scale Boolean matching (HK, ILM), pp. 771–776.
DATE-2010-KennedyWLL #string #throughput: Ultra-high throughput string matching for Deep Packet Inspection (AK, XW, ZL, BL), pp. 399–404.
DATE-2010-RathiDGCV #distance #feature model #gpu #implementation: A GPU based implementation of Center-Surround Distribution Distance for feature extraction and matching (AR, MD, WG, RTC, NV), pp. 172–177.
DATE-2010-VillenaS #named #order #reduction: HORUS — high-dimensional Model Order Reduction via low moment-matching upgraded sampling (JFV, LMS), pp. 465–470.
DRR-2010-KatsuyamaMHOK #classification: A new pre-classification method based on associative matching method (YK, AM, YH, SO, NK), pp. 1–10.
SIGMOD-2010-ArasuGK #learning #on the: On active learning of record matching packages (AA, MG, RK), pp. 783–794.
SIGMOD-2010-KohlerZSST: Sampling dirty data for matching attributes (HK, XZ, SWS, YS, KLT), pp. 63–74.
VLDB-2010-ChandramouliGM #pattern matching: High-Performance Dynamic Pattern Matching over Disordered Streams (BC, JG, DM), pp. 220–231.
VLDB-2010-FanLMTWW #graph #pattern matching #polynomial: Graph Pattern Matching: From Intractable to Polynomial Time (WF, JL, SM, NT, YW, YW), pp. 264–275.
VLDB-2010-FanLMWW #graph #morphism: Graph Homomorphism Revisited for Graph Matching (WF, JL, SM, HW, YW), pp. 1161–1172.
VLDB-2010-KandhanTP #multi #named #pattern matching #performance #scalability: SigMatch: Fast and Scalable Multi-Pattern Matching (RK, NT, JMP), pp. 1173–1184.
VLDB-2010-KopckeTR #evaluation #problem: Evaluation of entity resolution approaches on real-world match problems (HK, AT, ER), pp. 484–493.
VLDB-2010-ZhangYJ #approximate #graph #named #scalability: SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs (SZ, JY, WJ), pp. 1185–1194.
FASE-2010-NaeemHOH #composition #contract #incremental #visual notation: Incremental Service Composition Based on Partial Matching of Visual Contracts (MN, RH, FO, FH), pp. 123–138.
FoSSaCS-2010-Stirling #decidability #higher-order: Introduction to Decidability of Higher-Order Matching (CS), p. 1.
ICSM-2010-GuptaDKR #case study #implementation: A case study in matching service descriptions to implementations in an existing system (HSG, DD, RK, GMR), pp. 1–10.
STOC-2010-GoelKK #graph: Perfect matchings in o(n log n) time in regular bipartite graphs (AG, MK, SK), pp. 39–46.
STOC-2010-LeeSV #power of: Matroid matching: the power of local search (JL, MS, JV), pp. 369–378.
STOC-2010-OnakR #maintenance #scalability: Maintaining a large matching and a small vertex cover (KO, RR), pp. 457–464.
CIAA-2010-AntosM #approach #automaton #finite #pattern matching: Finite Automata for Generalized Approach to Backward Pattern Matching (JA, BM), pp. 49–58.
CIAA-2010-OkuiS #ambiguity #automaton #regular expression: Disambiguation in Regular Expression Matching via Position Automata with Augmented Transitions (SO, TS), pp. 231–240.
CIAA-2010-ReidenbachS #polynomial #regular expression #scalability: A Polynomial Time Match Test for Large Classes of Extended Regular Expressions (DR, MLS), pp. 241–250.
ICALP-v1-2010-FakcharoenpholLN #algorithm #performance #problem: Faster Algorithms for Semi-matching Problems (Extended Abstract) (JF, BL, DN), pp. 176–187.
LATA-2010-MarschallR #algorithm #analysis #automaton #pattern matching #probability: Exact Analysis of Horspool’s and Sunday’s Pattern Matching Algorithms with Probabilistic Arithmetic Automata (TM, SR), pp. 439–450.
ICFP-2010-BarbosaCFGP #lens: Matching lenses: alignment and view update (DMJB, JC, NF, MG, BCP), pp. 193–204.
CAiSE-2010-CastanoFM #semantics #using #variability #web: Dealing with Matching Variability of Semantic Web Data Using Contexts (SC, AF, SM), pp. 194–208.
CAiSE-2010-StoermerRV #evaluation #implementation: Feature-Based Entity Matching: The FBEM Model, Implementation, Evaluation (HS, NR, NV), pp. 180–193.
ICEIS-DISI-2010-SellamiBAF #composition #process: Improving Real World Schema Matching with Decomposition Process (SS, ANB, YA, FF), pp. 151–158.
CIKM-2010-ChengOWZ #graph #named #web #web service: WS-GraphMatching: a web service tool for graph matching (QC, MO, JW, AZ), pp. 1949–1950.
CIKM-2010-NguyenNF #approach #named #web: PruSM: a prudent schema matching approach for web forms (THN, HN, JF), pp. 1385–1388.
CIKM-2010-ZhangLY #graph #named: SUMMA: subgraph matching in massive graphs (SZ, SL, JY), pp. 1285–1288.
ICPR-2010-AlySTT #multi #recognition #robust #self #similarity #using: Robust Face Recognition Using Multiple Self-Organized Gabor Features and Local Similarity Matching (SKHA, AS, NT, RiT), pp. 2909–2912.
ICPR-2010-AungSN #3d #precise: Traj Align: A Method for Precise Matching of 3-D Trajectories (ZA, KS, WSN), pp. 3818–3821.
ICPR-2010-BhatBSS #sequence #transitive #video #visual notation #word: Transitive Closure Based Visual Words for Point Matching in Video Sequence (KKSB, MOB, GS, FS), pp. 3300–3303.
ICPR-2010-CaiTP #people: Matching Groups of People by Covariance Descriptor (YC, VT, MP), pp. 2744–2747.
ICPR-2010-CaoZGXG #image #multi: Matching Image with Multiple Local Features (YC, HZ, YG, XX, JG), pp. 519–522.
ICPR-2010-ChenNW #estimation #multi #using: Actual Midline Estimation from Brain CT Scan Using Multiple Regions Shape Matching (WC, KN, KW), pp. 2552–2555.
ICPR-2010-ChenWJ #hybrid #robust: Robust Frame-to-Frame Hybrid Matching (LC, ZW, YJ), pp. 1019–1022.
ICPR-2010-ChowdhuryCGR #graph #using #video: Cell Tracking in Video Microscopy Using Bipartite Graph Matching (ASC, RC, MG, NR), pp. 2456–2459.
ICPR-2010-Demirci #performance #retrieval: Efficient Shape Retrieval Under Partial Matching (MFD), pp. 3057–3060.
ICPR-2010-DornaikaC #classification #detection #performance #using: Efficient Object Detection and Matching Using Feature Classification (FD, FC), pp. 3073–3076.
ICPR-2010-DoubekMPC #image #retrieval: Image Matching and Retrieval by Repetitive Patterns (PD, JM, MP, OC), pp. 3195–3198.
ICPR-2010-FleckD #image #invariant #using: Using Local Affine Invariants to Improve Image Matching (DF, ZD), pp. 1844–1847.
ICPR-2010-FreireCF #approach #generative #graph #problem: A Column Generation Approach for the Graph Matching Problem (ASF, RMCJ, CEF), pp. 1088–1091.
ICPR-2010-GassDN #energy #image #recognition: Constrained Energy Minimization for Matching-Based Image Recognition (TG, PD, HN), pp. 3304–3307.
ICPR-2010-IgelmoSF #graph #representation: A Conductance Electrical Model for Representing and Matching Weighted Undirected Graphs (MI, AS, MF), pp. 958–961.
ICPR-2010-JanneyG #framework #image #realtime: IFLT Based Real-Time Framework for Image Matching (PJ, GG), pp. 2242–2245.
ICPR-2010-KimLL #approach #probability #segmentation: A Unified Probabilistic Approach to Feature Matching and Object Segmentation (THK, KML, SUL), pp. 464–467.
ICPR-2010-KlareJ #image #recognition: Heterogeneous Face Recognition: Matching NIR to Visible Light Images (BK, AKJ), pp. 1513–1516.
ICPR-2010-KoskenkorvaKB: Quasi-dense Wide Baseline Matching for Three Views (PK, JK, SSB), pp. 806–809.
ICPR-2010-KumarTG #symmetry: Combination of Symmetric Hash Functions for Secure Fingerprint Matching (GK, ST, VG), pp. 890–893.
ICPR-2010-LariosSSMLD #identification #kernel #random: Haar Random Forest Features and SVM Spatial Matching Kernel for Stonefly Species Identification (NL, BS, LGS, GMM, JL, TGD), pp. 2624–2627.
ICPR-2010-LeeCL #algorithm #data-driven #graph #markov #monte carlo #using: A Graph Matching Algorithm Using Data-Driven Markov Chain Monte Carlo Sampling (JL, MC, KML), pp. 2816–2819.
ICPR-2010-LeePJ #image #named #retrieval: PILL-ID: Matching and Retrieval of Drug Pill Imprint Images (YBL, UP, AKJ), pp. 2632–2635.
ICPR-2010-LiuC #classification #image #string: Spatial String Matching for Image Classification (YL, VC), pp. 2937–2940.
ICPR-2010-LiuZZZ #representation: Fingerprint Pore Matching Based on Sparse Representation (FL, QZ, LZ, DZ), pp. 1630–1633.
ICPR-2010-ManoharSGS #modelling #video: Modeling Facial Skin Motion Properties in Video and Its Application to Matching Faces across Expressions (VM, MS, DBG, SS), pp. 2122–2125.
ICPR-2010-MoraledaH #image #scalability #towards: Toward Massive Scalability in Image Matching (JM, JJH), pp. 3424–3427.
ICPR-2010-PalenichkaLZ #difference #image: Outlier-Resistant Dissimilarity Measure for Feature-based Image Matching (RMP, AL, MBZ), pp. 846–849.
ICPR-2010-ReinbacherRB #estimation #performance: Pose Estimation of Known Objects by Efficient Silhouette Matching (CR, MR, HB), pp. 1080–1083.
ICPR-2010-RevaudLAB #graph #learning #performance #recognition #robust: Learning an Efficient and Robust Graph Matching Procedure for Specific Object Recognition (JR, GL, YA, AB), pp. 754–757.
ICPR-2010-RoyM #using #video: Crossmodal Matching of Speakers Using Lip and Voice Features in Temporally Non-overlapping Audio and Video Streams (AR, SM), pp. 4504–4507.
ICPR-2010-SanromaAS #approach #graph #using: A Discrete Labelling Approach to Attributed Graph Matching Using SIFT Features (GS, RA, FS), pp. 954–957.
ICPR-2010-Sur #nondeterminism #robust: Robust Matching in an Uncertain World (FS), pp. 2350–2353.
ICPR-2010-SutthiwichaipornAJ #quality: Iterative Fingerprint Enhancement with Matched Filtering and Quality Diffusion in Spatial-Frequency Domain (PS, VA, SJ), pp. 1257–1260.
ICPR-2010-SuzukiIAT #algorithm #estimation #image #using: A Scale Estimation Algorithm Using Phase-Based Correspondence Matching for Electron Microscope Images (AS, KI, TA, RT), pp. 2420–2423.
ICPR-2010-TakalaCP #clustering #network #sequence: Boosting Clusters of Samples for Sequence Matching in Camera Networks (VT, YC, MP), pp. 400–403.
ICPR-2010-TamakiTURK #3d #image: Scale Matching of 3D Point Clouds by Finding Keyscales with Spin Images (TT, ST, YU, BR, KK), pp. 3480–3483.
ICPR-2010-TarafdarMPPK #documentation #multi #retrieval: Shape Code Based Word-Image Matching for Retrieval of Indian Multi-lingual Documents (AT, RM, SP, UP, FK), pp. 1989–1992.
ICPR-2010-WangLGL #3d #comparison #difference #kernel: 3D Model Comparison through Kernel Density Matching (YW, TL, RG, WL), pp. 3159–3162.
ICPR-2010-Yanagisawa #integer #programming: An Offline Map Matching via Integer Programming (HY), pp. 4206–4209.
KEOD-2010-ArdilaAL #kernel #learning #multi #ontology: Multiple Kernel Learning for Ontology Instance Matching (DA, JA, FL), pp. 311–318.
KEOD-2010-Brunsmann #collaboration #design #ontology #semantics #social: The Design of a Social Semantic Search Engine — Preserving Archived Collaborative Engineering Knowledge with Ontology Matching (JB), pp. 200–205.
RecSys-2010-MayerMSJ #predict #social: Common attributes in an unusual context: predicting the desirability of a social match (JMM, SM, RPS, QJ), pp. 337–340.
SIGIR-2010-Huerta #approach #approximate #stack #string: A stack decoder approach to approximate string matching (JMH), pp. 823–824.
SIGIR-2010-ZhangZYH #detection #performance #sequence: Efficient partial-duplicate detection based on sequence matching (QZ, YZ, HY, XH), pp. 675–682.
ICMT-2010-VoigtH #distance #edit distance #graph #metamodelling: Metamodel Matching Based on Planar Graph Edit Distance (KV, TH), pp. 245–259.
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.
SAC-2010-BenaouichaTB #flexibility #probability #query: Flexible document-query matching based on a probabilistic content and structure score combination (MB, MT, MB), pp. 1728–1734.
SAC-2010-FlouriMJ #automaton #multi: Aho-Corasick like multiple subtree matching by pushdown automata (TF, BM, JJ), pp. 2157–2158.
SAC-2010-VoigtIR #automation #generative #metamodelling #named: MatchBox: combined meta-model matching for semi-automatic mapping generation (KV, PI, AR), pp. 2281–2288.
SLE-2010-Bernstein #question #re-engineering #semantics #web: Software Engineering and the Semantic Web: A Match Made in Heaven or in Hell? (AB), pp. 203–205.
ICST-2010-NguyenWR #graph #named: GraphSeq: A Graph Matching Tool for the Extraction of Mobility Patterns (MDN, HW, NR), pp. 195–204.
DAC-2009-JiangCCH #design #low cost: Matching-based minimum-cost spare cell selection for design changes (IHRJ, HYC, LGC, HBH), pp. 408–411.
DAC-2009-LinZWC: Thermal-driven analog placement considering device matching (MPHL, HZ, MDFW, YWC), pp. 593–598.
DAC-2009-WangCL #network #satisfiability #scalability #simulation: Simulation and SAT-based Boolean matching for large Boolean networks (KHW, CMC, JCL), pp. 396–401.
DocEng-2009-Hassan09a #documentation #graph #interactive #named #using: GraphWrap: a system for interactive wrapping of pdf documents using graph matching techniques (TH), pp. 247–248.
ICDAR-2009-AndreevK #image #word: Word Image Matching Based on Hausdorff Distances (AA, NK), pp. 396–400.
ICDAR-2009-Hassan #documentation #graph #using: User-Guided Wrapping of PDF Documents Using Graph Matching Techniques (TH), pp. 631–635.
ICDAR-2009-ImuraT #documentation #image #string: Compression and String Matching Method for Printed Document Images (HI, YT), pp. 291–295.
ICDAR-2009-ZhuD #documentation #image #retrieval: Logo Matching for Document Image Retrieval (GZ, DSD), pp. 606–610.
SIGMOD-2009-DindarGLOST #declarative #named #pattern matching: DejaVu: declarative pattern matching over live and archived streams of events (ND, BG, PL, AÖ, MS, NT), pp. 1023–1026.
SIGMOD-2009-HadjieleftheriouKS #approximate #incremental #maintenance #normalisation #string: Incremental maintenance of length normalized indexes for approximate string matching (MH, NK, DS), pp. 429–440.
SIGMOD-2009-ZhongLLXTZP #approach #ontology: A gauss function based approach for unbalanced ontology matching (QZ, HL, JL, GTX, JT, LZ, YP), pp. 669–680.
VLDB-2009-ChaudhuriGX #approximate #documentation #mining: Mining Document Collections to Facilitate Accurate Approximate Entity Matching (SC, VG, DX), pp. 395–406.
VLDB-2009-CruzAS #named #ontology #performance #scalability: AgreementMaker: Efficient Matching for Large Real-World Schemas and Ontologies (IFC, FPA, CS), pp. 1586–1589.
VLDB-2009-FanJLM #reasoning: Reasoning about Record Matching Rules (WF, XJ, JL, SM), pp. 407–418.
VLDB-2009-NandiB #named #taxonomy #using: HAMSTER: Using Search Clicklogs for Schema and Taxonomy Matching (AN, PAB), pp. 181–192.
VLDB-2009-ZouCO #database #graph #named #query #scalability: DistanceJoin: Pattern Match Query In a Large Graph Database (LZ, LC, MTÖ), pp. 886–897.
ITiCSE-2009-RonchettiS #automation #towards: Towards automatic syllabi matching (MR, JS), p. 379.
ICSM-2009-FengG #detection: Detecting virus mutations via dynamic matching (MF, RG), pp. 105–114.
WCRE-1999-Kpodjedo99a #approximate #graph #re-engineering: Approximate Graph Matching in Software Engineering (SK), pp. 295–298.
STOC-2009-MathieuS: Sherali-adams relaxations of the matching polytope (CM, AS), pp. 293–302.
STOC-2009-YoshidaYI #algorithm #approximate: An improved constant-time approximation algorithm for maximum~matchings (YY, MY, HI), pp. 225–234.
CIAA-J-2008-DixonES09 #analysis: Analysis of Bit-Split Languages for Packet Scanning and Experiments with Wildcard Matching (RD, ÖE, TS), pp. 597–612.
CIAA-J-2008-MatsumotoHT09 #automaton #implementation #pattern matching #performance #runtime: A Run-Time Efficient Implementation of Compressed Pattern Matching Automata (TM, KH, MT), pp. 717–733.
ICALP-v1-2009-BilleT #performance #regular expression: Faster Regular Expression Matching (PB, MT), pp. 171–182.
ICALP-v1-2009-ChenIKMR #approximate: Approximating Matches Made in Heaven (NC, NI, ARK, MM, AR), pp. 266–278.
ICALP-v1-2009-KavithaMN: Popular Mixed Matchings (TK, JM, MN), pp. 574–584.
LATA-2009-BaaderBT #policy: Matching Trace Patterns with Regular Policies (FB, AB, AT), pp. 105–116.
LATA-2009-FredrikssonG #string: Nested Counters in Bit-Parallel String Matching (KF, SG), pp. 338–349.
LATA-2009-LiefoogheTV #algorithm #self: Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching (AL, HT, JSV), pp. 481–492.
GT-VMT-2009-BergmannRV #graph transformation #incremental #parallel #pattern matching: Parallelization of Graph Transformation Based on Incremental Pattern Matching (GB, IR, DV), pp. 100–114.
HCI-AUII-2009-SuzukiNABYF #comparison #empirical #interactive #mobile #modelling #sequence: Empirical Comparison of Task Completion Time between Mobile Phone Models with Matched Interaction Sequences (SS, YN, TA, VB, NY, SF), pp. 114–122.
ICEIS-ISAS-2009-Woo #modelling #process #reuse: Finding Reusable Business Process Models based on Structural Matching (HGW), pp. 249–255.
ICEIS-J-2009-LemeCBF #owl: Instance-Based OWL Schema Matching (LAPPL, MAC, KKB, ALF), pp. 14–26.
ICEIS-J-2009-SousaLCA #algorithm #automation #metamodelling: A Step Forward in Semi-automatic Metamodel Matching: Algorithms and Tool (JdS, DL, DBC, ZA), pp. 137–148.
ICEIS-J-2009-Sun #network #using: Stereo Matching Using Synchronous Hopfield Neural Network (THS), pp. 336–347.
CIKM-2009-DalviKPT: A translation model for matching reviews to objects (NND, RK, BP, AT), pp. 167–176.
CIKM-2009-GongWO: Matching person names through name transformation (JG, LW, DWO), pp. 1875–1878.
CIKM-2009-KarimzadehganZ #bibliography #multi: Constrained multi-aspect expertise matching for committee review assignment (MK, CZ), pp. 1697–1700.
CIKM-2009-LinLK #named #novel #similarity: MatchSim: a novel neighbor-based similarity measure with maximum neighborhood matching (ZL, MRL, IK), pp. 1613–1616.
CIKM-2009-LiuMY #fuzzy #pattern matching #performance #xml: Efficient processing of twig pattern matching in fuzzy XML (JL, ZMM, LY), pp. 117–126.
CIKM-2009-SongC #dependence: Discovering matching dependencies (SS, LC), pp. 1421–1424.
CIKM-2009-SunDML: Matching stream patterns of various lengths and tolerances (HS, KD, FM, JL), pp. 1477–1480.
CIKM-2009-TangSB #string: Space-economical partial gram indices for exact substring matching (NT, LS, PAB), pp. 285–294.
ICML-2009-JebaraWC #graph #learning: Graph construction and b-matching for semi-supervised learning (TJ, JW, SFC), pp. 441–448.
KDD-2009-GuptaBR #learning: Catching the drift: learning broad matches from clickthrough data (SG, MB, MR), pp. 1165–1174.
KEOD-2009-MaioS #named #ontology: GOALS — A Test-Bed for Ontology Matching (PM, NS), pp. 293–299.
RecSys-2009-Kaminskas #music: Matching information content with music (MK), pp. 405–408.
SEKE-2009-LiangKS #approach #automation #case study #diagrams: Automatic Class Matching to Compare Extracted Class Diagrams: Approach and Case Study (YL, NAK, RKS), pp. 268–273.
SIGIR-2009-McCarley: Cross language name matching (JSM), pp. 660–661.
SIGIR-2009-WangMC #approach: A syntactic tree matching approach to finding similar questions in community-based qa services (KW, ZM, TSC), pp. 187–194.
ICMT-2009-BergmannHRV #model transformation #pattern matching #performance: Efficient Model Transformations by Combining Pattern Matching Strategies (GB, ÁH, IR, DV), pp. 20–34.
POPL-2009-BrunelDHLM #logic #model checking #using: A foundation for flow-based program matching: using temporal logic and model checking (JB, DD, RRH, JLL, GM), pp. 114–126.
POPL-2009-Krishnaswami #pattern matching: Focusing on pattern matching (NRK), pp. 366–378.
SAC-2009-KongGL #keyword #xml: Retrieving valid matches for XML keyword search (LK, RG, AL), pp. 1536–1540.
SAC-2009-LimaH #approach #using: Computing data cubes using exact sub-graph matching: the sequential MCG approach (JdCL, CMH), pp. 1541–1548.
SAC-2009-MarquesF #documentation #using: Reconstructing strip-shredded documents using color as feature matching (MAOM, COAF), pp. 893–894.
SAC-2009-SaitoI #type system: Matching ThisType to subtyping (CS, AI), pp. 1851–1858.
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.
ICLP-2009-HildebrandtL #concurrent #constraints #pattern matching #programming: Types for Secure Pattern Matching with Local Knowledge in Universal Concurrent Constraint Programming (TTH, HAL), pp. 417–431.
CASE-2008-LeeCAP #automation #image #library #process: Matching book-spine images for library shelf-reading process automation (DJL, YC, JKA, CP), pp. 738–743.
DAC-2008-Abdollahi: Signature based Boolean matching in the presence of don’t cares (AA), pp. 642–647.
DAC-2008-ChangHHLWL: Type-matching clock tree for zero skew clock gating (CMC, SHH, YKH, JZL, HPW, YSL), pp. 714–719.
DAC-2008-NieuwoudtKM #automation #configuration management #design #network: Automated design of tunable impedance matching networks for reconfigurable wireless applications (AN, JK, YM), pp. 498–503.
DAC-2008-PiyachonL #automaton #design #finite #pattern matching #performance: Design of high performance pattern matching engine through compact deterministic finite automata (PP, YL), pp. 852–857.
DATE-2008-BonesanaPS #adaptation #regular expression: An adaptable FPGA-based System for Regular Expression Matching (IB, MP, MDS), pp. 1262–1267.
DocEng-2008-KadeH #documentation #xml: Matching XML documents in highly dynamic applications (AMK, CAH), pp. 191–198.
SIGMOD-2008-AgrawalDGI #pattern matching #performance: Efficient pattern matching over event streams (JA, YD, DG, NI), pp. 147–160.
SIGMOD-2008-ArasuCGK #string: Incorporating string transformations in record matching (AA, SC, KG, RK), pp. 1231–1234.
SIGMOD-2008-AthitsosPPKG #approximate #sequence: Approximate embedding-based subsequence matching of time series (VA, PP, MP, GK, DG), pp. 365–378.
SIGMOD-2008-GouC #algorithm #graph #pattern matching #performance: Efficient algorithms for exact ranked twig-pattern matching over graphs (GG, RC), pp. 581–594.
SIGMOD-2008-MajumderRV #data type #regular expression #scalability: Scalable regular expression matching on data streams (AM, RR, SV), pp. 161–172.
SIGMOD-2008-SinhaPMT #array #locality #pattern matching #performance: Improving suffix array locality for fast pattern matching on disk (RS, SJP, AM, AT), pp. 661–672.
VLDB-2008-LiuC #identification #keyword #reasoning #xml: Reasoning and identifying relevant matches for XML keyword search (ZL, YC), pp. 921–932.
FASE-2008-KopetzM #pattern matching #quality: Software Quality Improvement Via Pattern Matching (RK, PEM), pp. 296–300.
WCRE-2008-KpodjedoRGA #evolution #fault #graph: Error Correcting Graph Matching Application to Software Evolution (SK, FR, PG, GA), pp. 289–293.
CIAA-2008-LahodaMZ #pattern matching: Pattern Matching in DCA Coded Text (JL, BM, JZ), pp. 151–160.
CIAA-2008-MatsumotoHT #automaton #implementation #pattern matching #performance #runtime: A Run-Time Efficient Implementation of Compressed Pattern Matching Automata (TM, KH, MT), pp. 201–211.
ICALP-A-2008-CheboluFM #graph #random: Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time (PC, AMF, PM), pp. 161–172.
ICALP-A-2008-DimitrovP: Competitive Weighted Matching in Transversal Matroids (NBD, CGP), pp. 397–408.
LATA-2008-KirchnerKM #pattern matching: Anti-pattern Matching Modulo (CK, RK, PEM), pp. 275–286.
LATA-2008-KorpM #bound #dependence #proving #term rewriting #termination: Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems (MK, AM), pp. 321–332.
ICGT-2008-BergmannHRV #benchmark #evaluation #graph transformation #incremental #metric #pattern matching: A Benchmark Evaluation of Incremental Pattern Matching in Graph Transformation (GB, ÁH, IR, DV), pp. 396–410.
ICEIS-DISI-2008-BraunerGCB #adaptation #database #web #web service: Adaptative Matching of Database Web Services Export Schemas (DFB, AG, MAC, KKB), pp. 49–56.
ICEIS-DISI-2008-SellamiBAR #challenge #scalability: Study of Challenges and Techniques in Large Scale Matching (SS, ANB, YA, RR), pp. 355–361.
ICEIS-ISAS2-2008-MahmodSL #process #similarity: Similarity Matching of Business Process Variants (NMM, SWS, RL), pp. 234–239.
CIKM-2008-ChuangC #query #web: Integrating web query results: holistic schema matching (SLC, KCCC), pp. 33–42.
CIKM-2008-KarimzadehganZB #bibliography #multi: Multi-aspect expertise matching for review assignment (MK, CZ, GGB), pp. 1113–1122.
CIKM-2008-LuxenburgerEW #personalisation #web: Matching task profiles and user needs in personalized web search (JL, SE, GW), pp. 689–698.
CIKM-2008-MahouiTSC #identification #modelling #predict #using: Identification of gene function using prediction by partial matching (PPM) language models (MM, WJT, AKTS, SC), pp. 779–786.
CIKM-2008-StroeBNP #approach #approximate #string: An approximate string matching approach for handling incorrectly typed urls (MS, RB, CN, DP), pp. 1339–1340.
ECIR-2008-EidoonYO #ontology #using: Ontology Matching Using Vector Space (ZE, NY, FO), pp. 472–481.
ICML-2008-SahbiARK #kernel #recognition #robust #using: Robust matching and recognition using context-dependent kernels (HS, JYA, JR, RK), pp. 856–863.
ICML-2008-SongZSGS #estimation #kernel: Tailoring density estimation via reproducing kernel moment matching (LS, XZ, AJS, AG, BS), pp. 992–999.
ICPR-2008-BazinKDV #image #using: Improvement of feature matching in catadioptric images using gyroscope data (JCB, IK, CD, PV), pp. 1–5.
ICPR-2008-ChariotK #image #online: GPU-boosted online image matching (AC, RK), pp. 1–4.
ICPR-2008-ChivertonMX #difference #similarity: Variational Maximum A Posteriori model similarity and dissimilarity matching (JC, MM, XX), pp. 1–4.
ICPR-2008-DonateWLC #performance: Efficient and accurate subpixel path based stereo matching (AD, YW, XL, EGCJ), pp. 1–4.
ICPR-2008-FuSHLT #image #kernel #learning #multi #set: Multiple kernel learning from sets of partially matching image features (SYF, GS, ZGH, ZzL, MT), pp. 1–4.
ICPR-2008-Gherardi: Confidence-based cost modulation for stereo matching (RG), pp. 1–4.
ICPR-2008-GuimaraesPP #approach #detection #difference #distance #graph #using #video: An approach for video cut detection using bipartite graph matching as dissimilarity distance (SJFG, ZKGdPJ, HBdP), pp. 1–4.
ICPR-2008-GuZ #metric #similarity: A similarity measure under Log-Euclidean metric for stereo matching (QG, JZ), pp. 1–4.
ICPR-2008-KangBK #3d #modelling #multi: Multi-resolution 3D morphable models and its matching method (BNK, HB, DK), pp. 1–4.
ICPR-2008-LangerK #approach #detection #image #realtime #robust: A new hierarchical approach in robust real-time image feature detection and matching (ML, KDK), pp. 1–4.
ICPR-2008-LiuLLJT #graph #probability #representation: Layered shape matching and registration: Stochastic sampling with hierarchical graph representation (XL, LL, HL, HJ, WT), pp. 1–4.
ICPR-2008-MaWHJG #effectiveness: Effective scene matching with local feature representatives (SM, WW, QH, SJ, WG), pp. 1–4.
ICPR-2008-PalanderB #geometry: Epipolar geometry and log-polar transform in wide baseline stereo matching (KP, SSB), pp. 1–4.
ICPR-2008-ParamanandR #geometry #higher-order #performance: Efficient geometric matching with higher-order features (CP, ANR), pp. 1–4.
ICPR-2008-RabinDG: A contrario matching of SIFT-like descriptors (JR, JD, YG), pp. 1–4.
ICPR-2008-SanromaSA #clique #graph: Improving the matching of graphs generated from shapes by the use of procrustes distances into a clique-based MAP formulation (GS, FS, RA), pp. 1–4.
ICPR-2008-ShenCLB #random #using: Stereo matching using random walks (RS, IC, XL, AB), 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.
ICPR-2008-WangWHHG #image #symmetry: Symmetric segment-based stereo matching of motion blurred images with illumination variations (WW, YW, LH, QH, WG), pp. 1–4.
ICPR-2008-WangY #feature model #image #realtime: Feature selection for real-time image matching systems (QW, SY), pp. 1–4.
ICPR-2008-WangYS #statistics: Matching colonic polyps from prone and supine CT colonography scans based on statistical curvature information (SW, JY, RMS), pp. 1–4.
ICPR-2008-WooKK #probability: Probabilistic matching of line segments for their homography (JW, TK, ISK), pp. 1–4.
ICPR-2008-ZhangGY #3d #adaptation #modelling: Local stereo matching with 3D adaptive cost aggregation for slanted surface modeling and sub-pixel accuracy (YZ, MG, YHY), pp. 1–4.
ICPR-2008-ZhangWHJG #image: Matching images more efficiently with local descriptors (DZ, WW, QH, SJ, WG), pp. 1–4.
KDD-2008-WickRSM #approach: A unified approach for schema matching, coreference and canonicalization (MLW, KR, KS, AM), pp. 722–730.
SEKE-2008-AssawamekinSP #automation #multi #ontology #requirements #traceability #using: Automated Multiperspective Requirements Traceability Using Ontology Matching Technique (NA, TS, CP), pp. 460–465.
SIGIR-2008-Gan #approach #query #using: Using a mediated query approach for matching unstructured query with structured resources (KHG), p. 895.
SIGIR-2008-LiaoCH #image #named #optimisation #scheduling #video: AdImage: video advertising by image matching and ad scheduling optimization (WSL, KTC, WHH), pp. 767–768.
ICMT-2008-RathBOV #incremental #model transformation #pattern matching: Live Model Transformations Driven by Incremental Pattern Matching (IR, GB, AÖ, DV), pp. 107–121.
MoDELS-2008-FalleriHLN #automation #generative #metamodelling #model transformation: Metamodel Matching for Automatic Model Transformation Generation (JRF, MH, ML, CN), pp. 326–340.
MoDELS-2008-FalleriHLN #automation #generative #metamodelling #model transformation: Metamodel Matching for Automatic Model Transformation Generation (JRF, MH, ML, CN), pp. 326–340.
PADL-2008-HirzelNBV #named #pattern matching: Matchete: Paths through the Pattern Matching Jungle (MH, NN, BB, JV), pp. 150–166.
RE-2008-GordijnKW: Value-driven Service Matching (JG, SdK, RW), pp. 67–70.
SAC-2008-DongSZ #design pattern #detection: Design pattern detection by template matching (JD, YS, YZ), pp. 765–769.
SMT-2007-MoskalLK08: E-matching for Fun and Profit (MM, JL, JRK), pp. 19–35.
ICLP-2008-VanhoofD #algorithm #logic programming #source code: An Algorithm for Sophisticated Code Matching in Logic Programs (WV, FD), pp. 785–789.
ICST-2008-TravisonS #automation #identification #pattern matching: Test Instrumentation and Pattern Matching for Automatic Failure Identification (DT, GS), pp. 377–386.
IJCAR-2008-TourEN #equation #unification: Unification and Matching Modulo Leaf-Permutative Equational Presentations (TBdlT, ME, PN), pp. 332–347.
LICS-2008-GasconGS: Context Matching for Compressed Terms (AG, GG, MSS), pp. 93–102.
CASE-2007-VidalA #visual notation: Window-Matching Techniques with Kalman Filtering for an Improved Object Visual Tracking (FdBV, VHCA), pp. 829–834.
DAC-2007-AgostaBPS #approach #canonical: A Unified Approach to Canonical Form-based Boolean Matching (GA, FB, GP, DS), pp. 841–846.
DAC-2007-PiyachonL #pattern matching #performance #state machine: Compact State Machines for High Performance Pattern Matching (PP, YL), pp. 493–496.
DATE-2007-ChangLR #performance #using: Improve CAM power efficiency using decoupled match line scheme (YJC, YHL, SJR), pp. 165–170.
DRR-2007-ShangLD #optimisation #pattern matching: OCR result optimization based on pattern matching (JS, CL, XD).
ICDAR-2007-BabaUS #online #predict #recognition: Predictive DP Matching for On-Line Character Recognition (DB, SU, HS), pp. 674–678.
ICDAR-2007-LiuJ #optimisation: Character Stroke Extraction Based on B-spline Curve Matching by Constrained Alternating Optimization (XL, YJ), pp. 13–17.
ICDAR-2007-PrasanthBSRM #online #using: Elastic Matching of Online Handwritten Tamil and Telugu Scripts Using Local Features (LP, VB, RS, GVR, DM), pp. 1028–1032.
ICDAR-2007-ValleCP #database #identification #image: Matching Local Descriptors for Image Identification on Cultural Databases (EV, MC, SPF), pp. 679–683.
ICDAR-2007-ZiaratbanFF #feature model #recognition #using: Language-Based Feature Extraction Using Template-Matching In Farsi/Arabic Handwritten Numeral Recognition (MZ, KF, FF), pp. 297–301.
SIGMOD-2007-ScannapiecoFBE #privacy: Privacy preserving schema and data matching (MS, IF, EB, AKE), pp. 653–664.
VLDB-2007-ChaudhuriCGK #design #performance #query: Example-driven design of efficient record matching queries (SC, BCC, VG, RK), pp. 327–338.
VLDB-2007-DuchateauBH #benchmark #metric #named #tool support #xml: XBenchMatch: a Benchmark for XML Schema Matching Tools (FD, ZB, EH), pp. 1318–1321.
VLDB-2007-HanLMJ #database #sequence: Ranked Subsequence Matching in Time-Series Databases (WSH, JL, YSM, HJ), pp. 423–434.
VLDB-2007-KimelfeldS #probability #xml: Matching Twigs in Probabilistic XML (BK, YS), pp. 27–38.
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-WongTFX #on the #performance: On Efficient Spatial Matching (RCWW, YT, AWCF, XX), pp. 579–590.
ESOP-2007-KirchnerKM #pattern matching: Anti-pattern Matching (CK, RK, PEM), pp. 110–124.
ICSM-2007-NagarajanGMZS #control flow: Matching Control Flow of Program Versions (VN, RG, MM, XZ, BDS), pp. 84–93.
SCAM-2007-MolinaS #approximate #open source #performance #source code #using: Fast Approximate Matching of Programs for Protecting Libre/Open Source Software by Using Spatial Indexes (AJMM, TS), pp. 111–122.
PEPM-2007-RooverDBND #behaviour #logic #query #similarity #source code #using: Behavioral similarity matching using concrete source code templates in logic queries (CDR, TD, JB, CN, LD), pp. 92–101.
STOC-2007-AnshelevichK #3d #graph #polynomial: Terminal backup, 3D matching, and covering cubic graphs (EA, AK), pp. 391–400.
STOC-2007-BayatiGKNT #algorithm #approximate: Simple deterministic approximation algorithms for counting matchings (MB, DG, DAK, CN, PT), pp. 122–127.
CIAA-2007-Marschner #transducer #using: Efficiently Matching with Local Grammars Using Prefix Overlay Transducers (CM), pp. 314–316.
CIAA-2007-PeltolaT #on the #string: On String Matching in Chunked Texts (HP, JT), pp. 157–167.
CIAA-2007-Supol: Significant Subpatterns Matching (JS), pp. 317–319.
ICALP-2007-KatrielKU #nondeterminism #probability #problem: Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems (IK, CKM, EU), pp. 171–182.
LATA-2007-IliopoulosJMS #approximate #pattern matching: Weighted Degenerated Approximate Pattern Matching (CSI, IJ, BM, JS), pp. 285–296.
ICFP-2007-SymeNM #lightweight #pattern matching: Extensible pattern matching via a lightweight language extension (DS, GN, JM), pp. 29–40.
AGTIVE-2007-BatzKG #evaluation #graph #pattern matching: A First Experimental Evaluation of Search Plan Driven Graph Pattern Matching (GVB, MK, RG), pp. 471–486.
AGTIVE-2007-MatznerMS #automation #graph #performance: Efficient Graph Matching with Application to Cognitive Automation (AM, MM, AS), pp. 297–312.
AGTIVE-2007-VarroHV #graph #pattern matching #recursion: Recursive Graph Pattern Matching (GV, ÁH, DV), pp. 456–470.
GT-VMT-2007-HorvathVV #graph: Generic Search Plans for Matching Advanced Graph Patterns (ÁH, GV, DV).
CHI-2007-GluckBM: Matching attentional draw with utility in interruption (JG, AB, JM), pp. 41–50.
HCI-MIE-2007-JangKC #geometry #using #visual notation: Position and Pose Computation of a Moving Camera Using Geometric Edge Matching for Visual SLAM (HJ, GYK, HIC), pp. 634–641.
OCSC-2007-ChenKH #development #modelling #multi #requirements: Modelling and Matching: A Methodology for ePlanning System Development to Address the Requirements of Multiple User Groups (YC, MK, AH), pp. 41–49.
ICEIS-AIDSS-2007-FurstT #concept #graph #ontology: Heavyweight Ontology Matching — A Method and a Tool based on the Conceptual Graphs Model (FF, FT), pp. 265–270.
ICEIS-DISI-2007-Chen #algorithm #pattern matching: A new algorithm for twig pattern matching (YC), pp. 44–51.
CIKM-2007-DornelesHOSM #approximate: A strategy for allowing meaningful and comparable scores in approximate matching (CFD, CAH, VMO, ASdS, ESdM), pp. 303–312.
CIKM-2007-DrummSDR #automation #migration #named: Quickmig: automatic schema matching for data migration projects (CD, MS, HHD, ER), pp. 107–116.
KDD-2007-MimnoM #modelling: Expertise modeling for matching papers with reviewers (DMM, AM), pp. 500–509.
KDD-2007-TongFGE #graph #pattern matching #performance #scalability: Fast best-effort pattern matching in large attributed graphs (HT, CF, BG, TER), pp. 737–746.
MLDM-2007-HanKK #performance #sequence #using: Efficient Subsequence Matching Using the Longest Common Subsequence with a Dual Match Index (TSH, SKK, JK), pp. 585–600.
SEKE-2007-GuzmanPP #modelling #pattern matching #using: Using Model-Driven Pattern Matching to derive functionalities in Models (IGRdG, MP, MP), pp. 529–534.
SIGIR-2007-Wan #clustering #documentation #evaluation #named #using: OMES: a new evaluation strategy using optimal matching for document clustering (XW), pp. 693–694.
SIGIR-2007-WiegandLK: Combining term-based and event-based matching for question answering (MW, JLL, DK), pp. 715–716.
SIGIR-2007-YiAC #modelling: Matching resumes and jobs based on relevance models (XY, JA, WBC), pp. 809–810.
MoDELS-2007-RamosBJ: Matching Model-Snippets (RR, OB, JMJ), pp. 121–135.
MoDELS-2007-RamosBJ: Matching Model-Snippets (RR, OB, JMJ), pp. 121–135.
ECOOP-2007-EmirOW: Matching Objects with Patterns (BE, MO, JW), pp. 273–298.
SAC-2007-AdjerohKZMBB #performance: BWT-based efficient shape matching (DAA, UK, NZ, AM, MTB, TB), pp. 1079–1085.
SAC-2007-FabroV #automation #integration #modelling #using #weaving: Semi-automatic model integration using matching transformations and weaving models (MDDF, PV), pp. 963–970.
SAC-2007-LeeHPLJK #performance #regular expression #using: A high performance NIDS using FPGA-based regular expression matching (JL, SHH, NP, SWL, SJ, YSK), pp. 1187–1191.
SAC-2007-XingXE #approximate #automation #documentation #using #xml: Building automatic mapping between XML documents using approximate tree matching (GX, ZX, AE), pp. 525–526.
ICSE-2007-KimNG #automation: Automatic Inference of Structural Changes for Matching across Program Versions (MK, DN, DG), pp. 333–343.
ICSE-2007-NejatiSCEZ #specification: Matching and Merging of Statecharts Specifications (SN, MS, MC, SME, PZ), pp. 54–64.
PPoPP-2007-ZhangD #source code: Barrier matching for programs with textually unaligned barriers (YZ, ED), pp. 194–204.
CADE-2007-MouraB #performance #smt: Efficient E-Matching for SMT Solvers (LMdM, NB), pp. 183–198.
CADE-2007-Stirling #automaton #game studies: Games, Automata and Matching (CS), pp. 1–2.
LICS-2007-Stirling #automaton #game studies #higher-order: Higher-Order Matching, Games and Automata (CS), pp. 326–335.
MBT-2007-LedruBDA #case study #proving: A Case Study in Matching Test and Proof Coverage (YL, LdB, FD, FA), pp. 73–84.
SAT-2007-Szeider #set: Matched Formulas and Backdoor Sets (SS), pp. 94–99.
DAC-2006-SafarpourVBY #performance #satisfiability: Efficient SAT-based Boolean matching for FPGA technology mapping (SS, AGV, GB, RY), pp. 466–471.
DAC-2006-Wang #detection #symmetry: Exploiting K-Distance Signature for Boolean Matching and G-Symmetry Detection (KHW), pp. 516–521.
DATE-DF-2006-LinHJC #optimisation #pattern matching #regular expression: Optimization of regular expression pattern matching circuits on FPGA (CHL, CTH, CPJ, SCC), pp. 12–17.
DRR-2006-LoprestiNJ #correlation #generative #graph: Match graph generation for symbolic indirect correlation (DPL, GN, AJ).
HT-2006-Ruddle #hypermedia #navigation #string #using: Using string-matching to analyze hypertext navigation (RAR), pp. 49–52.
SIGMOD-2006-KiniSND #database: Database support for matching: limitations and opportunities (AK, SS, JFN, DJD), pp. 85–96.
SIGMOD-2006-XueLCL #detection #network: Contour map matching for event detection in sensor networks (WX, QL, LC, YL), pp. 145–156.
VLDB-2006-BernsteinMC #incremental: Incremental Schema Matching (PAB, SM, JEC), pp. 1167–1170.
VLDB-2006-BohannonEFF: Putting Context into Schema Matching (PB, EE, WF, MF), pp. 307–318.
VLDB-2006-Tung0KO #approach #similarity: Similarity Search: A Matching Based Approach (AKHT, RZ, NK, BCO), pp. 631–642.
VLDB-2006-WarrenT #database #multi #string: Multi-column Substring Matching for Database Schema Translation (RHW, FWT), pp. 331–342.
MSR-2006-KimN #analysis #multi: Program element matching for multi-version program analyses (MK, DN), pp. 58–64.
CIAA-2006-Hyyro #approximate #automaton #nondeterminism #string: Tighter Packed Bit-Parallel NFA for Approximate String Matching (HH), pp. 287–289.
ICALP-v1-2006-Bille #algorithm #regular expression: New Algorithms for Regular Expression Matching (PB), pp. 643–654.
ICALP-v1-2006-BjorklundH #algorithm #satisfiability: Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings (AB, TH), pp. 548–559.
ICALP-v1-2006-HoangMT #on the #problem: On the Bipartite Unique Perfect Matching Problem (TMH, MM, TT), pp. 453–464.
ICALP-v1-2006-Mestre: Weighted Popular Matchings (JM), pp. 715–726.
ICALP-v1-2006-Sankowski #matrix #multi: Weighted Bipartite Matching in Matrix Multiplication Time (PS), pp. 274–285.
ICALP-v2-2006-Stirling #approach #game studies #higher-order: A Game-Theoretic Approach to Deciding Higher-Order Matching (CS), pp. 348–359.
ICGT-2006-VelascoL #approach #graph transformation #matrix #sequence: Matrix Approach to Graph Transformation: Matching and Sequences (PPPV, JdL), pp. 122–137.
ICEIS-AIDSS-2006-BiesalskiA #enterprise #information management #metric #similarity: Similarity Measures for Skill-Profile Matching in Enterprise Knowledge Management (EB, AA), pp. 11–16.
ICEIS-J-2006-BiesalskiA06a #metric #similarity: Skill-Profile Matching with Similarity Measures (EB, AA), pp. 210–218.
CIKM-2006-DavidGB #ontology #owl: Matching directories and OWL ontologies with AROMA (JD, FG, HB), pp. 830–831.
CIKM-2006-GoldinMN #algorithm #clustering #distance #sequence: In search of meaning for time series subsequence clustering: matching algorithms based on a new distance measure (DQG, RM, GN), pp. 347–356.
CIKM-2006-KuntschkeK #data type #evaluation: Matching and evaluation of disjunctive predicates for data stream sharing (RK, AK), pp. 832–833.
CIKM-2006-Takasu #algorithm #approximate #documentation #multi #retrieval #robust: An approximate multi-word matching algorithm for robust document retrieval (AT), pp. 34–42.
CIKM-2006-YangDB: Practical private data matching deterrent to spoofing attacks (YY, RHD, FB), pp. 852–853.
ECIR-2006-FreschiSB #email #obfuscation #string: Filtering Obfuscated Email Spam by means of Phonetic String Matching (VF, AS, AB), pp. 505–509.
ICPR-v1-2006-AdachiKO #estimation #fault #reliability: Reliability index of optical flow that considers error margin of matches and stabilizes camera movement estimation (EA, TK, NO), pp. 699–702.
ICPR-v1-2006-ArgyrosL #2d #re-engineering: Binocular Hand Tracking and Reconstruction Based on 2D Shape Matching (AAA, MIAL), pp. 207–210.
ICPR-v1-2006-LiangA #using: Fingerprint Matching Using Minutia Polygons (XL, TA), pp. 1046–1049.
ICPR-v1-2006-LuM #constraints: A New Structural Constraint and its Application in Wide Baseline Matching (XL, RM), pp. 84–89.
ICPR-v1-2006-SchrotterZ #analysis #image #modelling #multi #robust: Robust Model Driven Matching Method for Face Analysis with Multi Image Photogrammetry (GS, LZ), pp. 480–483.
ICPR-v1-2006-Ueshiba #bidirectional #implementation #performance #realtime: An Efficient Implementation Technique of Bidirectional Matching for Real-time Trinocular Stereo Vision (TU), pp. 1076–1079.
ICPR-v1-2006-WangGLR #algorithm #performance: An efficient algorithm for fingerprint matching (CW, MLG, YL, JGR), pp. 1034–1037.
ICPR-v1-2006-ZhouW #symmetry: Symmetric Pixel-Group Based Stereo Matching for Occlusion Handling (XZ, RW), pp. 47–50.
ICPR-v2-2006-ChiuL #invariant #using: Matching Interest Points Using Affine Invariant Concentric Circles (HPC, TLP), pp. 167–170.
ICPR-v2-2006-DowsonBK #image #using: Image template matching using Mutual Information and NP-Windows (NDHD, RB, TK), pp. 1186–1191.
ICPR-v2-2006-EedeMTSD #canonical: Canonical Skeletons for Shape Matching (MvE, DM, ACT, CS, SJD), pp. 64–69.
ICPR-v2-2006-KirkegaardM #graph: Bin-Picking based on Harmonic Shape Contexts and Graph-Based Matching (JK, TBM), pp. 581–584.
ICPR-v2-2006-KuijperOBG #2d #set #symmetry #using: Matching 2D Shapes using their Symmetry Sets (AK, OFO, PB, PJG), pp. 179–182.
ICPR-v2-2006-LiuSXR #complexity #feature model #image: Image Complexity and Feature Extraction for Steganalysis of LSB Matching Steganography (QL, AHS, JX, BR), pp. 267–270.
ICPR-v2-2006-McNeillV #probability: Part-Based Probabilistic Point Matching (GM, SV), pp. 382–386.
ICPR-v2-2006-MekuzDT #adaptation #detection: Adaptive Step Size Window Matching for Detection (NM, KGD, JKT), pp. 259–262.
ICPR-v2-2006-MitaKH #approach #categorisation #performance #probability #robust: A Probabilistic Approach to Fast and Robust Template Matching and its Application to Object Categorization (TM, TK, OH), pp. 597–601.
ICPR-v2-2006-MunguiaGS #image: Matching Images Features in a Wide Base Line with ICA Descriptors (RM, AG, AS), pp. 159–162.
ICPR-v2-2006-ThakoorJWG #classification: Occlusion Resistant Shape Classifier based onWarped Optimal Path Matching (NT, SJ, QW, JG), pp. 60–63.
ICPR-v2-2006-WeiGO #multi #verification: Fingerprint Verification Based on Multistage Minutiae Matching (HW, MG, ZO), pp. 1058–1061.
ICPR-v3-2006-BaldacciGLR #approach #clustering: A Template-Matching Approach for Protein Surface Clustering (LB, MG, AL, SR), pp. 340–343.
ICPR-v3-2006-CaetanoC #invariant #pattern matching: A Unified Formulation of Invariant Point Pattern Matching (TSC, TC), pp. 121–124.
ICPR-v3-2006-DePieroC #graph: Structural Matching Via Optimal Basis Graphs (FWD, JKC), pp. 449–452.
ICPR-v3-2006-EmmsHW #graph #quantum #using: Graph Matching using Interference of Coined Quantum Walks (DE, ERH, RCW), pp. 133–136.
ICPR-v3-2006-KlausSK #adaptation #difference #self #using: Segment-Based Stereo Matching Using Belief Propagation and a Self-Adapting Dissimilarity Measure (AK, MS, KFK), pp. 15–18.
ICPR-v3-2006-NagasakiMKS #adaptation #classification #image: A Coupon Classification Method Based on Adaptive Image Vector Matching (TN, KM, TK, HS), pp. 280–283.
ICPR-v3-2006-QiuH #graph #using: Graph Matching using Commute Time Spanning Trees (HQ, ERH), pp. 1224–1227.
ICPR-v3-2006-SagirogluE #approach #assembly #automation: A Texture Based Matching Approach for Automated Assembly of Puzzles (MSS, AE), pp. 1036–1041.
ICPR-v3-2006-TanHYT #performance #recognition: Efficient Night Gait Recognition Based on Template Matching (DT, KH, SY, TT), pp. 1000–1003.
ICPR-v3-2006-TianK06a #algorithm #distance #performance #using: An Efficient Algorithm for Point Matching Using Hilbert Scanning Distance (LT, SiK), pp. 873–876.
ICPR-v3-2006-WangLH #image #video #visual notation: Video Local Pattern based Image Matching for Visual Mapping (LW, HL, RIH), pp. 67–70.
ICPR-v3-2006-XuL06a #graph #recognition #sketching: Face Recognition by Expression-Driven Sketch Graph Matching (ZX, JL), pp. 1119–1122.
ICPR-v3-2006-YeungS #framework #probability #set #symmetry: Stochastic Framework for Symmetric Affine Matching between Point Sets (SKY, PS), pp. 790–793.
ICPR-v4-2006-CantoniLL06a #algorithm: Most minutiae-based matching algorithms confront (VC, LL, PL), pp. 378–385.
ICPR-v4-2006-ChouSCC #multi #recognition: Iris Recognition with Multi-Scale Edge-Type Matching (CTC, SWS, WSC, VWC), pp. 545–548.
ICPR-v4-2006-FengC06a #coordination #representation: Fingerprint Representation and Matching in Ridge Coordinate System (JF, AC), pp. 485–488.
ICPR-v4-2006-FengFCS #novel: A Novel Fingerprint Matching Scheme Based on Local Structure Compatibility (YF, JF, XC, ZS), pp. 374–377.
ICPR-v4-2006-HuangCC #image: Contrast Context Histogram — A Discriminating Local Descriptor for Image Matching (CRH, CSC, PCC), pp. 53–56.
ICPR-v4-2006-JainCD #using: Pores and Ridges: Fingerprint Matching Using Level 3 Features (AKJ, YC, MD), pp. 477–480.
ICPR-v4-2006-KwonYKL #clustering #using: Fingerprint Matching Method Using Minutiae Clustering and Warping (DK, IDY, DHK, SUL), pp. 525–528.
ICPR-v4-2006-MohantySK #approach: A Non-Iterative Approach to Reconstruct Face Templates from Match Scores (PM, SS, RK), pp. 598–601.
ICPR-v4-2006-NeuhausB #graph #kernel: A Convolution Edit Kernel for Error-tolerant Graph Matching (MN, HB), pp. 220–223.
ICPR-v4-2006-OuyangFSC: Fingerprint Matching With Rotation-Descriptor Texture Features (ZO, JF, FS, AC), pp. 417–420.
ICPR-v4-2006-QiuH06a #graph #using: Graph Matching using Commute Time Spanning Tr (HQ, ERH), p. 955.
ICPR-v4-2006-ShaZT #set #using: Minutiae-based Fingerprint Matching Using Subset Combination (LS, FZ, XT), pp. 566–569.
ICPR-v4-2006-TeshimaSOYI #estimation #image: Vehicle Lateral Position Estimation Method Based on Matching of Top-View Images (TT, HS, SO, KY, TI), pp. 626–629.
ICPR-v4-2006-WangLC06a #coordination: Fingerprint Minutiae Matching Based on Coordinate System Bank and Global Optimum Alignment (WW, JL, WC), pp. 401–404.
ICPR-v4-2006-YuH #graph #kernel #string: String Kernels for Matching Seriated Graphs (HY, ERH), pp. 224–228.
SIGIR-2006-FangZ #axiom #information retrieval #semantics: Semantic term matching in axiomatic approaches to information retrieval (HF, CZ), pp. 115–122.
RE-2006-El-AttarM #case study #modelling #quality: Matching Antipatterns to Improve the Quality of Use Case Models (MEA, JM), pp. 96–105.
ICSE-2006-MandelinKY #approach #architecture #diagrams #modelling: A Bayesian approach to diagram matching with application to architectural models (DM, DK, DMY), pp. 222–231.
HPDC-2006-Yom-TovA #estimation #requirements: Improving Resource Matching Through Estimation of Actual Job Requirements (EYT, YA), pp. 367–368.
ISSTA-2006-VisserPP #generative #java #using: Test input generation for java containers using state matching (WV, CSP, RP), pp. 37–48.
LICS-2006-Leivant #logic #proving #reasoning #source code: Matching Explicit and Modal Reasoning about Programs: A Proof Theoretic Delineation of Dynamic Logic (DL), pp. 157–168.
RTA-2006-Salvati #equation #linear #type system #λ-calculus: Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear λ-Calculus (SS), pp. 151–165.
CBSE-2005-TansalarakC #component #ranking: Finding a Needle in the Haystack: A Technique for Ranking Matches Between Components (NT, KTC), pp. 171–186.
DAC-2005-AbdollahiP #canonical #logic #performance #synthesis #verification: A new canonical form for fast boolean matching in logic synthesis and verification (AA, MP), pp. 379–384.
DAC-2005-AminID #approximate #using: Piece-wise approximations of RLCK circuit responses using moment matching (CSA, YII, FD), pp. 927–932.
DAC-2005-ChoM #network #pattern matching #security: A pattern matching coprocessor for network security (YHC, WHMS), pp. 234–239.
DATE-2005-LopezCLS #estimation #quality: A High Quality/Low Computational Cost Technique for Block Matching Motion Estimation (SL, GMC, JFL, RS), pp. 2–7.
DocEng-2005-BoukottayaV #documentation: Schema matching for transforming structured documents (AB, CV), pp. 101–110.
DRR-2005-ChenD #feature model #verification: Sequence-matching-based feature extraction with applications to signature verification (YC, XD), pp. 76–83.
ICDAR-2005-ArrivaultRB #approach #fuzzy #graph: A Fuzzy Hierarchical Attributed Graph Approach for Handwritten Egyptian Hieroglyphs description and matching (DA, NR, PB), pp. 898–903.
ICDAR-2005-KumarKCJ #image #using: Locating Text in Images using Matched Wavelets (SK, NK, SC, SDJ), pp. 595–599.
ICDAR-2005-LiuLCL #performance #recognition: Fast Vector Matching Methods and Their Applications to Handwriting Recognition (YHL, WHL, FC, CCL), pp. 871–877.
ICDAR-2005-MitomaUS #online #polynomial #recognition: Online Character Recognition Based on Elastic Matching and Quadratic Discrimination (HM, SU, HS), pp. 36–40.
ICDAR-2005-TulyakovG #identification: Combining Matching Scores in Identification Model (ST, VG), pp. 1151–1155.
ICDAR-2005-ZakosV #documentation #novel #retrieval #web: A Novel Context Matching Based Technique for Web Document Retrieval (JZ, BV), pp. 909–914.
ICDAR-2005-ZhengD #synthesis: Handwriting Matching and Its Application to Handwriting Synthesis (YZ, DSD), pp. 861–865.
SIGMOD-2005-AumuellerDMR #ontology: Schema and ontology matching with COMA++ (DA, HHD, SM, ER), pp. 906–908.
SIGMOD-2005-ChenLL #on the #pattern matching #using #xml: On Boosting Holism in XML Twig Pattern Matching using Structural Indexing Techniques (TC, JL, TWL), pp. 455–466.
SIGMOD-2005-KoudasMS #database #flexibility #named: SPIDER: flexible matching in databases (NK, AM, DS), pp. 876–878.
SIGMOD-2005-WuSSJSK #sequence: Subsequence Matching on Structured Time Series Data (HW, BS, GCS, SBJ, HS, DRK), pp. 682–693.
VLDB-2005-AugstenBG #approximate #using: Approximate Matching of Hierarchical Data Using pq-Grams (NA, MHB, JG), pp. 301–312.
VLDB-2005-BrakatsoulasPSW #on the: On Map-Matching Vehicle Tracking Data (SB, DP, RS, CW), pp. 853–864.
VLDB-2005-ChenGK #algorithm #graph #pattern matching: Stack-based Algorithms for Pattern Matching on DAGs (LC, AG, MEK), pp. 493–504.
VLDB-2005-LarsonZ: View Matching for Outer-Join Views (PÅL, JZ), pp. 445–456.
VLDB-2005-LuLCC #encoding #pattern matching #performance #xml: From Region Encoding To Extended Dewey: On Efficient Processing of XML Twig Pattern Matching (JL, TWL, CYC, TC), pp. 193–204.
VLDB-2005-SayyadianLDR #using: Tuning Schema Matching Software using Synthetic Scenarios (MS, YL, AD, AR), pp. 994–1005.
MSR-2005-NeamtiuFH #abstract syntax tree #comprehension #evolution #source code #syntax #using: Understanding source code evolution using abstract syntax tree matching (IN, JSF, MWH), pp. 81–85.
CIAA-J-2004-HanMZ05 #approach #automaton #database #sequence: An automata approach to match gapped sequence tags against protein database (YH, BM, KZ), pp. 487–497.
CIAA-2005-ZdarekM #2d #automaton #finite #on the #pattern matching: On Two-Dimensional Pattern Matching by Finite Automata (JZ, BM), pp. 329–340.
ICALP-2005-Farach-ColtonLST #approximate #performance #string: Optimal Spaced Seeds for Faster Approximate String Matching (MFC, GML, SCS, DT), pp. 1251–1262.
IFM-2005-MalikR #adaptation #case study #comparative #embedded #specification: Adaptive Techniques for Specification Matching in Embedded Systems: A Comparative Study (RM, PSR), pp. 33–52.
EDOC-2005-XuXH #approach: An Extended Event Matching Approach in Content-based Pub/Sub Systems for EAI (GX, WX, TH), pp. 287–296.
CIKM-2005-HalachevST #sequence #using: Exact match search in sequence data using suffix trees (MH, NS, AT), pp. 123–130.
CIKM-2005-NottelmannS #information retrieval #machine learning #probability: Information retrieval and machine learning for probabilistic schema matching (HN, US), pp. 295–296.
ECIR-2005-NottelmannS #approach #named #probability: sPLMap: A Probabilistic Approach to Schema Matching (HN, US), pp. 81–95.
KDD-2005-HeC #approach #robust: Making holistic schema matching robust: an ensemble approach (BH, KCCC), pp. 429–438.
SIGIR-2005-SunCLKC #dependence: Dependency relation matching for answer selection (RS, HC, KL, MYK, TSC), pp. 651–652.
OOPSLA-2005-AllanACHKLMSST #aspectj: Adding trace matching with free variables to AspectJ (CA, PA, ASC, LJH, SK, OL, OdM, DS, GS, JT), pp. 345–364.
PPDP-2005-KirchnerMR #pattern matching #validation: Formal validation of pattern matching code (CK, PEM, AR), pp. 187–197.
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.
SAC-2005-CanfieldX #approximate #documentation #xml: Approximate XML document matching (ERC, GX), pp. 787–788.
SAC-2005-KimJ #performance #sequence: Performance bottleneck in time-series subsequence matching (SWK, BSJ), pp. 469–473.
SAC-2005-KimKS #database #optimisation #sequence: Optimization of subsequence matching under time warping in time-series databases (MSK, SWK, MS), pp. 581–586.
SAC-2005-YangC #algorithm #detection #maturity: The T-detectors maturation algorithm based on match range model (DY, JC), pp. 43–44.
ESEC-FSE-2005-ZhangG #execution: Matching execution histories of program versions (XZ, RG), pp. 197–206.
CAV-2005-PasareanuPV #model checking #refinement: Concrete Model Checking with Abstract Matching and Refinement (CSP, RP, WV), pp. 52–66.
CSL-2005-Stirling #game studies #higher-order: Higher-Order Matching and Games (CS), pp. 119–134.
RTA-2005-Yoshinaka #higher-order #linear #λ-calculus: Higher-Order Matching in the Linear λ Calculus in the Absence of Constants Is NP-Complete (RY), pp. 235–249.
CBSE-2004-MinCK #component #off the shelf #problem #using: Using Smart Connectors to Resolve Partial Matching Problems in COTS Component Acquisition (HGM, SWC, SDK), pp. 40–47.
DATE-v2-2004-CheungPHC #equivalence #named #using: MINCE: Matching INstructions Using Combinational Equivalence for Extensible Processor (NC, SP, JH, JC), pp. 1020–1027.
DRR-2004-OzawaTKNY #identification #image: Slide identification for lecture movies by matching characters and images (NO, HT, YK, SN, HY), pp. 74–81.
SIGMOD-2004-KumaranH #multi #named #sql: LexEQUAL: Multilexical Matching Operator in SQL (AK, JRH), pp. 949–950.
SIGMOD-2004-WuSZ #data type #online #sequence: Online Event-driven Subsequence Matching over Financial Data Streams (HW, BS, DZ), pp. 23–34.
VLDB-2004-DasCES #ontology #semantics: Supporting Ontology-Based Semantic matching in RDBMS (SD, EIC, GE, JS), pp. 1054–1065.
VLDB-2004-GuhaKMS #approximate: Merging the Results of Approximate Match Operations (SG, NK, AM, DS), pp. 636–647.
VLDB-2004-KoudasMS #database #flexibility #scalability #string: Flexible String Matching Against Large Databases in Practice (NK, AM, DS), pp. 1078–1086.
VLDB-2004-WangWLM #database #query #web: Instance-based Schema Matching for Web Databases by Domain-specific Query Probing (JW, JRW, FHL, WYM), pp. 408–419.
ESOP-2004-GustafssonS #adaptation #pattern matching: Adaptive Pattern Matching on Binary Data (PG, KFS), pp. 124–139.
STOC-2004-ColeGL #fault #taxonomy: Dictionary matching and indexing with errors and don’t cares (RC, LAG, ML), pp. 91–100.
FLOPS-2004-Kahl #calculus #pattern matching: Basic Pattern Matching Calculi: a Fresh View on Matching Failure (WK), pp. 276–290.
CIAA-2004-HanMZ #approach #automaton #database #sequence: An Automata Approach to Match Gapped Sequence Tags Against Protein Database (YH, BM, KZ), pp. 167–177.
CIAA-2004-PolcarM #2d #automaton #online #pattern matching: Two-Dimensional Pattern Matching by Two-Dimensional Online Tessellation Automata (TP, BM), pp. 327–328.
DLT-2004-InenagaST #algorithm #context-free grammar #pattern matching #performance #subclass: An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars (SI, AS, MT), pp. 225–236.
ICALP-2004-FrischC #regular expression: Greedy Regular Expression Matching (AF, LC), pp. 618–629.
ICGT-2004-CherchagoH #graph transformation #specification #using #web #web service: Specification Matching of Web Services Using Conditional Graph Transformation Rules (AC, RH), pp. 304–318.
ICEIS-v2-2004-HansennePSW #design #fuzzy #implementation #scalability: Design and Implementation of a Scalable Fuzzy Case-Based Matching Engine (RH, JVP, VVdS, BVdW), pp. 375–382.
ICEIS-v3-2004-Raabe #modelling #re-engineering: Feature Matching in Model-Based Software Engineering (AR), pp. 163–172.
ICEIS-v3-2004-ZoukarS #approach #enterprise #requirements #similarity: Matching ERP Functionalities with the Logistic Requirements of French Railways: A Similarity Approach (IZ, CS), pp. 444–450.
ICEIS-v4-2004-LeDG #multi #on the #ontology #problem #semantics #web: On Ontology Matching Problems — for Building a Corporate Semantic Web in a Multi-Communities Organization (BTL, RDK, FG), pp. 236–243.
CIKM-2004-KumaranH #multi #on the #relational #semantics: On semantic matching of multilingual attributes in relational systems (AK, JRH), pp. 230–231.
ICPR-v1-2004-BhowmickB #approximate #using: Approximate Fingerprint Matching Using Kd-Tree (PB, BBB), pp. 544–547.
ICPR-v1-2004-KimYL #algorithm #distance #graph #relational #using: A New Attributed Relational Graph Matching Algorithm Using the Nested Structure of Earth Mover’s Distance (DHK, IDY, SUL), pp. 48–51.
ICPR-v1-2004-MatsumotoUS #image #pattern matching #pattern recognition #prototype #recognition: Prototype Setting for Elastic Matching-Based Image Pattern Recognition (NM, SU, HS), pp. 224–227.
ICPR-v1-2004-NgTTS: Adjacent Orientation Vector Based Fingerprint Minutiae Matching System (GSN, XT, XT, DS), pp. 528–531.
ICPR-v2-2004-BlicherRP #2d #3d #image #named #performance: LightSphere: Fast Lighting Compensation for Matching a 2D Image to a 3D Model (APB, SR, PSP), pp. 157–162.
ICPR-v2-2004-CaetanoCB #algorithm #comparison #distance #metric #using: A Comparison of Junction Tree and Relaxation Algorithms for Point Matching using Different Distance Metrics (TSC, TC, DACB), pp. 124–127.
ICPR-v2-2004-ErolHGL #documentation #image #multi: Prescient Paper: Multimedia Document Creation with Document Image Matching (BE, JJH, JG, DSL), pp. 675–678.
ICPR-v2-2004-KaplanRS #image #robust: Robust Feature Matching Across Widely Separated Color Images (AK, ER, IS), pp. 136–139.
ICPR-v2-2004-LiuLW #using: Free Form Shape Matching Using Deterministic Annealing and Softassign (YL, LL, YW), pp. 128–131.
ICPR-v2-2004-LourakisAM #approach #graph #information management #similarity #using: A Graph-Based Approach to Corner Matching Using Mutual Information as a Local Similarity Measure (MIAL, AAA, KM), pp. 827–830.
ICPR-v2-2004-LuCY #approach #composition #graph: A Graph Decomposition Approach to Least Squares Attributed Graph Matching (JL, TC, JYY), pp. 471–474.
ICPR-v2-2004-NiR #pattern matching: Pattern Matching by Sequential Subdivision of Transformation Space (MN, SER), pp. 145–148.
ICPR-v2-2004-RubeAK #classification #invariant #multi: Coarse-to-Fine Multiscale Affine Invariant Shape Matching and Classification (IER, MA, MK), pp. 163–166.
ICPR-v2-2004-TabboneW04a #graph #image #relational: Retrieving Images by Content from Strong Relational Graph Matching (ST, LW), pp. 951–954.
ICPR-v3-2004-AlatasJS #retrieval #video: Compressed Spatio-temporal Descriptors for Video Matching and Retrieval (OA, OJ, MS), pp. 882–885.
ICPR-v3-2004-AurnhammerM #metric: Improving Seismic Horizon Matching by Ordinal Measures (MA, RM), pp. 642–645.
ICPR-v3-2004-BaiYH #graph #using: Graph Matching using Spectral Embedding and Alignment (XB, HY, ERH), pp. 398–401.
ICPR-v3-2004-ChambonC #algorithm #robust #towards: Towards Correlation-Based Matching Algorithms that are Robust Near Occlusions (SC, AC), pp. 20–23.
ICPR-v3-2004-Chen04a #framework #robust: An Application of Robust Template Matching to User Location on Wireless Infrastructure (JHC), pp. 687–690.
ICPR-v3-2004-ChenC #distance #image #metric: Discriminative Distance Measures for Image Matching (XC, TJC), pp. 691–695.
ICPR-v3-2004-ChenJ: Tooth Contour Extraction for Matching Dental Radiographs (HC, AKJ), pp. 522–525.
ICPR-v3-2004-DePiero #bound #graph #memory management #polynomial #worst-case: Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort (FWD), pp. 379–382.
ICPR-v3-2004-GoriMS #graph #random #using: Graph matching using Random Walks (MG, MM, LS), pp. 394–397.
ICPR-v3-2004-JagmohanSA #estimation #kernel #using: Dense Stereo Matching Using Kernel Maximum Likelihood Estimation (AJ, MKS, NA), pp. 28–31.
ICPR-v3-2004-JiangN #graph #image: Graph Based Image Matching (HJ, CWN), pp. 658–661.
ICPR-v3-2004-KawanishiKKT #adaptation #algorithm #performance #using: A Fast Template Matching Algorithm with Adaptive Skipping Using Inner-Subtemplates’ Distances (TK, TK, KK, ST), pp. 654–657.
ICPR-v3-2004-LeowCPTVH #geometry #linear #representation: Linear and Non-linear Geometric Object Matching with Implicit Representation (ADL, MCC, HP, PMT, LAV, HSCH), pp. 710–713.
ICPR-v3-2004-LiMH: New Method for Sparse Point-Sets Matching with Underlying Non-Rigidity (BL, QM, HH), pp. 8–11.
ICPR-v3-2004-PetrovicC #recognition #refinement: Vehicle Type Recognition with Match Refinement (VSP, TFC), pp. 95–98.
ICPR-v3-2004-RenS #constraints #sequence #video: Video Sequence Matching with Spatio-Temporal Constraints (WR, SS), pp. 834–837.
ICPR-v3-2004-TamLN #geometry: Deformable Geometry Model Matching by Topological and Geometric Signatures (GKLT, RWHL, CWN), pp. 910–913.
ICPR-v3-2004-YanLWW #automation: Automatic Template Matching Method for Tropical Cyclone Eye Fix (KYW, CLY, PWL, WWT), pp. 650–653.
ICPR-v3-2004-ZhangL #multi #pattern matching: Point Pattern Matching for Articulated or Multiple Objects (XZ, YL), pp. 630–633.
ICPR-v4-2004-Elias: Wide Baseline Matching Through Homographic Transformation (RE), pp. 130–133.
ICPR-v4-2004-ShaT: Orientation-Improved Minutiae for Fingerprint Matching (LS, XT), pp. 432–435.
KDD-2004-HeCH #approach #correlation #interface #mining #query #web: Discovering complex matchings across web query interfaces: a correlation mining approach (BH, KCCC, JH), pp. 148–157.
KR-2004-Pirri #classification: Indoor Environment Classification and Perceptual Matching (FP), pp. 73–84.
KR-2004-SmythP #probability: Qualitative Probabilistic Matching with Hierarchical Descriptions (CS, DP), pp. 479–487.
SIGIR-2004-LamHC #learning #mining #similarity: Learning phonetic similarity for matching named entity translations and mining new translations (WL, RH, PSC), pp. 289–296.
SAC-2004-JiangWM #network #thread: Protein threading with residue-environment matching by artificial neural networks (NJ, WXW, IM), pp. 209–210.
SAC-2004-WaldmannSE #authentication: Protected transmission of biometric user authentication data for oncard-matching (UW, DS, CE), pp. 425–430.
SAC-2004-WuCY #performance: VCR indexing for fast event matching for highly-overlapping range predicates (KLW, SKC, PSY), pp. 740–747.
HPCA-2004-NarayanasamyHSC #convergence #string #using: Creating Converged Trace Schedules Using String Matching (SN, YH, SS, BC), pp. 210–221.
CSL-2004-GrooteS #higher-order #linear #λ-calculus: Higher-Order Matching in the Linear λ-calculus with Pairing (PdG, SS), pp. 220–234.
RTA-2004-Contejean #algorithm: A Certified AC Matching Algorithm (EC), pp. 70–84.
RTA-2004-Waldmann #bound #named #string: Matchbox: A Tool for Match-Bounded String Rewriting (JW), pp. 85–94.
DATE-2003-WangZ #analysis #polynomial: Transistor-Level Static Timing Analysis by Piecewise Quadratic Waveform Matching (ZW, JZ), pp. 11026–11031.
DocEng-2003-GarainDMC #pattern matching: Compression of scan-digitized Indian language printed text: a soft pattern matching technique (UG, SD, AM, BBC), pp. 185–192.
DRR-2003-SunW #retrieval #similarity: Similarity-based matching method for handwriting retrieval (KS, JW), pp. 156–163.
ICDAR-2003-El-NasanVN #n-gram #recognition #using: Handwriting Recognition Using Position Sensitive Letter N-Gram Matching (AEN, SV, GN), p. 577–?.
ICDAR-2003-FujisawaL #pattern matching #recognition #revisited: Directional Pattern Matching for Character Recognition Revisited (HF, CLL), pp. 794–798.
ICDAR-2003-Hilaire #algorithm #evaluation #performance: A Matching Scheme to Enhance Performance Evaluation of Raster-to-Vector Conversion Algorithms (XH), pp. 629–633.
ICDAR-2003-KameyaMO #online #sequence #verification: Figure-Based Writer Verification by Matching between an Arbitrary Part of Registered Sequence and an Input Sequence Extracted from On-Line Handwritten Figures (HK, SM, RO), pp. 985–989.
ICDAR-2003-MuramatsuKSA #evaluation #flexibility #recognition #standard #using: Improvement of Matching and Evaluation in Handwritten Numeral Recognition Using Flexible Standard Patterns (HM, TK, TS, KA), pp. 273–277.
ICDAR-2003-NakamuraY #recognition #video: Caption Text Recognition in Video Frames by MAP Matching (AN, KY), pp. 650–654.
ICDAR-2003-UchidaS #recognition #using: Handwritten character recognition using elastic matching based on a class-dependent deformation model (SU, HS), pp. 163–167.
ICDAR-2003-Ueda #pattern matching #using #verification: Investigation of Off-Line Japanese Signature Verification Using a Pattern Matching (KU), p. 951–?.
ICDAR-2003-Wakahara #correlation #recognition #using: Shape Matching Using GAT Correlation against Nonlinear Distortion and its Application to Handwritten Numeral Recognition (TW), p. 54–?.
SIGMOD-2003-Amer-YahiaFSX #approximate #named #xml: PIX: Exact and Approximate Phrase Matching in XML (SAY, MFF, DS, YX), p. 664.
SIGMOD-2003-ChaudhuriGGM #fuzzy #online #performance #robust: Robust and Efficient Fuzzy Match for Online Data Cleaning (SC, KG, VG, RM), pp. 313–324.
SIGMOD-2003-HeC #interface #query #statistics #web: Statistical Schema Matching across Web Query Interfaces (BH, KCCC), pp. 217–228.
SIGMOD-2003-KangN #on the: On Schema Matching with Opaque Column Names and Data Values (JK, JFN), pp. 205–216.
VLDB-2003-Amer-YahiaFSX #xml: Phrase Matching in XML (SAY, MFF, DS, YX), pp. 177–188.
FASE-2003-Pahl #component #ontology: An Ontology for Software Component Matching (CP), pp. 6–21.
ICSM-2003-Sartipi #architecture #pattern matching: Software Architecture Recovery based on Pattern Matching (KS), p. 293–?.
ICSM-2003-SartipiK #architecture #graph #modelling #on the: On Modeling Software Architecture Recovery as Graph Matching (KS, KK), pp. 224–234.
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-ChenLG #multi: Code Compaction of Matching Single-Entry Multiple-Exit Regions (WKC, BL, RG), pp. 401–417.
STOC-2003-JayramKKR #bound #problem: Cell-probe lower bounds for the partial match problem (TSJ, SK, RK, YR), pp. 667–672.
ICALP-2003-AmirACLP #algorithm #bound: Function Matching: Algorithms, Applications, and a Lower Bound (AA, YA, RC, ML, EP), pp. 929–942.
ICALP-2003-Vardi #automaton #logic: Logic and Automata: A Match Made in Heaven (MYV), pp. 64–65.
SEFM-2003-FeiksH #component #object-oriented #specification: Specification Matching of Object-Oriented Components (FF, DH), pp. 182–190.
ICEIS-v1-2003-GouveiaG #roadmap: Assuming a Roadmap Strategy for E-Business: Matching the Right Solution Over a Thousand Answers (FRG, LBG), pp. 550–553.
SEKE-2003-LimpiyakornB #comprehension #knowledge-based: Integrating Signature Matching into Knowledge-Based Program Understanding (YL, IB), pp. 440–444.
OOPSLA-2003-LeeLC #distributed #evolution #named #object-oriented #pattern matching: HydroJ: object-oriented pattern matching for evolvable distributed systems (KL, AL, CC), pp. 205–223.
PADL-2003-LiuM #java #named #pattern matching: JMatch: Iterable Abstract Pattern Matching for Java (JL, ACM), pp. 110–127.
CC-2003-MoreauRV #compilation #multi #pattern matching: A Pattern Matching Compiler for Multiple Target Languages (PEM, CR, MV), pp. 61–76.
CADE-2003-Nelson #quantifier #reasoning: Reasoning about Quantifiers by Matching in the E-graph (GN), p. 166.
CADE-2003-Ringeissen: Matching in a Class of Combined Non-disjoint Theories (CR), pp. 212–227.
CADE-2003-Schmidt-Schauss #bound #decidability #higher-order: Decidability of Arity-Bounded Higher-Order Matching (MSS), pp. 488–502.
RTA-2003-SalvatiG #complexity #higher-order #linear #on the #λ-calculus: On the Complexity of Higher-Order Matching in the Linear λ-Calculus (SS, PdG), pp. 234–245.
DAC-2002-AnastasakisDMS #performance: A practical and efficient method for compare-point matching (DA, RFD, HKTM, TS), pp. 305–310.
SIGMOD-2002-BrunoKS #pattern matching #xml: Holistic twig joins: optimal XML pattern matching (NB, NK, DS), pp. 310–321.
SIGMOD-2002-MoonWH #database #sequence: General match: a subsequence matching method in time-series databases based on generalized windows (YSM, KYW, WSH), pp. 382–393.
VLDB-2002-DoR #flexibility #named: COMA — A System for Flexible Combination of Schema Matching Approaches (HHD, ER), pp. 610–621.
VLDB-2002-LiuJ #approximate #named: A-TOPSS — A Publish/Subscribe System Supporting Approximate Matching (HL, HAJ), pp. 1107–1110.
FoSSaCS-2002-JhaPZ #performance: Efficient Type Matching (SJ, JP, TZ), pp. 187–204.
ICSM-2002-TvedtCL #architecture #design #evaluation #process: Does the Code Match the Design? A Process for Architecture Evaluation (RTT, PC, ML), pp. 393–401.
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-ColeH #verification: Verifying candidate matches in sparse and wildcard matching (RC, RH), pp. 592–601.
CIAA-J-2000-BergeronH02 #algorithm #approximate #string: Vector Algorithms for Approximate String Matching (AB, SH), pp. 53–66.
ICALP-2002-CharikarIP #algorithm #orthogonal #problem #query #set: New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems (MC, PI, RP), pp. 451–462.
CAiSE-2002-BerlinM #database #feature model #machine learning #using: Database Schema Matching Using Machine Learning with Feature Selection (JB, AM), pp. 452–466.
CAiSE-2002-LiuCD #memory management #rdf: Exploring RDF for Expertise Matching within an Organizational Memory (PL, JC, PMD), pp. 100–116.
ICEIS-2002-PequenoV #self #using: Using Full Match Classes for Self-Maintenance of Mediated Views (VMP, VMPV), pp. 148–154.
CIKM-2002-NahmM #mining: Mining soft-matching association rules (UYN, RJM), pp. 681–683.
ECIR-2002-Sormunen #evaluation #interactive #performance #query: A Retrospective Evaluation Method for Exact-Match and Best-Match Queries Applying an Interactive Query Performance Analyser (ES), pp. 334–352.
ICPR-v1-2002-ZhangW #algorithm #verification: Core-Based Structure Matching Algorithm of Fingerprint Verification (WZ, YW), pp. 70–74.
ICPR-v2-2002-AbabsaRMD #2d #3d #automation: 2D/3D Automatic Matching Technique for 3D Recovering of Free Form Objects (FA, DR, MM, JYD), pp. 430–433.
ICPR-v2-2002-BazenG #modelling: Elastic Minutiae Matching by Means of Thin-Plate Spline Models (AMB, SHG), pp. 985–988.
ICPR-v2-2002-CesarBB #graph #optimisation #probability #recognition #using: Inexact Graph Matching Using Stochastic Optimization Techniques for Facial Feature Recognition (RMC, EB, IB), pp. 465–468.
ICPR-v2-2002-FookesBL #image #using: Improved Stereo Image Matching Using Mutual Information and Hierarchical Prior Probabilities (CF, MB, AL), pp. 937–940.
ICPR-v2-2002-KanekoH #image #sequence: Template Update Criterion for Template Matching of Image Sequences (TK, OH), pp. 1–5.
ICPR-v2-2002-LaiW #image #reliability: Reliable Image Matching Based on Relative Gradients (SHL, SDW), pp. 802–805.
ICPR-v3-2002-AyromlouVP #probability #realtime: Probabilistic Matching of Image- to Model-Features for Real-time Object Tracking (MA, MV, WP), pp. 692–695.
ICPR-v3-2002-BoufamaO #image #segmentation: Region Segmentation and Matching in Stereo Images (BB, DJO), pp. 631–634.
ICPR-v3-2002-ChoC #algorithm: A Script Matching Algorithm for Oriental Characters on PDAs (MGC, HGC), pp. 957–960.
ICPR-v3-2002-FengH #performance: Confidence Guided Progressive Search and Fast Match Techniques for High Performance Chinese/English OCR (ZDF, QH), pp. 89–92.
ICPR-v3-2002-FitchKCK #performance #robust: Fast Exhaustive Robust Matching (AJF, AK, WJC, JK), pp. 903–906.
ICPR-v3-2002-GreenspanGG #category theory #generative #image #modelling #probability: Probabilistic Models for Generating, Modelling and Matching Image Categories (HG, SG, JG), pp. 970–973.
ICPR-v3-2002-HatanoASMOOK #algorithm #difference #using #verification: A Fingerprint Verification Algorithm Using the Differential Matching Rate (TH, TA, SS, HM, SO, YO, HK), pp. 799–802.
ICPR-v3-2002-HuH #component #image: Spatial Color Component Matching of Images (JH, EH), pp. 948–951.
ICPR-v3-2002-KimCK #automation #clustering #using: Automatic Text Location Using Cluster-Based Template Matching (EYK, JSC, HJK), pp. 423–426.
ICPR-v3-2002-LaganiereV: Wedge-Based Corner Model for Widely Separated Views Matching (RL, ÉV), pp. 672–675.
ICPR-v3-2002-LeeCK #algorithm #robust #using: A Robust Fingerprint Matching Algorithm Using Local Alignment (DL, KC, JK), pp. 803–806.
ICPR-v3-2002-MeshoulB #estimation: Ant Colony System with Extremal Dynamics for Point Matching and Pose Estimation (SM, MB), pp. 823–826.
ICPR-v3-2002-NicolescuM #segmentation: 4-D Voting for Matching, Densification and Segmentation into Motion Layers (MN, GGM), pp. 303–308.
ICPR-v3-2002-ShihL #interface #visual notation: A Bi-Directional Visual Stereo Interface for Accessing Stereo Matching Results from a Human Brain (SWS, THL), pp. 1039–1042.
ICPR-v3-2002-ZotkinDDMR #parametricity #using #visual notation: Virtual Audio System Customization Using Visual Matching of Ear Parameters (DNZ, RD, LSD, AM, VCR), pp. 1003–1006.
ICPR-v4-2002-HlaouiW #algorithm #graph: A New Algorithm for Inexact Graph Matching (AH, SW), pp. 180–183.
ICPR-v4-2002-MendelsVT #invariant #recognition #representation #using: Rotation and Scale Invariant Shape Representation and Recognition Using Matching Pursuit (FM, PV, JPT), pp. 326–329.
ICPR-v4-2002-MollinedaVC #approach #approximate #string: A Windowed Weighted Approach for Approximate Cyclic String Matching (RAM, EV, FC), pp. 188–191.
ICPR-v4-2002-Robles-KellyH02a #approach: A Graph-Spectral Approach to Correspondence Matching (ARK, ERH), pp. 176–179.
KDD-2002-CohenR #clustering #integration #learning #scalability #set: Learning to match and cluster large high-dimensional data sets for data integration (WWC, JR), pp. 475–480.
SAC-2002-OgstonV #fuzzy: Unstructured agent matchmaking: experiments in timing and fuzzy matching (EO, SV), pp. 300–305.
RTA-2002-DoughertyW #decidability #higher-order: A Decidable Variant of Higher Order Matching (DJD, TW), pp. 340–351.
RTA-2002-Forest #calculus #pattern matching: A Weak Calculus with Explicit Operators for Pattern Matching and Substitution (JF), pp. 174–191.
SAT-2002-Szeider: Generalizations of matched CNF formulas (SS), p. 7.
DAC-2001-ZhaoS #algorithm #pattern matching: A New Structural Pattern Matching Algorithm for Technology Mapping (MZ, SSS), pp. 371–376.
DATE-2001-MartinSZBM #component #design: Component selection and matching for IP-based design (GM, RS, TZ, LB, GDM), pp. 40–46.
ICDAR-2001-KobayashiNMSA #flexibility #learning #recognition #statistics #using: Handwritten Numeral Recognition Using Flexible Matching Based on Learning of Stroke Statistics (TK, KN, HM, TS, KA), pp. 612–616.
ICDAR-2001-LuTHF #approach #distance #image #word: An Approach to Word Image Matching Based on Weighted Hausforff Distance (YL, CLT, WH, LF), pp. 921–925.
ICDAR-2001-Takasu #approximate #documentation #performance #string: Document Filtering for Fast Approximate String Matching of Errorneous Text (AT), pp. 916–920.
ICDAR-2001-ValvenyM #learning #using: Learning of Structural Descriptions of Graphic Symbols Using Deformable Template Matching (EV, EM), pp. 455–459.
ICDAR-2001-WangCFZ #normalisation #recognition #set: Match Between Normalization Schemes and Feature Sets for Handwritten Chinese Character Recognition (QW, ZC, DDF, RZ), pp. 551–555.
ICDAR-2001-YeBG #documentation #image: Document Image Matching and Annotation Lifting (MY, MWB, DG), p. 753–?.
VLDB-2001-MadhavanBR: Generic Schema Matching with Cupid (JM, PAB, ER), pp. 49–58.
ICSM-2001-SartipiK #approach #architecture #graph #pattern matching: A Graph Pattern Matching Approach to Software Architecture Recovery (KS, KK), p. 408–?.
CIAA-2001-NedjahM #adaptation #automaton #pattern matching #performance #term rewriting: Minimal Adaptive Pattern-Matching Automata for Efficient Term Rewriting (NN, LdMM), pp. 221–233.
ICALP-2001-CormodeMS #editing #permutation: Permutation Editing and Matching via Embeddings (GC, SM, SCS), pp. 481–492.
ICFP-2001-FessantM #optimisation #pattern matching: Optimizing Pattern Matching (FLF, LM), pp. 26–37.
CIKM-2001-Collins-ThompsonSD #string: Improved String Matching Under Noisy Channel Conditions (KCT, CS, STD), pp. 357–364.
CIKM-2001-ParkKCP #approach #database #effectiveness #named #sequence: Prefix-Querying: An Approach for Effective Subsequence Matching Under Time Warping in Sequence Databases (SP, SWK, JSC, SP), pp. 255–262.
CIKM-2001-PollyW #feature model #pattern matching #performance #robust: Efficient and Robust Feature Extraction and Pattern Matching of Time Series by a Lattice Structure (WPMP, MHW), pp. 271–278.
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.
POPL-2001-HosoyaP #pattern matching #regular expression #xml: Regular expression pattern matching for XML (HH, BCP), pp. 67–80.
RE-2001-RollandP #enterprise #requirements: Matching ERP System Functionality to Customer Requirements (CR, NP), pp. 66–75.
LDTA-2001-MoreauRV #compilation #pattern matching: Pattern-Matching Compiler (PEM, CR, MV), pp. 161–180.
RTA-2001-CirsteaKL: Matching Power (HC, CK, LL), pp. 77–92.
RTA-2001-Ringeissen #question: Matching with Free Function Symbols — A Simple Extension of Matching? (CR), pp. 276–290.
DAC-2000-Sheehan #predict: Predicting coupled noise in RC circuits by matching 1, 2, and 3 moments (BNS), pp. 532–535.
DATE-2000-PaulusKT #constraints #optimisation: Area Optimization of Analog Circuits Considering Matching Constraints (CP, UK, RT), p. 738.
DATE-2000-WeilerMHH #detection #using: Detection of Defective Sensor Elements Using Sigma-Delta-Modulation and a Matched Filter (DW, OM, DH, BJH), pp. 599–603.
HT-2000-ChiuFGB #automation #documentation #image #multi: Automatically linking multimedia meeting documents by image matching (PC, JF, AG, JSB), pp. 244–245.
WCRE-J-1997-QuiliciWZ00 #approach #constraints: Program plan matching: experiments with a constraint-based approach (AQ, SW, YZ), pp. 285–302.
IWPC-2000-SartipiKM #architecture #framework #pattern matching: A Pattern Matching Framework for Software Architecture Recovery and Restructuring (KS, KK, FM), pp. 37–47.
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.
STOC-2000-MahajanV #graph: A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract) (MM, KRV), pp. 351–357.
CHI-2000-EspinosaCRKSL #tool support #why: Coming to the wrong decision quickly: why awareness tools must be matched with appropriate tasks (JAE, JJC, LRG, REK, WLS, GL), pp. 392–399.
ICEIS-2000-MooreICMS #adaptation #what #workflow: Who Does What? Matching Agents to Tasks in Adaptive Workflow (JPM, RI, PWHC, AM, JS), pp. 181–185.
CIKM-2000-LohKW #approach #database #normalisation #sequence: Index Interpolation: An Approach to Subsequence Matching Supporting Normalization Transform in Time-Series Databases (WKL, SWK, KYW), pp. 480–487.
ICPR-v1-2000-AmbrosioG: Extracting and Matching Perceptual Groups for Hierarchical Stereo Vision (GA, JG), pp. 1542–1545.
ICPR-v1-2000-ChabbiP #image: A Generic Relaxation Technique for Hierarchic Stereo Chain Matching of Uncalibrated Images (HC, SP), pp. 1746–1749.
ICPR-v1-2000-DionLB #2d #3d #image #sequence: 3D Triangular Mesh Matching through a Sequence of Registered 2D and 3D Images (DDJ, DL, LB), pp. 1977–1980.
ICPR-v1-2000-HuangH #using: Road Sign Interpretation Using Matching Pursuit Method (CLH, SHH), pp. 1329–1334.
ICPR-v1-2000-Jahn #parallel: Parallel Epipolar Stereo Matching (HJ), pp. 1402–1405.
ICPR-v1-2000-LhuillierQ #constraints #geometry #robust #using: Robust Dense Matching Using Local and Global Geometric Constraints (ML, LQ), pp. 1968–1972.
ICPR-v1-2000-LiuB #using: Uncalibrated Stereo Matching Using DWT (HL, PB), pp. 1114–1118.
ICPR-v1-2000-LourakisTAO #3d #constraints #geometry #using: Using Geometric Constraints for Matching Disparate Stereo Views of 3D Scenes Containing Planes (MIAL, SVT, AAA, SCO), pp. 1419–1422.
ICPR-v1-2000-Pilu #invariant #optimisation #random: Optimizing Random Patterns for Invariants-based Matching (MP), pp. 1716–1719.
ICPR-v1-2000-PrabhakarJWPB #classification #verification: Minutia Verification and Classification for Fingerprint Matching (SP, AKJ, JW, SP, RMB), pp. 1025–1029.
ICPR-v1-2000-SebeL: Maximum Likelihood Stereo Matching (NS, MSL), pp. 1900–1903.
ICPR-v1-2000-SomeyaKHI #3d #locality #segmentation #using: Localization of Objects in Electric Distribution Systems by Using Segmentation and 3D Template Matching with M-Estimators (YS, KK, KH, KI), pp. 1725–1729.
ICPR-v1-2000-XueLT #invariant #performance #using: Efficient Object Matching Using Affine-Invariant Deformable Contour (ZX, SZL, EKT), pp. 1672–1675.
ICPR-v1-2000-YouB #data mining #mining #retrieval: Dynamic Shape Retrieval by Hierarchical Curve Matching, Snakes and Data Mining (JY, PB), pp. 5035–5038.
ICPR-v2-2000-Bunke #graph: Recent Developments in Graph Matching (HB), pp. 2117–2124.
ICPR-v2-2000-CarcassoniH #matrix #proximity: An Improved Point Proximity Matrix for Modal Matching (MC, ERH), pp. 2034–2037.
ICPR-v2-2000-CordellaFSV #component #detection #graph #image #performance: Fast Graph Matching for Detecting CAD Image Components (LPC, PF, CS, MV), pp. 6034–6037.
ICPR-v2-2000-JiangY: Fingerprint Minutiae Matching Based on the Local and Global Structures (XJ, WYY), pp. 6038–6041.
ICPR-v2-2000-KimHL #retrieval: Retrieval of the Top N Matches with Support Vector Machines (JJK, BWH, SWL), pp. 2716–2719.
ICPR-v2-2000-LaoKST #3d #invariant #recognition #using: 3D Template Matching for Pose Invariant Face Recognition Using 3D Facial Model Built with Isoluminance Line Based Stereo Vision (SL, MK, YS, FT), pp. 2911–2916.
ICPR-v2-2000-LiLT #analysis #cumulative #image: Image Analysis by Accumulative Hopfield Matching (WJL, TL, HTT), pp. 2442–2445.
ICPR-v2-2000-LuoH #algorithm #composition #graph #using: Symbolic Graph Matching Using the EM Algorithm and Singular Value Decomposition (BL, ERH), pp. 2141–2144.
ICPR-v2-2000-OlivieriV #image #prototype #similarity: Image Prototype Similarity Matching for Lymph Node Hemopathology (DNO, FV), pp. 2279–2282.
ICPR-v2-2000-SerratosaAS #algorithm #graph #performance: Efficient Algorithms for Matching Attributed Graphs and Function-Described Graphs (FS, RA, AS), pp. 2867–2872.
ICPR-v2-2000-ValvenyM #documentation #framework #recognition #using: Hand-Drawn Symbol Recognition in Graphic Documents Using Deformable Template Matching and a Bayesian Framework (EV, EM), pp. 2239–2242.
ICPR-v3-2000-Gros #image #modelling: Color Illumination Models for Image Matching and Indexing (PG), pp. 3580–3583.
ICPR-v3-2000-GuaragnellaS #algorithm #estimation #object-oriented: Object Oriented Motion Estimation by Sliced-Block Matching Algorithm (CG, EDS), pp. 3865–3868.
ICPR-v3-2000-HufnaglU #classification #fault #performance: Resolving a Defect in Quadrant-Based Classification for Fast Block-Matching (CH, AU), pp. 3203–3206.
ICPR-v3-2000-HuotYHC #evolution: A General Surface Matching Model: Application to Ground Evolution Tracking (EGH, HMY, IH, IC), pp. 3167–3170.
ICPR-v4-2000-Ayala-RamirezPD: Active Tracking Based on Hausdorff Matching (VAR, CP, MD), pp. 4706–4709.
ICPR-v4-2000-FrantiMK #image #invariant: Hough Transform for Rotation Invariant Matching of Line-Drawing Images (PF, AM, HK), pp. 4389–4392.
ICPR-v4-2000-HuM #composition #image: Optimal Color Composition Matching of Images (JH, AM), pp. 4047–4050.
ICPR-v4-2000-LuoTW #algorithm #verification: A Minutia Matching Algorithm in Fingerprint Verification (XL, JT, YW), pp. 4833–4836.
ICPR-v4-2000-ShimadaOI #image #metric #video: Human Body Posture Measurement by Matching Foot Pressure Distribution to Video Images (SS, SO, KI), pp. 4188–4191.
KDD-2000-GeS #markov #pattern matching: Deformable Markov model templates for time-series pattern matching (XG, PS), pp. 81–90.
KDD-2000-McCallumNU #clustering #performance #set: Efficient clustering of high-dimensional data sets with application to reference matching (AM, KN, LHU), pp. 169–178.
KR-2000-BaaderK #concept #strict: Matching Concept Descriptions with Existential Restrictions (FB, RK), pp. 261–272.
TOOLS-PACIFIC-2000-ColnetL #eiffel: Match-O, A Dialect of Eiffel with Match-Types (DC, LL), pp. 190–201.
SAC-2000-ByunL #classification #using: Form Classification Using DP Matching (YB, YL), pp. 1–4.
HPDC-2000-NolteH #biology #case study #distributed #parallel #research #sorting: Parallel Matching and Sorting with TACO’s Distributed Collections — A Case Study from Molecular Biology Research (JN, PH), pp. 247–252.
LICS-2000-LemstromH #approximate #logic #pattern matching #transitive: Approximate Pattern Matching is Expressible in Transitive Closure Logic (KL, LH), pp. 157–167.
LICS-2000-PalsbergZ #flexibility #performance #recursion: Efficient and Flexible Matching of Recursive Types (JP, TZ), pp. 388–398.
RTA-2000-Groote #higher-order #linear: Linear Higher-Order Matching Is NP-Complete (PdG), pp. 127–140.
ASE-1999-WatersRA #architecture #concept analysis #using: Architectural Element Matching Using Concept Analysis (RW, SR, GDA), pp. 291–294.
DAC-1999-ChenM #using: Noise-Aware Repeater Insertion and Wire-Sizing for On-Chip Interconnect Using Hierarchical Moment-Matching (CPC, NM), pp. 502–506.
HT-1999-RutledgeHOB #hypermedia: Mix’n’match: Exchangeable Modules of Hypermedia Style (LR, LH, JvO, DCAB), pp. 179–188.
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-ChenMM #algorithm #graph #performance #segmentation: An Efficient Algorithm for Matching a Lexicon with a Segmentation Graph (DYC, JM, KMM), pp. 543–546.
ICDAR-1999-KimKL #recognition: Stroke-guided Pixel Matching for Handwritten Chinese Character Recognition (IJK, JHK, CLL), pp. 665–668.
ICDAR-1999-NagasakiYN #automation #difference #pattern matching #recognition #using: Relaxation-based Pattern Matching using Automatic Differentiation for Off-line Character Recognition (TN, TY, MN), pp. 229–232.
ICDAR-1999-OgataUMSF #recognition: A Method for Street Number Matching in Japanese Address Recognition (HO, YU, KM, HS, HF), pp. 321–324.
ICDAR-1999-TakatsukaCWV #distributed #representation: Symbolic Representation and Distributed Matching Strategies for Schematics (MT, TC, GAWW, SV), pp. 693–696.
ICDAR-1999-ValvenyM #architecture #recognition: Application of Deformable Template Matching to Symbol Recognition in Hand-written Architectural Drawings (EV, EM), pp. 483–486.
PODS-1999-BoassonCGM #linear #problem #sequence: Window-Accumulated Subsequence Matching Problem is Linear (LB, PC, IG, YM), pp. 327–336.
FoSSaCS-1999-Muscholl #sequence chart #specification: Matching Specifications for Message Sequence Charts (AM), pp. 273–287.
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-GabowKT #algorithm: Unique Maximum Matching Algorithms (HNG, HK, RET), pp. 70–78.
FLOPS-1999-MoorS #higher-order #program transformation: Higher Order Matching for Program Transformation (OdM, GS), pp. 209–224.
DLT-1999-Bruggemann-KleinW #automaton #pattern matching: Caterpillars, context, tree automata and tree pattern matching (ABK, DW), pp. 270–285.
ACIR-1999-KosterDEP #normalisation: Normalization and Matching in the DORO System (CHAK, CD, DvdE, JP).
CIKM-1999-KimSC #database #image #ranking #representation: Spatial Match Representation Scheme Supporting Ranking in Iconic Images Databases (YJK, CBS, JWC), pp. 450–457.
CIKM-1999-LeeC #query #semantics #web: Semantic Caching via Query Matching for Web Sources (DL, WWC), pp. 77–85.
GCSE-1999-ForaxR #java #pattern matching #recursion: Recursive Types and Pattern-Matching in Java (RF, GR), pp. 147–164.
SAC-1999-Taylor #finite #induction #pattern matching #using: Exon/Intron Discrimination Using the Finite Induction Pattern Matching Technique (PAT), pp. 41–45.
ICSE-1999-GannodC #approach #reverse engineering #specification: A Specification Matching Based Approach to Reverse Engineering (GCG, BHCC), pp. 389–398.
CADE-1999-Wierzbicki #complexity #higher-order: Complexity of the higher order matching (TW), pp. 82–96.
LICS-1999-CerritoaK #pattern matching: Pattern Matching as Cut Elimination (SC, DK), pp. 98–108.
RTA-1999-Visser #pattern matching: Strategic Pattern Matching (EV), pp. 30–44.
DAC-1998-HinsbergerK #library #scalability: Boolean Matching for Large Libraries (UH, RK), pp. 206–211.
VLDB-1998-MiloZ #semistructured data #using: Using Schema Matching to Simplify Heterogeneous Data Translation (TM, SZ), pp. 122–133.
STOC-1998-KargerL #graph: Finding Maximum Flows in Undirected Graphs Seems Easier than Bipartite Matching (DRK, MSL), pp. 69–78.
WIA-1998-HolubM #approximate #automaton #finite #implementation #nondeterminism #pattern matching: Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching (JH, BM), pp. 92–99.
TAGT-1998-HabelMP #approach #injection: Double-Pushout Approach with Injective Matching (AH, JM, DP), pp. 103–116.
TAGT-1998-Rudolf #constraints #graph #pattern matching #performance: Utilizing Constraint Satisfaction Techniques for Efficient Graph Pattern Matching (MR), pp. 238–251.
AdaEurope-1998-ArabanS #library #object-oriented: A Two-Level Matching Mechanism for Object-Oriented Class Libraries (SA, ASMS), pp. 188–200.
EDOC-1998-HoffnerS #contract: Co-operation, contracts, contractual match-making and binding (YH, AS), pp. 75–86.
CIKM-1998-DumasFS #pattern matching #query: Handling Temporal Grouping and Pattern-Matching Queries in a Temporal Object Model (MD, MCF, PCS), pp. 424–431.
ICPR-1998-Bhat #image: An evolutionary measure for image matching (DNB), pp. 850–852.
ICPR-1998-ChanY #online #recognition: Elastic structural matching for online handwritten alphanumeric character recognition (KFC, DYY), pp. 1508–1511.
ICPR-1998-CordellaFSTV #algorithm #evaluation #graph #performance: Graph matching: a fast algorithm and its evaluation (LPC, PF, CS, FT, MV), pp. 1582–1584.
ICPR-1998-Etoh #estimation #parametricity #representation: Promotion of block matching: parametric representation for motion estimation (ME), pp. 282–285.
ICPR-1998-FerriMAS #algorithm #estimation #using: Variable-size block matching algorithm for motion estimation using a perceptual-based splitting criterion (FJF, JM, JVA, JS), pp. 286–288.
ICPR-1998-Gavrila #distance #multi #using: Multi-feature hierarchical template matching using distance transforms (DMG), pp. 439–444.
ICPR-1998-KimPJK #online #recognition: Substroke matching by segmenting and merging for online Korean cursive character recognition (CSK, KRP, BHJ, JK), pp. 1110–1113.
ICPR-1998-LiQ #image #retrieval #using: Matching spatial relations using DB-tree for image retrieval (XL, XQ), pp. 1230–1234.
ICPR-1998-LuKB #3d #image #re-engineering #segmentation: Image segmentation and image matching for 3D terrain reconstruction (YL, KK, MB), pp. 1535–1537.
ICPR-1998-MadhavanDD #locality #pattern matching #statistics: Map-building and map-based localization in an underground-mine by statistical pattern matching (RM, GD, HDW), pp. 1744–1746.
ICPR-1998-Maeder #image: Lossy compression effects on digital image matching (AJM), pp. 1626–1629.
ICPR-1998-MagareyD #image #multi #using: Multiresolution stereo image matching using complex wavelets (JM, ARD), pp. 4–7.
ICPR-1998-MoghaddamJP #ml #performance #recognition #similarity #visual notation: Efficient MAP/ML similarity matching for visual recognition (BM, TJ, AP), pp. 876–881.
ICPR-1998-MyersWH #distance #edit distance #performance #relational: Efficient relational matching with local edit distance (RM, RCW, ERH), pp. 1711–1714.
ICPR-1998-PailloncyKJ: Object matching on irregular pyramid (JGP, WGK, JMJ), pp. 1721–1723.
ICPR-1998-Pelillo #framework #relational: A unifying framework for relational structure matching (MP), pp. 1316–1319.
ICPR-1998-PramadihantoIY #automation #detection #flexibility: A flexible feature matching for automatic face and facial feature points detection (DP, YI, MY), pp. 92–95.
ICPR-1998-RathaB #image: Effect of controlled image acquisition on fingerprint matching (NKR, RMB), pp. 1659–1661.
ICPR-1998-SchererAP #adaptation #constraints #integration #robust: Robust adaptive window matching by homogeneity constraint and integration of descriptions (SS, WA, AP), pp. 777–779.
ICPR-1998-SchutzJH #3d #algorithm #for free #multi: Multi-feature matching algorithm for free-form 3D surface registration (CS, TJ, HH), pp. 982–984.
ICPR-1998-SebeLH #image #metric #ranking #retrieval: Which ranking metric is optimal? With applications in image retrieval and stereo matching (NS, MSL, DPH), pp. 265–271.
ICPR-1998-SinghS #pattern matching: A pattern matching tool for time-series forecasting (SS, ES), pp. 103–105.
ICPR-1998-SofferS #similarity #using: Using negative shape features for logo similarity matching (AS, HS), pp. 571–573.
ICPR-1998-VesWH #algorithm: Matching blood vessel patterns with the generalised EM algorithm (EdV, RCW, ERH), pp. 364–367.
ICPR-1998-WilliamsB #approach #image: A non-linear filtering approach to image matching (JAW, MB), pp. 1–3.
ICPR-1998-Yamada #pattern matching #query #retrieval #using: Handwritten text retrieval using two-stage pattern matching with handwritten query (KY), pp. 621–625.
ICPR-1998-YamaguchiKI #graph #parametricity #relational #using: Stereo matching for stone statues using SRI parameters and relational graph (AY, KK, SI), pp. 785–787.
ICPR-1998-YouBH #image #parallel #realtime #recognition #virtual machine: Real-time object recognition: hierarchical image matching in a parallel virtual machine environment (JY, PB, SH), pp. 275–277.
LICS-1998-BorealeS #bisimulation #calculus: Bisimulation in Name-Passing Calculi without Matching (MB, DS), pp. 165–175.
RTA-1998-GuoNS #algebra #process #unification: Unification and Matching in Process Algebras (QG, PN, SKS), pp. 91–105.
ICDAR-1997-BohnackerSY #heuristic: Matching form lines based on a heuristic search (UB, JS, TY), p. 86–?.
ICDAR-1997-Favata #approximate #recognition #string #using #word: General word recognition using approximate segment-string matching (JTF), pp. 92–96.
ICDAR-1997-LiuKK #recognition: High Accuracy Handwritten Chinese Character Recognition by Improved Feature Matching Method (CLL, IJK, JHK), pp. 1033–1037.
ICDAR-1997-SudaBKM #approach #using #word: Logo and Word Matching Using a General Approach to Signal Registration (PS, CB, BK, GM), p. 61–?.
ICDAR-1997-Takasu #approximate #string: An Approximate String Match for Garbled Text with Various Accuracy (AT), pp. 957–961.
ICDAR-1997-ZhengDW #online: Recognizing on-line handwritten Chinese character via FARG matching (JZ, XD, YW), pp. 621–624.
SIGMOD-1997-WangSCRZP #database #documentation: Structural Matching and Discovery in Document Databases (JTLW, DS, GJSC, LR, KZ, GP), pp. 560–563.
WCRE-1997-QuiliciWZ #approach #constraints: New Experiments with a Constraint-Based Approach to Program Plan Matching (AQ, SW, YZ), pp. 114–123.
STOC-1997-ColeH #pattern matching #random #set: Tree Pattern Matching and Subset Matching in Randomized O(n log3m) Time (RC, RH), pp. 66–75.
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.
FME-1997-HemerL #design #pattern matching #reuse: Reuse of Verified Design Templates Through Extended Pattern Matching (DH, PAL), pp. 495–514.
CIKM-1997-BozkayaYO #sequence: Matching and Indexing Sequences of Different Lengths (TB, NY, ZMÖ), pp. 128–135.
CIKM-1997-ChangKC #database #image #query #representation: A Spatial Match Representation Scheme for Indexing and Querying in Iconic Image Databases (JWC, YJK, KJC), pp. 169–176.
CIKM-1997-FrenchPS #approximate #information retrieval #word: Applications of Approximate Word Matching in Information Retrieval (JCF, ALP, ES), pp. 9–15.
CIKM-1997-LeeC: Reducing Match Time Variance in Production Systems with HAL (PyL, AMKC), pp. 309–316.
KDD-1997-KeoghS #approach #database #pattern matching #performance #probability: A Probabilistic Approach to Fast Pattern Matching in Time Series Databases (EJK, PS), pp. 24–30.
KDD-1997-StoughB #image #multi #reduction: Image Feature Reduction through Spoiling: Its Application to Multiple Matched Filters for Focus of Attention (TMS, CEB), pp. 255–258.
ECOOP-1997-BrucePF #object-oriented #type system: Subtyping Is Not a Good “Match” for Object-Oriented Languages (KBB, LP, AF), pp. 104–127.
ALP-1997-NedjahWE #automaton #pattern matching: Optimal Left-to-Right Pattern-Matching Automata (NN, CDW, SEE), pp. 273–286.
CADE-1997-DefourneauxP #proving: Partial Matching for Analogy Discovery in Proofs and Counter-Examples (GD, NP), pp. 431–445.
CADE-1997-Iwanuma #proving #theorem proving #top-down: Lemma Matching for a PTTP-based Top-down Theorem Prover (KI), pp. 146–160.
CSL-1997-ComonJ #automaton #higher-order: Higher-Order Matching and Tree Automata (HC, YJ), pp. 157–176.
TLCA-1997-BonoB #constraints #λ-calculus: Matching Constraints for the λ Calculus of Objects (VB, MB), pp. 46–62.
RWLW-1996-Eker #equation #performance: Fast matching in combinations of regular equational theories (SE), pp. 90–109.
WPC-1996-GriswoldAM #flexibility #pattern matching #performance: Fast, Flexible Syntactic Pattern Matching and Processing (WGG, DCA, CM), pp. 144–153.
ICFP-1996-GostanzaPN #data type #pattern matching: A New Look to Pattern Matching in Abstract Data Types (PPG, RP, MN), pp. 110–121.
ICPR-1996-AzencottCY #distance #recognition: A distance for elastic matching in object recognition (RA, FC, LY), pp. 687–691.
ICPR-1996-BellaireS #3d #recognition: 3-D object recognition by matching the total view information (GB, KS), pp. 534–538.
ICPR-1996-BrunnstromS #algorithm #for free #search-based: Genetic algorithms for free-form surface matching (KB, AJS), pp. 689–693.
ICPR-1996-ChouFF #online #recognition: Radical-based neighboring segment matching method for on-line Chinese character recognition (KSC, KCF, TIF), pp. 84–88.
ICPR-1996-CordellaFSV #algorithm #graph #performance #using: An efficient algorithm for the inexact matching of ARG graphs using a contextual transformational model (LPC, PF, CS, MV), pp. 180–184.
ICPR-1996-FinchWH #relational: Relational matching with mean field annealing (AMF, RCW, ERH), pp. 359–363.
ICPR-1996-Floreby #algorithm #image #multi #sequence: A multiscale algorithm for closed contour matching in image sequence (LF), pp. 884–888.
ICPR-1996-GeversS #image #invariant #retrieval: Color-metric pattern-card matching for viewpoint invariant image retrieval (TG, AWMS), pp. 3–7.
ICPR-1996-HoriuchiYY #nondeterminism #robust: Robust relaxation method for structural matching under uncertainty (TH, KY, HY), pp. 176–180.
ICPR-1996-HoY #approach #programming: A dynamic programming approach for stereo line matching with structural information (WPH, RKKY), pp. 791–794.
ICPR-1996-KoschanRS #using: Color stereo vision using hierarchical block matching and active color illumination (AK, VR, KS), pp. 835–839.
ICPR-1996-LaiNC #synthesis: Tracking of deformable contours by synthesis and match (KFL, CWN, SC), pp. 657–661.
ICPR-1996-LaumyDL #approach #comparison #optimisation: Segments matching: comparison between a neural approach and a classical optimization way (ML, MD, JTL), pp. 261–265.
ICPR-1996-LinT #algorithm #performance #video: Fast full-search block-matching algorithm for motion-compensated video compression (YCL, SCT), pp. 914–918.
ICPR-1996-LiuCC #graph #online #order #recognition #relational #using: Stroke order and stroke number free on-line Chinese character recognition using attributed relational graph matching (JL, WkC, MMYC), pp. 259–263.
ICPR-1996-LladosLM #comprehension #documentation #graph #using: Hand drawn document understanding using the straight line Hough transform and graph matching (JL, JLK, EM), pp. 497–501.
ICPR-1996-Melichar #automaton #difference #finite #string: String matching with k differences by finite automata (BM), pp. 256–260.
ICPR-1996-ModayurS #3d #statistics #using: 3D matching using statistically significant groupings (BRM, LGS), pp. 238–242.
ICPR-1996-MoghaddamNP #image #similarity: A Bayesian similarity measure for direct image matching (BM, CN, AP), pp. 350–358.
ICPR-1996-NomuraZSF #3d #data fusion #estimation #image: 3-D object pose estimation based on iterative image matching: Shading and edge data fusion (YN, DZ, YS, SF), pp. 513–517.
ICPR-1996-RoblesE #evaluation: The importance of feature visibility for the evaluation of a matching hypothesis (LAR, WE), pp. 585–589.
ICPR-1996-SatoC #invariant: Affine integral invariants and matching of curves (JS, RC), pp. 915–919.
ICPR-1996-StevensB #3d #multi #predict #recognition: Interleaving 3D model feature prediction and matching to support multi-sensor object recognition (MRS, JRB), pp. 607–611.
ICPR-1996-SuL #geometry #recognition: Face recognition by feature orientation and feature geometry matching (CLS, CL), pp. 401–405.
ICPR-1996-TakasuKYIOA #approximate: Approximate matching for OCR-processed bibliographic data (AT, NK, MY, OI, KO, JA), pp. 175–179.
ICPR-1996-TeixeiraA #algorithm #video: Block matching algorithms in MPEG video coding (LMLT, APA), pp. 934–938.
ICPR-1996-TorkarP #feature model #image: Feature extraction from aerial images and structural stereo matching (DT, NP), pp. 880–884.
ICPR-1996-UmekiM #multi #recognition: Dynamic link matching for multiple object recognition (HU, HM), pp. 65–69.
ICPR-1996-WangA: Stereo matching by integrating piecewise surfaces matched in subranges of depth (CW, KA), pp. 423–427.
ICPR-1996-WangRNBJ: A generalized expansion matching based feature extractor (ZW, KRR, DN, JBA, NJ), pp. 29–33.
ICPR-1996-WilsonCH #analysis: Sensitivity analysis for structural matching (RCW, ADJC, ERH), pp. 62–66.
ICPR-1996-WunschH #image: Registration of CAD-models to images by iterative inverse perspective matching (PW, GH), pp. 78–83.
ICPR-1996-YamadaT #sequence: Elastic edge sequence matching method for global extraction and local tracking of echocardiogram (HY, KT), pp. 637–641.
ICPR-1996-YangT #geometry #locality #mobile #modelling: Mobile robot localization by geometric hashing and model-based scene matching (YBY, HTT), pp. 181–185.
ICPR-1996-ZhaNN #3d #algorithm #image #modelling #recognition #using: 3-D object recognition from range images by using a model-based Hopfield-style matching algorithm (HZ, HN, TN), pp. 111–116.
KDD-1996-MongeE #algorithm #problem: The Field Matching Problem: Algorithms and Applications (AEM, CE), pp. 267–270.
SEKE-1996-ChangWCCWA #database #pattern matching #visualisation: A Visualization Tool for Pattern Matching and Discovery in Scientific Databases (GJSC, JTLW, GWC, CYC, WW, FA), pp. 563–570.
SIGIR-1996-ZobelD #information retrieval #lessons learnt #string: Phonetic String Matching: Lessons from Information Retrieval (JZ, PWD), pp. 166–172.
ECOOP-1996-GaweckiM #perspective #quantifier #type system: Integrating Subtyping, Matching and Type Quantification: A Practical Perspective (AG, FM), pp. 26–47.
CADE-1996-GuoNW #unification: Unification and Matching Modulo Nilpotence (QG, PN, DAW), pp. 261–274.
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.
RTA-1996-CurienQS #higher-order #performance: Efficient Second-Order Matching (RC, ZQ, HS), pp. 317–331.
DAC-1995-DeCastelo-Vide-e-SouzaPP #algorithm #approach #architecture #optimisation #throughput #using: Optimal ILP-Based Approach for Throughput Optimization Using Simultaneous Algorithm/Architecture Matching and Retiming (YGDVeS, MP, ACP), pp. 113–118.
DAC-1995-WangH: Boolean Matching for Incompletely Specified Functions (KHW, TH), pp. 48–53.
ICDAR-v1-1995-FarrowXO #comprehension #documentation: Model matching in intelligent document understanding (GSDF, CSX, JPO), pp. 293–296.
ICDAR-v1-1995-Ishitani #comprehension #graph #image: Model matching based on association graph for form image understanding (YI), pp. 287–292.
ICDAR-v1-1995-KimD #classification #distance #network #recognition #using: Off-line Recognition of Korean Scripts Using Distance Matching and Neural Network Classifiers (SHK, JID), pp. 34–37.
ICDAR-v1-1995-Ozaki #pattern matching #segmentation: Column segmentation by white space pattern matching (MO), pp. 134–137.
ICDAR-v2-1995-ChangCH #flexibility #recognition: Hierarchical flexible matching for recognition of Chinese characters (FC, YPC, YSH), pp. 824–827.
ICDAR-v2-1995-Hirayama #analysis #using: A method for table structure analysis using DP matching (YH), pp. 583–586.
ICDAR-v2-1995-PavlidisSS #analysis #graph: Matching graph embeddings for shape analysis (TP, WJS, HS), pp. 729–733.
SIGMOD-1995-WangZS #database #documentation #pattern matching: Pattern Matching and Pattern Discovery in Scientific, Program, and Document Databases (JTLW, KZ, DS), p. 487.
WCRE-1995-KontogiannisDBGM #concept #design #locality #pattern matching: Pattern Matching for Design Concept Localization (KK, RdM, MB, MG, EM).
STOC-1995-FarachT #string: String matching in Lempel-Ziv compressed strings (MF, MT), pp. 703–712.
DLT-1995-Hartmann #performance: Efficient Subgraph Matching Within Cellular Hypergraphs (PH), pp. 309–318.
FPCA-1995-Jeuring #pattern matching: Polytypic Pattern Matching (JJ), pp. 238–248.
SEKE-1995-WangCCCP #database #documentation #pattern matching #tool support: An Integrated Toolkit for Pattern Matching and Pattern Discovery in Scientific, Program, and Document databases (JTLW, GWC, CYC, GJSC, KP), p. 497.
ECOOP-1995-AbadiC #on the #type system: On Subtyping and Matching (MA, LC), pp. 145–167.
PLILP-1995-ButowGOT #semantics: A New Strategy for Semantic Matching (BB, RG, EO, ST), pp. 81–96.
SAC-1995-ChaabouniC #database #network #object-oriented: Discrimination network for rule condition matching in object-oriented database rule systems (MC, SMC), pp. 51–55.
FSE-1995-ZaremskiW #component #specification: Specification Matching of Software Components (AMZ, JMW), pp. 6–17.
ICSE-1995-BarghoutiK #constraints #monitoring #process #using: Using Event Contexts and Matching Constraints to Monitor Software Processes (NSB, BK), pp. 83–92.
TLCA-1995-Springintveld #higher-order: Third-Order Matching in the Presence of Type Constructors (JS), pp. 428–442.
DAC-1994-KrishnamoorthyM: Boolean Matching of Sequential Elements (SK, FM), pp. 691–697.
DAC-1994-PotkonjakSC #constant #multi #performance #using: Efficient Substitution of Multiple Constant Multiplications by Shifts and Additions Using Iterative Pairwise Matching (MP, MBS, AC), pp. 189–194.
DAC-1994-TsaiM #using: Boolean Matching Using Generalized Reed-Muller Forms (CCT, MMS), pp. 339–344.
EDAC-1994-LiemMP #code generation: Instruction-Set Matching and Selection for DSP and ASIP Code Generation (CL, TCM, PGP), pp. 31–37.
SIGMOD-1994-FaloutsosRM #database #performance #sequence: Fast Subsequence Matching in Time-Series Databases (CF, MR, YM), pp. 419–429.
ICSM-1994-Johnson #clone detection #detection #string: Substring Matching for Clone Detection and Change Tracking (JHJ), pp. 120–126.
STOC-1994-Kosaraju #pattern matching #realtime: Real-time pattern matching and quasi-real-time construction of suffix trees (preliminary version) (SRK), pp. 310–316.
ICALP-1994-AmirBF #2d: Optimal Two-Dimensional Compressed Matching (AA, GB, MF), pp. 215–226.
ICALP-1994-HariharanM #algorithm #parallel: Optimal Parallel Algorithms for Prefix Matching (RH, SM), pp. 203–214.
ICALP-1994-Sanchez-CousoF #analysis #pattern matching #probability: Average-Case Analysis of Pattern-Matching in Trees under the BST Probability Model (JRSC, MIFC), pp. 178–190.
TAGT-1994-PlumpH #graph #unification: Graph Unification and Matching (DP, AH), pp. 75–88.
TAGT-1994-Zundorf #graph #pattern matching: Graph Pattern Matching in PROGRES (AZ), pp. 454–468.
CIKM-1994-ChengG #database #pattern matching: A Pattern Matching Language for Spatio-Temporal Databases (TSC, SKG), pp. 288–295.
CIKM-1994-ChenT #implementation #pattern matching #programming: An Optimized Implementation for VML Based on Pattern Matching and Dynamic Programming (WC, VT), pp. 88–96.
SIGIR-1994-MoritaS #analysis #behaviour #information management #retrieval: Information Filtering Based on User Behaviour Analysis and Best Match Text Retrieval (MM, YS), pp. 272–281.
ICRE-1994-LiangP #approach #clustering #pattern matching #requirements: A pattern matching and clustering based approach for supporting requirements transformation (JL, JDP), pp. 180–183.
CADE-1994-HermannK #complexity #equation #problem: The Complexity of Counting Problems in Equational Matching (MH, PGK), pp. 560–574.
ILPS-1994-Marchiori #unification: Localizations of Unification Freedom through Matching Directions (MM), pp. 392–406.
ICDAR-1993-Bertille #approach #recognition: An elastic matching approach applied to digit recognition (JMB), pp. 82–83.
ICDAR-1993-Breul #bound #fault #recognition #using: Recognition of handprinted digits using optimal bounded error matching (TMB), pp. 493–496.
ICDAR-1993-ChangCDHK #segmentation: Stroke segmentation as a basis for structural matching of Chinese characters (FC, YCC, HSD, WLH, CIK), pp. 35–40.
ICDAR-1993-HoriuchiTYY #on the #recognition #using: On method of training dictionaries for handwritten character recognition using relaxation matching (TH, KT, KY, HY), pp. 638–641.
ICDAR-1993-WangHF #recognition: Optical recognition of handwritten Chinese characters by partial matching (ABW, JSH, KCF), pp. 822–823.
ICDAR-1993-YangHT #approximate #automation #identification #using: Automatic seal identification using fluency function approximation and relaxation matching method (YY, TH, KT), pp. 786–789.
STOC-1993-AlonCG #graph #permutation: Routing permutations on graphs via matchings (NA, FRKC, RLG), pp. 583–591.
STOC-1993-Baker #algorithm #formal method #pattern matching: A theory of parameterized pattern matching: algorithms and applications (BSB), pp. 71–80.
STOC-1993-ChariRS #problem: Randomness-optimal unique element isolation, with applications to perfect matching and related problems (SC, PR, AS), pp. 458–467.
STOC-1993-IduryS #multi: Multiple matching of rectangular patterns (RMI, AAS), pp. 81–90.
STOC-1993-JiangL #string: k one-way heads cannot do string-matching (TJ, ML), pp. 62–70.
STOC-1993-KenyonRS #graph: Matchings in lattice graphs (CK, DR, AS), pp. 738–746.
WSA-1993-Thiemann #pattern matching #testing: Avoiding Repeated Tests in Pattern Matching (PT), pp. 141–152.
ICALP-1993-GargVY #algorithm #approximate #multi #set: Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover (NG, VVV, MY), pp. 64–75.
CIKM-1993-AcharyaT: Collection Oriented Match (AA, MT), pp. 516–526.
RE-1993-RyanM #concept #graph #requirements: Matching conceptual graphs as an aid to requirements re-use (KR, BM), pp. 112–120.
FSE-1993-ZaremskiW #reuse: Signature Matching: A Key to Reuse (AMZ, JMW), pp. 182–190.
RTA-1993-Lippe #bottom-up #generative: Generating Tables for Bottom-Up Matching (EL), pp. 274–288.
DAC-1992-AnastasakisGKP #approximate #evaluation #on the: On the Stability of Moment-Matching Approximations in Asymptotic Waveform Evaluation (DFA, NG, SYK, LTP), pp. 207–212.
DAC-1992-ChiproutN #analysis #network: Generalized Moment-Matching Methods for Transient Analysis of Interconnect Networks (EC, MSN), pp. 201–206.
DAC-1992-SchlichtmannBH #agile: Characterization of Boolean Functions for Rapid Matching in FPGA Technology Mapping (US, FB, MH), pp. 374–379.
HT-ECHT-1992-Caloini #approach #hypermedia #modelling: Matching Hypertext Models to Hypertext Systems: A Compilative Approach (AC), pp. 91–101.
PODS-1992-GinsburgW #approach #pattern matching #query #towards: Pattern Matching by Rs-Operations: Toward a Unified Approach to Querying Sequenced Data (SG, XSW), pp. 293–300.
STOC-1992-AmirBF #2d #independence: Alphabet Independent Two Dimensional Matching (AA, GB, MF), pp. 59–68.
STOC-1992-Galil #algorithm #parallel #string: A Constant-Time Optimal Parallel String-Matching Algorithm (ZG), pp. 69–76.
WSA-1992-QueinnecG #backtracking #partial evaluation #pattern matching: Partial Evaluation applied to Symbolic Pattern Matching with Intelligent Backtrack (CQ, PG), pp. 109–117.
ICALP-1992-SekarRR #adaptation #pattern matching: Adaptive Pattern Matching (RCS, RR, IVR), pp. 247–260.
LFP-1992-Maranget #compilation #lazy evaluation #pattern matching: Compiling Lazy Pattern Matching (LM), pp. 21–31.
CAiSE-1992-SutcliffeM #component #reuse: Supporting Component Matching for Software Reuse (AGS, NAMM), pp. 290–303.
TOOLS-PACIFIC-1992-OgataKID #named #smalltalk: HoME: Smalltalk on the Match Environment (KO, SK, MI, ND), pp. 153–161.
CC-1992-Grosch #pattern matching #using: Transformation of Attributed Trees Using Pattern Matching (JG), pp. 1–15.
CC-1992-Pettersson #automaton #compilation #finite: A Term Pattern-Match Compiler Inspired by Finite Automata Theory (MP), pp. 258–270.
CADE-1992-BasinW #difference: Difference Matching (DAB, TW), pp. 295–309.
CADE-1992-DershowitzMS #convergence #decidability: Decidable Matching for Convergent Systems (Preliminary Version) (ND, SM, GS), pp. 589–602.
LICS-1992-Dowek #decidability #higher-order: Third Order Matching is Decidable (GD), pp. 2–10.
DAC-1991-CrastesSS: A Technology Mapping Method Based On Perfect And Semi-Perfect Matchings (MC, KS, GS), pp. 93–98.
KBSE-1991-MaidenS #reuse #specification: Analogical Matching for Specification Reuse (NAMM, AGS), pp. 108–116.
PEPM-1991-Smith #constraints #logic programming #partial evaluation #pattern matching #programming language: Partial Evaluation of Pattern Matching in Constraint Logic Programming Languages (DAS), pp. 62–71.
STOC-1991-BreslauerG #bound #parallel #string: A Lower Bound for Parallel String Matching (DB, ZG), pp. 439–443.
ICALP-1991-KhullerMV #algorithm #online: On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages (SK, SGM, VVV), pp. 728–738.
ICALP-1991-Naor #preprocessor #string: String Matching with Preprocessing of Text and Pattern (MN), pp. 739–750.
RTA-1991-Graf #pattern matching: Left-to-Right Tree Pattern Matching (AG), pp. 323–334.
DAC-1990-HuangCLH: Data Path Allocation Based on Bipartite Weighted Matching (CYH, YSC, YLL, YCH), pp. 499–504.
SIGMOD-1990-HansonCKW #algorithm #database: A Predicate Matching Algorithm for Database Rule Systems (ENH, MC, CHK, YWW), pp. 271–280.
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.
STOC-1990-KarpVV #algorithm #online: An Optimal Algorithm for On-line Bipartite Matching (RMK, UVV, VVV), pp. 352–358.
STOC-1990-RazW #linear: Monotone Circuits for Matching Require Linear Depth (RR, AW), pp. 287–292.
STOC-1990-Vishkin #pattern matching #performance: Deterministic Sampling-A New Technique for Fast Pattern Matching (UV), pp. 170–180.
ICALP-1990-Blum #approach #graph: A New Approach to Maximum Matching in General Graphs (NB), pp. 586–597.
LFP-1990-PuelS #compilation #composition #pattern matching: Compiling Pattern Matching by Term Decomposition (LP, AS), pp. 273–281.
GG-1990-BunkeGT #algorithm #graph grammar #implementation #performance: An Efficient Implementation of Graph Grammars Based on the RETE Matching Algorithm (HB, TG, THT), pp. 174–189.
SIGIR-1990-HalinCK #image #machine learning #retrieval: Machine Learning and Vectorial Matching for an Image Retrieval Model: EXPRIM and the System RIVAGE (GH, MC, PK), pp. 99–114.
ALP-1990-Bellegarde #category theory #formal method #process: A Matching Process Modulo a Theory of Categorical Products (FB), pp. 270–282.
PLILP-1990-Ferdinand #functional #model transformation #pattern matching #using: Pattern Matching in a Functional Transformation Language using Treeparsing (CF), pp. 358–371.
CADE-1990-Rittri #equation #identifier #library: Retrieving Library Identifiers via Equational Matching of Types (MR), pp. 603–617.
CLP-1990-DelcherK90 #anti #parallel #performance: Efficient Parallel Term Matching and Anti-Unification (ALD, SK), pp. 355–369.
CLP-1990-ZhouTU90 #automaton #prolog: A Matching Tree Oriented Abstract Machine for Prolog (NFZ, TT, KU), pp. 159–173.
STOC-1989-Motwani #algorithm #analysis #graph #problem: Expanding Graphs and the Average-case Analysis of Algorithms for Matchings and Related Problems (RM), pp. 550–561.
ICALP-1989-GalilP #algorithm #approximate #string: An Improved Algorithm for Approximate String Matching (ZG, KP), pp. 394–404.
SIGIR-1989-MetzlerH #information retrieval #parsing: The Constituent Object Parser: Syntactic Structure Matching for Information Retrieval (DPM, SWH), pp. 117–126.
RTA-1989-Nipkow #algorithm: Combining Matching Algorithms: The Rectangular Case (TN), pp. 343–358.
SIGMOD-1988-KimP #retrieval: Optimal File Distribution For Partial Match Retrieval (MHK, SP), pp. 173–182.
ESOP-1988-GiegerichS #parsing #pattern matching: Code Selection Techniques: Pattern Matching, Tree Parsing, and Inversion of Derivors (RG, KS), pp. 247–268.
ESOP-1988-Laville #algorithm #implementation #lazy evaluation #pattern matching: Implementation of Lazy Pattern Matching Algorithms (AL), pp. 298–316.
STOC-1988-GabowT #algorithm #problem: Almost-Optimum Speed-ups of Algorithms for Bipartite Matching and Related Problems (HNG, RET), pp. 514–527.
STOC-1988-Vaidya #geometry: Geometry Helps in Matching (Extended Abstract) (PMV), pp. 422–425.
ICALP-1988-AlbertF #algorithm #analysis #complexity #multi: Average Case Complexity Analysis of the Rete Multi-Pattern Match Algorithm (LA, FF), pp. 18–37.
ICALP-1988-RameshR #pattern matching: Nonlinear Pattern Matching in Trees (RR, IVR), pp. 473–488.
LFP-1988-JategaonkarM #ml #pattern matching #type system: ML with Extended Pattern Matching and Subtypes (LJ, JCM), pp. 198–211.
ALP-1988-Schnoebelen #compilation #functional #pattern matching: Refined Compilation of Pattern-Matching for Functional Languages (PS), pp. 233–243.
PPEALS-1988-TambeKGFMN #learning #named #parallel: Soar/PSM-E: Investigating Match Parallelism in a Learning Production System (MT, DK, AG, CF, BM, AN), pp. 146–160.
CADE-1988-VermaR #bound #parallel: Optimal Time Bounds for Parallel Term Matching (RMV, IVR), pp. 694–703.
DAC-1987-Keutzer #graph #named #optimisation: DAGON: Technology Binding and Local Optimization by DAG Matching (KK), pp. 341–347.
STOC-1987-MulmuleyVV #matrix: Matching Is as Easy as Matrix Inversion (KM, UVV, VVV), pp. 345–354.
ICALP-1987-RameshVKR #parallel: Term Matching on Parallel Computers (RR, RMV, KT, IVR), pp. 336–346.
POPL-1987-Chase #bottom-up #pattern matching: An Improvement to Bottom-up Tree Pattern Matching (DRC), pp. 168–177.
POPL-1987-Wadler #abstraction #named #pattern matching: Views: A Way for Pattern Matching to Cohabit with Data Abstraction (PW), pp. 307–313.
RTA-1987-RameshR #parallel #pattern matching: Optimal Speedups for Parallel Pattern Matching in Trees (RR, IVR), pp. 274–285.
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.
STOC-1986-LeightonS #algorithm #analysis #bound #grid: Tight Bounds for Minimax Grid Matching, With Applications to the Average Case Analysis of Algorithms (FTL, PWS), pp. 91–103.
POPL-1986-HatcherC #bottom-up #code generation #pattern matching: High-Quality Code Generation Via Bottom-Up Tree Pattern Matching (PJH, TWC), pp. 119–130.
CADE-1986-Burckert #strict #unification: Some Relationships between Unification, restricted Unification, and Matching (HJB), pp. 514–524.
CADE-1986-DworkCKS #algorithm #parallel: Parallel Algorithms for Term Matching (CD, PCK, LJS), pp. 416–430.
CADE-1986-KapurN #problem #set #unification: NP-Completeness of the Set Unification and Matching Problems (DK, PN), pp. 489–495.
CADE-1986-Mzali: Matching with Distributivity (JM), pp. 496–505.
ICLP-1986-Robinson86 #memory management #pattern matching #prolog: A Prolog Processor Based on a Pattern Matching Memory Device (IR), pp. 172–179.
STOC-1985-KarpUW #random: Constructing a Perfect Matching is in Random NC (RMK, EU, AW), pp. 22–32.
ICALP-1985-Vishkin #parallel #pattern matching #string #summary: Optimal Parallel Pattern Matching in Strings (Extended Summary) (UV), pp. 497–508.
FPCA-1985-Augustsson85 #compilation #pattern matching: Compiling Pattern Matching (LA), pp. 368–381.
FPCA-1985-Wadler85 #backtracking #exception #functional #how #lazy evaluation #pattern matching: How to Replace Failure by a List of Successes: A method for exception handling, backtracking, and pattern matching in lazy functional languages (PW), pp. 113–128.
POPL-1985-AhoG #code generation #pattern matching #performance: Efficient Tree Pattern Matching: An Aid to Code Generation (AVA, MG), pp. 334–340.
RTA-1985-BenanavKN #complexity #problem: Complexity of Matching Problems (DB, DK, PN), pp. 417–429.
RTA-1985-PurdomB #algorithm #performance: Fast Many-to-One Matching Algorithms (PWPJ, CAB), pp. 407–416.
STOC-1984-Galil #algorithm #parallel #string: Optimal Parallel Algorithms for String Matching (ZG), pp. 240–248.
ICALP-1984-SpencerM: Node Weighted Matching (THS, EWM), pp. 454–464.
STOC-1983-Stout: Topological Matching (QFS), pp. 24–31.
STOC-1981-GalilS #string: Time-Space-Optimal String Matching (ZG, JIS), pp. 106–113.
STOC-1980-SupowitPR #heuristic: Heuristics for Weighted Perfect Matching (KJS, DAP, EMR), pp. 398–419.
ICALP-1980-FlajoletS #algorithm #analysis #on the: On the Analysis of Tree-Matching Algorithms (PF, JMS), pp. 208–219.
ICALP-1979-Commentz-Walter #algorithm #performance #string: A String Matching Algorithm Fast on the Average (BCW), pp. 118–132.
POPL-1979-HoffmanO #generative #interpreter #pattern matching #using: Interpreter Generation Using Tree Pattern Matching (CMH, MJO), pp. 169–179.
POPL-1979-LiuF #pattern matching #polynomial #string: String Pattern Matching in Polynomial Time (KCL, ACF), pp. 222–225.
STOC-1978-KirkpatrickH #on the #problem: On the Completeness of a Generalized Matching Problem (DGK, PH), pp. 240–245.
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.
STOC-1977-AngluinV #algorithm #performance #probability: Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings (DA, LGV), pp. 30–41.
ICALP-1977-ItaiR #problem: Some Matching Problems (AI, MR), pp. 258–268.
VLDB-J-1975-Burkhard76 #algorithm #retrieval: Hashing and Trie Algorithms for Partial Match Retrieval (WAB), pp. 175–187.
STOC-1976-Galil #algorithm #realtime #recognition #string: Real-Time Algorithms for String-Matching and Palindrome Recognition (ZG), pp. 161–173.
VLDB-1975-Burkhard #design #query: Partial-Match Queries and File Designs (WAB), pp. 523–525.