Stem discov$ (all stems)

328 papers:

ICPC-2015-SchermannBPLG #commit

Discovering loners and phantoms in commit and issue data (GS, MB, SP, PL, HCG), pp. 4–14.

ICSME-2015-NagyC #fault #mining #query #sql #stack overflow

Mining Stack Overflow for discovering error patterns in SQL queries (CN, AC), pp. 516–520.

SCAM-2015-PanditaJSW #api #mining #using

Discovering likely mappings between APIs using text mining (RP, RPJ, SDS, LAW), pp. 231–240.

HCI-IT-2015-TakedaBSO #behaviour #coordination #named

COLUMN: Discovering the User Invented Behaviors Through the Interpersonal Coordination (YT, SB, PRSDS, MO), pp. 787–796.

ICEIS-v1-2015-ArevaloRC #approach #information management #legacy #modelling #process

Discovering Business Models for Software Process Management — An Approach for Integrating Time and Resource Perspectives from Legacy Information Systems (CA, IMR, MJEC), pp. 353–359.

ICML-2015-GongZSTG

Discovering Temporal Causal Relations from Subsampled Data (MG, KZ, BS, DT, PG), pp. 1898–1906.

ICML-2015-NarayanPA #metaprogramming

α-β Divergences Discover Micro and Macro Structures in Data (KSN, AP, PA), pp. 796–804.

KDD-2015-KimS #scalability

Discovering Collective Narratives of Theme Parks from Large Collections of Visitors’ Photo Streams (GK, LS), pp. 1899–1908.

KDD-2015-Papagiannopoulou #learning #multi

Discovering and Exploiting Deterministic Label Relationships in Multi-Label Learning (CP, GT, IT), pp. 915–924.

KDD-2015-VanchinathanMRK

Discovering Valuable items from Massive Data (HPV, AM, CAR, DK, AK), pp. 1195–1204.

SEKE-2015-AlencarARRB #rule-based

A Rule-based Method for Discovering Trajectory Profiles (LAdA, LOA, CR, AR, VB), pp. 244–249.

SIGIR-2015-Pal #multi

Discovering Experts across Multiple Domains (AP), pp. 923–926.

MoDELS-2015-LeemansA #distributed #mining #modelling #process #transaction

Process mining in software systems: Discovering real-life business transactions and process models from distributed systems (ML, WMPvdA), pp. 44–53.

SAC-2015-ChoobdarRS #network

Discovering weighted motifs in gene co-expression networks (SC, PMPR, FMAS), pp. 10–17.

ICSE-v1-2015-PastoreM #detection #named

ZoomIn: Discovering Failures by Detecting Wrong Assertions (FP, LM), pp. 66–76.

ICSE-v1-2015-PetrosyanRM #api #classification #information management #using

Discovering Information Explaining API Types Using Text Classification (GP, MPR, RDM), pp. 869–879.

SIGMOD-2014-ShenCCDN #query #tuple

Discovering queries based on example tuples (YS, KC, SC, BD, LN), pp. 493–504.

FM-2014-ForejtKNS #analysis #communication #precise #predict #source code

Precise Predictive Analysis for Discovering Communication Deadlocks in MPI Programs (VF, DK, GN, SS), pp. 263–278.

CHI-2014-GouZY #automation #comprehension #social #social media

KnowMe and ShareMe: understanding automatically discovered personality traits from social media and user sharing preferences (LG, MXZ, HY), pp. 955–964.

ICML-c2-2014-LindermanA #network #process

Discovering Latent Network Structure in Point Process Data (SWL, RPA), pp. 1413–1421.

ICPR-2014-ChironGM #behaviour #parametricity #using

Discovering Emergent Behaviors from Tracks Using Hierarchical Non-parametric Bayesian Methods (GC, PGK, MM), pp. 2185–2190.

ICPR-2014-NegiBC #topic

Discovering User-Communities and Associated Topics from YouTube (SN, RB, SC), pp. 1958–1963.

ICPR-2014-SicreJ #classification #image

Discovering and Aligning Discriminative Mid-level Features for Image Classification (RS, FJ), pp. 1975–1980.

KDD-2014-HuHA #e-commerce #modelling #scalability #social

Style in the long tail: discovering unique interests with latent variable models in large scale social E-commerce (DJH, RH, JA), pp. 1640–1649.

KDIR-2014-DomeniconiMMP #ontology #random

Discovering New Gene Functionalities from Random Perturbations of Known Gene Ontological Annotations (GD, MM, GM, PP), pp. 107–116.

KDIR-2014-FontanaRZ

Discover Knowledge on FLOSS Projects Through RepoFinder (FAF, RR, MZ), pp. 485–491.

KMIS-2014-FrancoisMA #communication #design #email #problem #traceability #using

Discovering Problem-Solving Knowledge in Business Emails — Traceability in Software Design Using Computer Mediated Communication (RF, NM, HA), pp. 186–193.

SEKE-2014-DagninoC #industrial

Industrial Analytics to Discover Knowledge from Instrumented Networked Machines (AD, DC), pp. 86–89.

SIGIR-2014-WangariZA #case study #interface #multimodal

Discovering real-world use cases for a multimodal math search interface (KDVW, RZ, AA), pp. 947–950.

RE-2014-SutcliffeRBS #requirements

Discovering affect-laden requirements to achieve system acceptance (AS, PR, CNB, PS), pp. 173–182.

SAC-2014-MehdiIHKDS #keyword

Utilizing domain-specific keywords for discovering public SPARQL endpoints: a life-sciences use-case (MM, AI, AH, YK, SD, RS), pp. 333–335.

FSE-2014-MazinanianTM #css #refactoring

Discovering refactoring opportunities in cascading style sheets (DM, NT, AM), pp. 496–506.

HT-2013-AntunovicCTA #interactive #semantics #web

Discovering semantic associations from web search interactions (MA, GC, MT, HA), pp. 202–207.

SIGMOD-2013-ArenasDNUBV #xml

Discovering XSD keys from XML data (MA, JD, FN, MU, JVdB, SV), pp. 61–72.

VLDB-2013-ChuIP #constraints

Discovering Denial Constraints (XC, IFI, PP), pp. 1498–1509.

VLDB-2013-HassanzadehPYMPHH #web

Discovering Linkage Points over Web Data (OH, KQP, SHY, RJM, LP, MAH, HH), pp. 444–456.

VLDB-2013-LiUYG #correlation #database #sequence

Discovering Longest-lasting Correlation in Sequence Databases (YL, LHU, MLY, ZG), pp. 1666–1677.

VLDB-2013-MansourEKAA #named #parallel #scalability #sequence

RACE: A Scalable and Elastic Parallel System for Discovering Repeats in Very Long Sequences (EM, AER, PK, AA, AA), pp. 865–876.

FASE-2013-LeoniDG #branch #execution #process

Discovering Branching Conditions from Business Process Execution Logs (MdL, MD, LGB), pp. 114–129.

FASE-2013-SanthiarPK #api #mining #testing

Discovering Math APIs by Mining Unit Tests (AS, OP, AK), pp. 327–342.

ICSM-2013-CastrejonVCL #maintenance #named #persistent

ExSchema: Discovering and Maintaining Schemas from Polyglot Persistence Applications (JCC, GVS, CC, RL), pp. 496–499.

MSR-2013-NistorJT #debugging #performance

Discovering, reporting, and fixing performance bugs (AN, TJ, LT), pp. 237–246.

WCRE-2013-MaffortVBAH #architecture #heuristic

Heuristics for discovering architectural violations (CAM, MTV, MAdSB, NA, AH), pp. 222–231.

CAiSE-2013-MaggiBA #approach #knowledge-based

A Knowledge-Based Integrated Approach for Discovering and Repairing Declare Maps (FMM, RPJCB, WMPvdA), pp. 433–448.

ICEIS-v3-2013-LambeckKG #bibliography #case study #design #enterprise #interface #testing

Discovering Potentials in Enterprise Interface Design — A Review of Our Latest Case Studies in the Enterprise Domain (CL, DK, RG), pp. 99–104.

ICEIS-v3-2013-SzirbikB #architecture #network

Discovering the EIS Architecture that Supports Hub-and-Spoke Freight Transportation Networks Operating in a Cross Dock Mode (NBS, PB), pp. 388–395.

CIKM-2013-ChanLKLBR #graph #matrix #using

Discovering latent blockmodels in sparse and noisy graphs using non-negative matrix factorisation (JC, WL, AK, CL, JB, KR), pp. 811–816.

CIKM-2013-ChenMLHCG #topic #using

Discovering coherent topics using general knowledge (ZC, AM, BL, MH, MC, RG), pp. 209–218.

CIKM-2013-MengK #network

Discovering influential authors in heterogeneous academic networks by a co-ranking method (QM, PJK), pp. 1029–1036.

ICML-c2-2013-DasBBG #automation #modelling #topic

Subtle Topic Models and Discovering Subtly Manifested Software Concerns Automatically (MKD, SB, CB, KG), pp. 253–261.

KDD-2013-IwataSG #online #process #social

Discovering latent influence in online social activities via shared cascade poisson processes (TI, AS, ZG), pp. 266–274.

KDD-2013-YuanCMSM #topic #twitter #what

Who, where, when and what: discover spatio-temporal topics for twitter users (QY, GC, ZM, AS, NMT), pp. 605–613.

MLDM-2013-CarvalhoR #bibliography #nondeterminism #perspective

Discovering Frequent Itemsets on Uncertain Data: A Systematic Review (JVdC, DDR), pp. 390–404.

MLDM-2013-LiM #community #mining #network #topic

Mining Groups of Common Interest: Discovering Topical Communities with Network Flows (LL, NDM), pp. 405–420.

SAC-2013-AhmedE #network #trust

Discovering influential nodes from trust network (SA, CIE), pp. 121–128.

SAC-2013-Gaggi

Discovering local attractions from geo-tagged photos (OG), pp. 730–735.

SAC-2013-KhaniHAB #algorithm #clustering #semistructured data #set

An algorithm for discovering clusters of different densities or shapes in noisy data sets (FK, MJH, AAA, HB), pp. 144–149.

SAC-2013-LeoniA #mining #process #using

Data-aware process mining: discovering decisions in processes using alignments (MdL, WMPvdA), pp. 1454–1461.

SAC-2013-TsukudaOYIT #analysis #coordination

Discovering unexpected information on the basis of popularity/unpopularity analysis of coordinate objects and their relationships (KT, HO, MY, HI, KT), pp. 878–885.

ICSE-2013-RigbyR #documentation

Discovering essential code elements in informal documentation (PCR, MPR), pp. 832–841.

DRR-2012-LiMV #visual notation

Quantify spatial relations to discover handwritten graphical symbols (JL, HM, CVG).

VLDB-2012-NakasholeWS #web

Discovering and Exploring Relations on the Web (NN, GW, FMS), pp. 1982–1985.

VLDB-2012-ZhaoRGH #approach #integration

A Bayesian Approach to Discovering Truth from Conflicting Sources for Data Integration (BZ, BIPR, JG, JH), pp. 550–561.

MSR-2012-NguyenK #api #mutation testing #testing

Discovering complete API rules with mutation testing (ACN, SCK), pp. 151–160.

CIKM-2012-AnHS #learning #ontology #web

Learning to discover complex mappings from web forms to ontologies (YA, XH, IYS), pp. 1253–1262.

CIKM-2012-BauckmannALMN #dependence

Discovering conditional inclusion dependencies (JB, ZA, UL, HM, FN), pp. 2094–2098.

CIKM-2012-CuiZLMZ #twitter

Discover breaking events with popular hashtags in twitter (AC, MZ, YL, SM, KZ), pp. 1794–1798.

CIKM-2012-GangadharaiahC #named

PriSM: discovering and prioritizing severe technical issues from product discussion forums (RG, RC), pp. 1627–1631.

CIKM-2012-LiuQCH #logic

Discovering logical knowledge for deep question answering (ZL, XQ, LC, XH), pp. 1920–1924.

CIKM-2012-LvCC #semantics

Discovering personally semantic places from GPS trajectories (ML, LC, GC), pp. 1552–1556.

CIKM-2012-NguyenNMF #clustering #wiki

Clustering Wikipedia infoboxes to discover their types (THN, HDN, VM, JF), pp. 2134–2138.

CIKM-2012-WienbergG #named

PhotoFall: discovering weblog stories through photographs (CW, ASG), pp. 2575–2578.

ICML-2012-ZhaiTTO

Discovering Support and Affiliated Features from Very High Dimensions (YZ, MT, IWT, YSO), p. 226.

ICPR-2012-DeyG #behaviour #consistency #topic #twitter

Discovering regular and consistent behavioral patterns in topical tweeting (LD, BG), pp. 3464–3467.

ICPR-2012-TuiaMVFR #classification #image

Discovering relevant spatial filterbanks for VHR image classification (DT, MDM, MV, RF, AR), pp. 3212–3215.

KDD-2012-AndersonHKL #case study #community #process #stack overflow

Discovering value from community activity on focused question answering sites: a case study of stack overflow (AA, DPH, JMK, JL), pp. 850–858.

KDD-2012-Compton #experience

Experience with discovering knowledge by acquiring it (PC), p. 814.

KDD-2012-TangLS #dependence

Discovering lag intervals for temporal dependencies (LT, TL, LS), pp. 633–641.

KDD-2012-YuanZX #using

Discovering regions of different functions in a city using human mobility and POIs (JY, YZ, XX), pp. 186–194.

KEOD-2012-KotowskiS #approach #library #ontology

Ontology Library — A New Approach for Storing, Searching and Discovering Ontologies (DK, DAS), pp. 271–277.

KMIS-2012-LiLA #chat

Discovering Virtual Interest Groups across Chat Rooms (HL, JL, RA), pp. 152–157.

MLDM-2012-SiLQD #web

Discovering K Web User Groups with Specific Aspect Interests (JS, QL, TQ, XD), pp. 321–335.

RecSys-2012-Manzato #recommendation

Discovering latent factors from movies genres for enhanced recommendation (MGM), pp. 249–252.

SAC-2012-ChenGZG #metric #network #similarity #using

Discovering missing links in networks using vertex similarity measures (HHC, LG, X(Z, CLG), pp. 138–143.

SAC-2012-FerrariGT #approach #clustering #requirements #specification

A clustering-based approach for discovering flaws in requirements specifications (AF, SG, GT), pp. 1043–1050.

SAC-2012-FlorezD #interactive #process #video

Discovering activity interactions in a single pass over a video stream (OUF, CED), pp. 819–826.

SAC-2012-ZimmermannNSSK

Discovering global and local bursts in a stream of news (MZ, IN, ZFS, MS, HPK), pp. 807–812.

ICSE-2012-NguyenKWF #array #dynamic analysis #invariant #polynomial #using

Using dynamic analysis to discover polynomial and array invariants (TN, DK, WW, SF), pp. 683–693.

ICSE-2012-SongPF #interactive #named #using

iTree: Efficiently discovering high-coverage configurations using interaction trees (CS, AP, JSF), pp. 903–913.

ISSTA-2012-AlkhalafCFBOK #analysis #consistency #difference #named #nondeterminism #string #validation

ViewPoints: differential string analysis for discovering client- and server-side input validation inconsistencies (MA, SRC, MF, TB, AO, CK), pp. 56–66.

ICDAR-2011-ZhangLSZ #documentation

Discovering Legible Chinese Typefaces for Reading Digital Documents (BZ, YL, CYS, XZ), pp. 962–966.

ITiCSE-2011-Cervesato #logic

Discovering logic through comics (IC), pp. 103–107.

CSCW-2011-Murphy-HillM #effectiveness #interactive #tool support

Peer interaction effectively, yet infrequently, enables programmers to discover new tools (ERMH, GCM), pp. 405–414.

CSCW-2011-ShamiMM #enterprise #social

Browse and discover: social file sharing in the enterprise (NSS, MJM, DRM), pp. 295–304.

CIKM-2011-BaiCJ #feedback

Discovering URLs through user feedback (XB, BBC, FPJ), pp. 77–86.

CIKM-2011-KamathC

Discovering trending phrases on information streams (KYK, JC), pp. 2245–2248.

CIKM-2011-KargarA #network #social

Discovering top-k teams of experts with/without a leader in social networks (MK, AA), pp. 985–994.

CIKM-2011-NambiarFSNR #realtime

Discovering customer intent in real-time for streamlining service desk conversations (UN, TAF, LVS, SN, GR), pp. 1383–1388.

CIKM-2011-PeelWZ #string #using

Collection-based compression using discovered long matching strings (AP, AW, JZ), pp. 2361–2364.

CIKM-2011-SachanCFS #community #network #probability #social #topic

Probabilistic model for discovering topic based communities in social networks (MS, DC, TAF, LVS), pp. 2349–2352.

CIKM-2011-YiA #query #web

Discovering missing click-through query language information for web search (XY, JA), pp. 153–162.

ECIR-2011-TackstromM #fine-grained #modelling #predict #sentiment

Discovering Fine-Grained Sentiment with Latent Variable Structured Prediction Models (OT, RTM), pp. 368–374.

KDD-2011-El-AriniG #keyword

Beyond keyword search: discovering relevant scientific literature (KEA, CG), pp. 439–447.

KDD-2011-JinLA #graph #nondeterminism #reliability

Discovering highly reliable subgraphs in uncertain graphs (RJ, LL, CCA), pp. 992–1000.

KDD-2011-LiuZCYX #data type #interactive

Discovering spatio-temporal causal interactions in traffic data streams (WL, YZ, SC, JY, XX), pp. 1010–1018.

KDD-2011-ShiFZY #evolution #graph

Discovering shakers from evolving entities via cascading graph inference (XS, WF, JZ, PSY), pp. 1001–1009.

KDIR-2011-GuoK #ontology #research #using

Discovering Relationship Associations from the Literature Related to Research Projects in Sustainability Science using Ontology and Inference (WG, SBK), pp. 390–393.

KDIR-2011-OlegA #analysis #approach #clustering

Methods for Discovering and Analysis of Regularities Systems — Approach based on Optimal Partitioning of Explanatory Variables Space (OVS, AVK), pp. 423–426.

KMIS-2011-RamosSB #process

A Method for Discovering the Relevance of External Context Variables to Business Processes (ECR, FMS, FAB), pp. 399–408.

MLDM-2011-HuangH

Discovering Text Patterns by a New Graphic Model (MH, RMH), pp. 428–442.

REFSQ-2011-MahauxHS #case study #experience #requirements

Discovering Sustainability Requirements: An Experience Report (MM, PH, GS), pp. 19–33.

SAC-2011-Al-ZaidyFY #community #towards

Towards discovering criminal communities from textual data (RAZ, BCMF, AMY), pp. 172–177.

SAC-2011-DattoloEM #approach #semantics

An integrated approach to discover tag semantics (AD, DE, LM), pp. 814–820.

ICSE-2011-Sultanov #documentation #proximity #requirements

Requirements tracing: discovering related documents through artificial pheromones and term proximity (HS), pp. 1173–1175.

DRR-2010-KnoblockCCGMS #approach

A general approach to discovering, registering, and extracting features from raster maps (CAK, CCC, YYC, AG, MM, CS), pp. 1–10.

CHI-2010-MullerMF #enterprise

Patterns of usage in an enterprise file-sharing service: publicizing, discovering, and telling the news (MJM, DRM, JF), pp. 763–766.

CIKM-2010-BamisFS #component

A method for discovering components of human rituals from streams of sensor data (AB, JF, AS), pp. 779–788.

CIKM-2010-JinW #concept #ranking

Discovering, ranking and annotating cross-document relationships between concepts (WJ, XW), pp. 1929–1930.

KDD-2010-BhaskarLST

Discovering frequent patterns in sensitive data (RB, SL, AS, AT), pp. 503–512.

KDD-2010-FangNF

Discovering significant relaxed order-preserving submatrices (QF, WN, JF), pp. 433–442.

KDD-2010-ZouGL #database #graph #nondeterminism #probability #semantics

Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics (ZZ, HG, JL), pp. 633–642.

KDIR-2010-KaiserSB #approach #fuzzy #network #online #social

Discovering Critical Situations in Online Social Networks — A Neuro Fuzzy Approach to Alert Marketing Managers (CK, SS, FB), pp. 56–64.

SEKE-2010-WangWLX #developer

Assisting Developers to Read Code Help-Documents Efficiently through Discovering Document-section Relationships (LW, LW, GL, BX), pp. 367–373.

SIGIR-2010-YiA #approach #web

A content based approach for discovering missing anchor text for web search (XY, JA), pp. 427–434.

MoDELS-v1-2010-GoldsbyC #automation #behaviour #modelling #uml

Automatically Discovering Properties That Specify the Latent Behavior of UML Models (HG, BHCC), pp. 316–330.

SAC-2010-ChengSMZ #data mining #database #integration #mining #named #online

PROM-OOGLE: data mining and integration of on-line databases to discover gene promoters (DC, JS, MMP, ORZ), pp. 1547–1551.

SAC-2010-RibeiroS #data type #named #network #performance

g-tries: an efficient data structure for discovering network motifs (PMPR, FMAS), pp. 1559–1566.

SAC-2010-SuYT #music #novel #recommendation

A novel music recommender by discovering preferable perceptual-patterns from music pieces (JHS, HHY, VST), pp. 1924–1928.

ICSE-2010-BegelKZ #named #repository

Codebook: discovering and exploiting relationships in software repositories (AB, YPK, TZ), pp. 125–134.

VMCAI-2010-ChenMWC #abstract domain #linear

An Abstract Domain to Discover Interval Linear Equalities (LC, AM, JW, PC), pp. 112–128.

ICDAR-2009-BharathM #clustering #framework

A Framework Based on Semi-Supervised Clustering for Discovering Unique Writing Styles (AB, SM), pp. 891–895.

ICDAR-2009-WangBA #automation #documentation #using

Document Content Extraction Using Automatically Discovered Features (SYW, HSB, CA), pp. 1076–1080.

VLDB-2009-MindolinC

Discovering Relative Importance of Skyline Attributes (DM, JC), pp. 610–621.

CSMR-2009-MihanceaM #comprehension

Discovering Comprehension Pitfalls in Class Hierarchies (PFM, RM), pp. 7–16.

WCRE-1999-Perez-CastilloGCPP99a #database #named #relational #reverse engineering #web #web service

PRECISO: A Reverse Engineering Tool to Discover Web Services from Relational Databases (RPC, IGRdG, IC, MP, MP), pp. 309–310.

HIMI-II-2009-ChanLLH #mobile #requirements #user interface

Discovering User Interface Requirements of Search Results for Mobile Clients by Contextual Inquiry (DLC, RWPL, HVL, EKSH), pp. 365–374.

CAiSE-2009-TrckaAS #anti #data flow #fault #workflow

Data-Flow Anti-patterns: Discovering Data-Flow Errors in Workflows (NT, WMPvdA, NS), pp. 425–439.

CIKM-2009-AnWZH #database #scalability

Diverging patterns: discovering significant frequency change dissimilarities in large databases (AA, QW, JZ, XH), pp. 1473–1476.

CIKM-2009-SongC #dependence

Discovering matching dependencies (SS, LC), pp. 1421–1424.

ECIR-2009-KurashimaFO #case study #experience #scalability

Discovering Association Rules on Experiences from Large-Scale Blog Entries (TK, KF, HO), pp. 546–553.

ICML-2009-DeodharGGCD #clustering #framework #scalability #semistructured data

A scalable framework for discovering coherent co-clusters in noisy data (MD, GG, JG, HC, ISD), pp. 241–248.

ICML-2009-ZangZMI

Discovering options from example trajectories (PZ, PZ, DM, CLIJ), pp. 1217–1224.

KDIR-2009-GuoK #ontology #using

Discovering Relationship Associations in Life Sciences using Ontology and Inference (WG, SBK), pp. 10–17.

KDIR-2009-KiranR #approach

An Improved Frequent Pattern-growth Approach to Discover Rare Association Rules (RUK, PKR), pp. 43–52.

MLDM-2009-Hoppner #how #question

How Much True Structure Has Been Discovered? (FH), pp. 385–397.

SIGIR-2009-JinW #named #ranking

CDPRanking: discovering and ranking cross-document paths between entities (WJ, XW), p. 844.

SIGIR-2009-ZieglerJ #web

Leveraging sources of collective wisdom on the web for discovering technology synergies (CNZ, SJ), pp. 548–555.

MoDELS-2009-ChenouardJ #automation #constraints

Automatically Discovering Hidden Transformation Chaining Constraints (RC, FJ), pp. 92–106.

MoDELS-2009-ChenouardJ #automation #constraints

Automatically Discovering Hidden Transformation Chaining Constraints (RC, FJ), pp. 92–106.

SAC-2009-NecaskyM #query #xml

Discovering XML keys and foreign keys in queries (MN, IM), pp. 632–638.

ICSE-2009-KimN #representation

Discovering and representing systematic code changes (MK, DN), pp. 309–319.

ASE-2008-FluriGG

Discovering Patterns of Change Types (BF, EG, HCG), pp. 463–466.

SIGMOD-2008-FengFN #order #ranking

Discovering bucket orders from full rankings (JF, QF, WN), pp. 55–66.

SIGMOD-2008-WuRSM #database #topic

Discovering topical structures of databases (WW, BR, YS, RM), pp. 1019–1030.

VLDB-2008-ChiangM #quality

Discovering data quality rules (FC, RJM), pp. 1166–1177.

VLDB-2008-NezhadBSCA #process

Process spaceship: discovering and exploring process views from event logs in data spaces (HRMN, BB, RSP, FC, PA), pp. 1412–1415.

WCRE-2008-VaucherSV #object-oriented

Discovering New Change Patterns in Object-Oriented Systems (SV, HAS, JGV), pp. 37–41.

PLDI-2008-HalbwachsP #array #source code

Discovering properties about arrays in simple programs (NH, MP), pp. 339–348.

CHI-2008-WangPQSMS #health

Aligning temporal data by sentinel events: discovering patterns in electronic health records (TDW, CP, AJQ, RS, SNM, BS), pp. 457–466.

ICEIS-AIDSS-2008-FolinoGGP #modelling #multi #process

Discovering Multi-Perspective Process Models (FF, GG, AG, LP), pp. 70–77.

ICEIS-AIDSS-2008-GocB #sequence

Discovering Expert’s Knowledge from Sequences of Discrete Event Class Occurrences (MLG, NB), pp. 253–260.

ICEIS-DISI-2008-GroppeL #query #satisfiability #xpath

Discovering Veiled Unsatisfiable Xpath Queries (JG, VL), pp. 149–158.

ICEIS-J-2008-FolinoGGP08a #modelling #multi #process

Discovering Multi-perspective Process Models: The Case of Loosely-Structured Processes (FF, GG, AG, LP), pp. 130–143.

CIKM-2008-GoyalBL #community

Discovering leaders from community actions (AG, FB, LVSL), pp. 499–508.

KDD-2008-JensenFTM #automation #design #identification

Automatic identification of quasi-experimental designs for discovering causal knowledge (DDJ, ASF, BJT, MEM), pp. 372–380.

SEKE-2008-WuSF #clustering #mining #re-engineering

Discovering Meaningful Clusters from Mining the Software Engineering Literature (YW, HPS, LF), pp. 613–618.

SIGIR-2008-BenderskyC #concept #query

Discovering key concepts in verbose queries (MB, WBC), pp. 491–498.

RE-2008-MavinNWML #requirements #using

Using Scenarios to Discover Requirements for Engine Control Systems (AM, MN, PW, NAMM, PL), pp. 235–240.

REFSQ-2008-ZachosMH #question #requirements #specification #web #web service

Discovering Web Services to Improve Requirements Specifications: Does It Help? (KZ, NAMM, RHM), pp. 168–182.

SAC-2008-AntonyBHP #approach #biology #interactive #mining #using #validation

Computational approach to biological validation of protein-protein interactions discovered using literature mining (AA, SB, SH, MJP), pp. 1302–1306.

SAC-2008-MengleGP #category theory #classification #using

Discovering relationships among categories using misclassification information (SSRM, NG, AP), pp. 932–937.

SAC-2008-PalmaBKA #approach #clustering

A clustering-based approach for discovering interesting places in trajectories (ATP, VB, BK, LOA), pp. 863–868.

WICSA-2007-BassNWZ #architecture

Risk Themes Discovered through Architecture Evaluations (LB, RLN, WW, DZ), p. 1.

ICSM-2007-SiyCRS #developer #segmentation #version control

Discovering Dynamic Developer Relationships from Software Version Histories by Time Series Segmentation (HPS, PC, DJR, MS), pp. 415–424.

PASTE-2007-ZhangR #dependence

Discovering accurate interclass test dependences (WZ, BGR), pp. 55–62.

WCRE-2007-Marinescu #constraints #enterprise

Discovering the Objectual Meaning of Foreign Key Constraints in Enterprise Applications (CM), pp. 100–109.

SAS-2007-CalcagnoDOY #analysis

Footprint Analysis: A Shape Analysis That Discovers Preconditions (CC, DD, PWO, HY), pp. 402–418.

CHI-2007-KalnikaiteW #memory management #people #why

Software or wetware?: discovering when and why people use digital prosthetic memory (VK, SW), pp. 71–80.

CAiSE-2007-RodunerL #information management

Publishing and Discovering Information and Services for Tagged Products (CR, ML), pp. 501–515.

CAiSE-2007-ZachosMZJ #requirements #web #web service

Discovering Web Services to Specify More Complete System Requirements (KZ, NAMM, XZ, SJ), pp. 142–157.

CIKM-2007-DonZGTACSP #mining #visualisation

Discovering interesting usage patterns in text collections: integrating text mining with visualization (AD, EZ, MG, ST, LA, TC, BS, CP), pp. 213–222.

CIKM-2007-JurczykA #analysis #community #using

Discovering authorities in question answer communities by using link analysis (PJ, EA), pp. 919–922.

KDD-2007-ChopraTLCL #parametricity

Discovering the hidden structure of house prices with a non-parametric latent manifold model (SC, TT, JL, AC, YL), pp. 173–182.

MLDM-2007-Armengol

Discovering Plausible Explanations of Carcinogenecity in Chemical Compounds (EA), pp. 756–769.

MLDM-2007-WuLLY #documentation #xml

Discovering Relations Among Entities from XML Documents (YW, QL, WL, HY), pp. 899–910.

SIGIR-2007-ShahM #information management #named

DiscoverInfo: a tool for discovering information with relevance and novelty (CS, GM), p. 902.

RE-2007-ConejeroHMA #requirements #using

Discovering Volatile and Aspectual Requirements Using a Crosscutting Pattern (JMC, JH, AMDM, JA), pp. 391–392.

RE-2007-GandhiL #assessment #certification #comprehension #correlation #multi #requirements #risk management

Discovering and Understanding Multi-dimensional Correlations among Certification Requirements with application to Risk Assessment (RAG, SWL), pp. 231–240.

RE-2007-MaidenNKSG #requirements

Exploring Scenario Forms and Ways of Use to Discover Requirements on Airports that Minimize Environmental Impact (NAMM, CN, SK, NS, PG), pp. 29–38.

SAC-2007-LauwLP

TUBE (Text-cUBE) for discovering documentary evidence of associations among entities (HWL, EPL, HP), pp. 824–828.

WCRE-2006-GanesanMKY #aspect-oriented #case study #product line #source code

Discovering Organizational Aspects from the Source Code History Log during the Product Line Planning Phase — A Case Study (DG, DM, JK, KY), pp. 211–220.

CAiSE-2006-DourdasZMJZ #query #requirements

Discovering Remote Software Services that Satisfy Requirements: Patterns for Query Reformulation (ND, XZ, NAMM, SJ, KZ), pp. 239–254.

ICEIS-AIDSS-2006-HuynhGB #clustering #metric

Discovering the Stable Clusters between Interestingness Measures (HXH, FG, HB), pp. 196–201.

CIKM-2006-MichelBNTWZ #keyword

Discovering and exploiting keyword and attribute-value co-occurrences to improve P2P routing indices (SM, MB, NN, PT, GW, CZ), pp. 172–181.

ECIR-2006-NaughtonKC #clustering

Clustering Sentences for Discovering Events in News Articles (MN, NK, JC), pp. 535–538.

ICPR-v2-2006-LiuCC #analysis #image #layout

Latent Layout Analysis for Discovering Objects in Images (DL, DC, TC), pp. 468–471.

ICPR-v2-2006-QinWHG #automation #classification

Unsupervised Texture Classification: Automatically Discover and Classify Texture Patterns (LQ, WW, QH, WG), pp. 433–436.

KDD-2006-GaoGEJ #clustering

Discovering significant OPSM subspace clusters in massive gene expression data (BJG, OLG, ME, SJMJ), pp. 922–928.

KDD-2006-GionisMPU #algorithm #order

Algorithms for discovering bucket orders from data (AG, HM, KP, AU), pp. 561–566.

KDD-2006-Webb

Discovering significant rules (GIW), pp. 434–443.

KDD-2006-XinSMH #feedback #interactive

Discovering interesting patterns through user’s interactive feedback (DX, XS, QM, JH), pp. 773–778.

SAC-2006-PappalardoT #automation #design pattern

Automatically discovering design patterns and assessing concern separations for applications (GP, ET), pp. 1591–1596.

ICSE-2006-BruntinkDT #exception #fault

Discovering faults in idiom-based exception handling (MB, AvD, TT), pp. 242–251.

ICSE-2006-CsallnerS #interface #invariant

Dynamically discovering likely interface invariants (CC, YS), pp. 861–864.

ASE-2005-AgarwalSWS #concurrent #detection #runtime #using

Optimized run-time race detection and atomicity checking using partial discovered types (RA, AS, LW, SDS), pp. 233–242.

ICDAR-2005-FengHG #approach #learning #semantics #web

A Learning Approach to Discovering Web Page Semantic Structures (JF, PH, MG), pp. 1055–1059.

VLDB-2005-GibsonKT #graph #scalability

Discovering Large Dense Subgraphs in Massive Graphs (DG, RK, AT), pp. 721–732.

CSMR-2005-ArevaloDN #dependence

Discovering Unanticipated Dependency Schemas in Class Hierarchies (GA, SD, ON), pp. 62–71.

CIKM-2005-ZhangGLTW

Discovering strong skyline points in high dimensional spaces (ZZ, XG, HL, AKHT, NW), pp. 247–248.

KDD-2005-JinWPPA #dataset #graph

Discovering frequent topological structures from graph datasets (RJ, CW, DP, SP, GA), pp. 606–611.

KDD-2005-MeiZ #mining

Discovering evolutionary theme patterns from text: an exploration of temporal text mining (QM, CZ), pp. 198–207.

SAC-2005-LiY #classification #predict #recursion #using

Using recursive classification to discover predictive features (FL, YY), pp. 1054–1058.

SAC-2005-McPhersonMO #clustering #graph #parametricity #social

Discovering parametric clusters in social small-world graphs (JM, KLM, MO), pp. 1231–1238.

SAC-2005-PlakeHL #interactive #optimisation #syntax

Optimizing syntax patterns for discovering protein-protein interactions (CP, JH, UL), pp. 195–201.

ESEC-FSE-2005-SchmerlGY #architecture

Dynamically discovering architectures with DiscoTect (BRS, DG, HY), pp. 103–106.

SIGMOD-2004-LeeDDHD #database #named

iMAP: Discovering Complex Mappings between Database Schemas (RD, YL, AD, AYH, PMD), pp. 383–394.

VLDB-2004-HalaschekAAS #ranking #rdf #scalability #semantics

Discovering and Ranking Semantic Associations over a Large RDF Metabase (CHW, BAM, IBA, APS), pp. 1317–1320.

CIKM-2004-ZhaoBMK #xml

Discovering frequently changing structures from historical structural deltas of unordered XML (QZ, SSB, MKM, YK), pp. 188–197.

KDD-2004-HeCH #approach #correlation #interface #mining #query #web

Discovering complex matchings across web query interfaces: a correlation mining approach (BH, KCCC, JH), pp. 148–157.

KDD-2004-Hooker04a #black box

Discovering additive structure in black box functions (GH), pp. 575–580.

KR-2004-Lin #invariant

Discovering State Invariants (FL), pp. 536–544.

SEKE-2004-BuchnerBHP #comparison #information management

Contextual Comparison of Discovered Knowledge Patterns (AGB, MB, JGH, DWP), pp. 388–391.

SIGIR-2004-Leuski #email #people

Email is a stage: discovering people roles from email archives (AL), pp. 502–503.

SIGIR-2004-Sun #comprehension #representation

Discovering and representing the contextual and narrative structure of e-books to support reading and comprehension (abstract only) (YS), p. 603.

RE-2004-YuLM #aspect-oriented #modelling #requirements

From Goals to Aspects: Discovering Aspects from Requirements Goal Models (YY, JCSdPL, JM), pp. 38–47.

SAC-2004-Ferrer-TroyanoAS #data type

Discovering decision rules from numerical data streams (FJFT, JSAR, JCRS), pp. 649–653.

ICSE-2004-YanGSAK #architecture #named

DiscoTect: A System for Discovering Architectures from Running Systems (HY, DG, BRS, JA, RK), pp. 470–479.

ICEIS-v2-2003-CaleroDSSSM

Helping User to Discover Association Rules: A Case in Soil Color as Aggregation of Other Soil Properties (JC, GD, MSM, DS, JMS, MAVM), pp. 533–540.

KDD-2003-FramAD #data mining #empirical #mining #safety

Empirical Bayesian data mining for discovering patterns in post-marketing drug safety (DMF, JSA, WD), pp. 359–368.

KDD-2003-ShimazuMF #case study

Experimental study of discovering essential information from customer inquiry (KS, AM, KF), pp. 741–746.

MLDM-2003-Sy

Discovering Association Patterns Based on Mutual Information (BKS), pp. 369–378.

MLDM-2003-TanakaU #analysis #component #multi #principle #using

Discover Motifs in Multi-dimensional Time-Series Using the Principal Component Analysis and the MDL Principle (YT, KU), pp. 252–265.

SIGIR-2003-BartlettT #data flow

Discovering and structuring information flow among bioinformatics resources (JCB, EGT), pp. 411–412.

ECOOP-2003-HenkelD #algebra #java #specification

Discovering Algebraic Specifications from Java Classes (JH, AD), pp. 431–456.

POPL-2003-GulwaniN #random #using

Discovering affine equalities using random interpretation (SG, GCN), pp. 74–84.

SAC-2003-BragaCCKL #xml

Discovering Interesting Information in XML Data with Association Rules (DB, AC, SC, MK, PLL), pp. 450–454.

VLDB-2002-HristidisP #database #keyword #named #relational

DISCOVER: Keyword Search in Relational Databases (VH, YP), pp. 670–681.

WCRE-2002-CookD #concurrent #interactive #thread

Discovering Thread Interactions in a Concurrent System (JEC, ZD), p. 255–?.

CIKM-2002-GrahneZ #approximate #xml

Discovering approximate keys in XML data (GG, JZ), pp. 453–460.

CIKM-2002-LiuYM02a

Discovering the representative of a search engine (KLL, CTY, WM), pp. 652–654.

ICML-2002-Hengst #learning

Discovering Hierarchy in Reinforcement Learning with HEXQ (BH), pp. 243–250.

ICPR-v3-2002-LinB #detection

Discovering Operators and Features for Object Detection (YL, BB), pp. 339–342.

KDD-2002-ChenHS #algorithm

A new two-phase sampling based algorithm for discovering association rules (BC, PJH, PS), pp. 462–468.

KDD-2002-JagannathanNAH

A model for discovering customer value for E-content (SJ, JN, KCA, MH), pp. 532–537.

KDD-2002-LinH #documentation #web

Discovering informative content blocks from Web documents (SHL, JMH), pp. 588–593.

KDD-2002-PantelL #word

Discovering word senses from text (PP, DL), pp. 613–619.

KDD-2002-TuzhilinL #multi #query #set

Querying multiple sets of discovered rules (AT, BL), pp. 52–60.

SEKE-2002-LoiaSS #deduction #named #web

LearnMiner: deductive, tolerant agents for discovering didactic resources on the web (VL, SS, MIS), pp. 109–115.

SAC-2002-MataMR #algorithm

An evolutionary algorithm to discover numeric association rules (JMV, JLÁM, JCRS), pp. 590–594.

VLDB-2001-Draluk #bibliography #perspective #web #web service

Discovering Web Services: An Overview (VD), pp. 637–640.

ICSM-2001-Ernst #invariant #summary

Summary of Dynamically Discovering Likely Program Invariants (MDE), pp. 540–544.

CIKM-2001-LiuYMS

Discovering the Representative of a Search Engine (KLL, CTY, WM, AS), pp. 577–579.

CIKM-2001-YanF #algorithm #dependence #multi

Algorithm for Discovering Multivalued Dependencies (MHY, AWCF), pp. 556–558.

ICML-2001-SchwabacherL

Discovering Communicable Scientific Knowledge from Spatio-Temporal Data (MS, PL), pp. 489–496.

KDD-2001-LiuHM01a #set

Discovering the set of fundamental rule changes (BL, WH, YM), pp. 335–340.

KDD-2001-LiuMY #web

Discovering unexpected information from your competitors’ web sites (BL, YM, PSY), pp. 144–153.

KDD-2001-Webb

Discovering associations with numeric variables (GIW), pp. 383–388.

KDD-2001-YamanishiT

Discovering outlier filtering rules from unlabeled data: combining a supervised learner with an unsupervised learner (KY, JiT), pp. 389–394.

SIGIR-2001-SongB #concept #data flow #information management #using

Discovering Information Flow Using a High Dimensional Conceptual Space (DS, PB), pp. 327–333.

RE-2001-Voas

Discovering Unanticipated Software Output Modes (JMV), p. 277.

ITiCSE-2000-Chang #analysis #concept #learning #web

Discovering learning patterns from Web logs by concept transformation analysis (poster session) (CKC), pp. 186–187.

ICML-2000-SlatteryM #relational #testing

Discovering Test Set Regularities in Relational Domains (SS, TMM), pp. 895–902.

ICML-2000-TodorovskiDSWG #behaviour #difference #equation

Discovering the Structure of Partial Differential Equations from Example Behaviour (LT, SD, AS, JPW, DG), pp. 991–998.

ICML-2000-VuceticO #contest

Discovering Homogeneous Regions in Spatial Data through Competition (SV, ZO), pp. 1095–1102.

KDD-2000-Caraca-ValenteL

Discovering similar patterns in time series (JPCV, ILC), pp. 497–505.

KDD-2000-LiuHH #multi #summary

Multi-level organization and summarization of the discovered rules (BL, MH, WH), pp. 208–217.

KDD-2000-PadmanabhanT #set

Small is beautiful: discovering the minimal set of unexpected patterns (BP, AT), pp. 54–63.

KDD-2000-Senator #case study #detection #information management #scalability

Ongoing management and application of discovered knowledge in a large regulatory organization: a case study of the use and impact of NASD Regulation’s Advanced Detection System (RADS) (TES), pp. 44–53.

TOOLS-USA-2000-McDavid #framework #semantics #using

A Framework for Discovering, Organizing, and Using Business Semantics (DM), pp. 549–554.

SAC-2000-AleR #approach

An Approach to Discovering Temporal Association Rules (JMA, GR), pp. 294–300.

SAC-2000-JurisicaG #image #reasoning #using

Extending Case-Based Reasoning by Discovering and Using Image Features in IVF (IJ, JIG), pp. 52–59.

HCI-EI-1999-KinoeM #idea

Discovering Latent Relationships among Ideas: A Methodology for Facilitating New Idea Creation (YK, HM), pp. 1242–1246.

CIKM-1999-ShyuCK #database

Discovering Quasi-Equivalence Relationships from Database Systems (MLS, SCC, RLK), pp. 102–108.

ICML-1999-Zhang #approach #learning

An Region-Based Learning Approach to Discovering Temporal Structures in Data (WZ), pp. 484–492.

KDD-1999-DongL #difference #mining #performance #roadmap

Efficient Mining of Emerging Patterns: Discovering Trends and Differences (GD, JL), pp. 43–52.

KDD-1999-LiuHM

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

KDD-1999-WijsenNC #dependence

Discovering Roll-Up Dependencies (JW, RTN, TC), pp. 213–222.

SIGIR-1999-GePS #word

Discovering Chinese Words from Unsegmented Text (poster abstract) (XG, WP, PS), pp. 271–272.

ICSE-1999-ErnstCGN #evolution #invariant

Dynamically Discovering Likely Program Invariants to Support Program Evolution (MDE, JC, WGG, DN), pp. 213–224.

HPDC-1999-LowekampOG #distributed #network #query

Direct Queries for Discovering Network Resource Properties in a Distributed Environment (BL, DRO, TRG), pp. 38–46.

KDD-1998-MegiddoS #predict

Discovering Predictive Association Rules (NM, RS), pp. 274–278.

KDD-1998-PadmanabhanT

A Belief-Driven Method for Discovering Unexpected Patterns (BP, AT), pp. 94–100.

KDD-1998-SteegRW #correlation #detection #higher-order #multi #performance

Coincidence Detection: A Fast Method for Discovering Higher-Order Correlations in Multidimensional Data (EWS, DAR, EW), pp. 112–120.

KDD-1998-WeigendCFW

Discovering Technical Traders in the T-bond Futures Market (ASW, FC, SF, SRW), pp. 354–358.

SIGIR-1998-WangL #approach #documentation #roadmap

Discovering Typical Structures of Documents: A Road Map Approach (KW, HL), pp. 146–154.

HCI-SEC-1997-Marcus97b #design #user interface #web

History Lesson: The Web Discovers User Interface Design (AM), pp. 535–538.

CIKM-1997-PerryC #resource management

Discovering Similar Resources by Content Part-Linking (BP, WWC), pp. 317–324.

KDD-1997-DeCoste #behaviour #mining #multi

Mining Multivariate Time-Series Sensor Data to Discover Behavior Envelopes (DD), pp. 151–154.

KDD-1997-LentAS #database #roadmap

Discovering Trends in Text Databases (BL, RA, RS), pp. 227–230.

KDD-1997-LiuHC #classification #using

Using General Impressions to Analyze Discovered Classification Rules (BL, WH, SC), pp. 31–36.

ICSM-1996-WallaceCW #case study #distributed #framework #legacy #migration

Discovering a system modernization decision framework: a case study in migrating to distributed object technology (EW, PCC, KCW), p. 185–?.

AKDDM-1996-GuyonMV

Discovering Informative Patterns and Data Cleaning (IG, NM, VV), pp. 181–203.

ICML-1996-ThrunO #algorithm #learning #multi

Discovering Structure in Multiple Learning Tasks: The TC Algorithm (ST, JO), pp. 489–497.

KDD-1996-CheungNT #information management #maintenance #multi

Maintenance of Discovered Knowledge: A Case in Multi-Level Association Rules (DWLC, VTYN, BWT), pp. 307–310.

KDD-1996-EsterKSX #algorithm #clustering #database #scalability

A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise (ME, HPK, JS, XX), pp. 226–231.

KDD-1996-IglesiaDR #database #heuristic #using

Discovering Knowledge in Commercial Databases Using Modern Heuristic Techniques (BdlI, JCWD, VJRS), pp. 44–49.

KDD-1996-MannilaT #using

Discovering Generalized Episodes Using Minimal Occurrences (HM, HT), pp. 146–151.

KDD-1996-ShanZHC #classification #database #set #using

Discovering Classification Knowledge in Databases Using Rough Sets (NS, WZ, HJH, NC), pp. 271–274.

KDD-1996-WangW #representation #using

Representing Discovered Patterns Using Attributed Hypergraph (YW, AKCW), pp. 283–286.

POPL-1996-LiuST #incremental

Discovering Auxiliary Information for Incremental Computation (YAL, SDS, TT), pp. 157–170.

ICSM-1995-BuckleyC

Discovering relationships between service and customer satisfaction (MB, RC), p. 192–?.

ICML-1995-Schmidhuber #complexity

Discovering Solutions with Low Kolmogorov Complexity and High Generalization Capability (JS), pp. 488–496.

KDD-1995-BuntineP #how

Intelligent Instruments: Discovering How to Turn Spectral Data into Information (WLB, TP), pp. 33–38.

KDD-1995-Glymour #modelling #predict

Available Technology for Discovering Causal Models, Building Bayes Nets, and Selecting Predictors: The TETRAD II Program (CG), pp. 130–135.

KDD-1995-HsuK #information management #robust

Estimating the Robustness of Discovered Knowledge (CNH, CAK), pp. 156–161.

KDD-1995-MannilaTV #sequence

Discovering Frequent Episodes in Sequences (HM, HT, AIV), pp. 210–215.

KDD-1995-SanjeevZ #database

Discovering Enrollment Knowledge in University Databases (APS, JMZ), pp. 246–251.

SAC-1995-Bsaies #logic programming #proving

Discovering and proving logic program properties (KB), pp. 369–373.

SAC-1995-KrishnaKumarS #algorithm #fuzzy #modelling #multi #using

Discovering multiple fuzzy models using the EFMCN algorithm (KK, AS), pp. 537–541.

CIKM-1994-KlemettinenMRTV #scalability #set

Finding Interesting Rules from Large Sets of Discovered Association Rules (MK, HM, PR, HT, AIV), pp. 401–407.

KDD-1994-GuyonMV

Discovering Informative Patterns and Data Cleaning (IG, NM, VV), pp. 145–156.

KDD-1994-MannilaTV #algorithm #performance

Efficient Algorithms for Discovering Association Rules (HM, HT, AIV), pp. 181–192.

SIGIR-1994-ConradU #database #feature model

A System for Discovering Relationships by Feature Extraction from Text Databases (JGC, MHU), pp. 260–270.

CADE-1994-Bundgen #how #on the

On Pot, Pans and Pudding or How to Discover Generalised Critical Pairs (RB), pp. 693–707.

HT-1993-MarshallS #hypermedia

Searching for the Missing Link: Discovering Implicit Structure in Spatial Hypertext (CCM, FMSI), pp. 217–230.

ICML-1993-DzeroskiT

Discovering Dynamics (SD, LT), pp. 97–103.

CIKM-1992-Semmel #concept

Discovering Context in a Conceptual Schema (RDS), pp. 1–15.

ML-1992-RadiyaZ #framework #modelling

A Framework for Discovering Discrete Event Models (AR, JMZ), pp. 373–378.

TOOLS-PACIFIC-1992-Ratjens #information management #scalability

Discovering Classes and their Properties in Large-Scale Management Information Systems (MR), pp. 53–65.

KDD-1991-WuW #functional

Discovering Functional Relationships from Observational Data (YHW, SW), pp. 55–70.

ML-1991-KowalczykFG #higher-order #network

Discovering Production Rules with Higher Order Neural Networks (AK, HLF, KG), pp. 158–162.

ML-1991-Shen #knowledge base #scalability

Discovering Regularities from Large Knowledge Bases (WMS), pp. 539–543.

ECHT-1990-Bernstein #hypermedia

An Apprentice That Discovers Hypertext Links (MB), pp. 212–223.

ML-1989-MostowP #heuristic #optimisation

Discovering Admissible Search Heuristics by Abstracting and Optimizing (JM, AP), p. 240.

ML-1989-PagalloH #algorithm

Two Algorithms That Learn DNF by Discovering Relevant Features (GP, DH), pp. 119–123.

ML-1989-SimsB

Discovering Mathematical Operation Definitions (MHS, JLB), pp. 308–313.

ML-1989-VanLehn #problem #what

Discovering Problem Solving Strategies: What Humans Do and Machines Don’t (Yet) (KV), pp. 215–217.

CADE-1984-Stickel #case study #commutative #proving #theorem proving

A Case Study of Theorem Proving by the Knuth-Bendix Method: Discovering That x³=x Implies Ring Commutativity (MES), pp. 248–258.