Stem subset$ (all stems)

119 papers:

ICALP-v1-2015-LokshtanovRS #algorithm #feedback #linear #set

Linear Time Parameterized Algorithms for Subset Feedback Vertex Set (DL, MSR, SS), pp. 935–946.

ICML-2015-GasseAE #classification #composition #multi #on the #set

On the Optimality of Multi-Label Classification under Subset Zero-One Loss for Distributions Satisfying the Composition Property (MG, AA, HE), pp. 2531–2539.

ICML-2015-WeiIB #learning #set

Submodularity in Data Subset Selection and Active Learning (KW, RKI, JAB), pp. 1954–1963.

ICML-2015-Yang0JZ #bound #fault #set

An Explicit Sampling Dependent Spectral Error Bound for Column Subset Selection (TY, LZ, RJ, SZ), pp. 135–143.

SEKE-2015-GaoKN #set

Combining Feature Subset Selection and Data Sampling for Coping with Highly Imbalanced Software Data (KG, TMK, AN), pp. 439–444.

ASE-2014-HagiharaESY #satisfiability #set #specification

Minimal strongly unsatisfiable subsets of reactive system specifications (SH, NE, MS, NY), pp. 629–634.

AFL-2014-Vorel #automaton #set #transitive

Subset Synchronization of Transitive Automata (VV), pp. 370–381.

CGO-2014-CastroKAPJ #benchmark #fine-grained #metric

Fine-grained Benchmark Subsetting for System Selection (PdOC, YK, CA, MP, WJ), p. 132.

STOC-2013-Thorup #independence #set #similarity

Bottom-k and priority sampling, set similarity and subset sums with minimal independence (MT), pp. 371–380.

ICALP-v1-2013-AustrinKKM #algorithm #set #trade-off

Space-Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm (PA, PK, MK, JM), pp. 45–56.

ICALP-v2-2013-LohreySZ #set

Rational Subsets and Submonoids of Wreath Products (ML, BS, GZ), pp. 361–372.

HILT-2013-Taft13a #ada #parallel #programming #set

Bringing safe, dynamic parallel programming to the spark verifiable subset of ada (STT), pp. 37–40.

OOPSLA-2013-DeLozierENOMZ #c++ #set #type safety

Ironclad C++: a library-augmented type-safe subset of c++ (CD, RAE, SN, PMO, MMKM, SZ), pp. 287–304.

CASE-2012-ZhangLCCJ #set #simulation

An improved simulation budget allocation procedure to efficiently select the optimal subset of many alternatives (SZ, LHL, EPC, CHC, HYJ), pp. 230–236.

ICALP-v1-2012-ChitnisCHM #feedback #parametricity #set

Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable (RHC, MC, MTH, DM), pp. 230–241.

ICML-2012-KalyanakrishnanTAS #multi #probability #set

PAC Subset Selection in Stochastic Multi-armed Bandits (SK, AT, PA, PS), p. 34.

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-CyganPPW #feedback #parametricity #set

Subset Feedback Vertex Set Is Fixed-Parameter Tractable (MC, MP, MP, JOW), pp. 449–461.

ICALP-v1-2011-Laekhanukit #algorithm #approximate #low cost #set

An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity — (Extended Abstract) (BL), pp. 13–24.

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.

SIGIR-2011-XueC #modelling #query #set

Modeling subset distributions for verbose queries (XX, WBC), pp. 1133–1134.

CIKM-2010-XueHC #query #set #using

Improving verbose queries using subset distribution (XX, SH, WBC), pp. 1059–1068.

ICPR-2010-SomolGP #algorithm #feature model #problem #set

The Problem of Fragile Feature Subset Preference in Feature Selection Methods and a Proposal of Algorithmic Workaround (PS, JG, PP), pp. 4396–4399.

SIGIR-2010-WangDL #comprehension #documentation #matrix #set

Feature subset non-negative matrix factorization and its applications to document understanding (DW, CHQD, TL), pp. 805–806.

ICSE-2010-ChiappiniCMRRSTV #formal method #set #validation

Formalization and validation of a subset of the European Train Control System (AC, AC, LM, OR, MR, AS, ST, BV), pp. 109–118.

ICSM-2009-JiaSYL #data transformation #difference #predict #question #set

Data transformation and attribute subset selection: Do they help make differences in software failure prediction? (HJ, FS, YY, QL), pp. 519–522.

PLDI-2009-HooimeijerW #constraints #regular expression #set

A decision procedure for subset constraints over regular languages (PH, WW), pp. 188–198.

ICEIS-AIDSS-2009-Rojas-MoraG #fuzzy #nondeterminism #set

The Signing of a Professional Athlete — Reducing Uncertainty with a Weighted Mean Hemimetric for Phi — Fuzzy Subsets (JRM, JGL), pp. 158–163.

CIKM-2009-HauffHJA #estimation #ranking #set #topic

Relying on topic subsets for system ranking estimation (CH, DH, FdJ, LA), pp. 1859–1862.

MLDM-2009-SeredinKM #machine learning #order #set

Selection of Subsets of Ordered Features in Machine Learning (OS, AK, VM), pp. 16–28.

SIGIR-2009-AmbaiY #clustering #image #multi #ranking #set #visual notation

Multiclass VisualRank: image ranking method in clustered subsets based on visual features (MA, YY), pp. 732–733.

DAC-2008-JinC #benchmark #case study #metric #performance #simulation #statistics #using

Improve simulation efficiency using statistical benchmark subsetting: an ImplantBench case study (ZJ, ACC), pp. 970–973.

STOC-2008-DasK #algorithm #linear #set

Algorithms for subset selection in linear regression (AD, DK), pp. 45–54.

CIKM-2008-BoutsidisSA #clustering #metric #set

Clustered subset selection and its applications on it service metrics (CB, JS, NA), pp. 599–608.

ICML-2008-YueJ #predict #set #using

Predicting diverse subsets using structural SVMs (YY, TJ), pp. 1224–1231.

ICPR-2008-KhushabaAA #difference #evolution #set

Differential evolution basedfeature subset selection (RNK, AAA, AAJ), pp. 1–4.

MoDELS-2008-CraneD #execution #formal method #modelling #set #towards #uml

Towards a Formal Account of a Foundational Subset for Executable UML Models (MLC, JD), pp. 675–689.

MoDELS-2008-CraneD #execution #formal method #modelling #set #towards #uml

Towards a Formal Account of a Foundational Subset for Executable UML Models (MLC, JD), pp. 675–689.

ICDAR-2007-ChouGC #classification #multi #recognition #using

Recognition of Fragmented Characters Using Multiple Feature-Subset Classifiers (CHC, CYG, FC), pp. 198–202.

ESOP-2007-LiOS #compilation #higher-order #logic #set

Structure of a Proof-Producing Compiler for a Subset of Higher Order Logic (GL, SO, KS), pp. 205–219.

STOC-2007-BjorklundHKK #fourier #performance #set

Fourier meets möbius: fast subset convolution (AB, TH, PK, MK), pp. 67–74.

CIAA-2007-KucherovNR #automaton #set

Subset Seed Automaton (GK, LN, MAR), pp. 180–191.

LATA-2007-LohreyS #graph #problem #set

The submonoid and rational subset membership problems for graph groups (ML, BS), pp. 367–378.

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.

SIGIR-2007-CormackL07a #bias #set

Power and bias of subset pooling strategies (GVC, TRL), pp. 837–838.

AMOST-2007-BouquetGLPVU #modelling #precise #testing #uml

A subset of precise UML for model-based testing (FB, CG, BL, FP, NV, MU), pp. 95–104.

DAC-2006-VianaGKBV #configuration management #performance

Configurable cache subsetting for fast cache tuning (PV, AGR, EJK, EB, FV), pp. 695–700.

VLDB-2006-0003RBCY #metric #set

Composite Subset Measures (LC, RR, PB, BCC, VY), pp. 403–414.

STOC-2006-Klein #graph #set

A subset spanner for Planar graphs, : with application to subset TSP (PNK), pp. 749–756.

ICML-2006-SinghiL #bias #classification #learning #set

Feature subset selection bias for classification learning (SKS, HL), pp. 849–856.

ICPR-v2-2006-SomolP #algorithm #feature model #keyword #multi #prototype #using

Multi-Subset Selection for Keyword Extraction and Other Prototype Search Tasks Using Feature Selection Algorithms (PS, PP), pp. 736–739.

ICPR-v3-2006-RendekW #consistency #set #using

Extraction of Consistent Subsets of Descriptors using Choquet Integral (JR, LW), pp. 208–211.

ICPR-v4-2006-ShaZT #set #using

Minutiae-based Fingerprint Matching Using Subset Combination (LS, FZ, XT), pp. 566–569.

MoDELS-2006-AlanenP #modelling #set

Basic Operations over Models Containing Subset and Union Properties (MA, IP), pp. 469–483.

MoDELS-2006-AlanenP #modelling #set

Basic Operations over Models Containing Subset and Union Properties (MA, IP), pp. 469–483.

SAC-2006-BergerMD #categorisation #email #set

Exploiting partial decision trees for feature subset selection in e-mail categorization (HB, DM, MD), pp. 1105–1109.

PODS-2005-AlonDLT #set

Estimating arbitrary subset sums with few probes (NA, NGD, CL, MT), pp. 317–325.

VLDB-2005-JermaineDPJ #estimation #online #query #sql

Online Estimation For Subset-Based SQL Queries (CJ, AD, AP, SJ), pp. 745–756.

DLT-2005-Kunc #on the #set

On Language Inequalities XK subset of LX (MK), pp. 327–337.

SIGIR-2005-FergusonSGW #retrieval #scalability #set #using

Top subset retrieval on large collections using sorted indices (PF, AFS, CG, PW), pp. 599–600.

PADL-2005-BaileyS #constraints #satisfiability #set #using

Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization (JB, PJS), pp. 174–186.

ICML-2004-BahamondeBDQLCAG #case study #learning #set

Feature subset selection for learning preferences: a case study (AB, GFB, JD, JRQ, OL, JJdC, JA, FG).

ICPR-v4-2004-PrasadSK #image #set #using

Feature Subset Selection using ICA for Classifying Emphysema in HRCT Images (MNP, AS, IK), pp. 515–518.

SAC-2004-MassonRB #database #induction #optimisation #query #set #towards

Optimizing subset queries: a step towards SQL-based inductive databases for itemsets (CM, CR, JFB), pp. 535–539.

ICDAR-2003-HaoLS03a #algorithm #classification #comparison #search-based #set

Comparison of Genetic Algorithm and Sequential Search Methods for Classifier Subset Selection (HH, CLL, HS), pp. 765–769.

PODS-2003-MendelzonP #set

Concise descriptions of subsets of structured sets (AOM, KQP), pp. 123–133.

PPDP-2003-BandaSW #satisfiability #set

Finding all minimal unsatisfiable subsets (MJGdlB, PJS, JW), pp. 32–43.

CADE-2003-Stump #set

Subset Types and Partial Functions (AS), pp. 151–165.

ICALP-2002-CharikarIP #algorithm #orthogonal #problem #query #set

New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems (MC, PI, RP), pp. 451–462.

SIGAda-2002-Santhanam #ada #compilation #set

The anatomy of an FAA-qualifiable Ada subset compiler (VS), pp. 40–43.

ICML-2002-AlphonseM #induction #logic programming #set

Feature Subset Selection and Inductive Logic Programming (ÉA, SM), pp. 11–18.

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.

LOPSTR-2002-Berghammer #set

A Generic Program for Minimal Subsets with Applications (RB), pp. 144–157.

ASE-2001-XieLB #execution #model checking #set #uml

Model Checking for an Executable Subset of UML (FX, VL, JCB), pp. 333–336.

FoSSaCS-2001-Stirling #decidability #parallel #process #set #similarity

Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes (CS), pp. 379–393.

PADL-2001-FlenerHK01a #metaheuristic #problem #set

A Meta-heuristic for Subset Problems (PF, BH, ZK), pp. 274–287.

SAC-2001-ZhouCH #correlation #identification #optimisation #problem #set #using

Identifying the most significant pairwise correlations of residues in different positions of helices: the subset selection problem using least squares optimization (XZ, GC, MTH), pp. 51–55.

AdaEurope-2000-ChenL #on the #set

On the Minimal Essential Subsets and Minimal Representative Sets (TYC, MFL), pp. 291–301.

ICML-2000-DyB #identification #learning #order #set

Feature Subset Selection and Order Identification for Unsupervised Learning (JGD, CEB), pp. 247–254.

ICPR-v2-2000-SmitsA #cost analysis #image #interactive #set

Cost-Based Feature Subset Selection for Interactive Image Analysis (PCS, AA), pp. 2386–2389.

ICPR-v2-2000-ZhangDL #classification #design #feature model #multi #recognition

Multi-Scale Feature Extraction and Nested-Subset Classifier Design for High Accuracy Handwritten Character Recognition (JZ, XD, CL), pp. 2581–2584.

ICPR-v3-2000-MaenpaaOPM #classification #robust #set

Robust Texture Classification by Subsets of Local Binary Patterns (TM, TO, MP, MS), pp. 3947–3950.

KR-2000-Mota #set

Cyclical and Granular Time Theories as Subsets of the Herbrand Universe (EM), pp. 366–377.

CSMR-1999-RaysideK #deployment #embedded #java #library #set

Extracting Java Library Subsets for Deployment on Embedded Systems (DR, KK), pp. 102–110.

DAC-1998-PardoH #incremental #model checking #using

Incremental CTL Model Checking Using BDD Subsetting (AP, GDH), pp. 457–462.

DATE-1998-Nicoli #behaviour #semantics #set

Denotational Semantics of a Behavioral Subset of VHDL (FN), pp. 975–976.

ICALP-1998-BazganST #algorithm #approximate #performance #problem #similarity

Efficient Approximation Algorithms for the Subset-Sums Equality Problem (CB, MS, ZT), pp. 387–396.

ICML-1998-Bay #classification #multi #nearest neighbour #set

Combining Nearest Neighbor Classifiers Through Multiple Feature Subsets (SDB), pp. 37–45.

STOC-1997-ColeH #pattern matching #random #set

Tree Pattern Matching and Subset Matching in Randomized O(n log3m) Time (RC, RH), pp. 66–75.

DLT-1997-Bozapalidis #algebra

Mezei-Wright Theory on N-Subsets of an Algebra (SB), pp. 291–298.

SIGIR-1997-SilversteinP #clustering #corpus #set

Almost-Constant-Time Clustering of Arbitrary Corpus Subsets (CS, JOP), pp. 60–66.

VLDB-1996-Hammond #consistency #set #using

Using Referential Integrity To Easily Define Consistent Subset Replicas (BH), p. 591.

WIA-1996-JohnsonW #set

Instruction Computation in Subset Construction (JHJ, DW), pp. 64–71.

SAC-1996-AbualiWS #algorithm #design #problem #search-based #set #using

Solving the subset interconnection design problem using genetic algorithms (FNA, RLW, DAS), pp. 299–304.

SAC-1996-LeeHHC #case study #how #implementation #performance #problem #process #set

Efficient implementations of two variant subset sum problems: a case study of how to process appraisal books resulting from fire-destroyed money (PL, FYH, CYH, HTC), pp. 230–237.

KDD-1995-KohaviS #set #using

Feature Subset Selection Using the Wrapper Method: Overfitting and Dynamic Search Space Topology (RK, DS), pp. 192–197.

SAC-1995-RunklerG #algorithm #multi #performance #set

Multidimensional defuzzification — fast algorithms for the determination of crisp characteristic subsets (TAR, MG), pp. 575–579.

STOC-1994-DinitzV #graph #incremental #maintenance #set

The connectivity carcass of a vertex subset in a graph and its incremental maintenance (YD, AV), pp. 716–725.

ICML-1994-JohnKP #problem #set

Irrelevant Features and the Subset Selection Problem (GHJ, RK, KP), pp. 121–129.

ILPS-1993-OsorioJ #set

Subset Assertions and Negation As Failure (MO, BJ), p. 637.

DAC-1992-ChenF #algorithm #logic #optimisation #performance #set

Efficient Sum-to-One Subsets Algorithm for Logic Optimization (KCC, MF), pp. 443–448.

CADE-1992-Sutcliffe #analysis #set

Linear-Input Subset Analysis (GS), pp. 268–280.

LICS-1992-Klarlund #automaton #metric #set

Progress Measures, Immediate Determinacy, and a Subset Construction for Tree Automata (NK), pp. 382–393.

ICALP-1991-GalilM #algorithm #linear #problem

An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem (ZG, OM), pp. 719–727.

VDME-1991-1-Blaue #compilation #set

A VDM Subset Compiler (CB), pp. 697–698.

VDME-1991-1-LarsenL #execution #set #specification

An Executable Subset of Meta-IV with Loose Specification (PGL, PBL), pp. 604–618.

SEKE-1990-JeffreyM #petri net #set

A High-Level Petri Net for a Subset of FGHC (JJ, TM), pp. 260–266.

SIGIR-1990-Burkowski #retrieval #set

Surrogate Subsets: A Free Space Management Strategy for the Index of a Text Retrieval System (FJB), pp. 211–226.

CADE-1990-Hines #proving #set

Str+ve-Subset: The Str+ve-based Subset Prover (LMH), pp. 193–206.

CADE-1990-Schwind #decidability #logic #proving #set #theorem proving

A Tableau-Based Theorem Prover for a Decidable Subset of Default Logic (CS), pp. 528–542.

NACLP-1989-JayaramanP #equation #programming #set

Programming with Equations, Subsets, and Relations (BJ, DAP), pp. 1051–1068.

JICSCP-1988-JayaramanN88 #implementation #logic programming

Subset-Logic Programming: Application and Implementation (BJ, AN), pp. 843–858.

LICS-1988-SalvesenS #set #type system

The Strength of the Subset Type in Martin-Löf’s Type Theory (AS, JMS), pp. 384–391.

PODS-1987-GrahneSS #evaluation #performance #query #recursion #set

Efficient Evaluation for a Subset of Recursive Queries (GG, SS, ESS), pp. 284–293.

ICALP-1986-Metivier #commutative #monad #on the #set

On Recognizable Subsets of Free Partially Commutative Monoids (YM), pp. 254–264.

ICALP-1985-Stirling #composition #proving #set

A Complete Compositional Model Proof System for a Subset of CCS (CS), pp. 475–486.

ICSE-1976-ParnasHW #design #operating system #product line #set #specification #system family

Design and Specification of the Minimal Subset of an Operating System Family (Abstract) (DLP, GH, HW), p. 123.

ICALP-1974-FlajoletS #on the #set

On Sets Having Only Hard Subsets (PF, JMS), pp. 446–457.

STOC-1971-Terrine #algorithm #bottom-up #context-free grammar #generative #parsing #set

An Algorithm Generating the Decision Table of a Deterministic Bottom Up Parser for a Subset of Context Free Grammars (GT), pp. 185–205.