Stem instanc$ (all stems)

230 papers:

ICALP-v2-2015-AmarilliBS

Provenance Circuits for Trees and Treelike Instances (AA, PB, PS), pp. 56–68.

ICEIS-v1-2015-XiMY #database #manycore #named

PM-DB: Partition-based Multi-instance Database System for Multicore Platforms (FX, TM, HY), pp. 128–138.

ECIR-2015-KimVBR #clustering #multi

Temporal Multinomial Mixture for Instance-Oriented Evolutionary Clustering (YMK, JV, SB, MAR), pp. 593–604.

ICML-2015-PhamRFA #learning #multi #novel

Multi-instance multi-label learning in the presence of novel class instances (ATP, RR, XZF, JPA), pp. 2427–2435.

KDD-2015-GongSRG #modelling

Instance Weighting for Patient-Specific Risk Stratification Models (JJG, TMS, JDR, JVG), pp. 369–378.

MoDELS-2015-StephanC #clone detection #detection #identification #using

Identification of Simulink model antipattern instances using model clone detection (MS, JRC), pp. 276–285.

SAC-2015-VielMT #approach #multi

An approach for controlling synchronous remote instances of a multimedia presentation (CCV, ELM, CACT), pp. 1285–1290.

HPDC-2015-GuoCWZ

Bidding for Highly Available Services with Low Price in Spot Instance Market (WG, KC, YW, WZ), pp. 191–202.

SAT-2015-MangalZNN #framework #lazy evaluation #named #satisfiability #scalability

Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT Instances (RM, XZ, AVN, MN), pp. 299–306.

SIGMOD-2014-ParchasGPB #graph #nondeterminism

The pursuit of a good possible world: extracting representative instances of uncertain graphs (PP, FG, DP, FB), pp. 967–978.

ICALP-v2-2014-GogaczM #decidability #termination

All-Instances Termination of Chase is Undecidable (TG, JM), pp. 293–304.

SFM-2014-AlbertAGR #concept #concurrent #execution #generative #symbolic computation #testing

Test Case Generation by Symbolic Execution: Basic Concepts, a CLP-Based Instance, and Actor-Based Concurrency (EA, PA, MGZ, JMR), pp. 263–309.

CAiSE-2014-PolyvyanyyRH #modelling #performance #process #retrieval #using

Indexing and Efficient Instance-Based Retrieval of Process Models Using Untanglings (AP, MLR, AHMtH), pp. 439–456.

EDOC-2014-Pufahl0W #process

Batch Regions: Process Instance Synchronization Based on Data (LP, AM, MW), pp. 150–159.

CIKM-2014-WuHPZCZ #feature model #learning #multi

Exploring Features for Complicated Objects: Cross-View Feature Selection for Multi-Instance Learning (JW, ZH, SP, XZ, ZC, CZ), pp. 1699–1708.

ICPR-2014-BertonL #graph #learning

Graph Construction Based on Labeled Instances for Semi-supervised Learning (LB, AdAL), pp. 2477–2482.

ICPR-2014-CheplyginaSTPLB #classification #learning #multi

Classification of COPD with Multiple Instance Learning (VC, LS, DMJT, JJHP, ML, MdB), pp. 1508–1513.

ICPR-2014-PengHHZM #estimation

Head Pose Estimation by Instance Parameterization (XP, JH, QH, SZ, DNM), pp. 1800–1805.

ICPR-2014-StraehleKKH #learning #multi #random

Multiple Instance Learning with Response-Optimized Random Forests (CNS, MK, UK, FAH), pp. 3768–3773.

ICPR-2014-UmakanthanDFS #learning #multi #process #representation #taxonomy

Multiple Instance Dictionary Learning for Activity Representation (SU, SD, CF, SS), pp. 1377–1382.

KEOD-2014-TongphuS #logic #standard

A Non-standard Instance Checking for the Description Logic ELH (ST, BS), pp. 67–74.

KR-2014-EckePT #concept #query #similarity

Answering Instance Queries Relaxed by Concept Similarity (AE, RP, AYT).

ICSE-2014-LinXXLPSZ #detection #difference #multi

Detecting differences across multiple instances of code clones (YL, ZX, YX, YL, XP, JS, WZ), pp. 164–174.

SAT-2014-SakaiST #reduction #satisfiability #strict

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

ICSM-2013-MartinezDM #abstract syntax tree #analysis #automation

Automatically Extracting Instances of Code Change Patterns with AST Analysis (MM, LD, MM), pp. 388–391.

STOC-2013-Huang #approximate #satisfiability

Approximation resistance on satisfiable instances for predicates with few accepting inputs (SH), pp. 457–466.

GCM-J-2012-MantzTL #co-evolution #graph

Co-Transformation of Type and Instance Graphs Supporting Merging of Types and Retyping (FM, GT, YL).

CIKM-2013-ManiuC #performance #social

Network-aware search in social tagging applications: instance optimality versus efficiency (SM, BC), pp. 939–948.

ICML-c2-2013-KrummenacherOB #learning #multi

Ellipsoidal Multiple Instance Learning (GK, CSO, JMB), pp. 73–81.

ICML-c3-2013-WangWBLT #learning #multi #taxonomy

Max-Margin Multiple-Instance Dictionary Learning (XW, BW, XB, WL, ZT), pp. 846–854.

ICML-c3-2013-ZhangHSL #learning #multi #named

MILEAGE: Multiple Instance LEArning with Global Embedding (DZ, JH, LS, RDL), pp. 82–90.

KDD-2013-KongCY #classification #correlation #mining #multi #network

Multi-label classification by mining label and instance correlations from heterogeneous information networks (XK, BC, PSY), pp. 614–622.

KDD-2013-Vatsavai #approach #learning #multi #using

Gaussian multiple instance learning approach for mapping the slums of the world using very high resolution imagery (RRV), pp. 1419–1426.

KDD-2013-ZhangHL #learning #multi #named

MI2LS: multi-instance learning from multiple informationsources (DZ, JH, RDL), pp. 149–157.

KDIR-KMIS-2013-NhungNCLT #approach #image #learning #multi

A Multiple Instance Learning Approach to Image Annotation with Saliency Map (TPN, CTN, JC, HVL, TT), pp. 152–159.

MLDM-2013-OthmanB #induction #reduction

Preceding Rule Induction with Instance Reduction Methods (OO, CHB), pp. 209–218.

SAC-2013-PflugR #information management

Dynamic instance queuing in process-aware information systems (JP, SRM), pp. 1426–1433.

SLE-2013-BakDACW #subclass

Partial Instances via Subclassing (KB, ZD, MA, KC, AW), pp. 344–364.

LICS-2013-Staton #algebra #perspective

Instances of Computational Effects: An Algebraic Perspective (SS), p. 519.

SAT-2013-IserST #modelling #satisfiability

Minimizing Models for Tseitin-Encoded SAT Instances (MI, CS, MT), pp. 224–232.

CSEET-2012-LiuML #education #re-engineering

The Exploration and Practice of Gradually Industrialization Model in Software Engineering Education — A Factual Instance of the Excellent Engineer Plan of China (SL, PM, DL), pp. 23–31.

TACAS-2012-WangTGLS #analysis #formal method

Reduction-Based Formal Analysis of BGP Instances (AW, CLT, AJTG, BTL, AS), pp. 283–298.

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.

GT-VMT-2012-Taentzer #generative #graph #multi

Instance Generation from Type Graphs with Arbitrary Multiplicities (GT).

CAiSE-2012-DaskalakiP #approach #multi

OtO Matching System: A Multi-strategy Approach to Instance Matching (ED, DP), pp. 286–300.

ICEIS-v1-2012-RibeiroFBBDKE #algorithm #approach #learning

Unified Algorithm to Improve Reinforcement Learning in Dynamic Environments — An Instance-based Approach (RR, FF, MACB, APB, OBD, ALK, FE), pp. 229–238.

ICEIS-v3-2012-CarvalhoRACJDM #energy #network #performance #policy #towards

Towards Sustainable Networks — Energy Efficiency Policy from Business to Device Instance Levels (TCMBC, ACR, MA, CHAC, GCJ, CKD, CM), pp. 238–243.

CIKM-2012-NiuRWY #effectiveness #mining #web

An effective rule miner for instance matching in a web of data (XN, SR, HW, YY), pp. 1085–1094.

ICPR-2012-HajimirsadeghiM #multi

Multiple instance real boosting with aggregation functions (HH, GM), pp. 2706–2710.

KDD-2012-BriggsFR

Rank-loss support instance machines for MIML instance annotation (FB, XZF, RR), pp. 534–542.

MLDM-2012-ToussaintB #comparison #empirical #learning

Proximity-Graph Instance-Based Learning, Support Vector Machines, and High Dimensionality: An Empirical Comparison (GTT, CB), pp. 222–236.

MLDM-2012-XuCG #concept #learning #multi #using

Constructing Target Concept in Multiple Instance Learning Using Maximum Partial Entropy (TX, DKYC, IG), pp. 169–182.

SIGIR-2012-Hanbury #information retrieval

Medical information retrieval: an instance of domain-specific search (AH), pp. 1191–1192.

SIGIR-2012-Lupu #information retrieval

Patent information retrieval: an instance of domain-specific search (ML), pp. 1189–1190.

SAC-2012-AkessonHRM #pervasive

Instance-aware assemblies of services in pervasive computing (LÅ, GH, SGR, BM), pp. 1554–1556.

ICSE-2012-PloomSG #migration #process #scalability

Methodology for migration of long running process instances in a global large scale BPM environment in Credit Suisse’s SOA landscape (TP, SS, AG), pp. 977–986.

ISMM-2012-SeweMSABRG #behaviour #comparison #java #memory management #scala #source code

new Scala() instance of Java: a comparison of the memory behaviour of Java and Scala programs (AS, MM, AS, DA, WB, NPR, SZG), pp. 97–108.

ISSTA-2012-ZhaiXCT #approach #named #parallel #thread

CARISMA: a context-sensitive approach to race-condition sample-instance selection for multithreaded applications (KZ, BX, WKC, THT), pp. 221–231.

SAT-2012-BurgKK #clustering #re-engineering #satisfiability

Creating Industrial-Like SAT Instances by Clustering and Reconstruction — (Poster Presentation) (SB, SK, MK), pp. 471–472.

SAT-2012-DemirovicG #composition #performance #satisfiability

An Efficient Method for Solving UNSAT 3-SAT and Similar Instances via Static Decomposition — (Poster Presentation) (ED, HG), pp. 489–490.

DATE-2011-ChiuSH #constraints #pipes and filters #precedence #realtime #streaming #synthesis

Pipeline schedule synthesis for real-time streaming tasks with inter/intra-instance precedence constraints (YSC, CSS, SHH), pp. 1321–1326.

ICDAR-2011-KumarPD #classification #documentation #image #learning #multi #using

Document Image Classification and Labeling Using Multiple Instance Learning (JK, JP, DSD), pp. 1059–1063.

ICDAR-2011-ShaoWXZZ11a #learning #multi

Multiple Instance Learning Based Method for Similar Handwritten Chinese Characters Discrimination (YS, CW, BX, RZ, YZ), pp. 1002–1006.

VLDB-2012-SuchanekAS11 #named #probability

PARIS: Probabilistic Alignment of Relations, Instances, and Schema (FMS, SA, PS), pp. 157–168.

WCRE-2011-GravinoRST #comprehension #design pattern #documentation #source code

Does the Documentation of Design Pattern Instances Impact on Source Code Comprehension? Results from Two Controlled Experiments (CG, MR, GS, GT), pp. 67–76.

ICFP-2011-DevrieseP #on the

On the bright side of type classes: instance arguments in Agda (DD, FP), pp. 143–155.

GCM-2010-HoffmannM11 #adaptation #diagrams #generative #graph

Generating Instance Graphs from Class Diagrams with Adaptive Star Grammars (BH, MM).

CIKM-2011-OroR #approach #learning #named

SILA: a spatial instance learning approach for deep webpages (EO, MR), pp. 2329–2332.

ICML-2011-BabenkoVDB #learning #multi

Multiple Instance Learning with Manifold Bags (BB, NV, PD, SB), pp. 81–88.

KDIR-2011-NguyenLT #classification #image #multi

Cascade of Multi-level Multi-instance Classifiers for Image Annotation (CTN, HVL, TT), pp. 14–23.

MLDM-2011-AhmadP #fuzzy #modelling

Granular Instances Selection for Fuzzy Modeling (SSSA, WP), pp. 99–111.

MLDM-2011-XuGC #adaptation #kernel #learning #multi

Adaptive Kernel Diverse Density Estimate for Multiple Instance Learning (TX, IG, DKYC), pp. 185–198.

ICLP-J-2011-CruzR #evaluation #logic programming #performance #retrieval #source code

Efficient instance retrieval of subgoals for subsumptive tabled evaluation of logic programs (FC, RR), pp. 697–712.

SAT-2011-ArgelichLMP #evaluation #satisfiability

Analyzing the Instances of the MaxSAT Evaluation (JA, CML, FM, JP), pp. 360–361.

ICSM-2010-LuciaDGR #design pattern #detection #dynamic analysis #eclipse #plugin

An Eclipse plug-in for the detection of design pattern instances through static and dynamic analysis (ADL, VD, CG, MR), pp. 1–6.

ICFP-2010-MorrisJ #programming

Instance chains: type class programming without overlapping instances (JGM, MPJ), pp. 375–386.

ICEIS-AIDSS-2010-FariaGSMM #automation #natural language #ontology #using

Using Natural Language Processing for Automatic Extraction of Ontology Instances (CGdF, RG, IS, MM, DM), pp. 278–283.

ICEIS-J-2010-KuhnDGC10a #knowledge-based

Knowledge-Based Engineering Template Instances Update Support (OK, TD, PG, PC), pp. 151–163.

ECIR-2010-PascaARMH #query #web

The Role of Query Sessions in Extracting Instance Attributes from Web Search Queries (MP, EA, ERA, RMB, KBH), pp. 62–74.

ICML-2010-DeselaersF #learning #multi #random

A Conditional Random Field for Multiple-Instance Learning (TD, VF), pp. 287–294.

ICML-2010-KimT10a #learning #multi #process

Gaussian Processes Multiple Instance Learning (MK, FDlT), pp. 535–542.

ICPR-2010-Amores #case study #comparative #multi

Vocabulary-Based Approaches for Multiple-Instance Data: A Comparative Study (JA), pp. 4246–4250.

ICPR-2010-BoltonG #framework #learning #multi #optimisation #random #set

Cross Entropy Optimization of the Random Set Framework for Multiple Instance Learning (JB, PDG), pp. 3907–3910.

ICPR-2010-DundarBRJSG #approach #classification #learning #multi #towards

A Multiple Instance Learning Approach toward Optimal Classification of Pathology Slides (MD, SB, VCR, RKJ, OS, MNG), pp. 2732–2735.

ICPR-2010-GriptonL #kernel #semistructured data #using

Kernel Domain Description with Incomplete Data: Using Instance-Specific Margins to Avoid Imputation (AG, WL), pp. 2921–2924.

ICPR-2010-GuoJWG #multi

Finding Multiple Object Instances with Occlusion (GG, TJ, YW, WG), pp. 3878–3881.

ICPR-2010-Ikizler-CinbisS #locality #recognition

Object Recognition and Localization Via Spatial Instance Embedding (NIC, SS), pp. 452–455.

ICPR-2010-LopesGKO #classification #music

Selection of Training Instances for Music Genre Classification (ML, FG, ALK, LESdO), pp. 4569–4572.

ICPR-2010-NiSRM #learning #multi #online

Particle Filter Tracking with Online Multiple Instance Learning (ZN, SS, AR, BSM), pp. 2616–2619.

ICPR-2010-SternigRB #classification #learning #multi

Inverse Multiple Instance Learning for Classifier Grids (SS, PMR, HB), pp. 770–773.

ICPR-2010-TaxHVP #clustering #concept #detection #learning #multi #using

The Detection of Concept Frames Using Clustering Multi-instance Learning (DMJT, EH, MFV, MP), pp. 2917–2920.

ICPR-2010-ZareG #multi #pattern matching #pattern recognition #recognition #using

Pattern Recognition Using Functions of Multiple Instances (AZ, PDG), pp. 1092–1095.

KDIR-2010-GuderSC #kernel #modelling #quality

Integrated Instance-based and Kernel Methods for Power Quality Knowledge Modeling (MG, ÖS, IÇ), pp. 352–357.

KEOD-2010-ArdilaAL #kernel #learning #multi #ontology

Multiple Kernel Learning for Ontology Instance Matching (DA, JA, FL), pp. 311–318.

SIGIR-2010-AlfonsecaPR

Acquisition of instance attributes via labeled and related instances (EA, MP, ERA), pp. 58–65.

SAC-2010-ShinKNNTO #named #ontology #recommendation #using

ONTOMO: web-based ontology building system: ---instance recommendation using bootstrapping--- (IS, TK, HN, KN, YT, AO), pp. 1442–1443.

SAT-2010-GelderS #design #satisfiability

Zero-One Designs Produce Small Hard SAT Instances (AVG, IS), pp. 388–397.

SAT-2010-MatthewsP #satisfiability

Uniquely Satisfiable k-SAT Instances with Almost Minimal Occurrences of Each Variable (WM, RP), pp. 369–374.

LATA-2009-BeyersdorffKM #complexity #nondeterminism #proving

Nondeterministic Instance Complexity and Proof Systems with Advice (OB, JK, SM), pp. 164–175.

ICEIS-J-2009-BohmHPLW #integration #process

Vectorizing Instance-Based Integration Processes (MB, DH, SP, WL, UW), pp. 40–52.

ICEIS-J-2009-LemeCBF #owl

Instance-Based OWL Schema Matching (LAPPL, MAC, KKB, ALF), pp. 14–26.

CIKM-2009-ChenLQZ #classification

Instance- and bag-level manifold regularization for aggregate outputs classification (SC, BL, MQ, CZ), pp. 1593–1596.

ICML-2009-ChengHH #learning #ranking

Decision tree and instance-based learning for label ranking (WC, JCH, EH), pp. 161–168.

ICML-2009-ZhanLLZ #learning #metric #using

Learning instance specific distances using metric propagation (DCZ, ML, YFL, ZHZ), pp. 1225–1232.

ICML-2009-ZhouSL #learning #multi

Multi-instance learning by treating instances as non-I.I.D. samples (ZHZ, YYS, YFL), pp. 1249–1256.

ECMDA-FA-2009-MougenotDBS #generative #metamodelling #random

Uniform Random Generation of Huge Metamodel Instances (AM, AD, XB, MS), pp. 130–145.

SAC-2009-LavorLMM #distance #geometry #on the #problem #subclass

On a discretizable subclass of instances of the molecular distance geometry problem (CL, LL, AM, NM), pp. 804–805.

CAV-2009-Jacobs #generative #incremental #reasoning

Incremental Instance Generation in Local Reasoning (SJ), pp. 368–382.

SAT-2009-NikolicMJ #policy #satisfiability

Instance-Based Selection of Policies for SAT Solvers (MN, FM, PJ), pp. 326–340.

PODS-2008-SenellartG #complexity #database #on the

On the complexity of deriving schema mappings from database instances (PS, GG), pp. 23–32.

SIGMOD-2008-CaoDCT #multi #optimisation #query

Optimizing complex queries with multiple relation instances (YC, GCD, CYC, KLT), pp. 525–538.

STOC-2008-FortnowS

Infeasibility of instance compression and succinct PCPs for NP (LF, RS), pp. 133–142.

GT-VMT-2006-WinkelmannTEK08 #constraints #generative #graph grammar #metamodelling #ocl #strict

Translation of Restricted OCL Constraints into Graph Constraints for Generating Meta Model Instances by Graph Grammars (JW, GT, KE, JMK), pp. 159–170.

CSCW-2008-BardzellBPR #effectiveness

Blissfully productive: grouping and cooperation in world of warcraft instance runs (SB, JB, TP, KNR), pp. 357–360.

CSCW-2008-DanisS #enterprise #wiki

A wiki instance in the enterprise: opportunities, concerns and reality (CD, DS), pp. 495–504.

ICML-2008-BergeronZBB #multi #ranking

Multiple instance ranking (CB, JZ, CMB, KPB), pp. 48–55.

ICML-2008-RaykarKBDR #automation #feature model #induction #learning #multi

Bayesian multiple instance learning: automatic feature selection and inductive transfer (VCR, BK, JB, MD, RBR), pp. 808–815.

ICML-2008-WangYZ #adaptation #kernel #learning #multi

Adaptive p-posterior mixture-model kernels for multiple instance learning (HYW, QY, HZ), pp. 1136–1143.

ICPR-2008-FuR #learning #multi #performance

Fast multiple instance learning via L1, 2 logistic regression (ZF, ARK), pp. 1–4.

SEKE-2008-EmerVJ #analysis #database #relational #testing

Testing Relational Database Schemas with Alternative Instance Analysis (MCFPE, SRV, MJ), pp. 357–362.

SAT-2008-Gao #algorithm #complexity #problem #random

Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms (YG), pp. 91–104.

SAT-2008-GeorgiouP #algorithm #complexity #satisfiability

Complexity and Algorithms for Well-Structured k-SAT Instances (KG, PAP), pp. 105–118.

DocEng-2007-WeibelNS #documentation

A model for mapping between printed and digital document instances (NW, MCN, BS), pp. 19–28.

ICALP-2007-KapronMS

A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC) (BMK, LM, SV), pp. 328–339.

CAiSE-2007-ZhaoLYS #workflow

Handling Instance Correspondence in Inter-organisational Workflows (XZ, CL, YY, WS), pp. 51–65.

ICEIS-DISI-2007-RayG #using

A method for early correspondence discovery using instance data (IR, CJMG), pp. 258–263.

ICEIS-EIS-2007-MaLO #on the #process #workflow

On Grouping of Activities Instances in Workflow Management Systems (DCM, JYCL, MEO), pp. 125–130.

ICML-2007-BunescuM #learning #multi

Multiple instance learning for sparse positive bags (RCB, RJM), pp. 105–112.

ICML-2007-ZhouX #learning #multi #on the

On the relation between multi-instance learning and semi-supervised learning (ZHZ, JMX), pp. 1167–1174.

MLDM-2007-GomezF #2d #algorithm #evolution #hybrid #image #learning

A Hybrid Algorithm Based on Evolution Strategies and Instance-Based Learning, Used in Two-Dimensional Fitting of Brightness Profiles in Galaxy Images (JCG, OF), pp. 716–726.

PPDP-2007-LiuP #induction #logic programming

Nonmonotonic inductive logic programming by instance patterns (CL, EP), pp. 187–196.

PADL-2007-LiuP #induction #logic programming

Inductive Logic Programming by Instance Patterns (CL, EP), pp. 230–244.

SAC-2007-FanizzidE #retrieval

Instance-based retrieval by analogy (NF, Cd, FE), pp. 1398–1402.

CADE-2007-Baumgartner #logic

Logical Engineering with Instance-Based Methods (PB), pp. 404–409.

DATE-2006-KimH

Associative skew clock routing for difficult instances (MSK, JH), pp. 762–767.

DocEng-2006-FariaO #distance #documentation

Measuring aesthetic distance between document templates and instances (ACF, JBSdO), pp. 13–21.

PODS-2006-CaldersDHP #workflow

Analyzing workflows implied by instance-dependent access rules (TC, SD, JH, JP), pp. 100–109.

ICEIS-AIDSS-2006-HefkeZAWBB #framework #java #ontology

An Extendable Java Framework for Instance Similarities in Ontologies (MH, VZ, AA, QW, EB, MB), pp. 263–269.

ICML-2006-CheungK #framework #learning #multi

A regularization framework for multiple-instance learning (PMC, JTK), pp. 193–200.

ICML-2006-RahmaniG #learning #multi #named

MISSL: multiple-instance semi-supervised learning (RR, SAG), pp. 705–712.

ICPR-v3-2006-ZhuW #ranking #scalability

Scalable Representative Instance Selection and Ranking (XZ, XW), pp. 352–355.

SIGIR-2006-YangC #clustering #detection

Near-duplicate detection by instance-level constrained clustering (HY, JPC), pp. 421–428.

VLDB-2005-BernsteinMM #interactive

Interactive Schema Translation with Instance-Level Mappings (PAB, SM, PM), pp. 1283–1286.

CAiSE-2005-CabotT #constraints #ocl

Computing the Relevant Instances That May Violate an OCL Constraint (JC, ET), pp. 48–62.

ICML-2005-BlockeelPS #learning #multi

Multi-instance tree learning (HB, DP, AS), pp. 57–64.

ICML-2005-DriessensD #first-order #learning #modelling

Combining model-based and instance-based learning for first order regression (KD, SD), pp. 193–200.

ICML-2005-RayC #comparison #empirical #learning #multi

Supervised versus multiple instance learning: an empirical comparison (SR, MC), pp. 697–704.

KDD-2005-Aggarwal #algorithm #classification #towards

Towards exploratory test instance specific algorithms for high dimensional classification (CCA), pp. 526–531.

SAT-J-2004-GiunchigliaNT05 #reasoning

QBF Reasoning on Real-World Instances (EG, MN, AT), pp. 105–121.

SAT-J-2004-SubbarayanP05 #named #preprocessor #satisfiability

NiVER: Non-increasing Variable Elimination Resolution for Preprocessing SAT Instances (SS, DKP), pp. 276–291.

CADE-2005-BechhoferHT #owl

The OWL Instance Store: System Description (SB, IH, DT), pp. 177–181.

SAT-2005-SinzD #named #satisfiability #visualisation

DPvis — A Tool to Visualize the Structure of SAT Instances (CS, EMD), pp. 257–268.

DATE-v1-2004-RamaniAMS #graph #independence #symmetry

Breaking Instance-Independent Symmetries in Exact Graph Coloring (AR, FAA, ILM, KAS), pp. 324–331.

VLDB-2004-WangWLM #database #query #web

Instance-based Schema Matching for Web Databases by Domain-specific Query Probing (JW, JRW, FHL, WYM), pp. 408–419.

ICML-2004-TaoSVO #approximate #learning #multi

SVM-based generalized multiple-instance learning via approximate box counting (QT, SDS, NVV, TTO).

SAT-2004-GiunchigliaNT #reasoning

QBF Reasoning on Real-World Instances (EG, MN, AT), pp. 247–254.

SAT-2004-HooryS #satisfiability

Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable (SH, SS), pp. 86–95.

ICML-2003-DriessensR #learning #relational

Relational Instance Based Regression for Relational Reinforcement Learning (KD, JR), pp. 123–130.

ICML-2003-McGovernJ #identification #learning #multi #predict #relational #using

Identifying Predictive Structures in Relational Data Using Multiple Instance Learning (AM, DJ), pp. 528–535.

ICML-2003-ZhangH #learning #taxonomy

Learning from Attribute Value Taxonomies and Partially Specified Instances (JZ, VH), pp. 880–887.

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.

ESEC-FSE-2003-RajanS #aspect-oriented #design #named

Eos: instance-level aspects for integrated system design (HR, KJS), pp. 291–306.

CADE-2003-RiazanovV #performance #relational #retrieval #standard

Efficient Instance Retrieval with Standard and Relational Path Indexing (AR, AV), pp. 380–396.

DAC-2002-AloulRMS #satisfiability #symmetry

Solving difficult SAT instances in the presence of symmetry (FAA, AR, ILM, KAS), pp. 731–736.

CAiSE-2002-TorchianoB #modelling #uml

Domain-Specific Instance Models in UML (MT, GB), pp. 774–777.

ICML-2002-GartnerFKS #kernel #multi

Multi-Instance Kernels (TG, PAF, AK, AJS), pp. 179–186.

ICML-2002-KleinKM #clustering #constraints #information management

From Instance-level Constraints to Space-Level Constraints: Making the Most of Prior Knowledge in Data Clustering (DK, SDK, CDM), pp. 307–314.

ICML-2002-ZhangGYF #image #learning #multi #retrieval #using

Content-Based Image Retrieval Using Multiple-Instance Learning (QZ, SAG, WY, JEF), pp. 682–689.

KDD-2002-FragoudisML #classification

Integrating feature and instance selection for text classification (DF, DM, SL), pp. 501–506.

OOPSLA-2002-MarellyHK #execution #multi #sequence chart

Multiple instances and symbolic variables in executable sequence charts (RM, DH, HK), pp. 83–100.

SAT-2002-AloulRMS #satisfiability #symmetry

Solving difficult SAT instances in the presence of symmetry (FAA, AR, IM, KS), p. 23.

SAT-2002-Hoos #algorithm #modelling #satisfiability

SLS algorithms for SAT: irregular instances, search stagnation, and mixture models (HH), p. 41.

SAT-2002-MonassonC #algorithm #analysis #exponential #random #satisfiability #scalability

Restart method and exponential acceleration of random 3-SAT instances resolutions: A large deviation analysis of the Davis-Putnam-Loveland-Logemann algorithm (RM, SC), p. 11.

STOC-2001-Trevisan #bound #optimisation #problem

Non-approximability results for optimization problems on bounded degree instances (LT), pp. 453–461.

ICALP-2001-FriedmanG #random #satisfiability

Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently (JF, AG), pp. 310–321.

CIKM-2001-YuXEK #collaboration #performance

Selecting Relevant Instances for Efficient and Accurate Collaborative Filtering (KY, XX, ME, HPK), pp. 239–246.

ICML-2001-AmarDGZ #learning #multi

Multiple-Instance Learning of Real-Valued Data (RAA, DRD, SAG, QZ), pp. 3–10.

ICML-2001-LloraG #algorithm

Inducing Partially-Defined Instances with Evolutionary Algorithms (XL, JMGiG), pp. 337–344.

ICML-2001-RayP #multi

Multiple Instance Regression (SR, DP), pp. 425–432.

ICML-2001-SchefferW #incremental #information management #problem

Incremental Maximization of Non-Instance-Averaging Utility Functions with Applications to Knowledge Discovery Problems (TS, SW), pp. 481–488.

SAT-2001-CoccoM #analysis #backtracking #physics #random #satisfiability #statistics

Statistical physics analysis of the backtrack resolution of random 3-SAT instances (SC, RM), pp. 36–47.

ASE-2000-Hall #legacy

Upgrading Legacy Instances of Reactive Systems (RJH), pp. 63–72.

CAiSE-2000-BehrensR #behaviour #code generation #model transformation #named

StateLator — Behavioral Code Generation as an Instance of a Model Transformation (TB, SR), pp. 401–416.

ICML-2000-LaneB #interface #learning #reduction

Data Reduction Techniques for Instance-Based Learning from Human/Computer Interface Data (TL, CEB), pp. 519–526.

ICML-2000-SebbanN #problem

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

ICML-2000-WagstaffC #clustering #constraints

Clustering with Instance-level Constraints (KW, CC), pp. 1103–1110.

ICML-2000-WnagZ #approach #lazy evaluation #learning #multi #problem

Solving the Multiple-Instance Problem: A Lazy Learning Approach (JW, JDZ), pp. 1119–1126.

ICPR-v4-2000-FolkersSS #multi #query #using

Processing Pictorial Queries with Multiple Instances Using Isomorphic Subgraphs (AF, HS, AS), pp. 4051–4054.

ICALP-1999-Ajtai #generative #problem

Generating Hard Instances of the Short Basis Problem (MA), pp. 1–9.

ICML-1999-Bosch #abstraction #in memory #learning

Instance-Family Abstraction in Memory-Based Language Learning (AvdB), pp. 39–48.

ICML-1998-MaronR #classification #learning #multi

Multiple-Instance Learning for Natural Scene Classification (OM, ALR), pp. 341–349.

SIGIR-1998-LamH #automation #categorisation #set #using

Using a Generalized Instance Set for Automatic Text Categorization (WL, CYH), pp. 81–89.

TRI-Ada-1997-RileyDP #analysis #implementation #verification

An Instance of the Application Download Pattern: The SPAIDS Software Loader/Verifier Domain Analysis and Implementation (JDR, SD, WP), pp. 273–278.

ICML-1997-Auer #approach #empirical #evaluation #learning #multi #on the

On Learning From Multi-Instance Examples: Empirical Evaluation of a Theoretical Approach (PA), pp. 21–29.

ICML-1997-WilsonM

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

STOC-1996-Ajtai #generative #problem

Generating Hard Instances of Lattice Problems (Extended Abstract) (MA), pp. 99–108.

CHI-1996-AckermanP #process

The Zephyr Help Instance: Promoting Ongoing Activity in a CSCW System (MSA, LP), pp. 268–275.

ICML-1996-EmdeW #learning #relational

Relational Instance-Based Learning (WE, DW), pp. 122–130.

ICML-1996-TirriKM #learning

Prababilistic Instance-Based Learning (HT, PK, PM), pp. 507–515.

WCRE-1995-YehHR #data type

Recovering Abstract Data Types and Object Instances from a Conventional Procedural Language (ASY, DRH, HBR), pp. 227–236.

STOC-1995-AroraKK #approximate #np-hard #polynomial #problem

Polynomial time approximation schemes for dense instances of NP-hard problems (SA, DRK, MK), pp. 284–293.

ICML-1995-ClearyT #distance #using

K*: An Instance-based Learner Using and Entropic Distance Measure (JGC, LET), pp. 108–114.

ICML-1995-McCallum #learning

Instance-Based Utile Distinctions for Reinforcement Learning with Hidden State (AM), pp. 387–395.

DAC-1994-IwamaH #generative #logic #random

Random Generation of Test Instances for Logic Optimizers (KI, KH), pp. 430–434.

TRI-Ada-1994-BodilyEW #ada #implementation

Implementing OSA Model Instances in Ada (SB, DWE, SNW), pp. 331–342.

FME-1993-PickinYBSG #process #simulation

Process Instances in LOTOS Simulation (SP, YY, WB, SS, TdG), pp. 521–540.

ICML-1993-Quinlan #learning #modelling

Combining Instance-Based and Model-Based Learning (JRQ), pp. 236–243.

RE-1993-Feather #requirements

Requirements reconnoitring at the juncture of domain and instance (MSF), pp. 73–76.

ML-1992-Zhang #learning

Selecting Typical Instances in Instance-Based Learning (JZ), pp. 470–479.

OOPSLA-1992-MyersGZ #declarative #object-oriented #programming #prototype

Declarative Programming in a Prototype-Instance System: Object-Oriented Programming Without Writing Methods (BAM, DAG, BTVZ), pp. 184–200.

ML-1991-Aha #approach #incremental #induction

Incremental Constructive Induction: An Instance-Based Approach (DWA), pp. 117–121.

ML-1991-Saxena #on the #representation

On the Effect of Instance Representation on Generalization (SS), pp. 198–202.

OOPSLA-1991-GoldR #named #smalltalk

Portia: AN Instance-Centered Environment for Smalltalk (EG, MBR), pp. 62–74.

SIGMOD-1990-AtzeniT #independence #performance

Efficient Updates to Independent Schemes in the Weak Instance Model (PA, RT), pp. 84–93.

PODS-1989-AtzeniT #database

Updating Databases in the Weak Instance Model (PA, RT), pp. 101–109.

ML-1989-Aha #concept #incremental #independence #learning

Incremental, Instance-Based Learning of Independent and Graded Concept Descriptions (DWA), pp. 387–391.

ML-1989-Saxena

Evaluating alternative Instance Representations (SS), pp. 465–468.

STOC-1988-VenkatesanL #graph #problem #random

Random Instances of a Graph Coloring Problem Are Hard (RV, LAL), pp. 217–222.

JICSCP-1988-BruynoogheJ88 #abstract interpretation

An Instance of Abstract Interpretation Integrating Type and Mode Inferencing (MB, GJ), pp. 669–683.

PODS-1987-AtzeniB

A New Basis for the Weak Instance Model (PA, MCDB), pp. 79–86.

OOPSLA-1986-MittalBK #bound

Virtual Copies — At the Boundary Between Classes and Instances (SM, DGB, KMK), pp. 159–166.

PODS-1985-AtzeniC #approach #performance #query

Efficient Query Answering in the Representative Instance Approach (PA, EPFC), pp. 181–188.

PODS-1985-Sagiv85a #on the #strict

On Computing Restricted Projections of Representative Instances (YS), pp. 171–180.

PODS-1984-ImielinskiS #database #on the

On Lossless Transformation of Database Schemes not Necessarily Satisfying Universal Instance Assumption (TI, NS), pp. 258–265.

PODS-1984-Yannakakis #query

Querying Weak Instances (MY), pp. 275–280.

SCC-1984-Bray #ada

Sharing code among instances of Ada generics (GB), pp. 276–284.

STOC-1984-Levin #problem

Problems, Complete in “Average” Instance (LAL), p. 465.

PODS-1983-Sciore #dependence

Inclusion Dependencies and the Universal Instance (ES), pp. 48–57.

SIGMOD-1981-Sagiv #question #using

Can We Use the Universal Instance Assumption Without Using Nulls? (YS), pp. 108–120.

SCC-1979-Raiha #attribute grammar #multi

Dynamic allocation of space for attribute instances in multi-pass evaluators of attribute grammars (KJR), pp. 26–38.