Stem prune$ (all stems)

135 papers:

CASE-2015-WareS #synthesis #using

Synthesis time optimal accepting traces using language projection and pruning (SW, RS), pp. 1363–1368.

KDD-2015-BegumUWK #clustering #novel

Accelerating Dynamic Time Warping Clustering with a Novel Admissible Pruning Strategy (NB, LU, JW, EJK), pp. 49–58.

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

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

ASE-2014-CaiS #dependence #impact analysis #named #precise #using

Diver: precise dynamic impact analysis using dependence-based trace pruning (HC, RAS), pp. 343–348.

SCAM-2014-LiangSMKH #analysis #automaton #exception

Pruning, Pushdown Exception-Flow Analysis (SL, WS, MM, AWK, DVH), pp. 265–274.

VISSOFT-2014-HaugenK #constraints #visualisation

Search Space Pruning Constraints Visualization (BH, JK), pp. 30–39.

ICPR-2014-SerinoB #3d

Pruning the 3D Curve Skeleton (LS, GSdB), pp. 2269–2274.

SIGIR-2014-TongWZ #corpus #taxonomy

Principled dictionary pruning for low-memory corpus compression (JT, AW, JZ), pp. 283–292.

SIGMOD-2013-AkibaIY #distance #network #performance #query #scalability

Fast exact shortest-path distance queries on large networks by pruned landmark labeling (TA, YI, YY), pp. 349–360.

STOC-2013-Har-PeledR #algorithm #distance #linear #problem

Net and prune: a linear time algorithm for euclidean distance problems (SHP, BAR), pp. 605–614.

CIKM-2013-BroccoloMOOPST #distributed

Load-sensitive selective pruning for distributed search (DB, CM, SO, IO, RP, FS, NT), pp. 379–388.

ICML-c3-2013-AppelFDP

Quickly Boosting Decision Trees — Pruning Underachieving Features Early (RA, TJF, PD, PP), pp. 594–602.

SIGIR-2013-ChenL

An information-theoretic account of static index pruning (RCC, CJL), pp. 163–172.

PADL-2013-GuzmanCH

Supporting Pruning in Tabled LP (PCdG, MC, MVH), pp. 60–76.

DATE-2012-PiscitelliP #analysis #design #hybrid

Design space pruning through hybrid analysis in system-level design space exploration (RP, ADP), pp. 781–786.

CIKM-2012-ChenLTH

Information preservation in static index pruning (RCC, CJL, CMT, JH), pp. 2487–2490.

CIKM-2012-PatwardhanBAMC

Labeling by landscaping: classifying tokens in context by pruning and decorating trees (SP, BB, AA, AM, JCC), pp. 1133–1142.

ECIR-2012-ToramanC #categorisation #performance

Squeezing the Ensemble Pruning: Faster and More Accurate Categorization for News Portals (CT, FC), pp. 508–511.

ICPR-2012-AhmedA #gesture #modelling #using

Flow Modeling and skin-based Gaussian pruning to recognize gestural actions using HMM (ORA, AAH), pp. 3488–3491.

KEOD-2012-LeraJP #metric #ontology #summary

Ontology Summarization through Simple Pruning Measures (IL, CJ, RP), pp. 339–342.

SIGIR-2012-MacdonaldTO12a #effectiveness #learning #rank #safety

Effect of dynamic pruning safety on learning to rank effectiveness (CM, NT, IO), pp. 1051–1052.

IJCAR-2012-LatteL #branch #exclamation

Branching Time? Pruning Time! (ML, ML), pp. 393–407.

DAC-2011-ChenO #fault #statistics

Diagnosing scan clock delay faults through statistical timing pruning (MC, AO), pp. 423–428.

DATE-2011-AndalamRG #analysis #source code

Pruning infeasible paths for tight WCRT analysis of synchronous programs (SA, PSR, AG), pp. 204–209.

DATE-2011-AvinashENPP #design #energy #probability

Energy parsimonious circuit design through probabilistic pruning (LA, CCE, JLN, KVP, CP), pp. 764–769.

ICDAR-2011-NeumannM #image #locality #using

Text Localization in Real-World Images Using Efficiently Pruned Exhaustive Search (LN, JM), pp. 687–691.

ICDAR-2011-NobileHSLS #verification

Digit/Symbol Pruning and Verification for Arabic Handwritten Digit/Symbol Spotting (NN, CLH, MWS, LL, CYS), pp. 648–652.

VLDB-2011-WangYYZP #database #nondeterminism #on the #ranking

On Pruning for Top-K Ranking in Uncertain Databases (CW, LYY, JHY, ORZ, JP), pp. 598–609.

PLDI-2011-LiangN #abstraction #refinement #scalability

Scaling abstraction refinement via pruning (PL, MN), pp. 590–601.

ECIR-2011-ThotaC #statistics #testing

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

ICML-2011-KpotufeL #clustering #nearest neighbour

Pruning nearest neighbor cluster trees (SK, UvL), pp. 225–232.

SIGIR-2011-TonellottoMO #order #retrieval

Effect of different docid orderings on dynamic pruning retrieval strategies (NT, CM, IO), pp. 1179–1180.

POPL-2011-PouchetBBCRSV #optimisation

Loop transformations: convexity, pruning and optimization (LNP, UB, CB, AC, JR, PS, NV), pp. 549–562.

LCTES-2011-BhagatGSG #effectiveness #optimisation

Global productiveness propagation: a code optimization technique to speculatively prune useless narrow computations (IB, EG, FJS, AG), pp. 161–170.

CAV-2011-ChinGVLCQ #calculus #verification

A Specialization Calculus for Pruning Disjunctive Predicates to Support Verification (WNC, CG, RV, QLL, FC, SQ), pp. 293–309.

ASE-2010-BoucherCHBD #approach #implementation #product line

Tag and prune: a pragmatic approach to software product line implementation (QB, AC, PH, AB, LD), pp. 333–336.

SIGMOD-2010-EmrichKKRZ

Boosting spatial pruning: on optimal pruning of MBRs (TE, HPK, PK, MR, AZ), pp. 39–50.

SEFM-2010-CristiaAM #detection #framework #testing

Pruning Testing Trees in the Test Template Framework by Detecting Mathematical Contradictions (MC, PA, PRM), pp. 268–277.

ECIR-2010-AltingovdeAU #retrieval #using #xml

XML Retrieval Using Pruned Element-Index Files (ISA, DA, ÖU), pp. 306–318.

KDD-2010-LuWZB

Ensemble pruning via individual contribution ordering (ZL, XW, XZ, JB), pp. 871–880.

SAC-2010-JiaLLZ #satisfiability

Local lemma: a new strategy of pruning in SAT solvers (XJ, RL, SL, JZ), pp. 2071–2072.

DAC-2009-CallegariWB #analysis #ranking

Speedpath analysis based on hypothesis pruning and ranking (NC, LCW, PB), pp. 346–351.

SIGMOD-2009-KimC #documentation #named #performance #query #retrieval

Skip-and-prune: cosine-based top-k query processing for efficient context-sensitive document retrieval (JWK, KSC), pp. 115–126.

VISSOFT-2009-BohnetKD #execution #visualisation

Visualizing massively pruned execution traces to facilitate trace exploration (JB, MK, JD), pp. 57–64.

CIKM-2009-AltingovdeOU #query #web

Exploiting query views for static index pruning in web search engines (ISA, RO, ÖU), pp. 1951–1954.

ECIR-2009-AltingovdeOU09a

A Practitioner’s Guide for Static Index Pruning (ISA, RO, ÖU), pp. 675–679.

ECIR-2009-ZhengC

Entropy-Based Static Index Pruning (LZ, IJC), pp. 713–718.

MLDM-2009-LoglisciM #mining #multi

Mining Multiple Level Non-redundant Association Rules through Two-Fold Pruning of Redundancies (CL, DM), pp. 251–265.

MoDELS-2009-SenMBJ #metamodelling

Meta-model Pruning (SS, NM, BB, JMJ), pp. 32–46.

MoDELS-2009-SenMBJ #metamodelling

Meta-model Pruning (SS, NM, BB, JMJ), pp. 32–46.

ESEC-FSE-2009-WangCGY #concurrent

Symbolic pruning of concurrent program executions (CW, SC, AG, YY), pp. 23–32.

ASPLOS-2009-BondM

Leak pruning (MDB, KSM), pp. 277–288.

ICST-2009-BardinH #generative #testing

Pruning the Search Space in Path-Based Test Generation (SB, PH), pp. 240–249.

CSMR-2008-MendeBKM #clone detection #detection #evolution #product line #using

Supporting the Grow-and-Prune Model in Software Product Lines Evolution Using Clone Detection (TM, FB, RK, GM), pp. 163–172.

CIKM-2008-Coetzee #n-gram #named

TinyLex: static n-gram index pruning with perfect recall (DC), pp. 409–418.

CIKM-2008-GueniACW #query #xquery

Pruning nested XQuery queries (BG, TA, BC, EW), pp. 541–550.

ICPR-2008-ZhongGA #algorithm #classification

Properties of the k-norm pruning algorithm for decision tree classifiers (MZ, MG, GCA), pp. 1–4.

SIGIR-2008-AltingovdeDCU #query

Site-based dynamic pruning for query processing in search engines (ISA, ED, FC, ÖU), pp. 861–862.

SIGIR-2008-SkobeltsynJPB #named #web

ResIn: a combination of results caching and index pruning for high-performance web search engines (GS, FJ, VP, RABY), pp. 131–138.

SAC-2008-ZengLL #fault tolerance #mining

Mining fault-tolerant frequent patterns efficiently with powerful pruning (JJZ, GL, CCL), pp. 927–931.

CGO-2008-RyooRSBUSH #gpu #optimisation #parallel #thread

Program optimization space pruning for a multithreaded gpu (SR, CIR, SSS, SSB, SZU, JAS, WmWH), pp. 195–204.

PODS-2007-ChierichettiPRSTU #clustering

Finding near neighbors through cluster pruning (FC, AP, PR, MS, AT, EU), pp. 103–112.

VLDB-2007-MoroBT

Early Profile Pruning on XML-aware Publish/Subscribe Systems (MMM, PB, VJT), pp. 866–877.

CIKM-2007-TsegayTZ #effectiveness

Dynamic index pruning for effective caching (YT, AT, JZ), pp. 987–990.

ECIR-2007-BlancoB

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

ECIR-2007-LiomaO #information retrieval

Light Syntactically-Based Index Pruning for Information Retrieval (CL, IO), pp. 88–100.

KDD-2007-TandonC #detection #network #validation

Weighting versus pruning in rule validation for detecting network and host anomalies (GT, PKC), pp. 697–706.

SIGIR-2007-BlancoB

Boosting static pruning of inverted files (RB, AB), pp. 777–778.

SIGIR-2007-NtoulasC #correctness #policy

Pruning policies for two-tiered inverted index with correctness guarantee (AN, JC), pp. 191–198.

PADL-2007-MorimotoTI #performance

Instantly Turning a Naive Exhaustive Search into Three Efficient Searches with Pruning (TM, YT, HI), pp. 65–79.

PLDI-2006-ZhangGG #dynamic analysis #slicing

Pruning dynamic slices with confidence (XZ, NG, RG), pp. 169–180.

CIKM-2006-AnhM #query

Pruning strategies for mixed-mode querying (VNA, AM), pp. 190–197.

CIKM-2006-ButtcherC #approach #retrieval

A document-centric approach to static index pruning in text retrieval systems (SB, CLAC), pp. 182–189.

CIKM-2006-ZhangF #correlation

Finding highly correlated pairs efficiently with powerful pruning (JZ, JF), pp. 152–161.

ICML-2006-Martinez-MunozS #order

Pruning in ordered bagging ensembles (GMM, AS), pp. 609–616.

SIGIR-2006-AnhM #evaluation #query #using

Pruned query evaluation using pre-computed impacts (VNA, AM), pp. 372–379.

SAC-2006-Goldsztejn #algorithm #approximate #branch #set

A branch and prune algorithm for the approximation of non-linear AE-solution sets (AG), pp. 1650–1654.

ITiCSE-2005-Massarelli

The difficult art of pruning in favour of creative thinking (RM), p. 368.

CIKM-2005-HuYSZS #mining #semantics

Mining undiscovered public knowledge from complementary and non-interactive biomedical literature through semantic pruning (XH, IY, MS, YZ, IYS), pp. 249–250.

CIKM-2004-RenRPS #detection

A vertical distance-based outlier detection method with local pruning (DR, IR, WP, KS), pp. 279–284.

ICPR-v2-2004-MadsenSHL #recognition

Pruning The Vocabulary For Better Context Recognition (REM, SS, LKH, JL), pp. 483–488.

ICPR-v3-2004-CarneiroJ #using

Pruning Local Feature Correspondences Using Shape Context (GC, ADJ), pp. 16–19.

ICPR-v4-2004-TaguchiOA #performance #using #visual notation

Fast Visual Search Using Simplified Pruning Rules — Streamlined Active Search (ST, SO, HA), pp. 937–940.

ECOOP-2004-SpoonS #precise #scalability #type inference

Demand-Driven Type Inference with Subgoal Pruning: Trading Precision for Scalability (SAS, OS), pp. 51–74.

PADL-2004-LopesCS

Pruning in the Extended Andorra Model (RL, VSC, FMAS), pp. 120–134.

CC-2004-RanganathH #concurrent #dependence #java #slicing #source code

Pruning Interference and Ready Dependence for Slicing Concurrent Java Programs (VPR, JH), pp. 39–56.

ICDAR-2003-HendersonS #analysis #approach

Symbolic Pruning in a Structural Approach to Engineering Drawing Analysis (TH, LS), pp. 180–184.

ICDAR-2003-MezghaniCM #online #recognition

Combination of Pruned Kohonen Maps for On-line Arabic Characters Recognition (NM, MC, AM), p. 900–?.

ESOP-2003-CastroW #approximate #logic programming

Approximate Pruning in Tabled Logic Programming (LFC, DSW), pp. 69–83.

KDD-2003-BayS #linear #mining

Mining distance-based outliers in near linear time with randomization and a simple pruning rule (SDB, MS), pp. 29–38.

KDD-2003-TantrumMS #assessment #clustering #modelling

Assessment and pruning of hierarchical model based clustering (JT, AM, WS), pp. 197–205.

ASIA-PEPM-2002-SheardL #analysis #search-based #using

Search-based binding time analysis using type-directed pruning (TS, NL), pp. 20–31.

CIKM-2002-LuC #distributed #documentation #information retrieval

Pruning long documents for distributed information retrieval (JL, JPC), pp. 332–339.

CIKM-2002-TrainaTFF #data access #how #metric

How to improve the pruning ability of dynamic metric access methods (CTJ, AJMT, RFSF, CF), pp. 219–226.

ICML-2002-ZubekD #heuristic #learning

Pruning Improves Heuristic Search for Cost-Sensitive Learning (VBZ, TGD), pp. 19–26.

ICPR-v2-2002-WindeattA

Tree Pruning for Output Coded Ensembles (TW, GA), pp. 92–95.

ICPR-v3-2002-AhmadyfardK #performance #recognition

Colour-Based Model Pruning for Efficient ARG Object Recognition (AA, JK), pp. 20–24.

ICPR-v3-2002-SilvestreL #bound #classification #optimisation

Optimization of Neural Classifiers Based on Bayesian Decision Boundaries and Idle Neurons Pruning (MRS, LLL), pp. 387–390.

KDD-2002-BucilaGKW #algorithm #constraints #named

DualMiner: a dual-pruning algorithm for itemsets with constraints (CB, JG, DK, WMW), pp. 42–51.

ICDAR-2001-VuoriLOK #online #prototype #recognition #set

Speeding Up On-line Recognition of Handwritten Characters by Pruning the Prototype Set (VV, JL, EO, JK), pp. 501–507.

SIGIR-2001-SofferCCFFHM #information retrieval

Static Index Pruning for Information Retrieval Systems (AS, DC, DC, RF, EF, MH, YSM), pp. 43–50.

DATE-2000-ManquinhoS #algorithm #on the #satisfiability #using

On Using Satisfiability-Based Pruning Techniques in Covering Algorithms (VMM, JPMS), pp. 356–363.

PODS-2000-MorishitaS #metric #statistics #traversal

Traversing Itemset Lattice with Statistical Metric Pruning (SM, JS), pp. 226–236.

ICML-2000-SebbanN #problem

Instance Pruning as an Information Preserving Problem (MS, RN), pp. 855–862.

ICPR-v3-2000-SalembierG

Connected Operators Based on Region-Tree Pruning Strategies (PS, JLG), pp. 3371–3374.

ICML-1999-CardieMP #classification #parsing

Combining Error-Driven Pruning and Classification for Partial Parsing (CC, SM, DRP), pp. 87–96.

KDD-1999-AyanTA #algorithm #performance #scalability

An Efficient Algorithm to Update Large Itemsets with Early Pruning (NFA, AUT, MEA), pp. 287–291.

KDD-1999-LiuHM

Pruning and Summarizing the Discovered Associations (BL, WH, YM), pp. 125–134.

ICLP-1999-OsorioJN #declarative #functional #query

Declarative Pruning in a Functional Query Language (MO, BJ, JCN), pp. 588–604.

SIGMOD-1998-NgLHP #mining #optimisation

Exploratory Mining and Pruning Optimizations of Constrained Association Rules (RTN, LVSL, JH, AP), pp. 13–24.

VLDB-1998-RastogiS #classification #named

PUBLIC: A Decision Tree Classifier that Integrates Building and Pruning (RR, KS), pp. 404–415.

CIKM-1998-Tang #incremental #performance #using

Using Incremental Pruning to Increase the Efficiency of Dynamic Itemset Counting for Association Rules (JT), pp. 273–280.

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-BesacierB #identification

Time and frequency pruning for speaker identification (LB, JFB), pp. 1619–1621.

CADE-1998-Letz #using

Using Matings for Pruning Connection Tableaux (RL), pp. 381–396.

ICDAR-1997-ChungY #comparison #feature model #performance #recognition

Performance comparison of several feature selection methods based on node pruning in handwritten character recognition (KC, JY), pp. 11–15.

ICDAR-1997-MadhvanathK #scalability #using #word

Pruning Large Lexicons Using Generalized Word Shape Descriptors (SM, VK), pp. 552–555.

ICML-1997-Mansour

Pessimistic decision tree pruning based Continuous-time (YM), pp. 202–210.

ICML-1997-MargineantuD #adaptation

Pruning Adaptive Boosting (DDM, TGD), pp. 211–218.

ICML-1997-WilsonM

Instance Pruning Techniques (DRW, TRM), pp. 403–411.

KDD-1997-JensenS #multi

Adjusting for Multiple Comparisons in Decision Tree Pruning (DJ, MDS), pp. 195–198.

ICLP-1997-ShimajiriSI #modelling

Incorporating a Pruning Strategy into the Computation of Stable Models based on MGTP (YS, HS, HI), pp. 376–390.

ICML-1995-OliverH #on the

On Pruning and Averaging Decision Trees (JJO, DJH), pp. 430–437.

KDD-1995-MehtaRA

MDL-Based Decision Tree Pruning (MM, JR, RA), pp. 216–221.

DAC-1994-SilvaS

Dynamic Search-Space Pruning Techniques in Path Sensitization (JPMS, KAS), pp. 705–711.

ESOP-1994-Boerio #higher-order #polymorphism #λ-calculus

Extending Pruning Techniques to Polymorphic Second order λ-Calculus (LB), pp. 120–134.

ICML-1994-FurnkranzW #fault #incremental

Incremental Reduced Error Pruning (JF, GW), pp. 70–77.

ICML-1994-WeissI

Small Sample Decision tree Pruning (SMW, NI), pp. 335–342.

KDD-1994-Furnkranz #comparison #concept #learning #relational

A Comparison of Pruning Methods for Relational Concept Learning (JF), pp. 371–382.

ICML-1993-Schlimmer #algorithm

Efficiently Inducing Determinations: A Complete and Systematic Search Algorithm that Uses Optimal Pruning (JCS), pp. 284–290.

ML-1991-Drastal #induction

Informed Pruning in Constructive Induction (GD), pp. 132–136.

LOPSTR-1991-Mill #partial evaluation

Pruning Operators for Partial Evaluation (PMM), pp. 183–204.

DAC-1986-FreemanKLN #automation #layout #matrix #modelling

Automated extraction of SPICE circuit models from symbolic gate matrix layout with pruning (RDF, SMK, CGLH, MLN), pp. 418–424.

ICALP-1981-Pearl #algorithm #branch

The Solution for the Branching Factor of the α-β Pruning Algorithm (JP), pp. 521–529.

STOC-1978-Baudet #algorithm #analysis

An Analysis of the Full αβ Pruning Algorithm (GMB), pp. 296–313.