BibSLEIGH — tree stem

Used together with:

decis (178)
use (170)
base (147)
automata (135)
algorithm (134)

Stem tree$ (all stems)

1663 papers:

WICSA-2015-CoutoTCL #abstract syntax tree #architecture #migration #syntax: Migrating to an Extensible Architecture for Abstract Syntax Trees (LDC, PWVTJ, JWC, KL), pp. 145–154.
CASE-2015-ZhuQZ #clustering #modelling #multi #petri net #scheduling #tool support: Petri net modeling and one-wafer scheduling of single-arm tree-like multi-cluster tools (QZ, YQ, MZ), pp. 292–297.
DAC-2015-ChenTSHK #analysis #modelling #multi #reliability: Interconnect reliability modeling and analysis for multi-branch interconnect trees (HBC, SXDT, VS, XH, TK), p. 6.
DAC-2015-EwetzJK #configuration management #design: Construction of reconfigurable clock trees for MCMM designs (RE, SJ, CKK), p. 6.
DATE-2015-GomonyGAAG #memory management #realtime #scalability: A generic, scalable and globally arbitrated memory tree for shared DRAM access in real-time systems (MDG, JG, BA, NCA, KGWG), pp. 193–198.
DATE-2015-LiuDNL #hardware #named #realtime: FastTree: a hardware KD-tree construction acceleration engine for real-time ray tracing (XL, YD, YN, ZL), pp. 1595–1598.
PODS-2015-BarceloPS #approximate #evaluation #performance: Efficient Evaluation and Approximation of Well-designed Pattern Trees (PB, RP, SS), pp. 131–144.
PODS-2015-CzerwinskiMPP: The (Almost) Complete Guide to Tree Pattern Containment (WC, WM, PP, MP), pp. 117–130.
SIGMOD-2015-BernsteinDDP #concurrent #database #optimisation: Optimizing Optimistic Concurrency Control for Tree-Structured, Log-Structured Databases (PAB, SD, BD, MP), pp. 1295–1309.
SIGMOD-2015-HuangFL #graph: Minimum Spanning Trees in Temporal Graphs (SH, AWCF, RL), pp. 419–430.
VLDB-2015-ChangLZYZQ #performance: Optimal Enumeration: Efficient Top-k Tree Matching (LC, XL, WZ, JXY, YZ, LQ), pp. 533–544.
VLDB-2015-ChenJ #in memory #memory management #persistent: Persistent B+-Trees in Non-Volatile Main Memory (SC, QJ), pp. 786–797.
VLDB-2015-TangCM #scalability #similarity: Scaling Similarity Joins over Tree-Structured Data (YT, YC, NM), pp. 1130–1141.
VLDB-2015-YingKSS #named: TreeScope: Finding Structural Anomalies In Semi-Structured Data (SY, FK, BS, DS), pp. 1904–1915.
ITiCSE-2015-ChengSH #named #online: TOPT: A Tree-based Online Presentation Tool (YC, JS, JH), p. 342.
ITiCSE-2015-XhakajL #approach #education: A New Approach To Teaching Red Black Tree (FX, CWL), pp. 278–283.
FASE-2015-AndriescuMI #automaton #data type #using: Composing Message Translators and Inferring Their Data Types Using Tree Automata (EA, TM, VI), pp. 35–50.
FoSSaCS-2015-CloustonG #calculus: Sequent Calculus in the Topos of Trees (RC, RG), pp. 133–147.
FoSSaCS-2015-Ganardi #bound #clique #game studies: Parity Games of Bounded Tree- and Clique-Width (MG), pp. 390–404.
FoSSaCS-2015-KieferMW #automaton #multi: Minimisation of Multiplicity Tree Automata (SK, IM, JW), pp. 297–311.
TACAS-2015-HolikHLRSV #analysis #automaton #contest #named #using: Forester: Shape Analysis Using Tree Automata — (Competition Contribution) (LH, MH, OL, AR, JS, TV), pp. 432–435.
SANER-2015-PalixFL #algorithm #difference: Improving pattern tracking with a language-aware tree differencing algorithm (NP, JRF, JL), pp. 43–52.
PEPM-2015-BahrA #graph #traversal: Generalising Tree Traversals to DAGs: Exploiting Sharing without the Pain (PB, EA), pp. 27–38.
PLDI-2015-WeijiangBLK #analysis #dependence: Tree dependence analysis (YW, SB, JL, MK), pp. 314–325.
SAS-2015-ChenC #abstract domain: A Binary Decision Tree Abstract Domain Functor (JC, PC), pp. 36–53.
STOC-2015-LackiOPSZ #algorithm #distance #performance #power of: The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree (JL, JO, MP, PS, AZ), pp. 11–20.
CIAA-J-2013-Maletti15 #automaton: Hyper-optimization for deterministic tree automata (AM), pp. 72–87.
DLT-2015-BrlekLP #complexity: Palindromic Complexity of Trees (SB, NL, XP), pp. 155–166.
DLT-2015-Lohrey #grammarware: Grammar-Based Tree Compression (ML), pp. 46–57.
ICALP-v1-2015-BjorklundKKZ: Spotting Trees with Few Leaves (AB, VK, LK, MZ), pp. 243–255.
ICALP-v1-2015-FominKLPS #algorithm #polynomial: Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (FVF, PK, DL, FP, SS), pp. 494–505.
ICALP-v2-2015-AmarilliBS: Provenance Circuits for Trees and Treelike Instances (AA, PB, PS), pp. 56–68.
ICALP-v2-2015-DahlgaardKR: A Simple and Optimal Ancestry Labeling Scheme for Trees (SD, MBTK, NR), pp. 564–574.
ICALP-v2-2015-FiliotMRT #problem #transducer: Decision Problems of Tree Transducers with Origin (EF, SM, PAR, JMT), pp. 209–221.
ICALP-v2-2015-LohreyMP: Compressed Tree Canonization (ML, SM, FP), pp. 337–349.
ICALP-v2-2015-SwernofskyW #complexity #on the: On the Complexity of Intersecting Regular, Context-Free, and Tree Languages (JS, MW), pp. 414–426.
LATA-2015-BeyersdorffCS #game studies: A Game Characterisation of Tree-like Q-resolution Size (OB, LC, KS), pp. 486–498.
LATA-2015-BjorklundDZ #algorithm #automaton #performance: An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring (JB, FD, NZ), pp. 97–108.
LATA-2015-BoiretHNT #constraints #logic: Logics for Unordered Trees with Data Constraints on Siblings (AB, VH, JN, RT), pp. 175–187.
LATA-2015-CazauxLR #assembly #graph: Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree (BC, TL, ER), pp. 109–120.
LATA-2015-TravnicekJMC #pattern matching: Backward Linearised Tree Pattern Matching (JT, JJ, BM, LGC), pp. 599–610.
CHI-2015-OttleyYC #how #predict #visualisation: Personality as a Predictor of User Strategy: How Locus of Control Affects Search Strategies on Tree Visualizations (AO, HY, RC), pp. 3251–3254.
DUXU-DD-2015-MartinsMS #case study #fault: A Study of the Fault Tree Human in Aviation (ETM, ITM, MMS), pp. 524–534.
ICEIS-v1-2015-AyadiHAF: Decision Tree Transformation for Knowledge Warehousing (RA, YH, SA, JF), pp. 616–623.
ICEIS-v1-2015-OsbornM #scalability #set: The mqr-tree for Very Large Object Sets (WO, MM), pp. 367–373.
ECIR-2015-LiS #summary: A Hierarchical Tree Model for Update Summarization (RL, HS), pp. 660–665.
ICML-2015-EggelingKG #big data: Dealing with small data: On the generalization of context trees (RE, MK, IG), pp. 1245–1253.
ICML-2015-HuHDX #distributed #parametricity #scalability: Large-scale Distributed Dependent Nonparametric Trees (ZH, QH, AD, EPX), pp. 1651–1659.
ICML-2015-IzbickiS #performance: Faster cover trees (MI, CRS), pp. 1162–1170.
ICML-2015-SerrurierP #evaluation #learning: Entropy evaluation based on confidence intervals of frequency estimates : Application to the learning of decision trees (MS, HP), pp. 1576–1584.
KDD-2015-CuiCHC #random: Optimal Action Extraction for Random Forests and Boosted Trees (ZC, WC, YH, YC), pp. 179–188.
KDD-2015-HanZ #learning #multi: Learning Tree Structure in Multi-Task Learning (LH, YZ), pp. 397–406.
KDD-2015-KimYTM #framework #predict #sequence: A Decision Tree Framework for Spatiotemporal Sequence Prediction (TK, YY, SLT, IM), pp. 577–586.
MLDM-2015-Babu #classification #identification #using: Offline Writer Identification in Tamil Using Bagged Classification Trees (SB), pp. 342–354.
MLDM-2015-PatchalaBG #email #using: Author Attribution of Email Messages Using Parse-Tree Features (JP, RB, SG), pp. 313–327.
SIGIR-2015-LuccheseNOPTV #algorithm #documentation #named #performance #rank: QuickScorer: A Fast Algorithm to Rank Documents with Additive Ensembles of Regression Trees (CL, FMN, SO, RP, NT, RV), pp. 73–82.
OOPSLA-2015-HagueLO #approach #css #detection #html: Detecting redundant CSS rules in HTML5 applications: a tree rewriting approach (MH, AWL, CHLO), pp. 1–19.
SAC-2015-BasgaluppBP #algorithm #evolution #induction #multi: Evolving decision-tree induction algorithms with a multi-objective hyper-heuristic (MPB, RCB, VP), pp. 110–117.
SAC-2015-BlombergBR #evolution #robust: Evolving regression trees robust to missing data (LCB, RCB, DDR), pp. 102–109.
SAC-2015-FrankM0: Alternating model trees (EF, MM, SK), pp. 871–878.
SAC-2015-JakobssonKS #c #hybrid #memory management #monitoring #performance: Fast as a shadow, expressive as a tree: hybrid memory monitoring for C (AJ, NK, JS), pp. 1765–1772.
SAC-2015-KaplanisKSMT: HB+tree: use hadoop and HBase even your data isn’t that big (AK, MK, SS, CM, GT), pp. 973–980.
SAC-2015-Usener #assessment #automation #data type #education #named: EASy-DSBuilder: automated assessment of tree data structures in computer science teaching (CAU), pp. 220–226.
SLE-2015-Bagge #analysis #library: Analysis and transformation with the nuthatch tree-walking library (AHB), pp. 83–88.
PPoPP-2015-RamachandranM #concurrent #named #performance #using: CASTLE: fast concurrent internal binary search tree using edge-based locking (AR, NM), pp. 281–282.
CAV-2015-GrigoreK: Tree Buffers (RG, SK), pp. 290–306.
CSL-2015-DuparcFH #ambiguity #on the: On Unambiguous Regular Tree Languages of Index (0, 2) (JD, KF, SH), pp. 534–548.
CSL-2015-HetzlZ: Tree Grammars for the Elimination of Non-prenex Cuts (SH, SZ), pp. 110–127.
ICLP-2015-Charwat #diagrams #programming #research #summary #using: Dynamic Programming on Tree Decompositions using Binary Decision Diagrams: Research Summary (GC).
LICS-2015-BienvenuKP #complexity #owl #query: Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results (MB, SK, VVP), pp. 317–328.
LICS-2015-DasR #axiom #infinity: A Complete Axiomatization of MSO on Infinite Trees (AD, CR), pp. 390–401.
LICS-2015-KotekSVZ: Extending ALCQIO with Trees (TK, MS, HV, FZ), pp. 511–522.
TLCA-2015-AfshariHL #context-free grammar: Herbrand Disjunctions, Cut Elimination and Context-Free Tree Grammars (BA, SH, GEL), pp. 1–16.
TLCA-2015-AhrensCS #type system: Non-Wellfounded Trees in Homotopy Type Theory (BA, PC, RS), pp. 17–30.
TLCA-2015-Riba #automaton: Fibrations of Tree Automata (CR), pp. 302–316.
VMCAI-2015-KafleG #horn clause #refinement #verification: Tree Automata-Based Refinement with Application to Horn Clause Verification (BK, JPG), pp. 209–226.
ASE-2014-AhmedNWS #behaviour #formal method #integration: Formalisation of the integration of behavior trees (KA, MAHN, LW, AS), pp. 779–784.
DATE-2014-NaqviS #resource management: A tree arbiter cell for high speed resource sharing in asynchronous environments (SRN, AS), pp. 1–6.
DATE-2014-ParkKK #design #multi #synthesis: Mixed allocation of adjustable delay buffers combined with buffer sizing in clock tree synthesis of multiple power mode designs (KP, GK, TK), pp. 1–4.
DRR-2014-RicquebourgRPLC: Boosting bonsai trees for handwritten/printed text discrimination (YR, CR, BP, AL, BC), pp. 902105–12.
SIGMOD-2014-ZaschkeZN #multi: The PH-tree: a space-efficient storage structure and multi-dimensional index (TZ, CZ, MCN), pp. 397–408.
VLDB-2014-AfratiDPU #query: Storing and Querying Tree-Structured Records in Dremel (FNA, DD, MP, JDU), pp. 1131–1142.
VLDB-2014-AhmedSPC: Of Snowstorms and Bushy Trees (RA, RS, MP, SC), pp. 1452–1461.
VLDB-2014-AthanassoulisA #approximate #named: BF-Tree: Approximate Tree Indexing (MA, AA), pp. 1881–1892.
VLDB-2014-Lu0OVW #named #pipes and filters #scalability: ScalaGiST: Scalable Generalized Search Trees for MapReduce Systems [Innovative Systems Paper] (PL, GC, BCO, HTV, SW), pp. 1797–1808.
TFPIE-2014-Ragde: Simple Balanced Binary Search Trees (PR), pp. 78–87.
FoSSaCS-2014-FerlezCM: Generalized Synchronization Trees (JF, RC, SM), pp. 304–319.
FoSSaCS-2014-KobayashiIT #higher-order: Unsafe Order-2 Tree Languages Are Context-Sensitive (NK, KI, TT), pp. 149–163.
WRLA-2014-Genet #automaton #functional #source code #static analysis #towards #using: Towards Static Analysis of Functional Programs Using Tree Automata Completion (TG), pp. 147–161.
SCAM-2014-YoshidaH #c #semiparsing #source code #syntax: A Pattern Search Method for Unpreprocessed C Programs Based on Tokenized Syntax Trees (AY, YH), pp. 295–304.
PLDI-2014-DAntoniVLM #named #performance #transducer: Fast: a transducer-based language for tree manipulation (LD, MV, BL, DM), p. 40.
SAS-2014-UrbanM #abstract domain #proving #termination: A Decision Tree Abstract Domain for Proving Conditional Termination (CU, AM), pp. 302–318.
STOC-2014-GalanisSV: Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region (AG, DS, EV), pp. 823–831.
AFL-2014-MalettiQ #automaton: Hyper-Minimization for Deterministic Weighted Tree Automata (AM, DQ), pp. 314–326.
AFL-2014-Maneth #bibliography #equivalence #problem #transducer: Equivalence Problems for Tree Transducers: A Brief Survey (SM), pp. 74–93.
AFL-2014-MignotSZ14a #automaton #equation: $k$-Position, Follow, Equation and $k$-C-Continuation Tree Automata Constructions (LM, NOS, DZ), pp. 327–341.
CIAA-2014-Fujiyoshi #automaton #multi #recognition: Recognition of Labeled Multidigraphs by Spanning Tree Automata (AF), pp. 188–199.
CIAA-2014-Maletti #bottom-up #multi #power of #transducer: The Power of Regularity-Preserving Multi Bottom-up Tree Transducers (AM), pp. 278–289.
CIAA-2014-Osterholzer #automaton #context-free grammar: Pushdown Machines for Weighted Context-Free Tree Translation (JO), pp. 290–303.
DLT-2014-EngelfrietMS #how #top-down #transducer: How to Remove the Look-Ahead of Top-Down Tree Transducers (JE, SM, HS), pp. 103–115.
DLT-2014-MarsaultS: Breadth-First Serialisation of Trees and Rational Languages — (Short Paper) (VM, JS), pp. 252–259.
ICALP-v1-2014-BaswanaK #algorithm #graph #incremental #maintenance: Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs (SB, SK), pp. 138–149.
ICALP-v1-2014-BhattacharyaKM #coordination: Coordination Mechanisms for Selfish Routing over Time on a Tree (SB, JK, VSM), pp. 186–197.
ICALP-v1-2014-ColeK #algorithm #performance #summary: Fast Algorithms for Constructing Maximum Entropy Summary Trees (RC, HJK), pp. 332–343.
ICALP-v1-2014-DregiL #complexity: Parameterized Complexity of Bandwidth on Trees (MSD, DL), pp. 405–416.
ICALP-v2-2014-AschnerK #bound #constraints #modelling #network: Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints (RA, MJK), pp. 387–398.
ICALP-v2-2014-Bojanczyk14a #infinity #quantifier: Weak MSO+U with Path Quantifiers over Infinite Trees (MB), pp. 38–49.
ICALP-v2-2014-BojanczykGMS #decidability #infinity #on the: On the Decidability of MSO+U on Infinite Trees (MB, TG, HM, MS), pp. 50–61.
LATA-2014-DingSXHMC #modelling #probability: Stochastic k-Tree Grammar and Its Application in Biomolecular Structure Modeling (LD, AS, XX, XH, RLM, LC), pp. 308–322.
LATA-2014-KoHS #top-down: Top-Down Tree Edit-Distance of Regular Tree Languages (SKK, YSH, KS), pp. 466–477.
LATA-2014-LaurenceLNST #learning #transducer: Learning Sequential Tree-to-Word Transducers (GL, AL, JN, SS, MT), pp. 490–502.
CIKM-2014-AnnesiCB #composition #kernel #semantics: Semantic Compositionality in Tree Kernels (PA, DC, RB), pp. 1029–1038.
CIKM-2014-HongBH #classification #framework #multi: A Mixtures-of-Trees Framework for Multi-Label Classification (CH, IB, MH), pp. 211–220.
CIKM-2014-KalyanakrishnanSK #on the #online #scalability: On Building Decision Trees from Large-scale Data in Applications of On-line Advertising (SK, DS, RK), pp. 669–678.
ECIR-2014-Moe #clustering: Improvements to Suffix Tree Clustering (REM), pp. 662–667.
ICML-c1-2014-CicaleseLS #optimisation #testing: Diagnosis determination: decision trees optimizing simultaneously worst and expected testing cost (FC, ESL, AMS), pp. 414–422.
ICML-c1-2014-GiesekeHOI #nearest neighbour #query: Buffer k-d Trees: Processing Massive Nearest Neighbor Queries on GPUs (FG, JH, CEO, CI), pp. 172–180.
ICML-c1-2014-LiL #classification #multi: Condensed Filter Tree for Cost-Sensitive Multi-Label Classification (CLL, HTL), pp. 423–431.
ICML-c2-2014-BellemareVT: Skip Context Tree Switching (MGB, JV, ET), pp. 1458–1466.
ICML-c2-2014-HeaukulaniKG: Beta Diffusion Trees (CH, DAK, ZG), pp. 1809–1817.
ICPR-2014-CarlinetG #image: A Morphological Tree of Shapes for Color Images (EC, TG), pp. 1132–1137.
ICPR-2014-ChengZSWY: Cross-Trees for Stereo Matching with Priors (FC, HZ, MS, HW, DY), pp. 208–213.
ICPR-2014-IrsoyYA: Budding Trees (OI, OTY, EA), pp. 3582–3587.
ICPR-2014-JinIHS #approach #using: A New Approach of Arc Skeletonization for Tree-like Objects Using Minimum Cost Path (DJ, KSI, EAH, PKS), pp. 942–947.
ICPR-2014-KurtzNP #component #multi: Multivalued Component-Tree Filtering (CK, BN, NP), pp. 1008–1013.
ICPR-2014-LiangLLFL #detection #modelling: Accurate Facial Landmarks Detection for Frontal Faces with Extended Tree-Structured Models (AL, WL, LL, MRF, VL), pp. 538–543.
ICPR-2014-LuoZYY #estimation: Region Tree Based Sparse Model for Optical Flow Estimation (WL, FZ, JY, JYY), pp. 2077–2082.
ICPR-2014-LyonBKS #distance: Hellinger Distance Trees for Imbalanced Streams (RJL, JMB, JDK, BWS), pp. 1969–1974.
ICPR-2014-MoeiniMAF #2d #3d #image #invariant #modelling #recognition #women: Makeup-Invariant Face Recognition by 3D Face: Modeling and Dual-Tree Complex Wavelet Transform from Women’s 2D Real-World Images (AM, HM, FA, KF), pp. 1710–1715.
ICPR-2014-SouzaRML: Maximal Max-Tree Simplification (RS, LR, RCM, RdAL), pp. 3132–3137.
ICPR-2014-XiaoCJF #recognition #using: Position-Based Action Recognition Using High Dimension Index Tree (QX, JC, JJ, WF), pp. 4400–4405.
ICPR-2014-YuncuHB #automation #modelling #recognition #speech #using: Automatic Speech Emotion Recognition Using Auditory Models with Binary Decision Tree and SVM (EY, HH, CB), pp. 773–778.
KDD-2014-AkibaMK #analysis #network: Network structural analysis via core-tree-decomposition Publication of this article pending inquiry (TA, TM, KiK), pp. 1476–1485.
KDD-2014-LeeC: Top-k frequent itemsets via differentially private FP-trees (JL, CWC), pp. 931–940.
KDD-2014-PrabhuV #classification #learning #multi #named #performance: FastXML: a fast, accurate and stable tree-classifier for extreme multi-label learning (YP, MV), pp. 263–272.
KDIR-2014-AzadM #classification #consistency #fault #heuristic: “Misclassification Error” Greedy Heuristic to Construct Decision Trees for Inconsistent Decision Tables (MA, MJM), pp. 184–191.
KDIR-2014-VazquezJ: Handling Missing Data in a Tree Species Catalog Proposed for Reforesting Mexico City (HJV, MJM), pp. 457–464.
KMIS-2014-WitschelTL #automation #navigation #topic: Where Did I(T) Put It? — A Holistic Solution to the Automatic Construction of Topic Trees for Navigation (HFW, BT, JL), pp. 194–202.
RE-2014-MartinsO #analysis #case study #fault #functional #protocol #requirements #safety #using: A case study using a protocol to derive safety functional requirements from Fault Tree Analysis (LEGM, TdO), pp. 412–419.
SAC-2014-LiSSJW #information management: Preventing the diffusion of negative information based on local influence tree (YL, YS, JS, BJ, JW), pp. 650–652.
SAC-2014-YangDZYZN #scalability #visualisation: Visualizing large hierarchies with drawer trees (YY, ND, SZ, ZY, KZ, QVN), pp. 951–956.
PPoPP-2014-BrownER: A general technique for non-blocking trees (TB, FE, ER), pp. 329–342.
PPoPP-2014-DrachslerVY #concurrent #logic: Practical concurrent binary search trees via logical ordering (DD, MTV, EY), pp. 343–356.
PPoPP-2014-NatarajanM #concurrent #performance: Fast concurrent lock-free binary search trees (AN, NM), pp. 317–328.
CAV-2014-PiskacWZ #automation #logic: Automating Separation Logic with Trees and Data (RP, TW, DZ), pp. 711–728.
LICS-CSL-2014-BlumensathCKPB #automaton #infinity #logic: Two-way cost automata and cost logics over infinite trees (AB, TC, DK, PP, MVB), p. 9.
LICS-CSL-2014-Hague #term rewriting: Senescent ground tree rewrite systems (MH), p. 10.
LICS-CSL-2014-LosemannM #query: MSO queries on trees: enumerating answers under updates (KL, WM), p. 10.
LICS-CSL-2014-TsukadaO #composition #game studies #higher-order #model checking: Compositional higher-order model checking via ω-regular games over Böhm trees (TT, CHLO), p. 10.
RTA-TLCA-2014-CreusG14a #automaton #constraints: Tree Automata with Height Constraints between Brothers (CC, GG), pp. 149–163.
DATE-2013-AlieeGRT #analysis #automation #fault #reliability: Automatic success tree-based reliability analysis for the consideration of transient and permanent faults (HA, MG, FR, JT), pp. 1621–1626.
DATE-2013-BarrioHMMM #multi #synthesis: Multispeculative additive trees in high-level synthesis (AADB, RH, SOM, JMM, MCM), pp. 188–193.
DATE-2013-WangW #named #performance #ram: TreeFTL: efficient RAM management for high performance of NAND flash-based storage systems (CW, WFW), pp. 374–379.
DocEng-2013-BaAS #collaboration #documentation #editing #nondeterminism #version control: Uncertain version control in open collaborative editing of tree-structured documents (MLB, TA, PS), pp. 27–36.
ICDAR-2013-KirbyH #analysis #using: Analysis of Topographic Maps for Recreational Purposes Using Decision Trees (RK, TCH), pp. 1105–1109.
ICDAR-2013-ShivakumaraBGT #detection #video: Detection of Curved Text in Video: Quad Tree Based Method (PS, HTB, DSG, CLT), pp. 594–598.
ICDAR-2013-SunH #approach #component #image: An Improved Component Tree Based Approach to User-Intention Guided Text Extraction from Natural Scene Images (LS, QH), pp. 383–387.
SIGMOD-2013-AchtertKSZ #3d #coordination #data mining #interactive #mining: Interactive data mining with 3D-parallel-coordinate-trees (EA, HPK, ES, AZ), pp. 1009–1012.
SIGMOD-2013-KissingerSHL #query: Query processing on prefix trees live (TK, BS, DH, WL), pp. 1105–1108.
VLDB-2013-AchakeevS #multi #performance: Efficient Bulk Updates on Multiversion B-trees (DA, BS), pp. 1834–1845.
VLDB-2013-DayanSBBB #algorithm #design #named: EagleTree: Exploring the Design Space of SSD-Based Algorithms (ND, MKS, MB, PB, LB), pp. 1290–1293.
FoSSaCS-2013-HofmannRS #morphism #pointer #source code: Pure Pointer Programs and Tree Isomorphism (MH, RR, US), pp. 321–336.
TACAS-2013-ChristHN #proving: Proof Tree Preserving Interpolation (JC, JH, AN), pp. 124–138.
PLDI-2013-LifflanderKK: Steal Tree: low-overhead tracing of work stealing schedulers (JL, SK, LVK), pp. 507–518.
SAS-2013-0001MP #abstract domain #automaton #quantifier: Quantified Data Automata on Skinny Trees: An Abstract Domain for Lists (PG, PM, GP), pp. 172–193.
STOC-2013-GuGK #maintenance #online #power of: The power of deferral: maintaining a constant-competitive steiner tree online (AG, AG, AK), pp. 525–534.
CIAA-J-2012-JezM13 #automaton: Hyper-Minimization for Deterministic Tree Automata (AJ, AM), pp. 815–830.
CIAA-2013-GenetGLM #algorithm #automaton: A Completion Algorithm for Lattice Tree Automata (TG, TLG, AL, VM), pp. 134–145.
CIAA-2013-Maletti #automaton: Hyper-optimization for Deterministic Tree Automata (AM), pp. 244–255.
DLT-2013-FulopM #composition #linear #top-down #transducer: Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers (ZF, AM), pp. 239–251.
ICALP-v1-2013-BilleFGKSV: Sparse Suffix Tree Construction in Small Space (PB, JF, ILG, TK, BS, HWV), pp. 148–159.
ICALP-v1-2013-BilleGLW: Tree Compression with Top Trees (PB, ILG, GML, OW), pp. 160–171.
ICALP-v1-2013-DemaineILO: Combining Binary Search Trees (EDD, JI, SL, ÖÖ), pp. 388–399.
ICALP-v1-2013-Leonardos #bound #complexity #random #recursion: An Improved Lower Bound for the Randomized Decision Tree Complexity of Recursive Majority, (NL), pp. 696–708.
ICALP-v2-2013-BenaimBCKLMW #complexity #finite #logic: Complexity of Two-Variable Logic on Finite Trees (SB, MB, WC, EK, RL, FM, JW), pp. 74–88.
ICALP-v2-2013-GenestGMW #architecture #game studies: Asynchronous Games over Tree Architectures (BG, HG, AM, IW), pp. 275–286.
ICALP-v2-2013-HenzingerKN #maintenance #network: Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks (MH, SK, DN), pp. 607–619.
ICALP-v2-2013-Janin #algebra #automaton #logic: Algebras, Automata and Logic for Languages of Labeled Birooted Trees (DJ), pp. 312–323.
LATA-2013-Blanchet-SadriL #problem #word: Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem (FBS, JL), pp. 165–176.
LATA-2013-HashimotoSISF #bottom-up #transducer: Determinacy and Subsumption for Single-Valued Bottom-Up Tree Transducers (KH, RS, YI, HS, TF), pp. 335–346.
LATA-2013-LaugerotteSZ #automaton: From Regular Tree Expression to Position Tree Automaton (ÉL, NOS, DZ), pp. 395–406.
CHI-2013-JacobsBSGPG #what: A conversation between trees: what data feels like in the forest (RJ, SB, MS, MG, DP, GG), pp. 129–138.
CHI-2013-SkoGM #human-computer #online #parametricity: Non-parametric decision trees and online HCI (TS, HJG, MAM), pp. 2103–2106.
ICEIS-v1-2013-CazzolatoRYS #algorithm #classification #data type #statistics: A Statistical Decision Tree Algorithm for Data Stream Classification (MTC, MXR, CAY, MTPS), pp. 217–223.
ICEIS-v1-2013-QasimR #analysis #classification #evaluation #linear #using: Classification of Hepatitis Patients and Fibrosis Evaluation using Decision Trees and Linear Discriminant Analysis (RQ, RMR), pp. 239–246.
CIKM-2013-PalBP #named #query: RCached-tree: an index structure for efficiently answering popular queries (MP, AB, DP), pp. 1173–1176.
CIKM-2013-ZhongLTZ #named #network #performance: G-tree: an efficient index for KNN search on road networks (RZ, GL, KLT, LZ), pp. 39–48.
ECIR-2013-AsadiL #documentation #modelling #performance #ranking: Training Efficient Tree-Based Models for Document Ranking (NA, JL), pp. 146–157.
ECIR-2013-LaitangPB #distance #edit distance #information retrieval: DTD Based Costs for Tree-Edit Distance in Structured Information Retrieval (CL, KPS, MB), pp. 158–170.
ICML-c1-2013-XuKWC #classification: Cost-Sensitive Tree of Classifiers (ZEX, MJK, KQW, MC), pp. 133–141.
ICML-c2-2013-WangK13a #approach #message passing #problem: Subproblem-Tree Calibration: A Unified Approach to Max-Product Message Passing (HW, DK), pp. 190–198.
ICML-c3-2013-AppelFDP: Quickly Boosting Decision Trees — Pruning Underachieving Features Early (RA, TJF, PD, PP), pp. 594–602.
ICML-c3-2013-CurtinMRAGI #algorithm #independence: Tree-Independent Dual-Tree Algorithms (RRC, WBM, PR, DVA, AGG, CLI), pp. 1435–1443.
ICML-c3-2013-IshtevaPS #order #using: Unfolding Latent Tree Structures using 4th Order Tensors (MI, HP, LS), pp. 316–324.
ICML-c3-2013-LakshminarayananRT #top-down: Top-down particle filtering for Bayesian decision trees (BL, DMR, YWT), pp. 280–288.
ICML-c3-2013-SongIPXP #composition #modelling #visual notation: Hierarchical Tensor Decomposition of Latent Tree Graphical Models (LS, MI, APP, EPX, HP), pp. 334–342.
KDD-2013-TabeiKKY #constraints #scalability #similarity: Succinct interval-splitting tree for scalable similarity search of compound-protein pairs with property constraints (YT, AK, MK, YY), pp. 176–184.
KDD-2013-WangLSG #mining #multi: Mining evolutionary multi-branch trees from text streams (XW, SL, YS, BG), pp. 722–730.
KDIR-KMIS-2013-CheetiSC #adaptation #approach #classification #naive bayes #sentiment #syntax #using: Cross-domain Sentiment Classification using an Adapted Naïve Bayes Approach and Features Derived from Syntax Trees (SC, AS, DC), pp. 169–176.
KDIR-KMIS-2013-FerchichiBF #adaptation #approach #image #predict: An Approach based on Adaptive Decision Tree for Land Cover Change Prediction in Satellite Images (AF, WB, IRF), pp. 82–90.
MLDM-2013-AmalamanER #detection #using: Using Turning Point Detection to Obtain Better Regression Trees (PKA, CFE, NJR), pp. 325–339.
RecSys-2013-GarcinDF #personalisation #recommendation: Personalized news recommendation with context trees (FG, CD, BF), pp. 105–112.
SEKE-2013-YoonMPP #diagrams #reverse engineering #sequence chart: Reverse Engineering of Sequence Diagrams by Merging Call Trees (SY, SM, SP, SP), pp. 368–374.
BX-2013-HofmannPW: Edit languages for information trees (MH, BCP, DW), pp. 76–89.
ICMT-2013-BaggeL: Walk Your Tree Any Way You Want (AHB, RL), pp. 33–49.
PPDP-2013-RobbinsHK: Theory propagation and rational-trees (ER, JMH, AK), pp. 193–204.
SAC-PL-J-2012-HaraburdaT13 #framework: Binary trees as a computational framework (DH, PT), pp. 163–181.
SAC-2013-BasgaluppBSC #approach #predict: Software effort prediction: a hyper-heuristic decision-tree based approach (MPB, RCB, TSdS, ACPLFC), pp. 1109–1116.
SAC-2013-DugerdilS #legacy: Dynamic decision tree for legacy use-case recovery (PD, DS), pp. 1284–1291.
SAC-2013-GholipourHB #adaptation #data type: An adaptive regression tree for non-stationary data streams (AG, MJH, HB), pp. 815–817.
SAC-2013-HapfelmeierSK #dataset #incremental #linear #performance: Incremental linear model trees on massive datasets: keep it simple, keep it fast (AH, JS, SK), pp. 129–135.
SAC-2013-HorieS #difference: Extracting differences between regular tree grammars (KH, NS), pp. 859–864.
SAC-2013-InzingerHSLD #identification #implementation #using: Identifying incompatible service implementations using pooled decision trees (CI, WH, BS, PL, SD), pp. 485–492.
LDTA-J-2009-ScottJ #generative #gll: GLL parse-tree generation (ES, AJ), pp. 1828–1844.
LDTA-J-2009-SoderbergEHM #abstract syntax tree #analysis #syntax: Extensible intraprocedural flow analysis at the abstract syntax tree level (ES, TE, GH, EM), pp. 1809–1827.
SPLC-2013-KandaII #evolution #source code: Extraction of product evolution tree from source code of product variants (TK, TI, KI), pp. 141–150.
SPLC-2013-Krueger #multi #product line: Multistage configuration trees for managing product family trees (CWK), pp. 188–197.
PPoPP-2013-MorozovW #distributed: Distributed merge trees (DM, GHW), pp. 93–102.
CADE-2013-IosifRS #logic #recursion: The Tree Width of Separation Logic with Recursive Definitions (RI, AR, JS), pp. 21–38.
CSL-2013-BilkowskiS #ambiguity #infinity #problem: Unambiguity and uniformization problems on infinite trees (MB, MS), pp. 81–100.
CSL-2013-ColcombetKLB #automaton: Deciding the weak definability of Büchi definable tree languages (TC, DK, CL, MVB), pp. 215–230.
CSL-2013-Rieg #using: Extracting Herbrand trees in classical realizability using forcing (LR), pp. 597–614.
LICS-2013-BoralS #model checking #parse tree: Model-Checking Parse Trees (AB, SS), pp. 153–162.
LICS-2013-CharatonikW #logic: Two-Variable Logic with Counting and Trees (WC, PW), pp. 73–82.
RTA-2013-BoichutCR #approximate: Over-approximating Descendants by Synchronized Tree Languages (YB, JC, PR), pp. 128–142.
TAP-2013-InsaSR #algorithm #debugging #execution #using: Speeding Up Algorithmic Debugging Using Balanced Execution Trees (DI, JS, AR), pp. 133–151.
ASE-2012-RederE #consistency #design #modelling #nondeterminism: Computing repair trees for resolving inconsistencies in design models (AR, AE), pp. 220–229.
DAC-2012-ChenH #3d #synthesis: Clock tree synthesis with methodology of re-use in 3D IC (FWC, TH), pp. 1094–1099.
DAC-2012-LiuCL #algorithm #multi #performance: An efficient algorithm for multi-layer obstacle-avoiding rectilinear Steiner tree construction (CHL, ICC, DTL), pp. 613–622.
DRR-2012-SchellenbergYZ #retrieval: Layout-based substitution tree indexing and retrieval for mathematical expressions (TS, BY, RZ).
SIGMOD-2012-PengYZWY #difference #multi #named #privacy: DP-tree: indexing multi-dimensional data under differential privacy (abstract only) (SP, YY, ZZ, MW, YY), p. 864.
SIGMOD-2012-SearsR #named: bLSM: a general purpose log structured merge tree (RS, RR), pp. 217–228.
SIGMOD-2012-ZhuLZZY #named #similarity: TreeSpan: efficiently computing similarity all-matching (GZ, XL, KZ, WZ, JXY), pp. 529–540.
VLDB-2012-ChubakR #performance #query: Efficient Indexing and Querying over Syntactically Annotated Trees (PC, DR), pp. 1316–1327.
VLDB-2012-SowellGS #distributed #multi #named #scalability: Minuet: A Scalable Distributed Multiversion B-Tree (BS, WMG, MAS), pp. 884–895.
VLDB-2012-ZengJZ #logic #query: Adding Logical Operators to Tree Pattern Queries on Graph-Structured Data (QZ, XJ, HZ), pp. 728–739.
FoSSaCS-2012-Kartzow #automaton #exponential #first-order #model checking: First-Order Model Checking on Nested Pushdown Trees is Complete for Doubly Exponential Alternating Time (AK), pp. 376–390.
TACAS-2012-LengalSV #automaton #library #named #nondeterminism #performance: VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata (OL, JS, TV), pp. 79–94.
CSMR-2012-Koschke #clone detection #detection #scalability #using: Large-Scale Inter-System Clone Detection Using Suffix Trees (RK), pp. 309–318.
STOC-2012-AbrahamN #using: Using petal-decompositions to build a low stretch spanning tree (IA, ON), pp. 395–406.
STOC-2012-GoemansORZ: Matroids and integrality gaps for hypergraphic steiner tree relaxations (MXG, NO, TR, RZ), pp. 1161–1176.
FLOPS-2012-Uustalu #performance: Explicit Binds: Effortless Efficiency with and without Trees (TU), pp. 317–331.
CIAA-2012-Ceccherini-SilbersteinCFS #automaton: Cellular Automata on Regular Rooted Trees (TCS, MC, FF, ZS), pp. 101–112.
CIAA-2012-JezM #automaton: Hyper-minimization for Deterministic Tree Automata (AJ, AM), pp. 217–228.
DLT-2012-BuchseMV #semantics: Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars (MB, AM, HV), pp. 368–379.
DLT-2012-GandhiKL #complexity #finite #on the #word: On State Complexity of Finite Word and Tree Languages (AG, BK, JL), pp. 392–403.
ICALP-v1-2012-BoseCFL: De-amortizing Binary Search Trees (PB, SC, RF, SL), pp. 121–132.
ICALP-v1-2012-GeorgiadisT #independence #order: Dominators, Directed Bipolar Orders, and Independent Spanning Trees (LG, RET), pp. 375–386.
ICALP-v2-2012-AcetoCEI #algebra #process: Algebraic Synchronization Trees and Processes (LA, AC, ZÉ, AI), pp. 30–41.
ICALP-v2-2012-AlurD #streaming #transducer: Streaming Tree Transducers (RA, LD), pp. 42–53.
ICALP-v2-2012-BojanczykP #infinity #regular expression #set: Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets (MB, TP), pp. 104–115.
LATA-2012-Hetzl #proving: Applying Tree Languages in Proof Theory (SH), pp. 301–312.
IFL-2012-SculthorpeFG #haskell #program transformation: The HERMIT in the Tree — Mechanizing Program Transformations in the GHC Core Language (NS, AF, AG), pp. 86–103.
CHI-2012-SchneiderSMESS #collaboration #named #student: Phylo-Genie: engaging students in collaborative “tree-thinking” through tabletop techniques (BS, MS, LM, SE, OS, CS), pp. 3071–3080.
AdaEurope-2012-PoonCT #classification: Choices, Choices: Comparing between CHOC’LATE and the Classification-Tree Methodology (PLP, TYC, THT), pp. 162–176.
ICEIS-v2-2012-HernandesHMF #documentation #visualisation: Facilitating the Handling of Documents through Tree-Map Visualization (EMH, ENH, JCM, SF), pp. 98–104.
CIKM-2012-AchakeevSW #adaptation: Sort-based query-adaptive loading of R-trees (DA, BS, PW), pp. 2080–2084.
CIKM-2012-ComarLSNT #detection #kernel #linear: Weighted linear kernel with tree transformed features for malware detection (PMC, LL, SS, AN, PNT), pp. 2287–2290.
CIKM-2012-GubichevN #approximate #graph #performance #scalability: Fast approximation of steiner trees in large graphs (AG, TN), pp. 1497–1501.
CIKM-2012-PatwardhanBAMC: Labeling by landscaping: classifying tokens in context by pruning and decorating trees (SP, BB, AA, AM, JCC), pp. 1133–1142.
ICML-2012-FarabetCNL #learning #multi #parsing: Scene parsing with Multiscale Feature Learning, Purity Trees, and Optimal Covers (CF, CC, LN, YL), p. 241.
ICML-2012-Gomez-RodriguezS12a #multi #network: Submodular Inference of Diffusion Networks from Multiple Trees (MGR, BS), p. 206.
ICML-2012-KimuraK #kernel #performance: Fast Computation of Subpath Kernel for Trees (DK, HK), p. 81.
ICML-2012-McCartin-LimMW #approximate: Approximate Principal Direction Trees (MML, AM, RW), p. 209.
ICML-2012-Nowozin #induction: Improved Information Gain Estimates for Decision Tree Induction (SN), p. 77.
ICML-2012-ZanzottoD #distributed #kernel: Distributed Tree Kernels (FMZ, LD), p. 20.
ICPR-2012-AmornbunchornvejLAIT #algorithm #clustering: Iterative Neighbor-Joining tree clustering algorithm for genotypic data (CA, TL, AA, AI, ST), pp. 1827–1830.
ICPR-2012-BougleuxDBGM #combinator #kernel #similarity: Shape similarity based on combinatorial maps and a tree pattern kernel (SB, FXD, LB, BG, MM), pp. 1602–1605.
ICPR-2012-IrsoyYA: Soft decision trees (OI, OTY, EA), pp. 1819–1822.
ICPR-2012-LiuCSTN #learning #multi #performance #problem #recursion #scalability: Recursive NMF: Efficient label tree learning for large multi-class problems (LL, PMC, SS, PNT, AN), pp. 2148–2151.
ICPR-2012-LiuJSET #classification #image #segmentation: Watershed merge tree classification for electron microscopy image segmentation (TL, EJ, MS, MHE, TT), pp. 133–137.
ICPR-2012-MiyamotoMSS #3d #classification #estimation #precise #realtime: Real-time and precise 3-D hand posture estimation based on classification tree trained with variations of appearances (SM, TM, NS, YS), pp. 453–456.
ICPR-2012-PiroSM #orthogonal: Inner product tree for improved Orthogonal Matching Pursuit (PP, DS, VM), pp. 429–432.
ICPR-2012-SunH #component: A component-tree based method for user-intention guided text extraction (LS, QH), pp. 633–636.
ICPR-2012-SvarmSEO #image #using: Point track creation in unordered image collections using Gomory-Hu trees (LS, ZS, OE, CO), pp. 2116–2119.
ICPR-2012-WangOJBK #using: Tracking Tetrahymena pyriformis cells using decision trees (QW, YO, AAJ, KLB, MK), pp. 1843–1847.
ICPR-2012-WangX #generative #image #recognition: Discriminative and generative vocabulary tree for vein image recognition (JW, JX), pp. 3513–3516.
ICPR-2012-XuGN #image #using: Morphological filtering in shape spaces: Applications using tree-based image representations (YX, TG, LN), pp. 485–488.
ICPR-2012-ZhangLM #composition #multi #recognition #using: Multi-subregion face recognition using coarse-to-fine Quad-tree decomposition (CZ, XL, TM), pp. 1004–1007.
ICPR-2012-ZhangWDP #detection #linear: Skin detection via linear regression tree (JZ, HW, FD, CP), pp. 1711–1714.
KDD-2012-RamG #using: Maximum inner-product search using cone trees (PR, AGG), pp. 931–939.
KEOD-2012-KhairMZ #data mining #education #mining #roadmap #student #using: Creating an Educational Roadmap for Engineering Students via an Optimal and Iterative Yearly Regression Tree using Data Mining (MK, CEM, WZ), pp. 43–52.
KMIS-2012-OtsukiAS #using: An Improvement Method of User Operations using Decision Tree on Project Manager Skill-up Simulator (MO, MA, MS), pp. 158–163.
MLDM-2012-OshiroPB #how #question #random: How Many Trees in a Random Forest? (TMO, PSP, JAB), pp. 154–168.
SIGIR-2012-XueC #generative #query: Generating reformulation trees for complex queries (XX, WBC), pp. 525–534.
OOPSLA-2012-JoK #automation #locality #traversal: Automatically enhancing locality for tree traversals with traversal splicing (YJ, MK), pp. 355–374.
TOOLS-EUROPE-2012-MehnertA #type system #using #verification: Verification of Snapshotable Trees Using Access Permissions and Typestate (HM, JA), pp. 187–201.
LOPSTR-2012-InsaST #debugging #declarative: Enhancing Declarative Debugging with Loop Expansion and Tree Compression (DI, JS, CT), pp. 71–88.
PADL-2012-Tarau #declarative #specification: A Declarative Specification of Tree-Based Symbolic Arithmetic Computations (PT), pp. 273–288.
POPL-2012-MadhusudanQS #induction #proving #recursion: Recursive proofs for inductive tree data-structures (PM, XQ, AS), pp. 123–136.
REFSQ-2012-FrickerS #case study #industrial #release planning: Release Planning with Feature Trees: Industrial Case (SF, SS), pp. 288–305.
SAC-2012-BasgaluppBR #maintenance #predict: Predicting software maintenance effort through evolutionary-based decision trees (MPB, RCB, DDR), pp. 1209–1214.
SAC-2012-ErraS #3d #towards #visualisation: Towards the visualization of software systems as 3D forests: the CodeTrees environment (UE, GS), pp. 981–988.
SAC-2012-LiLXZR #named: TL-Tree: flash-optimized storage for time-series sensing data on sensor platforms (HL, DL, LX, GZ, KR), pp. 1565–1572.
SAC-2012-ThanhZ #algorithm #probability #simulation: Tree-based search for stochastic simulation algorithm (VHT, RZ), pp. 1415–1416.
SAC-2012-Tzouramanis #fresh look #named: History-independence: a fresh look at the case of R-trees (TT), pp. 7–12.
FSE-2012-BookGG #interactive: Seeing the forest and the trees: focusing team interaction on value and effort drivers (MB, SG, VG), p. 30.
ICSE-2012-SongPF #interactive #named #using: iTree: Efficiently discovering high-coverage configurations using interaction trees (CS, AP, JSF), pp. 903–913.
ASPLOS-2012-ClementsKZ #scalability #using: Scalable address spaces using RCU balanced trees (ATC, MFK, NZ), pp. 199–210.
PPoPP-2012-CrainGR: A speculation-friendly binary search tree (TC, VG, MR), pp. 161–170.
CSL-2012-Kuroda #axiom #bound #concept #proving: Axiomatizing proof tree concepts in Bounded Arithmetic (SK), pp. 440–454.
ICLP-J-2012-BliemMW #declarative #named #problem #programming #using: D-FLAT: Declarative problem solving using tree decompositions and answer-set programming (BB, MM, SW), pp. 445–464.
ICST-2012-KruseW #classification #generative #sequence #testing: Test Sequence Generation from Classification Trees (PMK, JW), pp. 539–548.
LICS-2012-KomuravelliPC #learning #probability: Learning Probabilistic Systems from Tree Samples (AK, CSP, EMC), pp. 441–450.
LICS-2012-RabinovichR #branch: Interpretations in Trees with Countably Many Branches (AR, SR), pp. 551–560.
LICS-2012-Tan #automaton #order: An Automata Model for Trees with Ordered Data Values (TT), pp. 586–595.
RTA-2012-Lisitsa #automaton #finite #modelling #safety #verification: Finite Models vs Tree Automata in Safety Verification (AL), pp. 225–239.
RTA-2012-Maneth: Dictionary-Based Tree Compression (Invited Talk) (SM), p. 5.
DAC-2011-HuangY #algorithm: An exact algorithm for the construction of rectilinear Steiner minimum trees among complex obstacles (TH, EFYY), pp. 164–169.
DATE-2011-LuHCT #bound: Steiner tree based rotary clock routing with bounded skew and capacitive load balancing (JL, VH, XC, BT), pp. 455–460.
DATE-2011-YanC #multi: Obstacle-aware multiple-source rectilinear Steiner tree with electromigration and IR-drop avoidance (JTY, ZWC), pp. 449–454.
ICDAR-2011-LinGC #component #documentation: Classifying Textual Components of Bilingual Documents with Decision-Tree Support Vector Machines (XRL, CYG, FC), pp. 498–502.
PODS-2011-KimelfeldS #constraints: Finding a minimal tree pattern under neighborhood constraints (BK, YS), pp. 235–246.
SIGMOD-2011-SadoghiJ #named: BE-tree: an index structure to efficiently match boolean expressions over high-dimensional discrete space (MS, HAJ), pp. 637–648.
SIGMOD-2011-SenellartS #approximate #lightweight #named #probability #query: ProApproX: a lightweight approximation query processor over probabilistic trees (PS, AS), pp. 1295–1298.
VLDB-2011-BernsteinRWY #concurrent: Optimistic Concurrency Control by Melding Trees (PAB, CWR, MW, XY), pp. 944–955.
VLDB-2011-SewallCKSD #architecture #manycore #named #parallel: PALM: Parallel Architecture-Friendly Latch-Free Modifications to B+ Trees on Many-Core Processors (JS, JC, CK, NS, PD), pp. 795–806.
VLDB-2012-MansourASK11 #named #parallel #performance #string: ERA: Efficient Serial and Parallel Suffix Tree Construction for Very Long Strings (EM, AA, SS, PK), pp. 49–60.
VLDB-2012-PawlikA11 #algorithm #distance #edit distance #named #robust: RTED: A Robust Algorithm for the Tree Edit Distance (MP, NA), pp. 334–345.
VLDB-2012-RohPKSL11 #optimisation #parallel: B+-tree Index Optimization by Exploiting Internal Parallelism of Flash-based Solid State Drives (HR, SP, SK, MS, SWL), pp. 286–297.
ICSM-2011-YousefiS #distributed #identification #mining: Identifying distributed features in SOA by mining dynamic call trees (AY, KS), pp. 73–82.
PEPM-2011-IkedaN #navigation #relational #symmetry: Calculating tree navigation with symmetric relational zipper (YI, SN), pp. 101–110.
DLT-J-2009-HalavaH11 #problem #reduction: Reduction Tree of the Binary Generalized Post Correspondence Problem (VH, SH), pp. 473–490.
CIAA-J-2010-EsikM11 #automaton #simulation: The Category of Simulations for Weighted Tree Automata (ZÉ, AM), pp. 1845–1859.
CIAA-J-2010-ZdarekM11 #2d: Tree-Based 2D Indexing (JZ, BM), pp. 1893–1907.
DLT-J-2010-FrieseSM11 #bottom-up #normalisation #transducer: Earliest Normal Form and Minimization for Bottom-up Tree Transducers (SF, HS, SM), pp. 1607–1623.
AFL-2011-BorgwardtP #automaton #infinity #problem: The Inclusion Problem for Weighted Automata on Infinite Trees (SB, RP), pp. 108–122.
AFL-2011-PiaoSV #morphism: Tree Homomorphisms for Unranked Trees (XP, KS, SV), pp. 343–357.
CIAA-2011-FlouriJMIP #automaton #order: Tree Template Matching in Ranked Ordered Trees by Pushdown Automata (TF, JJ, BM, CSI, SPP), pp. 273–281.
CIAA-2011-HeamHK #automaton: Loops and Overloops for Tree Walking Automata (PCH, VH, OK), pp. 166–177.
DLT-2011-BattagliaGS #multi #order: Counting the Orderings for Multisets in Consecutive Ones Property and PQ-Trees (GB, RG, NS), pp. 58–69.
DLT-2011-Kasprzik #automaton #finite #query: Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data (AK), pp. 476–477.
ICALP-v1-2011-BordewichK #agile #bound #graph #set: Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width (MB, RJK), pp. 533–544.
ICALP-v1-2011-CanzarEKM #on the: On Tree-Constrained Matchings and Generalizations (SC, KME, GWK, JM), pp. 98–109.
ICALP-v1-2011-MagniezNSX #bound #complexity #random #recursion: Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority (FM, AN, MS, DX), pp. 317–329.
ICALP-v2-2011-LohreyM #morphism #word: Isomorphism of Regular Trees and Words (ML, CM), pp. 210–221.
LATA-2011-BareckaC #automaton #complexity #finite #problem: The Parameterized Complexity of Chosen Problems for Finite Automata on Trees (AB, WC), pp. 129–141.
LATA-2011-LaurenceLNST #normalisation #top-down #transducer: Normalization of Sequential Top-Down Tree-to-Word Transducers (GL, AL, JN, SS, MT), pp. 354–365.
IFM-J-2009-ColvinH11 #behaviour #csp #semantics #specification #using: A semantics for Behavior Trees using CSP with specification commands (RC, IJH), pp. 891–914.
SEFM-2011-ErnstSR #analysis #empirical #interactive #proving #theorem proving #verification: Verification of B + Trees: An Experiment Combining Shape Analysis and Interactive Theorem Proving (GE, GS, WR), pp. 188–203.
ICFP-2011-MorihataM #functional #parallel #programming: Balanced trees inhabiting functional parallel programming (AM, KM), pp. 117–128.
CSCW-2011-KwonLK #locality: The Tree of Knowledge: a localized collective intelligence tool (GHK, YSL, MK), pp. 665–668.
HIMI-v1-2011-VogelZO #analysis: Constructing Phylogenetic Trees Based on Intra-group Analysis of Human Mitochondrial DNA (IV, FZ, PO), pp. 165–169.
ICEIS-v1-2011-MoreauO #performance: Efficient Indexing of Lines with the Mqr-tree (MM, WO), pp. 314–319.
ICEIS-v4-2011-WuW #enterprise #multi: A Multi-layer Tree Model for Enterprise Vulnerability Management (BW, AJAW), pp. 389–394.
CIKM-2011-CaoCS #graph #named: Skynets: searching for minimum trees in graphs with incomparable edge weights (HC, KSC, MLS), pp. 1775–1784.
CIKM-2011-CroceMB #dependence #kernel #semantics: Semantic convolution kernels over dependency trees: smoothed partial tree kernel (DC, AM, RB), pp. 2013–2016.
ICML-2011-BiK #classification #multi: MultiLabel Classification on Tree- and DAG-Structured Hierarchies (WB, JTK), pp. 17–24.
ICML-2011-ChenDC #markov #modelling #parametricity #topic: Topic Modeling with Nonparametric Markov Tree (HC, DBD, LC), pp. 377–384.
ICML-2011-IkonomovskaGZD: Speeding-Up Hoeffding-Based Regression Trees With Options (EI, JG, BZ, SD), pp. 537–544.
ICML-2011-KnowlesGG #algorithm #message passing: Message Passing Algorithms for the Dirichlet Diffusion Tree (DAK, JVG, ZG), pp. 721–728.
ICML-2011-KpotufeL #clustering #nearest neighbour: Pruning nearest neighbor cluster trees (SK, UvL), pp. 225–232.
ICML-2011-ParikhSX #algorithm #modelling #visual notation: A Spectral Algorithm for Latent Tree Graphical Models (APP, LS, EPX), pp. 1065–1072.
ICML-2011-ShiehHA: Tree preserving embedding (AS, TH, EA), pp. 753–760.
ICML-2011-ShinCK #kernel: Mapping kernels for trees (KS, MC, TK), pp. 961–968.
ICML-2011-TarlowBKK #coordination: Dynamic Tree Block Coordinate Ascent (DT, DB, PK, VK), pp. 113–120.
ICML-2011-ZhangDC #infinity: Tree-Structured Infinite Sparse Factor Model (XZ, DBD, LC), pp. 785–792.
KDD-2011-RamG #estimation: Density estimation trees (PR, AGG), pp. 627–635.
KDIR-2011-AlkhalidCM #algorithm #comparison: Comparison of Greedy Algorithms for Decision Tree Construction (AA, IC, MM), pp. 438–443.
KDIR-2011-OmerBG #algorithm #mining #motivation #using: A New Frequent Similar Tree Algorithm Motivated by Dom Mining — Using RTDM and its New Variant — SiSTeR (OB, RB, SG), pp. 238–243.
KDIR-2011-RavulaCL #dynamic analysis #using: Dynamic Analysis of Malware using Decision Trees (RRR, CCC, KJL), pp. 74–83.
KDIR-2011-ShishiboriLK #metric: An Improved Method to Select Candidates on Metric Index VP-tree (MS, SSL, KK), pp. 314–319.
MLDM-2011-LiTM #classification #hybrid #named #performance: ACE-Cost: Acquisition Cost Efficient Classifier by Hybrid Decision Tree with Local SVM Leaves (LL, UT, NDM), pp. 60–74.
SIGIR-2011-GanjisaffarCL #modelling #precise #ranking: Bagging gradient-boosted trees for high precision, low variance ranking models (YG, RC, CVL), pp. 85–94.
SIGIR-2011-HaoCPZ #web: From one tree to a forest: a unified solution for structured web data extraction (QH, RC, YP, LZ), pp. 775–784.
SIGIR-2011-JethavaCBBD #identification #multi #scalability #using: Scalable multi-dimensional user intent identification using tree structured distributions (VJ, LCB, RABY, CB, DPD), pp. 395–404.
SIGIR-2011-KimKWHK #approach #classification #mining: Authorship classification: a discriminative syntactic tree mining approach (SK, HK, TW, JH, HDK), pp. 455–464.
LOPSTR-2011-CaballeroRVM #debugging #declarative #maude #proving: Simplifying Questions in Maude Declarative Debugger by Transforming Proof Trees (RC, AR, AV, NMO), pp. 73–89.
LOPSTR-2011-Gallagher #analysis #logic programming #source code #using: Analysis of Logic Programs Using Regular Tree Languages — (Extended Abstract) (JPG), pp. 1–3.
POPL-2011-MadhusudanP: The tree width of auxiliary storage (PM, GP), pp. 283–294.
SAC-2011-CostaLGR #representation: Representing a bilingual lexicon with suffix trees (JC, GPL, LG, LMSR), pp. 1164–1165.
SAC-2011-IkonomovskaGD #data type #incremental #multi: Incremental multi-target model trees for data streams (EI, JG, SD), pp. 988–993.
SAC-2011-KienHB #algorithm #communication #hybrid #problem #search-based: New hybrid genetic algorithm for solving optimal communication spanning tree problem (PTK, NDH, HTTB), pp. 1076–1081.
CADE-2011-WiesMK #data type #imperative #performance: An Efficient Decision Procedure for Imperative Tree Data Structures (TW, MM, VK), pp. 476–491.
CAV-2011-BabicRS #analysis #automaton: Malware Analysis with Tree Automata Inference (DB, DR, DS), pp. 116–131.
CSL-2011-AdamekMMS: Power-Set Functors and Saturated Trees (JA, SM, LSM, LS), pp. 5–19.
CSL-2011-Kopczynski #consistency #question: Trees in Trees: Is the Incomplete Information about a Tree Consistent? (EK), pp. 367–380.
LICS-2011-BirkedalMSS: First Steps in Synthetic Guarded Domain Theory: Step-Indexing in the Topos of Trees (LB, REM, JS, KS), pp. 55–64.
LICS-2011-CarayolHS: Qualitative Tree Languages (AC, AH, OS), pp. 13–22.
LICS-2011-GollerL #complexity #term rewriting #verification: The Complexity of Verifying Ground Tree Rewrite Systems (SG, AWL), pp. 279–288.
RTA-2011-KochemsO #analysis #functional #linear #reachability #using: Improved Functional Flow and Reachability Analyses Using Indexed Linear Tree Grammars (JK, CHLO), pp. 187–202.
RTA-2011-Tison #automaton #constraints #question #similarity #term rewriting #what: Tree Automata, (Dis-)Equality Constraints and Term Rewriting: What’s New? (ST), pp. 1–2.
TLCA-2011-Tison #automaton #constraints #question #similarity #term rewriting #what: Tree Automata, (Dis-)Equality Constraints and Term Rewriting — What’s New? (ST), pp. 3–5.
DAC-2010-ChenDC #synthesis: Clock tree synthesis under aggressive buffer insertion (YYC, CD, DC), pp. 86–89.
DAC-2010-KimK #3d #design #synthesis #testing: Clock tree synthesis with pre-bond testability for 3D stacked IC designs (TYK, TK), pp. 723–728.
DAC-2010-ShihC #independence #performance #synthesis: Fast timing-model independent buffered clock-tree synthesis (XWS, YWC), pp. 80–85.
DATE-2010-FuHLL: Accelerating Lightpath setup via broadcasting in binary-tree waveguide in Optical NoCs (BF, YH, HL, XL), pp. 933–936.
DocEng-2010-ThaoM #data type #detection #using #version control #xml: Using versioned tree data structure, change detection and node identity for three-way XML merging (CT, EVM), pp. 77–86.
DRR-2010-BianneKL #clustering #modelling #recognition #using #word: Context-dependent HMM modeling using tree-based clustering for the recognition of handwritten words (ALB, CK, LLS), pp. 1–10.
PODS-2010-BenderHK #performance: Performance guarantees for B-trees with different-sized atomic keys (MAB, HH, BCK), pp. 305–316.
PODS-2010-GeladeIMN #approximate #xml: Simplifying XML schema: single-type approximations of regular tree languages (WG, TI, WM, FN), pp. 251–260.
PODS-2010-GrecoS #algorithm #consistency #power of: The power of tree projections: local consistency, greedy algorithms, and larger islands of tractability (GG, FS), pp. 327–338.
SIGMOD-2010-KimCSSNKLBD #architecture #named #performance: FAST: fast architecture sensitive tree search on modern CPUs and GPUs (CK, JC, NS, ES, ADN, TK, VWL, SAB, PD), pp. 339–350.
SIGMOD-2010-SiferLWB #corpus #keyword #multi #summary: Integrating keyword search with multiple dimension tree views over a summary corpus data cube (MS, JL, YW, SB), pp. 1167–1170.
SIGMOD-2010-ZhangHOS #distance #edit distance #named #similarity #string: Bed-tree: an all-purpose index structure for string similarity search based on edit distance (ZZ, MH, BCO, DS), pp. 915–926.
VLDB-2010-GeZ #array #modelling #multi #nondeterminism: A*-tree: A Structure for Storage and Modeling of Uncertain Multidimensional Arrays (TG, SBZ), pp. 964–974.
VLDB-2010-LiH0LY: Tree Indexing on Solid State Drives (YL, BH, JY, QL, KY), pp. 1195–1206.
VLDB-2010-SharifzadehS #diagrams #named #nearest neighbour #performance #query: VoR-Tree: R-trees with Voronoi Diagrams for Efficient Processing of Spatial Nearest Neighbor Queries (MS, CS), pp. 1231–1242.
VLDB-2010-WuJOW #performance: Efficient B-tree Based Indexing for Cloud Data Processing (SW, DJ, BCO, KLW), pp. 1207–1218.
VLDB-2010-ZhangS #memory management: The HV-tree: a Memory Hierarchy Aware Version Index (RZ, MS), pp. 397–408.
ITiCSE-2010-MillerPS: File references, trees, and computational thinking (CSM, LP, AS), pp. 132–136.
FASE-2010-NguyenNPN #fine-grained #representation #version control: Operation-Based, Fine-Grained Version Control Model for Tree-Based Representation (TTN, HAN, NHP, TNN), pp. 74–90.
FoSSaCS-2010-CateF #calculus #finite #proving #μ-calculus: An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees (BtC, GF), pp. 161–175.
ICPC-2010-Taherkhani #algorithm #classification #sorting: Recognizing Sorting Algorithms with the C4.5 Decision Tree Classifier (AT), pp. 72–75.
ICSM-2010-CorazzaMMS #approach #clone detection #detection #kernel: A Tree Kernel based approach for clone detection (AC, SDM, VM, GS), pp. 1–5.
STOC-2010-ByrkaGRS #approximate: An improved LP-based approximation for steiner tree (JB, FG, TR, LS), pp. 583–592.
FLOPS-2010-Saurin #standard #λ-calculus #μ-calculus: Standardization and Böhm Trees for λμ-Calculus (AS), pp. 134–149.
AFL-J-2008-DassowST10 #capacity #generative: Generative Capacity of Subregularly Tree Controlled Grammars (JD, RS, BT), pp. 723–740.
DLT-J-2008-FiliotTT10 #automaton #constraints: Tree Automata with Global Constraints (EF, JMT, ST), pp. 571–596.
CIAA-2010-EsikM #automaton #simulation: Simulations of Weighted Tree Automata (ZÉ, AM), pp. 321–330.
CIAA-2010-ZdarekM #2d: A Note on a Tree-Based 2D Indexing (JZ, BM), pp. 300–309.
DLT-2010-FrieseSM #bottom-up #transducer: Minimization of Deterministic Bottom-Up Tree Transducers (SF, HS, SM), pp. 185–196.
DLT-2010-Maletti #top-down #transducer: Input Products for Weighted Extended Top-Down Tree Transducers (AM), pp. 316–327.
ICALP-v1-2010-GuptaNR10a #adaptation #algorithm #approximate #problem: Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems (AG, VN, RR), pp. 690–701.
ICALP-v1-2010-JacobsCLM #complexity #on the: On the Complexity of Searching in Trees: Average-Case Minimization (TJ, FC, ESL, MM), pp. 527–539.
LATA-2010-Melichar #automaton #named: Arbology: Trees and Pushdown Automata (BM), pp. 32–49.
SEFM-2010-CristiaAM #detection #framework #testing: Pruning Testing Trees in the Test Template Framework by Detecting Mathematical Contradictions (MC, PA, PRM), pp. 268–277.
SEFM-2010-GallardoS #calculus #verification #μ-calculus: Verification of Dynamic Data Tree with μ-calculus Extended with Separation (MdMG, DS), pp. 211–221.
SEFM-2010-Lindsay #behaviour #re-engineering: Behavior Trees: From Systems Engineering to Software Engineering (PAL), pp. 21–30.
SEFM-2010-LindsayWY #assessment #behaviour #model checking #safety #using: Safety Assessment Using Behavior Trees and Model Checking (PAL, KW, NY), pp. 181–190.
SEFM-2010-WinterHC #behaviour #requirements: Integrating Requirements: The Behavior Tree Philosophy (KW, IJH, RC), pp. 41–50.
ICFP-2010-BergstromRRSF #lazy evaluation: Lazy tree splitting (LB, MR, JHR, AS, MF), pp. 93–104.
CHI-2010-SongKLS #comparative #evaluation #scalability #visualisation: A comparative evaluation on tree visualization methods for hierarchical structures with large fan-outs (HS, BHK, BL, JS), pp. 223–232.
SOFTVIS-2010-AdamoliH #analysis #framework #named #performance #visualisation: Trevis: a context tree visualization & analysis framework and its use for classifying performance failure reports (AA, MH), pp. 73–82.
SOFTVIS-2010-LinTOB #comprehension #profiling #towards #using: Towards anomaly comprehension: using structural compression to navigate profiling call-trees (SL, FT, TCO, LJB), pp. 103–112.
ICEIS-DISI-2010-BottcherHK #clustering #named #xml: CluX — Clustering XML Sub-trees (SB, RH, CK), pp. 142–150.
CIKM-2010-AlmeidaTL #metric #named #performance #similarity: BP-tree: an efficient index for similarity search in high-dimensional metric spaces (JA, RdST, NJL), pp. 1365–1368.
CIKM-2010-BarskyTTZ #online: Online update of b-trees (MB, AT, ZT, CZ), pp. 149–158.
ECIR-2010-KarlgrenEST #identification: Between Bags and Trees — Constructional Patterns in Text Used for Attitude Identification (JK, GE, MS, OT), pp. 38–49.
ICML-2010-BradleyG #learning #random: Learning Tree Conditional Random Fields (JKB, CG), pp. 127–134.
ICML-2010-Cesa-BianchiGVZ #graph #predict #random: Random Spanning Trees and the Prediction of Weighted Graphs (NCB, CG, FV, GZ), pp. 175–182.
ICML-2010-GavishNC #graph #learning #multi #theory and practice: Multiscale Wavelets on Trees, Graphs and High Dimensional Data: Theory and Applications to Semi Supervised Learning (MG, BN, RRC), pp. 367–374.
ICML-2010-KimX #multi: Tree-Guided Group Lasso for Multi-Task Regression with Structured Sparsity (SK, EPX), pp. 543–550.
ICPR-2010-GranaBC #algorithm #performance: Decision Trees for Fast Thinning Algorithms (CG, DB, RC), pp. 2836–2839.
ICPR-2010-OkumuraTA #random #recognition #segmentation: Generic Object Recognition by Tree Conditional Random Field Based on Hierarchical Segmentation (TO, TT, YA), pp. 3025–3028.
ICPR-2010-PengSGS #classification #documentation #using: Text Separation from Mixed Documents Using a Tree-Structured Classifier (XP, SS, VG, RS), pp. 241–244.
ICPR-2010-PerretLCS #component #image #multi: Connected Component Trees for Multivariate Image Processing and Applications in Astronomy (BP, SL, CC, ÉS), pp. 4089–4092.
ICPR-2010-TakasuFA #algorithm #similarity: A Variational Bayesian EM Algorithm for Tree Similarity (AT, DF, TA), pp. 1056–1059.
ICPR-2010-TakH #image #retrieval: Tertiary Hash Tree: Indexing Structure for Content-Based Image Retrieval (YT, EH), pp. 3167–3170.
ICPR-2010-WangSLYB #classification #using: Shape Classification Using Tree -Unions (BW, WS, WL, XY, XB), pp. 983–986.
KDD-2010-MarchRG #algorithm #analysis #performance: Fast euclidean minimum spanning tree: algorithm, analysis, and applications (WBM, PR, AGG), pp. 603–612.
KDD-2010-PlangprasopchokLG #folksonomy #metadata: Growing a tree in the forest: constructing folksonomies by integrating structured metadata (AP, KL, LG), pp. 949–958.
KDD-2010-ReichartzKP #dependence #kernel #semantics: Semantic relation extraction with kernels over typed dependency trees (FR, HK, GP), pp. 773–782.
LOPSTR-2010-GiorginoSMP #algorithm #graph #verification: Verification of the Schorr-Waite Algorithm — From Trees to Graphs (MG, MS, RM, MP), pp. 67–83.
LOPSTR-2010-InsaS #algorithm #debugging #execution #scalability: Scaling Up Algorithmic Debugging with Virtual Execution Trees (DI, JS), pp. 149–163.
LOPSTR-2010-SakuraiA #library #named #proving #user interface #visualisation: MikiBeta: A General GUI Library for Visualizing Proof Trees — System Description and Demonstration (KS, KA), pp. 84–98.
POPL-2010-KobayashiTU #higher-order #multi #recursion #transducer #verification: Higher-order multi-parameter tree transducers and recursion schemes for program verification (NK, NT, HU), pp. 495–508.
SAC-2010-BaralisCC #dataset #mining #persistent #scalability: A persistent HY-Tree to efficiently support itemset mining on large datasets (EB, TC, SC), pp. 1060–1064.
SAC-2010-BarrosBRCF #induction: Evolutionary model tree induction (RCB, MPB, DDR, ACPLFdC, AAF), pp. 1131–1137.
SAC-2010-Chen #algorithm #query: A time optimal algorithm for evaluating tree pattern queries (YC), pp. 1638–1642.
SAC-2010-FanizzidE #induction #towards: Towards the induction of terminological decision trees (NF, Cd, FE), pp. 1423–1427.
SAC-2010-FuPTW #using: Mitigating denial of capability attacks using sink tree based quota allocation (ZF, MP, PT, WW), pp. 713–718.
PPoPP-2010-BronsonCCO #concurrent: A practical concurrent binary search tree (NGB, JC, HC, KO), pp. 257–268.
PPoPP-2010-BuehrerPT #distributed: A distributed placement service for graph-structured and tree-structured data (GB, SP, ST), pp. 355–356.
CSL-2010-BiancoMM #logic: Graded Computation Tree Logic with Binary Coding (AB, FM, AM), pp. 125–139.
CSL-2010-Krokhin #constraints: Tree Dualities for Constraint Satisfaction (AAK), pp. 32–33.
CSL-2010-KuskeLL #morphism #problem: The Isomorphism Problem for ω-Automatic Trees (DK, JL, ML), pp. 396–410.
LICS-2010-BargunoCGJV #automaton #constraints #problem: The Emptiness Problem for Tree Automata with Global Constraints (LB, CC, GG, FJ, CV), pp. 263–272.
LICS-2010-ColcombetL #cost analysis #finite: Regular Cost Functions over Finite Trees (TC, CL), pp. 70–79.
LICS-2010-EndrullisHK #combinator #composition #fixpoint: Modular Construction of Fixed Point Combinators and Clocked Bohm Trees (JE, DH, JWK), pp. 111–119.
LICS-2010-PlaceS #xpath: Deciding Definability in FO2(<) (or XPath) on Trees (TP, LS), pp. 253–262.
RTA-2010-Bahr10a #partial order #term rewriting: Partial Order Infinitary Term Rewriting and Böhm Trees (PB), pp. 67–84.
RTA-2010-Bojanczyk #automaton #word: Automata for Data Words and Data Trees (MB), pp. 1–4.
DAC-2009-LiuYKC #algorithm: An O(n log n) path-based obstacle-avoiding algorithm for rectilinear Steiner tree construction (CHL, SYY, SYK, YHC), pp. 314–319.
DATE-2009-ChakrabortyGRP #analysis #optimisation: Analysis and optimization of NBTI induced clock skew in gated clock trees (AC, GG, AR, DZP), pp. 296–299.
DATE-2009-GuXZ #multi #power management: A low-power fat tree-based optical Network-On-Chip for multiprocessor system-on-chip (HG, JX, WZ), pp. 3–8.
DATE-2009-LudoviciVMRGLGB #constraints #design: Assessing fat-tree topologies for regular network-on-chip design under nanoscale technology constraints (DL, FGV, SM, CGR, MEG, PL, GNG, DB), pp. 562–565.
DocEng-2009-Lumley #automation #diagrams #xml: Automated extensible XML tree diagrams (JWL), pp. 123–126.
PODS-2009-CohenKS #automaton #probability #xml: Running tree automata on probabilistic XML (SC, BK, YS), pp. 227–236.
PODS-2009-PaghS: Secondary indexing in one dimension: beyond b-trees and bitmap indexes (RP, SRS), pp. 177–186.
SIGMOD-2009-BeckmannS #comparison: A revised r*-tree in comparison with related index structures (NB, BS), pp. 799–812.
SIGMOD-2009-DalviBS #approach #probability #robust #web: Robust web extraction: an approach based on a probabilistic tree-edit model (NND, PB, FS), pp. 335–348.
SIGMOD-2009-GhotingM #parallel #performance: Serial and parallel methods for i/o efficient suffix tree construction (AG, KM), pp. 827–840.
VLDB-2009-AgrawalGSDS #adaptation: Lazy-Adaptive Tree: An Optimized Index Structure for Flash Devices (DA, DG, RKS, YD, SS), pp. 361–372.
VLDB-2009-LiuJ #using: Using Trees to Depict a Forest (BL, HVJ), pp. 133–144.
VLDB-2009-PandaHBB #learning #named #parallel #pipes and filters: PLANET: Massively Parallel Learning of Tree Ensembles with MapReduce (BP, JH, SB, RJB), pp. 1426–1437.
VLDB-2009-TatikondaP #manycore #mining: Mining Tree-Structured Data on Multicore Systems (ST, SP), pp. 694–705.
ESOP-2009-YuanE #algorithm #performance #problem #reachability: An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees (HY, PTE), pp. 175–189.
FoSSaCS-2009-BroadbentO #higher-order #model checking #on the #recursion: On Global Model Checking Trees Generated by Higher-Order Recursion Schemes (CHB, CHLO), pp. 107–121.
FoSSaCS-2009-LohreyMS #parametricity #reduction: Parameter Reduction in Grammar-Compressed Trees (ML, SM, MSS), pp. 212–226.
FoSSaCS-2009-Stirling #automaton #dependence: Dependency Tree Automata (CS), pp. 92–106.
CSMR-2009-ElishE #case study #comparative #maintenance #object-oriented #predict: Application of TreeNet in Predicting Object-Oriented Software Maintainability: A Comparative Study (MOE, KOE), pp. 69–78.
ICPC-2009-ChilowiczDR #detection #similarity #source code #syntax: Syntax tree fingerprinting for source code similarity detection (MC, ÉD, GR), pp. 243–247.
ICPC-2009-SamiaL #architecture #graph #scalability #towards #visualisation: Towards pie tree visualization of graphs and large software architectures (MS, ML), pp. 301–302.
CIAA-J-2008-AbdullaBHKV09 #automaton #bisimulation: Composed Bisimulation for Tree Automata (PAA, AB, LH, LK, TV), pp. 685–700.
CIAA-2009-CleophasH #algorithm #automaton #tool support: Forest FIRE: A Taxonomy-based Toolkit of Tree Automata and Regular Tree Algorithms (LGC, KH), pp. 245–248.
CIAA-2009-Fujiyoshi #automaton #graph #recognition: Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata (AF), pp. 105–114.
CIAA-2009-HeamNS #automaton #generative #random: Random Generation of Deterministic Tree (Walking) Automata (PCH, CN, SS), pp. 115–124.
CIAA-2009-Seidl #automaton #finite #program analysis: Program Analysis through Finite Tree Automata (HS), p. 3.
ICALP-v1-2009-AubrunB #decidability #finite: Decidability of Conjugacy of Tree-Shifts of Finite Type (NA, MPB), pp. 132–143.
ICALP-v1-2009-ChakaravarthyPRS #approximate #branch #multi: Approximating Decision Trees with Multiway Branches (VTC, VP, SR, YS), pp. 210–221.
ICALP-v1-2009-DemaineHK09a #graph: Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs (EDD, MH, PNK), pp. 328–340.
ICALP-v1-2009-DemaineLW #on the #query: On Cartesian Trees and Range Minimum Queries (EDD, GML, OW), pp. 341–353.
ICALP-v1-2009-FarzanM #order: Dynamic Succinct Ordered Trees (AF, JIM), pp. 439–450.
ICALP-v1-2009-FarzanRR #question: Universal Succinct Representations of Trees? (AF, RR, SSR), pp. 451–462.
ICALP-v1-2009-Golovin #named: B-Treaps: A Uniquely Represented Alternative to B-Trees (DG), pp. 487–499.
ICALP-v1-2009-Nederlof #algorithm #performance #problem #using: Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems (JN), pp. 713–725.
ICALP-v2-2009-PlaceS #decidability: A Decidable Characterization of Locally Testable Tree Languages (TP, LS), pp. 285–296.
LATA-2009-BuchseS #datalog #monad #transducer: Monadic Datalog Tree Transducers (MB, TS), pp. 267–278.
LATA-2009-JacquemardKV #automaton: Rigid Tree Automata (FJ, FK, CV), pp. 446–457.
LATA-2009-Kasprzik: Two Equivalent Regularizations for Tree Adjoining Grammars (AK), pp. 469–480.
LATA-2009-Moore #data access #documentation #generative #problem: The Halting Problem and Undecidability of Document Generation under Access Control for Tree Updates (NM), pp. 601–613.
LATA-2009-ScornavaccaBR #approach: From Gene Trees to Species Trees through a Supertree Approach (CS, VB, VR), pp. 702–714.
ICEIS-HCI-2009-FanSTD #evolution #simulation: Simulation of Forest Evolution — Effects of Environmental Factors to Trees Growth (JF, XyS, YT, TyD), pp. 66–71.
ICEIS-J-2009-BoglSPW #automation #process: Automated Construction of Process Goal Trees from EPC-Models to Facilitate Extraction of Process Patterns (AB, MS, GP, NW), pp. 427–442.
ICEIS-J-2009-IorioSVM #approach #detection #documentation #multi: A Natural and Multi-layered Approach to Detect Changes in Tree-Based Textual Documents (ADI, MS, FV, CM), pp. 90–101.
ICEIS-J-2009-PapatheocharousA #classification #fuzzy #predict: Classification and Prediction of Software Cost through Fuzzy Decision Trees (EP, ASA), pp. 234–247.
CIKM-2009-BarskySTU #scalability #sequence: Suffix trees for very large genomic sequences (MB, US, AT, CU), pp. 1417–1420.
CIKM-2009-ChenL #product line: Message family propagation for ising mean field based on iteration tree (YC, SL), pp. 345–354.
CIKM-2009-KobayakawaKTOKT #analysis #classification #kernel #using: Opinion classification with tree kernel SVM using linguistic modality analysis (TSK, TK, HT, NO, JDK, JT), pp. 1791–1794.
CIKM-2009-NaLM: Dynamic in-page logging for flash-aware B-tree index (GJN, SWL, BM), pp. 1485–1488.
CIKM-2009-PanCASD #feature model #ranking #using: Feature selection for ranking using boosted trees (FP, TC, DA, FS, GD), pp. 2025–2028.
CIKM-2009-WangYPL: Minimal common container of tree patterns (JW, JXY, CP, CL), pp. 1409–1412.
CIKM-2009-XiaYZ #automation #using #web: Automatic web data extraction using tree alignment (YX, HY, SZ), pp. 1645–1648.
CIKM-2009-YeCCZ #distributed #probability: Stochastic gradient boosted distributed decision trees (JY, JHC, JC, ZZ), pp. 2061–2064.
ICML-2009-AiolliMS #kernel: Route kernels for trees (FA, GDSM, AS), pp. 17–24.
ICML-2009-ChengHH #learning #ranking: Decision tree and instance-based learning for label ranking (WC, JCH, EH), pp. 161–168.
ICML-2009-KarampatziakisK #learning #predict: Learning prediction suffix trees with Winnow (NK, DK), pp. 489–496.
KDD-2009-BeygelzimerL #learning: The offset tree for learning with partial labels (AB, JL), pp. 129–138.
KDIR-2009-BruyneP #classification: 2-class Eigen Transformation Classification Trees (SDB, FP), pp. 251–258.
MLDM-2009-LiHLG #concept #detection #random #streaming: Concept Drifting Detection on Noisy Streaming Data in Random Ensemble Decision Trees (PPL, XH, QL, YG), pp. 236–250.
SEKE-2009-SamiaL #visualisation: Pie Tree Visualization (MS, ML), pp. 400–405.
SIGIR-2009-VriesG #clustering #documentation #named #scalability: K-tree: large scale document clustering (CMDV, SG), pp. 718–719.
SIGIR-2009-WangMC #approach: A syntactic tree matching approach to finding similar questions in community-based qa services (KW, ZM, TSC), pp. 187–194.
POPL-2009-MorihataMHT #divide and conquer #morphism #theorem: The third homomorphism theorem on trees: downward & upward lead to divide-and-conquer (AM, KM, ZH, MT), pp. 177–185.
SAC-2009-ArbelaezH #dependence: Exploiting weak dependencies in tree-based search (AA, YH), pp. 1385–1391.
SAC-2009-BasgaluppBCFR #algorithm #induction #multi #named #search-based: LEGAL-tree: a lexicographic multi-objective genetic algorithm for decision tree induction (MPB, RCB, ACPLFdC, AAF, DDR), pp. 1085–1090.
SAC-2009-Djelloul #exponential #finite #infinity #linear: From exponential to almost linear decomposability of finite or infinite trees (KD), pp. 897–902.
SAC-2009-DungDH #constraints #framework #graph #optimisation: LS(graph & tree): a local search framework for constraint optimization on graphs and trees (PQD, YD, PVH), pp. 1402–1407.
SAC-2009-LopesZ #database #named #relational #scalability: HTILDE: scaling up relational decision trees for very large databases (CL, GZ), pp. 1475–1479.
SAC-2009-Xie #predict: Improved AdaBoost.M1 of decision trees with confidence-rated predictions (ZX), pp. 1462–1466.
CGO-2009-SchackelerS #abstraction: Procedural Abstraction with Reverse Prefix Trees (SS, WS), pp. 243–253.
CAV-2009-LammichMW #automaton #constraints #network #set: Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints (PL, MMO, AW), pp. 525–539.
CSL-2009-AdlerW #first-order: Tree-Width for First Order Formulae (IA, MW), pp. 71–85.
CSL-2009-BaranyKR #quantifier: Cardinality Quantifiers in MLO over Trees (VB, LK, AR), pp. 117–131.
CSL-2009-Bojanczyk #algebra: Algebra for Tree Languages (MB), p. 1.
CSL-2009-DuparcFM #automaton #decidability #game studies #linear #problem: Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata (JD, AF, FM), pp. 225–239.
LICS-2009-BiancoMM #logic: Graded Computation Tree Logic (AB, FM, AM), pp. 342–351.
LICS-2009-BojanczykSW #algebra #logic: Wreath Products of Forest Algebras, with Applications to Tree Logics (MB, HS, IW), pp. 255–263.
RTA-2009-GasconGS #unification: Unification with Singleton Tree Grammars (AG, GG, MSS), pp. 365–379.
RTA-2009-Ketema: Comparing Böhm-Like Trees (JK), pp. 239–254.
SAT-2009-BonetJ #metric #satisfiability #using: Efficiently Calculating Evolutionary Tree Measures Using SAT (MLB, KSJ), pp. 4–17.
ASE-2008-AndreouP #estimation #fuzzy #using: Software Cost Estimation using Fuzzy Decision Trees (ASA, EP), pp. 371–374.
ASE-2008-LiHG #code generation #interface #modelling #multi #named #process: MaramaEML: An Integrated Multi-View Business Process Modelling Environment with Tree-Overlays, Zoomable Interfaces and Code Generation (RLL, JGH, JCG), pp. 477–478.
CASE-2008-XuDAG #3d #random #using: Motion planning for steerable needles in 3D environments with obstacles using rapidly-exploring Random Trees and backchaining (JX, VD, RA, KG), pp. 41–46.
DAC-2008-ChangHHLWL: Type-matching clock tree for zero skew clock gating (CMC, SHH, YKH, JZL, HPW, YSL), pp. 714–719.
DAC-2008-RajaramP #design #robust #synthesis: Robust chip-level clock tree synthesis for SOC designs (AR, DZP), pp. 720–723.
DATE-2008-Parandeh-AfsharBI #integer #linear #programming #synthesis: Improving Synthesis of Compressor Trees on FPGAs via Integer Linear Programming (HPA, PB, PI), pp. 1256–1261.
DRR-2008-XiangTLW #recognition #reliability #using: Achieving high recognition reliability using decision trees and AdaBoost (JX, XT, YL, PSPW), p. 68150.
HT-2008-LakkarajuGS #concept #distance #documentation #similarity: Document similarity based on concept tree distance (PL, SG, MS), pp. 127–132.
PODS-2008-Adler #database #dependence #functional: Tree-width and functional dependencies in databases (IA), pp. 311–320.
PODS-2008-Bojanzyk #effectiveness #logic: Effective characterizations of tree logics (MB), pp. 53–66.
PODS-2008-CateS #automaton #logic #transitive #xpath: XPath, transitive closure logic, and nested tree walking automata (BtC, LS), pp. 251–260.
SIGMOD-2008-ChenC #constraints #query: Minimization of tree pattern queries with constraints (DC, CYC), pp. 609–622.
SIGMOD-2008-ChenOTN #named #self: ST2B-tree: a self-tunable spatio-temporal b+-tree index for moving objects (SC, BCO, KLT, MAN), pp. 29–42.
VLDB-2008-AguileraGS #distributed #scalability: A practical scalable distributed B-tree (MKA, WMG, MAS), pp. 598–609.
VLDB-2008-BiveinisS #in memory #performance #towards: Towards efficient main-memory use for optimum tree index update (LB, SS), pp. 1617–1622.
VLDB-2008-CurtmolaDLRSY #community #named: XTreeNet: democratic community search (EC, AD, DL, KKR, DS, KY), pp. 1448–1451.
VLDB-2008-HolupirekS #implementation: Implementing filesystems by tree-aware DBMSs (AH, MHS), pp. 1623–1630.
VLDB-2008-KunduB #data type: Structural signatures for tree data structures (AK, EB), pp. 138–150.
FoSSaCS-2008-GodoyMT #decidability #morphism: Classes of Tree Homomorphisms with Decidable Preservation of Regularity (GG, SM, ST), pp. 127–141.
FoSSaCS-2008-Walukiewicz: Finding Your Way in a Forest: On Different Types of Trees and Their Properties (IW), pp. 1–4.
TACAS-2008-AbdullaBHKV #automaton #simulation: Computing Simulations over Tree Automata (PAA, AB, LH, LK, TV), pp. 93–108.
ICSM-2008-Zhu #analysis #fault: Goal trees and fault trees for root cause analysis (QZ), pp. 436–439.
STOC-2008-CoteMP #random: Randomized k-server on hierarchical binary trees (AC, AM, LJP), pp. 227–234.
STOC-2008-DasguptaF #random: Random projection trees and low dimensional manifolds (SD, YF), pp. 537–546.
STOC-2008-GopalanKK #learning: Agnostically learning decision trees (PG, ATK, ARK), pp. 527–536.
STOC-2008-Thorup: Minimum k-way cuts via deterministic greedy tree packing (MT), pp. 159–166.
AFL-2008-DassowT: Subregularly Tree Controlled Grammars and Languages (JD, BT), pp. 158–169.
CIAA-2008-AbdullaBHKV #automaton #bisimulation: Composed Bisimulation for Tree Automata (PAA, AB, LH, LK, TV), pp. 212–222.
CIAA-2008-BouajjaniHHTV #automaton #finite #nondeterminism #testing: Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata (AB, PH, LH, TT, TV), pp. 57–67.
CIAA-2008-EsikI #game studies #logic: Games for Temporal Logics on Trees (ZÉ, SI), pp. 191–200.
CIAA-2008-Fujiyoshi #automaton #context-free grammar: Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees (AF), pp. 283–285.
CIAA-2008-InabaHM #metaprogramming #multi #transducer: Multi-Return Macro Tree Transducers (KI, HH, SM), pp. 102–111.
CIAA-2008-Maletti: Tree-Series-to-Tree-Series Transformations (AM), pp. 132–140.
DLT-2008-EngelfrietLM #bottom-up #multi #transducer: Extended Multi Bottom-Up Tree Transducers (JE, EL, AM), pp. 289–300.
DLT-2008-EsparzaKL #analysis #fixpoint: Derivation Tree Analysis for Accelerated Fixed-Point Computation (JE, SK, ML), pp. 301–313.
DLT-2008-FiliotTT #automaton #constraints: Tree Automata with Global Constraints (EF, JMT, ST), pp. 314–326.
DLT-2008-KuskeM #automaton #regular expression: Construction of Tree Automata from Regular Expressions (DK, IM), pp. 491–503.
ICALP-A-2008-FialaGK #complexity #distance #problem: Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract) (JF, PAG, JK), pp. 294–305.
ICALP-A-2008-GrecoS #game studies: Tree Projections: Hypergraph Games and Minimality (GG, FS), pp. 736–747.
ICALP-A-2008-LaberM #algorithm #approximate: An Approximation Algorithm for Binary Searching in Trees (ESL, MM), pp. 459–471.
ICALP-B-2008-BojanczykS #first-order #logic #quantifier: Tree Languages Defined in First-Order Logic with One Quantifier Alternation (MB, LS), pp. 233–245.
LATA-2008-Bojanczyk #automaton: Tree-Walking Automata (MB), pp. 1–2.
LATA-2008-ChampavereGLN #automaton #performance: Efficient Inclusion Checking for Deterministic Tree Automata and DTDs (JC, RG, AL, JN), pp. 184–195.
LATA-2008-KallmeyerP #component #multi #on the #tuple: On the Relation between Multicomponent Tree Adjoining Grammars with Tree Tuples (TT-MCTAG) and Range Concatenation Grammars (RCG) (LK, YP), pp. 263–274.
LATA-2008-Maletti #automaton: Minimizing Deterministic Weighted Tree Automata (AM), pp. 357–372.
ICFP-2008-AdamsD #graph #performance #similarity: Efficient nondestructive equality checking for trees and graphs (MDA, RKD), pp. 179–188.
SOFTVIS-2008-Almeida-MartinezUV #abstract syntax tree #named #syntax #visualisation: VAST: visualization of abstract syntax trees within language processors courses (FJAM, JUF, JÁVI), pp. 209–210.
SOFTVIS-2008-ThompsonPAH #polynomial #visualisation: Visualizing the computation tree of the Tutte Polynomial (BT, DJP, CA, GH), pp. 211–212.
ICEIS-DISI-2008-Chen #evaluation #query #xml: Tree Embedding and XML Query Evaluation (YC), pp. 173–178.
ICEIS-ISAS2-2008-Nikovski #concurrent #mining #process #representation #workflow: Workflow Trees for Representation and Mining of Implicitly Concurrent Business Processes (DN), pp. 30–36.
CIKM-2008-BarskySTU #using: A new method for indexing genomes using on-disk suffix trees (MB, US, AT, CU), pp. 649–658.
CIKM-2008-ChenLWSHT #adaptation #named #ranking: Trada: tree based ranking function adaptation (KC, RL, CKW, GS, LPH, BLT), pp. 1143–1152.
CIKM-2008-PlacekTSDS #approach #heuristic #query: A heuristic approach for checking containment of generalized tree-pattern queries (PP, DT, SS, TD, TKS), pp. 551–560.
CIKM-2008-WuT #query #xml: Evaluating partial tree-pattern queries on XML streams (XW, DT), pp. 1409–1410.
ICML-2008-Nijssen #classification: Bayes optimal classification for decision trees (SN), pp. 696–703.
ICML-2008-SorokinaCRF #detection #interactive #statistics: Detecting statistical interactions with additive groves of trees (DS, RC, MR, DF), pp. 1000–1007.
ICPR-2008-Baradarani #segmentation #using: Moving object segmentation using the 9/7-10/8 dual-tree complex filter bank (AB), pp. 1–4.
ICPR-2008-Basak #adaptation #clustering #framework #online: Online adaptive clustering in a decision tree framework (JB), pp. 1–4.
ICPR-2008-BelleDS #detection #random #realtime #recognition: Randomized trees for real-time one-step face detection and recognition (VB, TD, SS), pp. 1–4.
ICPR-2008-Ilic #recognition #using: Object labeling for recognition using vocabulary trees (SI), pp. 1–4.
ICPR-2008-Kopylov #image #programming: Tree-serial dynamic programming for image processing (AK), pp. 1–4.
ICPR-2008-PengXXD #recognition #using: Face recognition using anisotropic dual-tree complex wavelet packets (YP, XX, WX, QD), pp. 1–4.
ICPR-2008-Rokui #using: Tree-structure lossless coding using intervector angle (JR), pp. 1–4.
ICPR-2008-SpringerK #feature model: Feature selection via decision tree surrogate splits (CS, WPK), pp. 1–5.
ICPR-2008-WuWW #approach #estimation: Motion estimation approach based on dual-tree complex wavelets (CW, QW, HW), pp. 1–4.
ICPR-2008-ZhongGA #algorithm #classification: Properties of the k-norm pruning algorithm for decision tree classifiers (MZ, MG, GCA), pp. 1–4.
KDD-2008-BifetG #adaptation #data type #mining: Mining adaptively frequent closed unlabeled rooted trees in data streams (AB, RG), pp. 34–42.
KDD-2008-FanZCGYHYV #mining #modelling: Direct mining of discriminative and essential frequent patterns via model-based search tree (WF, KZ, HC, JG, XY, JH, PSY, OV), pp. 230–238.
SIGIR-2008-Liu #dependence #information retrieval: Exploring and measuring dependency trees for information retrieval (CL), p. 892.
SIGIR-2008-PanTLL #classification #kernel #semantics: Question classification with semantic tree kernel (YP, YT, LL, YL), pp. 837–838.
SAC-2008-RochaR #animation #evaluation #using: An evaluation of a collision handling system using sphere-trees for plausible rigid body animation (RdSR, MAFR), pp. 1241–1245.
SAC-2008-SilvaBBVMP #fuzzy: Fuzzy and neuro-fuzzy estimates of the total height of eucalyptus trees (RMdAS, FGB, GBB, FLV, ARdM, DMP), pp. 1772–1776.
SAC-2008-XiangYLW #implementation #memory management #reliability: A reliable B-tree implementation over flash memory (XX, LY, ZL, PW), pp. 1487–1491.
SLE-2008-OverbeyJ #abstract syntax tree #generative #syntax: Generating Rewritable Abstract Syntax Trees (JLO, REJ), pp. 114–133.
PPoPP-2008-TatikondaP #adaptation #approach #architecture #manycore #memory management #mining: An adaptive memory conscious approach for mining frequent trees: implications for multi-core architectures (ST, SP), pp. 263–264.
CSL-2008-ColcombetL #calculus #problem #μ-calculus: The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem (TC, CL), pp. 416–430.
CSL-2008-Place #logic: Characterization of Logics over Ranked Tree Languages (TP), pp. 401–415.
ICST-2008-BousquetS #inheritance: Relation between Depth of Inheritance Tree and Number of Methods to Test (LdB, MRS), pp. 161–170.
IJCAR-2008-BouhoulaJ #automation #automaton #induction: Automated Induction with Constrained Tree Automata (AB, FJ), pp. 539–554.
IJCAR-2008-BoyerGJ #automaton: Certifying a Tree Automata Completion Checker (BB, TG, TPJ), pp. 523–538.
ISSTA-2008-SankaranarayananCIG #learning: Dynamic inference of likely data preconditions over predicates by tree learning (SS, SC, FI, AG), pp. 295–306.
LICS-2008-BojanczykSS: Piecewise Testable Tree Languages (MB, LS, HS), pp. 442–451.
LICS-2008-Grohe08a: Definable Tree Decompositions (MG), pp. 406–417.
RTA-2008-HendrixO #automaton #equation: Combining Equational Tree Automata over AC and ACI Theories (JH, HO), pp. 142–156.
RTA-2008-KobayashiO #automaton: Tree Automata for Non-linear Arithmetic (NK, HO), pp. 291–305.
RTA-2008-KuhlmannN #automaton #logic #order: Logics and Automata for Totally Ordered Trees (MK, JN), pp. 217–231.
ASE-2007-SmithGKS #reduction #testing: Test suite reduction and prioritization with call trees (AMS, JG, GMK, MLS), pp. 539–540.
CASE-2007-LeungG #behaviour #locality #multi: Multi-Robot Localization and Mapping Strategy: Utilizing Behavior Based Dynamic Tree Structure and Observer-explorer Routine (KKKL, GG), pp. 881–886.
DAC-2007-ChenYCHL #algorithm #design #metaprogramming #named: MP-trees: A Packing-Based Macro Placement Algorithm for Mixed-Size Designs (TCC, PHY, YWC, FJH, DL), pp. 447–452.
DATE-2007-ButtSRPS #optimisation #synthesis: System level clock tree synthesis for power optimization (SAB, SS, JR, AP, ES), pp. 1677–1682.
DATE-2007-NarayananHMCZ #classification #implementation #interactive: Interactive presentation: An FPGA implementation of decision tree classification (RN, DH, GM, ANC, JZ), pp. 189–194.
DATE-2007-VermaI #automation #scalability #synthesis: Automatic synthesis of compressor trees: reevaluating large counters (AKV, PI), pp. 443–448.
ICDAR-2007-JiangDR #recognition: A Suffix Tree Based Handwritten Chinese Address Recognition System (YJ, XD, ZR), pp. 292–296.
PODS-2007-Alur #word: Marrying words and trees (RA), pp. 233–242.
PODS-2007-ChakaravarthyPRAM #algorithm #approximate #identification: Decision trees for entity identification: approximation algorithms and hardness results (VTC, VP, SR, PA, MKM), pp. 53–62.
PODS-2007-EngelfrietHS #transducer #xml: XML transformation by tree-walking transducers with invisible pebbles (JE, HJH, BS), pp. 63–72.
SIGMOD-2007-LeonardiB #database #detection #named #relational #xml: XANADUE: a system for detecting changes to XML data in tree-unaware relational databases (EL, SSB), pp. 1137–1140.
SIGMOD-2007-PhoophakdeeZ: Genome-scale disk-based suffix tree indexing (BP, MJZ), pp. 833–844.
VLDB-2007-BiveinisSJ #in memory #performance: Main-Memory Operation Buffering for Efficient R-Tree Update (LB, SS, CSJ), pp. 591–602.
VLDB-2007-ZhaoYY #graph: Graph Indexing: Tree + Delta >= Graph (PZ, JXY, PSY), pp. 938–949.
WRLA-2006-Reilles07 #abstract syntax tree #canonical #syntax: Canonical Abstract Syntax Trees (AR), pp. 165–179.
FoSSaCS-2007-Comon-LundhJP #automaton #constraints #memory management: Tree Automata with Memory, Visibility and Structural Constraints (HCL, FJ, NP), pp. 168–182.
TACAS-2007-AlurCC #model checking: Model Checking on Trees with Path Equivalences (RA, PC, SC), pp. 664–678.
STOC-2007-HariharanKPB #algorithm #graph: An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs (RH, TK, DP, AB), pp. 605–614.
STOC-2007-SinghL #approximate #bound: Approximating minimum bounded degree spanning trees to within one of optimal (MS, LCL), pp. 661–670.
CIAA-J-2006-AbdullaHK07 #automaton #bisimulation: Bisimulation Minimization of Tree Automata (PAA, JH, LK), pp. 699–713.
CIAA-2007-CarrascoDF #automaton #implementation: An Implementation of Deterministic Tree Automata Minimization (RCC, JD, MLF), pp. 122–129.
CIAA-2007-HogbergMM #automaton #bisimulation: Backward and Forward Bisimulation Minimisation of Tree Automata (JH, AM, JM), pp. 109–121.
CIAA-2007-SteinbyT #morphism: Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms (MS, CIT), pp. 265–276.
DLT-2007-HogbergMM #automaton #bisimulation: Bisimulation Minimisation for Weighted Tree Automata (JH, AM, JM), pp. 229–241.
ICALP-2007-BjorklundB #bound: Bounded Depth Data Trees (HB, MB), pp. 862–874.
ICALP-2007-Colcombet #combinator #theorem: A Combinatorial Theorem for Trees (TC), pp. 901–912.
ICALP-2007-DemaineMRW #algorithm #composition #distance #edit distance: An Optimal Decomposition Algorithm for Tree Edit Distance (EDD, SM, BR, OW), pp. 146–157.
ICALP-2007-HasuoJU #category theory: Categorical Views on Computations on Trees (Extended Abstract) (IH, BJ, TU), pp. 619–630.
ICALP-2007-HeMR: Succinct Ordinal Trees Based on Tree Covering (MH, JIM, SSR), pp. 509–520.
ICALP-2007-KariantoL #automaton: Unranked Tree Automata with Sibling Equalities and Disequalities (KW, CL), pp. 875–887.
LATA-2007-AntoniouCIP #set #string: Application of suffix trees for the acquisition of common motifs with gaps in a set of strings (PA, MC, CSI, PP), pp. 57–66.
LATA-2007-Maletti #composition #top-down #transducer: Compositions of Extended Top-down Tree Transducers (AM), pp. 379–390.
LATA-2007-OgasawaraK #approximate #performance #product line: Stochastically Approximating Tree Grammars by Regular Grammars and Its Application to Faster ncRNA Family Annotation (KO, SK), pp. 461–472.
IFM-2007-ColvinGW #behaviour #probability: Probabilistic Timed Behavior Trees (RC, LG, KW), pp. 156–175.
DHM-2007-XiangZ #retrieval: Motion Retrieval Based on Temporal-Spatial Features by Decision Tree (JX, HZ), pp. 224–233.
HCI-IPT-2007-LiuS #classification #interactive #visual notation: Interactive Visual Decision Tree Classification (YL, GS), pp. 92–105.
HIMI-MTT-2007-LeeL #design #navigation: Integrated Physically Based Manipulation and Decision-Making Tree for Navigation to Support Design Rationale (JHL, TCL), pp. 480–489.
HIMI-MTT-2007-ShiIL #query #using #visual notation: Facilitating Visual Queries in the TreeMap Using Distortion Techniques (KS, PI, PCL), pp. 345–353.
ICEIS-AIDSS-2007-YingboJJ #learning #predict #process #using #workflow: Using Decision Tree Learning to Predict Workflow Activity Time Consumption (YL, JW, JS), pp. 69–75.
ICEIS-DISI-2007-BottcherO #architecture #commit: Dynamic commit tree management for service oriented architectures (SB, SO), pp. 95–101.
ICEIS-DISI-2007-GorawskiF #hybrid #named: STAH-TREE: Hybrid index for spatio temporal aggregation (MG, MF), pp. 113–118.
ICEIS-DISI-2007-TraversD #graph #optimisation #perspective #xquery: An extensible rule transformation model for XQuery optimization — rules pattern for XQuery tree graph view (NT, TTDN), pp. 351–358.
ICEIS-EIS-2007-LiHG #modelling #named #process #visual notation: EML: A Tree Overlay-Based Visual Language for Business Process Modelling (RLL, JGH, JCG), pp. 131–137.
CIKM-2007-BhowmickLS #evaluation #performance #xml: Efficient evaluation of high-selective xml twig patterns with parent child edges in tree-unaware rdbms (SSB, EL, HS), pp. 673–682.
CIKM-2007-EavisL #estimation #multi #named: Rk-hist: an r-tree based histogram for multi-dimensional selectivity estimation (TE, AL), pp. 475–484.
CIKM-2007-GuoCXW #maintenance #online #performance #using: Efficient on-line index maintenance for dynamic text collections by using dynamic balancing tree (RG, XC, HX, BW), pp. 751–760.
CIKM-2007-LvC #concept #information retrieval #named #peer-to-peer #semantics: CTO: concept tree based semantic overlay for pure peer-to-peer information retrieval (JL, XC), pp. 931–934.
ECIR-2007-Monz #learning #query: Model Tree Learning for Query Term Weighting in Question Answering (CM), pp. 589–596.
ICML-2007-KirshnerS #infinity: Infinite mixtures of trees (SK, PS), pp. 417–423.
ICML-2007-Shah #bound: Sample compression bounds for decision trees (MS), pp. 799–806.
ICML-2007-SternHG #game studies #learning: Learning to solve game trees (DHS, RH, TG), pp. 839–846.
KDD-2007-HeikinheimoSHMM #set: Finding low-entropy sets and trees from binary data (HH, JKS, EH, HM, TM), pp. 350–359.
KDD-2007-NijssenF #mining: Mining optimal decision trees from itemset lattices (SN, ÉF), pp. 530–539.
KDD-2007-VogelAS #linear #scalability: Scalable look-ahead linear regression trees (DSV, OA, TS), pp. 757–764.
MLDM-2007-AoYHH #data type #mining: Mining Maximal Frequent Itemsets in Data Streams Based on FP-Tree (FA, YY, JH, KH), pp. 479–489.
MLDM-2007-HuWW #clustering: Varying Density Spatial Clustering Based on a Hierarchical Tree (XH, DW, XW), pp. 188–202.
MLDM-2007-SunV #using: Data Selection Using SASH Trees for Support Vector Machines (CS, RV), pp. 286–295.
MLDM-2007-WangLYC #classification #data type #fuzzy #incremental #mining: An Incremental Fuzzy Decision Tree Classification Method for Mining Data Streams (TW, ZL, YY, HC), pp. 91–103.
SEKE-2007-AlencarRSF #classification #modelling #probability #project management: Combining Decorated Classification Trees with RCPS Stochastic Models to Gain New Valuable Insights into Software Project Management (AJA, GGR, EAS, ALF), pp. 151–156.
SEKE-2007-YasudaM #concurrent: Tree Hash Under Concurrency Control (KY, TM), pp. 574–579.
SIGIR-2007-ZhangZW #detection: New event detection based on indexing-tree and named entity (KZ, JZ, LGW), pp. 215–222.
QAPL-2007-BaltazarMNP #logic #probability: Exogenous Probabilistic Computation Tree Logic (PB, PM, RN, NP), pp. 95–110.
QAPL-2007-BistarelliMRS #constraints #graph #logic programming #modelling #multi #using: Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming (SB, UM, FR, FS), pp. 111–127.
SAC-2007-DjelloulDF #constraints #finite #first-order #infinity #prolog #theorem proving #towards #unification #using: Toward a first-order extension of Prolog’s unification using CHR: a CHR first-order constraint solver over finite or infinite trees (KD, TBHD, TWF), pp. 58–64.
SAC-2007-Knijf #mining #named: FAT-miner: mining frequent attribute trees (JDK), pp. 417–422.
SAC-2007-LiuT #game studies #random: Eigen-distribution on assignments for game trees with random properties (CL, KT), pp. 78–79.
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-JiangMSG #detection #named #scalability: DECKARD: Scalable and Accurate Tree-Based Detection of Code Clones (LJ, GM, ZS, SG), pp. 96–105.
CC-2007-ScholzB #analysis #composition #data flow #framework #using: A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees (BS, JB), pp. 202–217.
CSL-2007-CarayolL #infinity #order: MSO on the Infinite Binary Tree: Choice and Order (AC, CL), pp. 161–176.
CSL-2007-FiliotTT #logic #satisfiability: Satisfiability of a Spatial Logic with Tree Variables (EF, JMT, ST), pp. 130–145.
CSL-2007-HertelU #game studies: Game Characterizations and the PSPACE-Completeness of Tree Resolution Space (AH, AU), pp. 527–541.
LICS-2007-Bojanczyk #logic: Two-way unary temporal logic over trees (MB), pp. 121–130.
LICS-2007-JurdzinskiL #calculus #μ-calculus: Alternation-free modal μ-calculus for data trees (MJ, RL), pp. 131–140.
LICS-2007-MontanariP: A Contraction Method to Decide MSO Theories of Deterministic Trees (AM, GP), pp. 141–150.
LICS-2007-Nguyen #proving: Separating DAG-Like and Tree-Like Proof Systems (PN), pp. 235–244.
SAT-2007-Kojevnikov #bound #linear: Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities (AK), pp. 70–79.
ASE-2006-HassanZ #certification #predict #using: Using Decision Trees to Predict the Certification Result of a Build (AEH, KZ), pp. 189–198.
CASE-2006-ZhouYZJDP #design #fault #network: Design of Dynamic Systems Based on Dynamic Fault Trees and Neural Networks (ZZ, ZY, JZ, GJ, DD, ZP), pp. 124–128.
DAC-2006-AlpertKSW: Timing-driven Steiner trees are (practically) free (CJA, ABK, CCNS, QW), pp. 389–392.
DAC-2006-VrankenGGSH #detection #fault: Fault detection and diagnosis with parity trees for space compaction of test responses (HPEV, SKG, AG, JS, FH), pp. 1095–1098.
DAC-2006-YuhYC #using: Placement of digital microfluidic biochips using the t-tree formulation (PHY, CLY, YWC), pp. 931–934.
DAC-2006-ZhouM #energy #estimation: Elmore model for energy estimation in RC trees (QZ, KM), pp. 965–970.
DATE-2006-ChakrabortySDMMP #bound #optimisation: Thermal resilient bounded-skew clock tree optimization methodology (AC, PS, KD, AM, EM, MP), pp. 832–837.
DATE-2006-HuangG #fault: Diagnosis of defects on scan enable and clock trees (YH, KG), pp. 436–437.
DATE-2006-KruppM #classification #functional #random testing #testing: Classification trees for random tests and functional coverage (AK, WM), pp. 1031–1032.
DocEng-2006-LindholmKT #difference #performance #sequence #xml: Fast and simple XML tree differencing by sequence alignment (TL, JK, ST), pp. 75–84.
PODS-2006-BenderFK #string: Cache-oblivious string B-trees (MAB, MFC, BCK), pp. 233–242.
PODS-2006-BojanczykDMSS #logic #reasoning #xml: Two-variable logic on data trees and XML reasoning (MB, CD, AM, TS, LS), pp. 10–19.
PODS-2006-Koch #query: Processing queries on tree-structured data efficiently (CK), pp. 213–224.
SIGMOD-2006-JagadishOTVZ #multi #network #peer-to-peer: Speeding up search in peer-to-peer networks with a multi-way tree structure (HVJ, BCO, KLT, QHV, RZ), pp. 1–12.
SIGMOD-2006-PapaemmanouilACJY #optimisation: Extensible optimization in overlay dissemination trees (OP, YA, UÇ, JJ, YY), pp. 611–622.
SIGMOD-2006-PapaemmanouilACJY06a #named: XPORT: extensible profile-driven overlay routing trees (OP, YA, UÇ, JJ, YY), pp. 769–771.
VLDB-2006-ChenLTHAC #bottom-up #documentation #named #query #stack #xml: Twig2Stack: Bottom-up Processing of Generalized-Tree-Pattern Queries over XML Documents (SC, HGL, JT, WPH, DA, KSC), pp. 283–294.
VLDB-2006-KanneM #algorithm #approximate #clustering #linear: A Linear Time Algorithm for Optimal Tree Sibling Partitioning and Approximation Algorithms in Natix (CCK, GM), pp. 91–102.
VLDB-2006-LakshmananWZ #query #using: Answering Tree Pattern Queries Using Views (LVSL, WHW, Z(Z), pp. 571–582.
VLDB-2006-MoerkotteN #algorithm #analysis #generative #programming: Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products (GM, TN), pp. 930–941.
VLDB-2006-ZhengFCGKD #algorithm #data transformation #named #re-engineering: Crimson: A Data Management System to Support Evaluating Phylogenetic Tree Reconstruction Algorithms (YZ, SF, SC, SG, JK, SBD), pp. 1231–1234.
ITiCSE-2006-ListerSTWP #taxonomy: Not seeing the forest for the trees: novice programmers and the SOLO taxonomy (RL, BS, ET, JLW, CP), pp. 118–122.
FoSSaCS-2006-LuttgenV #process #semantics: Conjunction on Processes: Full-Abstraction Via Ready-Tree Semantics (GL, WV), pp. 261–276.
TACAS-2006-HabermehlIV #source code #verification: Automata-Based Verification of Programs with Tree Updates (PH, RI, TV), pp. 350–364.
ICSM-2006-NeedhamJ #fault #metric: A Software Fault Tree Metric (DN, SJ), pp. 401–410.
MSR-2006-KnabPB #fault #predict #source code: Predicting defect densities in source code files with decision tree learners (PK, MP, AB), pp. 119–125.
MSR-2006-SagerBPK #algorithm #detection #java #using: Detecting similar Java classes using tree algorithms (TS, AB, MP, CK), pp. 65–71.
WCRE-2006-KoschkeFF #clone detection #detection #syntax #using: Clone Detection Using Abstract Syntax Suffix Trees (RK, RF, PF), pp. 253–262.
PLDI-2006-ErtlCG #automaton #flexibility #on-demand #performance: Fast and flexible instruction selection with on-demand tree-parsing automata (MAE, KC, DG), pp. 52–60.
SAS-2006-BouajjaniHRV #data type #model checking: Abstract Regular Tree Model Checking of Complex Dynamic Data Structures (AB, PH, AR, TV), pp. 52–70.
SAS-2006-LoginovRS #algorithm #automation #verification: Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal Algorithm (AL, TWR, MS), pp. 261–279.
STOC-2006-FleischerKLS #multi #probability: Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree (LF, JK, SL, GS), pp. 663–670.
STOC-2006-NesetrilM #algorithm #linear: Linear time low tree-width partitions and algorithmic consequences (JN, POdM), pp. 391–400.
STOC-2006-Weitz #independence #set: Counting independent sets up to the tree threshold (DW), pp. 140–149.
FLOPS-2006-Tozawa #transducer #type checking #using #xml: XML Type Checking Using High-Level Tree Transducer (AT), pp. 81–96.
DLT-J-2005-FukagawaA06 #algorithm #comparison #performance: Fast Algorithms for Comparison of Similar Unordered Trees (DF, TA), pp. 703–729.
CIAA-2006-AbdullaKH #automaton #bisimulation: Bisimulation Minimization of Tree Automata (PAA, LK, JH), pp. 173–185.
CIAA-2006-MayK #automaton #named #tool support: Tiburon: A Weighted Tree Automata Toolkit (JM, KK), pp. 102–113.
DLT-2006-DrewesTEMW: Bag Context Tree Grammars (FD, CdT, SE, BvdM, APJvdW), pp. 226–237.
DLT-2006-Maletti #revisited: Hierarchies of Tree Series Transformations Revisited (AM), pp. 215–225.
ICALP-v1-2006-BlellochDHRSS #parametricity #re-engineering: Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction (GEB, KD, EH, RR, RS, SS), pp. 667–678.
ICALP-v1-2006-FerraginaGM: The Myriad Virtues of Wavelet Trees (PF, RG, GM), pp. 560–571.
ICALP-v1-2006-Fujito #algorithm #approximate #how: How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover (TF), pp. 431–442.
ICALP-v2-2006-BenediktK #query: Interpreting Tree-to-Tree Queries (MB, CK), pp. 552–564.
ICALP-v2-2006-Murlak: The Wadge Hierarchy of Deterministic Tree Languages (FM), pp. 408–419.
ICEIS-ISAS-2006-RoubtsovaR #requirements #reuse: A Feature Computation Tree Model to Specify Requirements and Reuse (EER, SAR), pp. 118–125.
CIKM-2006-TatikondaPK #algorithm #mining: TRIPS and TIDES: new algorithms for tree mining (ST, SP, TMK), pp. 455–464.
CIKM-2006-TerrovitisPVS: A combination of trie-trees and inverted files for the indexing of set-valued attributes (MT, SP, PV, TKS), pp. 728–737.
CIKM-2006-TheodoratosSDPS #graph #heuristic #query: Heuristic containment check of partial tree-pattern queries in the presence of index graphs (DT, SS, TD, PP, TKS), pp. 445–454.
ICML-2006-BeygelzimerKL #nearest neighbour: Cover trees for nearest neighbor (AB, SK, JL), pp. 97–104.
ICML-2006-GeurtsWd #kernel: Kernelizing the output of tree-based methods (PG, LW, FdB), pp. 345–352.
ICML-2006-HolmesJ: Looping suffix tree-based inference of partially observable hidden state (MPH, CLIJ), pp. 409–416.
ICPR-v1-2006-WongC06a #adaptation: Adaptive Processing of Face Emotion Tree Structures (JJW, SYC), pp. 1184–1187.
ICPR-v1-2006-XuSL #adaptation #behaviour #detection #monitoring: Tree Based Behavior Monitoring for Adaptive Fraud Detection (JX, AHS, QL), pp. 1208–1211.
ICPR-v2-2006-HorvathJZK #detection #higher-order: A Higher-Order Active Contour Model for Tree Detection (PH, IJ, JZ, ZK), pp. 130–133.
ICPR-v2-2006-RaoDX #modelling #programming: Joint Correspondence and Background Modeling Based on Tree Dynamic Programming (NIR, HD, GX), pp. 425–428.
ICPR-v3-2006-QiuH #graph #using: Graph Matching using Commute Time Spanning Trees (HQ, ERH), pp. 1224–1227.
ICPR-v4-2006-PhamS #approximate #classification #clustering #metric #performance: Metric tree partitioning and Taylor approximation for fast support vector classification (TVP, AWMS), pp. 132–135.
ICPR-v4-2006-PinaBB #recognition: Morphological recognition of the spatial patterns of olive trees (PP, TB, LPCB), pp. 845–848.
ICPR-v4-2006-TodorovicA #3d #classification #segmentation #using: 3D Texture Classification Using the Belief Net of a Segmentation Tree (ST, NA), pp. 33–36.
KDD-2006-FanMY #framework #performance #random #summary: A general framework for accurate and fast regression by data summarization in random decision trees (WF, JM, PSY), pp. 136–146.
KDD-2006-HashimotoAUKM #mining #order #performance #probability: A new efficient probabilistic model for mining labeled ordered trees (KH, KFAK, NU, MK, HM), pp. 177–186.
KR-2006-CroitoruC #algorithm #composition #concept #graph: A Tree Decomposition Algorithm for Conceptual Graph Projection (MC, EC), pp. 271–276.
SEKE-2006-SunZLT #component #composition #design #execution #framework #logic: Abstract Logic Tree based Framework for Component Based Solution Composition Design and Execution (WS, XZ, YL, ZT), pp. 268–273.
SEKE-2006-ZhaoGQC #abstraction #constraints #prolog #semantics: A Constraint-based Correct Call Pattern Semantics for Prolog as an Abstraction of Decorated Tree Semantics (LZ, TG, JQ, GC), pp. 359–362.
POPL-2006-Vouillon #polymorphism: Polymorphic regular tree types and patterns (JV), pp. 103–114.
RE-2006-ReiserW #multi #product line: Managing Highly Complex Product Families with Multi-Level Feature Trees (MOR, MW), pp. 146–155.
SAC-2006-BergerMD #categorisation #email #set: Exploiting partial decision trees for feature subset selection in e-mail categorization (HB, DM, MD), pp. 1105–1109.
SAC-2006-ChenSC #algorithm #evaluation #query: Tree inclusion algorithm, signatures and evaluation of path-oriented queries (YC, YS, YC), pp. 1020–1025.
SAC-2006-DjelloulD #constraints #finite #first-order #formal method #infinity: Solving first-order constraints in the theory of finite or infinite trees: introduction to the decomposable theories (KD, TBHD), pp. 7–14.
SAC-2006-NikovskiK #induction #personalisation #recommendation: Induction of compact decision trees for personalized recommendation (DN, VK), pp. 575–581.
SAC-2006-PettovelloF #graph #named #xml #xpath: MTree: an XML XPath graph index (PMP, FF), pp. 474–481.
SAC-2006-VenkateswaranS: Schemes for SR-Tree packing (JV, SRS), pp. 73–77.
SAC-2006-WongC #adaptation #recognition: Facial emotion recognition by adaptive processing of tree structures (JJW, SYC), pp. 23–30.
CAV-2006-AlurCM: Languages of Nested Trees (RA, SC, PM), pp. 329–342.
CSL-2006-Bagan #linear #query: MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay (GB), pp. 167–181.
CSL-2006-CarayolM #on the: On Rational Trees (AC, CM), pp. 225–239.
CSL-2006-Segoufin #automaton #infinity #logic #word: Automata and Logics for Words and Trees over an Infinite Alphabet (LS), pp. 41–57.
ICLP-2006-DaoD #constraints #first-order #formal method: Solving First-Order Constraints in the Theory of the Evaluated Trees (TBHD, KD), pp. 423–424.
IJCAR-2006-JacquemardRV #automaton #constraints #equation #similarity: Tree Automata with Equality Constraints Modulo Equational Theories (FJ, MR, LV), pp. 557–571.
LICS-2006-Ong #higher-order #model checking #on the #recursion: On Model-Checking Trees Generated by Higher-Order Recursion Schemes (CHLO), pp. 81–90.
MBT-2006-ConradK #classification #embedded: An Extension of the Classification-Tree Method for Embedded Systems for the Description of Events (MC, AK), pp. 3–11.
RTA-2006-HendrixOV #automaton: Propositional Tree Automata (JH, HO, MV), pp. 50–65.
ASE-2005-VisserPP #abstraction #generative #using: Test input generation for red-black trees using abstraction (WV, CSP, RP), pp. 414–417.
DAC-2005-NiehHH: Minimizing peak current via opposite-phase clock tree (YTN, SHH, SYH), pp. 182–185.
DAC-2005-TamH: Power optimal dual-Vdd buffered tree considering buffer stations and blockages (KHT, LH), pp. 497–502.
DATE-2005-HeniaE #analysis #distributed #scheduling: Context-Aware Scheduling Analysis of Distributed Systems with Tree-Shaped Task-Dependencies (RH, RE), pp. 480–485.
ICDAR-2005-MarinaiMS #documentation #image #layout #reduction #retrieval: Layout based document image retrieval by means of XY tree reduction (SM, EM, GS), pp. 432–436.
ICDAR-2005-VargaB: Tree Structure forWord Extraction from Handwritten Text Lines (TV, HB), pp. 352–356.
PODS-2005-ManethBPS #metaprogramming #transducer #type checking #xml: XML type checking with macro tree transducers (SM, AB, TP, HS), pp. 283–294.
SIGMOD-2005-SunWSZ #online: Online B-tree Merging (XS, RW, BS, CZ), pp. 335–346.
SIGMOD-2005-YangKT #evaluation #similarity: Similarity Evaluation on Tree-structured Data (RY, PK, AKHT), pp. 754–765.
VLDB-2005-JagadishOV #named #network #peer-to-peer: BATON: A Balanced Tree Structure for Peer-to-Peer Networks (HVJ, BCO, QHV), pp. 661–672.
VLDB-2005-MoroVT #lightweight #query #xml: Tree-Pattern Queries on a Lightweight XML Processor (MMM, ZV, VJT), pp. 205–216.
VLDB-2005-PaparizosJ #algebra #question #sequence #set: Pattern Tree Algebras: Sets or Sequences? (SP, HVJ), pp. 349–360.
TACAS-2005-AbdullaLdR #transducer: Simulation-Based Iteration of Tree Transducers (PAA, AL, Jd, AR), pp. 30–44.
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.
STOC-2005-BojanczykC #automaton #regular expression: Tree-walking automata do not recognize all regular languages (MB, TC), pp. 234–243.
STOC-2005-ElkinEST: Lower-stretch spanning trees (ME, YE, DAS, SHT), pp. 494–503.
STOC-2005-JiaLNRS #approximate #set: Universal approximations for TSP, Steiner tree, and set cover (LJ, GL, GN, RR, RS), pp. 386–395.
DLT-J-2004-Maletti05 #automaton #transducer: Relating tree series transducers and weighted tree automata (AM), pp. 723–741.
CIAA-2005-FujiyoshiK #automaton #linear #recognition: Deterministic Recognition of Trees Accepted by a Linear Pushdown Tree Automaton (AF, IK), pp. 129–140.
CIAA-2005-Hogberg #generative #music #transducer: Wind in the Willows — Generating Music by Means of Tree Transducers (JH), pp. 153–162.
CIAA-2005-LohreyM #automaton #xpath: Tree Automata and XPath on Compressed Trees (ML, SM), pp. 225–237.
CIAA-2005-Rytter #fibonacci #graph #word: The Structure of Subword Graphs and Suffix Trees of Fibonacci Words (WR), pp. 250–261.
CIAA-2005-SudaH #algorithm #automaton #backtracking #top-down: Non-backtracking Top-Down Algorithm for Checking Tree Automata Containment (TS, HH), pp. 294–306.
DLT-2005-Maletti #power of #transducer: The Power of Tree Series Transducers of Type I and II (AM), pp. 338–349.
ICALP-2005-Ambuhl #algorithm #bound #energy #network #performance: An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks (CA), pp. 1139–1150.
ICALP-2005-BilleG #performance #problem: The Tree Inclusion Problem: In Optimal Space and Faster (PB, ILG), pp. 66–77.
ICALP-2005-GuptaP #probability: Stochastic Steiner Trees Without a Root (AG, MP), pp. 1051–1063.
ICALP-2005-Libkin #bibliography #logic #perspective: Logics for Unranked Trees: An Overview (LL), pp. 35–50.
IFM-2005-GrunskeLYW #analysis #automation #behaviour #design #specification: An Automated Failure Mode and Effect Analysis Based on High-Level Design Specification with Behavior Trees (LG, PAL, NY, KW), pp. 129–149.
IFL-2005-WeeldenSP #syntax: Polytypic Syntax Tree Operations (AvW, SS, RP), pp. 142–159.
VISSOFT-2005-FalkeKKQ #dependence #visualisation: The Dominance Tree in Visualizing Software Dependencies (RF, RK, RK, JQ), pp. 83–88.
CAiSE-2005-TheodoratosD #graph #query #using: Querying Tree-Structured Data Using Dimension Graphs (DT, TD), pp. 201–215.
ICEIS-v1-2005-BekaiR #algebra #framework #xml: A Tree Based Algebra Framework for XML Data Systems (AEB, BNR), pp. 305–312.
ICEIS-v1-2005-ChenC #database #documentation #evaluation #on the #query: On the Tree Inclusion and Query Evaluation in Document Databases (YC, YC), pp. 182–190.
ICEIS-v1-2005-FengWM #clustering #hybrid: A Hybrid Clustering Criterion for R*-Tree on Business Data (YF, ZW, AM), pp. 346–352.
ICEIS-v1-2005-XuePQZ #database #hybrid #scalability #string: The Hybrid Digital Tree: A New Indexing Technique for Large String Databases (QX, SP, GQ, QZ), pp. 115–121.
ICEIS-v1-2005-YangLOA #generative #graph #named #xml: DWG2XML: Generating XML Nested Tree Structure from Directed Weighted Graph (KYY, ACWL, TÖ, RA), pp. 19–26.
ICEIS-v2-2005-Fu #using: Construction of Decision Trees Using Data Cube (LF), pp. 119–126.
CIKM-2005-HalachevST #sequence #using: Exact match search in sequence data using suffix trees (MH, NS, AT), pp. 123–130.
CIKM-2005-LianCNOA #locality #network #query: Localized routing trees for query processing in sensor networks (JL, LC, KN, MTÖ, GBA), pp. 259–260.
CIKM-2005-TheodoratosDKG #data flow #query #semantics #using: Semantic querying of tree-structured data sources using partially specified tree patterns (DT, TD, AK, NHG), pp. 712–719.
CIKM-2005-XiaoLHF #web: Slicing*-tree based web page transformation for small displays (XX, QL, DH, HF), pp. 303–304.
ICML-2005-BlockeelPS #learning #multi: Multi-instance tree learning (HB, DP, AS), pp. 57–64.
ICML-2005-GeurtsW #modelling: Closed-form dual perturb and combine for tree-based models (PG, LW), pp. 233–240.
ICML-2005-PoczosL #analysis #independence #using: Independent subspace analysis using geodesic spanning trees (BP, AL), pp. 673–680.
ICML-2005-RosellHRP #learning #why: Why skewing works: learning difficult Boolean functions with greedy tree learners (BR, LH, SR, DP), pp. 728–735.
KDD-2005-ChenH #analysis #classification #image #network: A Bayesian network classifier with inverse tree structure for voxelwise magnetic resonance image analysis (RC, EH), pp. 4–12.
KDD-2005-GoethalsHB #graph #mining #query: Mining tree queries in a graph (BG, EH, JVdB), pp. 61–69.
KDD-2005-KubicaMCJ #algorithm #multi #performance: A multiple tree algorithm for the efficient association of asteroid observations (JK, AWM, AJC, RJ), pp. 138–146.
KDD-2005-MorinagaAISA #dependence #mining #semantics: Key semantics extraction by dependency tree mining (SM, HA, TI, YS, SA), pp. 666–671.
MLDM-2005-BunkeDIK #analysis #graph #learning #predict: Analysis of Time Series of Graphs: Prediction of Node Presence by Means of Decision Tree Learning (HB, PJD, CI, MK), pp. 366–375.
MLDM-2005-KotsiantisTP #estimation #random: Bagging Random Trees for Estimation of Tissue Softness (SBK, GET, PEP), pp. 674–681.
MLDM-2005-VermaVV #approach #mining #using: Temporal Approach to Association Rule Mining Using T-Tree and P-Tree (KV, OPV, RV), pp. 651–659.
SIGIR-2005-HoweRM #documentation #recognition #retrieval #word: Boosted decision trees for word recognition in handwritten document retrieval (NRH, TMR, RM), pp. 377–383.
POPL-2005-CalcagnoGZ #logic: Context logic and tree update (CC, PG, UZ), pp. 271–282.
POPL-2005-FosterGMPS #approach #combinator #problem: Combinators for bi-directional tree transformations: a linguistic approach to the view update problem (JNF, MBG, JTM, BCP, AS), pp. 233–246.
SAC-2005-GamaMR #data type #learning: Learning decision trees from dynamic data streams (JG, PM, PPR), pp. 573–577.
SAC-2005-WangP #clustering: Tree-based clustering for gene expression data (BW, WP), pp. 204–205.
SAC-2005-XiaPLCS: Indexing continuously changing data with mean-variance tree (YX, SP, SL, RC, RS), pp. 1125–1132.
CADE-2005-OgawaHO #incremental #proving: Proving Properties of Incremental Merkle Trees (MO, EH, SO), pp. 424–440.
CAV-2005-BenediktBFV #optimisation #verification: Verification of Tree Updates for Optimization (MB, AB, SF, AV), pp. 379–393.
CSL-2005-Murlak #on the: On Deciding Topological Classes of Deterministic Tree Languages (FM), pp. 428–441.
LICS-2005-BarceloL #logic: Temporal Logics over Unranked Trees (PB, LL), pp. 31–40.
LICS-2005-BonevaTT #logic: Expressiveness of a Spatial Logic for Trees (IB, JMT, ST), pp. 280–289.
RTA-2005-BonevaT #automaton #logic: Automata and Logics for Unranked and Unordered Trees (IB, JMT), pp. 500–515.
RTA-2005-GeserHWZ #automaton #linear #on the #term rewriting #termination: On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems (AG, DH, JW, HZ), pp. 353–367.
SAT-2005-Benedetti #quantifier: Quantifier Trees for QBFs (MB), pp. 378–385.
TLCA-2005-AehligMO #decidability #higher-order #monad #recursion: The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable (KA, JGdM, CHLO), pp. 39–54.
DAC-2004-AlpertHHQ #flexibility #layout #performance #physics: Fast and flexible buffer trees that navigate the physical layout environment (CJA, MH, JH, STQ), pp. 24–29.
DAC-2004-LiYYYL #adaptation #algorithm #design #representation #using: A packing algorithm for non-manhattan hexagon/triangle placement design by using an adaptive o-tree representation (JL, TY, BY, JY, CL), pp. 646–651.
DAC-2004-Rodman #question: Forest vs. trees: where’s the slack? (PKR), p. 267.
PODS-2004-GottlobKS #query: Conjunctive Queries over Trees (GG, CK, KUS), pp. 189–200.
PODS-2004-Schwentick #automaton #xml: Trees, Automata and XML (TS), p. 222.
SIGMOD-2004-ArgeBHY #performance #worst-case: The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree (LA, MdB, HJH, KY), pp. 347–358.
SIGMOD-2004-MengJCW #framework #named #query: XSeq: An Index Infrastructure for Tree Pattern Queries (XM, YJ, YC, HW), pp. 941–942.
SIGMOD-2004-PaparizosWLJ #evaluation #logic #performance #xquery: Tree Logical Classes for Efficient Evaluation of XQuery (SP, YW, LVSL, HVJ), pp. 71–82.
VLDB-2004-Graefe: Write-Optimized B-Trees (GG), pp. 672–683.
VLDB-2004-JensenLO #performance #query: Query and Update Efficient B+-Tree Based Indexing of Moving Objects (CSJ, DL, BCO), pp. 768–779.
VLDB-2004-LakshmananRWZ #on the #query #satisfiability #testing: On Testing Satisfiability of Tree Pattern Queries (LVSL, GR, WHW, Z(Z), pp. 120–131.
VLDB-2004-LinKLLN #database #mining #monitoring #named #visual notation: VizTree: a Tool for Visually Mining and Monitoring Massive Time Series Databases (JL, EJK, SL, JPL, DMN), pp. 1269–1272.
VLDB-2004-MayerGKT #injection: An Injection of Tree Awareness: Adding Staircase Join to PostgreSQL (SM, TG, MvK, JT), pp. 1305–1308.
VLDB-2004-TataHP: Practical Suffix Tree Construction (ST, RAH, JMP), pp. 36–47.
FoSSaCS-2004-ManethB #transducer: Tree Transducers and Tree Compressions (SM, GB), pp. 363–377.
STOC-2004-CzumajS #metric: Estimating the weight of metric minimum spanning trees in sublinear-time (AC, CS), pp. 175–183.
STOC-2004-Elkin #approximate #bound #distributed #problem #trade-off: Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem (ME), pp. 331–340.
FLOPS-2004-IranzoL: Analysing Definitional Trees: Looking for Determinism (PJI, CVL), pp. 55–69.
CIAA-2004-Borchardt #transducer: Code Selection by Tree Series Transducers (BB), pp. 57–67.
DLT-2004-Maletti #automaton #transducer: Relating Tree Series Transducers and Weighted Tree Automata (AM), pp. 321–333.
ICALP-2004-BojanczykC #automaton: Tree-Walking Automata Cannot Be Determinized (MB, TC), pp. 246–256.
ICALP-2004-JothiR #algorithm #approximate #design #network #problem: Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design (RJ, BR), pp. 805–818.
ICALP-2004-MagniezR #testing: Property Testing of Regular Tree Languages (FM, MdR), pp. 932–944.
ICALP-2004-SeidlSMH #for free: Counting in Trees for Free (HS, TS, AM, PH), pp. 1136–1149.
IFM-2004-Winter #behaviour #csp #formal method: Formalising Behaviour Trees with CSP (KW), pp. 148–167.
AdaEurope-2004-BurgstallerBS #ada #on the #source code: On the Tree Width of Ada Programs (BB, JB, BS), pp. 78–90.
ICEIS-v1-2004-ZhouNB #c++ #implementation #performance #using: An Efficient B+-Tree Implementation in C++ Using the STL Style (JZ, BN, GB), pp. 163–168.
ICEIS-v2-2004-HamzaY #constraints #mining #regular expression #using: Mining Sequential Patterns with Regular Expression Constraints Using Sequential Pattern Tree (MH, KM, MY), pp. 116–121.
ICEIS-v2-2004-PerezMAG #algorithm: Consolidated Tree Construction Algorithm: Structurally Steady Trees (JMP, JM, OA, IG), pp. 14–21.
CIKM-2004-ZouLC #query #using #xml: Using a compact tree to index and query XML data (QZ, SL, WWC), pp. 234–235.
ICML-2004-DietterichAB #random: Training conditional random fields via gradient tree boosting (TGD, AA, YB).
ICML-2004-EsmeirM #algorithm #induction: Lookahead-based algorithms for anytime induction of decision trees (SE, SM).
ICML-2004-GramacyLM #parametricity #process: Parameter space exploration with Gaussian process trees (RBG, HKHL, WGM).
ICML-2004-KashimaT #algorithm #graph #kernel #learning #sequence: Kernel-based discriminative learning algorithms for labeling sequences, trees, and graphs (HK, YT).
ICML-2004-LingYWZ #low cost: Decision trees with minimal costs (CXL, QY, JW, SZ).
ICML-2004-Potts #incremental #learning #linear: Incremental learning of linear model trees (DP).
ICPR-v1-2004-BhowmickB #approximate #using: Approximate Fingerprint Matching Using Kd-Tree (PB, BBB), pp. 544–547.
ICPR-v1-2004-LangeG #2d #data type #effectiveness #recognition: Tree-Like Data Structures for Effective Recognition of 2-D Solids (ML, SG), pp. 592–595.
ICPR-v1-2004-TodorovicN #detection #image #using: Detection of Artificial Structures in Natural-Scene Images Using Dynamic Trees (ST, MCN), pp. 35–39.
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-Olson #clustering: Pose Clustering Guided by Short Interpretation Trees (CFO), pp. 149–152.
ICPR-v2-2004-SoiferKK #analysis #fuzzy: Fuzzy Direction Field Method for Fringe and Tree-like Patterns Analysis (VAS, AGK, AOK), pp. 779–782.
ICPR-v2-2004-TorselloHP #metric: Four Metrics for Efficiently Comparing Attributed Trees (AT, DH, MP), pp. 467–470.
ICPR-v2-2004-YinFD #framework #unification: A Unification Framework for Tree and Block Wavelet Encoders (XWY, MF, ACD), pp. 795–798.
ICPR-v3-2004-BadawyK #retrieval #using: Shape Retrieval using Concavity Trees (OEB, MK), pp. 111–115.
ICPR-v3-2004-IrnigerB #database #graph #using: Graph Database Filtering Using Decision Trees (CI, HB), pp. 383–388.
ICPR-v3-2004-LangsRRC #3d #modelling #visualisation: Building and Registering Parameterized 3D Models of Vessel Trees for Visualization during Intervention (GL, PR, DR, FC), pp. 726–729.
KDD-2004-Hooker #estimation: Diagnosing extrapolation: tree-based density estimation (GH), pp. 569–574.
SEKE-2004-YaoZY #framework: Level Construction of Decision Trees in a Partition-based Framework for Classi cation (YY, YZ, JY), pp. 199–204.
SAC-2004-AmorBE #detection #naive bayes: Naive Bayes vs decision trees in intrusion detection systems (NBA, SB, ZE), pp. 420–424.
SAC-2004-GamaMR #online: Forest trees for on-line data (JG, PM, RR), pp. 632–636.
SAC-2004-RahalP #approach #categorisation #using: An optimized approach for KNN text categorization using P-trees (IR, WP), pp. 613–617.
SAC-2004-RahmaniK #graph #strict: Degree restricted spanning trees of graphs (MSR, AK), pp. 225–228.
SAC-2004-RodriguezA: Interval and dynamic time warping-based decision trees (JJR, CJA), pp. 548–552.
SAC-2004-RuckertK #graph: Frequent free tree discovery in graph data (UR, SK), pp. 564–570.
SAC-2004-StamatakisLM #performance #scalability: A fast program for maximum likelihood-based inference of large phylogenetic trees (AS, TL, HM), pp. 197–201.
ICLP-2004-ErdemW #programming #set #using: Rectilinear Steiner Tree Construction Using Answer Set Programming (EE, MDFW), pp. 386–399.
ICLP-2004-Neugebauer #concurrent #constraints #modelling #programming: Concurrent Constraint Programming and Tree-Based Acoustic Modelling (MN), pp. 467–468.
LICS-2004-GrooteGS #automaton: Vector Addition Tree Automata (PdG, BG, SS), pp. 64–73.
RTA-2004-CarmeNT #automaton #query: Querying Unranked Trees with Stepwise Tree Automata (JC, JN, MT), pp. 105–118.
RTA-2004-Ketema #term rewriting: Böhm-Like Trees for Term Rewriting Systems (JK), pp. 233–248.
DAC-2003-DonnoIBM #optimisation: Clock-tree power optimization based on RTL clock-gating (MD, AI, LB, EM), pp. 622–627.
DAC-2003-LeeCHY #multi #scalability #using: Multilevel floorplanning/placement for large-scale modules using B*-trees (HCL, YWC, JMH, HHY), pp. 812–817.
DATE-2003-DrineasM #concurrent #detection #fault #monitoring: Non-Intrusive Concurrent Error Detection in FSMs through State/Output Compaction and Monitoring via Parity Trees (PD, YM), pp. 11164–11167.
DATE-2003-LaiYC #evaluation #performance: A New and Efficient Congestion Evaluation Model in Floorplanning: Wire Density Control with Twin Binary Trees (STWL, EFYY, CCNC), pp. 10856–10861.
DocEng-2003-Vion-Dury #towards #xml #xpath: XPath on left and right sides of rules: toward compact XML tree rewriting through node patterns (JYVD), pp. 19–25.
ICDAR-2003-BaldiMS #classification #set #using: Using tree-grammars for training set expansion in page classification (SB, SM, GS), pp. 829–833.
ICDAR-2003-LeeO #classification #multi #problem: Binary Classification Trees for Multi-class Classification Problems (JSL, ISO), pp. 770–774.
PODS-2003-GarofalakisK #correlation #data type #distance #edit distance #using #xml: Correlating XML data streams using tree-edit distance embeddings (MNG, AK), pp. 143–154.
SIGMOD-2003-LakshmananPZ #named #performance #semantics #summary: QC-Trees: An Efficient Summary Structure for Semantic OLAP (LVSL, JP, YZ), pp. 64–75.
SIGMOD-2003-WangPFY #named #query #xml: ViST: A Dynamic Index Method for Querying XML Data by Tree Structures (HW, SP, WF, PSY), pp. 110–121.
VLDB-2003-AnKR #performance: Improving Performance with Bulk-Inserts in Oracle R-Trees (NA, KVRK, SR), pp. 948–951.
VLDB-2003-ChenJLP #evaluation #performance #xquery: From Tree Patterns to Generalized Tree Patterns: On Efficient Evaluation of XQuery (ZC, HVJ, LVSL, SP), pp. 237–248.
VLDB-2003-Koch #approach #performance #query #xml: Efficient Processing of Expressive Node-Selecting Queries on XML Data in Secondary Storage: A Tree Automata-based Approach (CK), pp. 249–260.
VLDB-2003-LeeHJT #approach #bottom-up: Supporting Frequent Updates in R-Trees: A Bottom-Up Approach (MLL, WH, CSJ, BC, KLT), pp. 608–619.
VLDB-2003-PapadiasTS #predict #query: The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries (YT, DP, JS), pp. 790–801.
VLDB-2003-QianZXP #multi: The ND-Tree: A Dynamic Indexing Technique for Multidimensional Non-ordered Discrete Data Spaces (GQ, QZ, QX, SP), pp. 620–631.
ITiCSE-2003-BoshartK #user interface #xml: Growing a GUI from an XML tree (MAB, MJK), p. 223.
FoSSaCS-2003-CardelliGG: Manipulating Trees with Hidden Labels (LC, PG, GG), pp. 216–232.
FoSSaCS-2003-SprengerD #calculus #induction #on the #proving #reasoning #μ-calculus: On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the μ-Calculus (CS, MD), pp. 425–440.
SCAM-2003-KortL #re-engineering: Parse-Tree Annotations Meet Re-Engineering Concerns (JK, RL), p. 161–?.
STOC-2003-FakcharoenpholRT #approximate #bound #metric: A tight bound on approximating arbitrary metrics by tree metrics (JF, SR, KT), pp. 448–455.
DLT-2003-Borchardt #theorem: The Myhill-Nerode Theorem for Recognizable Tree Series (BB), pp. 146–158.
DLT-2003-CarmeGLTT #automaton #finite: Residual Finite Tree Automata (JC, RG, AL, AT, MT), pp. 171–182.
DLT-2003-DrewesH #education #learning: Learning a Regular Tree Language from a Teacher (FD, JH), pp. 279–291.
DLT-2003-Gecseg #automaton #set: Comments on Complete Sets of Tree Automata (FG), pp. 22–34.
DLT-2003-Rahonis #automaton #transducer: Alphabetic Pushdown Tree Transducers (GR), pp. 423–436.
ICALP-2003-ChekuriMS #multi: Multicommodity Demand Flow in a Tree (CC, MM, FBS), pp. 410–425.
ICALP-2003-KormanP: Labeling Schemes for Weighted Dynamic Trees (AK, DP), pp. 369–383.
ICALP-2003-Mutzel #data type #graph: The SPQR-Tree Data Structure in Graph Drawing (PM), pp. 34–46.
ICALP-2003-RamanR: Succinct Dynamic Dictionaries and Trees (RR, SSR), pp. 357–368.
FME-2003-Schafer #analysis #fault #model checking #realtime: Combining Real-Time Model-Checking and Fault Tree Analysis (AS), pp. 522–541.
AGTIVE-2003-FishH #constraints #diagrams: Computing Reading Trees for Constraint Diagrams (AF, JH), pp. 260–274.
ICEIS-v1-2003-BouchouALD #automaton #constraints #validation #xml: Extending Tree Automata to Model XML Validation Under Element and Attribute Constraints (BB, MHFA, DL, DD), pp. 184–190.
ICEIS-v2-2003-CamposGM #abduction #network #probability #using: Partial Abductive Inference in Bayesian Networks By Using Probability Trees (LMdC, JAG, SM), pp. 83–91.
ICML-2003-CerquidesM #learning #modelling #naive bayes: Tractable Bayesian Learning of Tree Augmented Naive Bayes Models (JC, RLdM), pp. 75–82.
ICML-2003-FernB #lazy evaluation: Boosting Lazy Decision Trees (XZF, CEB), pp. 178–185.
ICML-2003-LingY #ranking: Decision Tree with Better Ranking (CXL, RJY), pp. 480–487.
ICML-2003-YamadaSYT #data-driven #database #induction #standard: Decision-tree Induction from Time-series Data Based on a Standard-example Split Test (YY, ES, HY, KT), pp. 840–847.
KDD-2003-GamaRM #data type #mining #performance: Accurate decision trees for mining high-speed data streams (JG, RR, PM), pp. 523–528.
KDD-2003-GunduzO #behaviour #modelling #predict #representation #web: A Web page prediction model based on click-stream tree representation of user behavior (SG, MTÖ), pp. 535–540.
KDD-2003-JinA #performance #streaming: Efficient decision tree construction on streaming data (RJ, GA), pp. 571–576.
KDD-2003-NevilleJFH #learning #probability #relational: Learning relational probability trees (JN, DJ, LF, MH), pp. 625–630.
KDD-2003-TeohM #interactive #named #visualisation: PaintingClass: interactive construction, visualization and exploration of decision trees (STT, KLM), pp. 667–672.
MLDM-2003-CeciAM: Simplification Methods for Model Trees with Regression and Splitting Nodes (MC, AA, DM), pp. 20–34.
MLDM-2003-ComiteGT #learning #multi: Learning Multi-label Alternating Decision Trees from Texts and Data (FDC, RG, MT), pp. 35–49.
MLDM-2003-Scaringella #classification #on the: On the Size of a Classification Tree (AS), pp. 65–72.
SEKE-2003-BaumgartenBH: Tree-Growth based Sequential and Associative Pattern Discovery (MB, AGB, JGH), pp. 240–244.
SEKE-2003-LiWQ #algorithm #performance #recognition: A Fast Binary Tree Based Face Recognition Algorithm (HL, SW, FQ), pp. 594–598.
SIGIR-2003-ChoiK #concept #topic #using: Topic distillation using hierarchy concept tree (IC, MK), pp. 371–372.
PPDP-2003-Virseda #calculus: A demand-driven narrowing calculus with overlapping definitional trees (RdVV), pp. 253–263.
SAC-2003-HareJ #algorithm #problem #search-based: A Spanning Tree-Based Genetic Algorithm for Some Instances of the Rectilinear Steiner Problem with Obstacles (RMH, BAJ), pp. 725–729.
SAC-2003-RaidlJ #algorithm #bound #heuristic #problem: Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem (GRR, BAJ), pp. 747–752.
SAC-2003-ShouHT #realtime #visualisation: Supporting Real-time Visualization With The HDoV Tree (LS, ZH, KLT), pp. 966–971.
SAC-2003-YuNPC #classification #on the #testing: On the Use of the Classification-Tree Method by Beginning Software Testers (YTY, SPN, PLP, TYC), pp. 1123–1127.
LDTA-J-2001-KuipersV #object-oriented #traversal: Object-oriented tree traversal with JJForester (TK, JV), pp. 59–87.
HPCA-2003-GassendSCDD #memory management #performance #verification: Caches and Hash Trees for Efficient Memory Integrity Verification (BG, GES, DEC, MvD, SD), pp. 295–306.
CAV-2003-Obdrzalek #bound #calculus #model checking #performance #μ-calculus: Fast μ-Calculus Model Checking when Tree-Width Is Bounded (JO), pp. 80–92.
CSL-2003-GroheS #finite #monad #query: Comparing the Succinctness of Monadic Query Languages over Finite Trees (MG, NS), pp. 226–240.
CSL-2003-Krzeszczakowski #game studies: Pebble Games on Trees (LK), pp. 359–371.
ICLP-2003-Pientka #higher-order: Higher-Order Substitution Tree Indexing (BP), pp. 377–391.
LICS-2003-FrickGK #evaluation #query: Query Evaluation on Compressed Trees (Extended Abstract) (MF, MG, CK), p. 188–?.
LICS-2003-LibkinN #logic #query: Logical Definability and Query Languages over Unranked Trees (LL, FN), pp. 178–187.
RTA-2003-Dal-ZilioL #automaton #logic #xml: XML Schema, Tree Logic and Sheaves Automata (SDZ, DL), pp. 246–263.
RTA-2003-OhsakiST: Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism (HO, HS, TT), pp. 483–498.
RTA-2003-Verma #automaton #decidability #equation: Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties (KNV), pp. 180–196.
SAT-2003-BjesseKDSZ #satisfiability: Guiding SAT Diagnosis with Tree Decompositions (PB, JHK, RFD, TS, YZ), pp. 315–329.
DAC-2002-BadarogluTDWMVG #optimisation #reduction #using: Clock tree optimization in synchronous CMOS digital circuits for substrate noise reduction using folding of supply current transients (MB, KT, SD, PW, HDM, IV, GGEG), pp. 399–404.
DAC-2002-HrkicL #named #synthesis: S-Tree: a technique for buffered routing tree synthesis (MH, JL), pp. 578–583.
DATE-2002-Dubrova #composition #order: Composition Trees in Finding Best Variable Orderings for ROBDDs (ED), p. 1084.
DATE-2002-ZhuangKSJ: An Enhanced Q-Sequence Augmented with Empty-Room-Insertion and Parenthesis Trees (CZ, YK, KS, LJ), pp. 61–68.
PODS-2002-CohenKM #xml: Labeling Dynamic XML Trees (EC, HK, TM), pp. 271–281.
PODS-2002-Neven #on the #power of #query: On the Power of Walking for Querying Tree-Structured Data (FN), pp. 77–84.
PODS-2002-ShashaWG #algorithm #graph: Algorithmics and Applications of Tree and Graph Searching (DS, JTLW, RG), pp. 39–52.
SIGMOD-2002-BumbulisB: A compact B-tree (PB, ITB), pp. 533–541.
SIGMOD-2002-ChenGMV #optimisation #performance: Fractal prefetching B±Trees: optimizing both cache and disk performance (SC, PBG, TCM, GV), pp. 157–168.
SIGMOD-2002-KanthRA #comparison #using: Quadtree and R-tree indexes in oracle spatial: a comparison using GIS data (KVRK, SR, DA), pp. 546–557.
SIGMOD-2002-Ramanan #algorithm #performance #query: Efficient algorithms for minimizing tree pattern queries (PR), pp. 299–309.
VLDB-2002-BohannonGKNS #optimisation #query: Optimizing View Queries in ROLEX to Support Navigable Result Trees (PB, SG, HFK, PPSN, PS), pp. 119–130.
VLDB-2002-ChanFFGR #scalability #xml: Tree Pattern Aggregation for Scalable XML Data Dissemination (CYC, WF, PF, MNG, RR), pp. 826–837.
VLDB-2002-ChanGR #named #performance #regular expression: RE-Tree: An Efficient Index Structure for Regular Expressions (CYC, MNG, RR), pp. 263–274.
ESOP-2002-Glew #formal method #higher-order: A Theory of Second-Order Trees (NG), pp. 147–161.
FoSSaCS-2002-KnapikNU #automaton #higher-order: Higher-Order Pushdown Trees Are Easy (TK, DN, PU), pp. 205–222.
FoSSaCS-2002-Loding #infinity #model checking: Model-Checking Infinite Systems Generated by Ground Tree Rewriting (CL), pp. 280–294.
WCRE-2002-PowerM #approach #xml: Program Annotation in XML: A Parse-Tree Based Approach (JFP, BAM), p. 190–?.
STOC-2002-BrodalLMTT #pointer: Optimal finger search trees in the pointer machine (GSB, GL, CM, AKT, KT), pp. 583–591.
FLOPS-2002-CaballeroL: Dynamic-Cut with Definitional Trees (RC, FJLF), pp. 245–258.
CIAA-J-2000-Bruggemann-KleinW02 #automaton #nondeterminism: The Regularity of Two-Way Nondeterministic Tree Automata Languages (ABK, DW), pp. 67–81.
CIAA-2002-Fatholahzadeh #automaton #implementation: Implementation of Dictionaries via Automata and Decision Trees (AF), pp. 95–105.
ICALP-2002-GarganoHSV #bound #branch: Spanning Trees with Bounded Number of Branch Vertices (LG, PH, LS, UV), pp. 355–365.
ICALP-2002-OngG #game studies: Games Characterizing Levy-Longo Trees (CHLO, PDG), pp. 476–487.
CIKM-2002-ChongSDFYJTKJ: A mapping mechanism to support bitmap index and other auxiliary structures on tables stored as primary B±trees (EIC, JS, SD, CF, AY, MJ, ATT, RK, RJ), pp. 625–628.
CIKM-2002-NallapatiA #dependence #modelling #using: Capturing term dependencies using a language model based on sentence trees (RN, JA), pp. 383–390.
ICML-2002-FerriFH #learning #using: Learning Decision Trees Using the Area Under the ROC Curve (CF, PAF, JHO), pp. 139–146.
ICML-2002-Gama #analysis #functional: An Analysis of Functional Trees (JG), pp. 155–162.
ICML-2002-TakechiS #induction: Finding an Optimal Gain-Ratio Subset-Split Test for a Set-Valued Attribute in Decision Tree Induction (FT, ES), pp. 618–625.
ICPR-v1-2002-ChengCO #image #markov: A Trainable Hierarchical Hidden Markov Tree Model for Color Image Annotation (LC, TC, VO), pp. 192–195.
ICPR-v1-2002-CucchiaraGPSP #clustering #recursion: Building the Topological Tree by Recursive FCM Color Clustering (RC, CG, AP, SS, GP), pp. 759–762.
ICPR-v1-2002-DeschampsC #3d #performance: Fast Extraction of Tubular and Tree 3D Surfaces with Front Propagation Methods (TD, LDC), pp. 731–734.
ICPR-v1-2002-HarnsomburanaS #approach #database #feedback #hybrid #image #performance #retrieval: A Hybrid Tree Approach for Efficient Image Database Retrieval with Dynamic Feedback (JH, CRS), pp. 263–266.
ICPR-v1-2002-TorselloH: Shape-Space from Tree-Union (AT, ERH), pp. 188–191.
ICPR-v2-2002-Amin #learning #prototype #using: Prototyping Structural Description Using Decision Tree Learning Techniques (AA), pp. 76–79.
ICPR-v2-2002-ChoCWS #adaptation #classification #data type #image #learning #representation #robust: Robust Learning in Adaptive Processing of Data Structures for Tree Representation Based Image Classification (SYC, ZC, ZW, WCS), pp. 108–111.
ICPR-v2-2002-ForestiCS #adaptation #higher-order #pattern matching #pattern recognition #recognition: Adaptive High Order Neural Trees for Pattern Recognition (GLF, CM, LS), p. 877–?.
ICPR-v2-2002-WindeattA: Tree Pruning for Output Coded Ensembles (TW, GA), pp. 92–95.
ICPR-v2-2002-YeL #image #markov #modelling #segmentation #using: Wavelet-Based Unsupervised SAR Image Segmentation Using Hidden Markov Tree Models (ZY, CCL), pp. 729–732.
ICPR-v3-2002-Kwon #classification #clustering #using: Hangul Tree Classifier for Type Clustering Using Horizontal and Vertical Strokes (YBK), pp. 228–231.
ICPR-v4-2002-JainXHX #testing #using: Uniformity Testing Using Minimal Spanning Tree (AKJ, XX, TKH, FX), pp. 281–284.
KDD-2002-Boz #network: Extracting decision trees from trained neural networks (OB), pp. 456–461.
KDD-2002-DobraG #algorithm #linear #named #scalability: SECRET: a scalable linear regression tree algorithm (AD, JG), pp. 481–487.
KDD-2002-LiB #algorithm #classification: Instability of decision tree classification algorithms (RHL, GGB), pp. 570–575.
KDD-2002-Zaki #mining: Efficiently mining frequent trees in a forest (MJZ), pp. 71–80.
SEKE-2002-Morasca #classification #using: A proposal for using continuous attributes in classification trees (SM), pp. 417–424.
SIGIR-2002-VermaB #named #performance #query: K-tree/forest: efficient indexes for boolean queries (RMV, SB), pp. 433–434.
ECOOP-2002-Filman #encoding: Polychotomic Encoding: A Better Quasi-Optimal Bit-Vector Encoding of Tree Hierarchies (REF), pp. 545–561.
PADL-2002-GallagherP #abstract interpretation #analysis #automaton #finite #logic programming #nondeterminism #source code: Abstract Interpretation over Non-deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs (JPG, GP), pp. 243–261.
SAC-2002-DingDP #classification #data type #using: Decision tree classification of spatial data streams using Peano Count Trees (QD, QD, WP), pp. 413–417.
SAC-2002-DingKRP #algebra: The P-tree algebra (QD, MK, AR, WP), pp. 426–431.
SAC-2002-FuTS #algorithm #similarity: Node splitting algorithms in tree-structured high-dimensional indexes for similarity search (YF, JCT, SRS), pp. 766–770.
SAC-2002-JulstromR #algorithm #robust #set: Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges (BAJ, GRR), pp. 547–552.
SAC-2002-Jurjens02a #development #using: Using UMLsec and goal trees for secure systems development (JJ), pp. 1026–1030.
SAC-2002-WatanabeM #order: Reordering B-tree files (SW, TM), pp. 681–686.
ICSE-2002-GraunkeK #control flow #flexibility #user interface #visual notation: Advanced control flows for flexible graphical user interfaces: or, growing GUIs on trees or, bookmarking GUIs (PTG, SK), pp. 277–287.
CAV-2002-AbdullaJMd #model checking: Regular Tree Model Checking (PAA, BJ, PM, Jd), pp. 555–568.
CAV-2002-BouajjaniT: Extrapolating Tree Transformations (AB, TT), pp. 539–554.
LICS-2002-BenediktL #algebra #automaton #logic #query: Tree Extension Algebras: Logics, Automata, and Query Languages (MB, LL), p. 203–?.
LICS-2002-ClarkeJLV #model checking: Tree-Like Counterexamples in Model Checking (EMC, SJ, YL, HV), pp. 19–29.
LICS-2002-GottlobK #monad #query: Monadic Queries over Tree-Structured Data (GG, CK), pp. 189–202.
RTA-2002-LeclandR #implementation #named: TTSLI: An Implementation of Tree-Tuple Synchronized Languages (BL, PR), pp. 376–379.
RTA-2002-OhsakiT #decidability #equation: Decidability and Closure Properties of Equational Tree Languages (HO, TT), pp. 114–128.
RTA-2002-Voigtlander #composition #performance #transducer: Conditions for Efficiency Improvement by Tree Transducer Composition (JV), pp. 222–236.
VMCAI-2002-TorreMN #automaton: Weak Muller Acceptance Conditions for Tree Automata (SLT, AM, MN), pp. 240–254.
DAC-2001-BozorgzadehKS #flexibility: Creating and Exploiting Flexibility in Steiner Trees (EB, RK, MS), pp. 195–198.
DATE-2001-LaiW #representation #slicing: Slicing tree is a complete floorplan representation (ML, DFW), pp. 228–232.
DATE-2001-SaitohAT #clustering #performance #scheduling: Clustering based fast clock scheduling for light clock-tree (MS, MA, AT), pp. 240–245.
DATE-2001-YuK #algorithm #distributed #performance: Explicit formulas and efficient algorithm for moment computation of coupled RC trees with lumped and distributed elements (QY, ESK), pp. 445–450.
ICDAR-2001-CesariniLMS #classification #documentation #encoding: Encoding of Modified X-Y Trees for Document Classification (FC, ML, SM, GS), pp. 1131–1136.
ICDAR-2001-DiligentiGMS #classification #documentation #html #modelling: Classification of HTML Documents by Hidden Tree-Markov Models (MD, MG, MM, FS), pp. 849–853.
PODS-2001-Larsen #multi: Relaxed Multi-Way Trees with Group Updates (KSL).
VLDB-2001-PapadiasT #named #query: MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries (YT, DP), pp. 431–440.
FoSSaCS-2001-GourantonRS: Synchronized Tree Languages Revisited and New Applications (VG, PR, HS), pp. 214–229.
SAS-2001-BagnaraGHZ #analysis #constraints: Finite-Tree Analysis for Constraint Logic-Based Languages (RB, RG, PMH, EZ), pp. 165–184.
SAS-2001-LiuLS #constraints #grammarware: Solving Regular Tree Grammar Based Constraints (YAL, NL, SDS), pp. 213–233.
STOC-2001-MossR #algorithm #approximate #problem: Approximation algorithms for constrained for constrained node weighted steiner tree problems (AM, YR), pp. 373–382.
DLT-2001-EngelfrietM #string #transducer: Hierarchies of String Languages Generated by Deterministic Tree Transducers (JE, SM), pp. 228–238.
ICALP-2001-BrodalFPO #complexity #using: The Complexity of Constructing Evolutionary Trees Using Experiments (GSB, RF, CNSP, AÖ), pp. 140–151.
ICALP-2001-ChazelleRT #approximate #sublinear: Approximating the Minimum Spanning Tree Weight in Sublinear Time (BC, RR, LT), pp. 190–200.
ICALP-2001-ComonCM #automaton #constraints #memory management #protocol #set: Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols (HC, VC, JM), pp. 682–693.
ICALP-2001-FraigniaudG: Routing in Trees (PF, CG), pp. 757–772.
ICALP-2001-Roura: A New Method for Balancing Binary Search Trees (SR), pp. 469–480.
CHI-2001-EllisB #community #design #online #social: Designing palaver tree online: supporting social roles in a community of oral history (JBE, AB), pp. 474–481.
CIKM-2001-SattlerD #classification #database #sql: SQL Database Primitives for Decision Tree Classifiers (KUS, OD), pp. 379–386.
ICML-2001-BlockeelS #algorithm #performance: Efficient algorithms for decision tree cross-validation (HB, JS), pp. 11–18.
ICML-2001-DobraG #bias #classification: Bias Correction in Classification Tree Construction (AD, JG), pp. 90–97.
ICML-2001-PapagelisK #using: Breeding Decision Trees Using Evolutionary Techniques (AP, DK), pp. 393–400.
ICML-2001-ZadroznyE #classification #naive bayes #probability: Obtaining calibrated probability estimates from decision trees and naive Bayesian classifiers (BZ, CE), pp. 609–616.
KDD-2001-BujaL #classification #data mining #mining: Data mining criteria for tree-based regression and classification (AB, YSL), pp. 27–36.
KDD-2001-SevonTO #named: TreeDT: gene mapping by tree disequilibrium test (PS, HT, VO), pp. 365–370.
KDD-T-2001-GehrkeL #roadmap: Advances in decision tree construction (JG, WYL), pp. 119–185.
ECOOP-2001-RaynaudT #encoding #performance #testing: A Quasi Optimal Bit-Vector Encoding of Tree Hierarchies. Application to Efficient Type Inclusion Tests (OR, ET), pp. 165–180.
PPDP-2001-TurbakW: Cycle Therapy: A Prescription for Fold and Unfold on Regular Trees (FAT, JBW), pp. 137–149.
SAC-2001-BadgerK #taxonomy: Picking fruit from the tree of life: comments on taxonomic sampling and quartet methods (JHB, PEK), pp. 61–67.
SAC-2001-Julstrom #encoding: Encoding rectilinear Steiner trees as lists of edges (BAJ), pp. 356–360.
SAC-2001-KimW: Batch-construction of B+-trees (SWK, HSW), pp. 231–235.
LDTA-2001-KuipersV #object-oriented #traversal: Object-oriented Tree Traversal with JJForester (TK, JV), pp. 34–58.
LDTA-2001-NakanoN #documentation #specification: Deriving Event-Based Document Transformers from Tree-Based Specifications (KN, SN), pp. 181–205.
LCTES-OM-2001-Theiling #generative: Generating Decision Trees for Decoding Binaries (HT), pp. 112–120.
CSL-2001-Ohsaki #automaton #commutative #equation: Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories (HO), pp. 539–553.
IJCAR-2001-GanzingerNN: Context Trees (HG, RN, PN), pp. 242–256.
IJCAR-2001-Middeldorp #approximate #automaton #dependence #graph #using: Approximating Dependency Graphs Using Tree Automata Techniques (AM), pp. 593–610.
LICS-2001-ArnoldLM #infinity #monad: The Hierarchy inside Closed Monadic Σ₁ Collapses on the Infinite Binary Tree (AA, GL, JM), pp. 157–166.
RTA-2001-Lohrey #automaton #complexity #on the #parallel: On the Parallel Complexity of Tree Automata (ML), pp. 201–215.
TLCA-2001-KnapikNU #algebra #monad: Deciding Monadic Theories of Hyperalgebraic Trees (TK, DN, PU), pp. 253–267.
DAC-2000-ChangCWW #representation: B*-Trees: a new representation for non-slicing floorplans (YCC, YWC, GMW, SWW), pp. 458–463.
DAC-2000-CongY: Routing tree construction under fixed buffer locations (JC, XY), pp. 379–384.
DAC-2000-PangBLC #constraints #representation #symmetry: Block placement with symmetry constraints based on the O-tree non-slicing representation (YP, FB, KL, CKC), pp. 464–467.
PODS-2000-DantsinV #complexity #query: Expressive Power and Data Complexity of Query Languages for Trees and Lists (ED, AV), pp. 157–165.
PODS-2000-NevenS #pattern matching #performance: Expressive and Efficient Pattern Languages for Tree-Structured Data (FN, TS), pp. 145–156.
SIGMOD-2000-RaoR #in memory #memory management: Making B+-Trees Cache Conscious in Main Memory (JR, KAR), pp. 475–486.
SIGMOD-2000-WattezCBFF #benchmark #learning #metric #query: Benchmarking Queries over Trees: Learning the Hard Truth the Hard Way (FW, SC, VB, GF, CF), pp. 510–511.
VLDB-2000-GoldsteinR #nearest neighbour: Contrast Plots and P-Sphere Trees: Space vs. Time in Nearest Neighbour Searches (JG, RR), pp. 429–440.
VLDB-2000-JiangSLB: The BT-tree: A Branched and Temporal Access Method (LJ, BS, DBL, MBG), pp. 451–460.
VLDB-2000-PedersenJD #reuse: The TreeScape System: Reuse of Pre-Computed Aggregates over Irregular OLAP Hierarchies (TBP, CSJ, CED), pp. 595–598.
VLDB-2000-RamsakMFZEB #database #kernel: Integrating the UB-Tree into a Database System Kernel (FR, VM, RF, MZ, KE, RB), pp. 263–272.
VLDB-2000-SakuraiYUK #approximate #using: The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation (YS, MY, SU, HK), pp. 516–526.
ESOP-2000-ElgaardMS #c #debugging #source code: Compile-Time Debugging of C Programs Working on Trees (JE, AM, MIS), pp. 119–134.
ESOP-2000-Mauborgne #infinity #representation #set: Improving the Representation of Infinite Trees to Deal with Sets of Trees (LM), pp. 275–289.
FoSSaCS-2000-Treinen #automaton #logic #testing: Predicate Logic and Tree Automata with Tests (RT), pp. 329–343.
CSMR-2000-TomerS #development #evolution: The Evolution Tree: A Maintenance-Oriented Software Development Model (AT, SRS), pp. 209–214.
SAS-2000-Mauborgne #termination: Tree Schemata and Fair Termination (LM), pp. 302–321.
STOC-2000-ColeH #performance: Faster suffix tree construction with missing suffix links (RC, RH), pp. 407–415.
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-KonemannR #algorithm #approximate #bound #matter: A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees (JK, RR), pp. 537–546.
STOC-2000-Reed #how #question: How tall is a tree? (BAR), pp. 479–483.
CIAA-2000-Bruggemann-KleinW #automaton #nondeterminism: Regularly Extended Two-Way Nondeterministic Tree Automata (ABK, DW), pp. 57–66.
ICALP-2000-AlstrupH #algorithm: Improved Algorithms for Finding Level Ancestors in Dynamic Trees (SA, JH), pp. 73–84.
ICALP-2000-NevenS #automaton #on the #power of: On the Power of Tree-Walking Automata (FN, TS), pp. 547–560.
ICALP-2000-PettieR #algorithm: An Optimal Minimum Spanning Tree Algorithm (SP, VR), pp. 49–60.
WLC-2000-Steinby #automaton #formal method #term rewriting: Tree Automata in the Theory of Term Rewriting (MS), pp. 434–449.
CSCW-2000-SmithCB #thread: Conversation trees and threaded chats (MS, JJC, BB), pp. 97–105.
ICEIS-2000-HeathC #communication #mobile #multi: Application of a Virtual Connection Tree over Multiple Access Techniques for 3G Mobile Communication Systems (AH, RAC), pp. 531–532.
CIKM-2000-HambruschL #replication: Data Replication for External Searching in Static Tree Structures (SEH, CML), pp. 360–367.
CIKM-2000-LiuXY #clustering: Clustering Through Decision Tree Construction (BL, YX, PSY), pp. 20–29.
CIKM-2000-MakawitaTL #database #using: Sampling from Databases Using B+-Trees (DPM, KLT, HL), pp. 158–164.
ICML-2000-DrummondH: Exploiting the Cost (In)sensitivity of Decision Tree Splitting Criteria (CD, RCH), pp. 239–246.
ICML-2000-KomarekM #adaptation #machine learning #performance #scalability #set: A Dynamic Adaptation of AD-trees for Efficient Machine Learning on Large Data Sets (PK, AWM), pp. 495–502.
ICML-2000-SridharanT #automation #multi: Multi-agent Q-learning and Regression Trees for Automated Pricing Decisions (MS, GT), pp. 927–934.
ICML-2000-Torgo #linear: Partial Linear Trees (LT), pp. 1007–1014.
ICML-2000-YildizA #linear: Linear Discriminant Trees (OTY, EA), pp. 1175–1182.
ICPR-v2-2000-BartoliPSZ #graph #morphism #using: Attributed Tree Homomorphism Using Association Graphs (MB, MP, KS, SWZ), pp. 2133–2136.
ICPR-v3-2000-AdamsSWG #named: MFDTs: Mean Field Dynamic Trees (NJA, AJS, CKIW, ZG), pp. 3151–3154.
ICPR-v3-2000-DemireklerKC #using: Fusing Length and Voicing Information, and HMM Decision Using a Bayesian Causal Tree against Insufficient Training Data (MD, FK, TÇ), pp. 3106–3109.
ICPR-v3-2000-SalembierG: Connected Operators Based on Region-Tree Pruning Strategies (PS, JLG), pp. 3371–3374.
ICPR-v4-2000-PuigTN #detection #navigation: Features Detection and Navigation on Neurovascular Trees (AP, DT, IN), pp. 4076–4079.
KDD-2000-GarofalakisHRS #algorithm #constraints #performance: Efficient algorithms for constructing decision trees with constraints (MNG, DH, RR, KS), pp. 335–339.
KDD-2000-TalbertF #analysis #empirical: An empirical analysis of techniques for constructing and searching k-dimensional trees (DAT, DHF), pp. 26–33.
KDD-2000-WangZH: Growing decision trees on support-less association rules (KW, SZ, YH), pp. 265–269.
TOOLS-PACIFIC-2000-HillNP #scalability #visualisation: Scalable Visualisations with Ownership Trees (TH, JN, JP), pp. 202–213.
POPL-2000-CharatonikPT #program analysis: Paths vs. Trees in Set-Based Program Analysis (WC, AP, JMT), pp. 330–337.
SAC-2000-Al-Omari #network: Routing in Quad Tree-Hypercube Networks (MAO), pp. 677–681.
SAC-2000-DeifKSB: Optical Hierarchical Fully Shuffled Tree (SHD, OHK, SIS, AEMYB), pp. 667–676.
SAC-2000-RaidlJ #algorithm #problem #search-based: A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem (GRR, BAJ), pp. 440–445.
SAC-2000-SchreckC #implementation #using: R-Tree Implementation Using Branch-Grafting Method (TS, ZC), pp. 328–332.
ISMM-2000-Dickman: Diffusion Tree Restructuring for Indirect Reference Counting (PD), pp. 167–177.
CL-2000-CurryWH #constraints #representation: Representing Trees with Constraints (BC, GAW, GH), pp. 315–325.
LICS-2000-MurawskiO #performance #proving #verification: Dominator Trees and Fast Verification of Proof Nets (ASM, CHLO), pp. 181–191.
RTA-2000-LevyV #constraints #higher-order #linear #unification: Linear Second-Order Unification and Context Unification with Tree-Regular Constraints (JL, MV), pp. 156–171.
RTA-2000-Tison #automaton #term rewriting: Tree Automata and Term Rewrite Systems (ST), pp. 27–30.
DAC-1999-GuoCY #representation: An O-Tree Representation of Non-Slicing Floorplan and Its Applications (PNG, CKC, TY), pp. 268–273.
DAC-1999-IsmailFN: Equivalent Elmore Delay for RLC Trees (YII, EGF, JLN), pp. 715–720.
DAC-1999-SalekLP #generative #independence #named #using: MERLIN: Semi-Order-Independent Hierarchical Buffered Routing Tree Generation Using Local Neighborhood Search (AHS, JL, MP), pp. 472–478.
DATE-1999-NoethK #encoding #power management: Spanning Tree-based State Encoding for Low Power Dissipation (WN, RK), pp. 168–174.
ICDAR-1999-CesariniGMS #documentation #representation #segmentation: Structured Document Segmentation and Representation by the Modified X-Y tree (FC, MG, SM, GS), pp. 563–566.
PODS-1999-MalmiS: Group Updates for Relaxed Height-Balanced Trees (LM, ESS), pp. 358–367.
PODS-1999-PapadiasMT #multi #optimisation #using: Processing and Optimization of Multiway Spatial Joins Using R-Trees (DP, NM, YT), pp. 44–55.
SIGMOD-1999-GehrkeGRL: BOAT-Optimistic Decision Tree Construction (JG, VG, RR, WYL), pp. 169–180.
ITiCSE-1999-Rugelj: Intelligent agent for knowledge tree administration (JR), p. 197.
FoSSaCS-1999-BogaertST #automaton #problem: The Recognizability Problem for Tree Automata with Comparisons between Brothers (BB, FS, ST), pp. 150–164.
FoSSaCS-1999-DantsinV #algorithm #nondeterminism #polynomial #set #unification: A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees (ED, AV), pp. 180–196.
FoSSaCS-1999-Maneth #metaprogramming #string #transducer: String Languages Generated by Total Deterministic Macro Tree Transducers (SM), pp. 258–272.
ICSM-1999-BurdM #c #cobol: Evaluating the Use of Dominance Trees for C and COBOL (EB, MM), pp. 401–410.
ICSM-1999-LapierreMSAFT #automation #execution #generative #linear #programming #testing #using: Automatic Unit Test Data Generation Using Mixed-Integer Linear Programming and Execution Trees (SL, EM, GS, GA, RF, PT), pp. 189–198.
SAS-1999-Monniaux #automaton #encryption #protocol: Abstracting Cryptographic Protocols with Tree Automata (DM), pp. 149–163.
STOC-1999-Gupta #metric: Embedding Tree Metrics Into Low Dimensional Euclidean Spaces (AG), pp. 694–700.
FLOPS-1999-Kuhnemann #comparison #deforestation #functional #source code #transducer: Comparison of Deforestation Techniques for Functional Programs and for Tree Transducers (AK), pp. 114–130.
DLT-1999-Bruggemann-KleinW #automaton #pattern matching: Caterpillars, context, tree automata and tree pattern matching (ABK, DW), pp. 270–285.
DLT-1999-KarhumakiM #fault #theorem: Defect theorems for trees (JK, SM), pp. 164–177.
ICALP-1999-DickhoferW #automaton #model checking #problem: Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem (MD, TW), pp. 281–290.
ICALP-1999-FrickG #first-order #graph: Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs (MF, MG), pp. 331–340.
ICALP-1999-GuptaKS #on the: On the Complements of Partial k-Trees (AG, DK, TCS), pp. 382–391.
ICALP-1999-KimP #2d #linear: Linear-Time Construction of Two-Dimensional Suffix Trees (DKK, KP), pp. 463–472.
ICALP-1999-LingasOO #maintenance #performance: Efficient Merging, Construction, and Maintenance of Evolutionary Trees (AL, HO, AÖ), pp. 544–553.
CIKM-1999-YuOE #performance #scalability: Simple QSF-Trees: An Efficient and Scalable Spatial Access Method (BY, RO, MWE), pp. 5–14.
ICML-1999-FreundM #algorithm #learning: The Alternating Decision Tree Learning Algorithm (YF, LM), pp. 124–133.
ICML-1999-Gama: Discriminant Trees (JG), pp. 134–142.
ICML-1999-Meila #algorithm: An Accelerated Chow and Liu Algorithm: Fitting Tree Distributions to High-Dimensional Sparse Data (MM), pp. 249–257.
ICML-1999-Robnik-SikonjaK #dependence #modelling: Attribute Dependencies, Understandability and Split Selection in Tree Based Models (MRS, IK), pp. 344–353.
ICML-1999-TalbertF #algorithm #named #optimisation: OPT-KD: An Algorithm for Optimizing Kd-Trees (DAT, DHF), pp. 398–405.
ICML-1999-WuBCS #induction #scalability: Large Margin Trees for Induction and Transduction (DW, KPB, NC, JST), pp. 474–483.
ICML-1999-ZhengWT #lazy evaluation #learning #naive bayes: Lazy Bayesian Rules: A Lazy Semi-Naive Bayesian Learning Technique Competitive to Boosting Decision Trees (ZZ, GIW, KMT), pp. 493–502.
KDD-1999-AnkerstEEK #approach #classification #interactive #visual notation: Visual Classification: An Interactive Approach to Decision Tree Construction (MA, CE, ME, HPK), pp. 392–396.
KDD-T-1999-GehrkeLR #classification: Classification and Regression: Money *can* Grow on Trees (JG, WYL, RR), pp. 1–73.
MLDM-1999-JacobsenZP #comparison #network: A Comparison between Neural Networks and Decision Trees (CJ, UZ, PP), pp. 144–158.
TOOLS-ASIA-1999-LinLZZ #web: Efficiently Computing Frequent Tree-Like Topology Patterns in a Web Environment (XL, CL, YZ, XZ), pp. 440–447.
CSL-1999-KerNO #game studies: A Universal Innocent Game Model for the Böhm Tree λ Theory (ADK, HN, CHLO), pp. 405–419.
RTA-1999-HofbauerH #testing: Test Sets for the Universal and Existential Closure of Regular Tree Languages (DH, MH), pp. 205–219.
RTA-1999-SaubionS #implementation #on the: On Implementation of Tree Synchronized Languages (FS, IS), pp. 382–396.
DAC-1998-KorupoluLW #independence #logic: Exact Tree-based FPGA Technology Mapping for Logic Blocks with Independent LUTs (MRK, KKL, DFW), pp. 708–711.
PODS-1998-Etessami #first-order #morphism: Dynamic Tree Isomorphism via First-Order Updates (KE), pp. 235–243.
VLDB-1998-BliujuteJSS: R-Tree Based Indexing of Now-Relative Bitemporal Data (RB, CSJ, SS, GS), pp. 345–356.
VLDB-1998-GarciaLL #on the: On Optimal Node Splitting for R-trees (YJG, MAL, STL), pp. 334–344.
VLDB-1998-GehrkeRG #dataset #framework #named #performance #scalability: RainForest — A Framework for Fast Decision Tree Construction of Large Datasets (JG, RR, VG), pp. 416–427.
VLDB-1998-RastogiS #classification #named: PUBLIC: A Decision Tree Classifier that Integrates Building and Pruning (RR, KS), pp. 404–415.
ICSM-1998-BaxterYMSB #abstract syntax tree #clone detection #detection #syntax #using: Clone Detection Using Abstract Syntax Trees (IDB, AY, LMdM, MS, LB), pp. 368–377.
STOC-1998-Bartal #approximate #metric #on the: On Approximating Arbitrary Metrices by Tree Metrics (YB), pp. 161–168.
STOC-1998-CharikarCGG #algorithm #approximate: Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and k-Median (MC, CC, AG, SG), pp. 114–123.
STOC-1998-HolmLT #algorithm: Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge, and Biconnectivity (JH, KdL, MT), pp. 79–89.
STOC-1998-KupfermanV #automaton: Weak Alternating Automata and Tree Automata Emptiness (OK, MYV), pp. 224–233.
STOC-1998-LinialMS #metric: Trees and Euclidean Metrics (NL, AM, MES), pp. 169–175.
FLOPS-1998-CurienH: Computing with Abstract Böhm Trees (PLC, HH), pp. 20–39.
ICALP-1998-Ben-AmramP #source code: CONS-Free Programs with Tree Input (Extended Abstract) (AMBA, HP), pp. 271–282.
ICALP-1998-Gargano #network: Limited Wavelength Conversion in All-Optical Tree Networks (LG), pp. 544–555.
ICALP-1998-Lugiez #automaton #induction #proving #theorem proving: A Good Class of Tree Automata and Application to Inductive Theorem Proving (DL), pp. 409–420.
ICALP-1998-Peleg #distributed: Distributed Matroid Basis Completion via Elimination Upcast and Distributed Correction of Minimum-Weight Spanning Trees (DP), pp. 164–175.
ICALP-1998-PelegR #approximate #communication: Deterministic Polylog Approximation for Minimum Communication Spanning Trees (DP, ER), pp. 670–681.
ICFP-1998-Moreau #distributed #garbage collection #mobile: A Distributed Garbage Collector with Diffusion Tree Reorganisation and Mobile Objects (LM), pp. 204–215.
TAGT-1998-EngelfrietM #graph grammar: Tree Languages Generated be Context-Free Graph Grammars (JE, SM), pp. 15–29.
CIKM-1998-ClairLP #process: Attribute Weighting: A Method of Applying Domain Knowledge in the Decision Tree Process (CSC, CL, NP), pp. 259–266.
CIKM-1998-KimC #clustering #performance #query: Sibling Clustering of Tree-Based Spatial Indexes for Efficient Spatial Query Processing (KK, SKC), pp. 398–405.
ICML-1998-BaxterTW #named: KnightCap: A Chess Programm That Learns by Combining TD(λ) with Game-Tree Search (JB, AT, LW), pp. 28–36.
ICML-1998-BlockeelRR #clustering #induction #top-down: Top-Down Induction of Clustering Trees (HB, LDR, JR), pp. 55–63.
ICML-1998-BonetG #learning #sorting: Learning Sorting and Decision Trees with POMDPs (BB, HG), pp. 73–81.
ICML-1998-FrankW98a #mutation testing #permutation #using: Using a Permutation Test for Attribute Selection in Decision Trees (EF, IHW), pp. 152–160.
ICML-1998-KearnsM #algorithm #bottom-up #performance: A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization (MJK, YM), pp. 269–277.
ICPR-1998-CracknellD #comprehension #documentation #image #using: Document image understanding of handwritten forms using rule-trees (CC, ACD), pp. 936–938.
ICPR-1998-KosmalaR98a #clustering #online #recognition #scalability #self #using: Tree-based state clustering using self-organizing principles for large vocabulary on-line handwriting recognition (AK, GR), pp. 1313–1315.
ICPR-1998-LiQ #image #retrieval #using: Matching spatial relations using DB-tree for image retrieval (XL, XQ), pp. 1230–1234.
ICPR-1998-SanchezPF #approach #induction: A Voronoi-diagram-based approach to oblique decision tree induction (JSS, FP, FJF), pp. 542–544.
ICPR-1998-SofferSZ #database #image #query #specification: Pictorial query trees for query specification in image databases (AS, HS, DNZ), pp. 919–921.
KDD-1998-AlsabtiRS #classification #dataset #named #scalability: CLOUDS: A Decision Tree Classifier for Large Datasets (KA, SR, VS), pp. 2–8.
SAC-1998-Al-OmariA #algorithm #network: Routing algorithms for tree-hypercube networks (MAO, HAS), pp. 85–89.
SAC-1998-GaberT #distributed #network #random: Randomized load distribution of arbitrary trees in distributed networks (JG, BT), pp. 564–568.
SAC-1998-Li #evaluation #performance #probability: Performance evaluation of probabilistic tree embedding in cube-connected cycles (KL), pp. 584–592.
SAC-1998-NascimentoS #towards: Towards historical R-trees (MAN, JROS), pp. 235–240.
FSE-1998-MasudaSU #design pattern #learning: Applying Design Patterns to Decision Tree Learning System (GM, NS, KU), pp. 111–120.
HPCA-1998-Chen #adaptation #branch #execution: Supporting Highly-Speculative Execution via Adaptive Branch Trees (TFC), pp. 185–194.
LICS-1998-MullerNT #constraints #first-order: The First-Order Theory of Ordering Constraints over Feature Trees (MM, JN, RT), pp. 432–443.
RTA-1998-AotoT #termination: Termination Transformation by Tree Lifting Ordering (TA, YT), pp. 256–270.
RTA-1998-MullerN #constraints #higher-order #logic #monad: Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic (MM, JN), pp. 196–210.
ASE-1997-Welty #abstract syntax tree #comprehension #syntax: Augmenting Abstract Syntax Trees for Program Understanding (CAW), pp. 126–133.
DAC-1997-KuoC #approach #clustering #network: A Network Flow Approach for Hierarchical Tree Partitioning (MTK, CKC), pp. 512–517.
EDTC-1997-LiuS #graph #heuristic #multi #performance #using: Multi-layer chip-level global routing using an efficient graph-based Steiner tree heuristic (LCEL, CS), pp. 311–318.
ICDAR-1997-DuDLA #documentation #evaluation #lazy evaluation #recognition #semantics #using: Generalized Contextual Recognition of Hand-Printed Documents Using Semantic Trees with Lazy Evaluation (LD, ACD, SML, BAB), pp. 238–242.
SIGMOD-1997-KatayamaS #nearest neighbour #query: The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries (NK, SS), pp. 369–380.
SIGMOD-1997-KornackerMH #concurrent: Concurrency and Recovery in Generalized Search Trees (MK, CM, JMH), pp. 62–72.
VLDB-1997-CiacciaPZ #metric #named #performance #similarity: M-tree: An Efficient Access Method for Similarity Search in Metric Spaces (PC, MP, PZ), pp. 426–435.
VLDB-1997-HuangJR #optimisation #traversal #using: Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations (YWH, NJ, EAR), pp. 396–405.
VLDB-1997-MorimotoIM #performance: Efficient Construction of Regression Trees with Range and Region Splitting (YM, HI, SM), pp. 166–175.
VLDB-1997-SellisRF #data access #multi: Multidimensional Access Methods: Trees Have Grown Everywhere (TKS, NR, CF), pp. 13–14.
SAS-1997-TalbotTD #analysis #automaton #logic programming: Set-Based Analysis for Logic Programming and Tree Automata (JMT, ST, PD), pp. 127–140.
STOC-1997-AwerbuchS #algorithm #multi #online: Online Algorithms for Selective Multicast and Maximal Dense Trees (BA, TS), pp. 354–362.
STOC-1997-BermanC #algorithm #online #problem: On-Line Algorithms for Steiner Tree Problems (Extended Abstract) (PB, CC), pp. 344–353.
STOC-1997-ColeH #pattern matching #random #set: Tree Pattern Matching and Subset Matching in Randomized O(n log3m) Time (RC, RH), pp. 66–75.
STOC-1997-KaoLPST: General Techniques for Comparing Unrooted Evolutionary Trees (MYK, TWL, TMP, WKS, HFT), pp. 54–65.
STOC-1997-KargerLLPLL #consistency #distributed #protocol #random #web: Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web (DRK, EL, FTL, RP, MSL, DL), pp. 654–663.
DLT-1997-CastelliGM: Indecomposable prefix codes and prime trees (MGC, DG, SM), pp. 135–145.
DLT-1997-DavidES #learning #string: Learning String Adjunct and Tree Adjunct Languages (NGD, JDE, KGS), pp. 411–427.
DLT-1997-GecsegI #automaton #on the #set: On complete sets of tree automata (FG, BI), pp. 37–47.
DLT-1997-Kuich97a: Formal Power Series over Trees (WK), pp. 61–101.
DLT-1997-MantaciR #equation: Tree Codes and Equations (SM, AR), pp. 119–133.
DLT-1997-Moshkov #complexity #nondeterminism #recognition #regular expression #word: Complexity of Deterministic and Nondeterministic Decision Trees for Regular Language Word Recognition (MM), pp. 343–349.
ICALP-1997-AlstrupHLT: Minimizing Diameters of Dynamic Trees (SA, JH, KdL, MT), pp. 270–280.
ICALP-1997-BassinoBP #sequence: Enumerative Sequences of Leaves in Rational Trees (FB, MPB, DP), pp. 76–86.
ICALP-1997-ErdosSSW #sequence: Constructing Big Trees from Short Sequences (PLE, MAS, LAS, TW), pp. 827–837.
ICALP-1997-GarganoHP #symmetry: Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing (LG, PH, SP), pp. 505–515.
ICALP-1997-HenzingerK #graph #maintenance: Maintaining Minimum Spanning Trees in Dynamic Graphs (MRH, VK), pp. 594–604.
ICALP-1997-KrumkeMNRRSW: Improving Spanning Trees by Upgrading Nodes (SOK, MVM, HN, RR, SSR, RS, HCW), pp. 281–291.
ICALP-1997-Robson #on the: On the Concentration of the Height of Binary Search Trees (JMR), pp. 441–448.
CIKM-1997-ObermeyerM #using: Evaluating Triggers Using Decision Trees (LO, DPM), pp. 144–150.
ICML-1997-BalujaD #optimisation #using: Using Optimal Dependency-Trees for Combinational Optimization (SB, SD), pp. 30–38.
ICML-1997-Decatur #classification #induction #learning: PAC Learning with Constant-Partition Classification Noise and Applications to Decision Tree Induction (SED), pp. 83–91.
ICML-1997-Gama #linear #probability: Probabilistic Linear Tree (JG), pp. 134–142.
ICML-1997-KohaviK: Option Decision Trees with Majority Votes (RK, CK), pp. 161–169.
ICML-1997-Mansour: Pessimistic decision tree pruning based Continuous-time (YM), pp. 202–210.
ICML-1997-OatesJ #complexity #set: The Effects of Training Set Size on Decision Tree Complexity (TO, DJ), pp. 254–262.
ICML-1997-Torgo #functional #modelling: Functional Models for Regression Tree Leaves (LT), pp. 385–393.
ICML-1997-VilaltaR #classification #induction #multi: Integrating Feature Construction with Multiple Classifiers in Decision Tree Induction (RV, LAR), pp. 394–402.
KDD-1997-JensenS #multi: Adjusting for Multiple Comparisons in Decision Tree Pruning (DJ, MDS), pp. 195–198.
KDD-1997-RaoP #visualisation: Visualizing Bagged Decision Trees (JSR, WJEP), pp. 243–246.
SIGIR-1997-ChienHC #information retrieval #keyword: Pat-tree-based Keyword Extraction for Chinese Information Retrieval (LFC, TIH, MCC), pp. 50–58.
SAC-1997-HuizingaK #algorithm #design #distributed #generative: A tree generating algorithm for designing optimal hierarchical distributed systems (DMH, EK), pp. 345–353.
SAC-1997-Li97b #on the: On dynamic tree growing in hypercubes (KL), pp. 496–503.
SAC-1997-Shen: The average diameter of binary tree structures (ZS), pp. 40–44.
CADE-1997-NiehrenPR #constraints #finite #on the #similarity #unification: On Equality Up-to Constraints over Finite Trees, Context Unification, and One-Step Rewriting (JN, MP, PR), pp. 34–48.
CSL-1997-ComonJ #automaton #higher-order: Higher-Order Matching and Tree Automata (HC, YJ), pp. 157–176.
ICLP-1997-Stuckey #constraints: Constraint Search Tree (PJS), pp. 301–315.
ICLP-1997-TsuchidaAIY #constraints #logic programming #using: Tree Drawing Using Constraint Logic Programming (KT, YA, TI, TY), p. 414.
TLCA-1997-Kurata: A Type Theoretical View of Böhm-Trees (TK), pp. 231–247.
DAC-1996-ChenCW #optimisation #performance: Fast Performance-Driven Optimization for Buffered Clock Trees Based on Lagrangian Relaxation (CPC, YWC, DFW), pp. 405–408.
DAC-1996-KuoLC #clustering #network: Network Partitioning into Tree Hierarchies (MTK, LTL, CKC), pp. 477–482.
DAC-1996-OhPP #bound #linear #programming #using: Constructing Lower and Upper Bounded Delay Routing Trees Using Linear Programming (JO, IP, MP), pp. 401–404.
PODS-1996-TheodoridisS #performance #predict: A Model for the Prediction of R-tree Performance (YT, TKS), pp. 161–171.
SIGMOD-1996-ZouS #online: On-line Reorganization of Sparsely-populated B+trees (CZ, BS), pp. 115–124.
VLDB-1996-BerchtoldKK: The X-tree : An Index Structure for High-Dimensional Data (SB, DAK, HPK), pp. 28–39.
VLDB-1996-FukudaMMT #performance #using: Constructing Efficient Decision Trees by Using Optimized Numeric Association Rules (TF, YM, SM, TT), pp. 146–155.
VLDB-1996-SevcikK: Filter Trees for Managing Spatial Data over a Range of Size Granularities (KCS, NK), pp. 16–27.
STOC-1996-BonetPWY #polymorphism: Constructing Evolutionary Trees in the Presence of Polymorphic Characters (MLB, CAP, TW, SY), pp. 220–229.
STOC-1996-EvansP #bound: Lower Bounds for Noisy Boolean Decision Trees (WSE, NP), pp. 620–628.
STOC-1996-GrigorievKHS #algebra #bound #random: A Lower Bound for Randomized Algebraic Decision Trees (DG, MK, FMadH, RS), pp. 612–619.
STOC-1996-KearnsM #algorithm #learning #on the #top-down: On the Boosting Ability of Top-Down Decision Tree Learning Algorithms (MJK, YM), pp. 459–468.
STOC-1996-KosarajuD #assembly #scalability #string: Large-Scale Assembly of DNA Strings and Space-Efficient Construction of Suffix Trees (Correction) (SRK, ALD), p. 659.
STOC-1996-Wilson #generative #random: Generating Random Spanning Trees More Quickly than the Cover Time (DBW), pp. 296–303.
ICALP-1996-ChenN #algebra: Algebraic Characterizations of Decorated Trace Equivalences over Tree-Like Structures (XJC, RDN), pp. 63–74.
ICALP-1996-ChoiG #algorithm #analysis: Lopsided Trees: Analyses, Algorithms, and Applications (VSNC, MJG), pp. 538–549.
ICALP-1996-FarachM #random: Optimal Logarithmic Time Randomized Suffix Tree Construction (MF, SM), pp. 550–561.
ICALP-1996-Kaivola #automaton #fixpoint: Fixpoints for Rabin Tree Automata Make Complementation Easy (RK), pp. 312–323.
WIA-1996-BiehlKR #algorithm #automaton: Algorithms for Guided Tree Automata (MB, NK, TR), pp. 6–25.
IFL-1996-DoschM #functional: Calculating a Functional Module for Binary Search Trees (WD, BM), pp. 267–284.
AKDDM-1996-Gaines: Transformation Rules and Trees (BRG), pp. 205–226.
CIKM-1996-LiuOSWYR #database #evaluation #fuzzy #performance: Performance Evaluation of G-tree and Its Application in Fuzzy Databases (CL, AMO, APS, JW, CTY, NR), pp. 235–242.
ICML-1996-AbeL #learning #modelling #using #word: Learning Word Association Norms Using Tree Cut Pair Models (NA, HL), pp. 3–11.
ICML-1996-BoutilierD #approximate #programming: Approximate Value Trees in Structured Dynamic Programming (CB, RD), pp. 54–62.
ICML-1996-GeibelW #concept #learning #relational: Learning Relational Concepts with Decision Trees (PG, FW), pp. 166–174.
ICML-1996-GrolimundG #memory management #nearest neighbour: Speeding-up Nearest Neighbour Memories: The Template Tree Case Memory Organisation (SG, JGG), pp. 225–233.
ICML-1996-IttnerS: Non-Linear Decision Trees — NDT (AI, MS), pp. 252–257.
ICML-1996-Kubat: Second Tier for Decision Trees (MK), pp. 293–301.
ICPR-1996-ChaiZZS #algorithm #linear #search-based: Binary linear decision tree with genetic algorithm (BBC, XZ, YZ, JS), pp. 530–534.
ICPR-1996-DistasiNV #image #recursion: A B-tree based recursive technique for image coding (RD, MN, SV), pp. 670–674.
ICPR-1996-ImiyaFK #re-engineering #recognition #representation: Reconstruction, recognition, and representation of trees (AI, YF, TK), pp. 595–600.
ICPR-1996-Marchand-MailletS #analysis #approach #image: A minimum spanning tree approach to line image analysis (SMM, YMS), pp. 225–230.
ICPR-1996-MottlMBK #image #problem: Hidden tree-like quasi-Markov model and generalized technique for a class of image processing problems (VM, IBM, AB, AK), pp. 715–719.
ICPR-1996-Yoshii #architecture #classification: Pyramid architecture classification tree (HY), pp. 310–314.
KDD-1996-CherkauerS #information management: Growing Simpler Decision Trees to Facilitate Knowledge Discovery (KJC, JWS), pp. 315–318.
KDD-1996-FultonKSW #data mining #induction #interactive #mining #towards: Local Induction of Decision Trees: Towards Interactive Data Mining (TF, SK, SS, DLW), pp. 14–19.
KDD-1996-GrossmanBNP #data mining #mining #optimisation: Data Mining and Tree-Based Optimization (RLG, HB, DN, HVP), pp. 323–326.
KDD-1996-IttnerS #generative: Discovery of Relevant New Features by Generating Non-Linear Decision Trees (AI, MS), pp. 108–113.
KDD-1996-Kohavi #classification #hybrid #scalability: Scaling Up the Accuracy of Naive-Bayes Classifiers: A Decision-Tree Hybrid (RK), pp. 202–207.
KDD-1996-Rymon: SE-Trees Outperform Decision Trees in Noisy Domains (RR), pp. 331–334.
POPL-1996-GhiyaH #analysis #c #graph #pointer: Is it a Tree, a DAG, or a Cyclic Graph? A Shape Analysis for Heap-Directed Pointers in C (RG, LJH), pp. 1–15.
SAC-1996-Julstom #algorithm #representation #search-based: Representing rectilinear Steiner trees in genetic algorithms (BAJ), pp. 245–250.
SAC-1996-Li #distributed #maintenance #parallel: Maintenance of tree structured computations on parallel and distributed computer systems (KL), pp. 337–343.
SAC-1996-Sharma: A note on tree medians (MBS), pp. 216–218.
CC-1996-ProebstingW #parsing: One-Pass, Optimal Tree Parsing — With Or Without Trees (TAP, BRW), pp. 294–308.
CADE-1996-Fernmuller #semantics: Semantic Trees Revisited: Some New Completeness Results (CGF), pp. 568–582.
CADE-1996-GrafM: Advanced Indexing Operations on Substitution Trees (PG, CM), pp. 553–567.
CADE-1996-Vorobyov #bound: An Improved Lower Bound for the Elementary Theories of Trees (SGV), pp. 275–287.
CSL-1996-KreidlerS #monad: Monadic NP and Built-in Trees (MK, DS), pp. 260–275.
LICS-1996-KupfermanSV #automaton #word: Relating Word and Tree Automata (OK, SS, MYV), pp. 322–332.
LICS-1996-Nurmonen #finite #order #quantifier: Counting Modulo Quantifiers on Finite Linearly Ordered Trees (JN), pp. 484–493.
RTA-1996-HanusP #higher-order: Higher-Order Narrowing with Definitional Trees (MH, CP), pp. 138–152.
DAC-1995-GuptaKTWP #bound: The Elmore Delay as a Bound for RC Trees with Generalized Input Signals (RG, BK, BT, JW, LTP), pp. 364–369.
DAC-1995-VittalM #design: Power Optimal Buffered Clock Tree Design (AV, MMS), pp. 497–502.
ICDAR-v1-1995-AkindeleB #documentation #modelling #using: Construction of generic models of document structures using inference of tree grammars (OTA, AB), pp. 206–209.
SIGMOD-1995-DuSD #multi #query: Reducing Multidatabase Query Response Time by Tree Balancing (WD, MCS, UD), pp. 293–303.
SIGMOD-1995-Freeston #problem: A General Solution of the n-dimensional B-tree Problem (MF), pp. 80–91.
SIGMOD-1995-PapadiasTSE #bound #case study: Topological Relations in the World of Minimum Bounding Rectangles: A Study with R-trees (DP, YT, TKS, MJE), pp. 92–103.
VLDB-1995-EvangelidisLS #concurrent: The hBP-tree: A Modified hB-tree Supporting Concurrency, Recovery and Node Consolidation (GE, DBL, BS), pp. 551–561.
VLDB-1995-HellersteinNP #database: Generalized Search Trees for Database Systems (JMH, JFN, AP), pp. 562–573.
VLDB-1995-KornackerB: High-Concurrency Locking in R-Trees (MK, DB), pp. 134–145.
VLDB-1995-LeslieJBY #multi #performance: Efficient Search of Multi-Dimensional B-Trees (HL, RJ, DB, HY), pp. 710–719.
ESOP-J-1994-GiegerichK95 #comparison #functional #imperative: A Comparison of Imperative and Purely Functional Suffix Tree Constructions (RG, SK), pp. 187–218.
STOC-1995-AwerbuchABV #approximate: Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen (BA, YA, AB, SV), pp. 277–283.
STOC-1995-KosarajuD #assembly #scalability #string: Large-scale assembly of DNA strings and space-efficient construction of suffix trees (SRK, ALD), pp. 169–177.
STOC-1995-Pulleyblank #problem: Two Steiner tree packing problems (Extended Abstract) (WRP), pp. 383–387.
ICALP-1995-AulettaPP #algorithm: Placing Resources in a Tree: Dynamic and Static Algorithms (VA, DP, GP), pp. 232–243.
ICALP-1995-GiancarloG #algorithm #matrix #on the: On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications (RG, RG), pp. 111–122.
ICML-1995-AlmuallimAK #learning #on the: On Handling Tree-Structured Attributed in Decision Tree Learning (HA, YA, SK), pp. 12–20.
ICML-1995-AuerHM #theory and practice: Theory and Applications of Agnostic PAC-Learning with Small Decision Trees (PA, RCH, WM), pp. 21–29.
ICML-1995-Brodley #automation: Automatic Selection of Split Criterion during Tree Growing Based on Node Location (CEB), pp. 73–80.
ICML-1995-FultonKS #algorithm #multi #performance: Efficient Algorithms for Finding Multi-way Splits for Decision Trees (TF, SK, SS), pp. 244–251.
ICML-1995-Lubinsky #classification #consistency #performance #using: Increasing the Performance and Consistency of Classification Trees by Using the Accuracy Criterion at the Leaves (DJL), pp. 371–377.
ICML-1995-OliverH #on the: On Pruning and Averaging Decision Trees (JJO, DJH), pp. 430–437.
ICML-1995-SmythGF #classification #estimation #kernel #using: Retrofitting Decision Tree Classifiers Using Kernel Density Estimation (PS, AGG, UMF), pp. 506–514.
KDD-1995-ChanS #machine learning #scalability: Learning Arbiter and Combiner Trees from Partitioned Data for Scaling Machine Learning (PKC, SJS), pp. 39–44.
KDD-1995-John #database #robust: Robust Decision Trees: Removing Outliers from Databases (GHJ), pp. 174–179.
KDD-1995-MehtaRA: MDL-Based Decision Tree Pruning (MM, JR, RA), pp. 216–221.
KDD-1995-MurthyS #effectiveness #heuristic #how #induction #question: Decision Tree Induction: How Effective is the Greedy Heuristic? (SKM, SS), pp. 222–227.
OOPSLA-1995-Riehle #encapsulation #how #why: How and Why to Encapsulate Class Trees (DR), pp. 251–264.
LOPSTR-1995-Leuschel #constraints #deduction: Ecological Partial Deduction: Preserving Characteristic Trees Without Constraints (ML), pp. 1–16.
SAC-1995-AbualiWS #encoding #graph #representation: Determinant factorization and cycle basis: encoding schemes for the representation of spanning trees on incomplete graphs (FNA, RLW, DAS), pp. 305–312.
SAC-1995-AbualiWS95a #algorithm #morphism #problem #search-based #using: Solving the three-star tree isomorphism problem using genetic algorithms (FNA, RLW, DAS), pp. 337–344.
SAC-1995-AlfantookhGA #architecture #implementation: Implementation of 2-4 finger trees in the hypercube architecture (AA, KMG, HMAH), pp. 198–205.
SAC-1995-BangL #database #named #performance: SMR-tree: an efficient index structure for spatial databases (KSB, HL), pp. 46–50.
SAC-1995-ChenH #algorithm #analysis #concurrent #database #performance: Performance analysis of a periodic data reorganization algorithm for concurrent B-trees in database systems (IRC, SH), pp. 40–45.
SAC-1995-GaberTGH #parallel: Embedding tree structures in massively parallel computers (JG, BT, GG, TH), pp. 210–214.
HPCA-1995-SastryR #architecture #distance: A VLSI Architecture for Computer the Tree-to-Tree Distance (RS, NR), pp. 330–339.
HPDC-1995-JacobL #algorithm #performance #recursion #refinement: A Spanning Tree Based Recursive Refinement Algorithm for Fast Task Mapping (JCJ, SYL), pp. 58–65.
HPDC-1995-RankinB #algorithm #distributed #implementation #parallel: A Portable Distributed Implementation of the Parallel Multipole Tree Algorithm (WTR, JABJ), pp. 17–22.
LICS-1995-Comon #automaton #higher-order #logic #monad: Sequentiality, Second Order Monadic Logic and Tree Automata (HC), pp. 508–517.
LICS-1995-EtessamiI #transitive: Tree Canonization and Transitive Closure (KE, NI), pp. 331–341.
RTA-1995-Graf: Substitution Tree Indexing (PG), pp. 117–131.
DAC-1994-BoeseKMR: Rectilinear Steiner Trees with Minimum Elmore Delay (KDB, ABK, BAM, GR), pp. 381–386.
DAC-1994-VittalM #design #using: Minimal Delay Interconnect Design Using Alphabetic Trees (AV, MMS), pp. 392–396.
EDAC-1994-McCoyR: Non-Tree Routing (BAM, GR), pp. 430–434.
PODS-1994-FaloutsosK #analysis #concept #independence #using: Beyond Uniformity and Independence: Analysis of R-trees Using the Concept of Fractal Dimension (CF, IK), pp. 4–13.
SIGMOD-1994-KrollW: Distributing a Search Tree Among a Growing Number of Processors (BK, PW), pp. 265–276.
SIGMOD-1994-LoR #using: Spatial Joins Using Seeded Trees (MLL, CVR), pp. 209–220.
VLDB-1994-KamelF #using: Hilbert R-tree: An Improved R-tree using Fractals (IK, CF), pp. 500–509.
VLDB-1994-MedianoCD #named: V-Trees — A Storage Method for Long Vector Data (MRM, MAC, MD), pp. 321–330.
VLDB-1994-SetzerZ #algorithm #concurrent: New Concurrency Control Algorithms for Accessing and Compacting B-Trees (VWS, AZ), pp. 238–248.
VLDB-1994-SreenathS #database #object-oriented #performance: The hcC-tree: An Efficient Index Structure for Object Oriented Databases (BS, SS), pp. 203–213.
ESOP-1994-GiegerichK #functional #paradigm #programming: Suffix Trees in the Functional Programming Paradigm (RG, SK), pp. 225–240.
PLDI-1994-JohnsonPP #linear: The Program Structure Tree: Computing Control Regions in Linear Time (RJ, DP, KP), pp. 171–185.
STOC-1994-GargH #algorithm #approximate #problem: An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane (NG, DSH), pp. 432–438.
STOC-1994-GrigorievKV #algebra #bound #testing: Lower bounds on testing membership to a polyhedron by algebraic decision trees (DG, MK, NV), pp. 635–644.
STOC-1994-Hariharan #parallel: Optimal parallel suffix tree construction (RH), pp. 290–299.
STOC-1994-JiangLW #approximate #complexity #sequence: Aligning sequences via an evolutionary tree: complexity and approximation (TJ, ELL, LW), pp. 760–769.
STOC-1994-KhullerRY: Low degree spanning trees of small weight (SK, BR, NEY), pp. 412–421.
STOC-1994-KleinT #algorithm #linear #random: A randomized linear-time algorithm for finding minimum spanning trees (PNK, RET), pp. 9–15.
STOC-1994-KollerMS #algorithm #game studies #performance #random: Fast algorithms for finding randomized strategies in game trees (DK, NM, BvS), pp. 750–759.
STOC-1994-Kosaraju #pattern matching #realtime: Real-time pattern matching and quasi-real-time construction of suffix trees (preliminary version) (SRK), pp. 310–316.
STOC-1994-SahinalpV #symmetry: Symmetry breaking for suffix tree construction (SCS, UV), pp. 300–309.
STOC-1994-Yao #complexity: Decision tree complexity and Betti numbers (ACCY), pp. 615–624.
ICALP-1994-ItalianoR #maintenance: Maintaining Spanning Trees of Small Diameter (GFI, RR), pp. 227–238.
ICALP-1994-PrzytyckaL #problem #revisited: The Optimal Alphabetic Tree Problem Revisited (TMP, LLL), pp. 251–262.
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-Drewes #algebra #graph #transducer: The Use of Tree Transducers to Compute Translations Between Graph Algebras (FD), pp. 196–210.
ICML-1994-AbeM #predict #probability: A New Method for Predicting Protein Secondary Structures Based on Stochastic Tree Grammars (NA, HM), pp. 3–11.
ICML-1994-Elomaa #learning: In Defense of C4.5: Notes Learning One-Level Decision Trees (TE), pp. 62–69.
ICML-1994-Jordan #approach #modelling #statistics: A Statistical Approach to Decision Tree Modeling (MIJ), pp. 363–370.
ICML-1994-Utgoff #algorithm #incremental #induction: An Improved Algorithm for Incremental Induction of Decision Trees (PEU), pp. 318–325.
ICML-1994-WeissI: Small Sample Decision tree Pruning (SMW, NI), pp. 335–342.
POPL-1994-BoylandG: Composing Tree Attributions (JB, SLG), pp. 375–388.
POPL-1994-RamalingamR #algorithm #incremental #maintenance: An Incremental Algorithm for Maintaining the Dominator Tree of a Reducible Flowgraph (GR, TWR), pp. 287–296.
SAC-1994-AbualiSW #algorithm #design #network #probability #search-based #using: Designing telecommunications networks using genetic algorithms and probabilistic minimum spanning trees (FNA, DAS, RLW), pp. 242–246.
CADE-1994-FeltyH #proving #theorem proving: Tactic Theorem Proving with Refinement-Tree Proofs and Metavariables (APF, DJH), pp. 605–619.
ICLP-1994-MoolenaarD #hybrid: Hybrid Tree Search in the Andorra Model (RM, BD), pp. 110–123.
ILPS-1994-PodelskiR #algorithm #incremental #testing: The Beauty and the Beast Algorithm: Quasi-Linear Incremental Tests of Entailment and Disentailment over Trees (AP, PVR), pp. 359–374.
LICS-1994-ImpagliazzoPU #bound #proving: Upper and Lower Bounds for Tree-Like Cutting Planes Proofs (RI, TP, AU), pp. 220–228.
DAC-1993-BoeseKR: High-Performance Routing Trees With Identified Critical Sinks (KDB, ABK, GR), pp. 182–187.
DAC-1993-HongXKCH #algorithm: Performance-Driven Steiner Tree Algorithm for Global Routing (XH, TX, ESK, CKC, JH), pp. 177–181.
DAC-1993-HuangJHHW #algorithm #scheduling: A Tree-Based Scheduling Algorithm for Control-Dominated Circuits (SHH, YLJ, CTH, YCH, JFW), pp. 578–582.
DAC-1993-LaiFW #data type #performance #query: HV/VH Trees: A New Spatial Data Structure for Fast Region Queries (GGL, DSF, DFW), pp. 43–47.
DAC-1993-LimCW #performance: Performance Oriented Rectilinear Steiner Trees (AL, SWC, CTW), pp. 171–176.
DAC-1993-PullelaMP #optimisation #reliability #using: Reliable Non-Zero Skew Clock Trees Using Wire Width Optimization (SP, NM, LTP), pp. 165–170.
DAC-1993-SriramK #approximate #performance: Fast Approximation of the Transient Response of Lossy Transmision Line Trees (MS, SMK), pp. 691–696.
HT-1993-Parunak: Hypercubes Grow on Trees (and Other Observations from the Land of Hypersets) (HVDP), pp. 73–81.
ICDAR-1993-RaafatR #network: A tree structured neural network (HMR, MR), pp. 939–941.
SIGMOD-1993-BrinkhoffKS #performance #using: Efficient Processing of Spatial Joins Using R-Trees (TB, HPK, BS), pp. 237–246.
VLDB-1993-VhanHY #execution: Applying Hash Filters to Improving the Execution of Bushy Trees (MSC, HIH, PSY), pp. 505–516.
CSM-1993-Abd-El-HafizB #library #source code #using: Documenting Programs Using a Library of Tree Structured Plans (SKAEH, VRB), pp. 152–161.
STOC-1993-Bodlaender #algorithm #linear: A linear time algorithm for finding tree-decompositions of small treewidth (HLB), pp. 226–234.
STOC-1993-FarachKW #robust: A robust model for finding optimal evolutionary trees (MF, SK, TW), pp. 137–145.
STOC-1993-Fleischer: Decision trees: old and new results (RF), pp. 468–477.
WSA-1993-GluckK #process: Occam’s Razor in Metacompuation: the Notion of a Perfect Process Tree (RG, AVK), pp. 112–123.
DLT-1993-JurvanenPT: Tree Languages Recognizable by Regular Frontier Check (EJ, AP, WT), pp. 3–17.
ICALP-1993-CzumajG #graph #problem: Problems on Pairs of Trees and the Four Colour Problem of Planar Graphs (AC, AG), pp. 88–101.
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.
ICALP-1993-Gupta #automaton #finite #product line: Finite Automata as Characterizations of Minor Closed Tree Families (Extended Abstract) (AG), pp. 359–370.
ICALP-1993-Wilke #algebra #testing: Algebras for Classifying Regular Tree Languages and an Application to Frontier Testability (TW), pp. 347–358.
CIKM-1993-KamelF #on the: On Packing R-trees (IK, CF), pp. 490–499.
ICML-1993-Cardie #learning #using: Using Decision Trees to Improve Case-Based Learning (CC), pp. 25–32.
ICML-1993-Rymon #induction #problem: An SE-tree based Characterization of the Induction Problem (RR), pp. 268–275.
ICML-1993-Tadepalli #bias #learning #query: Learning from Queries and Examples with Tree-structured Bias (PT), pp. 322–329.
TOOLS-PACIFIC-1993-DurnotaM #design #metric #object-oriented: Tree-Based Coherence Metrics in Object-Oriented Design (BD, CM), pp. 489–504.
SAC-1993-ThakoreC: Effect of the χ² Test on Construction of ID3 Decision Trees (MT, DCSC), pp. 1–8.
ICLP-1993-CorsiniR #analysis #fault #safety: Safety Analysis by Means of Fault Trees: An Application for Open Boolean Solvers (MMC, AR), p. 834.
RTA-1993-NiehrenPT #constraints #equation #finite: Equational and Membership Constraints for Finite Trees (JN, AP, RT), pp. 106–120.
RTA-1993-Raoult #recursion: Recursively Defined Tree Transductions (JCR), pp. 343–357.
PODS-1992-Jakobsson #evaluation #on the #query: On Tree-Based Techniques for Query Evaluation (HJ), pp. 380–392.
SIGMOD-1992-KamelF #parallel: Parallel R-trees (IK, CF), pp. 195–204.
SIGMOD-1992-LowOL #named: H-trees: A Dynamic Associative Search Index for OODB (CCL, BCO, HL), pp. 134–143.
VLDB-1992-Antoshenkov #pseudo #random: Random Sampling from Pseudo-Ranked B+ Trees (GA), pp. 375–382.
VLDB-1992-ChenLYY #execution #pipes and filters #using: Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins (MSC, MLL, PSY, HCY), pp. 15–26.
VLDB-1992-FaloutsosJ #on the: On B-Tree Indices for Skewed Distributions (CF, HVJ), pp. 363–374.
STOC-1992-BjornerLY #bound #linear: Linear Decision Trees: Volume Estimates and Topological Bounds (AB, LL, ACCY), pp. 170–177.
STOC-1992-Lindell #algorithm: A Logspace Algorithm for Tree Canonization (Extended Abstract) (SL), pp. 400–404.
STOC-1992-Reed #approximate: Finding Approximate Separators and Computing Tree Width Quickly (BAR), pp. 221–228.
ICALP-1992-DeganoP: Proved Trees (PD, CP), pp. 629–640.
ICALP-1992-PeladeauP #on the: On Reverse and General Definite Tree Languages (Extended Abstract) (PP, AP), pp. 150–161.
ICALP-1992-Schmid #algorithm #multi: The Average CRI-Length of a Tree Collision Resolution Algorithm in Presence of Multiplicity-Dependent Capture Effects (US), pp. 223–234.
CHI-1992-Johnson92a #named #visualisation: TreeViz: treemap visualization of hierarchically structured information (BJ), pp. 369–370.
ML-1992-IbaL #induction: Induction of One-Level Decision Trees (WI, PL), pp. 233–240.
ML-1992-Merckt #concept #flexibility #named: NFDT: A System that Learns Flexible Concepts Based on Decision Trees for Numerical Attributes (TVdM), pp. 322–331.
TOOLS-USA-1992-GrapeW #automation #development #evolution #generative #syntax: Automating the Development of Syntax Tree Generators for an Evolving Language (PG, KW), pp. 185–195.
ALP-1992-Antoy: Definitional Trees (SA), pp. 143–157.
PLILP-1992-Rebelsky #functional #interactive #lazy evaluation #programming: I/O Trees and Interactive Lazy Functional Programming (SAR), pp. 458–472.
POPL-1992-Farnum: Pattern-Based Tree Attribution (CF), pp. 211–222.
CC-1992-Grosch #pattern matching #using: Transformation of Attributed Trees Using Pattern Matching (JG), pp. 1–15.
JICSLP-1992-DebrayKP: Weighted Decision Trees (SKD, SK, MP), pp. 654–668.
LICS-1992-Klarlund #automaton #metric #set: Progress Measures, Immediate Determinacy, and a Subset Construction for Tree Automata (NK), pp. 382–393.
DAC-1991-Harrison #layout #using: VLSI Layout Compaction Using Radix Priority Search Trees (AJH), pp. 732–735.
DAC-1991-NicolauP #incremental #reduction #synthesis: Incremental Tree Height Reduction for High Level Synthesis (AN, RP), pp. 770–774.
PODS-1991-NurmiS: Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees (ON, ESS), pp. 192–198.
SIGMOD-1991-IoannidisK #analysis #optimisation #query: Left-Deep vs. Bushy Trees: An Analysis of Strategy Spaces and its Implications for Query Optimization (YEI, YCK), pp. 168–177.
SIGMOD-1991-LankaM #persistent: Fully Persistent B+-trees (SL, EM), pp. 426–435.
SIGMOD-1991-SeegerL #multi: Multi-Disk B-trees (BS, PÅL), pp. 436–445.
SIGMOD-1991-SrinivasanC #algorithm #concurrent #performance: Performance of B-Tree Concurrency Algorithms (VS, MJC), pp. 416–425.
STOC-1991-AgrawalKR #algorithm #approximate #network #problem: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks (AA, PNK, RR), pp. 134–144.
STOC-1991-GoodrichT: Dynamic Trees and Dynamic Point Location (Preliminary Version) (MTG, RT), pp. 523–533.
STOC-1991-KushilevitzM #fourier #learning #using: Learning Decision Trees Using the Fourier Sprectrum (Extended Abstract) (EK, YM), pp. 455–464.
ICALP-1991-CasasDM #random: Static on Random Trees (RC, JD, CM), pp. 186–203.
ICALP-1991-GrogerT #linear #on the: On Linear Decision Trees Computing Boolean Functions (HDG, GT), pp. 707–718.
FPCA-1991-AikenM #implementation: Implementing Regular Tree Expressions (AA, BRM), pp. 427–447.
CHI-1991-RobertsonMC #3d #visualisation: Cone Trees: animated 3D visualizations of hierarchical information (GGR, JDM, SKC), pp. 189–194.
KDD-1991-ChenM #estimation #summary #using: Summary Data Estimation Using Decision Trees (MCC, LM), pp. 309–324.
KDD-1991-ManagoK #induction: Induction of Decision Trees from Complex Structured Data (MM, YK), pp. 289–308.
ML-1991-CrawfordFAT #classification #information retrieval: Classification Trees for Information Retrieval (SLC, RMF, LAA, RMT), pp. 245–249.
ML-1991-WatanabeR: Feature Construction in Structural Decision Trees (LW, LAR), pp. 218–222.
ML-1991-WatanabeY #3d #induction: Decision Tree Induction of 3-D Manufacturing Features (LW, SY), pp. 650–654.
PLILP-1991-Loyola #animation #debugging #execution #logic programming: Extending Execution Trees for Debugging and Animation in Logic Programming (DL), pp. 419–420.
CAV-1991-HiraishiHOY #logic #model checking #verification: Vectorized Symbolic Model Checking of Computation Tree Logic for Sequential Machine Verification (HH, KH, HO, SY), pp. 214–224.
CSL-1991-ThistleW #automaton #problem: Control of ω-Automata, Church’s Problem, and the Emptiness Problem for Tree ω-Automata (JGT, WMW), pp. 367–382.
RTA-1991-CoquideDGV #automaton #bottom-up #term rewriting: Bottom-Up Tree Pushdown Automata and Rewrite Systems (JLC, MD, RG, SV), pp. 287–298.
RTA-1991-Graf #pattern matching: Left-to-Right Tree Pattern Matching (AG), pp. 323–334.
RTA-1991-Kucherov #on the #term rewriting: On Relationship Between Term Rewriting Systems and Regular Tree Languages (GK), pp. 299–311.
PODS-1990-JohnsonS #algorithm #analysis #concurrent #framework #performance: A Framework for the Performance Analysis of Concurrent B-tree Algorithms (TJ, DS), pp. 273–287.
SIGMOD-1990-BeckmannKSS #performance #robust: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles (NB, HPK, RS, BS), pp. 322–331.
SIGMOD-1990-RosenthalG #graph #implementation #query: Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins (AR, CAGL), pp. 291–299.
VLDB-1990-AgrawalA #approach #performance #protocol: The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data (DA, AEA), pp. 243–254.
VLDB-1990-HardjonoS: Search Key Substitution in the Encipherment of B-Trees (TH, JS), pp. 50–58.
VLDB-1990-Mohan #concurrent #multi #named #transaction: ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes (CM), pp. 392–405.
VLDB-1990-SeegerK #database #performance #robust: The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems (BS, HPK), pp. 590–601.
PLDI-1990-Wendt #code generation #performance #using: Fast Code Generation Using Automatically-Generated Decision Trees (ALW), pp. 9–15.
STOC-1990-Cole #on the: On the Dynamic Finger Conjecture for Splay Trees (Extended Abstract) (RC0), pp. 8–17.
STOC-1990-FredmanW: BLASTING through the Information Theoretic Barrier with FUSION TREES (MLF, DEW), pp. 1–7.
STOC-1990-SundarT #sequence #set: Unique Binary Search Tree Representations and Equality-testing of Sets and Sequences (RS, RET), pp. 18–25.
ICALP-1990-BattistaT #algorithm #graph #online: On-Line Graph Algorithms with SPQR-Trees (GDB, RT), pp. 598–611.
ICALP-1990-ColeGO #diagrams #parallel #performance: Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version) (RC, MTG, CÓ), pp. 432–445.
GG-1990-Engelfriet #graph #higher-order #logic #monad: A Characterization of Context-Free NCE Graph Languages by Monadic Second-Order Logic on Trees (JE), pp. 311–327.
GG-1990-Lautemann #automaton #composition: Tree Automata, Tree Decomposition and Hyperedge Replacement (CL), pp. 520–537.
ML-1990-KoMT #learning #string: Learning String Patterns and Tree Patterns from Examples (KIK, AM, WGT), pp. 384–391.
ML-1990-UtgoffB #incremental #multi: An Incremental Method for Finding Multivariate Splits for Decision Trees (PEU, CEB), pp. 58–65.
ML-1990-Velde #incremental #induction: Incremental Induction of Topologically Minimal Trees (WVdV), pp. 66–74.
WAGA-1990-Vorthmann #coordination #evaluation #incremental #thread: Coordinated Incremental Attribute Evaluation on a DR-Threaded Tree (SAV), pp. 207–221.
WAGA-1990-Wilhelm #attribute grammar #functional: Tree Tranformations, Functional Languages, and Attribute Grammars (RW), pp. 116–129.
CC-1990-HartwigSS #ada #implementation #interface #specification: Specification and Implementation of a Tree-Abiding Interface for Ada (Extended Abstract) (MH, ES, RS), pp. 215–216.
CAV-1990-HiraishiMH #logic #model checking: Vectorized Model Checking for Computation Tree Logic (HH, SM, KH), pp. 44–53.
CLP-1990-ZhouTU90 #automaton #prolog: A Matching Tree Oriented Abstract Machine for Prolog (NFZ, TT, KU), pp. 159–173.
CSL-1990-ArnborgPS #automaton #higher-order #logic #monad: Monadic Second Order Logic, Tree Automata and Forbidden Minors (SA, AP, DS), pp. 1–16.
NACLP-1990-KligerS #graph: From Decision Trees to Decision Graphs (SK, EYS), pp. 97–116.
DAC-1989-CahnK #clustering #network: Computing Signal Delay in General RC Networks by Tree/Link Partitioning (PKC, KK), pp. 485–490.
DAC-1989-HedenstiernaJ #design #layout: The Use of Inverse Layout Trees for Hierarchical Design Rule Checking (NH, KOJ), pp. 508–512.
DAC-1989-HoVW #approach #problem: A New Approach to the Rectilinear Steiner Tree Problem (JMH, GV, CKW), pp. 161–166.
DAC-1989-Vijayan #clustering: Min-cost Partitioning on a Tree Structure and Applications (GV), pp. 771–774.
PODS-1989-FuK #concurrent #transaction: Concurrency Control of Nested Transactions Accessing B-Trees (AWCF, TK), pp. 270–285.
PODS-1989-JohnsonS: Utilization of B-trees with Inserts, Deletes and Modifies (TJ, DS), pp. 235–246.
PODS-1989-RamakrishnanSUV #theorem: Proof-Tree Transformation Theorems and Their Applications (RR, YS, JDU, MYV), pp. 172–181.
VLDB-1989-HenrichSW #multi: The LSD tree: Spatial Access to Multidimensional Point and Nonpoint Objects (AH, HWS, PW), pp. 45–53.
VLDB-1989-Muralikrishna #algorithm #data flow #optimisation #query: Optimization and Dataflow Algorithms for Nested Tree Queries (MM), pp. 77–85.
VLDB-1989-OlkenR #random: Random Sampling from B+ Trees (FO, DR), pp. 269–277.
STOC-1989-Nisan: CREW PRAMs and Decision Trees (NN), pp. 327–335.
ICALP-1989-DarondeauD: Causal Trees (PD, PD), pp. 234–248.
ML-1989-SpanglerFU #induction: Induction of Decision Trees from Inconclusive Data (WSS, UMF, RU), pp. 146–150.
VLDB-1988-OrlandicP: Compact 0-Complete Trees (RO, JLP), pp. 372–381.
ESOP-1988-GiegerichS #parsing #pattern matching: Code Selection Techniques: Pattern Matching, Tree Parsing, and Inversion of Derivors (RG, KS), pp. 247–268.
ESOP-1988-Heckmann #functional #specification: A Functional Language for the Specification of Complex Tree Transformations (RH), pp. 175–190.
ESOP-1988-Heckmann88a #functional #specification: A Functional Language for the Specification of Complex Tree Transformations (System Exhibition) (RH), p. 380.
ESOP-1988-Wadler #deforestation #named #source code: Deforestation: Transforming Programs to Eliminate Trees (PW), pp. 344–358.
ICALP-1988-ArnborgLS #graph #problem: Problems Easy for Tree-Decomposable Graphs (Extended Abstract) (SA, JL, DS), pp. 38–51.
ICALP-1988-KirschenhoferPS: Do We Really Need to Balance Patricia Trees? (Extended Abstract) (PK, HP, WS), pp. 302–316.
ICALP-1988-RameshR #pattern matching: Nonlinear Pattern Matching in Trees (RR, IVR), pp. 473–488.
ML-1988-ChengFIQ: Improved Decision Trees: A Generalized Version of ID3 (JC, UMF, KBI, ZQ), pp. 100–106.
ML-1988-Quinlan #classification #comparison #empirical #search-based: An Empirical Comparison of Genetic and Decision-Tree Classifiers (JRQ), pp. 135–141.
ALP-1988-FulopV #automaton #linear #set #term rewriting: A Characterization of Irreducible Sets Modulo Left-Linear Term Rewriting Systems by Tree Automata (ZF, SV), p. 157.
POPL-1988-Pelegri-LlopartG #code generation: Optimal Code Generation for Expression Trees: An Application of BURS Theory (EPL, SLG), pp. 294–308.
ICSE-1988-ChaLS #analysis #fault #safety #using #verification: Safety Verification in Murphy Using Fault Tree Analysis (SSC, NGL, TJS), pp. 377–387.
CCHSC-1988-Alblas: Attributed Tree Transformations with Delayed and Smart Re-Evaluation (HA), pp. 160–174.
CCHSC-1988-WeisgerberW #pattern matching: Two Tree Pattern Matchers for Code Selection (BW, RW), pp. 215–229.
CSL-1988-Wagner #automaton #logic #on the #problem #source code: On the Emptiness Problem of Tree Automata and Completeness of Modal Logics of Programs (HW), pp. 384–399.
JICSCP-1988-BruffaertsH88 #prolog #proving: Proof Trees for Negation as Failure: Yet Another Prolog Meta-Interpreter (AB, EH), pp. 343–358.
JICSCP-1988-KlingerS88 #algorithm #compilation #exclamation: A Decision Tree Compilation Algorithm for FCP(!, : , ?) (SK, EYS), pp. 1315–1336.
LICS-1988-Maher #algebra #axiom #finite #infinity: Complete Axiomatizations of the Algebras of Finite, Rational and Infinite Trees (MJM), pp. 348–357.
PODS-1987-Biliris: Operation Specific Locking in B-Trees (AB), pp. 159–169.
PODS-1987-Dechter: Decomposing an N-ary Relation into a Tree of Binary Relations (RD), pp. 185–189.
VLDB-1987-Dayal #approach #quantifier #query: Of Nests and Trees: A Unified Approach to Processing Queries That Contain Nested Subqueries, Aggregates, and Quantifiers (UD), pp. 197–208.
VLDB-1987-SellisRF #multi: The R+-Tree: A Dynamic Index for Multi-Dimensional Objects (TKS, NR, CF), pp. 507–518.
STOC-1987-Awerbuch #algorithm #distributed #problem #summary: Optimal Distributed Algorithms for Minimum Weight Spanning Tree, Counting, Leader Election and Related Problems (Detailed Summary) (BA), pp. 230–240.
ICALP-1987-HaferT #logic #monad #quantifier: Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary Tree (TH, WT), pp. 269–279.
ICALP-1987-LandauSV #parallel: Parallel Construction of a Suffix Tree (Extended Abstract) (GML, BS, UV), pp. 314–325.
ICALP-1987-LevcopoulosLS #geometry #heuristic: Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract) (CL, AL, JRS), pp. 376–385.
ICALP-1987-Tsakalidis: The Nearest Common Ancestor in a Dynamic Tree (AKT), pp. 489–498.
POPL-1987-Chase #bottom-up #pattern matching: An Improvement to Bottom-up Tree Pattern Matching (DRC), pp. 168–177.
LICS-1987-Thomas #first-order #infinity #logic #on the: On Chain Logic, Path Logic, and First-Order Logic over Infinite Trees (WT), pp. 245–256.
RTA-1987-RameshR #parallel #pattern matching: Optimal Speedups for Parallel Pattern Matching in Trees (RR, IVR), pp. 274–285.
DAC-1986-NgTR: A language for describing rectilinear Steiner tree configurations (APCN, CDT, PR), pp. 659–662.
PODS-1986-Otoo #multi: Balanced Multidimensional Extendible Hash Tree (EJO), pp. 100–113.
PODS-1986-SagivS #equivalence #query: The Equivalence of Solving Queries and Production Tree Projections (YS, OS), pp. 160–172.
STOC-1986-Bern #probability: Two Probabilistic Results on Rectilinear Steiner Trees (MWB), pp. 433–441.
ICALP-1986-KirschenhoferP: Some Further Results on Digital Search Trees (PK, HP), pp. 177–185.
ICALP-1986-MonienS: Min Cut is NP-Complete for Edge Weighted Trees (BM, IHS), pp. 265–274.
ICALP-1986-MullerSS #automaton #complexity #monad: Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity (DEM, AS, PES), pp. 275–283.
ICALP-1986-VarmanD #algorithm #parallel: A Parallel Vertex Insertion Algorithm For Minimum Spanning Trees (PJV, KD), pp. 424–433.
SIGIR-1986-Deppisch #named #retrieval: S-Tree: A Dynamic Balanced Signature Index for Office Retrieval (UD), pp. 77–87.
POPL-1986-HatcherC #bottom-up #code generation #pattern matching: High-Quality Code Generation Via Bottom-Up Tree Pattern Matching (PJH, TWC), pp. 119–130.
ICLP-1986-NilssonT86 #traversal: Cyclic Tree Traversal (MN, HT), pp. 593–599.
PODS-1985-Sagiv #concurrent: Concurrent Operations on B-Trees with Overtaking (YS), pp. 28–37.
SIGMOD-1985-BeckleyER #multi #retrieval: Multikey Retrieval from K-d Trees and Quad-Trees (DAB, MWE, VKR), pp. 291–301.
SIGMOD-1985-RoussopoulosL #database #using: Direct Spatial Search on Pictorial Databases Using Packed R-Trees (NR, DL), pp. 17–31.
VLDB-1985-MondR #concurrent #database #using: Concurrency Control in B+-Trees Databases Using Preparatory Operations (YM, YR), pp. 331–334.
STOC-1985-Culberson: The Effect of Updates in Binary Search Trees (JCC), pp. 205–212.
ICALP-1985-EngelfrietV #transducer: Characterization of High Level Tree Transducers (JE, HV), pp. 171–178.
SIGIR-1985-ArnowTW #multi #named #performance: P-Trees: Storage Efficient Multiway Trees (DMA, AMT, CW), pp. 111–121.
POPL-1985-AhoG #code generation #pattern matching #performance: Efficient Tree Pattern Matching: An Aid to Code Generation (AVA, MG), pp. 334–340.
PODS-1984-FordC #algorithm #concurrent: Concurrency Control Mechanisms and the Serializability of Concurrent Tree Algorithms (RF, JC), pp. 51–60.
SIGMOD-1984-ArnowT #comparison #empirical #multi: An Empirical Comparison of B-Trees, Compact B-Trees and Multiway Trees (DMA, AMT), pp. 33–46.
SIGMOD-1984-Guttman #named: R-Trees: A Dynamic Index Structure for Spatial Searching (AG), pp. 47–57.
SIGMOD-1984-ValduriezV #multi #using: A Multikey Hashing Scheme Using Predicate Trees (PV, YV), pp. 107–114.
VLDB-1984-PrabhakarS #towards: Towards an Optimal Data-Structure: CB-trees (TVP, HVS), pp. 235–244.
SCC-1984-KellerPPM #case study #experience: Tree transformation techniques and experiences (SEK, JAP, TFP, SPM), pp. 190–201.
STOC-1984-Clarkson #algorithm #approximate #geometry #performance: Fast Expected-Time and Approximation Algorithms for Geometric Minimum Spanning Trees (Extended Abstract) (KLC), pp. 342–348.
STOC-1984-Harel #infinity: A General Result on Infinite Trees and Its Applications (Preliminary Report) (DH), pp. 418–427.
ICALP-1984-KirschenhoferP #algorithm #analysis #recursion #traversal: Recursion Depth Analysis for Special Tree Traversal Algorithms (PK, HP), pp. 303–311.
ICALP-1984-Tsakalidis #locality: AVL-Trees for Localized Search (AKT), pp. 473–485.
CADE-1984-Miller #deduction #proving: Expansion Tree Proofs and Their Conversion to Natural Deduction Proofs (DM), pp. 375–393.
ILPC-1984-Pique84 #equation #prolog: Drawing Trees and their Equations in Prolog (JFP), pp. 23–33.
ILPC-1984-StepankovaS84 #logic programming #source code: Computation Trees and Transformations of Logic Programs (OS, PS), pp. 53–63.
PODS-1983-GoodmanST83a #canonical #reduction: GYO Reductions, Canonical Connections, Tree and Cyclic Schemas and Tree Projections (NG, OS, YCT), pp. 267–278.
PODS-1983-MunroP #reduction #robust: A Discipline for Robustness or Storage Reduction in Binary Search Trees (JIM, PVP), pp. 70–75.
STOC-1983-Ben-Or #algebra #bound: Lower Bounds for Algebraic Computation Trees (Preliminary Report) (MBO), pp. 80–86.
STOC-1983-Frederickson #data type #online: Data Structures for On-Line Updating of Minimum Spanning Trees (Preliminary Version) (GNF), pp. 252–257.
STOC-1983-SleatorT #self: Self-Adjusting Binary Trees (DDS, RET), pp. 235–245.
ICALP-1983-Fraenkel #fibonacci #game studies: Wythoff Games, Continued Fractions, Cedar Trees and Fibonacci Searches (ASF), pp. 203–225.
ICALP-1983-Indermark #complexity #infinity: Complexity of Infinite Trees (KI), pp. 347–360.
ICALP-1983-Kamimura #attribute grammar #automaton: Tree Automata and Attribute Grammars (TK), pp. 374–384.
ICALP-1983-PaulVW #parallel: Parallel Dictionaries in 2-3 Trees (WJP, UV, HW), pp. 597–609.
ICALP-1983-Winskel: Synchronisation Trees (GW), pp. 695–711.
DAC-1982-Kedem #algorithm #data type #online: The quad-CIF tree: A data structure for hierarchical on-line algorithms (GK), pp. 352–357.
PODS-1982-GoodmanS #query: The Tree Property is Fundamental for Query Processing (NG, OS), pp. 40–48.
PODS-1982-GoodmanS82a: Transforming Cyclic Schemas into Trees (NG, OS), pp. 49–54.
STOC-1982-BhattL #how: How to Assemble Tree Machines (Extended Abstract) (SNB, CEL), pp. 77–84.
STOC-1982-GurevichH #automaton #game studies: Trees, Automata, and Games (YG, LH), pp. 60–65.
STOC-1982-ManberT #nondeterminism #probability: Probabilistic, Nondeterministic, and Alternating Decision Trees (UM, MT), pp. 234–244.
ICALP-1982-Niwinski #algebra #fixpoint #semantics: Fixed-Point Semantics for Algebraic (Tree) Grammars (Extended Abstract) (DN), pp. 384–396.
GG-1982-SanfeliuF #graph grammar #pattern matching #pattern recognition #recognition: Tree graph grammars for pattern recognition (AS, KSF), pp. 349–368.
DAC-1981-PenfieldR #network: Signal delay in RC tree networks (PPJ, JR), pp. 613–617.
SIGMOD-1981-Batory #comparison #performance: B+ Trees and Indexed Sequential Files: A Performance Comparison (DSB), pp. 30–39.
SIGMOD-1981-Robinson #multi #scalability: The K-D-B-Tree: A Search Structure For Large Multidimensional Dynamic Indexes (JTR), pp. 10–18.
VLDB-1981-Karlsson: Reduced Cover-Trees and their Application in the Sabre Access Path Model (KK), pp. 345–353.
VLDB-1981-Lomet: Digital B-Trees (DBL), pp. 333–344.
STOC-1981-HawrusikVY: Classes of Functions for Computing on Binary Trees (Extended Abstract) (FMH, KNV, AY), pp. 19–27.
STOC-1981-HongR #graph: Graphs that Are Almost Binary Trees (Preliminary Version) (JWH, ALR), pp. 334–341.
STOC-1981-King #metric #parallel: Measures of Parallelism in Alternating Computation Trees (Extended Abstract) (KNK), pp. 189–201.
STOC-1981-PatersonRS #bound: Bounds on Minimax Edge Length for Complete Binary Trees (Extended Abstract) (MP, WLR, LS), pp. 293–299.
STOC-1981-SleatorT #data type: A Data Structure for Dynamic Trees (DDS, RET), pp. 114–122.
ICALP-1981-Snir #bound #proving: Proving Lower Bounds for Linar Decision Trees (MS), pp. 305–315.
PS-1981-Steensgaard-Madsen #specification: Program Specification by Module Trees (JSM), pp. 294–321.
ICSE-1981-BlackTM #implementation #robust: A Robust B-Tree Implementation (JPB, DJT, DEM), pp. 63–70.
SIGMOD-1980-ChiuH #query: A Methodology for Interpreting Tree Queries Into Optimal Semi-Join Expressions (DMC, YCH), pp. 169–178.
SIGMOD-1980-GudesT: Experiments with B-Tree Reorganization (EG, ST), pp. 200–206.
SIGMOD-1980-KwongW #concurrent #on the: On B-Trees: Routing Schemes and Concurrency (YSK, DW), pp. 207–211.
STOC-1980-FischerP #layout: Optimal Tree Layout (Preliminary Version) (MJF, MP), pp. 177–189.
ICALP-1980-BeckerPS #algorithm #clustering: A Shifting Algorithm for Min-Max Tree Partitioning (RIB, YP, SRS), pp. 64–75.
ICALP-1980-FlajoletS #algorithm #analysis #on the: On the Analysis of Tree-Matching Algorithms (PF, JMS), pp. 208–219.
ICALP-1980-Reischuk #implementation #multi #performance: A “Fast Implementation” of a Multidimensional Storage into a Tree Storage (RR), pp. 531–542.
SDCG-1980-DeRemerJ #compilation: Tree-affix dendrogrammars for languages and compilers (FD, RJ), pp. 300–319.
SIGMOD-1979-Lomet #multi: Multi-Table Search for B-Tree Files (DBL), pp. 35–42.
SIGMOD-1979-RosenbergS: Compact B-Trees (ALR, LS), pp. 43–51.
VLDB-1979-Hardgrave #ambiguity #case study #query: Ambiguity in Processing Boolean Queries on TDMS Tree Structures: A Study of Four Different Philosophies (WTH), pp. 373–397.
STOC-1979-RosenbergWG #data type: Storage Representations for Tree-Like Data Structures (ALR, DW, ZG), pp. 99–107.
STOC-1979-Ruzzo #bound: Tree-Size Bounded Alternation (WLR), pp. 352–359.
ICALP-1979-Kemp #distributed #on the #stack: On the Average Stack Size of Regularly Distributed Binary Trees (RK), pp. 340–355.
ICALP-1979-KuichPU #on the: On the Height of Derivation Trees (WK, HP, FJU), pp. 370–384.
ICALP-1979-PapadimitriouY #complexity #problem #strict: The Complexity of Restricted Minimum Spanning Tree Problems (Extended Abstract) (CHP, MY), pp. 460–470.
SIGIR-1979-Mazlack #comparison #database #empirical: An Empirical Comparison: Tree and Lattice Structures for Symbolic Data Bases (LJM), pp. 33–40.
POPL-1979-HoffmanO #generative #interpreter #pattern matching #using: Interpreter Generation Using Tree Pattern Matching (CMH, MJO), pp. 169–179.
VLDB-1978-KungL #concurrent #database #problem: A Concurrent Database Manipulation Problem: Binary Search Trees (Abstract) (HTK, PLL), p. 498.
STOC-1978-EngelfrietRS #transducer: Tree Transducers, L Systems and Two-Way Machines (Extended Abstract) (JE, GR, GS), pp. 66–74.
GG-1978-CatalanoGM #algebra #framework #problem: Shortest Path Problems and Tree Grammars: An Algebraic Framework (AC, SG, UM), pp. 167–179.
SIGIR-1978-EastmanW #algorithm #documentation #nearest neighbour #retrieval: A Tree Algorithm For Nearest Neighbor Searching In Document Retrieval Systems (CME, SFW), pp. 131–149.
ICALP-1977-BackhouseL #graph: Factor Graphs, Failure Functions and BI-Trees (RCB, RKL), pp. 61–75.
ICALP-1977-Takahashi: Rational relations of Binary Trees (MT), pp. 524–538.
VLDB-J-1975-BayerM76 #on the #random: On the Encipherment of Search Trees and Random Access Files (RB, JKM), pp. 37–52.
ICALP-1976-Leeuwen #on the: On the Construction of Huffman Trees (JvL), pp. 382–410.
VLDB-1975-BayerM #on the #random: On the Encipherment of Search Trees and Random Access Files (RB, JKM), p. 452.
VLDB-1975-LienTDR #implementation #towards: Binary Search Tree Complex — Towards the Implementation of Relations (YEL, CET, JRD, MLR), pp. 540–542.
STOC-1975-AhoJ #code generation: Optimal Code Generation for Expression Trees (AVA, SCJ), pp. 207–217.
STOC-1975-Fredman #probability #sorting: Two Applications of a Probabilistic Search Technique: Sorting x + y and Building Balanced Search Trees (MLF), pp. 240–244.
STOC-1975-Perrault #theorem #transducer: Intercalation Theorems for Tree Transducer Languages (CRP), pp. 126–136.
STOC-1973-AhoHU #on the: On Finding Lowest Common Ancestors in Trees (AVA, JEH, JDU), pp. 253–265.
STOC-1973-Baker #product line: Tree Transductions and Families of Tree Languges (BSB), pp. 200–206.
SIGFIDET-1972-Nievergelt: Binary Search Trees and File Organization (JN), pp. 165–187.
SIGFIDET-1972-WalkerG #data type #hybrid: Hybrid Trees: A Data Structure for Lists of Keys (WAW, CCG), pp. 189–211.
STOC-1972-KarpMR #agile #array #identification #string: Rapid Identification of Repeated Patterns in Strings, Trees and Arrays (RMK, REM, ALR), pp. 125–136.
STOC-1972-NievergeltR #bound: Binary Search Trees of Bounded Balance (JN, EMR), pp. 137–142.
STOC-1972-OgdenR #composition #transducer: Compositions of n Tree Transducers (WFO, WCR), pp. 198–206.
ICALP-1972-JoshiLT #generative: A Tree Generating System (AKJ, LSL, MT), pp. 453–465.
SIGFIDET-1971-Bayer #memory management: Binary B-Trees for Virtual Memory (RB), pp. 219–235.
SIGFIDET-1971-MaineR #optimisation: Storage Optimization of Tree Structured Files (TRJ, PADdM), pp. 207–217.
STOC-1971-LevyJ #automaton: Some Results in Tree Automata (LSL, AKJ), pp. 78–85.
STOC-1971-Meyers #linear #representation: Linear Representation of Tree Structure: A Mathematical Theory of Parenthesis-Free Notations (WJM), pp. 50–62.
SIGIR-1971-Knott #algorithm #retrieval: A Balanced Tree Storage and Retrieval Algorithm (GDK), pp. 175–196.
STOC-1970-Ellis #automaton #probability: Probabilistic Tree Automata (CAE), pp. 198–205.
STOC-1970-MartinV #on the #transducer: On Syntax-Directed Transduction and Tree Transducers (DFM, SAV), pp. 129–135.
STOC-1970-Rosen #theorem: Tree-Manipulating Systems and Church-Rosser Theorems (BKR), pp. 117–127.
STOC-1970-Rounds #proving #theorem: Tree-Oriented Proofs of Some Theorems on Context-Free and Indexed Languages (WCR), pp. 109–116.
STOC-1969-Rounds #context-free grammar: Context-Free Grammars on Trees (WCR), pp. 143–148.