BibSLEIGH — set stem

Used together with:

program (189)
use (150)
answer (149)
data (142)
base (133)

Stem set$ (all stems)

1504 papers:

QoSA-2015-DurisicST #architecture #identification #set #standard: Identifying Optimal Sets of Standardized Architectural Features: A Method and its Automotive Application (DD, MS, MT), pp. 103–112.
CASE-2015-David-HenrietRH #constraints #modelling: Modeling and control for (max, +)-linear systems with set-based constraints (XDH, JR, LH, BC), pp. 1369–1374.
DAC-2015-EspinosaHAAR #analysis #correlation #robust #set #verification: Analysis and RTL correlation of instruction set simulators for automotive microcontroller robustness verification (JE, CH, JA, DdA, JCR), p. 6.
DATE-2015-NguyenSCM #performance #robust #set: Efficient attacks on robust ring oscillator PUF with enhanced challenge-response set (PHN, DPS, RSC, DM), pp. 641–646.
DATE-2015-TeysseyreNOCCG #performance #set #simulation #using: Fast optical simulation from a reduced set of impulse responses using SystemC-AMS (FT, DN, IO, FC, FC, OG), pp. 405–409.
PODS-2015-GuchtWWZ #communication #complexity #distributed #matrix #multi: The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication (DVG, RW, DPW, QZ), pp. 199–212.
VLDB-2015-LiuLYXW #graph #independence #set #towards: Towards Maximum Independent Sets on Massive Graphs (YL, JL, HY, XX, ZW), pp. 2122–2133.
VLDB-2015-ZhangC0 #approach #distributed #graph #set: Bonding Vertex Sets Over Distributed Graph: A Betweenness Aware Approach (XZ, HC, LC), pp. 1418–1429.
FoSSaCS-2015-JacobsWW #set: States of Convex Sets (BJ, BW, BW), pp. 87–101.
MSR-2015-VasilescuSF #git #set #social: A Data Set for Social Diversity Studies of GitHub Teams (BV, AS, VF), pp. 514–517.
SANER-2015-MurakamiHK #named #set #visualisation: ClonePacker: A tool for clone set visualization (HM, YH, SK), pp. 474–478.
SAS-2015-BakhirkinBP #analysis #set: A Forward Analysis for Recurrent Sets (AB, JB, NP), pp. 293–311.
SAS-2015-LeeHYC #static analysis: Static Analysis with Set-Closure in Secrecy (WL, HH, KY, JHC), pp. 18–35.
STOC-2015-BansalGG #graph #independence #on the #set: On the Lovász Theta function for Independent Sets in Sparse Graphs (NB, AG, GG), pp. 193–200.
STOC-2015-GiakkoupisHHW: Test-and-Set in Optimal Space (GG, MH, LH, PW), pp. 615–623.
STOC-2015-MirrokniZ #composition #distributed #random: Randomized Composable Core-sets for Distributed Submodular Maximization (VSM, MZ), pp. 153–162.
DLT-2015-DolceP #set: Enumeration Formulæ in Neutral Sets (FD, DP), pp. 215–227.
ICALP-v1-2015-BjorklundDH #exponential #problem #random #set #strict: The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems (AB, HD, TH), pp. 231–242.
ICALP-v1-2015-GaspersS #algorithm #performance #set: Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets (SG, GBS), pp. 567–579.
ICALP-v1-2015-KariKMPS #np-hard #set #synthesis: Binary Pattern Tile Set Synthesis Is NP-hard (LK, SK, PÉM, MJP, SS), pp. 1022–1034.
ICALP-v1-2015-KarpinskiLS #set: A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set (MK, AL, DS), pp. 785–796.
ICALP-v1-2015-LokshtanovRS #algorithm #feedback #linear #set: Linear Time Parameterized Algorithms for Subset Feedback Vertex Set (DL, MSR, SS), pp. 935–946.
ICALP-v2-2015-CiobanuDE #equation #set: Solution Sets for Equations over Free Groups are EDT0L Languages (LC, VD, ME), pp. 134–145.
ICALP-v2-2015-ColcombetS #linear #order #quantifier #set: Limited Set quantifiers over Countable Linear Orderings (TC, AVS), pp. 146–158.
LATA-2015-LeonM #partial order #set: Building Bridges Between Sets of Partial Orders (HPdL, AM), pp. 145–160.
FM-2015-DiekmannHC #semantics #set: Semantics-Preserving Simplification of Real-World Firewall Rule Sets (CD, LH, GC), pp. 195–212.
ICGT-2015-RadkeABHT #constraints #graph #invariant #ocl #set: Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations (HR, TA, JSB, AH, GT), pp. 155–170.
CHI-2015-GerlingML #game studies #video: Long-Term Use of Motion-Based Video Games in Care Home Settings (KMG, RLM, CL), pp. 1573–1582.
CHI-2015-KleimanLDFC #image #named #set #similarity: DynamicMaps: Similarity-based Browsing through a Massive Set of Images (YK, JL, DD, YF, DCO), pp. 995–1004.
CHI-2015-MaiorPSW #human-computer #reliability #using: Examining the Reliability of Using fNIRS in Realistic HCI Settings for Spatial and Verbal Tasks (HAM, MP, SCS, MLW), pp. 3039–3042.
CHI-2015-ReyalZK #experience #gesture #performance #user interface: Performance and User Experience of Touchscreen and Gesture Keyboards in a Lab Setting and in the Wild (SR, SZ, POK), pp. 679–688.
CHI-2015-SauppeM #industrial #social: The Social Impact of a Robot Co-Worker in Industrial Settings (AS, BM), pp. 3613–3622.
CSCW-2015-MemarovicSSKNY #case study #community: Capture the Moment: “In the Wild” Longitudinal Case Study of Situated Snapshots Captured Through an Urban Screen in a Community Setting (NM, AFgS, HS, EK, SN, LY), pp. 242–253.
DUXU-IXD-2015-IslamI #comprehension #interface #ontology #semantics #set #web: Understanding the Semantics of Web Interface Signs: A Set of Ontological Principals (MNI, AKMNI), pp. 46–53.
HCI-DE-2015-SantosFD #case study #evaluation #heuristic #set #using #visualisation: Heuristic Evaluation in Information Visualization Using Three Sets of Heuristics: An Exploratory Study (BSS, BQF, PD), pp. 259–270.
ICEIS-v1-2015-JuniorS #approach #compilation #optimisation #reasoning #set: Finding Good Compiler Optimization Sets — A Case-based Reasoning Approach (NLQJ, AFdS), pp. 504–515.
ICEIS-v1-2015-OsbornM #scalability #set: The mqr-tree for Very Large Object Sets (WO, MM), pp. 367–373.
ICEIS-v2-2015-CruzMS #modelling #process #set: Deriving a Data Model from a Set of Interrelated Business Process Models (EFC, RJM, MYS), pp. 49–59.
ICEIS-v2-2015-CruzMS15a #modelling #process #set: Bridging the Gap between a Set of Interrelated Business Process Models and Software Models (EFC, RJM, MYS), pp. 338–345.
ICEIS-v2-2015-ThommazoCHGPBF #complexity #dependence #requirements #testing #using: Using the Dependence Level Among Requirements to Priorize the Regression Testing Set and Characterize the Complexity of Requirements Change (ADT, KC, EMH, GG, JP, AB, SF), pp. 231–241.
ICEIS-v3-2015-CanteriGSI #design #education #game studies #guidelines #set #video: Video Games in Education of Deaf Children — A Set of Pratical Design Guidelines (RdPC, LSG, TAFdS, CEAI), pp. 122–129.
ICML-2015-GarberH #performance #set: Faster Rates for the Frank-Wolfe Method over Strongly-Convex Sets (DG, EH), pp. 541–549.
ICML-2015-HuangWSLC #classification #image #learning #metric #set #symmetry: Log-Euclidean Metric Learning on Symmetric Positive Definite Manifold with Application to Image Set Classification (ZH, RW, SS, XL, XC), pp. 720–729.
ICML-2015-LimKPJ #performance #scalability #set: Double Nyström Method: An Efficient and Accurate Nyström Scheme for Large-Scale Data Sets (WL, MK, HP, KJ), pp. 1367–1375.
ICML-2015-RajkumarGL0 #probability #ranking #set: Ranking from Stochastic Pairwise Preferences: Recovering Condorcet Winners and Tournament Solution Sets at the Top (AR, SG, LHL, SA), pp. 665–673.
KDD-2015-StergiouT #set #web: Set Cover at Web Scale (SS, KT), pp. 1125–1133.
OOPSLA-2015-KurajKJ #programming #set: Programming with enumerable sets of structures (IK, VK, DJ), pp. 37–56.
POPL-2015-Castagna0XA #polymorphism #re-engineering #type inference: Polymorphic Functions with Set-Theoretic Types: Part 2: Local Type Inference and Type Reconstruction (GC, KN, ZX, PA), pp. 289–302.
POPL-2015-GuptaHRST #concurrent #representation #set: Succinct Representation of Concurrent Trace Sets (AG, TAH, AR, RS, TT), pp. 433–444.
SAC-2015-SeifertSG #personalisation #set #towards: Towards a feature-rich data set for personalized access to long-tail content (CS, JS, MG), pp. 1031–1038.
SAC-2015-SidneyMRH #performance #predict #set #similarity: Performance prediction for set similarity joins (CFS, DSM, LAR, TH), pp. 967–972.
SAC-2015-XuanLXT #empirical #fault #metric #predict #set #using: Evaluating defect prediction approaches using a massive set of metrics: an empirical study (XX, DL, XX, YT), pp. 1644–1647.
CADE-2015-Paulson #automaton #finite #formal method #set #using: A Formalisation of Finite Automata Using Hereditarily Finite Sets (LCP), pp. 231–245.
CAV-2015-BacchusK #satisfiability #set #using: Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets (FB, GK), pp. 70–86.
ICLP-2015-BrocheninM #reasoning #set: Abstract Answer Set Solvers for Cautious Reasoning (RB, MM).
ICLP-2015-DamasioMA #debugging #source code: Unifying Justifications and Debugging for Answer-Set Programs (CVD, JM, AA).
ICLP-2015-Harrison #formal method #programming #set: Formal Methods for Answer Set Programming (AH).
ICLP-2015-KieslST #analysis #on the #source code: On Structural Analysis of Non-Ground Answer-Set Programs (BK, PS, HT).
ICLP-2015-LeeWZ #automation #programming #reasoning #set #using: Automated Reasoning about XACML 3.0 Delegation Using Answer Set Programming (JL, YW, YZ).
ICLP-2015-SchullerW #case study #programming #set: Answer Set Application Programming: a Case Study on Tetris (PS, AW).
ICLP-2015-Wang #consistency #nondeterminism #probability #programming #set: Handling Probability and Inconsistency in Answer Set Programming (YW).
ICLP-J-2015-AlvianoFG #programming #recursion #set: Rewriting recursive aggregates in answer set programming: back to monotonicity (MA, WF, MG), pp. 559–573.
ICLP-J-2015-AlvianoL #compilation #complexity #programming #set: Complexity and compilation of GZ-aggregates in answer set programming (MA, NL), pp. 574–587.
ICLP-J-2015-AlvianoP #fuzzy #modulo theories #satisfiability #set: Fuzzy answer set computation via satisfiability modulo theories (MA, RP), pp. 588–603.
ICLP-J-2015-BlackmoreRE #approach #compilation #effectiveness #embedded #logic programming #predict: A logic programming approach to predict effective compiler settings for embedded software (CB, OR, KE), pp. 481–494.
ICLP-J-2015-CristiaRF #constraints #logic programming #set: Adding partial functions to Constraint Logic Programming with sets (MC, GR, CSF), pp. 651–665.
ICLP-J-2015-GagglMRWW #encoding #programming: Improved answer-set programming encodings for abstract argumentation (SAG, NM, AR, JPW, SW), pp. 434–448.
ICLP-J-2015-KoponenOJS #optimisation #programming #set #using: Optimizing phylogenetic supertrees using answer set programming (LK, EO, TJ, LS), pp. 604–619.
ICLP-J-2015-LawRB #constraints #learning #programming #set: Learning weak constraints in answer set programming (ML, AR, KB), pp. 511–525.
LICS-2015-PaulyB #set: Descriptive Set Theory in the Category of Represented Spaces (AP, MdB), pp. 438–449.
TLCA-2015-BezemCP #set: Non-Constructivity in Kan Simplicial Sets (MB, TC, EP), pp. 92–106.
VMCAI-2015-GhorbalSP #algebra #difference #proving #set: A Hierarchy of Proof Rules for Checking Differential Invariance of Algebraic Sets (KG, AS, AP), pp. 431–448.
ASE-2014-PruijtKWB #architecture #named #set: HUSACCT: architecture compliance checking with rich sets of module and rule types (LJP, CK, JMvdW, SB), pp. 851–854.
CASE-2014-KaoCC #performance #variability: Target setting with consideration of target-induced operation variability for performance improvement of semiconductor fabrication (YTK, SCC, CMC), pp. 774–779.
DAC-2014-CuiCBC #optimisation #set: A Swap-based Cache Set Index Scheme to Leverage both Superpage and Page Coloring Optimizations (ZC, LC, YB, MC), p. 6.
DATE-2014-BardizbanyanSWL #data flow #dependence #detection #energy: Reducing set-associative L1 data cache energy by early load data dependence detection (ELD3) (AB, MS, DBW, PLE), pp. 1–4.
DATE-2014-LiSH0 #in memory #memory management #named: Partial-SET: Write speedup of PCM main memory (BL, SS, YH, XL), pp. 1–4.
DATE-2014-SchollW #hardware #implementation #set: Hardware implementation of a Reed-Solomon soft decoder based on information set decoding (SS, NW), pp. 1–6.
PODS-2014-IndykMMM #composition: Composable core-sets for diversity and coverage maximization (PI, SM, MM, VSM), pp. 100–108.
PODS-2014-PaghSW #question #set: Is min-wise hashing optimal for summarizing set intersection? (RP, MS, DPW), pp. 109–120.
SIGMOD-2014-AlvanakiM #correlation #scalability #set: Tracking set correlations at large scale (FA, SM), pp. 1507–1518.
SIGMOD-2014-ArnoldHFSKL #database #set: An application-specific instruction set for accelerating set-oriented database primitives (OA, SH, GF, BS, TK, WL), pp. 767–778.
SIGMOD-2014-ChenKYYZ #robust #set: Robust set reconciliation (DC, CK, KY, WY, QZ), pp. 135–146.
VLDB-2014-ChesterTVW #set: Computing k-Regret Minimizing Sets (SC, AT, SV, SW), pp. 389–400.
VLDB-2014-Song0C #on the #set: On Concise Set of Relative Candidate Keys (SS, LC, HC), pp. 1179–1190.
VLDB-2015-InoueOT14 #branch #performance #predict #set: Faster Set Intersection with SIMD instructions by Reducing Branch Mispredictions (HI, MO, KT), pp. 293–304.
VLDB-2015-Li0QYZ014 #query #set #using: Processing Moving kNN Queries Using Influential Neighbor Sets (CL, YG, JQ, GY, RZ, WY), pp. 113–124.
MSR-2014-BaldassariP #comprehension #evolution #set: Understanding software evolution: the maisqual ant data set (BB, PP), pp. 424–427.
STOC-2014-ForbesSS #algebra #branch #multi #order #set #source code: Hitting sets for multilinear read-once algebraic branching programs, in any order (MAF, RS, AS), pp. 867–875.
STOC-2014-GhaffariHS #adaptation #fault #interactive: Optimal error rates for interactive coding I: adaptivity and other settings (MG, BH, MS), pp. 794–803.
DLT-2014-KutribMW #automaton #set: Deterministic Set Automata (MK, AM, MW), pp. 303–314.
ICALP-v1-2014-EmekR #set: Semi-Streaming Set Cover — (Extended Abstract) (YE, AR), pp. 453–464.
ICALP-v2-2014-0002HKSV #independence #online #set #worst-case: Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods (OG, MH, TK, TS, BV), pp. 508–519.
ICALP-v2-2014-BorelloCV #automaton #set: Turing Degrees of Limit Sets of Cellular Automata (AB, JC, PV), pp. 74–85.
ICALP-v2-2014-Ghaffari #approximate #distributed #set: Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set (MG), pp. 483–494.
CHI-2014-JoshiRRESKPSRSSVR #people: Supporting treatment of people living with HIV / AIDS in resource limited settings with IVRs (ANJ, MR, DR, NE, PS, NK, SP, DS, RR, DGS, KS, EV, RR), pp. 1595–1604.
CHI-2014-LeivaS #empirical #set: Representatively memorable: sampling the right phrase set to get the text entry experiment right (LAL, GST), pp. 1709–1712.
CHI-2014-ProcykNPTJ #chat #distance #mobile #streaming #using #video: Exploring video streaming in public settings: shared geocaching over distance using mobile video chat (JP, CN, CP, AT, TKJ), pp. 2163–2172.
CSCW-2014-HeinrichKAS: Enabling relationship building in tabletop-supported advisory settings (PH, MK, FRA, GS), pp. 171–183.
HCI-AIMT-2014-MiedaODTKK #multi: Expressing Observation Direction through Face and Body Rotation in a Multi-user Conversation Setting (SM, SO, MD, HT, YK, AK), pp. 273–280.
HCI-AS-2014-NakanoTA #case study #experience #html #induction #set #user interface: A Preliminary Study of Relation Induction between HTML Tag Set and User Experience (AN, AT, MA), pp. 49–56.
HCI-TMT-2014-MartinSPK #mobile #set: HCI-Patterns for Developing Mobile Apps and Digital Video-Assist-Technology for the Film Set (CM, AS, BP, AK), pp. 320–330.
HCI-TMT-2014-PenderL #identification: Identifying Intention and Perception Mismatches in Digitally Augmented Museum Settings (HLP, DL), pp. 565–576.
EDOC-2014-MukkamalaHV #analysis #sentiment #social: Fuzzy-Set Based Sentiment Analysis of Big Social Data (RRM, AH, RKV), pp. 71–80.
ICEIS-v2-2014-EstacioP #distributed #programming #set: A Set of Practices for Distributed Pair Programming (BJdSE, RP), pp. 331–338.
ICEIS-v3-2014-ObsivacBB #performance #privacy #student: Do Desperate Students Trade Their Privacy for a Hope? — An Evidence of the Privacy Settings Influence on the User Performance (TO, HB, MB), pp. 156–161.
ICML-c2-2014-ChenX #modelling #statistics: Statistical-Computational Phase Transitions in Planted Models: The High-Dimensional Setting (YC, JX), pp. 244–252.
ICPR-2014-ChakeriH #approach #clustering #framework #game studies #set: Dominant Sets as a Framework for Cluster Ensembles: An Evolutionary Game Theory Approach (AC, LOH), pp. 3457–3462.
ICPR-2014-CorringR #probability #representation #set: Shape from Phase: An Integrated Level Set and Probability Density Shape Representation (JC, AR), pp. 46–51.
ICPR-2014-DanismanBD #evaluation #gender #normalisation #recognition: Cross-Database Evaluation of Normalized Raw Pixels for Gender Recognition under Unconstrained Settings (TD, IMB, CD), pp. 3144–3149.
ICPR-2014-HouXCXQ #clustering #robust #set: Robust Clustering Based on Dominant Sets (JH, EX, LC, QX, NQ), pp. 1466–1471.
ICPR-2014-KacheleS #independence #recognition #set: Cascaded Fusion of Dynamic, Spatial, and Textural Feature Sets for Person-Independent Facial Emotion Recognition (MK, FS), pp. 4660–4665.
ICPR-2014-KumarK #adaptation #multimodal #recognition #security #set #using: Adaptive Security for Human Surveillance Using Multimodal Open Set Biometric Recognition (AK, AK), pp. 405–410.
ICPR-2014-MehriMHGMM #benchmark #documentation #evaluation #metric #performance #set: Performance Evaluation and Benchmarking of Six Texture-Based Feature Sets for Segmenting Historical Documents (MM, MM, PH, PGK, MAM, RM), pp. 2885–2890.
ICPR-2014-NegiC #identification #image #set: Identifying Diverse Set of Images in Flickr (SN, SC), pp. 3624–3629.
ICPR-2014-QuLWXT #framework #robust #set: Robust Point Set Matching under Variational Bayesian Framework (HBQ, JCL, JQW, LX, HJT), pp. 58–63.
ICPR-2014-SousaSB #case study #classification #set: Time Series Transductive Classification on Imbalanced Data Sets: An Experimental Study (CARdS, VMAdS, GEAPAB), pp. 3780–3785.
ICPR-2014-Yildiz #set: VC-Dimension of Rule Sets (OTY), pp. 3576–3581.
ICPR-2014-YuCK #distance #recognition #set #using: Pill Recognition Using Imprint Information by Two-Step Sampling Distance Sets (JY, ZC, SiK), pp. 3156–3161.
KDD-2014-AgrawalGT #education #student: Grouping students in educational settings (RA, BG, ET), pp. 1017–1026.
KDD-2014-ChenC #incremental #named #rank #set: LWI-SVD: low-rank, windowed, incremental singular value decompositions on time-evolving data sets (XC, KSC), pp. 987–996.
KDD-2014-KloumannK #community #identification #set: Community membership identification from small seed sets (IMK, JMK), pp. 1366–1375.
KDD-2014-ZhangCSWZ #network #probability #set #social: Minimizing seed set selection with probabilistic coverage guarantee in a social network (PZ, WC, XS, YW, JZ), pp. 1306–1315.
KDIR-2014-HubwieserM #education #mining #scalability #set: Competency Mining in Large Data Sets — Preparing Large Scale Investigations in Computer Science Education (PH, AM), pp. 315–322.
KDIR-2014-Sydow #set #towards #visualisation: Towards Integrity in Diversity-aware Small Set Selection and Visualisation Tasks (MS), pp. 480–484.
KR-2014-BeekSH #semantics #set #web: Rough Set Semantics for Identity on the Web (WB, SS, FvH).
KR-2014-ClercqBSCN #game studies #programming #set #using: Using Answer Set Programming for Solving Boolean Games (SDC, KB, SS, MDC, AN).
KR-2014-Dyrkolbotn #how #set #using: How to Argue for Anything: Enforcing Arbitrary Sets of Labellings using AFs (SKD).
MLDM-2014-ShahamSB #fault #performance: Efficient Error Setting for Subspace Miners (ES, DS, BBM), pp. 1–15.
SIGIR-2014-RaiberK #predict: Query-performance prediction: setting the expectations straight (FR, OK), pp. 13–22.
SIGIR-2014-YeniterziC #bias #testing: Analyzing bias in CQA-based expert finding test sets (RY, JC), pp. 967–970.
POPL-2014-Castagna0XILP #evaluation #polymorphism #semantics #syntax: Polymorphic functions with set-theoretic types: part 1: syntax, semantics, and evaluation (GC, KN, ZX, HI, SL, LP), pp. 5–18.
RE-2014-SaitoTYA #design #named #quality #requirements #set: RISDM: A requirements inspection systems design methodology: Perspective-based design of the pragmatic quality model and question set to SRS (SS, MT, SY, MA), pp. 223–232.
REFSQ-2014-LiBHT #programming #requirements: Answer-Set Programming in Requirements Engineering (WL, DB, JHH, MT), pp. 168–183.
SAC-2014-BertoutFO #automation #clustering #heuristic #realtime #set: A heuristic to minimize the cardinality of a real-time task set by automated task clustering (AB, JF, RO), pp. 1431–1436.
HPDC-2014-SuAWBS #analysis #correlation #dataset #distributed #parallel: Supporting correlation analysis on scientific datasets in parallel and distributed settings (YS, GA, JW, AB, HWS), pp. 191–202.
CAV-2014-CoxCS #abstraction #library #named #parametricity #reuse #set: QUICr: A Reusable Library for Parametric Abstraction of Sets and Numbers (AC, BYEC, SS), pp. 866–873.
ICLP-J-2014-AlvianoDR #programming #set: Anytime Computation of Cautious Consequences in Answer Set Programming (MA, CD, FR), pp. 755–770.
ICLP-J-2014-Antic #on the #set #source code: On Cascade Products of Answer Set Programs (CA), pp. 711–723.
ICLP-J-2014-HoosLS #algorithm #programming #set: claspfolio 2: Advances in Algorithm Selection for Answer Set Programming (HH, MTL, TS), pp. 569–585.
ICLP-J-2014-MarpleG #consistency #programming #set: Dynamic Consistency Checking in Goal-Directed Answer Set Programming (KM, GG), pp. 415–427.
ICST-2014-AmmannDO #set: Establishing Theoretical Minimal Sets of Mutants (PA, MED, JO), pp. 21–30.
ICTSS-2014-AbdelmoulaGA #automation #embedded #generative #named #testing: AUTSEG: Automatic Test Set Generator for Embedded Reactive Systems (MA, DG, MA), pp. 97–112.
ISSTA-2014-LoyolaSKR #automation #named #set: Dodona: automated oracle data set selection (PL, MS, IYK, GR), pp. 193–203.
LICS-CSL-2014-BonchiPPR #induction: Coinduction up-to in a fibrational setting (FB, DP, DP, JR), p. 9.
LICS-CSL-2014-BovaGS #logic #model checking #order #set: Model checking existential logic on partially ordered sets (SB, RG, SS), p. 10.
LICS-CSL-2014-Chen #first-order #query #set: The tractability frontier of graph-like first-order query sets (HC), p. 9.
RTA-TLCA-2014-CarvalhoS #decidability #polynomial #set: An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting (DdC, JGS), pp. 179–193.
SAT-2014-BalyoFHB #set: Everything You Always Wanted to Know about Blocked Sets (But Were Afraid to Ask) (TB, AF, MH, AB), pp. 317–332.
SAT-2014-IgnatievMM #independence #on the #satisfiability #set: On Reducing Maximum Independent Set to Minimum Satisfiability (AI, AM, JMS), pp. 103–120.
SMT-2014-LamC #reasoning #set: Reasoning About Set Comprehensions (ESLL, IC), pp. 27–37.
DAC-2013-KuruvillaSPVC #analysis #optimisation #set #statistics: Speeding up computation of the max/min of a set of gaussians for statistical timing analysis and optimization (VK, DS, JP, CV, NC), p. 7.
DAC-2013-WagstaffGFT #architecture #partial evaluation #set: Early partial evaluation in a JIT-compiled, retargetable instruction set simulator generated from a high-level architecture description (HW, MG, BF, NPT), p. 6.
DAC-2013-WuH #constraints #framework #multi #random #robust #set #theorem proving #verification: A robust constraint solving framework for multiple constraint sets in constrained random verification (BHW, CY(H), p. 7.
DATE-2013-AhmadyanV #analysis #reachability #reduction #set: Reachability analysis of nonlinear analog circuits through iterative reachable set reduction (SNA, SV), pp. 1436–1441.
DATE-2013-AnanthanarayananGP #detection #fault #low cost #set #using: Low cost permanent fault detection using ultra-reduced instruction set co-processors (SA, SG, HDP), pp. 933–938.
DATE-2013-Hara-AzumiFKT #process: Instruction-set extension under process variation and aging effects (YHA, FF, SK, MBT), pp. 182–187.
DATE-2013-JiangEP #embedded #optimisation #set: Optimization of secure embedded systems with dynamic task sets (KJ, PE, ZP), pp. 1765–1770.
DATE-2013-LiSRRRAHP #configuration management #named: CSER: HW/SW configurable soft-error resiliency for application specific instruction-set processors (TL, MS, SR, SR, RGR, JAA, JH, SP), pp. 707–712.
DATE-2013-Pomeranz #equivalence #fault #graph #on the #set: On candidate fault sets for fault diagnosis and dominance graphs of equivalence classes (IP), pp. 1083–1088.
DATE-2013-YuZHWLT #approach #manycore #set #simulation: A critical-section-level timing synchronization approach for deterministic multi-core instruction set simulations (FWY, BHZ, YHH, HIW, CRL, RST), pp. 643–648.
HT-2013-WolffMC #data flow #named #using: Storyscope: using theme and setting to guide story enrichment from external data sources (AW, PM, TDC), pp. 79–88.
ICDAR-2013-GotoIFU #graph #scalability #set #using: Analyzing the Distribution of a Large-Scale Character Pattern Set Using Relative Neighborhood Graph (MG, RI, YF, SU), pp. 3–7.
ICDAR-2013-SuDPL13a #independence #novel #recognition #set: A Novel Baseline-independent Feature Set for Arabic Handwriting Recognition (BS, XD, LP, CL), pp. 1250–1254.
VLDB-2013-FuWCW #distance #named #query: IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying (AWCF, HW, JC, RCWW), pp. 457–468.
FASE-2013-HaslingerLE #feature model #modelling #on the #set: On Extracting Feature Models from Sets of Valid Feature Combinations (ENH, RELH, AE), pp. 53–67.
FoSSaCS-2013-Clouston #abstraction #set: Generalised Name Abstraction for Nominal Sets (RC), pp. 434–449.
CSMR-2013-FitzgeraldCP #case study #industrial #maintenance #web: A Study of Web Maintenance in an Industrial Setting (GF, SC, JP), pp. 391–394.
PASTE-2013-DingesCA #automation #concurrent #execution #set: Automated inference of atomic sets for safe concurrent execution (PD, MC, GA), pp. 1–8.
WCRE-2013-SalesTMV #dependence #recommendation #refactoring #set #using: Recommending Move Method refactorings using dependency sets (VS, RT, LFM, MTV), pp. 232–241.
STOC-2013-AgrawalSS: Quasi-polynomial hitting-set for set-depth-Δ formulas (MA, CS, NS), pp. 321–330.
STOC-2013-Goyal #concurrent #simulation: Non-black-box simulation in the fully concurrent setting (VG), pp. 221–230.
STOC-2013-Thorup #independence #set #similarity: Bottom-k and priority sampling, set similarity and subset sums with minimal independence (MT), pp. 371–380.
DLT-2013-MarsaultS #set: Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure (VM, JS), pp. 362–373.
ICALP-v1-2013-GlasserNRSW #polynomial #reduction #set: Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions (CG, DTN, CR, ALS, MW), pp. 473–484.
ICALP-v1-2013-GolovachHKV #algorithm #incremental #polynomial #set: An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets (PAG, PH, DK, YV), pp. 485–496.
ICALP-v1-2013-SviridenkoW #problem #scalability #set: Large Neighborhood Local Search for the Maximum Set Packing Problem (MS, JW), pp. 792–803.
SEFM-2013-TranST #composition #static analysis #transaction: Compositional Static Analysis for Implicit Join Synchronization in a Transactional Setting (TMTT, MS, HT), pp. 212–228.
CHI-2013-FuchsFMBI #design #evaluation #multi: Evaluation of alternative glyph designs for time series data in a small multiple setting (JF, FF, FM, EB, PI), pp. 3237–3246.
CHI-2013-NacentaKQK #gesture #set: Memorability of pre-designed and user-defined gesture sets (MAN, YK, YQ, POK), pp. 1099–1108.
CSCW-2013-GopalakrishnanHB #distributed #network #similarity: Voluntary turnover in a distributed work setting: an examination of the role of spatial propinquity and role similarity in project affiliation networks (GMG, DSH, SPB), pp. 329–340.
CSCW-2013-KusunokiSZB #comprehension #monitoring #visual notation: Understanding visual attention of teams in dynamic medical settings through vital signs monitor use (DSK, AS, ZZ, RSB), pp. 527–540.
DHM-HB-2013-SchmuntzschYR #industrial #modelling: Combining Motion Capture and Digital Human Modeling for Creating Instructions in Industrial Settings (US, UY, MR), pp. 124–133.
DHM-HB-2013-SenanayakeG: Setting That Mouse for Tracking Tasks (RS, RSG), pp. 276–281.
DUXU-CXC-2013-MarchettiB #game studies #learning: Setting Conditions for Learning: Mediated Play and Socio-material Dialogue (EM, EPB), pp. 238–246.
DUXU-PMT-2013-FischerSN #design #set #towards #usability #validation: Towards a Holistic Tool for the Selection and Validation of Usability Method Sets Supporting Human-Centered Design (HF, BS, KN), pp. 252–261.
HCI-III-2013-WangLDHY #detection #set: A Coastline Detection Method Based on Level Set (QW, KL, FD, NH, LY), pp. 216–226.
HIMI-D-2013-MogawaSI #algorithm #product line #representation #set: Generalized Algorithm for Obtaining a Family of Evaluating Attributes’ Sets Representing Customer’s Preference (TM, FS, SI), pp. 494–504.
OCSC-2013-ShabgahiSC #bibliography #comparative #education #microblog #research: A Comparative Review of Research Literature on Microblogging Use and Risk in Organizational and Educational Settings (SLS, NAKS, AMC), pp. 174–181.
OCSC-2013-StieglitzES #behaviour #education #learning #student: Influence of Monetary and Non-monetary Incentives on Students’ Behavior in Blended Learning Settings in Higher Education (SS, AE, MS), pp. 104–112.
CIKM-2013-NguyenLT #code review #performance #set #using: Using micro-reviews to select an efficient set of reviews (TSN, HWL, PT), pp. 1067–1076.
ECIR-2013-PritsosS #automation #classification #identification: Open-Set Classification for Automated Genre Identification (DAP, ES), pp. 207–217.
ICML-c1-2013-BuhlerRSH #clustering #community #detection #set #source code: Constrained fractional set programs and their application in local clustering and community detection (TB, SSR, SS, MH), pp. 624–632.
KDD-2013-BaiJS #automation #generative #set: Exploiting user clicks for automatic seed set generation for entity matching (XB, FPJ, SHS), pp. 980–988.
KEOD-2013-NogueiraG #multi #nondeterminism #programming #set: Supply Chain Tracing of Multiple Products under Uncertainty and Incomplete Information — An Application of Answer Set Programming (MLN, NPG), pp. 399–406.
RecSys-2013-AharonABLABLRS #named #online #persistent #recommendation #set: OFF-set: one-pass factorization of feature sets for online recommendation in persistent cold start settings (MA, NA, EB, RL, RA, TB, LL, RR, OS), pp. 375–378.
RecSys-2013-SuYCY #personalisation #ranking #recommendation: Set-oriented personalized ranking for diversified top-n recommendation (RS, LY, KC, YY), pp. 415–418.
SEKE-2013-StringfellowRVM #comparison #multi #set: Comparison of SRGMs and NNEs on Multiple Data Sets (CS, SR, RVT, SM), pp. 618–623.
OOPSLA-2013-SmaragdakisBK #analysis #points-to #preprocessor: Set-based pre-processing for points-to analysis (YS, GB, GK), pp. 253–270.
RE-2013-Cleland-HuangG #named #requirements: Ready-Set-Transfer: Technology transfer in the requirements engineering domain (JCH, SG), pp. 345–346.
SAC-2013-CameronCL #memory management #mining #set: Stream mining of frequent sets with limited memory (JJC, AC, CKSL), pp. 173–175.
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-LikitvivatanavongY #set: Many-to-many interchangeable sets of values in CSPs (CL, RHCY), pp. 86–91.
ICSE-2013-VouillonC #evolution #repository #set: Broken sets in software repository evolution (JV, RDC), pp. 412–421.
PLEASE-2013-SimmondsBSQ #industrial #modelling #process #requirements #variability: Variability in software process models: Requirements for adoption in industrial settings (JS, MCB, LS, AQ), pp. 33–36.
CGO-2013-LiHCZ0L #debugging #effectiveness #fault #locality #set: Effective fault localization based on minimum debugging frontier set (FL, WH, CC, LZ, XF, ZL), p. 10.
HPCA-2013-WangDXJ #named: i2WAP: Improving non-volatile cache lifetime by reducing inter- and intra-set write variations (JW, XD, YX, NPJ), pp. 234–245.
CAV-2013-ClaessenFIPW #model checking #network #reachability #set: Model-Checking Signal Transduction Networks through Decreasing Reachability Sets (KC, JF, SI, NP, QW), pp. 85–100.
CAV-2013-Marques-SilvaJB #set: Minimal Sets over Monotone Predicates in Boolean Formulae (JMS, MJ, AB), pp. 592–607.
CAV-2013-PauleveAK #approximate #automaton #network #reachability #scalability #set: Under-Approximating Cut Sets for Reachability in Large Scale Automata Networks (LP, GA, HK), pp. 69–84.
ICLP-J-2013-AlvianoP #approximate #fuzzy #set: Fuzzy answer sets approximations (MA, RP), pp. 753–767.
ICLP-J-2013-BanbaraSTIS #modelling #programming #set: Answer set programming as a modeling language for course timetabling (MB, TS, NT, KI, TS), pp. 783–798.
ICLP-J-2013-BusoniuOPST #debugging #ide #named #programming: SeaLion: An eclipse-based IDE for answer-set programming with advanced debugging support (PAB, JO, JP, PS, HT), pp. 657–673.
ICLP-J-2013-GiordanoMSD #constraints #process #programming #set #verification: Business process verification with constraint temporal answer set programming (LG, AM, MS, DTD), pp. 641–655.
LICS-2013-Colcombet #logic #monad #set #word: Magnitude Monadic Logic over Words and the Use of Relative Internal Set Theory (TC), p. 123.
SAT-2013-MisraORS #bound #detection #set: Upper and Lower Bounds for Weak Backdoor Set Detection (NM, SO, VR, SS), pp. 394–402.
ASE-2012-RubinC #difference #set #using: Locating distinguishing features using diff sets (JR, MC), pp. 242–245.
CASE-2012-JiaZH #algorithm #fuzzy #parametricity #self: Active control of turbine tip clearance by fuzzy parameter self-setting PID algorithms (BJ, XZ, YH), pp. 162–166.
CASE-2012-SintovRMS #algorithm #set: A common 3-finger grasp search algorithm for a set of planar objects (AS, SR, RM, AS), pp. 1095–1100.
DAC-2012-JungSB #off the shelf #using: Tracking appliance usage information in residential settings using off-the-shelf low-frequency meters (DJ, AS, AB), pp. 163–168.
DAC-2012-RajendiranAPTG #reliability #set: Reliable computing with ultra-reduced instruction set co-processors (AR, SA, HDP, MVT, SG), pp. 697–702.
DATE-2012-StefanMAG #multi #performance: A TDM NoC supporting QoS, multicast, and fast connection set-up (RAS, AMM, JAA, KG), pp. 1283–1288.
WRLA-J-2010-KatelmanKM12 #semantics #set: Rewriting semantics of production rule sets (MK, SK, JM), pp. 929–956.
FoSSaCS-2012-MazzaR #abstraction #combinator #interactive #modelling #symmetry: Full Abstraction for Set-Based Models of the Symmetric Interaction Combinators (DM, NJR), pp. 316–330.
STOC-2012-AbrahamCG #approximate #distance #graph: Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels (IA, SC, CG), pp. 1199–1218.
STOC-2012-AgrawalSSS #bound: Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits (MA, CS, RS, NS), pp. 599–614.
STOC-2012-DvirL #set: Subspace evasive sets (ZD, SL), pp. 351–358.
STOC-2012-Sherstov #communication #complexity #multi #set: The multiparty communication complexity of set disjointness (AAS), pp. 525–548.
FLOPS-2012-MartinFS #eclipse #integer #set: Extending the TOY System with the ECLiPSe Solver over Sets of Integers (SEM, JCF, FSP), pp. 120–135.
DLT-J-2011-ChenYSLL12 #multi #network #set: Minimum Local Disk Cover Sets for Broadcasting in Heterogeneous Multihop Wireless Networks (GC, CWY, MTS, FCL, WCL), pp. 1147–1172.
ICALP-v1-2012-ChitnisCHM #feedback #parametricity #set: Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable (RHC, MC, MTH, DM), pp. 230–241.
ICALP-v1-2012-SahaK #set: Set Cover Revisited: Hypergraph Cover with Hard Capacities (BS, SK), pp. 762–773.
ICALP-v2-2012-BojanczykP #infinity #regular expression #set: Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets (MB, TP), pp. 104–115.
LATA-2012-Genova #normalisation #set: Forbidding Sets and Normal Forms for Language Forbidding-Enforcing Systems (DG), pp. 289–300.
LATA-2012-RowlandS #set: k-Automatic Sets of Rational Numbers (ER, JS), pp. 490–501.
LATA-2012-SaloT #automaton #finite #on the #product line #set: On Stable and Unstable Limit Sets of Finite Families of Cellular Automata (VS, IT), pp. 502–513.
CHI-2012-ComberWHLTMMMO #assessment #visual notation: Supporting visual assessment of food and nutrient intake in a clinical care setting (RC, JW, JH, SL, GT, AM, LM, PM, PO), pp. 919–922.
CHI-2012-MullerNRW #design: ICT-development in residential care settings: sensitizing design to the life circumstances of the residents of a care home (CM, CN, DR, VW), pp. 2639–2648.
CHI-2012-WallaceTWSO #design: Enabling self, intimacy and a sense of home in dementia: an enquiry into design in a hospital setting (JW, AT, GW, GS, PO), pp. 2629–2638.
CSCW-2012-HarryGS #interactive #tablet: Setting the stage for interaction: a tablet application to augment group discussion in a seminar class (DH, EG, CS), pp. 1071–1080.
CSCW-2012-ZhuKK12a #identification #modelling #online #social: Organizing without formal organization: group identification, goal setting and social modeling in directing online production (HZ, RK, AK), pp. 935–944.
ICEIS-v1-2012-HudecS #fuzzy #query #set: Construction of Fuzzy Sets and Applying Aggregation Operators for Fuzzy Queries (MH, FS), pp. 253–258.
ICEIS-v3-2012-TsudaASO #automation #classification: A Classification Method of Inquiry e-Mails for Describing FAQ with Automatic Setting Mechanism of Judgment Threshold Values (YT, MA, MS, HO), pp. 199–205.
CIKM-2012-CandanRSW #named #scalability #set #visualisation: STFMap: query- and feature-driven visualization of large time series data sets (KSC, RR, MLS, XW), pp. 2743–2745.
CIKM-2012-LeelanupabZJ #analysis #cumulative #parametricity: A comprehensive analysis of parameter settings for novelty-biased cumulative gain (TL, GZ, JMJ), pp. 1950–1954.
CIKM-2012-LuZZX #image #learning #scalability #semantics #set: Semantic context learning with large-scale weakly-labeled image set (YL, WZ, KZ, XX), pp. 1859–1863.
CIKM-2012-ShirazipourazadBVSH #contest #how: Influence propagation in adversarial setting: how to defeat competition with least amount of investment (SS, BB, HV, AS, PH), pp. 585–594.
CIKM-2012-StuparM #query: Being picky: processing top-k queries with set-defined selections (AS, SM), pp. 912–921.
CIKM-2012-ZhangWH #integer #linear #programming #set: Selecting expansion terms as a set via integer linear programming (QZ, YW, XH), pp. 2399–2402.
ICML-2012-QuadriantoCL #clique #graph #persistent #set: The Most Persistent Soft-Clique in a Set of Sampled Graphs (NQ, CC, CHL), p. 32.
ICPR-2012-AnoopMBBR #representation #set: Covariance profiles: A signature representation for object sets (AKA, AM, UDB, CB, KRR), pp. 2541–2544.
ICPR-2012-Capitaine #equivalence #probability: Set-valued Bayesian inference with probabilistic equivalence (HLC), pp. 2132–2135.
ICPR-2012-HouXCXQ #clique #set: Dominant set and target clique extraction (JH, EX, LC, QX, NQ), pp. 1831–1834.
ICPR-2012-Largeteau-SkapinZASK #set: Optimal consensus set and preimage of 4-connected circles in a noisy environment (GLS, RZ, EA, AS, YK), pp. 3774–3777.
ICPR-2012-RebagliatiSPS #distance #edit distance #graph #set #using: Computing the graph edit distance using dominant sets (NR, ASR, MP, FS), pp. 1080–1083.
KDD-2012-GionisLT #set: Estimating entity importance via counting set covers (AG, TL, ET), pp. 687–695.
KDD-2012-LappasCT #set: Selecting a characteristic set of reviews (TL, MC, ET), pp. 832–840.
KDD-2012-LiuZW #set: Finding minimum representative pattern sets (GL, HZ, LW), pp. 51–59.
KDD-2012-XueKRVT: Anonymizing set-valued data by nonreciprocal recoding (MX, PK, CR, JV, KLT), pp. 1050–1058.
KDIR-2012-MountassirBB #analysis #problem #semistructured data #sentiment #set: Addressing the Problem of Unbalanced Data Sets in Sentiment Analysis (AM, HB, IB), pp. 306–311.
KEOD-2012-NogueiraG #programming #set #using: Recall-driven Product Tracing and Supply Chain Tracking using Answer Set Programming (MLN, NPG), pp. 125–133.
KR-2012-BahmaniBKL #declarative #dependence #set #source code: Declarative Entity Resolution via Matching Dependencies and Answer Set Programs (ZB, LEB, SK, LVSL).
KR-2012-BaralD #automation #how #learning #programming #set: Solving Puzzles Described in English by Automated Translation to Answer Set Programming and Learning How to Do that Translation (CB, JD).
KR-2012-ChaudhriS #knowledge base #programming #reasoning #set #specification #using: Specifying and Reasoning with Underspecified Knowledge Bases Using Answer Set Programming (VKC, TCS).
KR-2012-FebbraroLGR #framework #java #named #programming #set: JASP: A Framework for Integrating Answer Set Programming with Java (OF, NL, GG, FR).
KR-2012-GebserGKOSS #programming #reasoning #set: Stream Reasoning with Answer Set Programming: Preliminary Report (MG, TG, RK, PO, OS, TS).
KR-2012-LiuJN #integer #programming #set: Answer Set Programming via Mixed Integer Programming (GL, TJ, IN).
KR-2012-MorettiT #ranking #set #using: Ranking Sets of Possibly Interacting Objects Using Shapley Extensions (SM, AT).
KR-2012-OetschPPST #on the #source code #testing: On the Small-Scope Hypothesis for Testing Answer-Set Programs (JO, MP, JP, MS, HT).
KR-2012-SlotaL #equivalence #modelling #robust #semantics #source code: Robust Equivalence Models for Semantic Updates of Answer-Set Programs (MS, JL).
KR-2012-ThomazoBMR #algorithm #query #set: A Generic Querying Algorithm for Greedy Sets of Existential Rules (MT, JFB, MLM, SR).
RecSys-2012-Lempel #challenge #recommendation #web: Recommendation challenges in web media settings (RL), pp. 205–206.
SEKE-2012-CunhaCAM #modelling #product line #set: A Set of Inspection Techniques on Software Product Line Models (RC, TC, ESdA, JCM), pp. 657–662.
BX-2012-Stevens #bidirectional #set: Observations relating to the equivalences induced on model sets by bidirectional transformations (PS), pp. 100–115.
ECMFA-2012-VotintsevaWRS #case study #comparative #industrial #modelling #multi: Comparative Study of Model-Based and Multi-Domain System Engineering Approaches for Industrial Settings (AV, PW, NR, PES), pp. 20–31.
LOPSTR-2012-MarpleG #named #set: Galliwasp: A Goal-Directed Answer Set Solver (KM, GG), pp. 122–136.
LOPSTR-2012-RamliNN #programming #set: XACML 3.0 in Answer Set Programming (CDPKR, HRN, FN), pp. 89–105.
PPDP-2012-MarpleBMG #execution #set #source code: Goal-directed execution of answer set programs (KM, AB, RM, GG), pp. 35–44.
SAC-2012-Kerschbaum #outsourcing #set: Collusion-resistant outsourcing of private set intersection (FK), pp. 1451–1456.
ICSE-2012-ReissBL #programming: Code Bubbles: A practical working-set programming environment (SPR, JNB, JJLJ), pp. 1411–1414.
CGO-2012-MurrayF #automation #compilation #set: Compiling for automatically generated instruction set extensions (ACM, BF), pp. 13–22.
HPCA-2012-RolanFD #adaptation: Adaptive Set-Granular Cooperative Caching (DR, BBF, RD), pp. 213–224.
HPCA-2012-SanchezK #encoding #flexibility #named #scalability #set: SCD: A scalable coherence directory with flexible sharer set encoding (DS, CK), pp. 129–140.
LCTES-2012-KyleBFLT #embedded #manycore #set #simulation #using: Efficiently parallelizing instruction set simulation of embedded multi-core processors using region-based just-in-time dynamic binary translation (SCK, IB, BF, HL, NPT), pp. 21–30.
ICLP-2012-Balduccini #set #source code: An Answer Set Solver for non-Herbrand Programs: Progress Report (MB), pp. 49–60.
ICLP-2012-BanbaraTI #generative #matrix #programming #testing: Generating Event-Sequence Test Cases by Answer Set Programming with the Incidence Matrix (MB, NT, KI), pp. 86–97.
ICLP-2012-DeneckerLTV #programming #semantics #set: A Tarskian Informal Semantics for Answer Set Programming (MD, YL, MT, JV), pp. 277–289.
ICLP-2012-Dieguez #programming #set: Temporal Answer Set Programming (MD), pp. 445–450.
ICLP-2012-DrescherW #generative #lazy evaluation #set: Answer Set Solving with Lazy Nogood Generation (CD, TW), pp. 188–200.
ICLP-2012-MorakW #preprocessor #programming #set: Preprocessing of Complex Non-Ground Rules in Answer Set Programming (MM, SW), pp. 247–258.
ICLP-2012-OetschPT #constraints #semantics #source code: An FLP-Style Answer-Set Semantics for Abstract-Constraint Programs with Disjunctions (JO, JP, HT), pp. 222–234.
ICLP-2012-Redl #programming #set: Answer Set Programming with External Sources (CR), pp. 469–475.
ICLP-2012-SchandaB #development #programming #set #using: Using Answer Set Programming in the Development of Verified Software (FS, MB), pp. 72–85.
ICLP-J-2012-BaralDGG #algorithm #correctness #programming #set #λ-calculus: Typed answer set programming λ calculus theories and correctness of inverse λ algorithms with respect to them (CB, JD, MAG, AG), pp. 775–791.
ICLP-J-2012-BliemMW #declarative #named #problem #programming #using: D-FLAT: Declarative problem solving using tree decompositions and answer-set programming (BB, MM, SW), pp. 445–464.
ICLP-J-2012-VosKOPT #source code: Annotating answer-set programs in Lana (MDV, DGK, JO, JP, HT), pp. 619–637.
ICST-2012-GhandehariLXKK #combinator #identification #testing: Identifying Failure-Inducing Combinations in a Combinatorial Test Set (LSGG, YL, TX, DRK, RK), pp. 370–379.
ICTSS-2012-TaylorHBD #behaviour #testing #using: Using Behaviour Inference to Optimise Regression Test Sets (RT, MH, KB, JD), pp. 184–199.
LICS-2012-AdamekMBL #monad #set: Coproducts of Monads on Set (JA, SM, NB, PBL), pp. 45–54.
RTA-2012-SeveriV #combinator #logic #set: Meaningless Sets in Infinitary Combinatory Logic (PS, FJdV), pp. 288–304.
SAT-2012-KullmannZ #on the #reduction #satisfiability: On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets (OK, XZ), pp. 270–283.
SMT-2012-FalkeSM #array #formal method #set: A Theory of Arrays with set and copy Operations (SF, CS, FM), pp. 98–108.
DAC-2011-LiuDPC #approximate #composition #design #set: Supervised design space exploration by compositional approximation of Pareto sets (HYL, ID, MP, LPC), pp. 399–404.
DAC-2011-WuWFT #distributed #manycore #scheduling #simulation: A high-parallelism distributed scheduling mechanism for multi-core instruction-set simulation (MHW, PCW, CYF, RST), pp. 339–344.
DATE-2011-AhmedSBH #configuration management #multi #named #runtime: mRTS: Run-time system for reconfigurable processors with multi-grained instruction-set extensions (WA, MS, LB, JH), pp. 1554–1559.
DATE-2011-DrmanacSWWA #multi #optimisation #parametricity #predict #testing: Multidimensional parametric test set optimization of wafer probe data for predicting in field failures and setting tighter test limits (DGD, NS, LW, LCW, MSA), pp. 794–799.
HT-2011-ZhangL #documentation #set: Entity set expansion in opinion documents (LZ, BL), pp. 281–290.
ICDAR-2011-BukhariSB #set #using: Text-Line Extraction Using a Convolution of Isotropic Gaussian Filter with a Set of Line Filters (SSB, FS, TMB), pp. 579–583.
SIGMOD-2011-TekleL #datalog #performance #query #set: More efficient datalog queries: subsumptive tabling beats magic sets (KTT, YAL), pp. 661–672.
VLDB-2011-ChenMFDX #difference #privacy: Publishing Set-Valued Data via Differential Privacy (RC, NM, BCMF, BCD, LX), pp. 1087–1098.
VLDB-2011-DingK #in memory #memory management #performance #set: Fast Set Intersection in Memory (BD, ACK), pp. 255–266.
CSEET-2011-Kruchten #education #experience #industrial #project management: Experience teaching software project management in both industrial and academic settings (PK), pp. 199–208.
ITiCSE-2011-UrbanoMMM #information retrieval #student: Bringing undergraduate students closer to a real-world information retrieval setting: methodology and resources (JU, MM, DM, JM), pp. 293–297.
FoSSaCS-2011-GabbayC #set #strict: Freshness and Name-Restriction in Sets of Traces with Names (MJG, VC), pp. 365–380.
CSMR-2011-VanyaPV #approximate #case study #set: Approximating Change Sets at Philips Healthcare: A Case Study (AV, RP, HvV), pp. 121–130.
SCAM-2011-Larson #program analysis #set: Program Analysis Too Loopy? Set the Loops Aside (EL), pp. 15–24.
SCAM-2011-PavluSK #alias #analysis #comparison #graph #precise #set: Computation of Alias Sets from Shape Graphs for Comparison of Shape Analysis Precision (VP, MS, AK), pp. 25–34.
WCRE-2011-HaslingerLE #feature model #modelling #reverse engineering #set #source code: Reverse Engineering Feature Models from Programs’ Feature Sets (ENH, RELH, AE), pp. 308–312.
PLDI-2011-PrabhuGZJA #commutative #parallel #programming #set: Commutative set: a language extension for implicit parallel programming (PP, SG, YZ, NPJ, DIA), pp. 1–11.
DLT-J-2009-LehtinenO11 #equation #on the #set: On Equations over Sets of Numbers and their Limitations (TL, AO), pp. 377–393.
DLT-J-2010-RigoW11 #finite #logic #set: Logical Characterization of Recognizable Sets of polynomials over a Finite Field (MR, LW), pp. 1549–1563.
DLT-2011-GusevP #on the #set: On Non-complete Sets and Restivo’s Conjecture (VVG, EVP), pp. 239–250.
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-FeigeR #independence #set: Recoverable Values for Independent Sets (UF, DR), pp. 486–497.
ICALP-v2-2011-Delacourt #automaton #set #theorem: Rice’s Theorem for μ-Limit Sets of Cellular Automata (MD), pp. 89–100.
LATA-2011-PolicritiT #finite #set: Well-Quasi-Ordering Hereditarily Finite Sets (AP, AIT), pp. 440–451.
LATA-2011-RigoV #complexity #integer #set: Syntactic Complexity of Ultimately Periodic Sets of Integers (MR, ÉV), pp. 477–488.
ICFP-2011-CastagnaX #morphism #parametricity #polymorphism #type system: Set-theoretic foundation of parametric polymorphism and subtyping (GC, ZX), pp. 94–106.
CHI-2011-PaekH #set: Sampling representative phrase sets for text entry experiments: a procedure and public resource (TP, BJPH), pp. 2477–2480.
CHI-2011-ZhuGT #modelling #multi: Exploring camera viewpoint control models for a multi-tasking setting in teleoperation (DZ, TG, KT), pp. 53–62.
DUXU-v2-2011-ErC #evaluation #internet: User Evaluation of Internet Kiosks in University Setting (EE, KÇ), pp. 394–403.
DUXU-v2-2011-NakataniOKNH #case study #internet #layout: The Layout for the User-Friendly Manual: Case Study on an Internet Set-Up Manual (MN, TO, YK, AN, SH), pp. 40–45.
HCI-DDA-2011-MoehrmannBSWH #image #scalability #set #usability: Improving the Usability of Hierarchical Representations for Interactively Labeling Large Image Data Sets (JM, SB, TS, GW, GH), pp. 618–627.
ICEIS-J-2011-PereiraBOM #consistency #process #set: A Set of Well-Formedness Rules to Checking the Consistency of the Software Processes Based on SPEM 2.0 (EBP, RMB, TCO, MCM), pp. 284–299.
ICEIS-v2-2011-FanLL #performance #set: Influencing Factors of High-speed Railway Passengers’ Travel Choice based on Rough Set (YF, JL, CL), pp. 213–217.
ICEIS-v4-2011-FengLL #evaluation #set: Comprehensive Evaluation of the Railway Passenger’s Satisfaction based on Rough Set and Entropy (YqF, XwL, XmL), pp. 629–635.
ICEIS-v4-2011-Ganesan #enterprise #framework #modelling #process #using: Composite Enterprise Process Modeling (CEProM) Framework — Setting up a Process Modeling Center of Excellence using CEProM Framework (EG), pp. 378–383.
CIKM-2011-BozzonBFT #multi #set: Diversification for multi-domain result sets (AB, MB, PF, MT), pp. 1905–1908.
CIKM-2011-MartinezL #information management: Information extraction from pathology reports in a hospital setting (DM, YL), pp. 1877–1882.
CIKM-2011-OzertemVL #set #using: Suggestion set utility maximization using session logs (UO, EV, LL), pp. 105–114.
CIKM-2011-PillutlaRBSJ #detection #distributed: LSH based outlier detection and its application in distributed setting (MRP, NR, PB, KS, CVJ), pp. 2289–2292.
CIKM-2011-StyskinRVS #ranking #set: Recency ranking by diversification of result set (AS, FR, FV, PS), pp. 1949–1952.
CIKM-2011-TranCW #constraints #evaluation #query: Evaluation of set-based queries with aggregation constraints (QTT, CYC, GW), pp. 1495–1504.
CIKM-2011-XuZYL #set: Pattern change discovery between high dimensional data sets (YX, ZZ, PSY, BL), pp. 1097–1106.
ICML-2011-PazisP #scalability #set: Generalized Value Functions for Large Action Sets (JP, RP), pp. 1185–1192.
ICML-2011-PengHMU #set: Convex Max-Product over Compact Sets for Protein Folding (JP, TH, DAM, RU), pp. 729–736.
KDD-2011-TsaparasNT #set: Selecting a comprehensive set of reviews (PT, AN, ET), pp. 168–176.
KDIR-2011-ClariziaCSGN11a #classification #novel #set: A Novel Supervised Text Classifier from a Small Training Set (FC, FC, MDS, LG, PN), pp. 545–553.
KDIR-2011-PrachuabsupakijS #classification #multi #set #using: Multi-class Data Classification for Imbalanced Data Set using Combined Sampling Approaches (WP, NS), pp. 166–171.
MLDM-2011-AttigP #biology #comparison #image #random #set: A Comparison between Haralick’s Texture Descriptor and the Texture Descriptor Based on Random Sets for Biological Images (AA, PP), pp. 524–538.
MLDM-2011-SimeonH #approach #correlation #difference #mining #named #set: GENCCS: A Correlated Group Difference Approach to Contrast Set Mining (MS, RJH), pp. 140–154.
SEKE-2011-Garcia-Castro #evaluation #maturity #named: SET-MM — A Software Evaluation Technology Maturity Model (RGC), pp. 660–665.
SIGIR-2011-KanoulasSMPA #algorithm #ranking #scalability #set: A large-scale study of the effect of training set characteristics over learning-to-rank algorithms (EK, SS, PM, VP, JAA), pp. 1243–1244.
SIGIR-2011-MinackSN #approach #incremental #scalability #set: Incremental diversification for very large sets: a streaming-based approach (EM, WS, WN), pp. 585–594.
PADL-2011-RedlEK #declarative #set #using: Declarative Belief Set Merging Using Merging Plans (CR, TE, TK), pp. 99–114.
RE-2011-Cleland-HuangD #exclamation #requirements: Ready-set-transfer! Technology transfer in the requirements engineering domain (JCH, DD), pp. 327–328.
SAC-2011-BenouaretBH #approach #composition #fuzzy: Top-k service compositions: a fuzzy set-based approach (KB, DB, AH), pp. 1033–1038.
ESEC-FSE-2011-TamrawiNAN #approach #debugging #fuzzy #set: Fuzzy set and cache-based approach for bug triaging (AT, TTN, JMAK, TNN), pp. 365–375.
ICSE-2011-TamrawiNAN #automation #debugging #fuzzy: Fuzzy set-based automatic bug triaging (AT, TTN, JMAK, TNN), pp. 884–887.
CC-2011-NaeemL #alias #analysis #performance #set #summary #using: Faster Alias Set Analysis Using Summaries (NAN, OL), pp. 82–103.
HPCA-2011-BrownPT #concurrent #migration #performance #predict #set #thread: Fast thread migration via cache working set prediction (JAB, LP, DMT), pp. 193–204.
CADE-2011-Horbach #horn clause #set: Predicate Completion for non-Horn Clause Sets (MH), pp. 315–330.
CSL-2011-AdamekMMS: Power-Set Functors and Saturated Trees (JA, SM, LSM, LS), pp. 5–19.
CSL-2011-CantoneLA #decidability #logic #order #quantifier #set: A Decidable Quantified Fragment of Set Theory Involving Ordered Pairs with Applications to Description Logics (DC, CL, MNA), pp. 129–143.
ICLP-2011-Brik #programming #set: Extensions of Answer Set Programming (AB), pp. 261–267.
ICLP-2011-CasolaryL #programming #representation #set: Representing the Language of the Causal Calculator in Answer Set Programming (MC, JL), pp. 51–61.
ICLP-2011-DrescherW #constraints #modelling #programming #set: Modelling Grammar Constraints with Answer Set Programming (CD, TW), pp. 28–39.
ICLP-2011-GebserKKS #multi #optimisation #programming #set: Multi-Criteria Optimization in Answer Set Programming (MG, RK, BK, TS), pp. 1–10.
ICLP-J-2011-GebserKS #optimisation #programming #set: Complex optimization in answer set programming (MG, RK, TS), pp. 821–839.
VMCAI-2011-SuterSK #constraints #modulo theories #satisfiability #set: Sets with Cardinality Constraints in Satisfiability Modulo Theories (PS, RS, VK), pp. 403–418.
ASE-2010-IvanovOSV #analysis #behaviour #embedded #modelling #set #tool support: REMES tool-chain: a set of integrated tools for behavioral modeling and analysis of embedded systems (DI, MO, CCS, AV), pp. 361–362.
ASE-2010-LiangWWWXM #automation #effectiveness #set #static analysis: Automatic construction of an effective training set for prioritizing static analysis warnings (GL, LW, QW, QW, TX, HM), pp. 93–102.
DATE-2010-KoenigBSSABH #architecture #configuration management #multi #named #novel: KAHRISMA: A novel Hypermorphic Reconfigurable-Instruction-Set Multi-grained-Array architecture (RK, LB, TS, MS, WA, JB, JH), pp. 819–824.
SIGMOD-2010-AgrawalAK #on the #set: On indexing error-tolerant set containment (PA, AA, RK), pp. 927–938.
SIGMOD-2010-VernicaCL #parallel #performance #pipes and filters #using: Efficient parallel set-similarity joins using MapReduce (RV, MJC, CL), pp. 495–506.
VLDB-2010-LianC #probability #set #similarity: Set Similarity Join on Probabilistic Data (XL, LC), pp. 650–659.
VLDB-2010-MahPC #algorithm #functional #named #realtime #set: UASMAs: a set of algorithms to instantaneously map SNPs in real time to aid functional SNP discovery (JM, DP, SC), pp. 1406–1413.
CSMR-2010-NadiHM #predict #set #using: Does the Past Say It All? Using History to Predict Change Sets in a CMDB (SN, RCH, SM), pp. 97–106.
ICSM-2010-Al-KofahiTNNN #approach #automation #evolution #fuzzy #set: Fuzzy set approach for automatic tagging in evolving software (JMAK, AT, TTN, HAN, TNN), pp. 1–10.
ICSM-2010-SaleckerG #graph #testing #using: Pairwise test set calculation using k-partite graphs (ES, SG), pp. 1–5.
STOC-2010-Talagrand #question #set: Are many small sets explicitly small? (MT), pp. 13–36.
STOC-2010-Varadarajan #geometry #set: Weighted geometric set cover via quasi-uniform sampling (KRV), pp. 641–648.
DLT-2010-ChambartS #problem #set: Computing Blocker Sets for the Regular Post Embedding Problem (PC, PS), pp. 136–147.
ICALP-v1-2010-HalldorssonHLS #algorithm #independence #set #streaming: Streaming Algorithms for Independent Sets (BVH, MMH, EL, MS), pp. 641–652.
ICALP-v2-2010-MertziosSSZ #multi #network #set: Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests (GBM, IS, MS, SZ), pp. 333–344.
CHI-2010-BragdonZRKCKCAL #comprehension #interface #maintenance: Code bubbles: a working set-based interface for code understanding and maintenance (AB, RCZ, SPR, SK, WC, JK, CC, FA, JJLJ), pp. 2503–2512.
ICEIS-SAIC-2010-GoyalK #approach #automation #fuzzy #multi #set #using: Using Fuzzy Set Approach in Multi-attribute Automated Auctions (MLG, SK), pp. 81–85.
CIKM-2010-CormodeKW #algorithm #dataset #scalability #set: Set cover algorithms for very large datasets (GC, HJK, AW), pp. 479–488.
CIKM-2010-SongC #database #performance: Efficient set-correlation operator inside databases (SS, LC), pp. 139–148.
CIKM-2010-ZhaoAY #composition #nondeterminism #on the #set: On wavelet decomposition of uncertain time series data sets (YZ, CCA, PSY), pp. 129–138.
CIKM-2010-ZhouLBXL #information management #mining #reasoning #set: Rough sets based reasoning and pattern mining for a two-stage information filtering system (XZ, YL, PB, YX, RYKL), pp. 1429–1432.
ICML-2010-GuilloryB #interactive #set: Interactive Submodular Set Cover (AG, JAB), pp. 415–422.
ICML-2010-SrinivasKKS #design #optimisation #process: Gaussian Process Optimization in the Bandit Setting: No Regret and Experimental Design (NS, AK, SK, MWS), pp. 1015–1022.
ICPR-2010-Al-HuseinyMN #approach #set: Gait Learning-Based Regenerative Model: A Level Set Approach (MSAH, SM, MSN), pp. 2644–2647.
ICPR-2010-AvenelMP #probability #set: Stochastic Filtering of Level Sets for Curve Tracking (CA, ÉM, PP), pp. 3553–3556.
ICPR-2010-BanimahdE #distance #image #segmentation #set #using: Lip Segmentation Using Level Set Method: Fusing Landmark Edge Distance and Image Information (SRB, HE), pp. 2432–2435.
ICPR-2010-BerrettiBPAD #3d #recognition #set: A Set of Selected SIFT Features for 3D Facial Expression Recognition (SB, ADB, PP, BBA, MD), pp. 4125–4128.
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-ChoPPKKALL #hybrid #segmentation #using: Level-Set Segmentation of Brain Tumors Using a New Hybrid Speed Function (WC, JP, SYP, SHK, SWK, GA, MEL, GL), pp. 1545–1548.
ICPR-2010-ChuHC #classification #gender #identification #image #set: Identifying Gender from Unaligned Facial Images by Set Classification (WSC, CRH, CSC), pp. 2636–2639.
ICPR-2010-HanFD #learning #prototype #recognition #set: Discriminative Prototype Learning in Open Set Face Recognition (ZH, CF, XD), pp. 2696–2699.
ICPR-2010-HongCCG #detection #set: Boosted Sigma Set for Pedestrian Detection (XH, HC, XC, WG), pp. 3017–3020.
ICPR-2010-IbbaDL #case study #set: A Study on Combining Sets of Differently Measured Dissimilarities (AI, RPWD, WJL), pp. 3360–3363.
ICPR-2010-ImpedovoP #classification #evaluation #generative #multi #set: Generating Sets of Classifiers for the Evaluation of Multi-expert Systems (DI, GP), pp. 2166–2169.
ICPR-2010-KhalifaEGOE #image #segmentation: Shape-Appearance Guided Level-Set Deformable Model for Image Segmentation (FK, AEB, GLG, RO, MAEG), pp. 4581–4584.
ICPR-2010-KinnunenKLLK #categorisation #random #set #visual notation: Making Visual Object Categorization More Challenging: Randomized Caltech-101 Data Set (TK, JKK, LL, JL, HK), pp. 476–479.
ICPR-2010-KurugolODSB #3d #segmentation #set: Locally Deformable Shape Model to Improve 3D Level Set Based Esophagus Segmentation (SK, NO, JGD, GCS, DHB), pp. 3955–3958.
ICPR-2010-LiZGHLZ #set: Discriminative Level Set for Contour Tracking (WL, XZ, JG, WH, HL, XZ), pp. 1735–1738.
ICPR-2010-OliverTLM #automation #segmentation #set #using: Automatic Diagnosis of Masses by Using Level set Segmentation and Shape Description (AO, AT, XL, JM), pp. 2528–2531.
ICPR-2010-PinedaKW #clustering #correlation #set #visual notation #word: Object Discovery by Clustering Correlated Visual Word Sets (GFP, HK, TW), pp. 750–753.
ICPR-2010-SchryverR #categorisation #set: The Rex Leopold II Model: Application of the Reduced Set Density Estimator to Human Categorization (MDS, BR), pp. 4356–4359.
ICPR-2010-SeverskyY #3d #detection #scalability #set: Scalable Cage-Driven Feature Detection and Shape Correspondence for 3D Point Sets (LMS, LY), pp. 3557–3560.
ICPR-2010-TorkiEL #learning #multi #representation #set: Learning a Joint Manifold Representation from Multiple Data Sets (MT, AME, CSL), pp. 1068–1071.
ICPR-2010-TumaIP #classification #kernel #set #using: Hydroacoustic Signal Classification Using Kernel Functions for Variable Feature Sets (MT, CI, MP), pp. 1011–1014.
ICPR-2010-Xie #segmentation #set #using: Level Set Based Segmentation Using Local Feature Distribution (XX), pp. 2780–2783.
KDIR-2010-ThanhYU #clustering #documentation #scalability #set #similarity: Clustering Documents with Large Overlap of Terms into Different Clusters based on Similarity Rough Set Model (NCT, KY, MU), pp. 396–399.
KDIR-2010-ViswanathBK #classification #nearest neighbour #performance #set: A Method to Generate a Reduced Training Set for Faster and Better Nearest Neighbor Classification (PV, VSB, TNK), pp. 232–236.
KEOD-2010-ZakraouiZ #interactive #programming #set #using #web: Integrating Context Knowledge in user Interaction using Answer Set Programming for Enhancing Web Accessibility (JZ, WLZ), pp. 459–466.
KMIS-2010-BachlechnerKMW #information management: Taking Pressure off Knowledge Workers with the Help of Situational Applications — Improving Time-to-proficiency in Knowledge Work Settings (DB, MK, RM, GW), pp. 378–381.
KR-2010-BalducciniG #formal method #programming #set: Formalizing Psychological Knowledge in Answer Set Programming (MB, SG).
KR-2010-CreignouST #abduction #complexity #set #strict: Complexity of Propositional Abduction for Restricted Sets of Boolean Functions (NC, JS, MT).
KR-2010-DelgrandeW #horn clause #set: Horn Clause Contraction Functions: Belief Set and Belief Base Approaches (JPD, RW).
KR-2010-EiterFM #programming #set: Paracoherent Answer Set Programming (TE, MF, JM).
KR-2010-GebserGISSTV #biology #consistency #network #nondeterminism #predict #programming #scalability #set: Repair and Prediction (under Inconsistency) in Large Biological Networks with Answer Set Programming (MG, CG, MI, TS, AS, ST, PV).
KR-2010-PichlerRSW #bound #constraints #programming: Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough (RP, SR, SS, SW).
KR-2010-Shapiro #logic #semantics #syntax: Set-Oriented Logical Connectives: Syntax and Semantics (SCS).
KR-2010-ZhangZ #bound #on the #semantics #set #source code: On the Progression Semantics and Boundedness of Answer Set Programs (YZ, YZ).
RecSys-2010-Balakrishnan #on-demand #recommendation: On-demand set-based recommendations (SB), pp. 313–316.
RecSys-2010-ImK #personalisation #recommendation: Personalizing the settings for Cf-based recommender systems (II, BHK), pp. 245–248.
SEKE-2010-PinheiroGMS #automation #industrial #testing: Introducing Automated Environment Configuration Testing in an Industrial Setting (CP, VG, FM, JS), pp. 186–191.
SIGIR-2010-RadlinskiSC #metric #set #topic: Metrics for assessing sets of subtopics (FR, MS, NC), pp. 853–854.
LOPSTR-2010-HerasPR #correctness #proving #set: Proving with ACL2 the Correctness of Simplicial Sets in the Kenzo System (JH, VP, JR), pp. 37–51.
PADL-2010-LeoneRRT #integration #performance #programming #set: Efficient Application of Answer Set Programming for Advanced Data Integration (NL, FR, LAR, GT), pp. 10–24.
PADL-2010-Pontelli #perspective #programming #set: Answer Set Programming in 2010: A Personal Perspective (EP), pp. 1–3.
SAC-2010-BautistaSHPD #clustering #power management #requirements #set: Dynamic task set partitioning based on balancing resource requirements and utilization to reduce power consumption (DB, JS, HH, SP, JD), pp. 521–526.
SAC-2010-BucchiaroneGFT #experience #natural language #requirements #scalability #set #using: An experience in using a tool for evaluating a large set of natural language requirements (AB, SG, AF, GT), pp. 281–286.
SAC-2010-ComuzziS #monitoring: Dynamic set-up of monitoring infrastructures for service based systems (MC, GS), pp. 2414–2421.
SAC-2010-GoethalsPM #database #mining #relational #set: Mining interesting sets and rules in relational databases (BG, WLP, MM), pp. 997–1001.
SAC-2010-Kaneiwa #approach #information management #mining #set: A rough set approach to mining connections from information systems (KK), pp. 990–996.
SAC-2010-MarascuML #approximate #performance #set #streaming: A fast approximation strategy for summarizing a set of streaming time series (AM, FM, YL), pp. 1617–1621.
SAC-2010-RiosBKO #documentation #evaluation #set #word: Evaluation of different feature sets in an OCR free method for word spotting in printed documents (IR, AdSBJ, ALK, LSO), pp. 52–56.
ICSE-2010-LaiCC #detection #parallel #random #source code #testing #thread: Detecting atomic-set serializability violations in multithreaded programs through active randomized testing (ZL, SCC, WKC), pp. 235–244.
HPDC-2010-KettimuthuSGABBCCDFHHLLLMNPRRWWW #grid #lessons learnt #network #set: Lessons learned from moving earth system grid data sets over a 20 Gbps wide-area network (RK, AS, DG, BA, PTB, JB, AC, LC, ED, ITF, KH, JH, JL, ML, JL, KM, VN, VP, KR, DR, DNW, LW, LW), pp. 316–319.
LCTES-2010-AltmeyerMR #analysis #bound: Resilience analysis: tightening the CRPD bound for set-associative caches (SA, CM, JR), pp. 153–162.
CSL-2010-KuncakPS #calculus #data type #order #set: Ordered Sets in the Calculus of Data Structures (VK, RP, PS), pp. 34–48.
ICLP-2010-Alviano10 #datalog #set #source code: Dynamic Magic Sets for Disjunctive Datalog Programs (MA), pp. 226–235.
ICLP-2010-Balduccini10 #heuristic #learning #set: Learning Domain-Specific Heuristics for Answer Set Solvers (MB), pp. 14–23.
ICLP-2010-BautersJSVC10 #communication #set #source code: Communicating Answer Set Programs (KB, JJ, SS, DV, MDC), pp. 34–43.
ICLP-2010-Drescher10 #constraints #programming #set: Constraint Answer Set Programming Systems (CD), pp. 255–264.
ICLP-2010-FayruzovJVCC10 #performance #set #source code: Efficient Solving of Time-dependent Answer Set Programs (TF, JJ, DV, CC, MDC), pp. 64–73.
ICLP-2010-Gaggl10 #programming #towards: Towards a General Argumentation System based on Answer-Set Programming (SAG), pp. 265–269.
ICLP-2010-MantadelisJ10 #probability: Dedicated Tabling for a Probabilistic Setting (TM, GJ), pp. 124–133.
ICLP-2010-OetschPT10 #source code: Methods and Methodologies for Developing Answer-Set Programs — Project Description (JO, JP, HT), pp. 154–161.
ICLP-J-2010-BalducciniG #formal method #programming #set: Formalization of psychological knowledge in answer set programming and its application (MB, SG), pp. 725–740.
ICLP-J-2010-BrummayerJ #debugging #development #testing: Testing and debugging techniques for answer set solver development (RB, MJ), pp. 741–758.
ICLP-J-2010-Delgrande #approach #logic programming #semantics #set #source code: A program-level approach to revising logic programs under the answer set semantics (JPD), pp. 565–580.
ICLP-J-2010-DrescherW #approach #constraints #set: A translational approach to constraint answer set solving (CD, TW), pp. 465–480.
ICLP-J-2010-OetschPST #detection #source code: The system Kato: Detecting cases of plagiarism for answer-set programs (JO, JP, MS, HT), pp. 759–775.
ICLP-J-2010-OetschPT #debugging #source code: Catching the Ouroboros: On debugging non-ground answer-set programs (JO, JP, HT), pp. 513–529.
IJCAR-2010-PiskacK #automation #multi #named #set: MUNCH — Automated Reasoner for Sets and Multisets (RP, VK), pp. 149–155.
VMCAI-2010-MarronMSK #analysis #set: Shape Analysis with Reference Set Relations (MM, RM, DS, DK), pp. 247–262.
WICSA-ECSA-2009-NordCEH #architecture #documentation #set #using: Reviewing architecture documents using question sets (RLN, PCC, DEE, RH), pp. 325–328.
CASE-2009-FagioliniMB #distributed: Set-valued consensus for distributed clock synchronization (AF, SM, AB), pp. 116–121.
DAC-2009-KluterBIC #automation #set: Way Stealing: cache-assisted automatic instruction set extensions (TK, PB, PI, EC), pp. 31–36.
DATE-2009-ChuHCK #reliability: A set-based mapping strategy for flash-memory reliability enhancement (YSC, JWH, YHC, TWK), pp. 405–410.
DATE-2009-GaluzziTMB #algorithm #automation: Algorithms for the automatic extension of an instruction-set (CG, DT, RM, KB), pp. 548–553.
DATE-2009-GuanLF #design #scalability #set: Design of an application-specific instruction set processor for high-throughput and scalable FFT (XG, HL, YF), pp. 1302–1307.
DATE-2009-KavousianosC #fault #generative #testing: Generation of compact test sets with high defect coverage (XK, KC), pp. 1130–1135.
DATE-2009-LiFNBPC #architecture #co-evolution #design #detection #ml #parallel #set: Algorithm-architecture co-design of soft-output ML MIMO detector for parallel application specific instruction set processors (ML, RF, DN, BB, LVdP, FC), pp. 1608–1613.
DATE-2009-RemersaroRRP #generative #scalability #testing: A scalable method for the generation of small test sets (SR, JR, SMR, IP), pp. 1136–1141.
DATE-2009-StratigopoulosMM #set: Enrichment of limited training sets in machine-learning-based analog/RF test (HGDS, SM, YM), pp. 1668–1673.
ICDAR-2009-HaboubiMEA #invariant #set: Invariant Primitives for Handwritten Arabic Script: A Contrastive Study of Four Feature Sets (SH, SM, NE, HEA), pp. 691–697.
ICDAR-2009-MoghaddamRC #approach #classification #independence #multi #segmentation #set #using: Restoration and Segmentation of Highly Degraded Characters Using a Shape-Independent Level Set Approach and Multi-level Classifiers (RFM, DRH, MC), pp. 828–832.
ICDAR-2009-MoghaddamRYC #approach #documentation #framework #image #segmentation #set: A Unified Framework Based on the Level Set Approach for Segmentation of Unconstrained Double-Sided Document Images Suffering from Bleed-Through (RFM, DRH, IBY, MC), pp. 441–445.
ICDAR-2009-SiddiqiV #recognition #set: A Set of Chain Code Based Features for Writer Recognition (IS, NV), pp. 981–985.
VLDB-2009-CautisDOV #performance #query #set #specification #using #xpath: Efficient Rewriting of XPath Queries Using Query Set Specifications (BC, AD, NO, VV), pp. 301–312.
VLDB-2009-CohenDKLT #composition #scalability #set #summary: Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets (EC, NGD, HK, CL, MT), pp. 431–442.
VLDB-2009-HeN #top-down: Anonymization of Set-Valued Data via Top-Down, Local Generalization (YH, JFN), pp. 934–945.
VLDB-2009-LeeNS #estimation #set #similarity: Power-Law Based Estimation of Set Similarity Join Size (HL, RTN, KS), pp. 658–669.
TACAS-2009-Thierry-MiegPHK #diagrams #modelling #set: Hierarchical Set Decision Diagrams and Regular Models (YTM, DP, AH, FK), pp. 1–15.
STOC-2009-AndersenP #evolution #set #using: Finding sparse cuts locally using evolving sets (RA, YP), pp. 235–244.
CIAA-2009-InabaH #query #representation #set: Compact Representation for Answer Sets of n-ary Regular Queries (KI, HH), pp. 94–104.
DLT-2009-BlakeleyBGR #complexity #on the #set #word: On the Complexity of Deciding Avoidability of Sets of Partial Words (BB, FBS, JG, NR), pp. 113–124.
DLT-2009-LehtinenO #equation #on the #set: On Equations over Sets of Numbers and Their Limitations (TL, AO), pp. 360–371.
ICALP-v1-2009-AgnarssonHL #algorithm #independence #problem #set: SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs (GA, MMH, EL), pp. 12–23.
LATA-2009-BoigelotD #automaton #finite #set #visualisation: Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization (BB, JFD), pp. 200–211.
CHI-2009-TangC #communication #mobile #question: A mobile voice communication system in medical setting: love it or hate it? (CT, MSTC), pp. 2041–2050.
HCD-2009-JonesND #information retrieval #set: Use of Nursing Management Minimum Data Set (NMMDS) for a Focused Information Retrieval (JFJ, ETN, CD), pp. 972–978.
HCI-AUII-2009-GronliG #interactive #process #social: Human Computer Interaction with a PIM Application: Merging Activity, Location and Social Setting into Context (TMG, GG), pp. 30–38.
HCI-AUII-2009-WeissKWMF #comparison: Comparison of Different Talking Heads in Non-Interactive Settings (BW, CK, IW, SM, SF), pp. 349–357.
HCI-NIMT-2009-DuarteSC #collaboration #interactive #multimodal: Exploring Multimodal Interaction in Collaborative Settings (LD, MdS, LC), pp. 19–28.
HCI-VAD-2009-NielloFGFBV #set: A Set of Rules and Strategies for UNSAM Virtual Campus (JFN, FVCF, MG, RFZ, SB, MV), pp. 101–110.
ICEIS-HCI-2009-AuerPB #development #user interface #visual notation: End-user Development in a Graphical user Interface Setting (MA, JP, SB), pp. 5–14.
CIKM-2009-IslamI #set #using #web: Real-word spelling correction using Google web 1Tn-gram data set (AI, DI), pp. 1689–1692.
CIKM-2009-VyasPC #editing #set: Helping editors choose better seed sets for entity set expansion (VV, PP, EC), pp. 225–234.
KDD-2009-JinXL #representation #set: Cartesian contour: a concise representation for a collection of frequent sets (RJ, YX, LL), pp. 417–426.
KDIR-2009-CallejaFGA #learning #set: A Learning Method for Imbalanced Data Sets (JdlC, OF, JG, RMAP), pp. 307–310.
KDIR-2009-GabadinhoRSM #category theory #sequence #set #visualisation: Summarizing Sets of Categorical Sequences — Selecting and Visualizing Representative Sequences (AG, GR, MS, NSM), pp. 62–69.
MLDM-2009-SarmentoKOU #clustering #performance #set: Efficient Clustering of Web-Derived Data Sets (LS, AK, ECO, LHU), pp. 398–412.
RecSys-2009-Nnadi #clustering #correlation #multi #recommendation #set: Applying relevant set correlation clustering to multi-criteria recommender systems (NN), pp. 401–404.
RecSys-2009-ViappianiB #recommendation #set: Regret-based optimal recommendation sets in conversational recommender systems (PV, CB), pp. 101–108.
SEKE-2009-MukhopadhyayPRPM #benchmark #comparison #information management #metric #multi #set: Comparison of Some Single-agent and Multi-agent Information Filtering Systems on a Benchmark Text Data Set (SM, SP, RRR, MJP, JM), pp. 185–188.
SIGIR-2009-Voorhees #set #topic: Topic set size redux (EMV), pp. 806–807.
PPDP-2009-AntoyH #functional #logic programming #set: Set functions for functional logic programming (SA, MH), pp. 73–82.
RE-2009-WnukRK #comprehension #industrial #scalability #visualisation #what: What Happened to Our Features? Visualization and Understanding of Scope Change Dynamics in a Large-Scale Industrial Setting (KW, BR, LK), pp. 89–98.
SAC-2009-AraujoSSF #classification #named #sequence #type system: HIVSetSubtype: software for subtype classification of HIV-1 sequences (LVdA, SSS, ECS, JEF), pp. 811–815.
SAC-2009-JangYC #algorithm #clustering #multi #set: A smart clustering algorithm for photo set obtained from multiple digital cameras (CJJ, TY, HGC), pp. 1784–1791.
SAC-2009-LiuYWJX #adaptation #memory management #scalability: An adaptive block-set based management for large-scale flash memory (ZL, LY, PW, PJ, XX), pp. 1621–1625.
SAC-2009-Manine #information management #learning #multi #ontology: Learning the ontological theory of an information extraction system in the multi-predicate ILP setting (APM), pp. 1578–1582.
SAC-2009-PinhoOL #incremental #set #visualisation: Incremental board: a grid-based space for visualizing dynamic data sets (RP, MCFdO, AdAL), pp. 1757–1764.
SAC-2009-RodriguesSC #composition #embedded #functional #set #using #verification: Improving functional verification of embedded systems using hierarchical composition and set theory (CLR, KRGdS, HdNC), pp. 1632–1636.
ISMM-2009-NaeemL #alias #analysis #performance #set #using: Efficient alias set analysis using SSA form (NAN, OL), pp. 79–88.
PPoPP-2009-AllenSS #dependence #execution #parallel #set: Serialization sets: a dynamic dependence-based parallel execution model (MDA, SS, GSS), pp. 85–96.
CADE-2009-GregoireMP #question #set: Does This Set of Clauses Overlap with at Least One MUS? (ÉG, BM, CP), pp. 100–115.
CAV-2009-LammichMW #automaton #constraints #network #set: Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints (PL, MMO, AW), pp. 525–539.
ICLP-2009-DelgrandeSTW #logic programming #semantics #set #source code: Merging Logic Programs under Answer Set Semantics (JPD, TS, HT, SW), pp. 160–174.
ICLP-2009-EiterEEF #programming #set: Finding Similar or Diverse Solutions in Answer Set Programming (TE, EE, HE, MF), pp. 342–356.
ICLP-2009-GebserOS #constraints #set: Constraint Answer Set Solving (MG, MO, TS), pp. 235–249.
ICLP-2009-Ji #approach #architecture #programming #research #set #summary: A Cognitive Architecture for a Service Robot: An Answer Set Programming Approach (Research Summary) (JJ), pp. 532–533.
ICLP-2009-PaluDPR #constraints #lazy evaluation #programming #set #using: Answer Set Programming with Constraints Using Lazy Grounding (ADP, AD, EP, GR), pp. 115–129.
ICLP-2009-SchaubT #network #programming #set: Metabolic Network Expansion with Answer Set Programming (TS, ST), pp. 312–326.
ICLP-2009-Thielscher #game studies #programming #set: Answer Set Programming for Single-Player Games in General Game Playing (MT), pp. 327–341.
ICST-2009-KaminskiA #detection #fault #logic #testing #using: Using Logic Criterion Feasibility to Reduce Test Set Size While Guaranteeing Fault Detection (GKK, PA), pp. 356–365.
WICSA-2008-ChristensenHS #architecture #exclamation #research #set: Ready! Set! Go! An Action Research Agenda for Software Architecture Research (HBC, KMH, KRS), pp. 257–260.
CASE-2008-SunWHRW #case study #effectiveness #identification #monitoring #set: Identification of feature set for effective tool condition monitoring — a case study in titanium machining (JS, YSW, GSH, MR, ZW), pp. 273–278.
DAC-2008-BastaniKWC #learning #predict #set: Speedpath prediction based on learning from a small set of examples (PB, KK, LCW, EC), pp. 217–222.
DAC-2008-BauerSH #embedded #runtime #set: Run-time instruction set selection in a transmutable embedded processor (LB, MS, JH), pp. 56–61.
DAC-2008-El-MoselhyEW #algorithm #parametricity #performance #scalability #set: Efficient algorithm for the computation of on-chip capacitance sensitivities with respect to a large set of parameters (TAEM, IME, DW), pp. 906–911.
DAC-2008-LiBNPC #approach #how #implementation #power management #set: How to let instruction set processor beat ASIC for low power wireless baseband implementation: a system level approach (ML, BB, DN, LVdP, FC), pp. 345–346.
DATE-2008-BauerSKH #embedded #runtime #set: Run-time System for an Extensible Embedded Processor with Dynamic Instruction Set (LB, MS, SK, JH), pp. 752–757.
DATE-2008-TenentesKK #testing: State Skip LFSRs: Bridging the Gap between Test Data Compression and Test Set Embedding for IP Cores (VT, XK, EK), pp. 474–479.
DATE-2008-VogtW #configuration management #set: A Reconfigurable Application Specific Instruction Set Processor for Convolutional and Turbo Decoding in a SDR Environment (TV, NW), pp. 38–43.
DATE-2008-WuCSC #architecture #multi #set: Instruction Set Extension Exploration in Multiple-Issue Architecture (IWW, ZYC, JJJS, CPC), pp. 764–769.
VLDB-2008-ChaikenJLRSWZ #named #parallel #performance #set: SCOPE: easy and efficient parallel processing of massive data sets (RC, BJ, PÅL, BR, DS, SW, JZ), pp. 1265–1276.
VLDB-2008-HadjieleftheriouYKS #query #set #similarity: Hashed samples: selectivity estimators for set similarity selection queries (MH, XY, NK, DS), pp. 201–212.
VLDB-2008-TerrovitisMK #privacy: Privacy-preserving anonymization of set-valued data (MT, NM, PK), pp. 115–125.
ITiCSE-2008-DemailleLP #compilation #education #set #tool support: A set of tools to teach compiler construction (AD, RL, BP), pp. 68–72.
ITiCSE-2008-PetkovicTT #assessment #comparison: Assessment and comparison of local and global SW engineering practices in a classroom setting (DP, GDT, RT), pp. 78–82.
SCAM-2008-StoneSB #analysis #automation #data flow #set: Automatic Determination of May/Must Set Usage in Data-Flow Analysis (AS, MS, SB), pp. 153–162.
STOC-2008-ChenLL #algorithm #feedback #parametricity #problem #set: A fixed-parameter algorithm for the directed feedback vertex set problem (JC, YL, SL, BO, IR), pp. 177–186.
FLOPS-2008-MellarkodG #constraints #reasoning #set #theorem proving: Integrating Answer Set Reasoning with Constraint Solving Techniques (VSM, MG), pp. 15–31.
FLOPS-2008-Schaub #information management #modelling #programming #reasoning #representation #set: Model-Based Knowledge Representation and Reasoning Via Answer Set Programming (TS), pp. 1–2.
DLT-2008-BassinoGN #complexity #finite #linear #set #word: The Average State Complexity of the Star of a Finite Set of Words Is Linear (FB, LG, CN), pp. 134–145.
DLT-2008-CaludeNSS #recursion #set #string: Universal Recursively Enumerable Sets of Strings (CSC, AN, LS, FS), pp. 170–182.
ICALP-A-2008-BlaserHS #set: Asymptotically Optimal Hitting Sets Against Polynomials (MB, MH, DS), pp. 345–356.
ICALP-A-2008-Onak #metric #testing: Testing Properties of Sets of Points in Metric Spaces (KO), pp. 515–526.
ICALP-B-2008-BoigelotBB #automaton #finite #multi #on the #set: On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases (BB, JB, VB), pp. 112–123.
ICALP-B-2008-JezO #equation #on the #set: On the Computational Completeness of Equations over Sets of Natural Numbers (AJ, AO), pp. 63–74.
ICALP-B-2008-Kesner #composition: Perpetuality for Full and Safe Composition (in a Constructive Setting) (DK), pp. 311–322.
LATA-2008-Crespi-ReghizziP #set: Consensual Definition of Languages by Regular Sets (SCR, PSP), pp. 196–208.
LATA-2008-MoczuradM #how #question #set: How Many Figure Sets Are Codes? (MM, WM), pp. 385–396.
CIKM-2008-AlqadahB08a #clustering #detection #set: Detecting significant distinguishing sets among bi-clusters (FA, RB), pp. 1455–1456.
CIKM-2008-Lee #categorisation #documentation #set #topic: Incorporating topical support documents into a small training set in text categorization (KSL), pp. 1511–1512.
ICML-2008-BryanS #learning: Actively learning level-sets of composite functions (BB, JGS), pp. 80–87.
ICML-2008-Shalev-ShwartzS #dependence #optimisation #set: SVM optimization: inverse dependence on training set size (SSS, NS), pp. 928–935.
ICPR-2008-FuSHLT #image #kernel #learning #multi #set: Multiple kernel learning from sets of partially matching image features (SYF, GS, ZGH, ZzL, MT), pp. 1–4.
ICPR-2008-LathenJB #segmentation #set: Phase based level set segmentation of blood vessels (GL, JJ, MB), pp. 1–4.
ICPR-2008-NguyenBP #approach #learning #set: A supervised learning approach for imbalanced data sets (GHN, AB, SLP), pp. 1–4.
ICPR-2008-Vega-PonsRV #algorithm #segmentation #set #using: Active contour algorithm for texture segmentation using a texture feature set (SVP, JLGR, OLV), pp. 1–4.
KDD-2008-SimonKZ #agile #approach #reliability #scalability #set: Semi-supervised approach to rapid and reliable labeling of large data sets (GJS, VK, ZLZ), pp. 641–649.
KR-2008-DelgrandeSTW #logic programming #semantics #set #source code: Belief Revision of Logic Programs under Answer Set Semantics (JPD, TS, HT, SW), pp. 411–421.
KR-2008-DrescherGGKKOS #set: Conflict-Driven Disjunctive Answer Set Solving (CD, MG, TG, BK, AK, MO, TS), pp. 422–432.
KR-2008-HunterK #consistency #nondeterminism #set: Measuring Inconsistency through Minimal Inconsistent Sets (AH, SK), pp. 358–366.
KR-2008-LinW #programming #set: Answer Set Programming with Functions (FL, YW), pp. 454–465.
GPCE-2008-RothamelL #generative #implementation #incremental #query: Generating incremental implementations of object-set queries (TR, YAL), pp. 55–66.
LOPSTR-2008-Seki #on the #semantics #set: On Negative Unfolding in the Answer Set Semantics (HS), pp. 168–184.
PPDP-2008-SulzmannL #constraints #execution #parallel: Parallel execution of multi-set constraint rewrite rules (MS, ESLL), pp. 20–31.
SAC-2008-BallabrigaCS #analysis #approach: An improved approach for set-associative instruction cache partial analysis (CB, HC, PS), pp. 360–367.
SAC-2008-TsujiKH #implementation #multi #scalability #set: History offset implementation scheme for large scale multidimensional data sets (TT, MK, KH), pp. 1021–1028.
SAC-2008-ZhangMD #feature model #fuzzy #image #retrieval #set #using: Texture feature extraction and description using fuzzy set of main dominant directions of variable scales in content-based medical image retrieval (GZ, ZMM, LD), pp. 1760–1761.
ICSE-2008-HammerDVT #detection: Dynamic detection of atomic-set-serializability violations (CH, JD, MV, FT), pp. 231–240.
ATEM-J-2006-DubeyJA #context-free grammar #learning #set: Learning context-free grammar rules from a set of program (AD, PJ, SKA), pp. 223–240.
ASPLOS-2008-SrikantaiahKI #adaptation #multi #set: Adaptive set pinning: managing shared caches in chip multiprocessors (SS, MTK, MJI), pp. 135–144.
CAV-2008-BaswanaMP #consistency #memory management #set #verification: Implied Set Closure and Its Application to Memory Consistency Verification (SB, SKM, VP), pp. 94–106.
ICLP-2008-Baral #information management #programming #reasoning #representation #set #using: Using Answer Set Programming for Knowledge Representation and Reasoning: Future Directions (CB), pp. 69–70.
ICLP-2008-BoennBVF #automation #composition #music #programming #set: Automatic Composition of Melodic and Harmonic Music by Answer Set Programming (GB, MB, MDV, Jf), pp. 160–174.
ICLP-2008-Cabalar #programming #set #similarity: Partial Functions and Equality in Answer Set Programming (PC), pp. 392–406.
ICLP-2008-CliffeVBP #animation #declarative #named #programming #set #using #visualisation: ASPVIZ: Declarative Visualisation and Animation Using Answer Set Programming (OC, MDV, MB, JAP), pp. 724–728.
ICLP-2008-EglyGW #framework #implementation #named #programming #using: ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming (UE, SAG, SW), pp. 734–738.
ICLP-2008-Fink #logic #programming: Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There (MF), pp. 99–113.
ICLP-2008-GebserSTUV #biology #consistency #detection #network #nondeterminism #programming #scalability #set: Detecting Inconsistencies in Large Biological Networks with Answer Set Programming (MG, TS, ST, BU, PV), pp. 130–144.
ICLP-2008-Janhunen #set #source code: Removing Redundancy from Answer Set Programs (TJ), pp. 729–733.
ICLP-2008-JanssenHVC #compilation #fuzzy #set #source code: Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories (JJ, SH, DV, MDC), pp. 362–376.
ICLP-2008-Lierler #set: Abstract Answer Set Solvers (YL), pp. 377–391.
ICLP-2008-Marek #programming #question #set: Quo Vadis Answer Set Programming? (VWM), pp. 83–87.
ICLP-2008-Niemela #programming #set: Answer Set Programming without Unstratified Negation (IN), pp. 88–92.
ICLP-2008-OetschT #semantics: Program Correspondence under the Answer-Set Semantics: The Non-ground Case (JO, HT), pp. 591–605.
ICLP-2008-PearceV #equilibrium #logic #quantifier #set #source code: Quantified Equilibrium Logic and Foundations for Answer Set Programs (DP, AV), pp. 546–560.
ICLP-2008-PuhrerTW #source code: Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence (JP, HT, SW), pp. 561–575.
ICLP-2008-Schaub #exclamation #programming #set: Here’s the Beef: Answer Set Programming ! (TS), pp. 93–98.
ICLP-2008-TriasNAFH: Negative Ternary Set-Sharing (ET, JAN, ESA, SF, MVH), pp. 301–316.
IJCAR-2008-MouraB #effectiveness #logic #set #using: Deciding Effectively Propositional Logic Using DPLL and Substitution Sets (LMdM, NB), pp. 410–425.
SAT-2008-LiffitonS #satisfiability #set: Searching for Autarkies to Trim Unsatisfiable Clause Sets (MHL, KAS), pp. 182–195.
VMCAI-2008-Mendez-LojoH #analysis #precise #set #source code: Precise Set Sharing Analysis for Java-Style Programs (MML, MVH), pp. 172–187.
CBSE-2007-Storm #composition #set: Binary Change Set Composition (TvdS), pp. 17–32.
WICSA-2007-Sarang #architecture: Setting up Architect Team (PS), p. 18.
CASE-2007-ChakrabortyAW #multi #set: Coverage of a Planar Point Set with Multiple Constrained Robots (NC, SA, JTW), pp. 899–904.
CASE-2007-ZhuangXZD #multi #optimisation #set: Von Mises Stress and Level Set Method based Structural Topology Optimization with Multi-phase Materials (CZ, ZX, XZ, HD), pp. 945–949.
DAC-2007-BauerSKH #framework #named #set: RISPP: Rotating Instruction Set Processing Platform (LB, MS, SK, JH), pp. 791–796.
DAC-2007-GandikotaCBSB #analysis #set: Top-k Aggressors Sets in Delay Noise Analysis (RG, KC, DB, DS, MRB), pp. 174–179.
DATE-2007-AtasuDMLOD #constraints #optimisation: Optimizing instruction-set extensible processors under data bandwidth constraints (KA, RGD, OM, WL, CCÖ, GD), pp. 588–593.
DATE-2007-BonziniP #automation #polynomial #set: Polynomial-time subgraph enumeration for automated instruction set extension (PB, LP), pp. 1331–1336.
DATE-2007-FeiS #architecture #monitoring #set: Microarchitectural support for program code integrity monitoring in application-specific instruction set processors (YF, ZJS), pp. 815–820.
DATE-2007-HuynhM #embedded #realtime: Instruction-set customization for real-time embedded systems (HPH, TM), pp. 1472–1477.
ICDAR-2007-SchulzMM #performance #precise #set: Fast Selection of Small and Precise Candidate Sets from Dictionaries for Text Correction Tasks (KUS, SM, PM), pp. 471–475.
PODS-2007-HernichS #dependence: CWA-solutions for data exchange settings with target dependencies (AH, NS), pp. 113–122.
SIGMOD-2007-ChuBN #approach #relational #set: The case for a wide-table approach to manage sparse relational data sets (EC, JLB, JFN), pp. 821–832.
VLDB-2007-WuJ #set: A Bayesian Method for Guessing the Extreme Values in a Data Set (MW, CJ), pp. 471–482.
FoSSaCS-2007-MarnetteKR #bound #constraints #polynomial #set: Polynomial Constraints for Sets with Cardinality Bounds (BM, VK, MCR), pp. 258–273.
TACAS-2007-MossakowskiML #set: The Heterogeneous Tool Set, Hets (TM, CM, KL), pp. 519–522.
ICSM-2007-Salahuddin #testing #using: Analysing the Impact of Change on Test Sets Using X-Machines (SS), pp. 511–512.
WCRE-2007-McNairGW #architecture #evolution #using #visualisation: Visualizing Software Architecture Evolution Using Change-Sets (AM, DMG, JHWJ), pp. 130–139.
PLDI-2007-KodumalA #constraints #set: Regularly annotated set constraints (JK, AA), pp. 331–341.
SAS-2007-PayetS #analysis #bytecode #java: Magic-Sets Transformation for the Analysis of Java Bytecode (ÉP, FS), pp. 452–467.
STOC-2007-BravermanY #set: Constructing non-computable Julia sets (MB, MY), pp. 709–716.
DLT-2007-Blanchet-SadriBP #set #word: Two Element Unavoidable Sets of Partial Words (FBS, NCB, JP), pp. 96–107.
ICALP-2007-BellareR #design: Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms (MB, TR), pp. 399–410.
ICALP-2007-LuTW #complexity #on the #set: On the Complexity of Hard-Core Set Constructions (CJL, SCT, HLW), pp. 183–194.
LATA-2007-AntoniouCIP #set #string: Application of suffix trees for the acquisition of common motifs with gaps in a set of strings (PA, MC, CSI, PP), pp. 57–66.
AGTIVE-2007-FussT #algorithm #graph transformation #model transformation #simulation: Simulating Set-Valued Transformations with Algorithmic Graph Transformation Languages (CF, VET), pp. 442–455.
CHI-2007-ReillyI #evaluation #visualisation: White rooms and morphing don’t mix: setting and the evaluation of visualization techniques (DFR, KMI), pp. 111–120.
DHM-2007-BeauregardC #concept #experience #framework #metric #quality #user interface: User Experience Quality: A Conceptual Framework for Goal Setting and Measurement (RB, PC), pp. 325–332.
DHM-2007-ZhangHLTQLLLCGX #set: Chinese Visible Human Data Sets and Their Applications (SXZ, PAH, ZJL, LWT, MGQ, QYL, RXL, KL, GYC, YG, YMX), pp. 530–535.
HCI-AS-2007-ErikssonA #mobile #multi: Multi-users and Multi-contextuality — A Mobile Tourism Setting (CIE, MÅ), pp. 48–57.
HCI-IDU-2007-Jensen #comparison #concurrent: Evaluating in a Healthcare Setting: A Comparison Between Concurrent and Retrospective Verbalisation (JJJ), pp. 508–516.
HCI-IDU-2007-SandhuAA #agile #assessment: Serial Hanging Out: Rapid Ethnographic Needs Assessment in Rural Settings (JSS, PA, DA), pp. 614–623.
HCI-MIE-2007-ChangKP #constraints #evolution #set #using: Lip Contour Extraction Using Level Set Curve Evolution with Shape Constraint (JSC, EYK, SHP), pp. 583–588.
HIMI-MTT-2007-CouturierRC #approach #interactive #scalability #set: An Interactive Approach to Display Large Sets of Association Rules (OC, JR, VC), pp. 258–267.
HIMI-MTT-2007-IshizuGNI #ontology #set: Rough Ontology: Extension of Ontologies by Rough Sets (SI, AG, YN, YI), pp. 456–462.
ICEIS-AIDSS-2007-CrawfordLCP #approach #set: A Evolutionary Approach to Solve Set Covering (BC, CL, CC, FP), pp. 356–363.
CIKM-2007-BotelhoZ #scalability #set: External perfect hashing for very large key sets (FCB, NZ), pp. 653–662.
CIKM-2007-ZhouHZS #markov: A segment-based hidden markov model for real-setting pinyin-to-chinese conversion (XZ, XH, XZ, XS), pp. 1027–1030.
ECIR-2007-HeO #normalisation: Setting Per-field Normalisation Hyper-parameters for the Named-Page Finding Search Task (BH, IO), pp. 468–480.
ICML-2007-ChenJ #classification #feature model #set: Minimum reference set based feature selection for small sample classifications (XwC, JCJ), pp. 153–160.
KDD-2007-CurryGLVB #case study #detection #scalability #set: Detecting changes in large data sets of payment card data: a case study (CC, RLG, DL, SV, JB), pp. 1018–1022.
KDD-2007-HeikinheimoSHMM #set: Finding low-entropy sets and trees from binary data (HH, JKS, EH, HM, TM), pp. 350–359.
SIGIR-2007-TurnbullBTL #semantics #set #towards #using: Towards musical query-by-semantic-description using the CAL500 data set (DT, LB, DAT, GRGL), pp. 439–446.
ECMDA-FA-2007-MaraeeB #diagrams #finite #performance #reasoning #satisfiability #set #uml: Efficient Reasoning About Finite Satisfiability of UML Class Diagrams with Constrained Generalization Sets (AM, MB), pp. 17–31.
SAC-2007-BatistaFM #grid #network #set: A set of schedulers for grid networks (DMB, NLSdF, FKM), pp. 209–213.
SAC-2007-LiebrockMBPCSU #analysis #design #forensics #set: A preliminary design for digital forensics analysis of terabyte size data sets (LML, NM, DPB, RP, EC, MS, VU), pp. 190–191.
SAC-2007-ZhangMC #fuzzy #image #retrieval #set: Directed filter for dominant direction fuzzy set in content-based image retrieval (GZ, ZMM, ZC), pp. 76–77.
ICSE-2007-HendricksonH #architecture #modelling #product line #set: Modeling Product Line Architectures through Change Sets and Relationships (SAH, AvdH), pp. 189–198.
LCTES-2007-BennettMFT #automation #embedded #set #text-to-text: Combining source-to-source transformations and processor instruction set extensions for the automated design-space exploration of embedded systems (RVB, ACM, BF, NPT), pp. 83–92.
ICLP-2007-BaralDT #information management #natural language #prolog #set #towards: Towards Overcoming the Knowledge Acquisition Bottleneck in Answer Set Prolog Applications: Embracing Natural Language Inputs (CB, JD, LT), pp. 1–21.
ICLP-2007-Brewka #set: Preferences, Contexts and Answer Sets (GB), p. 22.
ICLP-2007-Eiter #programming #semantics #set #web: Answer Set Programming for the Semantic Web (TE), pp. 23–26.
ICLP-2007-Gebser #programming #set: Advanced Techniques for Answer Set Programming (MG), pp. 458–459.
ICLP-2007-GebserS #programming #set: Generic Tableaux for Answer Set Programming (MG, TS), pp. 119–133.
ICLP-2007-NieuwenborghCV #fuzzy #set #using: Computing Fuzzy Answer Sets Using dlvhex (DVN, MDC, DV), pp. 449–450.
ICLP-2007-Oikarinen #composition #programming #set: Modular Answer Set Programming (EO), pp. 462–463.
LICS-2007-Escardo #infinity #performance #set: Infinite sets that admit fast exhaustive search (MHE), pp. 443–452.
LICS-2007-Moczydlowski #set: A Dependent Set Theory (WM), pp. 23–34.
SAT-2007-Kullmann #invariant #matrix #polynomial #satisfiability: Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices (OK), pp. 314–327.
SAT-2007-SamerS #quantifier #set: Backdoor Sets of Quantified Boolean Formulas (MS, SS), pp. 230–243.
SAT-2007-Szeider #set: Matched Formulas and Backdoor Sets (SS), pp. 94–99.
TLCA-2007-Tatsuta #higher-order #quantifier #set: Simple Saturated Sets for Disjunction and Second-Order Existential Quantification (MT), pp. 366–380.
ASE-2006-EichbergMKOR #analysis #scheduling #set: Integrating and Scheduling an Open Set of Static Analyses (ME, MM, SK, KO, BR), pp. 113–122.
CASE-2006-LiuWL #algorithm #performance #petri net #set: A fast algorithm to find a set of elementary siphons for a class of petri nets (XL, AW, ZL), pp. 399–404.
DAC-2006-JayaseelanLM: Exploiting forwarding to improve data bandwidth of instruction-set extensions (RJ, HL, TM), pp. 43–48.
DATE-2006-DErricoQ #approach: Constructing portable compiled instruction-set simulators: an ADL-driven approach (JD, WQ), pp. 112–117.
DATE-2006-GrossschadlIPTV #algorithm #case study #design #encryption #set: Combining algorithm exploration with instruction set design: a case study in elliptic curve cryptography (JG, PI, LP, ST, AKV), pp. 218–223.
DATE-2006-HePE #clustering #scheduling #testing: Power constrained and defect-probability driven SoC test scheduling with test set partitioning (ZH, ZP, PE), pp. 291–296.
DATE-2006-LeupersKKP #configuration management #design #embedded #set #synthesis: A design flow for configurable embedded processors based on optimized instruction set extension synthesis (RL, KK, SK, MP), pp. 581–586.
DATE-2006-LuZSLS #scheduling #set: Procrastinating voltage scheduling with discrete frequency sets (ZL, YZ, MRS, JL, KS), pp. 456–461.
DATE-2006-PomeranzR #detection #fault #generative #testing: Generation of broadside transition fault test sets that detect four-way bridging faults (IP, SMR), pp. 907–912.
DATE-2006-WangCG #fault #formal method #probability #testing #using: Test set enrichment using a probabilistic fault model and the theory of output deviations (ZW, KC, MG), pp. 1270–1275.
DATE-2006-ZengI #concurrent #testing #using: Concurrent core test for SOC using shared test set and scan chain disable (GZ, HI), pp. 1045–1050.
DATE-DF-2006-NazarianPGB #named #set #statistics: STAX: statistical crosstalk target set compaction (SN, MP, SKG, MAB), pp. 172–177.
PODS-2006-Cohen #equivalence #query #semantics #set: Equivalence of queries combining set and bag-set semantics (SC), pp. 70–79.
PODS-2006-GangulyM: Deterministic k-set structure (SG, AM), pp. 280–289.
PODS-2006-GroheHS #bound #random #scalability #set: Randomized computations on large data sets: tight lower bounds (MG, AH, NS), pp. 243–252.
PODS-2006-ZhaoOWX #distributed #set: Finding global icebergs over distributed data sets (QZ, MO, HW, J(X), pp. 298–307.
VLDB-2006-ArasuGK #performance: Efficient Exact Set-Similarity Joins (AA, VG, RK), pp. 918–929.
VLDB-2006-DrineasM #algorithm #matrix #random #set: Randomized Algorithms for Matrices and Massive Data Sets (PD, MWM), p. 1269.
CSEET-2006-Frailey06a #education #experience #industrial: Experience Teaching Barry Boehm’s Techniques in Industrial and Academic Settings (DJF), pp. 219–225.
ICPC-2006-LuccaP #challenge #comprehension #roadmap: Experimental Settings in Program Comprehension: Challenges and Open Issues (GADL, MDP), pp. 229–234.
ICSM-2006-JiangGSEW #comprehension #industrial: Software Feature Understanding in an Industrial Setting (MJ, MG, SS, DE, NW), pp. 66–67.
STOC-2006-ColeG #bound #set: Searching dynamic point sets in spaces with bounded doubling dimension (RC, LAG), pp. 574–583.
STOC-2006-Weitz #independence #set: Counting independent sets up to the tree threshold (DW), pp. 140–149.
FLOPS-2006-LiKL #analysis #lazy evaluation: Lazy Set-Sharing Analysis (XL, AK, LL), pp. 177–191.
DLT-J-2005-AfoninH06 #problem #regular expression #set: Membership and Finiteness Problems for Rational Sets of Regular Languages (SA, EH), pp. 493–506.
DLT-J-2005-BrlekLL06 #set: Properties of the Contour Path of Discrete Sets (SB, GL, AL), pp. 543–556.
DLT-2006-DAlessandroRV #finite #order #set: Well Quasi Orders and the Shuffle Closure of Finite Sets (FD, GR, SV), pp. 260–269.
ICALP-v1-2006-HitchcockP #reduction #set: Comparing Reductions to NP-Complete Sets (JMH, AP), pp. 465–476.
ICALP-v2-2006-GennaroM #independence #set: Independent Zero-Knowledge Sets (RG, SM), pp. 34–45.
ICALP-v2-2006-KariantoKT #on the #problem #set: On Intersection Problems for Polynomially Generated Sets (KW, AK, WT), pp. 516–527.
IFL-2006-BertholdL #coordination #functional #parallel: Parallel Coordination Made Explicit in a Functional Setting (JB, RL), pp. 73–90.
CHI-2006-BenfordCRSDFD #case study #design #experience #risk management #staging: Designing for the opportunities and risks of staging digital experiences in public settings (SB, AC, SR, JGS, AJD, MF, AD), pp. 427–436.
ICEIS-AIDSS-2006-Grzeszczyk #evaluation #set: Application of the Rough Set Method for Evaluation of Structural Funds Projects (TAG), pp. 202–207.
CIKM-2006-GonzalezHL #mining #set #workflow: Mining compressed commodity workflows from massive RFID data sets (HG, JH, XL), pp. 162–171.
CIKM-2006-TerrovitisPVS: A combination of trie-trees and inverted files for the indexing of set-valued attributes (MT, SP, PV, TKS), pp. 728–737.
CIKM-2006-ThomasH #evaluation #set: Evaluation by comparing result sets in context (PT, DH), pp. 94–101.
ICML-2006-desJardinsEW #learning #set: Learning user preferences for sets of objects (Md, EE, KW), pp. 273–280.
ICML-2006-TangM #multi: Multiclass reduced-set support vector machines (BT, DM), pp. 921–928.
ICPR-v1-2006-ArandjelovicC #classification #set #using: Face Set Classification using Maximally Probable Mutual Modes (OA, RC), pp. 511–514.
ICPR-v1-2006-LiCF #hybrid #kernel #set: Hybrid Kernel Machine Ensemble for Imbalanced Data Sets (PL, KLC, WF), pp. 1108–1111.
ICPR-v1-2006-MarmoAC #classification #set #using: Microfossils shape classification using a set of width values (RM, SA, VC), pp. 691–694.
ICPR-v1-2006-TongT #3d #multi #re-engineering #set: Multiresolution Mesh Reconstruction from Noisy 3D Point Sets (WST, CKT), pp. 5–8.
ICPR-v2-2006-KrizekKH #feature model #set: Feature selection based on the training set manipulation (PK, JK, VH), pp. 658–661.
ICPR-v2-2006-KuijperOBG #2d #set #symmetry #using: Matching 2D Shapes using their Symmetry Sets (AK, OFO, PB, PJG), pp. 179–182.
ICPR-v2-2006-RooverCM #approach #multi #set: Smoothing with Active Surfaces: A Multiphase Level Set Approach (CDR, JC, BMM), pp. 243–246.
ICPR-v2-2006-SungZL #learning #scalability #set: Accelerating the SVM Learning for Very Large Data Sets (ES, YZ, XL), pp. 484–489.
ICPR-v2-2006-YangN #recognition #scalability #set: Layered Search Spaces for Accelerating Large Set Character Recognition (YY, MN), pp. 1006–1009.
ICPR-v2-2006-YuW #algorithm #clustering #named #realtime #scalability #set: GCA: A real-time grid-based clustering algorithm for large data set (ZY, HSW), pp. 740–743.
ICPR-v3-2006-ArcelliBS #3d #set: A New Set of Topology Preserving Removal Operations in the 3D Space (CA, GSdB, LS), pp. 1055–1058.
ICPR-v3-2006-GanLY06a #array #biology #constraints #framework #set: Microarray Missing Data Imputation based on a Set Theoretic Framework and Biological Constraints (XG, AWCL, HY), pp. 842–845.
ICPR-v3-2006-WangCSG #detection #set: Enhancing Training Set for Face Detection (RW, JC, SS, WG), pp. 477–480.
ICPR-v3-2006-YeungS #framework #probability #set #symmetry: Stochastic Framework for Symmetric Affine Matching between Point Sets (SKY, PS), pp. 790–793.
ICPR-v4-2006-MaurelKF #set: Reconciling Landmarks and Level Sets (PM, RK, ODF), pp. 69–72.
ICPR-v4-2006-NosratighodsAE #novel #set #using #verification: Speaker Verification Using A Novel Set of Dynamic Features (MN, EA, JE), pp. 266–269.
KDD-2006-CaldersGJ #mining #set: Mining rank-correlated sets of numerical attributes (TC, BG, SJ), pp. 96–105.
KDD-2006-LiuZWMP #clustering #difference #order #set: Clustering pair-wise dissimilarity data into partially ordered sets (JL, QZ, WW, LM, JP), pp. 637–642.
KDD-2006-TsangKK #feature model #kernel #performance #set: Efficient kernel feature extraction for massive data sets (IWT, AK, JTK), pp. 724–729.
KR-2006-EiterFTTW #programming: Replacements in Non-Ground Answer-Set Programming (TE, MF, HT, PT, SW), pp. 340–351.
SIGIR-2006-Olsson #analysis #classification #set: An analysis of the coupling between training set and neighborhood sizes for the kNN classifier (JSO), pp. 685–686.
PADL-2006-NavasBH #analysis #clique #performance #top-down #using: Efficient Top-Down Set-Sharing Analysis Using Cliques (JAN, FB, MVH), pp. 183–198.
POPL-2006-MeunierFF #analysis #composition #contract: Modular set-based analysis from contracts (PM, RBF, MF), pp. 218–231.
SAC-2006-Goldsztejn #algorithm #approximate #branch #set: A branch and prune algorithm for the approximation of non-linear AE-solution sets (AG), pp. 1650–1654.
SAC-2006-GraillatL #pseudo #set: Pseudozero set of interval polynomials (SG, PL), pp. 1655–1659.
SAC-2006-HabichWLP #clustering #set: Two-phase clustering strategy for gene expression data sets (DH, TW, WL, CP), pp. 145–150.
SAC-2006-RouguiRAGM #documentation #modelling #retrieval #scalability #set: Hierarchical organization of a set of Gaussian mixture speaker models for scaling up indexing and retrieval in audio documents (JER, MR, DA, MG, JMM), pp. 1369–1373.
SAC-2006-RuizCCP #algebra #analysis #concurrent #e-commerce #process #protocol #set #using: Analysis of the SET e-commerce protocol using a true concurrency process algebra (MCR, DC, FC, JJP), pp. 879–886.
CGO-2006-KimSMP #2d #branch #detection #named #set: 2D-Profiling: Detecting Input-Dependent Branches with a Single Input Data Set (HK, MAS, OM, YNP), pp. 159–172.
CAV-2006-ColvinGLM #algorithm #concurrent #lazy evaluation #set #verification: Formal Verification of a Lazy Concurrent List-Based Set Algorithm (RC, LG, VL, MM), pp. 475–488.
ICLP-2006-BaralDT #composition #metaprogramming #set: Macros, Macro Calls and Use of Ensembles in Modular Answer Set Programming (CB, JD, HT), pp. 376–390.
ICLP-2006-Brain #declarative #problem #semantics #set #using: Declarative Problem Solving Using Answer Set Semantics (MB), pp. 459–460.
ICLP-2006-BrainCVF #named #programming #set: TOAST: Applying Answer Set Programming to Superoptimisation (MB, TC, MDV, JPF), pp. 270–284.
ICLP-2006-GebserS #calculus #programming #set: Tableau Calculi for Answer Set Programming (MG, TS), pp. 11–25.
ICLP-2006-GrellSS #biology #modelling #network #programming #set: Modelling Biological Networks by Action Languages Via Answer Set Programming (SG, TS, JS), pp. 285–299.
ICLP-2006-InoueS #programming #set: Generality Relations in Answer Set Programming (KI, CS), pp. 211–225.
ICLP-2006-NieuwenborghHV #programming #set: Cooperating Answer Set Programming (DVN, SH, DV), pp. 226–241.
ICLP-2006-PontelliS #logic programming #semantics #set #source code: Justifications for Logic Programs Under Answer Set Semantics (EP, TCS), pp. 196–210.
ICLP-2006-SchwaigerF #assessment #automation #compilation #programming #testing #using: Using Answer Set Programming for the Automatic Compilation of Assessment Tests (PS, BF), pp. 300–314.
IJCAR-2006-Brown #set #type system: Combining Type Theory and Untyped Set Theory (CEB), pp. 205–219.
IJCAR-2006-ConstableM #proving #semantics #source code: Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics (RLC, WM), pp. 162–176.
SAT-2006-KullmannLM #agile #categorisation #kernel #normalisation #satisfiability: Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel (OK, IL, JMS), pp. 22–35.
TestCom-2006-RodriguezMN #logic #testing: A Logic for Assessing Sets of Heterogeneous Testing Hypotheses (IR, MGM, MN), pp. 39–54.
WICSA-2005-JansenB #architecture #design #set: Software Architecture as a Set of Architectural Design Decisions (AJ, JB), pp. 109–120.
WICSA-2005-VasconcelosW #approach #architecture #clustering #independence #set #towards: Towards a Set of Application Independent Clustering Criteria within an Architecture Recovery Approach (APVdV, CW), pp. 235–236.
CASE-2005-PengLZ #approach #fuzzy #set: Intelligent setup planning in manufacturing by fuzzy set theory based approach (GP, WL, YZ), pp. 130–135.
DAC-2005-RaoV #energy #set: Energy optimal speed control of devices with discrete speed sets (RR, SBKV), pp. 901–904.
DATE-2005-BiswasBDPI #generative #named #set: ISEGEN: Generation of High-Quality Instruction Set Extensions by Iterative Improvement (PB, SB, NDD, LP, PI), pp. 1246–1251.
DATE-2005-CabodiCNQ #bound #model checking #quantifier #set: Circuit Based Quantification: Back to State Set Manipulation within Unbounded Model Checking (GC, MC, SN, SQ), pp. 688–689.
DATE-2005-KherijiDCM #approach #optimisation #testing: Optimising Test Sets for a Low Noise Amplifier with a Defect-Oriented Approach (RK, VD, JLC, SM), pp. 170–171.
DATE-2005-MartinelliD #bound #composition #set: Bound Set Selection and Circuit Re-Synthesis for Area/Delay Driven Decomposition (AM, ED), pp. 430–431.
DATE-2005-PomeranzR #analysis #detection #testing #worst-case: Worst-Case and Average-Case Analysis of n-Detection Test Sets (IP, SMR), pp. 444–449.
ICDAR-2005-LiuMK #classification #feature model #recognition #scalability #set #using: Building Compact Classifier for Large Character Set Recognition Using Discriminative Feature Extraction (CLL, RM, MK), pp. 846–850.
ICDAR-2005-WattX #recognition #scalability #set: Recognition for Large Sets of Handwritten Mathematical Symbols (SMW, XX), pp. 740–744.
PODS-2005-LeindersB #algebra #complexity #on the #relational #set: On the complexity of division and set joins in the relational algebra (DL, JVdB), pp. 76–83.
VLDB-2005-FolkertGWSBSBS #optimisation #set: Optimizing Refresh of a Set of Materialized Views (NF, AG, AW, SS, SB, SS, TB, LS), pp. 1043–1054.
VLDB-2005-GodfreySG #scalability #set: Maximal Vector Computation in Large Data Sets (PG, RS, JG), pp. 229–240.
VLDB-2005-JinL #estimation #fuzzy #scalability #set #string: Selectivity Estimation for Fuzzy String Predicates in Large Data Sets (LJ, CL), pp. 397–408.
VLDB-2005-PaparizosJ #algebra #question #sequence #set: Pattern Tree Algebras: Sets or Sequences? (SP, HVJ), pp. 349–360.
VLDB-2005-XinHYC #mining #set: Mining Compressed Frequent-Pattern Sets (DX, JH, XY, HC), pp. 709–720.
CSMR-2005-DubeyAJ #keyword #set #source code: A Technique for Extracting Keyword Based Rules from a Set of Programs (AD, SKA, PJ), pp. 217–225.
STOC-2005-Basu #algebra #algorithm #polynomial #set: Polynomial time algorithm for computing the top Betti numbers of semi-algebraic sets defined by quadratic inequalities (SB), pp. 313–322.
STOC-2005-BasuPR #algebra #component #set: Computing the first Betti number and the connected components of semi-algebraic sets (SB, RP, MFR), pp. 304–312.
STOC-2005-GafniGP #adaptation #bound #complexity #set: From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement (EG, RG, BP), pp. 714–722.
STOC-2005-JiaLNRS #approximate #set: Universal approximations for TSP, Steiner tree, and set cover (LJ, GL, GN, RR, RS), pp. 386–395.
CIAA-J-2004-KrawetzLS05 #complexity #finite #monad #set: State complexity and the monoid of transformations of a finite set (BK, JL, JS), pp. 547–563.
DLT-J-2004-RispalC05 #linear #order #set: Complementation of rational sets on countable scattered linear orderings (CR, OC), pp. 767–786.
CIAA-2005-Latour #diagrams #set: Computing Affine Hulls over Q and Z from Sets Represented by Number Decision Diagrams (LL), pp. 213–224.
CIAA-2005-VielhaberC #infinity #on the #set #transducer: On a Class of Bijective Binary Transducers with Finitary Description Despite Infinite State Set (MV, MdPCC), pp. 356–357.
DLT-2005-AfoninH #problem #regular expression #set: Membership and Finiteness Problems for Rational Sets of Regular Languages (SA, EH), pp. 88–99.
DLT-2005-Priese #graph #set: Semi-rational Sets of DAGs (LP), pp. 385–396.
DLT-2005-Straubing #regular expression: Inexpressibility Results for Regular Languages in Nonregular Settings (HS), pp. 69–77.
CIKM-2005-Ahonen-Myka #mining #sequence #set #word: Mining all maximal frequent word sequences in a set of sentences (HAM), pp. 255–256.
CIKM-2005-DaiS #documentation #retrieval #set: Minimal document set retrieval (WD, RKS), pp. 752–759.
CIKM-2005-YuZS #set #towards: Towards estimating the number of distinct value combinations for a set of attributes (XY, CZ, KCS), pp. 656–663.
KDD-2005-JeskeSLYCXYLHR #generative #information management #set: Generation of synthetic data sets for evaluating the accuracy of knowledge discovery systems (DRJ, BS, PJL, LY, SC, RX, TY, ML, DH, RR), pp. 756–762.
KDD-2005-ZakiR #mining #reasoning #set #using: Reasoning about sets using redescription mining (MJZ, NR), pp. 364–373.
MLDM-2005-TakigawaKN #classification #combinator #product line #set #subclass: The Convex Subclass Method: Combinatorial Classifier Based on a Family of Convex Sets (IT, MK, AN), pp. 90–99.
SIGIR-2005-Krishnan #modelling: Short comings of latent models in supervised settings (VK), pp. 625–626.
SIGIR-2005-LinH #fault #retrieval #set #topic: Revisiting the effect of topic set size on retrieval error (WHL, AGH), pp. 637–638.
PPDP-2005-LiL #unification: Inverting abstract unification for set-sharing (XL, LL), pp. 129–138.
PADL-2005-Almendros-JimenezC #constraints #set: Solving Constraints on Sets of Spatial Objects (JMAJ, AC), pp. 158–173.
PADL-2005-BaileyS #constraints #satisfiability #set #using: Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization (JB, PJS), pp. 174–186.
PADL-2005-BrooksEMR #programming #set: Character-Based Cladistics and Answer Set Programming (DRB, EE, JWM, DR), pp. 37–51.
SAC-2005-AjiliRE #approach #optimisation: A branch-price-and-propagate approach for optimizing IGP weight setting subject to unique shortest paths (FA, RR, AE), pp. 366–370.
SAC-2005-ChabertTN #consistency #constraints #problem: Box-set consistency for interval-based constraint problems (GC, GT, BN), pp. 1439–1443.
SAC-2005-DiazLPCV #approach #behaviour #e-commerce #probability #protocol #realtime #set #validation: An approach to handle real time and probabilistic behaviors in e-commerce: validating the SET protocol (GD, KGL, JJP, FC, VV), pp. 815–820.
SAC-2005-SpohnG #network #problem #set #using: A solution for the location problem in arbitrary computer networks using generic dominating sets (MAS, JJGLA), pp. 739–743.
SPLC-2005-ReiserW #set #using: Using Product Sets to Define Complex Product Decisions (MOR, MW), pp. 21–32.
CC-2005-BartonTBA: Generalized Index-Set Splitting (CB, AT, BB, JNA), pp. 106–120.
SAT-J-2004-GummadiNV05 #algorithm #independence #satisfiability #set #using: Algorithms for Satisfiability Using Independent Sets of Variables (RG, NSN, VR), pp. 133–144.
FATES-2005-AiguierABGM #algebra #axiom #specification #testing: Testing from Algebraic Specifications: Test Data Set Selection by Unfolding Axioms (MA, AA, CB, PLG, BM), pp. 203–217.
ICLP-2005-BaseliceBG #constraints #integration #set #theorem proving #towards: Towards an Integration of Answer Set and Constraint Solving (SB, PAB, MG), pp. 52–66.
ICLP-2005-GiunchigliaM #on the #satisfiability #set: On the Relation Between Answer Set and SAT Procedures (or, Between cmodels and smodels) (EG, MM), pp. 37–51.
ICLP-2005-TompitsW #equivalence #implementation #programming #towards: Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming (HT, SW), pp. 189–203.
RTA-2005-BouajjaniT #on the #process #reachability #set #term rewriting: On Computing Reachability Sets of Process Rewrite Systems (AB, TT), pp. 484–499.
SAT-2005-MeierS #algebra #benchmark #metric #problem #satisfiability #set: A New Set of Algebraic Benchmark Problems for SAT Solvers (AM, VS), pp. 459–466.
TLCA-2005-BartheGP #polymorphism #termination #type system: Practical Inference for Type-Based Termination in a Polymorphic Setting (GB, BG, FP), pp. 71–85.
DAC-2004-BiswasCAPID #memory management #set: Introduction of local memory elements in instruction set extensions (PB, VC, KA, LP, PI, ND), pp. 729–734.
DAC-2004-BriskKS #configuration management #design #set #synthesis: Area-efficient instruction set synthesis for reconfigurable system-on-chip designs (PB, AK, MS), pp. 395–400.
DAC-2004-ChengTM #embedded #named #synthesis: FITS: framework-based instruction-set tuning synthesis for embedded application specific processors (ACC, GST, TNM), pp. 920–923.
DAC-2004-Pomeranz #functional #generative #on the #testing: On the generation of scan-based test sets with reachable states for testing under functional operation conditions (IP), pp. 928–933.
DAC-2004-YuM #embedded: Characterizing embedded applications for instruction-set extensible processors (PY, TM), pp. 723–728.
DATE-v1-2004-BhuniaRR #analysis #using: Trim Bit Setting of Analog Filters Using Wavelet-Based Supply Current Analysis (SB, AR, KR), pp. 704–705.
DATE-v1-2004-DimopoulosL #performance #sequence #set #testing: Efficient Static Compaction of Test Sequence Sets through the Application of Set Covering Techniques (MGD, PL), pp. 194–201.
DATE-v1-2004-PomeranzVRS #detection #fault: Z-Sets and Z-Detections: Circuit Characteristics that Simplify Fault Diagnosis (IP, SV, SMR, BS), pp. 68–75.
DATE-v2-2004-WangLC #fault #hardware #hybrid #testing: Hybrid Delay Scan: A Low Hardware Overhead Scan-Based Delay Test Technique for High Fault Coverage and Compact Test Sets (SW, XL, STC), pp. 1296–1301.
HT-2004-Bulterman #evaluation #interactive #testing: A linking and interaction evaluation test set for SMIL (DCAB), pp. 46–47.
HT-2004-HorieY #analysis #documentation #set #using #web: Structural analysis for web documentation using the non-well-founded set (IH, KY), pp. 42–43.
SIGMOD-2004-AndritsosMT #database #mining #scalability #set #tool support: Information-Theoretic Tools for Mining Database Structure from Large Data Sets (PA, RJM, PT), pp. 731–742.
SIGMOD-2004-Sarawagi #performance #set #similarity: Efficient set joins on similarity predicates (SS, AK), pp. 743–754.
VLDB-2004-DasGGR #distributed #estimation #set: Distributed Set Expression Cardinality Estimation (AD, SG, MNG, RR), pp. 312–323.
VLDB-2004-NagarajanAP #challenge #database #integration #set: Database Challenges in the Integration of Biomedical Data Sets (RN, MA, AP), pp. 1202–1213.
PLDI-2004-KodumalA #constraints #reachability #set: The set constraint/CFL reachability connection in practice (JK, AA), pp. 207–218.
STOC-2004-BurgisserC #algebra #complexity #set: Counting complexity classes for numeric computations II: algebraic and semialgebraic sets (PB, FC), pp. 475–485.
STOC-2004-KenyonRS #set: Low distortion maps between point sets (CK, YR, AS), pp. 272–280.
FLOPS-2004-BuenoB: Set-Sharing Is Not Always Redundant for Pair-Sharing (FB, MJGdlB), pp. 117–131.
CIAA-2004-KrawetzLS #complexity #finite #monad #set: State Complexity and the Monoid of Transformations of a Finite Set (BK, JL, JS), pp. 213–224.
CIAA-2004-Lugiez #automaton #linear #logic #set: From Automata to Semilinear Sets: A Logical Solution for Sets L(C, P) (DL), pp. 321–322.
DLT-2004-Courcelle #bibliography #graph #relational #set: Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey (BC), pp. 1–11.
DLT-2004-DAlessandroV #set: Avoidable Sets and Well Quasi-Orders (FD, SV), pp. 139–150.
DLT-2004-RispalC #linear #order #set: Complementation of Rational Sets on Countable Scattered Linear Orderings (CR, OC), pp. 381–392.
ICALP-2004-GuruswamiI #linear: Linear-Time List Decoding in Error-Free Settings: (Extended Abstract) (VG, PI), pp. 695–707.
ICALP-2004-HalperinK #problem #set: The Minimum-Entropy Set Cover Problem (EH, RMK), pp. 733–744.
ICALP-2004-Midrijanis #bound #polynomial #problem #quantum #query #set #similarity: A Polynomial Quantum Query Lower Bound for the Set Equality Problem (GM), pp. 996–1005.
ICALP-2004-NikoletseasRS #graph #independence #performance #random #scalability #set: The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs (SEN, CR, PGS), pp. 1029–1040.
SEFM-2004-HamonMR #generative #model checking #performance #testing: Generating Efficient Test Sets with a Model Checker (GH, LMdM, JMR), pp. 261–270.
SEFM-2004-Struth #automation #reasoning #set: Automated Element-Wise Reasoning with Sets (GS), pp. 320–329.
CSCW-2004-SetlockFN: Taking it out of context: collaborating within and across cultures in face-to-face settings and via instant messaging (LDS, SRF, CN), pp. 604–613.
ICEIS-v2-2004-KooptiwootS #mining #set #using: Mining the Relationships in the Form of the Predisposing Factors and Coincident Factors Among Numerical Dynamic Attributes in Time Series Data Set by Using the Combination of Some Existing Techniques (SK, MAS), pp. 327–334.
ICEIS-v2-2004-KooptiwootS04a #idea #mining #set #using: Mining the Relationships in the Form of Predisposing Factor and Coincident Factor in Time Series Data Set by Using the Combination of some Existing Ideas with a new Idea from the Fact in the Chemical Reaction (SK, MAS), pp. 531–534.
ICEIS-v2-2004-WuW04a #algorithm #comparison #set: Result Comparison of Two Rough Set Based Discretization Algorithms (SW, WW), pp. 511–514.
ICEIS-v2-2004-ZaratePSSVD #clustering #network #optimisation #representation #set: Optimization of Neural Network’s Training Sets via Clustering: Application in Solar Collector Representation (LEZ, EMDP, DAS, JPDS, RV, ASCD), pp. 147–152.
ICEIS-v4-2004-EssmannHB #architecture #collaboration #component #mobile #network: A Network Component Architecture for Collaboration in Mobile Settings (BE, TH, TB), pp. 337–343.
CIKM-2004-GollapudiS #algorithm #analysis #framework #set: Framework and algorithms for trend analysis in massive temporal data sets (SG, DS), pp. 168–177.
ICPR-v1-2004-MatsumotoUS #image #pattern matching #pattern recognition #prototype #recognition: Prototype Setting for Elastic Matching-Based Image Pattern Recognition (NM, SU, HS), pp. 224–227.
ICPR-v1-2004-YuanSKR #estimation #image: Convex Set-Based Estimation of Image Flows (JY, CS, TK, PR), pp. 124–127.
ICPR-v2-2004-BrownCA #classification #performance #set: Efficient Calculation of the Complete Optimal Classification Set (MB, NC, SA), pp. 307–310.
ICPR-v2-2004-LiT #modelling #recognition #set: Influence of Language Models and Candidate Set Size on Contextual Post-processing for Chinese Script Recognition (YL, CLT), pp. 537–540.
ICPR-v2-2004-ToyamaSM #image #set: Image Mosaicing from a Set of Images Without Configuration Information (FT, KS, JM), pp. 899–902.
ICPR-v2-2004-WangZKT #distance #image #segmentation #set: Level Set Methods, Distance Function and Image Segmentation (DW, JZ, SCK, ZT), pp. 110–115.
ICPR-v3-2004-AdeodatoVASCM #case study #comparative #network #scalability #set: Neural Networks vs Logistic Regression: a Comparative Study on a Large Data Set (PJLA, GCV, ALA, RAFS, RCLVC, DSMPM), pp. 355–358.
ICPR-v3-2004-GanLY #array #estimation #set: Missing Microarray Data Estimation Based on Projection onto Convex Sets Method (XG, AWCL, HY), pp. 782–785.
ICPR-v3-2004-KuijperO #set #symmetry: Transitions of the Pre-Symmetry Set (AK, OFO), pp. 190–193.
ICPR-v3-2004-LiMH: New Method for Sparse Point-Sets Matching with Underlying Non-Rigidity (BL, QM, HH), pp. 8–11.
ICPR-v3-2004-SotocaSP #multi #naive bayes #set #using: Attribute Relevance in Multiclass Data Sets Using the Naive Bayes Rule (JMS, JSS, FP), pp. 426–429.
ICPR-v4-2004-HeidemannBBS #clustering #gesture #recognition #scalability #self #set #user interface #visual notation: Hand Gesture Recognition: Self-Organising Maps as a Graphical User Interface for the Partitioning of Large Training Data Sets (GH, HB, IB, AS), pp. 487–490.
KDD-2004-AfratiGM #approximate #set: Approximating a collection of frequent sets (FNA, AG, HM), pp. 12–19.
KDD-2004-TinoKS #approach #generative #probability #sequence #set #visualisation: A generative probabilistic approach to visualizing sets of symbolic sequences (PT, AK, YS), pp. 701–706.
KR-2004-Brewka #optimisation #set: Complex Preferences for Answer Set Optimization (GB), pp. 213–223.
KR-2004-EiterFFPW #bound #complexity #model checking #programming #set: Complexity of Model Checking and Bounded Predicate Arities for Non-ground Answer Set Programming (TE, WF, MF, GP, SW), pp. 377–387.
KR-2004-EiterLST #logic #programming #semantics #set #web: Combining Answer Set Programming with Description Logics for the Semantic Web (TE, TL, RS, HT), pp. 141–151.
SIGIR-2004-AmitayCLS #evaluation #scalability #set #using: Scaling IR-system evaluation using term relevance sets (EA, DC, RL, AS), pp. 10–17.
TOOLS-USA-2003-Bouktif04 #approach #predict #quality #search-based #set: Improving Rule Set Based Software Quality Prediction: A Genetic Algorithm-based Approach (SB), pp. 227–241.
LOPSTR-2004-Fruhwirth #concurrent #multi: Specialization of Concurrent Guarded Multi-set Transformation Rules (TWF), pp. 133–148.
PPDP-2004-CamaraoFV #constraints #satisfiability: Constraint-set satisfiability for overloading (CC, LF, CV), pp. 67–77.
PADL-2004-Balduccini #named #quality #set: USA-Smart: Improving the Quality of Plans in Answer Set Planning (MB), pp. 135–147.
PADL-2004-ElkhatibPS #named #prolog #reasoning #set #source code: ASP-PROLOG: A System for Reasoning about Answer Set Programs in Prolog (OEK, EP, TCS), pp. 148–162.
SAC-2004-QiW #mining #set: A model for mining outliers from complex data sets (HQ, JW), pp. 595–599.
LCTES-2004-KastensLST #feedback: Feedback driven instruction-set extension (UK, DKL, AS, MT), pp. 126–135.
CAV-2004-PingreeM #set: The HiVy Tool Set (PJP, EM), pp. 466–469.
CSL-2004-RychlikowskiT #constraints #set: Set Constraints on Regular Terms (PR, TT), pp. 458–472.
ICLP-2004-CumboFGL #datalog #source code: Enhancing the Magic-Set Method for Disjunctive Datalog Programs (CC, WF, GG, NL), pp. 371–385.
ICLP-2004-ErdemW #programming #set #using: Rectilinear Steiner Tree Construction Using Answer Set Programming (EE, MDFW), pp. 386–399.
ICLP-2004-Gelfond #design #programming #set: Answer Set Programming and the Design of Deliberative Agents (MG), pp. 19–26.
ICLP-2004-JiaYY #set #source code: Adding Domain Dependent Knowledge into Answer Set Programs for Planning (XJ, JHY, LYY), pp. 400–415.
ICLP-2004-Pearce #logic programming #semantics #set #source code: Simplifying Logic Programs Under Answer Set Semantics (DP), pp. 210–224.
ICLP-2004-RayBR #kernel #set: Generalised Kernel Sets for Inverse Entailment (OR, KB, AR), pp. 165–179.
ICLP-2004-WakakiI #compilation #programming #set: Compiling Prioritized Circumscription into Answer Set Programming (TW, KI), pp. 356–370.
SAT-2004-GummadiNV #algorithm #independence #satisfiability #set #using: Algorithms for Satisfiability using Independent Sets of Variables (RG, NSN, VR), pp. 56–63.
SAT-2004-NishimuraRS #detection #set: Detecting Backdoor Sets with Respect to Horn and Binary Clauses (NN, PR, SS), pp. 96–103.
DAC-2003-AmmerSKKR #energy: A low-energy chip-set for wireless intercom (MJA, MS, TCK, MK, JMR), pp. 916–919.
DAC-2003-AtasuPI #architecture #automation #constraints: Automatic application-specific instruction-set extensions under microarchitectural constraints (KA, LP, PI), pp. 256–261.
DAC-2003-NgPMJ #industrial #problem: Solving the latch mapping problem in an industrial setting (KN, MRP, RM, JJ), pp. 442–447.
DAC-2003-PomeranzR #detection #on the #testing: On test data compression and n-detection test sets (IP, SMR), pp. 748–751.
DAC-2003-ReshadiMD #flexibility #performance #set #simulation: Instruction set compiled simulation: a technique for fast and flexible instruction set simulation (MR, PM, NDD), pp. 758–763.
DATE-2003-GoelB #analysis #functional #reachability #set: Set Manipulation with Boolean Functional Vectors for Symbolic Reachability Analysis (AG, REB), pp. 10816–10821.
DATE-2003-MoraesMPMC #configuration management #development: Development of a Tool-Set for Remote and Partial Reconfiguration of FPGAs (FGM, DM, JCSP, LM, NLVC), pp. 11122–11123.
DATE-2003-RemondB #design #set: Set Top Box SoC Design Methodology at STMicroelectronics (FR, PB), pp. 20220–20223.
DATE-2003-SchnerrHR #agile #prototype #set: Instruction Set Emulation for Rapid Prototyping of SoCs (JS, GH, WR), pp. 10562–10569.
DocEng-2003-ChenT #xml: Set-at-a-time access to XML through DOM (HC, FWT), pp. 225–233.
DRR-2003-MaderlechnerS #recognition #set #using: Extraction of valid data sets in registers using recognition of invalidation lines (GM, PS), pp. 67–72.
HT-2003-Obendorf #case study #comparative: Simplifying annotation support for real-world-settings: a comparative study of active reading (HO), pp. 120–121.
ICDAR-2003-BaldiMS #classification #set #using: Using tree-grammars for training set expansion in page classification (SB, SM, GS), pp. 829–833.
ICDAR-2003-VelekN #classification #online #performance #recognition #scalability #set: Enhancing Efficiency and Speed of an Off-line Classifier Employed for On-line Handwriting Recognition of a Large Character Set (OV, MN), pp. 784–788.
ICDAR-2003-YangVN #recognition #scalability #set #using: Accelerating Large Character Set Recognition using Pivots (YY, OV, MN), pp. 262–267.
PODS-2003-Behrend #database #deduction #evaluation #query #set: Soft stratification for magic set based query evaluation in deductive databases (AB), pp. 102–110.
PODS-2003-MendelzonP #set: Concise descriptions of subsets of structured sets (AOM, KQP), pp. 123–133.
SIGMOD-2003-GangulyGR #set: Processing Set Expressions over Continuous Update Streams (SG, MNG, RR), pp. 265–276.
SIGMOD-2003-KriegelBKPS #set #similarity #using: Using Sets of Feature Vectors for Similarity Search on Voxelized CAD Objects (HPK, SB, PK, MP, MS), pp. 587–598.
SIGMOD-2003-Mamoulis #performance: Efficient Processing of Joins on Set-valued Attributes (NM), pp. 157–168.
VLDB-2003-LimWV #adaptation #named #self #set: SASH: A Self-Adaptive Histogram Set for Dynamically Changing Workloads (LL, MW, JSV), pp. 369–380.
TACAS-2003-HermannsJ #analysis #component #dependence #performance #set: A Set of Performance and Dependability Analysis Components for CADP (HH, CJ), pp. 425–430.
PLDI-2003-XieMM #scalability: Compile-time dynamic voltage scaling settings: opportunities and limits (FX, MM, SM), pp. 49–62.
STOC-2003-AlonAA #online #problem #set: The online set cover problem (NA, BA, YA, NB, JN), pp. 100–105.
STOC-2003-Ben-SassonSVW #testing: Randomness-efficient low degree tests and short PCPs via epsilon-biased sets (EBS, MS, SPV, AW), pp. 612–621.
STOC-2003-MorrisP #evolution #mixin #set: Evolving sets and mixin (BM, YP), pp. 279–286.
STOC-2003-RettingerW #complexity #set: The computational complexity of some julia sets (RR, KW), pp. 177–185.
DLT-2003-Gecseg #automaton #set: Comments on Complete Sets of Tree Automata (FG), pp. 22–34.
DLT-2003-Giammarresi #bound #set: Computing Languages by (Bounded) Local Sets (DG), pp. 304–315.
DLT-2003-Plandowski #product line #scalability #testing: Test Sets for Large Families of Languages (WP), pp. 75–94.
ICEIS-v2-2003-HassanienA #algorithm #classification #image #performance #retrieval #set: An Efficient Classification and Image Retrieval Algorithm Based on Rough Set Theory (AEH, JMHA), pp. 457–460.
ICEIS-v2-2003-KrolikowskiMP #data mining #mining #query: Set-Oriented Indexes for Data Mining Queries (ZK, MM, JP), pp. 316–323.
ICEIS-v2-2003-SrikumarB #algorithm #mining #set #transaction: An Algorithm for Mining Maximal Frequent Sets Based on Dominancy of Transactions (KS, BB), pp. 422–425.
ICEIS-v4-2003-LimaCPFSY #component #interactive #named #set #towards #web: Archcollect: A Set of Components Towards Web Users’ Interactions (JdCL, TGdSC, RMP, JCF, JBMS, ETY), pp. 308–316.
ICML-2003-KondorJ #kernel #set: A Kernel Between Sets of Vectors (RK, TJ), pp. 361–368.
ICML-2003-MarchandSSS #set: The Set Covering Machine with Data-Dependent Half-Spaces (MM, MS, JST, MS), pp. 520–527.
KDD-2003-Houle #clustering #navigation #set: Navigating massive data sets via local clustering (MEH), pp. 547–552.
KDD-2003-YuYH #clustering #scalability #set #using: Classifying large data sets using SVMs with hierarchical clusters (HY, JY, JH), pp. 306–315.
MLDM-2003-DehmeshkiKC #rule-based #set: A Rule-Based Scheme for Filtering Examples from Majority Class in an Imbalanced Training Set (JD, MK, MVC), pp. 215–223.
MLDM-2003-ImiyaTOH #bound #detection #random #set: Detecting the Boundary Curve of Planar Random Point Set (AI, KT, HO, VH), pp. 413–424.
SEKE-2003-SuzukiT #information management #set #web: Path Set Operations for Clipping of Parts of Web Pages and Information Extraction from Web pages (TS, TT), pp. 547–554.
SIGIR-2003-BawaMR #named #segmentation #set #topic: SETS: search enhanced by topic segmentation (MB, GSM, PR), pp. 306–313.
PPDP-2003-PaluDPR #constraints #finite #set: Integrating finite domain constraints and CLP with sets (ADP, AD, EP, GR), pp. 219–229.
PADL-2003-ErdemLNR #programming #set #using: Reconstructing the Evolutionary History of Indo-European Languages Using Answer Set Programming (EE, VL, LN, DR), pp. 160–176.
RE-2003-LiuYM #analysis #privacy #requirements #security #social: Security and Privacy Requirements Analysis within a Social Setting (LL, ESKY, JM), pp. 151–161.
SAC-2003-FrumentoBG #community #design #web: Echo-Cardiography on the Web: Design and Set-Up of a Virtual Community of Experts (EF, EB, LG), pp. 240–245.
SAC-2003-XuKTONOS #biology #database #set #tool support: Pathways Database System: An Integrated Set of Tools for Biological Pathways (WX, LK, MT, GÖ, JHN, ZMÖ, GS), pp. 96–102.
ESEC-FSE-2003-EshuisBDGR #modelling #named #performance #set #validation: EFFICIENT: a tool set for supporting the modelling and validation of ebXML (RE, PB, ED, BG, SR), pp. 359–362.
ICSE-2003-ChaysD #database #relational #testing: Demonstration of AGENDA Tool Set for Testing Relational Database Applications (DC, YD), pp. 802–803.
PPoPP-2003-Kazar #data mining #mining #performance #scalability: High performance spatial data mining for very large data-sets (BMK), p. 1.
CSL-2003-Miquel #normalisation #set: A Strongly Normalising Curry-Howard Correspondence for IZF Set Theory (AM), pp. 441–454.
ICLP-2003-DovierPR #set: Intensional Sets in CLP (AD, EP, GR), pp. 284–299.
ICLP-2003-ErdoganL #programming #set: Definitions in Answer Set Programming: (Extended Abstract) (STE, VL), pp. 483–484.
ICLP-2003-LoncT #modelling #set: Computing Minimal Models, Stable Models, and Answer Sets (ZL, MT), pp. 209–223.
ICLP-2003-SonP #set: Adding Preferences to Answer Set Planning (TCS, EP), pp. 513–514.
ICLP-2003-ZhaoL #case study #programming #set #source code: Answer Set Programming Phase Transition: A Study on Randomly Generated Programs (YZ, FL), pp. 239–253.
SAT-2003-Bruni #fault #satisfiability #scalability #set: Solving Error Correction for Large Data Sets by Means of a SAT Solver (RB), pp. 229–241.
DAC-2002-IonescuDMBG #hybrid #towards: Few electron devices: towards hybrid CMOS-SET integrated circuits (AMI, MJD, SM, KB, JG), pp. 88–93.
DAC-2002-NohlBSLMH #architecture #flexibility #performance #simulation: A universal technique for fast and flexible instruction-set architecture simulation (AN, GB, OS, RL, HM, AH), pp. 22–27.
DATE-2002-LeeCDGM #algorithm #detection #fault #multi #testing: A New ATPG Algorithm to Limit Test Set Size and Achieve Multiple Detections of All Faults (SL, BC, JD, MRG, MRM), pp. 94–99.
DATE-2002-PomeranzR #fault #multi #set #using: Test Enrichment for Path Delay Faults Using Multiple Sets of Target Faults (IP, SMR), pp. 722–729.
DATE-2002-PozziVI #automation #embedded #identification: Automatic Topology-Based Identification of Instruction-Set Extensions for Embedded Processors (LP, MV, PI), p. 1138.
DATE-2002-SchwenckerSPG #adaptation #parametricity #set #using #worst-case: Analog Circuit Sizing Using Adaptive Worst-Case Parameter Sets (RS, FS, MP, HEG), pp. 581–585.
DATE-2002-ZhaoMB #compilation #design #modelling #set #using: Practical Instruction Set Design and Compiler Retargetability Using Static Resource Models (QZ, BM, TB), pp. 1021–1026.
SIGMOD-2002-RundensteinerWYD #data analysis #interactive #named #set #visual notation: XmdvTool: visual interactive data exploration and trend discovery of high-dimensional data sets (EAR, MOW, JY, PRD), p. 631.
SIGMOD-2002-WangWYY #clustering #scalability #set #similarity: Clustering by pattern similarity in large data sets (HW, WW, JY, PSY), pp. 394–405.
ITiCSE-2002-AlmBEOS #c# #exclamation #set: You’d better set down for this!: creating a set type for CS1 & CS2 in C# (JA, RB, SE, CDO, AS), pp. 14–18.
ITiCSE-2002-Scott #named #set: MISC: the minimal instruction set computer (KS), p. 223.
ESOP-2002-HirschowitzL #call-by #mixin: Mixin Modules in a Call-by-Value Setting (TH, XL), pp. 6–20.
SCAM-J-2001-AndersonBRT02 #points-to #set: Flow insensitive points-to sets (PA, DB, GR, TT), pp. 743–754.
STOC-2002-BadoiuHI #approximate #clustering: Approximate clustering via core-sets (MB, SHP, PI), pp. 250–257.
CIAA-2002-Daciuk #algorithm #automaton #comparison #finite #set #string: Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings (JD), pp. 255–261.
DLT-2002-Holub #set #similarity: A Unique Structure of Two-Generated Binary Equality Sets (SH), pp. 245–257.
DLT-2002-Kaszonyi #on the: On the Structure of Graphic DLI-Sets (LK), pp. 349–356.
ICALP-2002-Brattka #random #recursion #set: Random Numbers and an Incomplete Immune Recursive Set (VB), pp. 950–961.
ICALP-2002-Nisan #approximate #communication #complexity #set: The Communication Complexity of Approximate Set Packing and Covering (NN), pp. 868–875.
CHI-2002-SnowdonG #experience #learning: Diffusing information in organizational settings: learning from experience (DS, AG), pp. 331–338.
AdaEurope-2002-YuL #empirical #testing: Prioritization of Test Cases in MUMCUT Test Sets: An Empirical Study (YTY, MFL), pp. 245–256.
CIKM-2002-OrdonezO #clustering #named #performance #robust #scalability #set: FREM: fast and robust EM clustering for large data sets (CO, EO), pp. 590–599.
CIKM-2002-TangZ #set: An iterative strategy for pattern discovery in high-dimensional data sets (CT, AZ), pp. 10–17.
ICML-2002-Langford #bound #testing: Combining Trainig Set and Test Set Bounds (JL), pp. 331–338.
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.
ICPR-v1-2002-HoBG #3d #automation #contest #evolution #segmentation: Level-Set Evolution with Region Competition: Automatic 3-D Segmentation of Brain Tumors (SH, EB, GG), p. 532–?.
ICPR-v1-2002-PhillipsSRGB #algorithm #challenge #identification #problem #set: The Gait Identification Challenge Problem: Data Sets and Baseline Algorithm (PJP, SS, IRV, PG, KWB), pp. 385–388.
ICPR-v2-2002-BarataP #classification #clustering #modelling #set #using: Improving Classification Rates by Modelling the Clusters of Trainings Sets in Features Space Using Mathematical Morphology Operators (TB, PP), pp. 328–331.
ICPR-v2-2002-CarcassoniH #multi #scalability #using: Point-Set Alignment Using Multidimensional Scaling (MC, ERH), pp. 402–405.
ICPR-v2-2002-RonnebergerBS #3d #classification #invariant #recognition #set #using: General-Purpose Object Recognition in 3D Volume Data Sets Using Gray-Scale Invariants --- Classification of Airborne Pollen-Grains Recorded with a Confocal Laser Scanning Microscope (OR, HB, ES), p. 290–?.
ICPR-v2-2002-XiaoAX #optimisation #set: Pair-Wise Sequential Reduced Set for Optimization of Support Vector Machines (XX, HA, GX), pp. 860–863.
ICPR-v3-2002-LiZL #set: A New Strategy for Selecting Working Sets Applied in SMO (JL, BZ, FL), pp. 427–430.
ICPR-v3-2002-ZhouK #representation #set #using: Representing and Recognizing Complete Set of Geons Using Extended Superquadrics (LZ, CK), pp. 713–718.
ICPR-v4-2002-BarataP02a #classification #clustering #modelling #set #using: Improving Classification Rates by Modelling the Clusters of Trainings Sets in Features Space Using Mathematical Morphology Operators (TB, PP), pp. 90–93.
KDD-2002-CohenR #clustering #integration #learning #scalability #set: Learning to match and cluster large high-dimensional data sets for data integration (WWC, JR), pp. 475–480.
KDD-2002-Frigui #approach #clustering #identification #named #performance #scalability #set: SyMP: an efficient clustering approach to identify clusters of arbitrary shapes in large data sets (HF), pp. 507–512.
KDD-2002-LiTS #classification #robust #set: Construct robust rule sets for classification (JL, RWT, HS), pp. 564–569.
KDD-2002-LiuPWH #mining #set: Mining frequent item sets by opportunistic projection (JL, YP, KW, JH), pp. 229–238.
KDD-2002-TuzhilinL #multi #query #set: Querying multiple sets of discovered rules (AT, BL), pp. 52–60.
KR-2002-PintoM #distributed #evolution #ontology: Evolving Ontologies in Distributed and Dynamic Settings (HSANPP, JPM), pp. 365–374.
SEKE-2002-BalzarottiGM #configuration management #peer-to-peer: Supporting configuration management for virtual workgroups ini a peer-to-peer setting (DB, CG, MM), pp. 507–511.
SIGIR-2002-Kawatani #categorisation #difference #documentation #set #topic: Topic difference factor extraction between two document sets and its application to text categorization (TK), pp. 137–144.
SIGIR-2002-PossasZMR #approach #information retrieval: Set-based model: a new approach for information retrieval (BP, NZ, WMJ, BARN), pp. 230–237.
SIGIR-2002-VoorheesB #empirical #fault #retrieval #set #topic: The effect of topic set size on retrieval experiment error (EMV, CB), pp. 316–323.
PADL-2002-GallagherP #abstract interpretation #analysis #automaton #finite #logic programming #nondeterminism #source code: Abstract Interpretation over Non-deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs (JPG, GP), pp. 243–261.
SAC-2002-Baptista #design #implementation #multi #set: A geolibrary for multimedia data sets: design and implementation issues (CdSB), pp. 488–492.
SAC-2002-ButenkoPSSS #graph #independence #set: Finding maximum independent sets in graphs arising from coding theory (SB, PMP, IS, VS, PS), pp. 542–546.
SAC-2002-Dandashi #automation #metric #object-oriented #reuse #set #using: A method for assessing the reusability of object-oriented code using a validated set of automated measurements (FD), pp. 997–1003.
SAC-2002-JulstromR #algorithm #robust #set: Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges (BAJ, GRR), pp. 547–552.
OSDI-2002-FlautnerM #automation #linux #named: Vertigo: Automatic Performance-Setting for Linux (KF, TNM), pp. 105–116.
CADE-2002-Brown #higher-order #proving #set #theorem proving: Solving for Set Variables in Higher-Order Theorem Proving (CEB), pp. 408–422.
CADE-2002-Goldberg #satisfiability #testing: Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points (EG), pp. 161–180.
CSL-2002-Goubault-Larrecq #constraints #higher-order #set: Higher-Order Positive Set Constraints (JGL), pp. 473–489.
ICLP-2002-DimopoulosS #set #towards: Towards Local Search for Answer Sets (YD, AS), pp. 363–377.
LICS-2002-Simpson #modelling #recursion #set: Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory (AKS), pp. 287–298.
RTA-2002-CharatonikT #constraints #set: Atomic Set Constraints with Projection (WC, JMT), pp. 311–325.
RTA-2002-RetyV #set: Regular Sets of Descendants by Some Rewrite Strategies (PR, JV), pp. 129–143.
SAT-2002-Goldberg #satisfiability #testing: Testing satisfiability of CNF formulas by computing a stable set of points (EG), p. 12.
DAC-2001-WangKMR #hardware #set: Hardware/Software Instruction Set Configurability for System-on-Chip Processors (AW, EK, DEM, CR), pp. 184–188.
DATE-2001-ChiusanoCPW #on the #set: On applying the set covering model to reseeding (SC, SDC, PP, HJW), pp. 156–161.
DocEng-2001-McKechnieSL #case study #documentation #industrial #scalability #set: Computer assisted processing of large unstructured document sets: a case study in the construction industry (JM, SS, SL), pp. 11–17.
ICDAR-2001-FreitasBS #approach #recognition #set #validation #word: Handwritten Isolated Word Recognition: An Approach Based on Mutual Information for Feature Set Validation (COdAF, FB, RS), pp. 665–669.
ICDAR-2001-GatosP #image #performance #segmentation #set: Applying Fast Segmentation Techniques at a Binary Image Represented by a Set of Non-Overlapping Blocks (BG, NP), pp. 1147–1153.
ICDAR-2001-GomesL #feature model #fuzzy #recognition #set: Feature Extraction Based on Fuzzy Set Theory for Handwriting Recognition (NRG, LLL), pp. 655–659.
ICDAR-2001-VuoriLOK #online #prototype #recognition #set: Speeding Up On-line Recognition of Handwritten Characters by Pruning the Prototype Set (VV, JL, EO, JK), pp. 501–507.
ICDAR-2001-WangCFZ #normalisation #recognition #set: Match Between Normalization Schemes and Feature Sets for Handwritten Chinese Character Recognition (QW, ZC, DDF, RZ), pp. 551–555.
VLDB-2001-StanoiRAA #database #set: Discovery of Influence Sets in Frequently Updated Databases (IS, MR, DA, AEA), pp. 99–108.
PASTE-2001-MockDCE #analysis #comparison #comprehension #optimisation #points-to #set: Dynamic points-to sets: a comparison with static analyses and potential applications in program understanding and optimization (MM, MD, CC, SJE), pp. 66–72.
SCAM-2001-AndersonBRT #points-to #set: Flow Insensitive Points-To Sets (PA, DB, GR, TT), pp. 81–91.
STOC-2001-KlauckNTZ #communication #complexity #interactive #quantum #set: Interaction in quantum communication and the complexity of set disjointness (HK, AN, ATS, DZ), pp. 124–133.
FLOPS-J2-1998-Hinze01 #axiom #functional #implementation #prolog: Prolog’s Control Constructs in a Functional Setting — Axioms and Implementation (RH), pp. 125–170.
DLT-2001-Kuske #axiom #set: Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable (DK), pp. 206–216.
ICALP-2001-ComonCM #automaton #constraints #memory management #protocol #set: Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols (HC, VC, JM), pp. 682–693.
ICALP-2001-Maier #framework #reasoning: A Set-Theoretic Framework for Assume-Guarantee Reasoning (PM), pp. 821–834.
ICEIS-v1-2001-SoonthornphisajK #algorithm #categorisation #problem #set #using #web: The Effects of Differnet Feature Sets on the Web Page Categorization Problem Using the Iterative Cross-Training Algorithm (NS, BK), pp. 404–410.
CIKM-2001-Couchot #analysis #composition #set #termination: Termination Analysis of Active Rules Modular Sets (AC), pp. 326–333.
CIKM-2001-MarcusML #fault #identification #set: Ordinal Association Rules for Error Identification in Data Sets (AM, JIM, KIL), pp. 589–591.
CIKM-2001-ToutanovaCPH #classification #set: Text Classification in a Hierarchical Mixture Model for Small Training Sets (KT, FC, KP, TH), pp. 105–112.
ICML-2001-MarchandS #learning #set: Learning with the Set Covering Machine (MM, JST), pp. 345–352.
ICML-2001-PerkinsB #learning #set: Lyapunov-Constrained Action Sets for Reinforcement Learning (TJP, AGB), pp. 409–416.
KDD-2001-AggarwalP #concept #mining #re-engineering #semistructured data #set: Mining massively incomplete data sets by conceptual reconstruction (CCA, SP), pp. 227–232.
KDD-2001-DittrichS #algorithm #mining #named #scalability #set: GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces (JPD, BS), pp. 47–56.
KDD-2001-LiuHM01a #set: Discovering the set of fundamental rule changes (BL, WH, YM), pp. 335–340.
KDD-2001-Morimoto #database #mining #set: Mining frequent neighboring class sets in spatial databases (YM), pp. 353–358.
SEKE-2001-Basili #concept #experience #implementation #set: Implementing the Experience Factory concepts as a set of Experience Bases (VRB), pp. 102–109.
LOPSTR-2001-FioravantiPP #infinity #process #program transformation #set #using #verification: Verification of Sets of Infinite State Processes Using Program Transformation (FF, AP, MP), pp. 111–128.
LOPSTR-2001-OsorioNA #equivalence #programming #set: Equivalence in Answer Set Programming (MO, JANP, JA), pp. 57–75.
PADL-2001-PontelliE #optimisation #parallel #programming #set: Construction and Optimization of a Parallel Engine for Answer Set Programming (EP, OEK), pp. 288–303.
ICSE-2001-Shepard #performance #set #source code: An Efficient Set of Software Degree Programs for One Domain (TS), pp. 623–632.
CAV-2001-CoptyFFGKTV #bound #industrial #model checking: Benefits of Bounded Model Checking at an Industrial Setting (FC, LF, RF, EG, GK, AT, MYV), pp. 436–453.
IJCAR-2001-AngerKL #logic programming #reasoning #semantics #set #source code: NoMoRe : A System for Non-monotonic Reasoning with Logic Programs under Answer Set Semantics (CA, KK, TL), pp. 325–330.
IJCAR-2001-FormisanoOT #equation: Instructing Equational Set-Reasoning with Otter (AF, EGO, MT), pp. 152–167.
IJCAR-2001-Lucke #named #set: Hilberticus — A Tool Deciding an Elementary Sublanguage of Set Theory (JL), pp. 690–695.
IJCAR-2001-Paulson #proving #set: SET Cardholder Registration: The Secrecy Proofs (LCP), pp. 5–12.
SIGMOD-2000-KornM #nearest neighbour #query #set: Influence Sets Based on Reverse Nearest Neighbor Queries (FK, SM), pp. 201–212.
SIGMOD-2000-RamaswamyRS #algorithm #mining #performance #scalability #set: Efficient Algorithms for Mining Outliers from Large Data Sets (SR, RR, KS), pp. 427–438.
VLDB-2000-KoudasIM #identification #roadmap #set #sketching #using: Identifying Representative Trends in Massive Time Series Data Sets Using Sketches (PI, NK, SM), pp. 363–372.
VLDB-2000-RamasamyPNK #set: Set Containment Joins: The Good, The Bad and The Ugly (KR, JMP, JFN, RK), pp. 351–362.
ESOP-2000-Mauborgne #infinity #representation #set: Improving the Representation of Infinite Trees to Deal with Sets of Trees (LM), pp. 275–289.
TACAS-2000-DelzannoR #representation #set: Symbolic Representation of Upward-Closed Sets (GD, JFR), pp. 426–440.
CSMR-2000-AntoniolCCL #case study #identification #maintenance #set: Identifying the Starting Impact Set of a Maintenance Request: A Case Study (GA, GC, GC, ADL), pp. 227–230.
PLDI-2000-LarsenA #parallel #set: Exploiting superword level parallelism with multimedia instruction sets (SL, SPA), pp. 145–156.
STOC-2000-Achlioptas #bound #random #satisfiability: Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract) (DA), pp. 28–37.
STOC-2000-DamMMS #fault tolerance #quantum #self #set: Self-testing of universal and fault-tolerant sets of quantum gates (WvD, FM, MM, MS), pp. 688–696.
CIAA-2000-Wareham #automaton #complexity #composition #finite #set: The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata (TW), pp. 302–310.
ICALP-2000-KarhumakiP #finite #on the #set: On the Centralizer of a Finite Set (JK, IP), pp. 536–546.
ICALP-2000-KumarAR #set: Hardness of Set Cover with Intersection 1 (VSAK, SA, HR), pp. 624–635.
AdaEurope-2000-ChenL #on the #set: On the Minimal Essential Subsets and Minimal Representative Sets (TYC, MFL), pp. 291–301.
CIKM-2000-FerhatosmanogluTAA #approximate #set: Vector Approximation based Indexing for Non-uniform High Dimensional Data Sets (HF, ET, DA, AEA), pp. 202–209.
CIKM-2000-Yang #3d #named #relational #scalability #set: n23Tool: a Tool for Exploring Large Relational Data Sets Through 3D Dynamic Projections (LY), pp. 322–327.
ICML-2000-KimN #learning #network #set: Learning Bayesian Networks for Diverse and Varying numbers of Evidence Sets (ZWK, RN), pp. 479–486.
ICML-2000-KomarekM #adaptation #machine learning #performance #scalability #set: A Dynamic Adaptation of AD-trees for Efficient Machine Learning on Large Data Sets (PK, AWM), pp. 495–502.
ICML-2000-SlatteryM #relational #testing: Discovering Test Set Regularities in Relational Domains (SS, TMM), pp. 895–902.
ICPR-v1-2000-BaillardHB #3d #segmentation #set: Cooperation between Level Set Techniques and Dense 3D Registration for the Segmentation of Brain Structures (CB, PH, CB), pp. 1991–1994.
ICPR-v1-2000-WilliamsB #algorithm #evaluation #multi #novel #set: Evaluation of a Novel Multiple Point Set Registration Algorithm (JAW, MB), pp. 5007–5010.
ICPR-v1-2000-WolfSW #3d #set: Join Tensors: On 3D-to-3D Alignment of Dynamic Sets (LW, AS, YW), pp. 1388–1391.
ICPR-v2-2000-HolzL #set #using #validation: Validation of Relative Feature Importance Using a Natural Data Set (HJH, MHL), pp. 2414–2417.
ICPR-v2-2000-MelkemiVC #set: Shapes of Weighted Points Sets (MM, DV, LC), pp. 6058–6061.
ICPR-v2-2000-VarstaHMM #human-computer #interface #performance #set: Evaluating the Performance of Three Feature Sets for Brain-Computer Interfaces with an Early Stopping MLP Committee (MV, JH, JdRM, JM), pp. 2907–2910.
ICPR-v3-2000-Jehan-BessonBA #detection #set #using: Detection and Tracking of Moving Objects using a New Level Set Based Method (SJB, MB, GA), pp. 7112–7117.
ICPR-v3-2000-PetrosinoC #clustering #fuzzy #parallel #set: Unsupervised Texture Discrimination Based on Rough Fuzzy Sets and Parallel Hierarchical Clustering (AP, MC), pp. 7100–7103.
KDD-2000-Bay #mining #multi #set: Multivariate discretization of continuous variables for set mining (SDB), pp. 315–319.
KDD-2000-McCallumNU #clustering #performance #set: Efficient clustering of high-dimensional data sets with application to reference matching (AM, KN, LHU), pp. 169–178.
KDD-2000-PadmanabhanT #set: Small is beautiful: discovering the minimal set of unexpected patterns (BP, AT), pp. 54–63.
TOOLS-PACIFIC-2000-NguyenZA #approach #modelling #set: A Set Approach to Role Modeling (LTN, LZ, BA), pp. 158–169.
TOOLS-USA-2000-BirngruberH #set #specification #using: Using Plans for Specifying Preconfigured Bean Sets (DB, MH), pp. 217–226.
POPL-2000-CharatonikPT #program analysis: Paths vs. Trees in Set-Based Program Analysis (WC, AP, JMT), pp. 330–337.
ICRE-2000-Ferdinandi #set: The Requirement Set (PF), p. 63.
ICSE-2000-MarcaP #approach #internet #re-engineering #set: A software engineering approach and tool set for developing Internet applications (DAM, BAP), pp. 738–741.
SPLC-2000-HeinSV #feature model #industrial #modelling: Applying feature models in industrial settings (AH, MS, RVM), pp. 47–70.
SPLC-2000-Morisawa #distributed #product line #set: A computing model of product lines for distributed processing systems, its product sets, and its applications (YM), pp. 371–394.
LCTES-2000-BairagiPA #embedded #framework #quality #set: A Framework for Enhancing Code Quality in Limited Register Set Embedded Processors (DB, SP, DPA), pp. 81–95.
CL-2000-AzevedoB #constraints #modelling #problem #set: Modelling Digital Circuits Problems with Set Constraints (FA, PB), pp. 414–428.
CL-2000-DuchierN #constraints #set: Dominance Constraints with Set Operators (DD, JN), pp. 326–341.
CL-2000-LaceyRS #higher-order #logic programming #synthesis: Logic Program Synthesis in a Higher-Order Setting (DL, JR, AS), pp. 87–100.
CL-2000-MoinardR #finite #set: Smallest Equivalent Sets for Finite Propositional Formula Circumscription (YM, RR), pp. 897–911.
LICS-2000-Krivine #set: The Curry-Howard Correspondence in Set Theory (JLK), pp. 307–308.
DAC-1999-Fisher #embedded: Customized Instruction-Sets for Embedded Processors (JAF), pp. 253–257.
ICDAR-1999-Phillips #how #image #set: How to Extend and Bootstrap an Existing Data Set with Real-life Degraded Images (ITP), pp. 689–692.
SIGMOD-1999-LakshmananNHP #constraints #optimisation #query #set: Optimization of Constrained Frequent Set Queries with 2-variable Constraints (LVSL, RTN, JH, AP), pp. 157–168.
SIGMOD-1999-NgLHM #mining #query #set: Exploratory Mining via Constrained Frequent Set Queries (RTN, LVSL, JH, TM), pp. 556–558.
VLDB-1999-IoannidisP #approximate: Histogram-Based Approximation of Set-Valued Query-Answers (YEI, VP), pp. 174–185.
ESOP-1999-PodelskiCM #analysis #concurrent #constraints #logic programming #source code: Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs (AP, WC, MM), pp. 177–192.
FoSSaCS-1999-DantsinV #algorithm #nondeterminism #polynomial #set #unification: A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees (ED, AV), pp. 180–196.
CSMR-1999-GranjaJ #testing: Techniques for Regression Testing: Selecting Test Case Sets Tailored to Possibly Modified Functionalities (IG, MJ), pp. 2–13.
CSMR-1999-TaschwerRM #c #generative: Generating Objects from C Code — Features of the CORET Tool-Set (MT, DRR, RM), pp. 91–101.
CSMR-1999-Tonella #analysis #points-to #set: Effects of Different Flow Insensitive Points-to Analyses on DEF/USE Sets (PT), pp. 62–71.
STOC-1999-GoelHPT #data transfer #network #problem #scheduling #set: Scheduling Data Transfers in a Network and the Set Scheduling Problem (AG, MRH, SAP, ÉT), pp. 189–197.
ICALP-1999-AndreevBCR #bound #branch #pseudo #set #source code: Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs (AEA, JLB, AEFC, JDPR), pp. 179–189.
ICALP-1999-Sanders #multi #sequence #set: Accessing Multiple Sequences Through Set Associative Caches (PS), pp. 655–664.
FM-v1-1999-WongC #case study #formal method #modelling: Formal Modeling in a Commercial Setting: A Case Study (AW, MC), pp. 590–607.
HCI-EI-1999-HsuW #comparison: The Comparison of Preferred Settings between PC and CAD Workstation (WHH, MJW), pp. 36–40.
KDD-1999-BayP #category theory #data mining #detection #mining #set: Detecting Change in Categorical Data: Mining Contrast Sets (SDB, MJP), pp. 302–306.
KDD-T-1999-KeimH #clustering #scalability #set: Clustering Techniques for Large Data Sets — from the Past to the Future (DAK, AH), pp. 141–181.
TOOLS-USA-1999-PeriyasamyL #metric #object-oriented #source code #testing: A New Metrics Set for Evaluating Testing Efforts for Object-Oriented Programs (KP, XL), pp. 84–93.
RE-1999-Crawford #concept: Advancing Business Concepts in a JAD Workshop Setting (TC), p. 31–?.
HPDC-1999-LeighJDBG #analysis #collaboration #set: A Methodology for Supporting Collaborative Exploratory Analysis of Massive Data Sets in Tele-Immersive Environments (JL, AEJ, TAD, SB, RLG), pp. 62–69.
CSL-1999-Bonelli #using: Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn Setting (EB), pp. 204–219.
ICLP-1999-CaseauJL #algorithm #named #set: CLAIRE: Combining Sets, Search, and Rules to Better Express Algorithms (YC, FXJ, FL), pp. 245–259.
ICLP-1999-Lifschitz #set: Answer Set Planning (VL), pp. 23–37.
LICS-1999-AtseriasK #finite #first-order #fixpoint #logic #set: First-Order Logic vs. Fixed-Point Logic in Finite Set Theory (AA, PGK), pp. 275–284.
LICS-1999-NiehrenMT #constraints #set: Entailment of Atomic Set Constraints is PSPACE-Complete (JN, MM, JMT), pp. 285–294.
RTA-1999-HofbauerH #testing: Test Sets for the Universal and Existential Closure of Regular Tree Languages (DH, MH), pp. 205–219.
VLDB-1998-BraumandlCK #database #functional #object-oriented #set: Evaluating Functional Joins Along Nested Reference Sets in Object-Relational and Object-Oriented Databases (RB, JC, AK), pp. 110–122.
TACAS-1998-CharatonikP #analysis #infinity: Set-Based Analysis of Reactive Infinite-State Systems (WC, AP), pp. 358–375.
WRLA-1998-MatsumotoF #automation #behaviour #induction #testing #towards #verification: Test set coinduction — Toward automated verification of behavioural properties (MM, KF), pp. 242–262.
PLDI-1998-AdveM #integer #optimisation #program analysis #set #using: Using Integer Sets for Data-Parallel Program Analysis and Optimization (VSA, JMMC), pp. 186–198.
SAS-1998-GiacobazziRS #abstract interpretation #linear: Building Complete Abstract Interpretations in a Linear Logic-based Setting (RG, FR, FS), pp. 215–229.
SAS-1998-HillBZ #correctness: The Correctness of Set-Sharing (PMH, RB, EZ), pp. 99–114.
STOC-1998-HuangR #algebra #approach #black box #composition #problem #set: A Black Box Approach to the Algebraic Set Decomposition Problem (MDAH, AJR), pp. 497–506.
STOC-1998-Vorobjov #algebra #set: Computing Local Dimension of a Semialgebraic Set (NV), pp. 483–487.
FLOPS-1998-Hinze #axiom #functional #implementation #prolog: Prological Features in a Functional Setting Axioms and Implementation (RH), pp. 98–122.
ICALP-1998-Telle #constraints #independence #set: Independent Sets with Domination Constraints (MMH, JK, JAT), pp. 176–187.
WIA-1998-Augros #automaton #finite #infinity #set #word: Automata to Recognize Finite and Infinite Words with at Least Two Factorizations on a Given Finite Set (XA), pp. 220–225.
FM-1998-BogdanovHS #automation #generative #testing: Automated Test Set Generation for Statecharts (KB, MH, HS), pp. 107–121.
CHI-1998-AbowdABEGL #education #integration #problem #ubiquitous: Investigating the Capture, Integration and Access Problem of Ubiquitous Computing in an Educational Setting (GDA, CGA, JAB, TE, PG, JL), pp. 440–447.
CSCW-1998-HouseBS #information management #set #trust: Cooperative Knowledge Work and Practices of Trust: Sharing Environmental Planning Data Sets (NAVH, MHB, LRS), pp. 335–343.
CAiSE-1998-Lam #analysis #development #reuse: Change Analysis and Management in a Reuse-Oriented Software Development Setting (WL), pp. 219–236.
CIKM-1998-JacobsonKSS #set: Focusing Search in Hierarchical Structures with Directory Sets (GJ, BK, DS, DS), pp. 1–9.
ICML-1998-FrankW #generative #optimisation #set: Generating Accurate Rule Sets Without Global Optimization (EF, IHW), pp. 144–151.
ICPR-1998-BhattacharyaK #nearest neighbour #set: Reference set thinning for the k-nearest neighbor decision rule (BKB, DK), pp. 238–242.
ICPR-1998-HerbstM #set: Building a representative training set based on eigenimages (BMH, NLM), pp. 1846–1848.
ICPR-1998-HuberM #adaptation #named #parallel #set: ERC — evolutionary resample and combine for adaptive parallel training data set selection (RH, HAM), pp. 882–885.
ICPR-1998-SuzukiKM #fuzzy #memory management #set #using: Associative memory system using fuzzy sets (YS, NK, JM), pp. 331–333.
ICPR-1998-TakacsSW #3d #design #recognition #set: Optimal training set design for 3D object recognition (BT, LS, HW), pp. 558–560.
ICPR-1998-YahiaB #segmentation #set: Segmentation of deformable templates with level sets characterized by particle systems (HMY, JPB), pp. 1421–1423.
KDD-1998-JohnsonD #set: Comparing Massive High-Dimensional Data Sets (TJ, TD), pp. 229–233.
KR-1998-BrewkaE #logic programming #set #source code: Preferred Answer Sets for Extended Logic Programs (GB, TE), pp. 86–97.
KR-1998-DuboisGPZ: Making Decision in a Qualitative Setting: from Decision under Uncertaintly to Case-based Decision (DD, LG, HP, AZ), pp. 594–607.
SIGIR-1998-LamH #automation #categorisation #set #using: Using a Generalized Instance Set for Automatic Text Categorization (WL, CYH), pp. 81–89.
ALP-PLILP-1998-CodishS #analysis #logic #set: The Boolean Logic of Set Sharing Analysis (MC, HS), pp. 89–101.
LOPSTR-1998-MalletD #database #debugging #deduction #named #relational: Myrtle: A Set-Oriented Meta-Interpreter Driven by a “Relational” Trace for Deductive Databases Debugging (SM, MD), pp. 328–330.
REFSQ-1998-LamSJ #requirements #set: Managing Requirements Change: A Set of Good Practices (WL, VS, SJ), pp. 85–97.
SAC-1998-ArapisKP #design #interactive #realtime: Design issues and alternatives for setting up real-time interactive Telelectures (CA, DK, TP), pp. 104–111.
SAC-1998-MachucaM #data mining #database #mining #precise #relational #set: Enhancing the exploitation of data mining in relational database systems via the rough sets theory including precision variables (FM, MM), pp. 70–73.
ISMM-1998-AzaguryKPY #how #set: Combining Card Marking with Remembered Sets: How to Save Scanning Time (AA, EKK, EP, ZY), pp. 10–19.
CADE-1998-OhtaIH #on the #testing: On the Relationship Between Non-Horn Magic Sets and Relevancy Testing (YO, KI, RH), pp. 333–348.
CSL-1998-Statman #morphism: Morphisms and Partitions of V-sets (RS), pp. 313–322.
JICSLP-1998-DevienneTT #constraints #set: Co-definite Set Constraints with Membership Expressions (PD, JMT, ST), pp. 25–39.
JICSLP-1998-DovierPRP #finite #on the #representation #set: On the Representation and Management of Finite Sets in CLP Languages (AD, CP, GR, EP), pp. 40–54.
RTA-1998-CharatonikP #constraints #set: Co-definite Set Constraints (WC, AP), pp. 211–225.
RTA-1998-Genet #approximate #decidability #normalisation #set: Decidable Approximations of Sets of Descendants and Sets of Normal Forms (TG), pp. 151–165.
DAC-1997-HadjiyiannisHD #named #set: ISDL: An Instruction Set Description Language for Retargetability (GH, SH, SD), pp. 299–302.
DAC-1997-Kurshan #verification: Formal Verification in a Commercial Setting (RPK), pp. 258–262.
DAC-1997-SentovichTB #optimisation #performance #set #using: Efficient Latch Optimization Using Exclusive Sets (ES, HT, GB), pp. 8–11.
EDTC-1997-ChoiH #estimation: Improving the accuracy of support-set finding method for power estimation of combinational circuits (HC, SHH), pp. 526–530.
EDTC-1997-Gonzalez-TorresMH #set: Full custom chip set for high speed serial communications up to 2.48 Gbit/s (JGT, PAM, JMH), p. 614.
EDTC-1997-LiemPJ #design #embedded #named: ReCode: the design and re-design of the instruction codes for embedded instruction-set processors (CL, PGP, AAJ), p. 612.
PODS-1997-GuchtDGV #algebra #database #decidability #on the #set: On the Decidability of Semi-Linearity of Semi-Algebraic Sets and Its Implications for Spatial Databases (FD, MG, LV, DVG), pp. 68–77.
VLDB-1997-HelmerM #algorithm #comparison #evaluation #in memory #memory management #set: Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates (SH, GM), pp. 386–395.
CSEET-1997-JaccheriL #modelling #process: Applying Software Process Modeling and Improvement in Academic Setting (MLJ, PL), pp. 13–27.
ITiCSE-1997-WolzP #collaboration #communication #education: Computer mediated communication in collaborative educational settings (panel) (UW, JP), p. 145.
ITiCSE-WGR-1997-WolzPACDKLMSW #collaboration #communication #education: Computer-mediated communication in collaborative educational settings (report of the ITiCSE 1997 working group on CMC in collaborative educational settings) (UW, JP, PA, ZC, JD, GK, AL, SM, RS, HMW), pp. 51–69.
PEPM-1997-MelskiR #constraints #context-free grammar #reachability #set: Interconveritibility of Set Constraints and Context-Free Language Reachability (DM, TWR), pp. 74–89.
PLDI-1997-FlanaganF #analysis #component: Componential Set-Based Analysis (CF, MF), pp. 235–248.
SAS-1997-BagnaraHZ: Set-Sharing is Redundant for Pair-Sharing (RB, PMH, EZ), pp. 53–67.
SAS-1997-FahndrichA #constraints #program analysis #set #using: Program Analysis Using Mixed Term and Set Constraints (MF, AA), pp. 114–126.
SAS-1997-TalbotTD #analysis #automaton #logic programming: Set-Based Analysis for Logic Programming and Tree Automata (JMT, ST, PD), pp. 127–140.
STOC-1997-AuerLS #approximate #learning #pseudo #set: Approximating Hyper-Rectangles: Learning and Pseudo-Random Sets (PA, PML, AS), pp. 314–323.
STOC-1997-DuhF #approximate #optimisation: Approximation of k-Set Cover by Semi-Local Optimization (RcD, MF), pp. 256–264.
DLT-1997-GecsegI #automaton #on the #set: On complete sets of tree automata (FG, BI), pp. 37–47.
ICALP-1997-BouajjaniH #analysis #reachability #set: Symbolic Reachability Analysis of FIFO Channel Systems with Nonregular Sets of Configurations (Extended Abstract) (AB, PH), pp. 560–570.
ICALP-1997-BroersmaKKM #graph #independence #set: Independent Sets in Asteroidal Triple-Free Graphs (HB, TK, DK, HM), pp. 760–770.
ICALP-1997-CartonP #set: The Wadge-Wagner Hierarchy of ω-Rational Sets (OC, DP), pp. 17–35.
ICALP-1997-Weihrauch #metric #probability #set: Computability on the Probability Measures on the Borel Sets of the Unit Interval (KW), pp. 166–176.
WIA-1997-LescowV #automaton #set: Minimal Separating Sets for Muller Automata (HL, JV), pp. 109–121.
WIA-1997-Ziadi #automaton #clustering #problem #set #sorting: Sorting and Doubling Techniques for Set Partitioning and Automata Minimization Problems (DZ), pp. 241–251.
FME-1997-CazierD #2d #set #term rewriting: Term Rewrite Systems to Derive Set Boolean Operations on 2D Objects (DC, JFD), pp. 605–623.
ICFP-1997-HeintzeM #analysis #complexity #on the: On the Complexity of Set-Based Analysis (NH, DAM), pp. 150–163.
ICFP-1997-RichardST #set #using: Intensional Sets Using Explicit Substitutions (GR, FS, ATA), p. 318.
HCI-CC-1997-CarstensenN #towards: Towards Computer Support for Cooperation in Time-Critical Work Settings (PHC, MN), pp. 101–104.
HCI-SEC-1997-HolmquistA #approach #scalability #set #visualisation: Flip Zooming: A Practical Focus+Context Approach to Visualizing Large Data Sets (LEH, CA), pp. 763–766.
AdaEurope-1997-Feldman #ada #set: An Ada 95 Sort Race Construction Set (MBF), pp. 23–34.
ICML-1997-KubatM #set: Addressing the Curse of Imbalanced Training Sets: One-Sided Selection (MK, SM), pp. 179–186.
ICML-1997-OatesJ #complexity #set: The Effects of Training Set Size on Decision Tree Complexity (TO, DJ), pp. 254–262.
KDD-1997-BrunkKK #data mining #mining #named: MineSet: An Integrated System for Data Mining (CB, JK, RK), pp. 135–138.
KDD-1997-EsterKSX #database #detection #set: Density-Connected Sets and their Application for Trend Detection in Spatial Databases (ME, HPK, JS, XX), pp. 10–15.
KDD-1997-SmythW #data analysis #set: Anytime Exploratory Data Analysis for Massive Data Sets (PS, DW), pp. 54–60.
POPL-1997-Biswas #analysis: A Demand-Driven Set-Based Analysis (SKB), pp. 372–385.
ICSE-1997-RyanK #industrial #requirements: Prioritizing Software Requirements in an Industrial Setting (KR, JK), pp. 564–565.
SOSP-1997-Steere #latency #nondeterminism #set: Exploiting the Non-Determinism and Asynchrony of Set Iterators to Reduce Aggregate File I/O Latency (DCS), pp. 252–263.
CADE-1997-HasegawaIOK #bottom-up #proving #set #theorem proving #top-down: Non-Horn Magic Sets to Incorporate Top-down Inference into Bottom-up Theorem Proving (RH, KI, YO, MK), pp. 176–190.
CADE-1997-Wen-Tsun #automation #reasoning: The Char-Set Method and Its Applications to Automated Reasoning (WWT), pp. 1–3.
ICLP-1997-BuenoCL #analysis #logic programming #set #source code #using: Sharing Analysis Using Set Logic Programs (FB, MC, VL), p. 417.
ICLP-1997-Liu #database #deduction #set #tuple: Supporting Partial and Complete Sets and Tuples in Deductive Databases (ML), p. 415.
ILPS-1997-Podelski #analysis #logic programming #source code: Set-Based Analysis of Logic Programs and Reactive Logic Programs (Abstract) (AP), pp. 35–36.
ILPS-1997-ZhangF #logic programming #set #source code: Answer Sets for Prioritized Logic Programs (YZ, NYF), pp. 69–83.
LICS-1997-CharatonikP #constraints #set: Set Constraints with Intersection (WC, AP), pp. 362–372.
LICS-1997-FiorePP #axiom #set: Complete Cuboidal Sets in Axiomatic Domain Theory (MPF, GDP, AJP), pp. 268–278.
DAC-1996-KhatriNKMBS #automaton #nondeterminism: Engineering Change in a Non-Deterministic FSM Setting (SPK, AN, SCK, KLM, RKB, ALSV), pp. 451–456.
DAC-1996-LiemPJ #architecture #compilation: Address Calculation for Retargetable Compilation and Exploration of Instruction-Set Architectures (CL, PGP, AAJ), pp. 597–600.
KBSE-1996-Darche #algorithm #automation #difference #generative #set: Set Differentiation: A Method for the Automatic Generation of Filtering Algorithms (FDD), p. 19.
HT-1996-Kendall #hypermedia #set: Hypertextual Dynamics in A Life Set for Two (RK), pp. 74–83.
VLDB-1996-MiningGroup #data mining #mining #visualisation: MineSet(tm): A System for High-End Data Mining and Visualization, p. 595.
VLDB-1996-Padmanabhan #parallel #scalability #set #using: Extracting Large Data Sets using DB2 Parallel Edition (SP), p. 582.
TACAS-1996-BoualiRRS #set #tool support: The FC2TOOLS Set (Tool Demonstration) (AB, AR, VR, RdS), p. 396.
STOC-1996-Basu #algebra #bound #on the #set: On Bounding the Betti Numbers and Computing the Euler Characteristic of Semi-Algebraic Sets (SB), pp. 408–417.
STOC-1996-BasuPR #algebra #set: Computing Roadmaps of Semi-Algebraic Sets (Extended Abstract) (SB, RP, MFR), pp. 168–173.
STOC-1996-Feige #approximate #set: A Threshold of ln n for Approximating Set Cover (Preliminary Version) (UF), pp. 314–318.
STOC-1996-Slavik #algorithm #analysis #set: A Tight Analysis of the Greedy Algorithm for Set Cover (PS), pp. 435–441.
ICALP-1996-AndreevCR #set: Hitting Sets Derandomize BPP (AEA, AEFC, JDPR), pp. 357–368.
ICALP-1996-ChengK #axiom #constraints #set: A Complete Gentzen-Style Axiomatization for Set Constraints (AC, DK), pp. 134–145.
ICALP-1996-Lisovik #linear #set: Hard Sets Method and Semilinear Reservoir Method with Applications (LPL), pp. 219–231.
CIKM-1996-Greco #bound #set #unification: Optimal Unification of Bounded Simple Set Terms (SG), pp. 326–336.
ICPR-1996-BhattacharyaCP #segmentation #set: An MLP-based texture segmentation technique which does not require a feature set (UB, BBC, SKP), pp. 805–809.
ICPR-1996-Bobrowski #classification #learning #set: Piecewise-linear classifiers, formal neurons and separability of the learning sets (LB), pp. 224–228.
ICPR-1996-DoeringW #classification #composition #cost analysis #network #set: Feedforward neural networks for Bayes-optimal classification: investigations into the influence of the composition of the training set on the cost function (AD, HW), pp. 219–223.
ICPR-1996-DunkerHS #3d #estimation #prototype #recognition #set #using: Single view recognition and pose estimation of 3D objects using sets of prototypical views and spatially tolerant contour representations (JD, GH, MS), pp. 14–18.
ICPR-1996-Dzemyda #analysis #set #visual notation: Visual analysis of a set of function values (GD), pp. 700–704.
ICPR-1996-Karasik #3d #commutative #on the #representation #set: On a planar representation of 3D figures commutative with respect to set and morphological operations (YBK), pp. 615–619.
ICPR-1996-Matalas #approximate #image #multi #set: A new set of multiscale texture features based on B-spline image approximation (IM), pp. 810–814.
ICPR-1996-Schikuta #clustering #named #performance #scalability #set: Grid-clustering: an efficient hierarchical clustering method for very large data sets (ES), pp. 101–105.
ICPR-1996-StoddartH #multi #set: Registration of multiple point sets (AJS, AH), pp. 40–44.
ICPR-1996-ZribiFG #3d #analysis #invariant #set: Set of invariant features for three-dimensional gray-level objects by harmonic analysis (MZ, HF, FG), pp. 549–553.
KDD-1996-MannilaT96a #multi #set: Multiple Uses of Frequent Sets and Condensed Representations (Extended Abstract) (HM, HT), pp. 189–194.
KDD-1996-ShanZHC #classification #database #set #using: Discovering Classification Knowledge in Databases Using Rough Sets (NS, WZ, HJH, NC), pp. 271–274.
KDD-1996-TsumotoT #automation #database #set: Automated Discovery of Medical Expert System Rules from Clinical Databases Based on Rough Sets (ST, HT), pp. 63–69.
CADE-1996-Felty #calculus #proving #set: Proof Search with Set Variable Instantiation in the Calculus of Constructions (APF), pp. 658–672.
CAV-1996-BoualiRRS #set #tool support: The FC2TOOLS Set (AB, AR, VR, RdS), pp. 441–445.
ISSTA-1996-MorellM #analysis #testing #using: Using Perturbation Analysis to Measure Variation in the Information Content of Test Sets (LJM, BWM), pp. 92–97.
JICSLP-1996-Luttringhaus-KappelS #lazy evaluation #performance #set: Applications of Efficient Lazy Set Expression (Poster Abstract) (SLK, DS), p. 531.
LICS-1996-McAllesterGWK #constraints #set: Tarskian Set Constraints (DAM, RG, CW, DK), pp. 138–147.
DAC-1995-ChangMC #algorithm #performance #set: An Efficient Algorithm for Local Don’t Care Sets Calculation (SCC, MMS, KTC), pp. 663–667.
DAC-1995-El-MalehMRM #on the #testing: On Test Set Preservation of Retimed Circuits (AHEM, TEM, JR, WM), pp. 176–182.
DAC-1995-ShenHC #composition #set: Lambda Set Selection in Roth-Karp Decomposition for LUT-Based FPGA Technology Mapping (WZS, JDH, SMC), pp. 65–69.
ICDAR-v1-1995-Crettez #product line #recognition #set: A set of handwriting families: style recognition (JPC), pp. 489–494.
ICDAR-v1-1995-DasL #integration #recognition #set: Recognition of dimension sets and integration with vectorized engineering drawings (AKD, NAL), pp. 347–350.
ICDAR-v1-1995-LeeK #multi #network #recognition #self #using: Multi-lingual, multi-font and multi-size large-set character recognition using self-organizing neural network (SWL, JSK), pp. 28–33.
ICDAR-v2-1995-KimPK #online #personalisation #set #verification: Applying personalized weights to a feature set for on-line signature verification (SHK, MSP, JK), pp. 882–885.
ICDAR-v2-1995-Randriamasy #benchmark #image #metric: A set-based benchmarking method for address bloc location on arbitrarily complex grey level images (SR), pp. 619–622.
PODS-1995-AndriesCPB #set: Applying an Update Method to a Set of Receivers (MA, LC, JP, JVdB), pp. 208–218.
DLT-1995-CurrieS #set: Cantor Sets and Dejean’s Conjecture (JDC, ROS), pp. 35–43.
ICALP-1995-Chen #algorithm #set #string: NC Algorithms for Finding a Maximal Set of Paths with Application to Compressing Strings (ZZC), pp. 99–110.
ICALP-1995-MetivierRW #set #word: Computing the Closure of Sets of Words Under Partial Commutations (YM, GR, PAW), pp. 75–86.
FPCA-1995-CousotC #abstract interpretation #constraints #formal method #program analysis: Formal Language, Grammar and Set-Constraint-Based Program Analysis by Abstract Interpretation (PC, RC), pp. 170–181.
KDD-1995-DeogunRS #approximate #set: Exploiting Upper Approximation in the Rough Set Methodology (JSD, VVR, HS), pp. 69–74.
KDD-1995-HuC #database #learning #set #similarity: Rough Sets Similarity-Based Learning from Databases (XH, NC), pp. 162–167.
KDD-1995-ShanZHC #information management #set #tool support #using: Using Rough Sets as Tools for Knowledge Discovery (NS, WZ, HJH, NC), pp. 263–268.
KDD-1995-SkowronS #approach #concurrent #modelling #set: Discovery of Concurrent Data Models from Experimental Tables: A Rough Set Approach (AS, ZS), pp. 288–293.
KDD-1995-TsumotoT95a #automation #component #functional #representation #sequence #set: Automated Discovery of Functional Components of Proteins from Amino-Acid Sequences Based on Rough Sets and Change of Representation (ST, HT), pp. 318–324.
PLILP-1995-Arenas-SanchezD #set #unification: Minimal Set Unification (PAS, AD), pp. 397–414.
SAC-1995-BaudinoCMS #set: Processing sets on a SIMD machine (AB, GC, GM, GS), pp. 593–598.
SAC-1995-Li #algorithm #optimisation #performance #set: An efficient algorithm for computing a minimum node cutset from a vertex-disjoint path set for timing optimization (WNL), pp. 56–60.
ESEC-1995-ZellerS #logic #set: Handling Version Sets Through Feature Logic (AZ, GS), pp. 191–204.
ICSE-1995-ClarkeL #algebra #constraints #process #realtime #testing: Testing Real-Time Constraints in a Process Algebraic Setting (DC, IL), pp. 51–60.
ICSE-1995-WongHLM #detection #effectiveness #fault #testing: Effect of Test Set Minimization on Fault Detection Effectiveness (WEW, JRH, SL, APM), pp. 41–50.
ILPS-1995-GiacobazziR #abstract interpretation #dependence #functional #semantics: Functional Dependencies and Moore-Set Completions of Abstract Interpretations and Semantics (RG, FR), pp. 321–335.
ILPS-1995-Liu #datalog #named #set #tuple: Relationlog: A Typed Extension to Datalog with Sets and Tuples (Extended Abstract) (ML), pp. 83–97.
RTA-1995-Burghardt #set: Regular Substitution Sets: A Means of Controlling E-Unification (JB), pp. 382–396.
RTA-1995-SchmidF #performance #testing #towards: Towards an Efficient Construction of Test Sets for Deciding Ground Reducability (KS, RF), pp. 86–100.
DAC-1994-AsharM #low cost #set: Implicit Computation of Minimum-Cost Feedback-Vertex Sets for Partial Scan and Other Applications (PA, SM), pp. 77–80.
DAC-1994-HuangD #pipes and filters #set #synthesis: Synthesis of Instruction Sets for Pipelined Microprocessors (IJH, AMD), pp. 5–11.
DAC-1994-KrishnakumarC #hybrid #modelling #on the #set: On the Computation of the Set of Reachable States of Hybrid Models (ASK, KTC), pp. 615–621.
DAC-1994-Minato #algebra #set #using: Calculation of Unate Cube Set Algebra Using Zero-Suppressed BDDs (SiM), pp. 420–424.
EDAC-1994-LiemMP #code generation: Instruction-Set Matching and Selection for DSP and ASIP Code Generation (CL, TCM, PGP), pp. 31–37.
PODS-1994-LibkinW #set: New Techniques for Studying Set Languages, Bag Languages and Aggregate Functions (LL, LW), pp. 155–166.
SIGMOD-1994-MumickP #database #implementation #relational: Implementation of Magic-sets in a Relational Database System (ISM, HP), pp. 103–114.
VLDB-1994-KilgerM #multi #set: Indexing Multiple Sets (CK, GM), pp. 180–191.
STOC-1994-HalldorssonR #approximate #bound #graph #independence #set: Greed is good: approximating independent sets in sparse and bounded-degree graphs (MMH, JR), pp. 439–448.
ICALP-1994-Pin #polynomial #set: Polynomial Closure of Group Languages and Open Sets of the Hall Topology (JÉP), pp. 424–435.
LFP-1994-Heintze #analysis #ml #source code: Set-Based Analysis of ML Programs (NH), pp. 306–317.
TAGT-1994-CourcelleS #graph #set: The Obstructions of a Minor-Closed Set of Graphs Defined by Hyperedge Replacement can be Constructed (BC, GS), pp. 351–367.
CHI-1994-GoldsteinR94a #query #scalability #set #using: Using aggregation and dynamic queries for exploring large data sets (JG, SFR), pp. 23–29.
CIKM-1994-HuC #approach #database #relational #set: Discovery of Decision Rules in Relational Databases: A Rough Set Approach (XH, NC), pp. 392–400.
CIKM-1994-KlemettinenMRTV #scalability #set: Finding Interesting Rules from Large Sets of Discovered Association Rules (MK, HM, PR, HT, AIV), pp. 401–407.
ICML-1994-AhaLLM #learning #recursion #set: Learning Recursive Relations with Randomly Selected Small Training Sets (DWA, SL, CXL, SM), pp. 12–18.
KDD-1994-MonkMSH #comparison #geometry #set: Geometric Comparison of Clarifications and Rule Sets (TJM, RSM, LAS, GH), pp. 395–406.
SAC-1994-Bloch #fuzzy #image #set: Fuzzy sets in image processing (IB), pp. 175–179.
CAV-1994-BoigelotW #set #verification: Symbolic Verification with Periodic Sets (BB, PW), pp. 55–67.
ICLP-1994-BruscoliDPR #compilation #set: Compiling Intensional Sets in CLP (PB, AD, EP, GR), pp. 647–661.
ICLP-1994-BurgLH #backtracking #set: Finding Conflict Sets and Backtrack Points in CLP(R) (JB, SDL, CEH), pp. 323–338.
ICLP-1994-Gervet #constraints #finite #named #set: Conjunto: Constraint Propagation over Set Constraints with Finite Set Domain Variables (CG), p. 733.
ILPS-1994-Gervet #constraints #finite #logic programming #named #set: Conjunto: Constraint Logic Programming with Finite Set Domains (CG), pp. 339–358.
LICS-1994-CharatonikP #constraints #set #similarity: Negative Set Constraints with Equality (WC, LP), pp. 128–136.
LICS-1994-Stefansson #constraints #set: Systems of Set Constraints with Negative Constraints are NEXPTIME-Complete (KS), pp. 137–141.
DAC-1993-CloutierT #pipes and filters #set #synthesis: Synthesis of Pipelined Instruction Set Processors (RJC, DET), pp. 583–588.
DAC-1993-KajiharaPKR #effectiveness #fault #generative #logic #testing: Cost-Effective Generation of Minimal Test Sets for Stuck-at Faults in Combinational Logic Circuits (SK, IP, KK, SMR), pp. 102–106.
DAC-1993-Minato #combinator #problem #set: Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems (SiM), pp. 272–277.
ICDAR-1993-CaesarGM93a #adaptation #classification #scalability #set: Utilization of large disordered sample sets for classifier adaptation in complex domains (TC, JMG, EM), pp. 790–793.
ICDAR-1993-ChouY #database #research #sorting: Sorting qualities of handwritten Chinese characters for setting up a research database (SLC, SSY), pp. 474–477.
ICDAR-1993-LaiK #detection #set: Detection of dimension sets in engineering drawings (CPL, RK), pp. 606–613.
ICDAR-1993-LeePT #evaluation #normalisation #performance #recognition: Performance evaluation of nonlinear shape normalization methods for the recognition of large-set handwritten characters (SWL, JSP, YT), pp. 402–407.
ICDAR-1993-ParkL #modelling #multi #probability #recognition: Large-set handwritten character recognition with multiple stochastic models (HSP, SWL), pp. 143–146.
ICDAR-1993-Pflug #n-gram #recognition #set #using: Using n-grams for the definition of a training set for cursive handwriting recognition (VP), pp. 295–298.
PODS-1993-LibkinW #query #semantics: Semantic Representations and Query Languages for Or-sets (LL, LW), pp. 37–48.
SIGMOD-1993-AgrawalIS #database #mining #scalability #set: Mining Association Rules between Sets of Items in Large Databases (RA, TI, ANS), pp. 207–216.
SIGMOD-1993-IshikawaKO #evaluation #set: Evaluation of Signature Files as Set Access Facilities in OODBs (YI, HK, NO), pp. 247–256.
VLDB-1993-SeegerLM #set: Reading a Set of Disk Pages (BS, PÅL, RM), pp. 592–603.
STOC-1993-ChazelleEGGSW #bound #set: Improved bounds on weak epsilon-nets for convex sets (BC, HE, MG, LJG, MS, EW), pp. 495–504.
STOC-1993-FelsnerW #algorithm #combinator #set: Maximum k-chains in planar point sets: combinatorial structure and algorithms (SF, LW), pp. 146–153.
STOC-1993-LinialLSZ #combinator #performance #set: Efficient construction of a small hitting set for combinatorial rectangles in high dimension (NL, ML, MES, DZ), pp. 258–267.
STOC-1993-SaksZ: Wait-free k-set agreement is impossible: the topology of public knowledge (MES, FZ), pp. 101–110.
ICALP-1993-GargVY #algorithm #approximate #multi #set: Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover (NG, VVV, MY), pp. 64–75.
HCI-ACS-1993-AielloS #feedback #monitoring #performance: Electronic Performance Monitoring and Stress: The Role of Feedback and Goal Setting (JRA, YS), pp. 1011–1016.
HCI-ACS-1993-ArthurB #performance: The Relationship Between Secretaries Opinions of Computing and Their Computer Performance Within a United Kingdom Health-Care Setting (JA, PB), pp. 362–367.
HCI-ACS-1993-HollywellH #set #validation #verification: A Tool Set for the Verification and Early Validation of a Control Room Computer-Based Display System for Sizewell “B” Nuclear Power Station (PDH, EMH), pp. 133–138.
HCI-SHI-1993-KoubekS #concept #requirements: A Conceptual Model of Human Skill Requirements for Advanced Manufacturing Settings (RJK, GS), pp. 356–361.
TRI-Ada-1993-DownsDMTT #ada #using: Using X with the ADA Mind-Set (MD, JD, KM, LT, CT), pp. 20–28.
ECOOP-1993-BalstersBZ #database #object-oriented #set: Typed Sets as a Basis for Object-Oriented Database Schemas (HB, RAdB, RZ), pp. 161–184.
PLILP-1993-DovierP #implementation #logic #set: A WAM-Based Implementation of a Logical Language with Sets (AD, EP), pp. 275–290.
SAC-1993-Kim #problem #program transformation #set: Program Transformation for the Longest Upsequence Set Problem (HK), pp. 609–613.
SAC-1993-LiuM #set: Dynamic Sets and Their Application in VDM (SL, JAM), pp. 187–192.
SAC-1993-Sen #low cost #probability #set #using: Minimal Cost Set Covering Using Probabilistic Methods (SS), pp. 157–164.
ICSE-1993-BastaniDP #correctness #evaluation #using: Experimental Evaluation of a Fuzzy-Set Based Measure of Software Correctness Using Program Mutation (FBB, GD, AP), pp. 45–54.
PPoPP-1993-ChatterjeeGLST #communication #generative #set #source code: Generating Local Address and Communication Sets for Data-Parallel Programs (SC, JRG, FJEL, RS, SHT), pp. 149–158.
CAV-1993-Valmari #on the fly #set #verification: On-the-Fly Verification with Stubborn Sets (AV), pp. 397–408.
CSL-1993-AikenKVW #complexity #constraints #set: The Complexity of Set Constraints (AA, DK, MYV, ELW), pp. 1–17.
CSL-1993-Kozen #aspect-oriented #constraints #logic #set: Logical Aspects of Set Constraints (DK), pp. 175–188.
CSL-1993-Marcinkowski #decidability #horn clause #set: A Horn Clause that Implies and Undecidable Set of Horn Clauses (JM), pp. 223–237.
ILPS-1993-Aparicio #semantics #set: Assumption Set Semantics (JNA), p. 639.
ILPS-1993-DovierR #finite #set: Embedding extensional finite sets in CLP (AD, GR), pp. 540–556.
DAC-1992-BatekH #logic: Test-Set Preserving Logic Transformations (MJB, JPH), pp. 454–458.
DAC-1992-HuangD #compilation #pipes and filters #set #synthesis: High Level Synthesis of Pipelined Instruction Set Processors and Back-End Compilers (IJH, AMD), pp. 135–140.
PODS-1992-GuptaM #recursion: Magic-sets Transformation in Nonrecursive Systems (AG, ISM), pp. 354–367.
VLDB-1992-ParkerSV #named #parallel #set: SVP: A Model Capturing Sets, Lists, Streams, and Parallelism (DSPJ, ES, PV), pp. 115–126.
STOC-1992-CallahanK #composition #multi #nearest neighbour: A Decomposition of Multi-Dimensional Point-Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields (Preliminary Version) (PBC, SRK), pp. 546–556.
STOC-1992-Kelsen #complexity #independence #on the #parallel #set: On the Parallel Complexity of Computing a Maximal Independent Set in a Hypergraph (PK), pp. 339–350.
STOC-1992-SimonS #complexity #on the #ram #set: On the Complexity of RAM with Various Operation Sets (JS, MS), pp. 624–631.
ICALP-1992-ArvindHHKLMOSST #reduction #set: Reductions to Sets of Low Information Content (VA, YH, LAH, JK, AL, MM, MO, US, RS, TT), pp. 162–173.
ICALP-1992-KarhumakiPR #context-free grammar #polynomial #testing: Polynomial Size Test Sets for Context-Free Languages (JK, WP, WR), pp. 53–64.
ICALP-1992-Shallit #linear #set: Numeration Systems, Linear Recurrences, and Regular Sets (Extended Abstract) (JS), pp. 89–100.
CHI-1992-RotellaBW #set #user interface: The AT&T Display Construction Set User Interface Management System (UIMS) (JPR, ALB, CAW), pp. 73–74.
AdaEurope-1992-Mangold #ada #multi #named #set: AMPATS — A Multi Processor Ada Tool Set (KM), pp. 300–311.
AdaEurope-1992-Treurniet #assessment #interface #set #tool support: SWG APSE Test Support Toolset (Assessment of the CAIS-A Interface Set) (WT), pp. 214–229.
KR-1992-LifschitzW #reasoning #set: Answer Sets in General Nonmonotonic Reasoning (Preliminary Report) (VL, TYCW), pp. 603–614.
KR-1992-Rymon #set: Search through Systematic Set Enumeration (RR), pp. 539–550.
TOOLS-EUROPE-1992-BreuningA #set #user interface #visual notation: Hierarchic Views — a Construction Set for Complex Graphical User Interfaces (RB, WA), pp. 325–332.
CADE-1992-Bauer #logic #multi: An Interval-based Temporal Logic in a Multivalued Setting (MB), pp. 355–369.
CADE-1992-Uribe #constraints #set #unification #using: Sorted Unification Using Set Constraints (TEU), pp. 163–177.
CADE-1992-ZhangH #induction #proving #set #theorem: Proving the Chinese Remainder Theorem by the Cover Set Induction (HZ, XH), pp. 431–445.
JICSLP-1992-Heintze #analysis #aspect-oriented #set: Practical Aspects of Set Based Analysis (NH), pp. 765–779.
LICS-1992-AikenW #constraints #set: Solving Systems of Set Constraints (Extended Abstract) (AA, ELW), pp. 329–340.
LICS-1992-KapurN #complexity #set: Double-exponential Complexity of Computing a Complete Set of AC-Unifiers (DK, PN), pp. 11–21.
DAC-1991-ChakrabortyBBL #testing #using: Enhanced Controllability for IDDQ Test Sets Using Partial Scan (TJC, SB, RB, CJL), pp. 278–281.
HT-1991-Parunak #hypermedia #reasoning #set #taxonomy: Don’t Link Me In: Set Based Hypermedia for Taxonomic Reasoning (HVDP), pp. 233–242.
PODS-1991-ImmermanPS #finite #product line #set: The Expressiveness of a Family of Finite Set Languages (NI, SP, DWS), pp. 37–52.
PODS-1991-Vadaparty #on the #power of #rule-based #set: On the Power of Rule-Based Languages with Sets (KVV), pp. 26–36.
SIGMOD-1991-GordinP #database: Set-Oriented Constructs: From Rete Rule Bases to Database Systems (DNG, AJP), pp. 60–67.
VLDB-1991-WidomCL #implementation: Implementing Set-Oriented Production Rules as an Extension to Starburst (JW, RC, BGL), pp. 275–285.
ICALP-1991-Dershowitz #horn clause #set: Cononical Sets of Horn Clauses (ND), pp. 267–278.
ICALP-1991-TannenS #aspect-oriented #logic #programming #set: Logical and Computational Aspects of Programming with Sets/Bags/Lists (VT, RS), pp. 60–75.
KDD-1991-SilvermanHM: Unsupervised Discovery in an Operational Control Setting (BGS, MRH, TMM), pp. 431–448.
ML-1991-Kadie91a #concept #learning #set: Continous Conceptual Set Covering: Learning Robot Operators From Examples (CMK), pp. 615–619.
ML-1991-Pierce #learning #set: Learning a Set of Primitive Actions with an Uninterpreted Sensorimotor Apparatus (DRP), pp. 338–342.
SIGIR-1991-BooksteinK #correlation #set: Compression of a Set of Correlated Bitmaps (AB, STK), pp. 63–71.
SIGIR-1991-YaoW #retrieval: Preference Structure, Inference and Set-Oriented Retrieval (YY, SKMW), pp. 211–218.
ICSE-1991-DunnK #case study #industrial #reuse: Software Reuse in an Industrial Setting: A Case Study (MFD, JCK), pp. 329–338.
ASPLOS-1991-CmelikKDK #analysis #benchmark #metric #set #specification: An Analysis of SPARC and MIPS Instruction Set Utilization on the SPEC Benchmarks (RFC, SIK, DRD, EJK), pp. 290–302.
CSL-1991-Fernando #bisimulation #complexity #logic #recursion #set: A Primitive Recursive Set Theory and AFA: On the Logical Complexity of the Largest Bisimulation (TF), pp. 96–110.
ICLP-1991-ChenW #abstraction #logic #multi #set: An Intensional Logic of (Multi-Arity) Set Abstractions (WC, DSW), pp. 97–110.
ICLP-1991-DovierOPR #finite #logic programming #programming language #set: {log}: A Logic Programming Language with Finite Sets (AD, EGO, EP, GR), pp. 111–124.
ICLP-1991-Marre #algebra #automation #logic programming #specification #testing #towards #using: Toward Automatic Test Data Set Selection Using Algebraic Specifications and Logic Programming (BM), pp. 202–219.
ICLP-1991-Reintjes #design #set #tool support: A Set of Tools for VHDL Design (PBR), pp. 549–562.
ISLP-1991-KempSS #bottom-up #evaluation #modelling #set: Magic Sets and Bottom-Up Evaluation of Well-Founded Models (DBK, DS, PJS), pp. 337–351.
TAV-1991-Harrold #data flow #optimisation #testing: The Effects of Optimizing Transformations on Data-Flow Adequate Test Sets (MJH), pp. 130–138.
PODS-1990-Ross #composition #datalog #set #source code: Modular Stratification and Magic Sets for DATALOG Programs with Negation (KAR), pp. 161–171.
SIGMOD-1990-WidomF #database #relational: Set-Oriented Production Rules in Relational Database Systems (JW, SJF), pp. 259–270.
VLDB-1990-HoutsmaAC #approach #distributed #set #transitive: Distributed Transitive Closure Computations: The Disconnection Set Approach (MAWH, PMGA, SC), pp. 335–346.
ESOP-1990-Heckmann #set: Set Domains (RH), pp. 177–196.
STOC-1990-GoddardKS #algorithm #random #sorting: Optimal Randomized Algorithms for Local Sorting and Set-Maxima (WG, VK, LJS), pp. 45–53.
STOC-1990-OgiwaraW #bound #on the #polynomial #set: On Polynomial Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets (MO, OW), pp. 457–467.
STOC-1990-SundarT #sequence #set: Unique Binary Search Tree Representations and Equality-testing of Sets and Sequences (RS, RET), pp. 18–25.
ICALP-1990-Pelletier #ambiguity #set: Boolean Closure and Unambiguity of Rational Sets (MP), pp. 512–525.
ML-1990-Kadie #algorithm #concept #set: Conceptual Set Covering: Improving Fit-And-Split Algorithms (CMK), pp. 40–48.
CADE-1990-Lescanne #implementation #named #set: ORME: An Implementation of Completion Procedures as Sets of Transition Rules (PL), pp. 661–662.
CADE-1990-McMichael #automation #named #set: SLIM: An Automated Reasoner For Equivalences, Applied To Set Theory (AFM), pp. 308–321.
CADE-1990-Peterson #constraints #reduction #set: Complete Sets of Reductions with Constraints (GEP), pp. 381–395.
CSL-1990-CantoneCS #problem #set: Decision Problems for Tarski and Presburger Arithmetics Extended With Sets (DC, VC, JTS), pp. 95–109.
CSL-1990-Fermuller #set: A Resolution Variant Deciding some Classes of Clause Sets (CGF), pp. 128–144.
LICS-1990-Courcelle #graph #higher-order #monad #on the #set: On the Expression of Monadic Second-Order Graph Properties Without Quantifications Over Sets of Edges (Extended Abstract) (BC), pp. 190–196.
LICS-1990-HeintzeJ #constraints #set: A Decision Procedure for a Class of Set Constraints (Extended Abstract) (NH, JJ), pp. 42–51.
LICS-1990-RobinsonR #call-by #morphism #polymorphism #set: Polymorphism, Set Theory, and Call-by-Value (ER, GR), pp. 12–18.
DAC-1989-LeeHK #fault #generative #testing #using: Test Generation of Stuck-open Faults Using Stuck-at Test Sets in CMOS Combinational Circuits (HKL, DSH, KK), pp. 345–350.
DAC-1989-WangKL #approach #fault #logic #robust #set: A New Approach to Derive Robust Sets for Stuck-open Faults in CMOS Combinational Logic Circuits (JFW, TYK, JYL), pp. 726–729.
PODS-1989-HullS #query #set: Untyped Sets, Invention, and Computable Queries (RH, JS), pp. 347–359.
FPCA-1989-Hunt #abstract interpretation #set: Frontiers and Open Sets in Abstract Interpretation (SH), pp. 1–13.
FPCA-1989-SilbermannJ #abstraction #functional #logic programming #set: Set Abstraction in Functional and Logic Programming (FSKS, BJ), pp. 313–326.
CAiSE-1989-Kansala #automation #experience #set #tool support: Loosely Integrated Sets of CASE tools: Our Experience (KK).
KR-1989-Zadrozny #order #set: Cardinalities and Well Orderings in a Common-Sense Set Theory (WZ), pp. 486–497.
ML-1989-GoodmanS #algorithm #induction #probability #set: The Induction of Probabilistic Rule Sets — The Itrule Algorithm (RMG, PS), pp. 129–132.
SEKE-1989-HanHZ #compilation #set: Derivation of Magic Sets by Compilation (JH, LJH, NZ), pp. 164–171.
SIGIR-1989-Parkes #automation #image #network: Settings and the Setting Structure: The Description and Automated Propagation of Networks for Perusing Videodisk Image States (APP), pp. 229–238.
OOPSLA-1989-TomlinsonS #inheritance #set: Inheritance and Synchronization with Enabled Sets (CT, VS), pp. 103–112.
ASPLOS-1989-AdamsZ #analysis #set #source code: An Analysis of 8086 Instruction Set Usage in MS DOS Programs (TLA, REZ), pp. 152–160.
CSL-1989-Ambos-SpiesY #polynomial #recursion #set: Honest Polynomial-Time Degrees of Elementary Recursive Sets (KAS, DY), pp. 1–15.
CSL-1989-CantoneCP #problem #reduction: Set-Theoretic Reductions of Hilbert’s Tenth Problem (DC, VC, AP), pp. 65–75.
CSL-1989-SpeckenmeyerK #clustering #complexity #on the #set: On the Average Time Complexity of Set Partitioning (ES, RK), pp. 369–381.
LICS-1989-Fernando #on the #recursion #set: On Substitutional Recursion Over Non-Well-Founded Sets (RTPF), pp. 273–282.
LICS-1989-Lubarsky #integer #set: μ-Definable Sets of Integers (RSL), pp. 343–352.
LICS-1989-MisloveMO #fixpoint #set: Non-Well-Founded Sets Obtained from Ideal Fixed Points (MWM, LSM, FJO), pp. 263–272.
RTA-1989-BairdPW #commutative #reduction #set: Complete Sets of Reductions Modulo Associativity, Commutativity and Identity (TBB, GEP, RWW), pp. 29–44.
RTA-1989-DarlingtonG #abstraction #evaluation #functional #programming #set #unification: Narrowing and Unification in Functional Programming — An Evaluation Mechanism for Absolute Set Abstraction (JD, YG), pp. 92–108.
RTA-1989-Snyder #algorithm #equation #generative #performance #set: Efficient Ground Completion: An O(n log n) Algorithm for Generating Reduced Sets of Ground Rewrite Rules Equivalent to a Set of Ground Equations E (WS), pp. 419–433.
DAC-1988-HenkelG #layout #named #set #verification: RISCE — A Reduced Instruction Set Circuit Extractor for Hierarchical VLSI Layout Verification (VH, UG), pp. 465–470.
PODS-1988-GelderRS #logic programming #semantics #set #source code: Unfounded Sets and Well-Founded Semantics for General Logic Programs (AVG, KAR, JSS), pp. 221–230.
PODS-1988-HuangL #multi #set: Stable Set and Multiset Operations in Optimal Time and Space (BCH, MAL), pp. 288–293.
PODS-1988-Kuper #logic programming #on the #power of #programming language #set: On the Expressive Power of Logic Programming Languages with Sets (GMK), pp. 10–14.
PODS-1988-LaninS #concurrent #set: Concurrent Set Manipulation without Locking (VL, DS), pp. 211–220.
PODS-1988-ShmueliTZ #logic #set: Rewriting of Rules Containing Set Terms in a Logic Data Model (LDL) (OS, ST, CZ), pp. 15–28.
STOC-1988-FraysseixPP #graph #set: Small Sets Supporting Fáry Embeddings of Planar Graphs (HdF, JP, RP), pp. 426–433.
STOC-1988-LoeblN #problem #set: Linearity and Unprovability of Set Union Problem Strategies (ML, JN), pp. 360–366.
STOC-1988-PintzSS #infinity #performance #testing: Two Infinite Sets of Primes with Fast Primality Tests (JP, WLS, ES), pp. 504–509.
ICALP-1988-TangB #polynomial #reduction #set: Separating Polynomial-Time Turing and Truth-Table Reductions by Tally Sets (ST, RVB), pp. 591–599.
VDME-1988-BorzyszkowskiKS #formal method #polymorphism #λ-calculus: A Set-Theoretic Model for a Typed Polymorphic λ Calculus — A Contribution to MetaSoft (AMB, RK, SS), pp. 267–298.
CSCW-1988-Bly #collaboration: A Use of Drawing Surfaces in Different Collaborative Settings (SAB), pp. 250–256.
SIGIR-1988-Bookstein #retrieval #set: Set Oriented Retrieval (AB), pp. 583–596.
SIGIR-1988-BoscG #flexibility #framework #fuzzy #set: Flexible Selection among Objects: A Framework Based on Fuzzy Sets (PB, MG), pp. 433–449.
SIGIR-1988-Das-Gupta #information retrieval #set: Rough Sets and Information Retrieval (PDG), pp. 567–581.
ALP-1988-FulopV #automaton #linear #set #term rewriting: A Characterization of Irreducible Sets Modulo Left-Linear Term Rewriting Systems by Tree Automata (ZF, SV), p. 157.
CADE-1988-GallierNPRS #canonical #equation #finite #polynomial #set #term rewriting: Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time (JHG, PN, DAP, SR, WS), pp. 182–196.
JICSCP-1988-FujitaOF88 #constraints #haskell #partial evaluation #source code: Partial Evaluation of GHC Programs Based on the UR-set with Constraints (HF, AO, KF), pp. 924–941.
JICSCP-1988-Subrahmanian88 #semantics #set: Intuitive Semantics for Quantitative Rule Sets (VSS), pp. 1036–1053.
PODS-1987-BeeriNRST #database #logic #set: Sets and Negation in a Logic Database Language (LDL1) (CB, SAN, RR, OS, ST), pp. 21–37.
PODS-1987-Kuper #logic programming #set: Logic Programming With Sets (GMK), pp. 11–20.
SIGMOD-1987-AbiteboulKG #on the #query #representation #set: On the Representation and Querying of Sets of Possible Worlds (SA, PCK, GG), pp. 34–48.
FPCA-1987-JayaramanP #functional #programming #set: Functional programming with sets (BJ, DAP), pp. 194–211.
HCI-SES-1987-AndersonJSA #empirical: Diffusion and Impact of Computer in Organizational Settings: Empirical Findings form a Hospital (JGA, SJJ, HMS, MMA), pp. 3–10.
POPL-1987-NeirynckPD #alias #set: Computation of Aliases and Support Sets (AN, PP, AJD), pp. 274–283.
ESEC-1987-Tempel #design #set #tool support: A Set of Tools supporting the Software Design Based on SDL (HGT), pp. 348–356.
ASPLOS-1987-DavidsonV #complexity #memory management #performance #set: The Effect of Instruction Set Complexity on Program Size and Memory Performance (JWD, RAV), pp. 60–64.
CSL-1987-BohmP #combinator #finite #reduction #set: Surjectivity for Finite Sets of Combinators by Weak Reduction (CB, AP), pp. 27–43.
ICLP-1987-CecchiSA87 #logic programming #source code: Evaluating Logic Programs via Set-Valued Functions (CC, DS, LCA), pp. 428–455.
ICLP-1987-Kunen87 #set: Answer Sets and Negation-as-Failure (KK), pp. 219–228.
ICLP-1987-ShmueliN87 #horn clause #set #source code: Set Grouping and Layering in Horn Clause Programs (OS, SAN), pp. 152–177.
RTA-1987-Kirchner #infinity #process #set: Schematization of Infinite Sets of Rewrite Rules. Application to the Divergence of Completion Processes (HK), pp. 180–191.
SLP-1987-KimuraC87 #set: An Abstract KL1 Machine and Its Instruction Set (YK, TC), pp. 468–477.
PODS-1986-BancilhonMSU #logic programming #set #source code: Magic Sets and Other Strange Ways to Implement Logic Programs (FB, DM, YS, JDU), pp. 1–15.
ICALP-1986-Felice #finite #graph #set: Finite Biprefix Sets of Path in a Graph (CdF), pp. 89–94.
ICALP-1986-HartmanisLY #complexity #set: Containment, Separation, Complete Sets, and Immunity of Complexity Classes (JH, ML, YY), pp. 136–145.
ICALP-1986-MannilaU #backtracking #problem #set: The Set Union Problem with Backtracking (HM, EU), pp. 236–243.
LFP-1986-JayaramanS #equation #functional #logic programming #reduction #semantics #set: Equations, Sets, and Reduction Semantics for Functional and Logic Programming (BJ, FSKS), pp. 320–331.
LFP-1986-SteenkisteH #lisp: LISP on a Reduced-Instruction-Set-Processor (PS, JLH), pp. 192–201.
GG-1986-Courcelle86a #graph #higher-order #monad #on the #set: On context-free sets of graphs and their monadic second-order theory (BC), pp. 133–146.
GG-1986-Nagl #graph grammar #set: Set theoretic approaches to graph grammars (MN), pp. 41–54.
CADE-1986-Buttner #data type #set #unification: Unification in the Data Structure Sets (WB), pp. 470–488.
CADE-1986-KapurN #problem #set #unification: NP-Completeness of the Set Unification and Matching Problems (DK, PN), pp. 489–495.
CADE-1986-KapurNZ #induction #proving #testing #using: Proof by Induction Using Test Sets (DK, PN, HZ), pp. 99–117.
CADE-1986-Tiden #set #unification: Unification in Combinations of Collapse-Free Theories with Disjoint Sets of Function Symbols (ET), pp. 431–449.
ICLP-1986-Levy86 #automaton #haskell #set: A GHC Abstract Machine and Instruction Set (JL), pp. 157–171.
LICS-1986-Robinson #functional #programming #reduction #relational: Merging Functional with Relational Programming in a Reduction Setting (Abstract of an Invited Lecture) (JAR), p. 2.
STOC-1985-BollobasS #algorithm #behaviour #on the #set: On the Expected Behaviour of Disjoint Set Union Algorithms (BB, IS), pp. 224–231.
STOC-1985-Luby #algorithm #independence #parallel #problem #set: A Simple Parallel Algorithm for the Maximal Independent Set Problem (ML), pp. 1–10.
ICALP-1985-BeauquierN #set #word: About Rational Sets of Factors of a Bi-Infinite Word (DB, MN), pp. 33–42.
ICALP-1985-Cole #clustering #set: Partitioning Point Sets in 4 Dimensions (RC0), pp. 111–119.
ICALP-1985-KurtzM #algorithm #analysis #distributed #probability #set: A Probabilistic Distributed Algorithm for Set Intersection and Its Analysis (Preliminary Version) (TGK, UM), pp. 356–362.
ICSE-1985-BasiliS #metric #set: Calculation and Use of an Environment’s Characteristic Software Metric Set (VRB, RWS), pp. 386–393.
RTA-1985-DetlefsF #automation #proving #set #termination: A Procedure for Automatically Proving the Termination of a Set of Rewrite Rules (DD, RF), pp. 255–270.
RTA-1985-Zaionc #regular expression #set #λ-calculus: The Set of Unifiers in Typed λ-Calculus as Regular Expression (MZ), pp. 430–440.
STOC-1984-BlumerBEHM #linear #set: Building a Complete Inverted File for a Set of Text Files in Linear Time (AB, JB, AE, DH, RMM), pp. 349–358.
STOC-1984-FranzblauK #algorithm #generative #independence #set: An Algorithm for Constructing Regions with Rectangles: Independence and Minimum Generating Sets for Collections of Intervals (DSF, DJK), pp. 167–174.
STOC-1984-KarpW #algorithm #independence #parallel #performance #problem #set: A Fast Parallel Algorithm for the Maximal Independent Set Problem (RMK, AW), pp. 266–272.
ICALP-1984-Ambos-Spies #set: P-Generic Sets (KAS), pp. 58–68.
ICALP-1984-BlumerBEHM #automaton #linear #online #set #word: Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time (AB, JB, AE, DH, RMM), pp. 109–118.
LFP-1984-WholeyF #design #lisp #set: The Design of an Instruction Set for Common Lisp (SW, SEF), pp. 150–158.
POPL-1984-JouannaudK #equation #set: Completion of a Set of Rules Modulo a Set of Equations (JPJ, HK), pp. 83–92.
POPL-1984-Wand #morphism #polymorphism #semantics: A Types-as-Sets Semantics for Milner-Style Polymorphism (MW), pp. 158–164.
CADE-1984-JouannaudM #equation #set #termination: Termination of a Set of Rules Modulo a Set of Equations (JPJ, MM), pp. 175–193.
SLP-1984-Nakagawa84 #parallel #prolog #set: AND Parallel PROLOG with Divided Assertion Set (HN), pp. 22–28.
PODS-1983-GinsburgH #relational #set: Sort Sets in the Relational Model (SG, RH), pp. 332–339.
STOC-1983-GabowT #algorithm #linear #set: A Linear-Time Algorithm for a Special Case of Disjoint Set Union (HNG, RET), pp. 246–251.
STOC-1983-HartmanisSI #set: Sparse Sets in NP-P: EXPTIME versus NEXPTIME (JH, VS, NI), pp. 382–391.
STOC-1983-Sipser #complexity #set: Borel Sets and Circuit Complexity (MS), pp. 61–69.
STOC-1983-Young #polynomial #set: Some Structural Properties of Polynomial Reducibilities and Sets in NP (PY), pp. 392–401.
ICALP-1983-ChoffrutK #bound #morphism #testing: Test Sets for Morphisms with Bounded Delay (CC, JK), pp. 118–127.
ICALP-1983-EdelsbrunnerW #on the #set: On the Number of Equal-Sized Semispaces of a Set of Points in the Plane (Extended Abstract) (HE, EW), pp. 182–187.
ICALP-1983-HartmanisHY #set: Computation Times of NP Sets of Different Densities (JH, YY), pp. 319–330.
VLDB-1982-SaccoS #database #relational #set #using: A Mechanism for Managing the Buffer Pool in a Relational Database System Using the Hot Set Model (GMS, MS), pp. 257–262.
ICALP-1982-Culik #on the #testing: On Test Sets and the Ehrenfeucht Conjecture (KCI), pp. 128–140.
ICALP-1982-HarelK #induction #programming language #set: A Programming Language for the Inductive Sets, and Applications (DH, DK), pp. 313–329.
ICALP-1982-Sipser #on the #set: On Relativization and the Existence of Complete Sets (MS), pp. 523–531.
ASPLOS-1982-McDaniel #analysis #set #using: An Analysis of a Mesa Instruction Set Using Dynamic Instruction Frequencies (GM), pp. 167–176.
ASPLOS-1982-SweetS #analysis #empirical #set: Empirical Analysis of the Mesa Instruction Set (RES, JGSJ), pp. 158–166.
ASPLOS-1982-Wiecek #case study #compilation #execution #set: A Case Study of VAX-11 Instruction Set Usage for Compiler Execution (CAW), pp. 177–184.
DAC-1981-SakauyeLRETSABW #design #set #source code: A set of programs for MOS design (GS, AL, JR, RE, JT, ESYS, EA, FB, PSW), pp. 435–442.
ICSE-1981-ZeilW #analysis #testing: Sufficient Tset Sets for Path Analysis Testing Strategies (SJZ, LJW), pp. 184–194.
STOC-1980-GuibasY #on the #set: On Translating a Set of Rectangles (LJG, FFY), pp. 154–160.
ICALP-1980-AlbertC #context-free grammar #equivalence #morphism #testing: Test Sets for Homomorphism Equivalence on Context Free Languages (JA, KCI), pp. 12–18.
ICALP-1980-FredericksonJ #generative #network #set: Generating and Searching Sets Induced by Networks (GNF, DBJ), pp. 221–233.
ICALP-1980-Huynh #complexity #linear #set: The Complexity of Semilinear Sets (TDH), pp. 324–337.
POPL-1980-KapurM #abstraction #set: Expressiveness of the Operation Set of a Data Abstraction (DK, MKS), pp. 139–153.
POPL-1980-Kfoury #analysis #set #source code: Analysis of Simple Programs Over Different Sets of Primitives (AJK), pp. 56–61.
CADE-1980-FerroOS #set: Decision Procedures for Some Fragments of Set Theory (AF, EGO, JTS), pp. 88–96.
DAC-1979-Barbacci #evaluation #set #simulation #specification #synthesis: Instruction set processor specifications for simulation, evaluation, and synthesis (MB), pp. 64–72.
SCC-1979-DeRemerP #lalr #performance #set: Efficient computation of LALR(1) look-ahead sets (FD, TJP), pp. 176–187.
STOC-1979-Angluin #set #string: Finding Patterns Common to a Set of Strings (Extended Abstract) (DA), pp. 130–141.
STOC-1979-GurariI #complexity #equivalence #linear #problem #set #source code: The Complexity of the Equivalence Problem for Counter Machines, Semilinear Sets, and Simple Programs (EMG, OHI), pp. 142–152.
Best-of-PLDI-1979-PennelloD #lalr #performance #set: Efficient computation of LALR(1) look-ahead sets (with retrospective) (TJP, FD), pp. 14–27.
ICALP-1979-BookB #complexity #representation #set #similarity: Representing Complexity Classes by Equality Sets (Preliminary Report) (RVB, FJB), pp. 49–57.
ICALP-1979-Selman #behaviour #polynomial #set: P-Selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP (ALS), pp. 546–555.
ICALP-1978-Barth #set: Grammars with Dynamic Control Sets (GB), pp. 36–51.
ICALP-1978-CoppoDR #finite #set #λ-calculus: (Semi)-separability of Finite Sets of Terms in Scott’s D∞-Models of the λ-Calculus (MC, MDC, SRDR), pp. 142–164.
ICALP-1978-Restivo #monad #set: Some Decision Results for Recognizable Sets in Arbitrary Monoids (AR), pp. 363–371.
GG-1978-Pfaltz #2d #graph grammar #network #set: A Graph Grammar that Describes the Set of Two-Dimensional Surface Networks (JLP), pp. 379–388.
DAC-1977-PedroG #algorithm #automation #design #named #set: DOCIL: An automatic system for printed circuit board (PCB) designing. A board description language and an algorithm to connect a set of points (TdP, RG), pp. 174–181.
VLDB-1977-Childs #set: Extended Set Theory (DLC), pp. 28–46.
VLDB-1977-MizumotoT #data type #implementation: Implementation of a Fuzzy-Set Theoretic Data Structure System (Abstract) (MM, MU, KT), p. 490.
STOC-1977-PrabhalaS #comparison #set #stack: A Comparison of Instruction Sets for Stack Machines (BP, RS), pp. 132–142.
STOC-1977-Tarjan #maintenance #set: Reference Machines Require Non-linear Time to Maintain Disjoint Sets (RET), pp. 18–29.
SOSP-1977-Potier #analysis #policy #set: Analysis of Demand Paging Policies with Swapped Working Sets (DP), pp. 125–131.
STOC-1976-HartmanisB #morphism #on the #set: On Isomorphisms and Density of NP and Other Complete Sets (JH, LB), pp. 30–40.
STOC-1976-Yao #algorithm #behaviour #on the #set: On the Average Behavior of Set Merging Algorithms (Extended Abstract) (ACCY), pp. 192–195.
ICALP-1976-Linna #context-free grammar #on the: On ω-sets Associated with Context-Free Languages (ML), pp. 1–19.
ICSE-1976-Koppang #design #development #process #set #tool support: Process Design System: An Integrated Set of Software Development Tools (RGK), pp. 86–90.
ICSE-1976-Smith #effectiveness #in memory #memory management #on the #set: On the Effectiveness of Set Associative Page Mapping and Its Application to Main Memory Management (AJS), pp. 286–292.
SIGMOD-1975-WelchG #information retrieval #set #using: Information Retrieval in Files Described Using Sets (JWW, JWG), pp. 92–98.
SIGFIDET-1974-Beitz #database #representation: A Set-Theoretic View of Data Base Representation (EHB), pp. 477–494.
ICALP-1974-Blattner #context-free grammar #set: Transductions of Context-Free Languages into Sets of Sentential Forms (MB), pp. 511–522.
ICALP-1974-FlajoletS #on the #set: On Sets Having Only Hard Subsets (PF, JMS), pp. 446–457.
STOC-1973-BrockettD #evaluation #on the #set: On the Optimal Evaluation of a Set of Bilinear Forms (RWB, DPD), pp. 88–95.
STOC-1973-Eilenberg #set: Classes of Semigroups and Classes of Sets (SE), pp. 266–267.
STOC-1973-LynchMF #set: Sets that Don’t Help (NAL, ARM, MJF), pp. 130–134.
POPL-1973-Morris #set: Types are Not Sets (JHMJ), pp. 120–124.
ICALP-1972-Kemp #estimation #lr #set: An Estimation of the Set of States of the Minimal LR(0)-Acceptor (RK), pp. 563–574.
ICALP-1972-Reghizzi #approximate #set: Approximation of Phrase Markers by Regular Sets (SCR), pp. 367–376.
ICALP-1972-Takahashi #set: Primitive Tranformations of Regular Sets and Recognizable Sets (MT), pp. 475–480.
SOSP-J-1973-DenningS72 #set: Properties of the Working Set Model (PJD, SCS), pp. 191–198.
SIGFIDET-1971-Owens #evaluation #set: Evaluation of Access Authorization Characteristics of Derived Data Sets (RCOJ), pp. 263–278.
STOC-1971-McNaughton #set: A Decision Procedure for Generalized Sequential Mapability-onto of Regular Sets (RM), pp. 206–218.
SOSP-1971-DenningS #set: Properties of the Working Set Model (Abstract) (PJD, SCS), pp. 130–140.
STOC-1970-BassY #complexity #set: Hierarchies Based on Computational Complexity and Irregularities of Class Determining Measured Sets (Preliminary Report) (LJB, PRY), pp. 37–40.
STOC-1969-Young #order #set: Speed-Ups by Changing the Order in Which Sets are Enumerated (Preliminary Version) (PRY), pp. 89–92.
SOSP-1967-Denning68 #behaviour #set: The Working Set Model for Program Behaviour (PJD), pp. 323–333.