Stem greedi$ (all stems)

72 papers:

STOC-2015-Gupta0 #algorithm

Greedy Algorithms for Steiner Forest (AG, AK), pp. 871–878.

STOC-2015-KorulaMZ #online #order #random

Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order (NK, VSM, MZ), pp. 889–898.

ICALP-v1-2015-WangW #algorithm #online

Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm (YW, SCwW), pp. 1070–1081.

ICML-2015-SharmaKD #on the

On Greedy Maximization of Entropy (DS, AK, AD), pp. 1330–1338.

MLDM-2015-RiesenFDB #distance #edit distance #graph

Greedy Graph Edit Distance (KR, MF, RD, HB), pp. 3–16.

ICLP-2015-Zaniolo #algorithm #logic programming #source code

Expressing and Supporting Efficiently Greedy Algorithms as Locally Stratified Logic Programs (CZ).

MSR-2014-VasquezBBOPP #android #api #empirical #energy #mining

Mining energy-greedy API usage patterns in Android apps: an empirical study (MLV, GB, CBC, RO, MDP, DP), pp. 2–11.

ICML-c1-2014-LiuYF #algorithm #constraints

Forward-Backward Greedy Algorithms for General Convex Smooth Functions over A Cardinality Constraint (JL, JY, RF), pp. 503–511.

ICPR-2014-AkhtarSM #algorithm #approximate #named

SUnGP: A Greedy Sparse Approximation Algorithm for Hyperspectral Unmixing (NA, FS, ASM), pp. 3726–3731.

KDIR-2014-AzadM #classification #consistency #fault #heuristic

“Misclassification Error” Greedy Heuristic to Construct Decision Trees for Inconsistent Decision Tables (MA, MJM), pp. 184–191.

SAT-2014-SakaiST #reduction #satisfiability #strict

Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction (TS, KS, ST), pp. 32–47.

ICDAR-2013-AgarwalGC #learning

Greedy Search for Active Learning of OCR (AA, RG, SC), pp. 837–841.

CIAA-2013-GrathwohlHNR #parsing #regular expression

Two-Pass Greedy Regular Expression Parsing (NBBG, FH, LN, UTR), pp. 60–71.

CIKM-2013-ChengSHZC #named

StaticGreedy: solving the scalability-accuracy dilemma in influence maximization (SC, HS, JH, GZ, XC), pp. 509–518.

KDD-2013-Lacoste-JulienPDKGG #knowledge base #named #scalability

SIGMa: simple greedy matching for aligning large knowledge bases (SLJ, KP, AD, GK, TG, ZG), pp. 572–580.

DATE-2012-LinC #adaptation #garbage collection

Dual Greedy: Adaptive garbage collection for page-mapping solid-state disks (WHL, LPC), pp. 117–122.

ITiCSE-2012-MI #algorithm

A method to construct counterexamples for greedy algorithms (JM, SI), pp. 238–243.

ITiCSE-2012-Velazquez-Iturbide #algorithm #approach #learning #refinement

Refinement of an experimental approach tocomputer-based, active learning of greedy algorithms (JÁVI), pp. 46–51.

ICML-2012-Painter-WakefieldP #algorithm #learning

Greedy Algorithms for Sparse Reinforcement Learning (CPW, RP), p. 114.

ICML-2012-XuWC #learning

The Greedy Miser: Learning under Test-time Budgets (ZEX, KQW, OC), p. 169.

KR-2012-ThomazoBMR #algorithm #query #set

A Generic Querying Algorithm for Greedy Sets of Existential Rules (MT, JFB, MLM, SR).

DocEng-2011-GippM #algorithm #detection #pattern matching #sequence

Citation pattern matching algorithms for citation-based plagiarism detection: greedy citation tiling, citation chunking and longest common citation sequence (BG, NM), pp. 249–258.

ITiCSE-2011-Velazquez-Iturbide #algorithm #design #revisited

The design and coding of greedy algorithms revisited (JÁVI), pp. 8–12.

ICALP-v1-2011-FeldmanNS #algorithm

Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm — (Extended Abstract) (MF, JN, RS), pp. 342–353.

CIKM-2011-SannerGGKK #optimisation #retrieval #topic

Diverse retrieval via greedy optimization of expected 1-call@k in a latent subtopic relevance model (SS, SG, TG, SK, SK), pp. 1977–1980.

ICML-2011-DasK #algorithm #approximate #set #taxonomy

Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection (AD, DK), pp. 1057–1064.

KDIR-2011-AlkhalidCM #algorithm #comparison

Comparison of Greedy Algorithms for Decision Tree Construction (AA, IC, MM), pp. 438–443.

KDIR-2011-MartelotH #algorithm #community #detection #multi #optimisation #using

Multi-scale Community Detection using Stability as Optimisation Criterion in a Greedy Algorithm (ELM, CH), pp. 216–225.

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.

ICALP-v1-2010-BorodinL #combinator #design #on the

On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions (AB, BL), pp. 90–101.

ICML-2010-WunderLB #multi

Classes of Multiagent Q-learning Dynamics with epsilon-greedy Exploration (MW, MLL, MB), pp. 1167–1174.

KDD-2010-WangCSX #algorithm #mining #mobile #network #social

Community-based greedy algorithm for mining top-K influential nodes in mobile social networks (YW, GC, GS, KX), pp. 1039–1048.

ITiCSE-2009-Velazquez-IturbideP #algorithm #interactive #learning

Active learning of greedy algorithms by means of interactive experimentation (JÁVI, APC), pp. 119–123.

STOC-2009-DietzfelbingerW #bound

Tight lower bounds for greedy routing in uniform small world rings (MD, PW), pp. 591–600.

ICALP-v1-2009-KoufogiannakisY #algorithm #approximate #constraints

Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost (CK, NEY), pp. 634–652.

ICML-2009-GomesK #dynamic analysis #multi

Dynamic analysis of multiagent Q-learning with ε-greedy exploration (ERG, RK), pp. 369–376.

ICML-2009-SzitaL #learning #polynomial

Optimistic initialization and greediness lead to polynomial time learning in factored MDPs (IS, AL), pp. 1001–1008.

STOC-2008-Thorup

Minimum k-way cuts via deterministic greedy tree packing (MT), pp. 159–166.

SIGIR-2008-YuZXG #categorisation #design #learning #using

trNon-greedy active learning for text categorization using convex ansductive experimental design (KY, SZ, WX, YG), pp. 635–642.

ICEIS-AIDSS-2007-BermejoGP #email #using

Attribute Construction for E-Mail Foldering by Using Wrappered Forward Greedy Search (PB, JAG, JMP), pp. 247–252.

DATE-2006-WandelerMT #analysis #performance #realtime

Performance analysis of greedy shapers in real-time systems (EW, AM, LT), pp. 444–449.

ICALP-v1-2006-CaragiannisFKKM #bound

Tight Bounds for Selfish and Greedy Load Balancing (IC, MF, CK, PK, LM), pp. 311–322.

ICPR-v1-2006-DongWH #gesture #segmentation #sequence #similarity #using #video

Gesture Segmentation from a Video Sequence Using Greedy Similarity Measure (QD, YW, ZH), pp. 331–334.

ICPR-v3-2006-TangkuampienS #analysis #component #kernel

Human Motion De-noising via Greedy Kernel Principal Component Analysis Filtering (TT, DS), pp. 457–460.

ASE-2005-BryceC #algorithm #interactive #testing

Constructing interaction test suites with greedy algorithms (RCB, CJC), pp. 440–443.

PASTE-2005-TallamG #algorithm #concept analysis #testing

A concept analysis inspired greedy algorithm for test suite minimization (ST, NG), pp. 35–42.

STOC-2005-FlaxmanFV #algorithm #approximate #on the #performance #problem

On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem (AF, AMF, JCV), pp. 441–449.

ICML-2005-RosellHRP #learning #why

Why skewing works: learning difficult Boolean functions with greedy tree learners (BR, LH, SR, DP), pp. 728–735.

ICSE-2005-BryceCC #framework #interactive #testing

A framework of greedy methods for constructing interaction test suites (RCB, CJC, MBC), pp. 146–155.

STOC-2004-AlbersS #algorithm #on the #performance

On the performance of greedy algorithms in packet buffering (SA, MS), pp. 35–44.

ICALP-2004-FrischC #regular expression

Greedy Regular Expression Matching (AF, LC), pp. 618–629.

ICALP-2003-CrescenziGNPU #online

Online Load Balancing Made Simple: Greedy Strikes Back (PC, GG, GN, PP, WU), pp. 1108–1122.

ICEIS-v1-2003-KaramEII #algorithm #constraints #maintenance

The Enhanced Greedy Interchange Algorithm for the Selection of Materialized Views Under a Maintenance Cost Constraint in Data Warehouses (OHK, MES, OI, RI), pp. 279–284.

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.

STOC-2002-JainMS #approach #problem

A new greedy approach for facility location problems (KJ, MM, AS), pp. 731–740.

SAT-2002-KaporisKL #algorithm #analysis #probability #satisfiability

The Probabilistic Analysis of a Greedy Satisfiability Algorithm (ACK, LMK, EGL), p. 5.

ICML-2001-NairCK #algorithm

Some Greedy Algorithms for Sparse Nonlinear Regression (PBN, AC, AJK), pp. 369–376.

ICML-2000-SmolaS #approximate #machine learning #matrix

Sparse Greedy Matrix Approximation for Machine Learning (AJS, BS), pp. 911–918.

ICPR-v3-2000-Verges-LlahiSC #algorithm #clustering #constraints #graph #image #segmentation

Color Image Segmentation Solving Hard-Constraints on Graph Partitioning Greedy Algorithms (JVL, AS, JC), pp. 3629–3632.

JICSLP-1998-GrecoZ #algorithm #datalog

Greedy Algorithms in Datalog with Choice and Negation (SG, CZ), pp. 294–309.

STOC-1996-Slavik #algorithm #analysis #set

A Tight Analysis of the Greedy Algorithm for Set Cover (PS), pp. 435–441.

SEKE-1996-MittermeirW #architecture #component #reuse

Greedy Reuse: Architectural Considerations for Extending the Reusability of Components (RM, LGW), pp. 434–441.

DAC-1995-WuM #2d #approach #optimisation #orthogonal

Orthogonal Greedy Coupling — A New Optimization Approach to 2-D FPGA Routing (YLW, MMS), pp. 568–573.

PLDI-1995-BurgerWD #lazy evaluation #using

Register Allocation Using Lazy Saves, Eager Restores, and Greedy Shuffling (RGB, OW, RKD), pp. 130–138.

KDD-1995-MurthyS #effectiveness #heuristic #how #induction #question

Decision Tree Induction: How Effective is the Greedy Heuristic? (SKM, SS), pp. 222–227.

SAC-1995-Julstrom #algorithm #problem #search-based

Very greedy crossover in a genetic algorithm for the traveling salesman problem (BAJ), pp. 324–328.

ICML-1994-CaruanaF

Greedy Attribute Selection (RC, DF), pp. 28–36.

KR-1994-Konolige #algorithm #problem

Easy to be Hard: Difficult Problems for Greedy Algorithms (KK), pp. 374–378.

PODS-1992-GrecoZG

Greedy by Choice (SG, CZ, SG), pp. 105–113.

ML-1992-OliveiraS #feature model #induction #using

Constructive Induction Using a Non-Greedy Strategy for Feature Selection (ALO, ALSV), pp. 355–360.

POPL-1985-FordS #approach #code generation #incremental

A Greedy Approach to Incremental Code Generation (RF, DS), pp. 165–178.

DAC-1982-RivestF

A “greedy” channel router (RLR, CMF), pp. 418–424.