Stem cover$ (all stems)

179 papers:

CIAA-2015-GruberHJ #automaton #finite #nondeterminism

More on Deterministic and Nondeterministic Finite Cover Automata — Extended Abstract (HG, MH, SJ), pp. 114–126.

ICALP-v1-2015-ImM #order

Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities (SI, BM), pp. 737–748.

ICALP-v1-2015-LiJ #problem

A PTAS for the Weighted Unit Disk Cover Problem (JL, YJ), pp. 898–909.

ICALP-v1-2015-WangW #algorithm #online

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

ICALP-v2-2015-LerouxST #automaton #on the #problem

On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension (JL, GS, PT), pp. 324–336.

LATA-2015-GamardR #2d

Coverability in Two Dimensions (GG, GR), pp. 402–413.

ICGT-2015-Stuckrath #analysis #graph transformation #named #using #verification

Uncover: Using Coverability Analysis for Verifying Graph Transformation Systems (JS), pp. 266–274.

ECIR-2015-SchulteTW #topic

On-topic Cover Stories from News Archives (CS, BT, GW), pp. 37–42.

ICML-2015-IzbickiS #performance

Faster cover trees (MI, CRS), pp. 1162–1170.

KDD-2015-StergiouT #set #web

Set Cover at Web Scale (SS, KT), pp. 1125–1133.

LICS-2015-KrebsV #bound #logic #refinement

Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the Depth (AK, OV), pp. 689–700.

CASE-2014-Murakami #approach #generative #multi #problem

A column generation approach for the multi-vehicle covering tour problem (KM), pp. 1063–1068.

VLDB-2014-FunkeNS #on the

On k-Path Covers and their Applications (SF, AN, SS), pp. 893–902.

STOC-2014-Solomon #fault tolerance #metric

From hierarchical partitions to hierarchical covers: optimal fault-tolerant spanners for doubling metrics (SS), pp. 363–372.

AFL-2014-Campeanu #automaton #finite #nondeterminism

Simplifying Nondeterministic Finite Cover Automata (CC), pp. 162–173.

ICALP-v1-2014-EmekR #set

Semi-Streaming Set Cover — (Extended Abstract) (YE, AR), pp. 453–464.

ICALP-v1-2014-FialaKKN #algorithm #aspect-oriented #graph

Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs (JF, PK, JK, RN), pp. 489–501.

ICALP-v1-2014-HohnMW #cost analysis #how #scheduling

How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions (WH, JM, AW), pp. 625–636.

ICALP-v2-2014-KosowskiP #case study #difference

Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router (AK, DP), pp. 544–555.

LATA-2014-BeerenwinkelBBDP #graph

Covering Pairs in Directed Acyclic Graphs (NB, SB, PB, RD, YP), pp. 126–137.

CIKM-2014-DingL

Model Selection with the Covering Number of the Ball of RKHS (LZD, SL), pp. 1159–1168.

ICML-c1-2014-ZhangHL #heuristic #performance

Covering Number for Efficient Heuristic-based POMDP Planning (ZZ, DH, WSL), pp. 28–36.

SPLC-2014-BarreirosM #approach

A cover-based approach for configuration repair (JB, AMDM), pp. 157–166.

CAV-2014-EsparzaLMMN #analysis #approach #smt

An SMT-Based Approach to Coverability Analysis (JE, RLG, RM, PM, FN), pp. 603–619.

CIAA-2013-Campeanu #implementation

Cover Languages and Implementations (CC), p. 1.

DHM-SET-2013-Bretschneider-Hagemes #aspect-oriented #health #safety

AmI-Technology at Work — A Sociological Perspective Covering Aspects of Occupational Safety and Health (OSH) (MBH), pp. 289–296.

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.

SEKE-2013-WangGZZX #array #combinator #generative #interactive #testing

Generating Partial Covering Array for Locating Faulty Interactions in Combinatorial Testing (ZW, TG, WZ, WZ, BX), pp. 578–583.

OOPSLA-2013-BerganCG #parallel #source code #thread

Input-covering schedules for multithreaded programs (TB, LC, DG), pp. 677–692.

CAV-2013-KloosMNP #incremental #induction

Incremental, Inductive Coverability (JK, RM, FN, RP), pp. 158–173.

LICS-2013-Pattinson #logic

The Logic of Exact Covers: Completeness and Uniform Interpolation (DP), pp. 418–427.

SIGMOD-2012-ChengKCC #approach #distance #graph #performance #query #scalability

Efficient processing of distance queries in large graphs: a vertex cover approach (JC, YK, SC, CC), pp. 457–468.

DLT-J-2011-ChenYSLL12 #multi #network #set

Minimum Local Disk Cover Sets for Broadcasting in Heterogeneous Multihop Wireless Networks (GC, CWY, MTS, FCL, WCL), pp. 1147–1172.

ICALP-v1-2012-CyganKPPW #clique #graph

Clique Cover and Graph Separation: New Incompressibility Results (MC, SK, MP, MP, MW), pp. 254–265.

ICALP-v1-2012-DinitzKR #approximate #scalability

Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner (MD, GK, RR), pp. 290–301.

ICALP-v1-2012-GuptaN #approximate #integer #online #source code

Approximating Sparse Covering Integer Programs Online (AG, VN), pp. 436–448.

ICALP-v1-2012-ImNZ #latency

Minimum Latency Submodular Cover (SI, VN, RvdZ), pp. 485–497.

ICALP-v1-2012-SahaK #set

Set Cover Revisited: Hypergraph Cover with Hard Capacities (BS, SK), pp. 762–773.

LATA-2012-Cervelle

Covering Space in the Besicovitch Topology (JC), pp. 169–178.

CHI-2012-YemKYSYY #using

Assisting hand skill transfer of tracheal intubation using outer-covering haptic display (VY, HK, NY, RS, HY, JY), pp. 3177–3180.

CIKM-2012-AntonellisSD #recommendation

Dynamic covering for recommendation systems (IA, ADS, SD), pp. 26–34.

ICML-2012-FarabetCNL #learning #multi #parsing

Scene parsing with Multiscale Feature Learning, Purity Trees, and Optimal Covers (CF, CC, LN, YL), p. 241.

KDD-2012-GionisLT #set

Estimating entity importance via counting set covers (AG, TL, ET), pp. 687–695.

MoDELS-2012-JohansenHFES #array #generative #modelling #product line

Generating Better Partial Covering Arrays by Modeling Weights on Sub-product Lines (MFJ, ØH, FF, AGE, TS), pp. 269–284.

MoDELS-2012-JohansenHFES #array #generative #modelling #product line

Generating Better Partial Covering Arrays by Modeling Weights on Sub-product Lines (MFJ, ØH, FF, AGE, TS), pp. 269–284.

SAC-2012-BoulilaEFS #adaptation #approach #database #image #predict

High level adaptive fusion approach: application to land cover change prediction in satellite image databases (WB, KSE, IRF, BS), pp. 21–22.

SPLC-2012-JohansenHF #algorithm #array #feature model #generative #modelling #scalability

An algorithm for generating t-wise covering arrays from large feature models (MFJ, ØH, FF), pp. 46–55.

RTA-2012-BertrandDKSS #decidability #graph transformation #on the #reachability

On the Decidability Status of Reachability and Coverability in Graph Transformation Systems (NB, GD, BK, AS, JS), pp. 101–116.

DAC-2011-OnaissiTLN #analysis #approach #performance

A fast approach for static timing analysis covering all PVT corners (SO, FT, JL, FNN), pp. 777–782.

STOC-2011-DingLP #metric

Cover times, blanket times, and majorizing measures (JD, JRL, YP), pp. 61–70.

CIAA-2011-JezM #automaton #performance

Computing All ℓ-Cover Automata Fast (AJ, AM), pp. 203–214.

ICALP-v1-2011-ChengMS #graph

Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices (CTC, EM, IS), pp. 678–689.

ICALP-v1-2011-KuhnM #graph

Vertex Cover in Graphs with Locally Few Colors (FK, MM), pp. 498–509.

ICML-2011-GuilloryB #learning

Simultaneous Learning and Covering with Adversarial Noise (AG, JAB), pp. 369–376.

SEKE-2011-BoorjessonF #case study #multi #re-engineering

Structuring Software Engineering Case Studies to Cover Multiple Perspectives (EB, RF), pp. 276–281.

LICS-2011-AbdullaM #petri net

Computing Optimal Coverability Costs in Priced Timed Petri Nets (PAA, RM), pp. 399–408.

STOC-2010-OnakR #maintenance #scalability

Maintaining a large matching and a small vertex cover (KO, RR), pp. 457–464.

STOC-2010-Varadarajan #geometry #set

Weighted geometric set cover via quasi-uniform sampling (KRV), pp. 641–648.

ICALP-v1-2010-BansalK #problem #scheduling

Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems (NB, SK), pp. 250–261.

ICALP-v1-2010-BjorklundHKK #linear

Covering and Packing in Linear Space (AB, TH, PK, MK), pp. 727–737.

ICALP-v1-2010-GuptaNR #algorithm #optimisation #robust

Thresholded Covering Algorithms for Robust and Max-min Optimization (AG, VN, RR), pp. 262–274.

ICALP-v1-2010-GuruswamiKOPTW

SDP Gaps for 2-to-1 and Other Label-Cover Variants (VG, SK, RO, PP, MT, YW), pp. 617–628.

ICALP-v1-2010-GuruswamiS #on the

On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs (VG, RS), pp. 360–371.

ICALP-v1-2010-MakarychevMS #algorithm #approximate #polynomial #problem #reduction

Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm (KM, RM, MS), pp. 594–604.

CIKM-2010-CormodeKW #algorithm #dataset #scalability #set

Set cover algorithms for very large datasets (GC, HJK, AW), pp. 479–488.

ICML-2010-GuilloryB #interactive #set

Interactive Submodular Set Cover (AG, JAB), pp. 415–422.

ICPR-2010-BoussellaaZABA #analysis #documentation #image #segmentation

Unsupervised Block Covering Analysis for Text-Line Segmentation of Arabic Ancient Handwritten Document Images (WB, AZ, HEA, AB, AMA), pp. 1929–1932.

ICST-2010-SchulerZ

(Un-)Covering Equivalent Mutants (DS, AZ), pp. 45–54.

LICS-2010-Otto

Highly Acyclic Groups, Hypergraph Covers and the Guarded Fragment (MO), pp. 11–20.

DAC-2009-DangRMM #generative #interactive #pipes and filters #source code

Generating test programs to cover pipeline interactions (TND, AR, TM, PM), pp. 142–147.

DAC-2009-OnaissiHN #optimisation #process

Clock skew optimization via wiresizing for timing sign-off covering all process corners (SO, KRH, FNN), pp. 196–201.

FoSSaCS-2009-AbdullaM #low cost #petri net #reachability

Minimal Cost Reachability/Coverability in Priced Timed Petri Nets (PAA, RM), pp. 348–363.

ICALP-v1-2009-ElsasserS #bound #multi #random

Tight Bounds for the Cover Time of Multiple Random Walks (RE, TS), pp. 415–426.

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

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

ECIR-2009-ErcanC #multi #summary

Cover Coefficient-Based Multi-document Summarization (GE, FC), pp. 670–674.

MLDM-2009-YuksekC #algorithm

An Improved Tabu Search (ITS) Algorithm Based on Open Cover Theory for Global Extremums (KY, SC), pp. 505–515.

ISSTA-2009-FoucheCP #array #incremental #scalability

Incremental covering array failure characterization in large configuration spaces (SF, MBC, AAP), pp. 177–188.

ESOP-2008-GulwaniM #algorithm

Cover Algorithms and Their Combination (SG, MM), pp. 193–207.

ICALP-A-2008-AvinKL #evolution #graph #how #random

How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs) (CA, MK, ZL), pp. 121–132.

KDD-2008-BoriahKSPK #case study #detection

Land cover change detection: a case study (SB, VK, MS, CP, SAK), pp. 857–865.

SAC-2008-LucasCD #classification #fuzzy

General type-2 fuzzy classifiers to land cover classification (LAL, TMC, MRD), pp. 1743–1747.

ASE-2007-YuanCM #array #automation #sequence #testing #user interface

Covering array sampling of input event sequences for automated gui testing (XY, MBC, AMM), pp. 405–408.

STOC-2007-AnshelevichK #3d #graph #polynomial

Terminal backup, 3D matching, and covering cubic graphs (EA, AK), pp. 391–400.

STOC-2007-SchoenebeckTT

Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut (GS, LT, MT), pp. 302–310.

CIAA-2007-ChamparnaudGF #transducer

Reducing Acyclic Cover Transducers (JMC, FG, JF), pp. 38–50.

ICALP-2007-BlaserD #complexity #polynomial

Complexity of the Cover Polynomial (MB, HD), pp. 801–812.

ICALP-2007-HeMR

Succinct Ordinal Trees Based on Tree Covering (MH, JIM, SSR), pp. 509–520.

ICEIS-AIDSS-2007-CrawfordLCP #approach #set

A Evolutionary Approach to Solve Set Covering (BC, CL, CC, FP), pp. 356–363.

KDD-2007-GaoESCX #consistency #data mining #mining #problem #set

The minimum consistent subset cover problem and its applications in data mining (BJG, ME, JyC, OS, HX), pp. 310–319.

ESEC-FSE-2007-FoucheCP #adaptation #array #incremental #towards

Towards incremental adaptive covering arrays (SF, MBC, AAP), pp. 557–560.

CASE-2006-CvetanovicCAGB #component #novel

A Novel Protective Cover in Assembling of Micro Components in a SEM Chamber (AC, AC, DA, IG, WB), pp. 242–246.

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.

ECIR-2006-SchedlKPW #automation #retrieval #towards

Towards Automatic Retrieval of Album Covers (MS, PK, TP, GW), pp. 531–534.

ICML-2006-BeygelzimerKL #nearest neighbour

Cover trees for nearest neighbor (AB, SK, JL), pp. 97–104.

ICPR-v3-2006-WangNC #approach #classification

A Minimum Sphere Covering Approach to Pattern Classification (JW, PN, LNC), pp. 433–436.

SAT-2006-Gelder #metric #proving

Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs (AVG), pp. 48–53.

SAT-2006-NishimuraRS #satisfiability #using

Solving #SAT Using Vertex Covers (NN, PR, SS), pp. 396–409.

VMCAI-2006-GantyRB #abstract interpretation #framework

A Complete Abstract Interpretation Framework for Coverability Properties of WSTS (PG, JFR, LVB), pp. 49–64.

DAC-2005-LiSB #bound #effectiveness #problem

Effective bounding techniques for solving unate and binate covering problems (XYL, MFMS, FB), pp. 385–390.

SIGMOD-2005-CongTTX #mining

Mining Top-k Covering Rule Groups for Gene Expression Data (GC, KLT, AKHT, XX), pp. 670–681.

STOC-2005-JiaLNRS #approximate #set

Universal approximations for TSP, Steiner tree, and set cover (LJ, GL, GN, RR, RS), pp. 386–395.

CIAA-J-2004-ChamparnaudCP05

Brute force determinization of nfas by means of state covers (JMC, FC, TP), pp. 441–451.

CIAA-2005-CampeanuPS #algorithm #automaton #finite #incremental

An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata (CC, AP, JRS), pp. 90–103.

ICALP-2005-AvinE #geometry #graph #on the #random

On the Cover Time of Random Geometric Graphs (CA, GE), pp. 677–689.

ICALP-2005-DimitrovP #graph #process

Optimal Cover Time for a Graph-Based Coupon Collector Process (NBD, CGP), pp. 702–716.

ICALP-2005-Karakostas #approximate #problem

A Better Approximation Ratio for the Vertex Cover Problem (GK), pp. 1043–1050.

CIKM-2005-GuptaNR #performance #using

Efficient data dissemination using locale covers (SG, JN, CVR), pp. 243–244.

MLDM-2005-CaoHXW #algorithm #network #recognition

Iris Recognition Algorithm Based on Point Covering of High-Dimensional Space and Neural Network (WC, JH, GX, SW), pp. 305–313.

DATE-v1-2004-BasuDDCMF #architecture #design #question #verification

Formal Verification Coverage: Are the RTL-Properties Covering the Design’s Architectural Intent? (PB, SD, PD, PPC, CRM, LF), pp. 668–669.

DATE-v1-2004-DimopoulosL #performance #sequence #set #testing

Efficient Static Compaction of Test Sequence Sets through the Application of Set Covering Techniques (MGD, PL), pp. 194–201.

CIAA-2004-ChamparnaudCP

Brute Force Determinization of NFAs by Means of State Covers (JMC, FC, TP), pp. 80–89.

ICALP-2004-HalperinK #problem #set

The Minimum-Entropy Set Cover Problem (EH, RMK), pp. 733–744.

VLDB-2003-Ramanan #bisimulation #query #simulation #xml

Covering Indexes for XML Queries: Bisimulation — Simulation = Negation (PR), pp. 165–176.

STOC-2003-AlonAA #online #problem #set

The online set cover problem (NA, BA, YA, NB, JN), pp. 100–105.

STOC-2003-DinurGKR #multi

A new multilayered PCP and the hardness of hypergraph vertex cover (ID, VG, SK, OR), pp. 595–601.

DLT-2003-AnselmoM #formal method #perspective #problem

Covering Problems from a Formal Language Point of View (MA, MM), pp. 122–133.

ICALP-2003-GandhiHKKS #algorithm #approximate

An Improved Approximation Algorithm for Vertex Cover with Hard Capacities (RG, EH, SK, GK, AS), pp. 164–175.

ICML-2003-MarchandSSS #set

The Set Covering Machine with Data-Dependent Half-Spaces (MM, MS, JST, MS), pp. 520–527.

LCTES-2003-GuoSBH #algorithm #configuration management #graph

A graph covering algorithm for a coarse grain reconfigurable system (YG, GJMS, HB, PMH), pp. 199–208.

SIGMOD-2002-KaushikBNK #branch #query

Covering indexes for branching path queries (RK, PB, JFN, HFK), pp. 133–144.

STOC-2002-Holmerin #approximate

Vertex cover on 4-regular hyper-graphs is hard to approximate within 2-epsilon (JH), pp. 544–552.

CIAA-J-2000-CampeanuPY02 #algorithm #automaton #finite #performance

An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages (CC, AP, SY), pp. 83–97.

CIAA-2002-CampeanuP #automaton #finite #similarity

The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata (CC, AP), pp. 67–76.

CIAA-2002-Korner #automaton #finite #on the

On Minimizing Cover Automata for Finite Languages in O(n log n) Time (HK), pp. 117–127.

ICALP-2002-Holmerin

Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs (JH), pp. 1005–1016.

ICALP-2002-Nisan #approximate #communication #complexity #set

The Communication Complexity of Approximate Set Packing and Covering (NN), pp. 868–875.

FME-2002-RatsabySU #analysis

Improvements in Coverability Analysis (GR, BS, SU), pp. 41–56.

DATE-2001-ChiusanoCPW #on the #set

On applying the set covering model to reseeding (SC, SDC, PP, HJW), pp. 156–161.

ICDAR-2001-IwataYYKIM #identification #library #using

Book Cover Identification by Using Four Directional Features Filed for a Small-Scale Library System (KI, KY, MY, KK, MI, KM), pp. 582–586.

DLT-2001-DomaratzkiSY #formal method

Minimal Covers of Formal Languages (MD, JS, SY), pp. 319–329.

ICALP-2001-GandhiKS #algorithm #approximate #problem

Approximation Algorithms for Partial Covering Problems (RG, SK, AS), pp. 225–236.

ICML-2001-MarchandS #learning #set

Learning with the Set Covering Machine (MM, JST), pp. 345–352.

DATE-2000-CordoneFSC #approach #heuristic #performance #problem

An Efficient Heuristic Approach to Solve the Unate Covering Problem (RC, FF, DS, RWC), pp. 364–371.

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

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

CIAA-2000-PaunSY #algorithm #automaton #finite

An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages (AP, NS, SY), pp. 243–251.

ICALP-2000-DantsinGHS #algorithm #satisfiability

Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search (ED, AG, EAH, US), pp. 236–247.

ICALP-2000-KumarAR #set

Hardness of Set Cover with Intersection 1 (VSAK, SA, HR), pp. 624–635.

ICPR-v4-2000-BarataPG #image

Segmenting at Higher Scales to Classify at Lower Scales. A Mathematical Morphology Based Methodology Applied to Forest Cover Remote Sensing Images (TB, PP, IG), pp. 4084–4087.

PPDP-2000-LeuschelL #deduction #petri net #problem

Solving coverability problems of petri nets by partial deduction (ML, HL), pp. 268–279.

CL-2000-LeuschelL #deduction #petri net

Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction (ML, HL), pp. 101–115.

ICDAR-1999-SobottkaBK #identification

Identification of Text on Colored Book and Journal Covers (KS, HB, HK), pp. 57–62.

STOC-1999-KumarR

Covering Rectilinear Polygons with Axis-Parallel Rectangles (VSAK, HR), pp. 445–454.

DAC-1998-KukimotoBS #graph

Delay-Optimal Technology Mapping by DAG Covering (YK, RKB, PS), pp. 348–351.

WIA-1998-CampeanuSY #finite

Minimal Cover-Automata for Finite Languages (CC, NS, SY), pp. 43–56.

DAC-1997-LiaoD #bound #problem #using

Solving Covering Problems Using LPR-Based Lower Bounds (SYL, SD), pp. 117–120.

PODS-1997-HoBA #query #using

Partial-Sum Queries in Data Cubes Using Covering Codes (CTH, JB, RA), pp. 228–237.

STOC-1997-AsanoKTT #approximate #polynomial #towards

Covering Points in the Plane by k-Tours: Towards a Polynomial Time Approximation Scheme for General k (TA, NK, HT, TT), pp. 275–283.

STOC-1997-DuhF #approximate #optimisation

Approximation of k-Set Cover by Semi-Local Optimization (RcD, MF), pp. 256–264.

DAC-1996-Coudert #on the #problem

On Solving Covering Problems (OC), pp. 197–202.

STOC-1996-Feige #approximate #set

A Threshold of ln n for Approximating Set Cover (Preliminary Version) (UF), pp. 314–318.

STOC-1996-Slavik #algorithm #analysis #set

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

STOC-1996-Wilson #generative #random

Generating Random Spanning Trees More Quickly than the Cover Time (DBW), pp. 296–303.

DAC-1995-CoudertM #problem

New Ideas for Solving Covering Problems (OC, JCM), pp. 641–646.

ICDAR-v2-1995-LiiS

Location of name and address on fax cover pages (JL, SNS), pp. 756–759.

SIGMOD-1995-Olson

Cover Your Assets (MAO), p. 453.

STOC-1995-Srinivasan #approximate #problem

Improved approximations of packing and covering problems (AS), pp. 268–276.

AdaEurope-1994-Ogren #ada

Extended Application of Ada to Cover ECBS with O4S (IÖ), pp. 215–230.

TRI-Ada-1994-Ogren #ada

Extended Application of Ada to Cover ECBS with O4S: ECBS = Engineering of Computer Based Systems; O4S = Objects for Systems (IÖ), pp. 322–330.

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.

SAC-1993-Sen #low cost #probability #set #using

Minimal Cost Set Covering Using Probabilistic Methods (SS), pp. 157–164.

RTA-1993-Gallier #proving

Proving Properties of Typed λ Terms: Realizability, Covers, and Sheaves (Abstract) (JHG), p. 136.

DAC-1992-KungDNG #algorithm #named

BDDMAP: A Technology Mapper Based on a New Covering Algorithm (DSK, RFD, TAN, DJG), pp. 484–487.

CADE-1992-ZhangH #induction #proving #set #theorem

Proving the Chinese Remainder Theorem by the Cover Set Induction (HZ, XH), pp. 431–445.

ML-1991-Kadie91a #concept #learning #set

Continous Conceptual Set Covering: Learning Robot Operators From Examples (CMK), pp. 615–619.

CAV-1991-FinkelP #composition #graph

Avoiding State Exposion by Composition of Minimal Covering Graphs (AF, LP), pp. 169–180.

ICLP-1991-Decker #axiom #on the

On Generalized Cover Axioms (HD), pp. 693–707.

STOC-1990-Zuckerman #bound

A Technique for Lower Bounding the Cover Time (DZ), pp. 254–259.

ML-1990-Kadie #algorithm #concept #set

Conceptual Set Covering: Improving Fit-And-Split Algorithms (CMK), pp. 40–48.

STOC-1989-ChandraRRST #graph

The Electrical Resistance of a Graph Captures its Commute and Cover Times (Detailed Abstract) (AKC, PR, WLR, RS, PT), pp. 574–586.

PODS-1987-Gottlob #dependence #embedded #functional

Computing Covers for Embedded Functional Dependencies (GG), pp. 58–69.

ICALP-1987-Beauquier #automaton

Minimal Automaton of a Rational Cover (DB), pp. 174–189.

SIGIR-1985-CanO #clustering #concept

Concepts of the Cover-Coefficient-Based Clustering Methodology (FC, EAO), pp. 204–211.

PODS-1983-Sacca #database #on the #recognition

On the Recognition of Coverings of Acyclic Database Hypergraphs (DS), pp. 297–304.

STOC-1982-Bar-YehudaE #approximate #graph #on the

On Approximating a Vertex Cover for Planar Graphs (RBY, SE), pp. 303–309.

VLDB-1981-Karlsson

Reduced Cover-Trees and their Application in the Sabre Access Path Model (KK), pp. 345–353.

STOC-1979-Maier #database #relational

Minimum Covers in the Relational Database Model (Extended Abstract) (DM), pp. 330–337.

ICALP-1978-ItaiR #graph

Covering a Graph by Circuits (AI, MR), pp. 289–299.

ICALP-1978-Nijholt #on the #parsing

On the Parsing and Covering of Simple Chain Grammars (AN), pp. 330–344.

POPL-1977-Nijholt #on the #recursion

On the Covering of Left Recursive Grammars (AN), pp. 86–96.