BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
set
Google set

Tag #set

1370 papers:

PADLPADL-2020-ChanC #distance #edit distance #flexibility #graph #programming #using
Flexible Graph Matching and Graph Edit Distance Using Answer Set Programming (SCC, JC), pp. 20–36.
PADLPADL-2020-NguyenZJXD #artificial reality #learning #named #programming
VRASP: A Virtual Reality Environment for Learning Answer Set Programming (VTN, YZ0, KJ, WX, TD), pp. 82–91.
CSLCSL-2020-MoermanR
Separation and Renaming in Nominal Sets (JM, JR), p. 17.
CSLCSL-2020-Passmann #theorem
De Jongh's Theorem for Intuitionistic Zermelo-Fraenkel Set Theory (RP), p. 16.
MSRMSR-2019-Beyer #fault #invariant
A data set of program invariants and error paths (DB0), pp. 111–115.
MSRMSR-2019-KampKP #java #named #semantics
SeSaMe: a data set of semantically similar Java methods (MK, PK, MP), pp. 529–533.
MSRMSR-2019-TonderTG #development #git #process
A panel data set of cryptocurrency development activity on GitHub (RvT, AT, CLG), pp. 186–190.
SCAMSCAM-2019-Kessel0 #automation
Automatically Curated Data Sets (MK, CA0), pp. 56–61.
CIAACIAA-2019-FujiyoshiP #automaton #finite #graph
A Simple Extension to Finite Tree Automata for Defining Sets of Labeled, Connected Graphs (AF, DP), pp. 121–132.
DLTDLT-2019-AzfarCCJ #bound #linear #matrix
A Linear Bound on the K-Rendezvous Time for Primitive Sets of NZ Matrices (UA, CC, LC, RMJ), pp. 59–73.
CoGVS-Games-2019-Jercic #game studies #metric #performance #predict #what
What could the baseline measurements predict about decision-making performance in serious games set in the financial context (PJ), pp. 1–4.
CIKMCIKM-2019-DongZ #algorithm #performance
Faster Algorithms for k-Regret Minimizing Sets via Monotonicity and Sampling (QD, JZ), pp. 2213–2216.
CIKMCIKM-2019-LuoGRML
Set Reconciliation with Cuckoo Filters (LL, DG, OR, RTBM, XL), pp. 2465–2468.
CIKMCIKM-2019-ZhengSKY #clique #identification
Author Set Identification via Quasi-Clique Discovery (YZ, CS, XK, YY), pp. 771–780.
ECIRECIR-p2-2019-HurriyetogluYYY #automation #multi
A Task Set Proposal for Automatic Protest Information Collection Across Multiple Countries (AH, EY, DY, ÇY, BG, FD, OM), pp. 316–323.
ICMLICML-2019-CotterGJLMNWZ #constraints
Shape Constraints for Set Functions (AC, MRG, HJ, EL, JM, TN, SW, TZ), pp. 1388–1396.
ICMLICML-2019-KalyanALB #modelling #sequence
Trainable Decoding of Sets of Sequences for Neural Sequence Models (AK, PA, SL, DB), pp. 3211–3221.
ICMLICML-2019-LeeLKKCT #framework #invariant #network
Set Transformer: A Framework for Attention-based Permutation-Invariant Neural Networks (JL, YL, JK, ARK, SC, YWT), pp. 3744–3753.
ICMLICML-2019-MatteiF #generative #modelling #named #semistructured data
MIWAE: Deep Generative Modelling and Imputation of Incomplete Data Sets (PAM, JF), pp. 4413–4423.
ICMLICML-2019-Nguyen #learning #on the
On Connected Sublevel Sets in Deep Learning (QN), pp. 4790–4799.
ICMLICML-2019-WagstaffFEPO #on the #representation
On the Limitations of Representing Functions on Sets (EW, FF, ME, IP, MAO), pp. 6487–6494.
KDDKDD-2019-Bradley #challenge #complexity
Addressing Challenges in Data Science: Scale, Skill Sets and Complexity (JB), p. 3163.
KDDKDD-2019-HuH #learning #named #network
Sets2Sets: Learning from Sequential Sets with Neural Networks (HH, XH0), pp. 1491–1499.
KDDKDD-2019-WangQZZWLG #sketching #streaming
A Memory-Efficient Sketch Method for Estimating High Similarities in Streaming Sets (PW, YQ, YZ, QZ, CW, JCSL, XG), pp. 25–33.
OOPSLAOOPSLA-2019-ZurielFSCP #performance
Efficient lock-free durable sets (YZ, MF, GS, NC, EP), p. 26.
PADLPADL-2019-HippenL #automation #source code
Automatic Program Rewriting in Non-Ground Answer Set Programs (NH, YL), pp. 19–36.
PADLPADL-2019-KahramanE #personalisation #programming #using
Personalized Course Schedule Planning Using Answer Set Programming (MKK, EE0), pp. 37–45.
PLDIPLDI-2019-Dasgupta0KAR #architecture #semantics
A complete formal semantics of x86-64 user-level instruction set architecture (SD, DP0, TK, VSA, GR), pp. 1133–1148.
SASSAS-2019-Ben-AmramDG #multi #ranking
Multiphase-Linear Ranking Functions and Their Relation to Recurrent Sets (AMBA, JJD, SG), pp. 459–480.
EDMEDM-2018-KoedingerSS #multi #question #robust
Is the Doer Effect Robust Across Multiple Data Sets? (KRK, RS, PS).
ICPCICPC-2018-XuLTLZLX #fault #predict
Cross version defect prediction with representative data via sparse subset selection (ZX, SL, YT, XL, TZ0, JL0, JX0), pp. 132–143.
DLTDLT-2018-CatalanoJ #matrix #probability
The Synchronizing Probability Function for Primitive Sets of Matrices (CC, RMJ), pp. 194–205.
DLTDLT-2018-GonzeJ #automaton #on the #reachability
On Completely Reachable Automata and Subset Reachability (FG, RMJ), pp. 330–341.
ICFP-2018-BreitnerSLRWW #case study #exclamation #experience #haskell #verification
Ready, set, verify! applying hs-to-coq to real-world Haskell code (experience report) (JB, ASZ, YL0, CR, JW, SW), p. 16.
DiGRADiGRA-2018-LoveB #design #game studies #social
A Three Person Poncho and a Set of Maracas: Designing Ola De La Vida, A Co-Located Social Play Computer Game (LHCL, MB).
FDGFDG-2018-SmithPV #generative #graph #programming #using
Graph-based generation of action-adventure dungeon levels using answer set programming (TS0, JAP, AV), p. 10.
CIKMCIKM-2018-NagarkarC #execution #named #performance #query
PSLSH: An Index Structure for Efficient Execution of Set Queries in High-Dimensional Spaces (PN, KSC), pp. 477–486.
CIKMCIKM-2018-XuWCWM #category theory #detection
Exploring a High-quality Outlying Feature Value Set for Noise-Resilient Outlier Detection in Categorical Data (HX, YW, LC, YW, XM), pp. 17–26.
ICMLICML-2018-HartfordGLR #interactive #modelling
Deep Models of Interactions Across Sets (JSH, DRG, KLB, SR), pp. 1914–1923.
ICMLICML-2018-MorvanV #algorithm #higher-order #interactive #modelling #named
WHInter: A Working set algorithm for High-dimensional sparse second order Interaction models (MLM, JPV), pp. 3632–3641.
ICPRICPR-2018-ChenWWK #approximate #classification #image #kernel
Riemannian kernel based Nyström method for approximate infinite-dimensional covariance descriptors with application to image set classification (KXC, XJW, RW, JK), pp. 651–656.
ICPRICPR-2018-GaoSXL #classification #image #kernel #linear
Kernel Dual Linear Regression for Face Image Set Classification (XG, QS, HX, YL), pp. 1542–1547.
ICPRICPR-2018-HibrajVSP #clustering #using
Speaker Clustering Using Dominant Sets (FH, SV, TS, MP), pp. 3549–3554.
ICPRICPR-2018-ShibataIHM #image #using
Restoration of Sea Surface Temperature Satellite Images Using a Partially Occluded Training Set (SS, MI, AH, MM), pp. 2771–2776.
ICPRICPR-2018-SogiF #modelling #recognition
Action Recognition Method Based on Sets of Time Warped ARMA Models (NS, KF), pp. 1773–1778.
ICPRICPR-2018-WangWCK #classification #image #learning #metric #multi
Multiple Manifolds Metric Learning with Application to Image Set Classification (RW, XJW, KXC, JK), pp. 627–632.
ICPRICPR-2018-ZhangLWCZ #automation #framework #image #multimodal
An Automated Point Set Registration Framework for Multimodal Retinal Image (HZ, XL, GW, YC, WZ), pp. 2857–2862.
KDDKDD-2018-Benson0T #sequence
Sequences of Sets (ARB, RK0, AT), pp. 1148–1157.
KDDKDD-2018-Ertl #algorithm
BagMinHash - Minwise Hashing Algorithm for Weighted Sets (OE), pp. 1368–1377.
AdaEuropeAdaEurope-2018-RealSC #scheduling
Combined Scheduling of Time-Triggered and Priority-Based Task Sets in Ravenscar (JR, SS, AC), pp. 105–122.
PADLPADL-2018-AdrianM #navigation #online #semantics
Navigating Online Semantic Resources for Entity Set Expansion (WTA, MM), pp. 170–185.
PADLPADL-2018-CalimeriFPZ #composition #heuristic #optimisation
Optimizing Answer Set Computation via Heuristic-Based Decomposition (FC, DF, SP, JZ), pp. 135–151.
CAVCAV-2018-KongBH #approximate #using
Reachable Set Over-Approximation for Nonlinear Systems Using Piecewise Barrier Tubes (HK, EB, TAH), pp. 449–467.
IJCARIJCAR-2018-FazekasBB #algorithm #modulo theories #satisfiability
Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories (KF, FB, AB), pp. 134–151.
IJCARIJCAR-2018-HannulaL #automation #reasoning
Automated Reasoning About Key Sets (MH, SL), pp. 47–63.
IJCARIJCAR-2018-IgnatievPNM #approach #satisfiability
A SAT-Based Approach to Learn Explainable Decision Sets (AI, FP, NN, JMS0), pp. 627–645.
ICSAICSA-2017-KlockWGJ #architecture #clustering
Workload-Based Clustering of Coherent Feature Sets in Microservice Architectures (SK, JMEMvdW, JPG, SJ), pp. 11–20.
MSRMSR-2017-IshioSII #analysis #reuse
Source file set search for clone-and-own reuse analysis (TI, YS, KI, KI), pp. 257–268.
MSRMSR-2017-NotenMS #git #ocl
A data set of OCL expressions on GitHub (JN, JM, AS), pp. 531–534.
AFLAFL-2017-BeckerBSFW #word
Unavoidable Sets of Partial Words of Uniform Length (JB, FBS, LF, SW), pp. 26–40.
AFLAFL-2017-BeierHK #complexity #linear #on the
On the Descriptional Complexity of Operations on Semilinear Sets (SB, MH, MK), pp. 41–55.
DLTDLT-2017-RubtsovV #automaton #complexity #on the
On Computational Complexity of Set Automata (AAR, MNV), pp. 332–344.
IFM-2017-BlomDHO #concurrent #parallel #verification
The VerCors Tool Set: Verification of Parallel and Concurrent Software (SB, SD, MH, WO), pp. 102–110.
CIKMCIKM-2017-HuWC #evolution #maintenance
Maintaining Densest Subsets Efficiently in Evolving Hypergraphs (SH, XW, THHC), pp. 929–938.
CIKMCIKM-2017-SongYL #algorithm #multi
SIMD-Based Multiple Sets Intersection with Dual-Scale Search Algorithm (XS, YY, XL), pp. 2311–2314.
ECIRECIR-2017-Recalde #framework #recommendation #social
A Social Framework for Set Recommendation in Group Recommender Systems (LR), pp. 735–743.
ICMLICML-2017-Jiang #estimation
Density Level Set Estimation on Manifolds with DBSCAN (HJ), pp. 1684–1693.
ICMLICML-2017-YangGKSFL #on the
On The Projection Operator to A Three-view Cardinality Constrained Set (HY, SG, CK, DS, RF, JL0), pp. 3871–3880.
KDDKDD-2017-Cohen0Y #big data
A Minimal Variance Estimator for the Cardinality of Big Data Set Intersection (RC, LK0, AY), pp. 95–103.
ECOOPECOOP-2017-FuPAC #declarative #named
muPuppet: A Declarative Subset of the Puppet Configuration Language (WF, RP, PA0, JC), p. 27.
PADLPADL-2017-RathR #object-oriented #programming
Integrating Answer Set Programming with Object-Oriented Languages (JR, CR), pp. 50–67.
PADLPADL-2017-Redl #source code
Extending Answer Set Programs with Interpreted Functions as First-Class Citizens (CR), pp. 68–85.
PPDPPPDP-2017-BartakM #attribute grammar #constraints #domain model #framework #modelling
Attribute grammars with set attributes and global constraints as a unifying framework for planning domain models (RB, AM), pp. 39–48.
QAPLQAPL-2017-SchuppNA #analysis #divide and conquer #hybrid #reachability
Divide and Conquer: Variable Set Separation in Hybrid Systems Reachability Analysis (SS, JN, ), pp. 1–14.
CADECADE-2017-BenderS #metric
Decision Procedures for Theories of Sets with Measures (MB, VSS), pp. 166–184.
CADECADE-2017-CristiaR #strict
A Decision Procedure for Restricted Intensional Sets (MC, GR), pp. 185–201.
ICSMEICSME-2016-AnicheBTDG #architecture #mvc #smell
A Validated Set of Smells in Model-View-Controller Architectures (MFA, GB, CT, AvD, MAG), pp. 233–243.
MSRMSR-2016-Squire #ruby
Data sets: the circle of life in ruby hosting, 2003-2015 (MS), pp. 452–459.
SANERSANER-2016-RoyHAWD #automation #metadata #scalability #spreadsheet
Evaluating Automatic Spreadsheet Metadata Extraction on a Large Set of Responses from MOOC Participants (SR, FH, EA, JW, AvD), pp. 135–145.
CIAACIAA-2016-Prusa #2d #complexity
Complexity of Sets of Two-Dimensional Patterns (DP), pp. 236–247.
DLTDLT-2016-Jirasek #regular expression
Non-regular Maximal Prefix-Free Subsets of Regular Languages (JJJ), pp. 229–242.
FMFM-2016-HouSTLH #architecture #case study #execution #formal method
An Executable Formalisation of the SPARCv8 Instruction Set Architecture: A Case Study for the LEON3 Processor (ZH, DS, AT, YL0, KCH), pp. 388–405.
SEFMSEFM-2016-BendikBBC #analysis #bound #order #requirements #safety
Finding Boundary Elements in Ordered Sets with Application to Safety and Requirements Analysis (JB, NB, JB, IC), pp. 121–136.
CIKMCIKM-2016-LiKR #automation #generative #roadmap #validation
Automatic Generation and Validation of Road Maps from GPS Trajectory Data Sets (HL, LK, KR), pp. 1523–1532.
CIKMCIKM-2016-SeufertBBKEW #named
ESPRESSO: Explaining Relationships between Entity Sets (SS, KB, SJB, SKK, PE, GW), pp. 1311–1320.
ICMLICML-2016-AltschulerBFMRZ #algorithm #bound #distributed
Greedy Column Subset Selection: New Bounds and Distributed Algorithms (JA, AB, GF, VSM, AR, MZ), pp. 2539–2548.
ICPRICPR-2016-Al-DulaimiBTC #automation #geometry #image #segmentation #using
Automatic segmentation of HEp-2 cell Fluorescence microscope images using level set method via geometric active contours (KAD, JB, ITR, VC), pp. 81–83.
ICPRICPR-2016-DaiMZ #evolution #image #performance #segmentation
A Bregman divergence based Level Set Evolution for efficient medical image segmentation (SD, HM, SZ), pp. 1113–1118.
ICPRICPR-2016-DanelljanMKF #probability
Aligning the dissimilar: A probabilistic method for feature-based point set registration (MD, GM, FSK, MF), pp. 247–252.
ICPRICPR-2016-DasBC
An intensity- and region-guided narrow-band level set model for contour tracking (SD, SMB, ASC), pp. 2722–2727.
ICPRICPR-2016-Iwata #distance
Reducing the computational cost of shape matching with the distance set (KI0), pp. 1506–1511.
ICPRICPR-2016-KatsukiI
Bayesian regression selecting valuable subset from mixed bag training data (TK, MI), pp. 2580–2585.
ICPRICPR-2016-MeijerT #validation
Regularizing AdaBoost with validation sets of increasing size (DWJM, DMJT), pp. 192–197.
ICPRICPR-2016-YanRZC #approach #clustering
A constrained clustering based approach for matching a collection of feature sets (JY, ZR, HZ, SMC), pp. 3832–3837.
ICPRICPR-2016-ZemeneAP #retrieval
Constrained dominant sets for retrieval (EZ, LTA, MP), pp. 2568–2573.
ICPRICPR-2016-ZemeneTPP #clustering #detection #using
Simultaneous clustering and outlier detection using dominant sets (EZ, YTT, AP0, MP), pp. 2325–2330.
KDDKDD-2016-LabutovSLLS #data-driven #design #modelling
Optimally Discriminative Choice Sets in Discrete Choice Models: Application to Data-Driven Test Design (IL, FS, KL, HL, CS), pp. 1665–1674.
KDDKDD-2016-LakkarajuBL #framework #predict
Interpretable Decision Sets: A Joint Framework for Description and Prediction (HL, SHB, JL), pp. 1675–1684.
AdaEuropeAdaEurope-2016-RealSC
Combining Time-Triggered Plans with Priority Scheduled Task Sets (JR, SS, AC), pp. 195–212.
LOPSTRLOPSTR-2016-BichlerMW #named #optimisation #programming
lpopt: A Rule Optimization Tool for Answer Set Programming (MB, MM, SW), pp. 114–130.
PLDIPLDI-2016-HeuleS0A #automation #learning #synthesis
Stratified synthesis: automatically learning the x86-64 instruction set (SH, ES, RS0, AA), pp. 237–250.
POPLPOPL-2016-Flatt
Binding as sets of scopes (MF), pp. 705–717.
PPDPPPDP-2016-FuscaGZACP #development #framework #programming
A framework for easing the development of applications embedding answer set programming (DF, SG, JZ, MA, FC, SP), pp. 38–49.
ASEASE-2016-Babur #analysis #modelling #scalability #statistics
Statistical analysis of large sets of models (ÖB), pp. 888–891.
ASEASE-2016-LaghariMD #fault #locality
Fine-tuning spectrum based fault localisation with frequent method item sets (GL, AM, SD), pp. 274–285.
CAVCAV-2016-CristiaR
A Decision Procedure for Sets, Binary Relations and Partial Functions (MC, GR), pp. 179–198.
CAVCAV-2016-XueSE #approximate
Under-Approximating Backward Reachable Sets by Polytopes (BX0, ZS, AE), pp. 457–476.
ICSTICST-2016-FeldtPCY #testing
Test Set Diameter: Quantifying the Diversity of Sets of Test Cases (RF, SMP, DC, SY), pp. 223–233.
IJCARIJCAR-2016-Avron #framework #logic
A Logical Framework for Developing and Mechanizing Set Theories (AA), pp. 3–8.
IJCARIJCAR-2016-BansalRBT #constraints #finite #smt
A New Decision Procedure for Finite Sets and Cardinality Constraints in SMT (KB, AR, CWB, CT), pp. 82–98.
QoSAQoSA-2015-DurisicST #architecture #identification #standard
Identifying Optimal Sets of Standardized Architectural Features: A Method and its Automotive Application (DD, MS, MT), pp. 103–112.
TPDLTPDL-2015-KernM #difference #question #retrieval
Are There Any Differences in Data Set Retrieval Compared to Well-Known Literature Retrieval? (DK, BM), pp. 197–208.
VLDBVLDB-2015-LiuLYXW #graph #independence #towards
Towards Maximum Independent Sets on Massive Graphs (YL, JL, HY, XX, ZW), pp. 2122–2133.
VLDBVLDB-2015-ZhangC0 #approach #distributed #graph
Bonding Vertex Sets Over Distributed Graph: A Betweenness Aware Approach (XZ, HC, LC), pp. 1418–1429.
EDMEDM-2015-BeheshtiD #assessment
Goodness of Fit of Skills Assessment Approaches: Insights from Patterns of Real vs. Synthetic Data Sets (BB, MCD), pp. 368–371.
MSRMSR-2015-VasilescuSF #git #social
A Data Set for Social Diversity Studies of GitHub Teams (BV, AS, VF), pp. 514–517.
SANERSANER-2015-MurakamiHK #named #visualisation
ClonePacker: A tool for clone set visualization (HM, YH, SK), pp. 474–478.
DLTDLT-2015-DolceP
Enumeration Formulæ in Neutral Sets (FD, DP), pp. 215–227.
ICALPICALP-v1-2015-BjorklundDH #exponential #problem #random #strict
The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems (AB, HD, TH), pp. 231–242.
ICALPICALP-v1-2015-GaspersS #algorithm #performance
Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets (SG, GBS), pp. 567–579.
ICALPICALP-v1-2015-KariKMPS #np-hard #synthesis
Binary Pattern Tile Set Synthesis Is NP-hard (LK, SK, PÉM, MJP, SS), pp. 1022–1034.
ICALPICALP-v1-2015-KarpinskiLS
A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set (MK, AL, DS), pp. 785–796.
ICALPICALP-v1-2015-LokshtanovRS #algorithm #feedback #linear
Linear Time Parameterized Algorithms for Subset Feedback Vertex Set (DL, MSR, SS), pp. 935–946.
ICALPICALP-v2-2015-CiobanuDE #equation
Solution Sets for Equations over Free Groups are EDT0L Languages (LC, VD, ME), pp. 134–145.
ICALPICALP-v2-2015-ColcombetS #linear #order #quantifier
Limited Set quantifiers over Countable Linear Orderings (TC, AVS), pp. 146–158.
LATALATA-2015-LeonM #partial order
Building Bridges Between Sets of Partial Orders (HPdL, AM), pp. 145–160.
FMFM-2015-DiekmannHC #semantics
Semantics-Preserving Simplification of Real-World Firewall Rule Sets (CD, LH, GC), pp. 195–212.
TLCATLCA-2015-BezemCP
Non-Constructivity in Kan Simplicial Sets (MB, TC, EP), pp. 92–106.
ICGTICGT-2015-RadkeABHT #constraints #graph #invariant #ocl
Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations (HR, TA, JSB, AH, GT), pp. 155–170.
CHICHI-2015-KleimanLDFC #image #named #similarity
DynamicMaps: Similarity-based Browsing through a Massive Set of Images (YK, JL, DD, YF, DCO), pp. 995–1004.
HCIDUXU-IXD-2015-IslamI #comprehension #interface #ontology #semantics #web
Understanding the Semantics of Web Interface Signs: A Set of Ontological Principals (MNI, AKMNI), pp. 46–53.
HCIHCI-DE-2015-SantosFD #case study #evaluation #heuristic #using #visualisation
Heuristic Evaluation in Information Visualization Using Three Sets of Heuristics: An Exploratory Study (BSS, BQF, PD), pp. 259–270.
ICEISICEIS-v1-2015-JuniorS #approach #compilation #optimisation #reasoning
Finding Good Compiler Optimization Sets — A Case-based Reasoning Approach (NLQJ, AFdS), pp. 504–515.
ICEISICEIS-v1-2015-OsbornM #scalability
The mqr-tree for Very Large Object Sets (WO, MM), pp. 367–373.
ICEISICEIS-v2-2015-CruzMS #modelling #process
Deriving a Data Model from a Set of Interrelated Business Process Models (EFC, RJM, MYS), pp. 49–59.
ICEISICEIS-v2-2015-CruzMS15a #modelling #process
Bridging the Gap between a Set of Interrelated Business Process Models and Software Models (EFC, RJM, MYS), pp. 338–345.
ICEISICEIS-v3-2015-CanteriGSI #design #education #game studies #guidelines #video
Video Games in Education of Deaf Children — A Set of Pratical Design Guidelines (RdPC, LSG, TAFdS, CEAI), pp. 122–129.
CIKMCIKM-2015-BagdouriO #microblog #using
Profession-Based Person Search in Microblogs: Using Seed Sets to Find Journalists (MB, DWO), pp. 593–602.
CIKMCIKM-2015-ChenQW #estimation #on the
On Gapped Set Intersection Size Estimation (CC0, JQ, WW0), pp. 1351–1360.
CIKMCIKM-2015-LiuZXLL #nondeterminism #probability
Finding Probabilistic k-Skyline Sets on Uncertain Data (JL, HZ, LX0, HL, JL), pp. 1511–1520.
ICMLICML-2015-GarberH #performance
Faster Rates for the Frank-Wolfe Method over Strongly-Convex Sets (DG, EH), pp. 541–549.
ICMLICML-2015-GasseAE #classification #composition #multi #on the
On the Optimality of Multi-Label Classification under Subset Zero-One Loss for Distributions Satisfying the Composition Property (MG, AA, HE), pp. 2531–2539.
ICMLICML-2015-HuangWSLC #classification #image #learning #metric #symmetry
Log-Euclidean Metric Learning on Symmetric Positive Definite Manifold with Application to Image Set Classification (ZH, RW, SS, XL, XC), pp. 720–729.
ICMLICML-2015-LimKPJ #performance #scalability
Double Nyström Method: An Efficient and Accurate Nyström Scheme for Large-Scale Data Sets (WL, MK, HP, KJ), pp. 1367–1375.
ICMLICML-2015-RajkumarGL0 #probability #ranking
Ranking from Stochastic Pairwise Preferences: Recovering Condorcet Winners and Tournament Solution Sets at the Top (AR, SG, LHL, SA), pp. 665–673.
ICMLICML-2015-WeiIB #learning
Submodularity in Data Subset Selection and Active Learning (KW, RKI, JAB), pp. 1954–1963.
ICMLICML-2015-Yang0JZ #bound #fault
An Explicit Sampling Dependent Spectral Error Bound for Column Subset Selection (TY, LZ, RJ, SZ), pp. 135–143.
KDDKDD-2015-StergiouT #web
Set Cover at Web Scale (SS, KT), pp. 1125–1133.
SEKESEKE-2015-GaoKN
Combining Feature Subset Selection and Data Sampling for Coping with Highly Imbalanced Software Data (KG, TMK, AN), pp. 439–444.
OOPSLAOOPSLA-2015-KurajKJ #programming
Programming with enumerable sets of structures (IK, VK, DJ), pp. 37–56.
POPLPOPL-2015-GuptaHRST #concurrent #representation
Succinct Representation of Concurrent Trace Sets (AG, TAH, AR, RS, TT), pp. 433–444.
SASSAS-2015-BakhirkinBP #analysis
A Forward Analysis for Recurrent Sets (AB, JB, NP), pp. 293–311.
SACSAC-2015-SeifertSG #personalisation #towards
Towards a feature-rich data set for personalized access to long-tail content (CS, JS, MG), pp. 1031–1038.
SACSAC-2015-SidneyMRH #performance #predict #similarity
Performance prediction for set similarity joins (CFS, DSM, LAR, TH), pp. 967–972.
SACSAC-2015-XuanLXT #empirical #fault #metric #predict #using
Evaluating defect prediction approaches using a massive set of metrics: an empirical study (XX, DL, XX, YT), pp. 1644–1647.
DACDAC-2015-EspinosaHAAR #analysis #correlation #robust #verification
Analysis and RTL correlation of instruction set simulators for automotive microcontroller robustness verification (JE, CH, JA, DdA, JCR), p. 6.
DATEDATE-2015-NguyenSCM #performance #robust
Efficient attacks on robust ring oscillator PUF with enhanced challenge-response set (PHN, DPS, RSC, DM), pp. 641–646.
DATEDATE-2015-TeysseyreNOCCG #performance #simulation #using
Fast optical simulation from a reduced set of impulse responses using SystemC-AMS (FT, DN, IO, FC, FC, OG), pp. 405–409.
FoSSaCSFoSSaCS-2015-JacobsWW
States of Convex Sets (BJ, BW, BW), pp. 87–101.
STOCSTOC-2015-BansalGG #graph #independence #on the
On the Lovász Theta function for Independent Sets in Sparse Graphs (NB, AG, GG), pp. 193–200.
CADECADE-2015-Paulson #automaton #finite #formal method #using
A Formalisation of Finite Automata Using Hereditarily Finite Sets (LCP), pp. 231–245.
CAVCAV-2015-BacchusK #satisfiability #using
Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets (FB, GK), pp. 70–86.
ICLPICLP-2015-BrocheninM #reasoning
Abstract Answer Set Solvers for Cautious Reasoning (RB, MM), pp. 179–190.
ICLPICLP-2015-Harrison #formal method #programming
Formal Methods for Answer Set Programming (AH), pp. 311–318.
ICLPICLP-2015-LeeWZ #automation #programming #reasoning #using
Automated Reasoning about XACML 3.0 Delegation Using Answer Set Programming (JL, YW, YZ), pp. 247–259.
ICLPICLP-2015-SchullerW #case study #programming
Answer Set Application Programming: a Case Study on Tetris (PS, AW), pp. 73–86.
ICLPICLP-2015-Wang #consistency #nondeterminism #probability #programming
Handling Probability and Inconsistency in Answer Set Programming (YW), pp. 319–329.
ICLPICLP-J-2015-AlvianoFG #programming #recursion
Rewriting recursive aggregates in answer set programming: back to monotonicity (MA, WF, MG), pp. 559–573.
ICLPICLP-J-2015-AlvianoL #compilation #complexity #programming
Complexity and compilation of GZ-aggregates in answer set programming (MA, NL), pp. 574–587.
ICLPICLP-J-2015-AlvianoP #fuzzy #modulo theories #satisfiability
Fuzzy answer set computation via satisfiability modulo theories (MA, RP), pp. 588–603.
ICLPICLP-J-2015-CristiaRF #constraints #logic programming
Adding partial functions to Constraint Logic Programming with sets (MC, GR, CSF), pp. 651–665.
ICLPICLP-J-2015-KoponenOJS #optimisation #programming #using
Optimizing phylogenetic supertrees using answer set programming (LK, EO, TJ, LS), pp. 604–619.
ICLPICLP-J-2015-LawRB #constraints #learning #programming
Learning weak constraints in answer set programming (ML, AR, KB), pp. 511–525.
LICSLICS-2015-PaulyB
Descriptive Set Theory in the Category of Represented Spaces (AP, MdB), pp. 438–449.
VMCAIVMCAI-2015-GhorbalSP #algebra #difference #proving
A Hierarchy of Proof Rules for Checking Differential Invariance of Algebraic Sets (KG, AS, AP), pp. 431–448.
PODSPODS-2014-PaghSW #question
Is min-wise hashing optimal for summarizing set intersection? (RP, MS, DPW), pp. 109–120.
SIGMODSIGMOD-2014-AlvanakiM #correlation #scalability
Tracking set correlations at large scale (FA, SM), pp. 1507–1518.
SIGMODSIGMOD-2014-ArnoldHFSKL #database
An application-specific instruction set for accelerating set-oriented database primitives (OA, SH, GF, BS, TK, WL), pp. 767–778.
SIGMODSIGMOD-2014-ChenKYYZ #robust
Robust set reconciliation (DC, CK, KY, WY, QZ), pp. 135–146.
VLDBVLDB-2014-ChesterTVW
Computing k-Regret Minimizing Sets (SC, AT, SV, SW), pp. 389–400.
VLDBVLDB-2014-Song0C #on the
On Concise Set of Relative Candidate Keys (SS, LC, HC), pp. 1179–1190.
VLDBVLDB-2015-InoueOT14 #branch #performance #predict
Faster Set Intersection with SIMD instructions by Reducing Branch Mispredictions (HI, MO, KT), pp. 293–304.
VLDBVLDB-2015-Li0QYZ014 #query #using
Processing Moving kNN Queries Using Influential Neighbor Sets (CL, YG, JQ, GY, RZ, WY), pp. 113–124.
EDMEDM-2014-BeheshtiD #assessment #performance #predict
Predictive performance of prevailing approaches to skills assessment techniques: Insights from real vs. synthetic data sets (BB, MCD), pp. 409–410.
MSRMSR-2014-BaldassariP #comprehension #evolution
Understanding software evolution: the maisqual ant data set (BB, PP), pp. 424–427.
AFLAFL-2014-Vorel #automaton #transitive
Subset Synchronization of Transitive Automata (VV), pp. 370–381.
DLTDLT-2014-KutribMW #automaton
Deterministic Set Automata (MK, AM, MW), pp. 303–314.
ICALPICALP-v1-2014-EmekR
Semi-Streaming Set Cover — (YE, AR), pp. 453–464.
ICALPICALP-v2-2014-0002HKSV #independence #online #worst-case
Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods (OG, MH, TK, TS, BV), pp. 508–519.
ICALPICALP-v2-2014-BorelloCV #automaton
Turing Degrees of Limit Sets of Cellular Automata (AB, JC, PV), pp. 74–85.
ICALPICALP-v2-2014-Ghaffari #approximate #distributed
Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set (MG), pp. 483–494.
RTARTA-TLCA-2014-CarvalhoS #decidability #polynomial
An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting (DdC, JGS), pp. 179–193.
CHICHI-2014-LeivaS #empirical
Representatively memorable: sampling the right phrase set to get the text entry experiment right (LAL, GST), pp. 1709–1712.
HCIHCI-AS-2014-NakanoTA #case study #experience #html #induction #user interface
A Preliminary Study of Relation Induction between HTML Tag Set and User Experience (AN, AT, MA), pp. 49–56.
HCIHCI-TMT-2014-MartinSPK #mobile
HCI-Patterns for Developing Mobile Apps and Digital Video-Assist-Technology for the Film Set (CM, AS, BP, AK), pp. 320–330.
ICEISICEIS-v2-2014-EstacioP #distributed #programming
A Set of Practices for Distributed Pair Programming (BJdSE, RP), pp. 331–338.
ICMLICML-c2-2014-LiuD #learning #problem
Learnability of the Superset Label Learning Problem (LPL, TGD), pp. 1629–1637.
ICPRICPR-2014-ChakeriH #approach #clustering #framework #game studies
Dominant Sets as a Framework for Cluster Ensembles: An Evolutionary Game Theory Approach (AC, LOH), pp. 3457–3462.
ICPRICPR-2014-CorringR #probability #representation
Shape from Phase: An Integrated Level Set and Probability Density Shape Representation (JC, AR), pp. 46–51.
ICPRICPR-2014-HouXCXQ #clustering #robust
Robust Clustering Based on Dominant Sets (JH, EX, LC, QX, NQ), pp. 1466–1471.
ICPRICPR-2014-KacheleS #independence #recognition
Cascaded Fusion of Dynamic, Spatial, and Textural Feature Sets for Person-Independent Facial Emotion Recognition (MK, FS), pp. 4660–4665.
ICPRICPR-2014-KumarK #adaptation #multimodal #recognition #security #using
Adaptive Security for Human Surveillance Using Multimodal Open Set Biometric Recognition (AK, AK), pp. 405–410.
ICPRICPR-2014-MehriMHGMM #benchmark #documentation #evaluation #metric #performance
Performance Evaluation and Benchmarking of Six Texture-Based Feature Sets for Segmenting Historical Documents (MM, MM, PH, PGK, MAM, RM), pp. 2885–2890.
ICPRICPR-2014-NegiC #identification #image
Identifying Diverse Set of Images in Flickr (SN, SC), pp. 3624–3629.
ICPRICPR-2014-QuLWXT #framework #robust
Robust Point Set Matching under Variational Bayesian Framework (HBQ, JCL, JQW, LX, HJT), pp. 58–63.
ICPRICPR-2014-SousaSB #case study #classification
Time Series Transductive Classification on Imbalanced Data Sets: An Experimental Study (CARdS, VMAdS, GEAPAB), pp. 3780–3785.
ICPRICPR-2014-Yildiz
VC-Dimension of Rule Sets (OTY), pp. 3576–3581.
ICPRICPR-2014-YuCK #distance #recognition #using
Pill Recognition Using Imprint Information by Two-Step Sampling Distance Sets (JY, ZC, SiK), pp. 3156–3161.
KDDKDD-2014-ChenC #incremental #named #rank
LWI-SVD: low-rank, windowed, incremental singular value decompositions on time-evolving data sets (XC, KSC), pp. 987–996.
KDDKDD-2014-KloumannK #community #identification
Community membership identification from small seed sets (IMK, JMK), pp. 1366–1375.
KDDKDD-2014-ZhangCSWZ #network #probability #social
Minimizing seed set selection with probabilistic coverage guarantee in a social network (PZ, WC, XS, YW, JZ), pp. 1306–1315.
KDIRKDIR-2014-HubwieserM #education #mining #scalability
Competency Mining in Large Data Sets — Preparing Large Scale Investigations in Computer Science Education (PH, AM), pp. 315–322.
KDIRKDIR-2014-Sydow #towards #visualisation
Towards Integrity in Diversity-aware Small Set Selection and Visualisation Tasks (MS), pp. 480–484.
KRKR-2014-BeekSH #semantics #web
Rough Set Semantics for Identity on the Web (WB, SS, FvH).
KRKR-2014-ClercqBSCN #game studies #programming #using
Using Answer Set Programming for Solving Boolean Games (SDC, KB, SS, MDC, AN).
KRKR-2014-Dyrkolbotn #how #using
How to Argue for Anything: Enforcing Arbitrary Sets of Labellings using AFs (SKD).
RERE-2014-SaitoTYA #design #named #quality #requirements
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.
ASEASE-2014-HagiharaESY #satisfiability #specification
Minimal strongly unsatisfiable subsets of reactive system specifications (SH, NE, MS, NY), pp. 629–634.
ASEASE-2014-PruijtKWB #architecture #named
HUSACCT: architecture compliance checking with rich sets of module and rule types (LJP, CK, JMvdW, SB), pp. 851–854.
SACSAC-2014-BertoutFO #automation #clustering #heuristic #realtime
A heuristic to minimize the cardinality of a real-time task set by automated task clustering (AB, JF, RO), pp. 1431–1436.
DACDAC-2014-CuiCBC #optimisation
A Swap-based Cache Set Index Scheme to Leverage both Superpage and Page Coloring Optimizations (ZC, LC, YB, MC), p. 6.
DATEDATE-2014-SchollW #hardware #implementation
Hardware implementation of a Reed-Solomon soft decoder based on information set decoding (SS, NW), pp. 1–6.
STOCSTOC-2014-ForbesSS #algebra #branch #multi #order #source code
Hitting sets for multilinear read-once algebraic branching programs, in any order (MAF, RS, AS), pp. 867–875.
CAVCAV-2014-CoxCS #abstraction #library #named #parametricity #reuse
QUICr: A Reusable Library for Parametric Abstraction of Sets and Numbers (AC, BYEC, SS), pp. 866–873.
ICLPICLP-J-2014-AlvianoDR #programming
Anytime Computation of Cautious Consequences in Answer Set Programming (MA, CD, FR), pp. 755–770.
ICLPICLP-J-2014-Antic #on the #source code
On Cascade Products of Answer Set Programs (CA), pp. 711–723.
ICLPICLP-J-2014-HoosLS #algorithm #programming
claspfolio 2: Advances in Algorithm Selection for Answer Set Programming (HH, MTL, TS), pp. 569–585.
ICLPICLP-J-2014-MarpleG #consistency #programming
Dynamic Consistency Checking in Goal-Directed Answer Set Programming (KM, GG), pp. 415–427.
ICSTICST-2014-AmmannDO
Establishing Theoretical Minimal Sets of Mutants (PA, MED, JO), pp. 21–30.
ISSTAISSTA-2014-LoyolaSKR #automation #named
Dodona: automated oracle data set selection (PL, MS, IYK, GR), pp. 193–203.
LICSLICS-CSL-2014-BovaGS #logic #model checking #order
Model checking existential logic on partially ordered sets (SB, RG, SS), p. 10.
LICSLICS-CSL-2014-Chen #first-order #query
The tractability frontier of graph-like first-order query sets (HC), p. 9.
ICSTSAT-2014-BalyoFHB #afraid to ask
Everything You Always Wanted to Know about Blocked Sets (But Were Afraid to Ask) (TB, AF, MH, AB), pp. 317–332.
ICSTSAT-2014-IgnatievMM #independence #on the #satisfiability
On Reducing Maximum Independent Set to Minimum Satisfiability (AI, AM, JMS), pp. 103–120.
SMTSMT-2014-LamC #reasoning
Reasoning About Set Comprehensions (ESLL, IC), pp. 27–37.
ICDARICDAR-2013-GotoIFU #graph #scalability #using
Analyzing the Distribution of a Large-Scale Character Pattern Set Using Relative Neighborhood Graph (MG, RI, YF, SU), pp. 3–7.
ICDARICDAR-2013-SuDPL13a #independence #novel #recognition
A Novel Baseline-independent Feature Set for Arabic Handwriting Recognition (BS, XD, LP, CL), pp. 1250–1254.
JCDLJCDL-2013-BeckerD #benchmark #corpus #metric #modelling #using
Free benchmark corpora for preservation experiments: using model-driven engineering to generate data sets (CB, KD), pp. 349–358.
PODSPODS-2013-Wong #calculus #power of #relational
A dichotomy in the intensional expressive power of nested relational calculi augmented with aggregate functions and a powerset operator (LW), pp. 285–296.
PASTEPASTE-2013-DingesCA #automation #concurrent #execution
Automated inference of atomic sets for safe concurrent execution (PD, MC, GA), pp. 1–8.
WCREWCRE-2013-SalesTMV #dependence #recommendation #refactoring #using
Recommending Move Method refactorings using dependency sets (VS, RT, LFM, MTV), pp. 232–241.
DLTDLT-2013-MarsaultS
Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure (VM, JS), pp. 362–373.
ICALPICALP-v1-2013-AustrinKKM #algorithm #trade-off
Space-Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm (PA, PK, MK, JM), pp. 45–56.
ICALPICALP-v1-2013-GlasserNRSW #polynomial #reduction
Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions (CG, DTN, CR, ALS, MW), pp. 473–484.
ICALPICALP-v1-2013-GolovachHKV #algorithm #incremental #polynomial
An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets (PAG, PH, DK, YV), pp. 485–496.
ICALPICALP-v1-2013-SviridenkoW #problem #scalability
Large Neighborhood Local Search for the Maximum Set Packing Problem (MS, JW), pp. 792–803.
ICALPICALP-v2-2013-LohreySZ
Rational Subsets and Submonoids of Wreath Products (ML, BS, GZ), pp. 361–372.
CHICHI-2013-NacentaKQK #gesture
Memorability of pre-designed and user-defined gesture sets (MAN, YK, YQ, POK), pp. 1099–1108.
HCIDUXU-PMT-2013-FischerSN #design #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.
HCIHCI-III-2013-WangLDHY #detection
A Coastline Detection Method Based on Level Set (QW, KL, FD, NH, LY), pp. 216–226.
HCIHIMI-D-2013-MogawaSI #algorithm #product line #representation
Generalized Algorithm for Obtaining a Family of Evaluating Attributes’ Sets Representing Customer’s Preference (TM, FS, SI), pp. 494–504.
CIKMCIKM-2013-NguyenLT #code review #performance #using
Using micro-reviews to select an efficient set of reviews (TSN, HWL, PT), pp. 1067–1076.
ICMLICML-c1-2013-BuhlerRSH #clustering #community #detection #source code
Constrained fractional set programs and their application in local clustering and community detection (TB, SSR, SS, MH), pp. 624–632.
KDDKDD-2013-BaiJS #automation #generative
Exploiting user clicks for automatic seed set generation for entity matching (XB, FPJ, SHS), pp. 980–988.
KEODKEOD-2013-NogueiraG #multi #nondeterminism #programming
Supply Chain Tracing of Multiple Products under Uncertainty and Incomplete Information — An Application of Answer Set Programming (MLN, NPG), pp. 399–406.
RecSysRecSys-2013-AharonABLABLRS #named #online #persistent #recommendation
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.
SEKESEKE-2013-StringfellowRVM #comparison #multi
Comparison of SRGMs and NNEs on Multiple Data Sets (CS, SR, RVT, SM), pp. 618–623.
OOPSLAOOPSLA-2013-DeLozierENOMZ #c++ #type safety
Ironclad C++: a library-augmented type-safe subset of c++ (CD, RAE, SN, PMO, MMKM, SZ), pp. 287–304.
HILTHILT-2013-Taft13a #ada #parallel #programming
Bringing safe, dynamic parallel programming to the spark verifiable subset of ada (STT), pp. 37–40.
ICSEICSE-2013-VouillonC #evolution #repository
Broken sets in software repository evolution (JV, RDC), pp. 412–421.
SACSAC-2013-CameronCL #memory management #mining
Stream mining of frequent sets with limited memory (JJC, AC, CKSL), pp. 173–175.
SACSAC-2013-KhaniHAB #algorithm #clustering #semistructured data
An algorithm for discovering clusters of different densities or shapes in noisy data sets (FK, MJH, AAA, HB), pp. 144–149.
SACSAC-2013-LikitvivatanavongY
Many-to-many interchangeable sets of values in CSPs (CL, RHCY), pp. 86–91.
CGOCGO-2013-LiHCZ0L #debugging #effectiveness #fault #locality
Effective fault localization based on minimum debugging frontier set (FL, WH, CC, LZ, XF, ZL), p. 10.
DACDAC-2013-KuruvillaSPVC #analysis #optimisation #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.
DACDAC-2013-WagstaffGFT #architecture #partial evaluation
Early partial evaluation in a JIT-compiled, retargetable instruction set simulator generated from a high-level architecture description (HW, MG, BF, NPT), p. 6.
DACDAC-2013-WuH #constraints #framework #multi #random #robust #theorem proving #verification
A robust constraint solving framework for multiple constraint sets in constrained random verification (BHW, CY(H), p. 7.
DATEDATE-2013-AhmadyanV #analysis #reachability #reduction
Reachability analysis of nonlinear analog circuits through iterative reachable set reduction (SNA, SV), pp. 1436–1441.
DATEDATE-2013-AnanthanarayananGP #detection #fault #low cost #using
Low cost permanent fault detection using ultra-reduced instruction set co-processors (SA, SG, HDP), pp. 933–938.
DATEDATE-2013-JiangEP #embedded #optimisation
Optimization of secure embedded systems with dynamic task sets (KJ, PE, ZP), pp. 1765–1770.
DATEDATE-2013-Pomeranz #equivalence #fault #graph #on the
On candidate fault sets for fault diagnosis and dominance graphs of equivalence classes (IP), pp. 1083–1088.
DATEDATE-2013-YuZHWLT #approach #manycore #simulation
A critical-section-level timing synchronization approach for deterministic multi-core instruction set simulations (FWY, BHZ, YHH, HIW, CRL, RST), pp. 643–648.
PDPPDP-2013-DaneluttoT #parallel #programming
A RISC Building Block Set for Structured Parallel Programming (MD, MT), pp. 46–50.
FASEFASE-2013-HaslingerLE #feature model #modelling #on the
On Extracting Feature Models from Sets of Valid Feature Combinations (ENH, RELH, AE), pp. 53–67.
FoSSaCSFoSSaCS-2013-Clouston #abstraction
Generalised Name Abstraction for Nominal Sets (RC), pp. 434–449.
STOCSTOC-2013-Thorup #independence #similarity
Bottom-k and priority sampling, set similarity and subset sums with minimal independence (MT), pp. 371–380.
CAVCAV-2013-ClaessenFIPW #model checking #network #reachability
Model-Checking Signal Transduction Networks through Decreasing Reachability Sets (KC, JF, SI, NP, QW), pp. 85–100.
CAVCAV-2013-Marques-SilvaJB
Minimal Sets over Monotone Predicates in Boolean Formulae (JMS, MJ, AB), pp. 592–607.
CAVCAV-2013-PauleveAK #approximate #automaton #network #reachability #scalability
Under-Approximating Cut Sets for Reachability in Large Scale Automata Networks (LP, GA, HK), pp. 69–84.
ICLPICLP-J-2013-AlvianoP #approximate #fuzzy
Fuzzy answer sets approximations (MA, RP), pp. 753–767.
ICLPICLP-J-2013-BanbaraSTIS #modelling #programming
Answer set programming as a modeling language for course timetabling (MB, TS, NT, KI, TS), pp. 783–798.
ICLPICLP-J-2013-GiordanoMSD #constraints #process #programming #verification
Business process verification with constraint temporal answer set programming (LG, AM, MS, DTD), pp. 641–655.
LICSLICS-2013-Colcombet #logic #monad #using #word
Magnitude Monadic Logic over Words and the Use of Relative Internal Set Theory (TC), p. 123.
ICSTSAT-2013-MisraORS #bound #detection
Upper and Lower Bounds for Weak Backdoor Set Detection (NM, SO, VR, SS), pp. 394–402.
DLTDLT-J-2011-ChenYSLL12 #multi #network
Minimum Local Disk Cover Sets for Broadcasting in Heterogeneous Multihop Wireless Networks (GC, CWY, MTS, FCL, WCL), pp. 1147–1172.
ICALPICALP-v1-2012-ChitnisCHM #feedback #parametricity
Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable (RHC, MC, MTH, DM), pp. 230–241.
ICALPICALP-v1-2012-SahaK
Set Cover Revisited: Hypergraph Cover with Hard Capacities (BS, SK), pp. 762–773.
ICALPICALP-v2-2012-BojanczykP #infinity #regular expression
Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets (MB, TP), pp. 104–115.
LATALATA-2012-Genova #normalisation
Forbidding Sets and Normal Forms for Language Forbidding-Enforcing Systems (DG), pp. 289–300.
LATALATA-2012-RowlandS
k-Automatic Sets of Rational Numbers (ER, JS), pp. 490–501.
LATALATA-2012-SaloT #automaton #finite #on the #product line
On Stable and Unstable Limit Sets of Finite Families of Cellular Automata (VS, IT), pp. 502–513.
RTARTA-2012-SeveriV #combinator #logic
Meaningless Sets in Infinitary Combinatory Logic (PS, FJdV), pp. 288–304.
FLOPSFLOPS-2012-MartinFS #eclipse #integer
Extending the TOY System with the ECLiPSe Solver over Sets of Integers (SEM, JCF, FSP), pp. 120–135.
ICEISICEIS-v1-2012-HudecS #fuzzy #query
Construction of Fuzzy Sets and Applying Aggregation Operators for Fuzzy Queries (MH, FS), pp. 253–258.
CIKMCIKM-2012-CandanRSW #named #scalability #visualisation
STFMap: query- and feature-driven visualization of large time series data sets (KSC, RR, MLS, XW), pp. 2743–2745.
CIKMCIKM-2012-LuZZX #image #learning #scalability #semantics
Semantic context learning with large-scale weakly-labeled image set (YL, WZ, KZ, XX), pp. 1859–1863.
CIKMCIKM-2012-ZhangWH #integer #linear #programming
Selecting expansion terms as a set via integer linear programming (QZ, YW, XH), pp. 2399–2402.
ICMLICML-2012-KalyanakrishnanTAS #multi #probability
PAC Subset Selection in Stochastic Multi-armed Bandits (SK, AT, PA, PS), p. 34.
ICMLICML-2012-QuadriantoCL #clique #graph #persistent
The Most Persistent Soft-Clique in a Set of Sampled Graphs (NQ, CC, CHL), p. 32.
ICPRICPR-2012-AnoopMBBR #representation
Covariance profiles: A signature representation for object sets (AKA, AM, UDB, CB, KRR), pp. 2541–2544.
ICPRICPR-2012-HouXCXQ #clique
Dominant set and target clique extraction (JH, EX, LC, QX, NQ), pp. 1831–1834.
ICPRICPR-2012-Largeteau-SkapinZASK
Optimal consensus set and preimage of 4-connected circles in a noisy environment (GLS, RZ, EA, AS, YK), pp. 3774–3777.
ICPRICPR-2012-RebagliatiSPS #distance #edit distance #graph #using
Computing the graph edit distance using dominant sets (NR, ASR, MP, FS), pp. 1080–1083.
KDDKDD-2012-GionisLT
Estimating entity importance via counting set covers (AG, TL, ET), pp. 687–695.
KDDKDD-2012-LappasCT
Selecting a characteristic set of reviews (TL, MC, ET), pp. 832–840.
KDDKDD-2012-LiuZW
Finding minimum representative pattern sets (GL, HZ, LW), pp. 51–59.
KDIRKDIR-2012-MountassirBB #analysis #problem #semistructured data #sentiment
Addressing the Problem of Unbalanced Data Sets in Sentiment Analysis (AM, HB, IB), pp. 306–311.
KEODKEOD-2012-NogueiraG #programming #using
Recall-driven Product Tracing and Supply Chain Tracking using Answer Set Programming (MLN, NPG), pp. 125–133.
KRKR-2012-BahmaniBKL #declarative #dependence #source code
Declarative Entity Resolution via Matching Dependencies and Answer Set Programs (ZB, LEB, SK, LVSL).
KRKR-2012-BaralD #automation #how #learning #programming
Solving Puzzles Described in English by Automated Translation to Answer Set Programming and Learning How to Do that Translation (CB, JD).
KRKR-2012-ChaudhriS #knowledge base #programming #reasoning #specification #using
Specifying and Reasoning with Underspecified Knowledge Bases Using Answer Set Programming (VKC, TCS).
KRKR-2012-FebbraroLGR #framework #java #named #programming
JASP: A Framework for Integrating Answer Set Programming with Java (OF, NL, GG, FR).
KRKR-2012-GebserGKOSS #programming #reasoning
Stream Reasoning with Answer Set Programming: Preliminary Report (MG, TG, RK, PO, OS, TS).
KRKR-2012-LiuJN #integer #programming
Answer Set Programming via Mixed Integer Programming (GL, TJ, IN).
KRKR-2012-MorettiT #ranking #using
Ranking Sets of Possibly Interacting Objects Using Shapley Extensions (SM, AT).
KRKR-2012-ThomazoBMR #algorithm #query
A Generic Querying Algorithm for Greedy Sets of Existential Rules (MT, JFB, MLM, SR).
SEKESEKE-2012-CunhaCAM #modelling #product line
A Set of Inspection Techniques on Software Product Line Models (RC, TC, ESdA, JCM), pp. 657–662.
BXBX-2012-Stevens #bidirectional
Observations relating to the equivalences induced on model sets by bidirectional transformations (PS), pp. 100–115.
LOPSTRLOPSTR-2012-MarpleG #named
Galliwasp: A Goal-Directed Answer Set Solver (KM, GG), pp. 122–136.
LOPSTRLOPSTR-2012-RamliNN #programming
XACML 3.0 in Answer Set Programming (CDPKR, HRN, FN), pp. 89–105.
PPDPPPDP-2012-MarpleBMG #execution #source code
Goal-directed execution of answer set programs (KM, AB, RM, GG), pp. 35–44.
ASEASE-2012-RubinC #difference #using
Locating distinguishing features using diff sets (JR, MC), pp. 242–245.
SACSAC-2012-Kerschbaum #outsourcing
Collusion-resistant outsourcing of private set intersection (FK), pp. 1451–1456.
CASECASE-2012-SintovRMS #algorithm
A common 3-finger grasp search algorithm for a set of planar objects (AS, SR, RM, AS), pp. 1095–1100.
CASECASE-2012-ZhangLCCJ #simulation
An improved simulation budget allocation procedure to efficiently select the optimal subset of many alternatives (SZ, LHL, EPC, CHC, HYJ), pp. 230–236.
CGOCGO-2012-MurrayF #automation #compilation
Compiling for automatically generated instruction set extensions (ACM, BF), pp. 13–22.
DACDAC-2012-RajendiranAPTG #reliability
Reliable computing with ultra-reduced instruction set co-processors (AR, SA, HDP, MVT, SG), pp. 697–702.
HPCAHPCA-2012-SanchezK #encoding #flexibility #named #scalability
SCD: A scalable coherence directory with flexible sharer set encoding (DS, CK), pp. 129–140.
LCTESLCTES-2012-KyleBFLT #embedded #manycore #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.
WRLAWRLA-J-2010-KatelmanKM12 #semantics
Rewriting semantics of production rule sets (MK, SK, JM), pp. 929–956.
STOCSTOC-2012-DvirL
Subspace evasive sets (ZD, SL), pp. 351–358.
STOCSTOC-2012-Sherstov #communication #complexity #multi
The multiparty communication complexity of set disjointness (AAS), pp. 525–548.
ICLPICLP-2012-Balduccini #source code
An Answer Set Solver for non-Herbrand Programs: Progress Report (MB), pp. 49–60.
ICLPICLP-2012-DeneckerLTV #programming #semantics
A Tarskian Informal Semantics for Answer Set Programming (MD, YL, MT, JV), pp. 277–289.
ICLPICLP-2012-Dieguez #programming
Temporal Answer Set Programming (MD), pp. 445–450.
ICLPICLP-2012-DrescherW #generative #lazy evaluation
Answer Set Solving with Lazy Nogood Generation (CD, TW), pp. 188–200.
ICLPICLP-2012-MorakW #preprocessor #programming
Preprocessing of Complex Non-Ground Rules in Answer Set Programming (MM, SW), pp. 247–258.
ICLPICLP-2012-Redl #programming
Answer Set Programming with External Sources (CR), pp. 469–475.
ICLPICLP-2012-SchandaB #development #programming #using
Using Answer Set Programming in the Development of Verified Software (FS, MB), pp. 72–85.
ICLPICLP-J-2012-BaralDGG #algorithm #correctness #programming #λ-calculus
Typed answer set programming λ calculus theories and correctness of inverse λ algorithms with respect to them (CB, JD, MAG, AG), pp. 775–791.
LICSLICS-2012-AdamekMBL #monad
Coproducts of Monads on Set (JA, SM, NB, PBL), pp. 45–54.
SMTSMT-2012-FalkeSM #array #formal method
A Theory of Arrays with set and copy Operations (SF, CS, FM), pp. 98–108.
HTHT-2011-ZhangL #documentation
Entity set expansion in opinion documents (LZ, BL), pp. 281–290.
ICDARICDAR-2011-BukhariSB #using
Text-Line Extraction Using a Convolution of Isotropic Gaussian Filter with a Set of Line Filters (SSB, FS, TMB), pp. 579–583.
SIGMODSIGMOD-2011-TekleL #datalog #performance #query
More efficient datalog queries: subsumptive tabling beats magic sets (KTT, YAL), pp. 661–672.
VLDBVLDB-2011-DingK #in memory #memory management #performance
Fast Set Intersection in Memory (BD, ACK), pp. 255–266.
CSMRCSMR-2011-VanyaPV #approximate #case study
Approximating Change Sets at Philips Healthcare: A Case Study (AV, RP, HvV), pp. 121–130.
SCAMSCAM-2011-Larson #program analysis
Program Analysis Too Loopy? Set the Loops Aside (EL), pp. 15–24.
SCAMSCAM-2011-PavluSK #alias #analysis #comparison #graph #precise
Computation of Alias Sets from Shape Graphs for Comparison of Shape Analysis Precision (VP, MS, AK), pp. 25–34.
WCREWCRE-2011-HaslingerLE #feature model #modelling #reverse engineering #source code
Reverse Engineering Feature Models from Programs’ Feature Sets (ENH, RELH, AE), pp. 308–312.
DLTDLT-J-2009-LehtinenO11 #equation #on the
On Equations over Sets of Numbers and their Limitations (TL, AO), pp. 377–393.
DLTDLT-J-2010-RigoW11 #finite #logic
Logical Characterization of Recognizable Sets of polynomials over a Finite Field (MR, LW), pp. 1549–1563.
DLTDLT-2011-GusevP #on the
On Non-complete Sets and Restivo’s Conjecture (VVG, EVP), pp. 239–250.
ICALPICALP-v1-2011-BordewichK #agile #bound #graph
Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width (MB, RJK), pp. 533–544.
ICALPICALP-v1-2011-CyganPPW #feedback #parametricity
Subset Feedback Vertex Set Is Fixed-Parameter Tractable (MC, MP, MP, JOW), pp. 449–461.
ICALPICALP-v1-2011-FeigeR #independence
Recoverable Values for Independent Sets (UF, DR), pp. 486–497.
ICALPICALP-v1-2011-Laekhanukit #algorithm #approximate #low cost
An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity — (BL), pp. 13–24.
ICALPICALP-v2-2011-Delacourt #automaton #theorem
Rice’s Theorem for μ-Limit Sets of Cellular Automata (MD), pp. 89–100.
LATALATA-2011-PolicritiT #finite
Well-Quasi-Ordering Hereditarily Finite Sets (AP, AIT), pp. 440–451.
LATALATA-2011-RigoV #complexity #integer
Syntactic Complexity of Ultimately Periodic Sets of Integers (MR, ÉV), pp. 477–488.
CoGCIG-2011-WhitehousePC #game studies #monte carlo
Determinization and information set Monte Carlo Tree Search for the card game Dou Di Zhu (DW, EJP, PIC), pp. 87–94.
CHICHI-2011-PaekH
Sampling representative phrase sets for text entry experiments: a procedure and public resource (TP, BJPH), pp. 2477–2480.
HCIHCI-DDA-2011-MoehrmannBSWH #image #scalability #usability
Improving the Usability of Hierarchical Representations for Interactively Labeling Large Image Data Sets (JM, SB, TS, GW, GH), pp. 618–627.
ICEISICEIS-J-2011-PereiraBOM #consistency #process
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.
ICEISICEIS-v2-2011-FanLL #performance
Influencing Factors of High-speed Railway Passengers’ Travel Choice based on Rough Set (YF, JL, CL), pp. 213–217.
ICEISICEIS-v4-2011-FengLL #evaluation
Comprehensive Evaluation of the Railway Passenger’s Satisfaction based on Rough Set and Entropy (YqF, XwL, XmL), pp. 629–635.
CIKMCIKM-2011-BozzonBFT #multi
Diversification for multi-domain result sets (AB, MB, PF, MT), pp. 1905–1908.
CIKMCIKM-2011-OzertemVL #using
Suggestion set utility maximization using session logs (UO, EV, LL), pp. 105–114.
CIKMCIKM-2011-StyskinRVS #ranking
Recency ranking by diversification of result set (AS, FR, FV, PS), pp. 1949–1952.
CIKMCIKM-2011-XuZYL
Pattern change discovery between high dimensional data sets (YX, ZZ, PSY, BL), pp. 1097–1106.
ICMLICML-2011-DasK #algorithm #approximate #taxonomy
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection (AD, DK), pp. 1057–1064.
ICMLICML-2011-PazisP #scalability
Generalized Value Functions for Large Action Sets (JP, RP), pp. 1185–1192.
ICMLICML-2011-PengHMU
Convex Max-Product over Compact Sets for Protein Folding (JP, TH, DAM, RU), pp. 729–736.
KDDKDD-2011-TsaparasNT
Selecting a comprehensive set of reviews (PT, AN, ET), pp. 168–176.
KDIRKDIR-2011-ClariziaCSGN11a #classification #novel
A Novel Supervised Text Classifier from a Small Training Set (FC, FC, MDS, LG, PN), pp. 545–553.
KDIRKDIR-2011-PrachuabsupakijS #classification #multi #using
Multi-class Data Classification for Imbalanced Data Set using Combined Sampling Approaches (WP, NS), pp. 166–171.
MLDMMLDM-2011-AttigP #biology #comparison #image #random
A Comparison between Haralick’s Texture Descriptor and the Texture Descriptor Based on Random Sets for Biological Images (AA, PP), pp. 524–538.
MLDMMLDM-2011-SimeonH #approach #correlation #difference #mining #named
GENCCS: A Correlated Group Difference Approach to Contrast Set Mining (MS, RJH), pp. 140–154.
SIGIRSIGIR-2011-KanoulasSMPA #algorithm #ranking #scalability
A large-scale study of the effect of training set characteristics over learning-to-rank algorithms (EK, SS, PM, VP, JAA), pp. 1243–1244.
SIGIRSIGIR-2011-MinackSN #approach #incremental #scalability
Incremental diversification for very large sets: a streaming-based approach (EM, WS, WN), pp. 585–594.
SIGIRSIGIR-2011-XueC #modelling #query
Modeling subset distributions for verbose queries (XX, WBC), pp. 1133–1134.
PADLPADL-2011-RedlEK #declarative #using
Declarative Belief Set Merging Using Merging Plans (CR, TE, TK), pp. 99–114.
PLDIPLDI-2011-PrabhuGZJA #commutative #parallel #programming
Commutative set: a language extension for implicit parallel programming (PP, SG, YZ, NPJ, DIA), pp. 1–11.
ESEC-FSEESEC-FSE-2011-TamrawiNAN #approach #debugging #fuzzy
Fuzzy set and cache-based approach for bug triaging (AT, TTN, JMAK, TNN), pp. 365–375.
CCCC-2011-NaeemL #alias #analysis #performance #summary #using
Faster Alias Set Analysis Using Summaries (NAN, OL), pp. 82–103.
DACDAC-2011-LiuDPC #approximate #composition #design
Supervised design space exploration by compositional approximation of Pareto sets (HYL, ID, MP, LPC), pp. 399–404.
HPCAHPCA-2011-BrownPT #concurrent #migration #performance #predict #thread
Fast thread migration via cache working set prediction (JAB, LP, DMT), pp. 193–204.
PDPPDP-2011-Csajbok #approximate #detection
Simultaneous Anomaly and Misuse Intrusion Detections Based on Partial Approximative Set Theory (ZC), pp. 651–655.
FoSSaCSFoSSaCS-2011-GabbayC #strict
Freshness and Name-Restriction in Sets of Traces with Names (MJG, VC), pp. 365–380.
CADECADE-2011-Horbach #horn clause
Predicate Completion for non-Horn Clause Sets (MH), pp. 315–330.
CSLCSL-2011-CantoneLA #decidability #logic #order #quantifier
A Decidable Quantified Fragment of Set Theory Involving Ordered Pairs with Applications to Description Logics (DC, CL, MNA), pp. 129–143.
ICLPICLP-2011-Brik #programming
Extensions of Answer Set Programming (AB), pp. 261–267.
ICLPICLP-2011-CasolaryL #programming #representation
Representing the Language of the Causal Calculator in Answer Set Programming (MC, JL), pp. 51–61.
ICLPICLP-2011-DrescherW #constraints #modelling #programming
Modelling Grammar Constraints with Answer Set Programming (CD, TW), pp. 28–39.
ICLPICLP-2011-GebserKKS #multi #optimisation #programming
Multi-Criteria Optimization in Answer Set Programming (MG, RK, BK, TS), pp. 1–10.
ICLPICLP-J-2011-GebserKS #optimisation #programming
Complex optimization in answer set programming (MG, RK, TS), pp. 821–839.
VMCAIVMCAI-2011-SuterSK #constraints #modulo theories #satisfiability
Sets with Cardinality Constraints in Satisfiability Modulo Theories (PS, RS, VK), pp. 403–418.
TPDLECDL-2010-Richardson #ambiguity #automation
Automated Country Name Disambiguation for Code Set Alignment (GR), pp. 498–501.
SIGMODSIGMOD-2010-AgrawalAK #on the
On indexing error-tolerant set containment (PA, AA, RK), pp. 927–938.
VLDBVLDB-2010-LianC #probability #similarity
Set Similarity Join on Probabilistic Data (XL, LC), pp. 650–659.
VLDBVLDB-2010-MahPC #algorithm #functional #named #realtime
UASMAs: a set of algorithms to instantaneously map SNPs in real time to aid functional SNP discovery (JM, DP, SC), pp. 1406–1413.
EDMEDM-2010-NugentDA #algorithm #automation #clustering #specification
Skill Set Profile Clustering: The Empty K-Means Algorithm with Automatic Specification of Starting Cluster Centers (RN, ND, EA), pp. 151–160.
CSMRCSMR-2010-NadiHM #predict #using
Does the Past Say It All? Using History to Predict Change Sets in a CMDB (SN, RCH, SM), pp. 97–106.
ICSMEICSM-2010-Al-KofahiTNNN #approach #automation #evolution #fuzzy
Fuzzy set approach for automatic tagging in evolving software (JMAK, AT, TTN, HAN, TNN), pp. 1–10.
DLTDLT-2010-ChambartS #problem
Computing Blocker Sets for the Regular Post Embedding Problem (PC, PS), pp. 136–147.
ICALPICALP-v1-2010-HalldorssonHLS #algorithm #independence #streaming
Streaming Algorithms for Independent Sets (BVH, MMH, EL, MS), pp. 641–652.
ICALPICALP-v2-2010-MertziosSSZ #multi #network
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests (GBM, IS, MS, SZ), pp. 333–344.
CoGCIG-2010-LisyBVP
Agent subset adversarial search for complex non-cooperative domains (VL, BB, RV, MP), pp. 211–218.
ICEISICEIS-SAIC-2010-GoyalK #approach #automation #fuzzy #multi #using
Using Fuzzy Set Approach in Multi-attribute Automated Auctions (MLG, SK), pp. 81–85.
CIKMCIKM-2010-CormodeKW #algorithm #dataset #scalability
Set cover algorithms for very large datasets (GC, HJK, AW), pp. 479–488.
CIKMCIKM-2010-XueHC #query #using
Improving verbose queries using subset distribution (XX, SH, WBC), pp. 1059–1068.
CIKMCIKM-2010-ZhaoAY #composition #nondeterminism #on the
On wavelet decomposition of uncertain time series data sets (YZ, CCA, PSY), pp. 129–138.
CIKMCIKM-2010-ZhouLBXL #information management #mining #reasoning
Rough sets based reasoning and pattern mining for a two-stage information filtering system (XZ, YL, PB, YX, RYKL), pp. 1429–1432.
ICMLICML-2010-GuilloryB #interactive
Interactive Submodular Set Cover (AG, JAB), pp. 415–422.
ICPRICPR-2010-Al-HuseinyMN #approach
Gait Learning-Based Regenerative Model: A Level Set Approach (MSAH, SM, MSN), pp. 2644–2647.
ICPRICPR-2010-AvenelMP #probability
Stochastic Filtering of Level Sets for Curve Tracking (CA, ÉM, PP), pp. 3553–3556.
ICPRICPR-2010-BanimahdE #distance #image #segmentation #using
Lip Segmentation Using Level Set Method: Fusing Landmark Edge Distance and Image Information (SRB, HE), pp. 2432–2435.
ICPRICPR-2010-BerrettiBPAD #3d #recognition
A Set of Selected SIFT Features for 3D Facial Expression Recognition (SB, ADB, PP, BBA, MD), pp. 4125–4128.
ICPRICPR-2010-BoltonG #framework #learning #multi #optimisation #random
Cross Entropy Optimization of the Random Set Framework for Multiple Instance Learning (JB, PDG), pp. 3907–3910.
ICPRICPR-2010-ChuHC #classification #gender #identification #image
Identifying Gender from Unaligned Facial Images by Set Classification (WSC, CRH, CSC), pp. 2636–2639.
ICPRICPR-2010-HanFD #learning #prototype #recognition
Discriminative Prototype Learning in Open Set Face Recognition (ZH, CF, XD), pp. 2696–2699.
ICPRICPR-2010-HongCCG #detection
Boosted Sigma Set for Pedestrian Detection (XH, HC, XC, WG), pp. 3017–3020.
ICPRICPR-2010-IbbaDL #case study
A Study on Combining Sets of Differently Measured Dissimilarities (AI, RPWD, WJL), pp. 3360–3363.
ICPRICPR-2010-ImpedovoP #classification #evaluation #generative #multi
Generating Sets of Classifiers for the Evaluation of Multi-expert Systems (DI, GP), pp. 2166–2169.
ICPRICPR-2010-KinnunenKLLK #categorisation #random #visual notation
Making Visual Object Categorization More Challenging: Randomized Caltech-101 Data Set (TK, JKK, LL, JL, HK), pp. 476–479.
ICPRICPR-2010-KurugolODSB #3d #segmentation
Locally Deformable Shape Model to Improve 3D Level Set Based Esophagus Segmentation (SK, NO, JGD, GCS, DHB), pp. 3955–3958.
ICPRICPR-2010-LiZGHLZ
Discriminative Level Set for Contour Tracking (WL, XZ, JG, WH, HL, XZ), pp. 1735–1738.
ICPRICPR-2010-OliverTLM #automation #segmentation #using
Automatic Diagnosis of Masses by Using Level set Segmentation and Shape Description (AO, AT, XL, JM), pp. 2528–2531.
ICPRICPR-2010-PinedaKW #clustering #correlation #visual notation #word
Object Discovery by Clustering Correlated Visual Word Sets (GFP, HK, TW), pp. 750–753.
ICPRICPR-2010-SchryverR #categorisation
The Rex Leopold II Model: Application of the Reduced Set Density Estimator to Human Categorization (MDS, BR), pp. 4356–4359.
ICPRICPR-2010-SeverskyY #3d #detection #scalability
Scalable Cage-Driven Feature Detection and Shape Correspondence for 3D Point Sets (LMS, LY), pp. 3557–3560.
ICPRICPR-2010-SomolGP #algorithm #feature model #problem
The Problem of Fragile Feature Subset Preference in Feature Selection Methods and a Proposal of Algorithmic Workaround (PS, JG, PP), pp. 4396–4399.
ICPRICPR-2010-TorkiEL #learning #multi #representation
Learning a Joint Manifold Representation from Multiple Data Sets (MT, AME, CSL), pp. 1068–1071.
ICPRICPR-2010-TumaIP #classification #kernel #using
Hydroacoustic Signal Classification Using Kernel Functions for Variable Feature Sets (MT, CI, MP), pp. 1011–1014.
ICPRICPR-2010-Xie #segmentation #using
Level Set Based Segmentation Using Local Feature Distribution (XX), pp. 2780–2783.
KDIRKDIR-2010-ThanhYU #clustering #documentation #scalability #similarity
Clustering Documents with Large Overlap of Terms into Different Clusters based on Similarity Rough Set Model (NCT, KY, MU), pp. 396–399.
KDIRKDIR-2010-ViswanathBK #classification #nearest neighbour #performance
A Method to Generate a Reduced Training Set for Faster and Better Nearest Neighbor Classification (PV, VSB, TNK), pp. 232–236.
KEODKEOD-2010-ZakraouiZ #interactive #programming #using #web
Integrating Context Knowledge in user Interaction using Answer Set Programming for Enhancing Web Accessibility (JZ, WLZ), pp. 459–466.
KRKR-2010-BalducciniG #formal method #programming
Formalizing Psychological Knowledge in Answer Set Programming (MB, SG).
KRKR-2010-CreignouST #abduction #complexity #strict
Complexity of Propositional Abduction for Restricted Sets of Boolean Functions (NC, JS, MT).
KRKR-2010-DelgrandeW #horn clause
Horn Clause Contraction Functions: Belief Set and Belief Base Approaches (JPD, RW).
KRKR-2010-EiterFM #programming
Paracoherent Answer Set Programming (TE, MF, JM).
KRKR-2010-GebserGISSTV #biology #consistency #network #nondeterminism #predict #programming #scalability
Repair and Prediction (under Inconsistency) in Large Biological Networks with Answer Set Programming (MG, CG, MI, TS, AS, ST, PV).
KRKR-2010-ZhangZ #bound #on the #semantics #source code
On the Progression Semantics and Boundedness of Answer Set Programs (YZ, YZ).
SIGIRSIGIR-2010-RadlinskiSC #metric #topic
Metrics for assessing sets of subtopics (FR, MS, NC), pp. 853–854.
SIGIRSIGIR-2010-WangDL #comprehension #documentation #matrix
Feature subset non-negative matrix factorization and its applications to document understanding (DW, CHQD, TL), pp. 805–806.
LOPSTRLOPSTR-2010-HerasPR #correctness #proving
Proving with ACL2 the Correctness of Simplicial Sets in the Kenzo System (JH, VP, JR), pp. 37–51.
PADLPADL-2010-LeoneRRT #integration #performance #programming
Efficient Application of Answer Set Programming for Advanced Data Integration (NL, FR, LAR, GT), pp. 10–24.
PADLPADL-2010-Pontelli #perspective #programming
Answer Set Programming in 2010: A Personal Perspective (EP), pp. 1–3.
ASEASE-2010-IvanovOSV #analysis #behaviour #embedded #modelling #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.
ASEASE-2010-LiangWWWXM #automation #effectiveness #static analysis
Automatic construction of an effective training set for prioritizing static analysis warnings (GL, LW, QW, QW, TX, HM), pp. 93–102.
ICSEICSE-2010-ChiappiniCMRRSTV #formal method #validation
Formalization and validation of a subset of the European Train Control System (AC, AC, LM, OR, MR, AS, ST, BV), pp. 109–118.
SACSAC-2010-BautistaSHPD #clustering #power management #requirements
Dynamic task set partitioning based on balancing resource requirements and utilization to reduce power consumption (DB, JS, HH, SP, JD), pp. 521–526.
SACSAC-2010-BucchiaroneGFT #experience #natural language #requirements #scalability #using
An experience in using a tool for evaluating a large set of natural language requirements (AB, SG, AF, GT), pp. 281–286.
SACSAC-2010-GoethalsPM #database #mining #relational
Mining interesting sets and rules in relational databases (BG, WLP, MM), pp. 997–1001.
SACSAC-2010-Kaneiwa #approach #information management #mining
A rough set approach to mining connections from information systems (KK), pp. 990–996.
SACSAC-2010-MarascuML #approximate #performance #streaming
A fast approximation strategy for summarizing a set of streaming time series (AM, FM, YL), pp. 1617–1621.
SACSAC-2010-RiosBKO #documentation #evaluation #word
Evaluation of different feature sets in an OCR free method for word spotting in printed documents (IR, AdSBJ, ALK, LSO), pp. 52–56.
HPDCHPDC-2010-KettimuthuSGABBCCDFHHLLLMNPRRWWW #grid #lessons learnt #network
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.
STOCSTOC-2010-Talagrand #question
Are many small sets explicitly small? (MT), pp. 13–36.
STOCSTOC-2010-Varadarajan #geometry
Weighted geometric set cover via quasi-uniform sampling (KRV), pp. 641–648.
CSLCSL-2010-KuncakPS #calculus #data type #order
Ordered Sets in the Calculus of Data Structures (VK, RP, PS), pp. 34–48.
ICLPICLP-2010-Alviano10 #datalog #source code
Dynamic Magic Sets for Disjunctive Datalog Programs (MA), pp. 226–235.
ICLPICLP-2010-Balduccini10 #heuristic #learning
Learning Domain-Specific Heuristics for Answer Set Solvers (MB), pp. 14–23.
ICLPICLP-2010-BautersJSVC10 #communication #source code
Communicating Answer Set Programs (KB, JJ, SS, DV, MDC), pp. 34–43.
ICLPICLP-2010-Drescher10 #constraints #programming
Constraint Answer Set Programming Systems (CD), pp. 255–264.
ICLPICLP-2010-FayruzovJVCC10 #performance #source code
Efficient Solving of Time-dependent Answer Set Programs (TF, JJ, DV, CC, MDC), pp. 64–73.
ICLPICLP-J-2010-BalducciniG #formal method #programming
Formalization of psychological knowledge in answer set programming and its application (MB, SG), pp. 725–740.
ICLPICLP-J-2010-Delgrande #approach #logic programming #semantics #source code
A program-level approach to revising logic programs under the answer set semantics (JPD), pp. 565–580.
ICLPICLP-J-2010-DrescherW #approach #constraints
A translational approach to constraint answer set solving (CD, TW), pp. 465–480.
IJCARIJCAR-2010-PiskacK #automation #multi #named
MUNCH — Automated Reasoner for Sets and Multisets (RP, VK), pp. 149–155.
VMCAIVMCAI-2010-MarronMSK #analysis
Shape Analysis with Reference Set Relations (MM, RM, DS, DK), pp. 247–262.
WICSA-ECSAWICSA-ECSA-2009-NordCEH #architecture #documentation #using
Reviewing architecture documents using question sets (RLN, PCC, DEE, RH), pp. 325–328.
ICDARICDAR-2009-HaboubiMEA #invariant
Invariant Primitives for Handwritten Arabic Script: A Contrastive Study of Four Feature Sets (SH, SM, NE, HEA), pp. 691–697.
ICDARICDAR-2009-MoghaddamRC #approach #classification #independence #multi #segmentation #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.
ICDARICDAR-2009-MoghaddamRYC #approach #documentation #framework #image #segmentation
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.
ICDARICDAR-2009-SiddiqiV #recognition
A Set of Chain Code Based Features for Writer Recognition (IS, NV), pp. 981–985.
VLDBVLDB-2009-CautisDOV #performance #query #specification #using #xpath
Efficient Rewriting of XPath Queries Using Query Set Specifications (BC, AD, NO, VV), pp. 301–312.
VLDBVLDB-2009-CohenDKLT #composition #scalability #summary
Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets (EC, NGD, HK, CL, MT), pp. 431–442.
VLDBVLDB-2009-LeeNS #estimation #similarity
Power-Law Based Estimation of Set Similarity Join Size (HL, RTN, KS), pp. 658–669.
EDMEDM-2009-PardosH #order #problem #random
Determining the Significance of Item Order In Randomized Problem Sets (ZAP, NTH), pp. 111–120.
ICSMEICSM-2009-JiaSYL #data transformation #difference #predict #question
Data transformation and attribute subset selection: Do they help make differences in software failure prediction? (HJ, FS, YY, QL), pp. 519–522.
CIAACIAA-2009-InabaH #query #representation
Compact Representation for Answer Sets of n-ary Regular Queries (KI, HH), pp. 94–104.
DLTDLT-2009-BlakeleyBGR #complexity #on the #word
On the Complexity of Deciding Avoidability of Sets of Partial Words (BB, FBS, JG, NR), pp. 113–124.
DLTDLT-2009-LehtinenO #equation #on the
On Equations over Sets of Numbers and Their Limitations (TL, AO), pp. 360–371.
ICALPICALP-v1-2009-AgnarssonHL #algorithm #independence #problem
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs (GA, MMH, EL), pp. 12–23.
LATALATA-2009-BoigelotD #automaton #finite #visualisation
Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization (BB, JFD), pp. 200–211.
HCIHCD-2009-JonesND #information retrieval #using
Use of Nursing Management Minimum Data Set (NMMDS) for a Focused Information Retrieval (JFJ, ETN, CD), pp. 972–978.
HCIHCI-VAD-2009-NielloFGFBV
A Set of Rules and Strategies for UNSAM Virtual Campus (JFN, FVCF, MG, RFZ, SB, MV), pp. 101–110.
ICEISICEIS-AIDSS-2009-Rojas-MoraG #fuzzy #nondeterminism
The Signing of a Professional Athlete — Reducing Uncertainty with a Weighted Mean Hemimetric for Phi — Fuzzy Subsets (JRM, JGL), pp. 158–163.
CIKMCIKM-2009-HauffHJA #estimation #ranking #topic
Relying on topic subsets for system ranking estimation (CH, DH, FdJ, LA), pp. 1859–1862.
CIKMCIKM-2009-IslamI #using #web
Real-word spelling correction using Google web 1Tn-gram data set (AI, DI), pp. 1689–1692.
CIKMCIKM-2009-VyasPC #editing
Helping editors choose better seed sets for entity set expansion (VV, PP, EC), pp. 225–234.
KDDKDD-2009-JinXL #representation
Cartesian contour: a concise representation for a collection of frequent sets (RJ, YX, LL), pp. 417–426.
KDIRKDIR-2009-CallejaFGA #learning
A Learning Method for Imbalanced Data Sets (JdlC, OF, JG, RMAP), pp. 307–310.
KDIRKDIR-2009-GabadinhoRSM #category theory #sequence #visualisation
Summarizing Sets of Categorical Sequences — Selecting and Visualizing Representative Sequences (AG, GR, MS, NSM), pp. 62–69.
MLDMMLDM-2009-SarmentoKOU #clustering #performance
Efficient Clustering of Web-Derived Data Sets (LS, AK, ECO, LHU), pp. 398–412.
MLDMMLDM-2009-SeredinKM #machine learning #order
Selection of Subsets of Ordered Features in Machine Learning (OS, AK, VM), pp. 16–28.
RecSysRecSys-2009-Nnadi #clustering #correlation #multi #recommendation
Applying relevant set correlation clustering to multi-criteria recommender systems (NN), pp. 401–404.
RecSysRecSys-2009-ViappianiB #recommendation
Regret-based optimal recommendation sets in conversational recommender systems (PV, CB), pp. 101–108.
SEKESEKE-2009-MukhopadhyayPRPM #benchmark #comparison #information management #metric #multi
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.
SIGIRSIGIR-2009-AmbaiY #clustering #image #multi #ranking #visual notation
Multiclass VisualRank: image ranking method in clustered subsets based on visual features (MA, YY), pp. 732–733.
SIGIRSIGIR-2009-Voorhees #topic
Topic set size redux (EMV), pp. 806–807.
PLDIPLDI-2009-HooimeijerW #constraints #regular expression
A decision procedure for subset constraints over regular languages (PH, WW), pp. 188–198.
PPDPPPDP-2009-AntoyH #functional #logic programming
Set functions for functional logic programming (SA, MH), pp. 73–82.
SACSAC-2009-JangYC #algorithm #clustering #multi
A smart clustering algorithm for photo set obtained from multiple digital cameras (CJJ, TY, HGC), pp. 1784–1791.
SACSAC-2009-PinhoOL #incremental #visualisation
Incremental board: a grid-based space for visualizing dynamic data sets (RP, MCFdO, AdAL), pp. 1757–1764.
SACSAC-2009-RodriguesSC #composition #embedded #functional #using #verification
Improving functional verification of embedded systems using hierarchical composition and set theory (CLR, KRGdS, HdNC), pp. 1632–1636.
DACDAC-2009-KluterBIC #automation
Way Stealing: cache-assisted automatic instruction set extensions (TK, PB, PI, EC), pp. 31–36.
DATEDATE-2009-GuanLF #design #scalability
Design of an application-specific instruction set processor for high-throughput and scalable FFT (XG, HL, YF), pp. 1302–1307.
DATEDATE-2009-LiFNBPC #architecture #co-evolution #design #detection #ml #parallel
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.
DATEDATE-2009-StratigopoulosMM
Enrichment of limited training sets in machine-learning-based analog/RF test (HGDS, SM, YM), pp. 1668–1673.
ISMMISMM-2009-NaeemL #alias #analysis #performance #using
Efficient alias set analysis using SSA form (NAN, OL), pp. 79–88.
PDPPDP-2009-GavaF #semantics
Two Formal Semantics of a Subset of the Paderborn University BSPlib (FG, JF), pp. 44–51.
PPoPPPPoPP-2009-AllenSS #dependence #execution #parallel
Serialization sets: a dynamic dependence-based parallel execution model (MDA, SS, GSS), pp. 85–96.
STOCSTOC-2009-AndersenP #evolution #using
Finding sparse cuts locally using evolving sets (RA, YP), pp. 235–244.
TACASTACAS-2009-Thierry-MiegPHK #diagrams #modelling
Hierarchical Set Decision Diagrams and Regular Models (YTM, DP, AH, FK), pp. 1–15.
CADECADE-2009-GregoireMP #question
Does This Set of Clauses Overlap with at Least One MUS? (ÉG, BM, CP), pp. 100–115.
CAVCAV-2009-LammichMW #automaton #constraints #network
Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints (PL, MMO, AW), pp. 525–539.
ICLPICLP-2009-DelgrandeSTW #logic programming #semantics #source code
Merging Logic Programs under Answer Set Semantics (JPD, TS, HT, SW), pp. 160–174.
ICLPICLP-2009-EiterEEF #programming
Finding Similar or Diverse Solutions in Answer Set Programming (TE, EE, HE, MF), pp. 342–356.
ICLPICLP-2009-GebserOS #constraints
Constraint Answer Set Solving (MG, MO, TS), pp. 235–249.
ICLPICLP-2009-Ji #approach #architecture #programming
A Cognitive Architecture for a Service Robot: An Answer Set Programming Approach (JJ), pp. 532–533.
ICLPICLP-2009-PaluDPR #constraints #lazy evaluation #programming #using
Answer Set Programming with Constraints Using Lazy Grounding (ADP, AD, EP, GR), pp. 115–129.
ICLPICLP-2009-SchaubT #network #programming
Metabolic Network Expansion with Answer Set Programming (TS, ST), pp. 312–326.
ICLPICLP-2009-Thielscher #game studies #programming
Answer Set Programming for Single-Player Games in General Game Playing (MT), pp. 327–341.
WICSAWICSA-2008-ChristensenHS #architecture #exclamation #research
Ready! Set! Go! An Action Research Agenda for Software Architecture Research (HBC, KMH, KRS), pp. 257–260.
VLDBVLDB-2008-ChaikenJLRSWZ #named #parallel #performance
SCOPE: easy and efficient parallel processing of massive data sets (RC, BJ, PÅL, BR, DS, SW, JZ), pp. 1265–1276.
VLDBVLDB-2008-HadjieleftheriouYKS #query #similarity
Hashed samples: selectivity estimators for set similarity selection queries (MH, XY, NK, DS), pp. 201–212.
EDMEDM-2008-AyersND #clustering #student
Skill Set Profile Clustering Based on Weighted Student Responses (EA, RN, ND), pp. 210–217.
EDMEDM-2008-BakerCA #modelling
Improving Contextual Models of Guessing and Slipping with a Trucated Training Set (RSJdB, ATC, VA), pp. 67–76.
ITiCSEITiCSE-2008-DemailleLP #compilation #education #tool support
A set of tools to teach compiler construction (AD, RL, BP), pp. 68–72.
SCAMSCAM-2008-StoneSB #analysis #automation #data flow
Automatic Determination of May/Must Set Usage in Data-Flow Analysis (AS, MS, SB), pp. 153–162.
DLTDLT-2008-BassinoGN #complexity #finite #linear #word
The Average State Complexity of the Star of a Finite Set of Words Is Linear (FB, LG, CN), pp. 134–145.
DLTDLT-2008-CaludeNSS #recursion #string
Universal Recursively Enumerable Sets of Strings (CSC, AN, LS, FS), pp. 170–182.
ICALPICALP-A-2008-BlaserHS
Asymptotically Optimal Hitting Sets Against Polynomials (MB, MH, DS), pp. 345–356.
ICALPICALP-B-2008-BoigelotBB #automaton #finite #multi #on the
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases (BB, JB, VB), pp. 112–123.
ICALPICALP-B-2008-JezO #equation #on the
On the Computational Completeness of Equations over Sets of Natural Numbers (AJ, AO), pp. 63–74.
LATALATA-2008-Crespi-ReghizziP
Consensual Definition of Languages by Regular Sets (SCR, PSP), pp. 196–208.
LATALATA-2008-MoczuradM #how #question
How Many Figure Sets Are Codes? (MM, WM), pp. 385–396.
FLOPSFLOPS-2008-MellarkodG #constraints #reasoning #theorem proving
Integrating Answer Set Reasoning with Constraint Solving Techniques (VSM, MG), pp. 15–31.
FLOPSFLOPS-2008-Schaub #information management #modelling #programming #reasoning #representation
Model-Based Knowledge Representation and Reasoning Via Answer Set Programming (TS), pp. 1–2.
CIKMCIKM-2008-AlqadahB08a #clustering #detection
Detecting significant distinguishing sets among bi-clusters (FA, RB), pp. 1455–1456.
CIKMCIKM-2008-BoutsidisSA #clustering #metric
Clustered subset selection and its applications on it service metrics (CB, JS, NA), pp. 599–608.
CIKMCIKM-2008-Lee #categorisation #documentation #topic
Incorporating topical support documents into a small training set in text categorization (KSL), pp. 1511–1512.
ICMLICML-2008-Shalev-ShwartzS #dependence #optimisation
SVM optimization: inverse dependence on training set size (SSS, NS), pp. 928–935.
ICMLICML-2008-YueJ #predict #using
Predicting diverse subsets using structural SVMs (YY, TJ), pp. 1224–1231.
ICPRICPR-2008-FuSHLT #image #kernel #learning #multi
Multiple kernel learning from sets of partially matching image features (SYF, GS, ZGH, ZzL, MT), pp. 1–4.
ICPRICPR-2008-KhushabaAA #difference #evolution
Differential evolution basedfeature subset selection (RNK, AAA, AAJ), pp. 1–4.
ICPRICPR-2008-LathenJB #segmentation
Phase based level set segmentation of blood vessels (GL, JJ, MB), pp. 1–4.
ICPRICPR-2008-NguyenBP #approach #learning
A supervised learning approach for imbalanced data sets (GHN, AB, SLP), pp. 1–4.
ICPRICPR-2008-Vega-PonsRV #algorithm #segmentation #using
Active contour algorithm for texture segmentation using a texture feature set (SVP, JLGR, OLV), pp. 1–4.
KDDKDD-2008-SimonKZ #agile #approach #reliability #scalability
Semi-supervised approach to rapid and reliable labeling of large data sets (GJS, VK, ZLZ), pp. 641–649.
KRKR-2008-DelgrandeSTW #logic programming #semantics #source code
Belief Revision of Logic Programs under Answer Set Semantics (JPD, TS, HT, SW), pp. 411–421.
KRKR-2008-DrescherGGKKOS
Conflict-Driven Disjunctive Answer Set Solving (CD, MG, TG, BK, AK, MO, TS), pp. 422–432.
KRKR-2008-HunterK #consistency #nondeterminism
Measuring Inconsistency through Minimal Inconsistent Sets (AH, SK), pp. 358–366.
KRKR-2008-LinW #programming
Answer Set Programming with Functions (FL, YW), pp. 454–465.
MODELSMoDELS-2008-CraneD #execution #formal method #modelling #towards #uml
Towards a Formal Account of a Foundational Subset for Executable UML Models (MLC, JD), pp. 675–689.
MODELSMoDELS-2008-CraneD #execution #formal method #modelling #towards #uml
Towards a Formal Account of a Foundational Subset for Executable UML Models (MLC, JD), pp. 675–689.
LOPSTRLOPSTR-2008-Seki #on the #semantics
On Negative Unfolding in the Answer Set Semantics (HS), pp. 168–184.
SACSAC-2008-TsujiKH #implementation #multi #scalability
History offset implementation scheme for large scale multidimensional data sets (TT, MK, KH), pp. 1021–1028.
SACSAC-2008-ZhangMD #feature model #fuzzy #image #retrieval #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.
ATEMATEM-J-2006-DubeyJA #context-free grammar #learning
Learning context-free grammar rules from a set of program (AD, PJ, SKA), pp. 223–240.
ASPLOSASPLOS-2008-SrikantaiahKI #adaptation #multi
Adaptive set pinning: managing shared caches in chip multiprocessors (SS, MTK, MJI), pp. 135–144.
CASECASE-2008-SunWHRW #case study #effectiveness #identification #monitoring
Identification of feature set for effective tool condition monitoring — a case study in titanium machining (JS, YSW, GSH, MR, ZW), pp. 273–278.
DACDAC-2008-BastaniKWC #learning #predict
Speedpath prediction based on learning from a small set of examples (PB, KK, LCW, EC), pp. 217–222.
DACDAC-2008-BauerSH #embedded #runtime
Run-time instruction set selection in a transmutable embedded processor (LB, MS, JH), pp. 56–61.
DACDAC-2008-El-MoselhyEW #algorithm #parametricity #performance #scalability
Efficient algorithm for the computation of on-chip capacitance sensitivities with respect to a large set of parameters (TAEM, IME, DW), pp. 906–911.
DACDAC-2008-LiBNPC #approach #how #implementation #power management
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.
DATEDATE-2008-BauerSKH #embedded #runtime
Run-time System for an Extensible Embedded Processor with Dynamic Instruction Set (LB, MS, SK, JH), pp. 752–757.
DATEDATE-2008-VogtW #configuration management
A Reconfigurable Application Specific Instruction Set Processor for Convolutional and Turbo Decoding in a SDR Environment (TV, NW), pp. 38–43.
DATEDATE-2008-WuCSC #architecture #multi
Instruction Set Extension Exploration in Multiple-Issue Architecture (IWW, ZYC, JJJS, CPC), pp. 764–769.
STOCSTOC-2008-ChenLL #algorithm #feedback #parametricity #problem
A fixed-parameter algorithm for the directed feedback vertex set problem (JC, YL, SL, BO, IR), pp. 177–186.
STOCSTOC-2008-DasK #algorithm #linear
Algorithms for subset selection in linear regression (AD, DK), pp. 45–54.
CAVCAV-2008-BaswanaMP #consistency #memory management #verification
Implied Set Closure and Its Application to Memory Consistency Verification (SB, SKM, VP), pp. 94–106.
ICLPICLP-2008-Baral #information management #programming #reasoning #representation #using
Using Answer Set Programming for Knowledge Representation and Reasoning: Future Directions (CB), pp. 69–70.
ICLPICLP-2008-BoennBVF #automation #composition #music #programming
Automatic Composition of Melodic and Harmonic Music by Answer Set Programming (GB, MB, MDV, Jf), pp. 160–174.
ICLPICLP-2008-Cabalar #programming #similarity
Partial Functions and Equality in Answer Set Programming (PC), pp. 392–406.
ICLPICLP-2008-CliffeVBP #animation #declarative #named #programming #using #visualisation
ASPVIZ: Declarative Visualisation and Animation Using Answer Set Programming (OC, MDV, MB, JAP), pp. 724–728.
ICLPICLP-2008-GebserSTUV #biology #consistency #detection #network #nondeterminism #programming #scalability
Detecting Inconsistencies in Large Biological Networks with Answer Set Programming (MG, TS, ST, BU, PV), pp. 130–144.
ICLPICLP-2008-Janhunen #source code
Removing Redundancy from Answer Set Programs (TJ), pp. 729–733.
ICLPICLP-2008-JanssenHVC #compilation #fuzzy #source code
Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories (JJ, SH, DV, MDC), pp. 362–376.
ICLPICLP-2008-Lierler
Abstract Answer Set Solvers (YL), pp. 377–391.
ICLPICLP-2008-Marek #programming #question
Quo Vadis Answer Set Programming? (VWM), pp. 83–87.
ICLPICLP-2008-Niemela #programming
Answer Set Programming without Unstratified Negation (IN), pp. 88–92.
ICLPICLP-2008-PearceV #equilibrium #logic #quantifier #source code
Quantified Equilibrium Logic and Foundations for Answer Set Programs (DP, AV), pp. 546–560.
ICLPICLP-2008-Schaub #exclamation #programming
Here’s the Beef: Answer Set Programming ! (TS), pp. 93–98.
IJCARIJCAR-2008-MouraB #effectiveness #logic #using
Deciding Effectively Propositional Logic Using DPLL and Substitution Sets (LMdM, NB), pp. 410–425.
ICSTSAT-2008-LiffitonS #satisfiability
Searching for Autarkies to Trim Unsatisfiable Clause Sets (MHL, KAS), pp. 182–195.
VMCAIVMCAI-2008-Mendez-LojoH #analysis #precise #source code
Precise Set Sharing Analysis for Java-Style Programs (MML, MVH), pp. 172–187.
CBSECBSE-2007-Storm #composition
Binary Change Set Composition (TvdS), pp. 17–32.
ICDARICDAR-2007-SchulzMM #performance #precise
Fast Selection of Small and Precise Candidate Sets from Dictionaries for Text Correction Tasks (KUS, SM, PM), pp. 471–475.
SIGMODSIGMOD-2007-ChuBN #approach #relational
The case for a wide-table approach to manage sparse relational data sets (EC, JLB, JFN), pp. 821–832.
VLDBVLDB-2007-WuJ
A Bayesian Method for Guessing the Extreme Values in a Data Set (MW, CJ), pp. 471–482.
CIAACIAA-2007-KucherovNR #automaton
Subset Seed Automaton (GK, LN, MAR), pp. 180–191.
DLTDLT-2007-Blanchet-SadriBP #word
Two Element Unavoidable Sets of Partial Words (FBS, NCB, JP), pp. 96–107.
ICALPICALP-2007-LuTW #complexity #on the
On the Complexity of Hard-Core Set Constructions (CJL, SCT, HLW), pp. 183–194.
LATALATA-2007-AntoniouCIP #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.
LATALATA-2007-LohreyS #graph #problem
The submonoid and rational subset membership problems for graph groups (ML, BS), pp. 367–378.
TLCATLCA-2007-Tatsuta #higher-order #quantifier
Simple Saturated Sets for Disjunction and Second-Order Existential Quantification (MT), pp. 366–380.
HCIDHM-2007-ZhangHLTQLLLCGX
Chinese Visible Human Data Sets and Their Applications (SXZ, PAH, ZJL, LWT, MGQ, QYL, RXL, KL, GYC, YG, YMX), pp. 530–535.
HCIHCI-MIE-2007-ChangKP #constraints #evolution #using
Lip Contour Extraction Using Level Set Curve Evolution with Shape Constraint (JSC, EYK, SHP), pp. 583–588.
HCIHIMI-MTT-2007-CouturierRC #approach #interactive #scalability
An Interactive Approach to Display Large Sets of Association Rules (OC, JR, VC), pp. 258–267.
HCIHIMI-MTT-2007-IshizuGNI #ontology
Rough Ontology: Extension of Ontologies by Rough Sets (SI, AG, YN, YI), pp. 456–462.
ICEISICEIS-AIDSS-2007-CrawfordLCP #approach
A Evolutionary Approach to Solve Set Covering (BC, CL, CC, FP), pp. 356–363.
CIKMCIKM-2007-BotelhoZ #scalability
External perfect hashing for very large key sets (FCB, NZ), pp. 653–662.
ICMLICML-2007-ChenJ #classification #feature model
Minimum reference set based feature selection for small sample classifications (XwC, JCJ), pp. 153–160.
KDDKDD-2007-CurryGLVB #case study #detection #scalability
Detecting changes in large data sets of payment card data: a case study (CC, RLG, DL, SV, JB), pp. 1018–1022.
KDDKDD-2007-GaoESCX #consistency #data mining #mining #problem
The minimum consistent subset cover problem and its applications in data mining (BJG, ME, JyC, OS, HX), pp. 310–319.
KDDKDD-2007-HeikinheimoSHMM
Finding low-entropy sets and trees from binary data (HH, JKS, EH, HM, TM), pp. 350–359.
SIGIRSIGIR-2007-CormackL07a #bias
Power and bias of subset pooling strategies (GVC, TRL), pp. 837–838.
SIGIRSIGIR-2007-TurnbullBTL #semantics #towards #using
Towards musical query-by-semantic-description using the CAL500 data set (DT, LB, DAT, GRGL), pp. 439–446.
ECMFAECMDA-FA-2007-MaraeeB #diagrams #finite #performance #reasoning #satisfiability #uml
Efficient Reasoning About Finite Satisfiability of UML Class Diagrams with Constrained Generalization Sets (AM, MB), pp. 17–31.
PLDIPLDI-2007-KodumalA #constraints
Regularly annotated set constraints (JK, AA), pp. 331–341.
ICSEICSE-2007-HendricksonH #architecture #modelling #product line
Modeling Product Line Architectures through Change Sets and Relationships (SAH, AvdH), pp. 189–198.
SACSAC-2007-BatistaFM #grid #network
A set of schedulers for grid networks (DMB, NLSdF, FKM), pp. 209–213.
SACSAC-2007-LiebrockMBPCSU #analysis #design #forensics
A preliminary design for digital forensics analysis of terabyte size data sets (LML, NM, DPB, RP, EC, MS, VU), pp. 190–191.
SACSAC-2007-ZhangMC #fuzzy #image #retrieval
Directed filter for dominant direction fuzzy set in content-based image retrieval (GZ, ZMM, ZC), pp. 76–77.
CASECASE-2007-ChakrabortyAW #multi
Coverage of a Planar Point Set with Multiple Constrained Robots (NC, SA, JTW), pp. 899–904.
CASECASE-2007-ZhuangXZD #multi #optimisation
Von Mises Stress and Level Set Method based Structural Topology Optimization with Multi-phase Materials (CZ, ZX, XZ, HD), pp. 945–949.
DACDAC-2007-BauerSKH #framework #named #platform
RISPP: Rotating Instruction Set Processing Platform (LB, MS, SK, JH), pp. 791–796.
DACDAC-2007-GandikotaCBSB #analysis
Top-k Aggressors Sets in Delay Noise Analysis (RG, KC, DB, DS, MRB), pp. 174–179.
DATEDATE-2007-BonziniP #automation #polynomial
Polynomial-time subgraph enumeration for automated instruction set extension (PB, LP), pp. 1331–1336.
DATEDATE-2007-FeiS #architecture #monitoring
Microarchitectural support for program code integrity monitoring in application-specific instruction set processors (YF, ZJS), pp. 815–820.
LCTESLCTES-2007-BennettMFT #automation #embedded #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.
ESOPESOP-2007-LiOS #compilation #higher-order #logic
Structure of a Proof-Producing Compiler for a Subset of Higher Order Logic (GL, SO, KS), pp. 205–219.
FoSSaCSFoSSaCS-2007-MarnetteKR #bound #constraints #polynomial
Polynomial Constraints for Sets with Cardinality Bounds (BM, VK, MCR), pp. 258–273.
STOCSTOC-2007-BjorklundHKK #fourier #performance
Fourier meets möbius: fast subset convolution (AB, TH, PK, MK), pp. 67–74.
STOCSTOC-2007-BravermanY
Constructing non-computable Julia sets (MB, MY), pp. 709–716.
TACASTACAS-2007-MossakowskiML
The Heterogeneous Tool Set, Hets (TM, CM, KL), pp. 519–522.
ICLPICLP-2007-BaralDT #information management #natural language #prolog #towards
Towards Overcoming the Knowledge Acquisition Bottleneck in Answer Set Prolog Applications: Embracing Natural Language Inputs (CB, JD, LT), pp. 1–21.
ICLPICLP-2007-Brewka
Preferences, Contexts and Answer Sets (GB), p. 22.
ICLPICLP-2007-Eiter #programming #semantics #web
Answer Set Programming for the Semantic Web (TE), pp. 23–26.
ICLPICLP-2007-Gebser #programming
Advanced Techniques for Answer Set Programming (MG), pp. 458–459.
ICLPICLP-2007-GebserS #programming
Generic Tableaux for Answer Set Programming (MG, TS), pp. 119–133.
ICLPICLP-2007-NieuwenborghCV #fuzzy #using
Computing Fuzzy Answer Sets Using dlvhex (DVN, MDC, DV), pp. 449–450.
ICLPICLP-2007-Oikarinen #composition #programming
Modular Answer Set Programming (EO), pp. 462–463.
LICSLICS-2007-Escardo #infinity #performance
Infinite sets that admit fast exhaustive search (MHE), pp. 443–452.
LICSLICS-2007-Moczydlowski
A Dependent Set Theory (WM), pp. 23–34.
ICSTSAT-2007-SamerS #quantifier
Backdoor Sets of Quantified Boolean Formulas (MS, SS), pp. 230–243.
ICSTSAT-2007-Szeider
Matched Formulas and Backdoor Sets (SS), pp. 94–99.
PODSPODS-2006-Cohen #equivalence #query #semantics
Equivalence of queries combining set and bag-set semantics (SC), pp. 70–79.
PODSPODS-2006-GroheHS #bound #random #scalability
Randomized computations on large data sets: tight lower bounds (MG, AH, NS), pp. 243–252.
PODSPODS-2006-ZhaoOWX #distributed
Finding global icebergs over distributed data sets (QZ, MO, HW, J(X), pp. 298–307.
VLDBVLDB-2006-0003RBCY #metric
Composite Subset Measures (LC, RR, PB, BCC, VY), pp. 403–414.
VLDBVLDB-2006-DrineasM #algorithm #matrix #random
Randomized Algorithms for Matrices and Massive Data Sets (PD, MWM), p. 1269.
DLTDLT-J-2005-AfoninH06 #problem #regular expression
Membership and Finiteness Problems for Rational Sets of Regular Languages (SA, EH), pp. 493–506.
DLTDLT-J-2005-BrlekLL06
Properties of the Contour Path of Discrete Sets (SB, GL, AL), pp. 543–556.
DLTDLT-2006-DAlessandroRV #finite #order
Well Quasi Orders and the Shuffle Closure of Finite Sets (FD, GR, SV), pp. 260–269.
ICALPICALP-v1-2006-HitchcockP #reduction
Comparing Reductions to NP-Complete Sets (JMH, AP), pp. 465–476.
ICALPICALP-v2-2006-GennaroM #independence
Independent Zero-Knowledge Sets (RG, SM), pp. 34–45.
ICALPICALP-v2-2006-KariantoKT #on the #problem
On Intersection Problems for Polynomially Generated Sets (KW, AK, WT), pp. 516–527.
CoGCIG-2006-GordonR #game studies #identification #using
Trappy Minimax - using Iterative Deepening to Identify and Set Traps in Two-Player Games (VSG, AR), pp. 205–210.
ICEISICEIS-AIDSS-2006-Grzeszczyk #evaluation
Application of the Rough Set Method for Evaluation of Structural Funds Projects (TAG), pp. 202–207.
CIKMCIKM-2006-GonzalezHL #mining #workflow
Mining compressed commodity workflows from massive RFID data sets (HG, JH, XL), pp. 162–171.
CIKMCIKM-2006-ThomasH #evaluation
Evaluation by comparing result sets in context (PT, DH), pp. 94–101.
ICMLICML-2006-desJardinsEW #learning
Learning user preferences for sets of objects (Md, EE, KW), pp. 273–280.
ICMLICML-2006-SinghiL #bias #classification #learning
Feature subset selection bias for classification learning (SKS, HL), pp. 849–856.
ICPRICPR-v1-2006-ArandjelovicC #classification #using
Face Set Classification using Maximally Probable Mutual Modes (OA, RC), pp. 511–514.
ICPRICPR-v1-2006-LiCF #hybrid #kernel
Hybrid Kernel Machine Ensemble for Imbalanced Data Sets (PL, KLC, WF), pp. 1108–1111.
ICPRICPR-v1-2006-MarmoAC #classification #using
Microfossils shape classification using a set of width values (RM, SA, VC), pp. 691–694.
ICPRICPR-v1-2006-TongT #3d #multi #re-engineering
Multiresolution Mesh Reconstruction from Noisy 3D Point Sets (WST, CKT), pp. 5–8.
ICPRICPR-v2-2006-KrizekKH #feature model
Feature selection based on the training set manipulation (PK, JK, VH), pp. 658–661.
ICPRICPR-v2-2006-KuijperOBG #2d #symmetry #using
Matching 2D Shapes using their Symmetry Sets (AK, OFO, PB, PJG), pp. 179–182.
ICPRICPR-v2-2006-RooverCM #approach #multi
Smoothing with Active Surfaces: A Multiphase Level Set Approach (CDR, JC, BMM), pp. 243–246.
ICPRICPR-v2-2006-SungZL #learning #scalability
Accelerating the SVM Learning for Very Large Data Sets (ES, YZ, XL), pp. 484–489.
ICPRICPR-v2-2006-YangN #recognition #scalability
Layered Search Spaces for Accelerating Large Set Character Recognition (YY, MN), pp. 1006–1009.
ICPRICPR-v2-2006-YuW #algorithm #clustering #named #realtime #scalability
GCA: A real-time grid-based clustering algorithm for large data set (ZY, HSW), pp. 740–743.
ICPRICPR-v3-2006-ArcelliBS #3d
A New Set of Topology Preserving Removal Operations in the 3D Space (CA, GSdB, LS), pp. 1055–1058.
ICPRICPR-v3-2006-GanLY06a #array #biology #constraints #framework
Microarray Missing Data Imputation based on a Set Theoretic Framework and Biological Constraints (XG, AWCL, HY), pp. 842–845.
ICPRICPR-v3-2006-RendekW #consistency #using
Extraction of Consistent Subsets of Descriptors using Choquet Integral (JR, LW), pp. 208–211.
ICPRICPR-v3-2006-WangCSG #detection
Enhancing Training Set for Face Detection (RW, JC, SS, WG), pp. 477–480.
ICPRICPR-v3-2006-YeungS #framework #probability #symmetry
Stochastic Framework for Symmetric Affine Matching between Point Sets (SKY, PS), pp. 790–793.
ICPRICPR-v4-2006-MaurelKF
Reconciling Landmarks and Level Sets (PM, RK, ODF), pp. 69–72.
ICPRICPR-v4-2006-NosratighodsAE #novel #using #verification
Speaker Verification Using A Novel Set of Dynamic Features (MN, EA, JE), pp. 266–269.
ICPRICPR-v4-2006-ShaZT #using
Minutiae-based Fingerprint Matching Using Subset Combination (LS, FZ, XT), pp. 566–569.
KDDKDD-2006-CaldersGJ #mining
Mining rank-correlated sets of numerical attributes (TC, BG, SJ), pp. 96–105.
KDDKDD-2006-LiuZWMP #clustering #difference #order
Clustering pair-wise dissimilarity data into partially ordered sets (JL, QZ, WW, LM, JP), pp. 637–642.
KDDKDD-2006-TsangKK #feature model #kernel #performance
Efficient kernel feature extraction for massive data sets (IWT, AK, JTK), pp. 724–729.
SIGIRSIGIR-2006-Olsson #analysis #classification
An analysis of the coupling between training set and neighborhood sizes for the kNN classifier (JSO), pp. 685–686.
MODELSMoDELS-2006-AlanenP #modelling
Basic Operations over Models Containing Subset and Union Properties (MA, IP), pp. 469–483.
MODELSMoDELS-2006-AlanenP #modelling
Basic Operations over Models Containing Subset and Union Properties (MA, IP), pp. 469–483.
ASEASE-2006-EichbergMKOR #analysis #scheduling
Integrating and Scheduling an Open Set of Static Analyses (ME, MM, SK, KO, BR), pp. 113–122.
SACSAC-2006-BergerMD #categorisation #email
Exploiting partial decision trees for feature subset selection in e-mail categorization (HB, DM, MD), pp. 1105–1109.
SACSAC-2006-Goldsztejn #algorithm #approximate #branch
A branch and prune algorithm for the approximation of non-linear AE-solution sets (AG), pp. 1650–1654.
SACSAC-2006-GraillatL #pseudo
Pseudozero set of interval polynomials (SG, PL), pp. 1655–1659.
SACSAC-2006-HabichWLP #clustering
Two-phase clustering strategy for gene expression data sets (DH, TW, WL, CP), pp. 145–150.
SACSAC-2006-RouguiRAGM #documentation #modelling #retrieval #scalability
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.
SACSAC-2006-RuizCCP #algebra #analysis #concurrent #e-commerce #process #protocol #using
Analysis of the SET e-commerce protocol using a true concurrency process algebra (MCR, DC, FC, JJP), pp. 879–886.
CASECASE-2006-LiuWL #algorithm #performance #petri net
A fast algorithm to find a set of elementary siphons for a class of petri nets (XL, AW, ZL), pp. 399–404.
CGOCGO-2006-KimSMP #2d #branch #detection #named
2D-Profiling: Detecting Input-Dependent Branches with a Single Input Data Set (HK, MAS, OM, YNP), pp. 159–172.
DATEDATE-2006-GrossschadlIPTV #algorithm #case study #design #encryption
Combining algorithm exploration with instruction set design: a case study in elliptic curve cryptography (JG, PI, LP, ST, AKV), pp. 218–223.
DATEDATE-2006-LeupersKKP #configuration management #design #embedded #synthesis
A design flow for configurable embedded processors based on optimized instruction set extension synthesis (RL, KK, SK, MP), pp. 581–586.
DATEDATE-2006-LuZSLS #scheduling
Procrastinating voltage scheduling with discrete frequency sets (ZL, YZ, MRS, JL, KS), pp. 456–461.
DATEDATE-DF-2006-NazarianPGB #named #statistics
STAX: statistical crosstalk target set compaction (SN, MP, SKG, MAB), pp. 172–177.
STOCSTOC-2006-ColeG #bound
Searching dynamic point sets in spaces with bounded doubling dimension (RC, LAG), pp. 574–583.
STOCSTOC-2006-Klein #graph
A subset spanner for Planar graphs, : with application to subset TSP (PNK), pp. 749–756.
STOCSTOC-2006-Weitz #independence
Counting independent sets up to the tree threshold (DW), pp. 140–149.
CAVCAV-2006-ColvinGLM #algorithm #concurrent #lazy evaluation #verification
Formal Verification of a Lazy Concurrent List-Based Set Algorithm (RC, LG, VL, MM), pp. 475–488.
ICLPICLP-2006-BaralDT #composition #metaprogramming #using
Macros, Macro Calls and Use of Ensembles in Modular Answer Set Programming (CB, JD, HT), pp. 376–390.
ICLPICLP-2006-Brain #declarative #problem #semantics #using
Declarative Problem Solving Using Answer Set Semantics (MB), pp. 459–460.
ICLPICLP-2006-BrainCVF #named #programming
TOAST: Applying Answer Set Programming to Superoptimisation (MB, TC, MDV, JPF), pp. 270–284.
ICLPICLP-2006-GebserS #calculus #programming
Tableau Calculi for Answer Set Programming (MG, TS), pp. 11–25.
ICLPICLP-2006-GrellSS #biology #modelling #network #programming
Modelling Biological Networks by Action Languages Via Answer Set Programming (SG, TS, JS), pp. 285–299.
ICLPICLP-2006-InoueS #programming
Generality Relations in Answer Set Programming (KI, CS), pp. 211–225.
ICLPICLP-2006-NieuwenborghHV #programming
Cooperating Answer Set Programming (DVN, SH, DV), pp. 226–241.
ICLPICLP-2006-PontelliS #logic programming #semantics #source code
Justifications for Logic Programs Under Answer Set Semantics (EP, TCS), pp. 196–210.
IJCARIJCAR-2006-Brown #type system
Combining Type Theory and Untyped Set Theory (CEB), pp. 205–219.
WICSAWICSA-2005-JansenB #architecture #design
Software Architecture as a Set of Architectural Design Decisions (AJ, JB), pp. 109–120.
WICSAWICSA-2005-VasconcelosW #approach #architecture #clustering #independence #towards
Towards a Set of Application Independent Clustering Criteria within an Architecture Recovery Approach (APVdV, CW), pp. 235–236.
ICDARICDAR-2005-LiuMK #classification #feature model #recognition #scalability #using
Building Compact Classifier for Large Character Set Recognition Using Discriminative Feature Extraction (CLL, RM, MK), pp. 846–850.
ICDARICDAR-2005-WattX #recognition #scalability
Recognition for Large Sets of Handwritten Mathematical Symbols (SMW, XX), pp. 740–744.
PODSPODS-2005-AlonDLT
Estimating arbitrary subset sums with few probes (NA, NGD, CL, MT), pp. 317–325.
PODSPODS-2005-LeindersB #algebra #complexity #on the #relational
On the complexity of division and set joins in the relational algebra (DL, JVdB), pp. 76–83.
VLDBVLDB-2005-FolkertGWSBSBS #optimisation
Optimizing Refresh of a Set of Materialized Views (NF, AG, AW, SS, SB, SS, TB, LS), pp. 1043–1054.
VLDBVLDB-2005-GodfreySG #scalability
Maximal Vector Computation in Large Data Sets (PG, RS, JG), pp. 229–240.
VLDBVLDB-2005-JinL #estimation #fuzzy #scalability #string
Selectivity Estimation for Fuzzy String Predicates in Large Data Sets (LJ, CL), pp. 397–408.
VLDBVLDB-2005-PaparizosJ #algebra #question #sequence
Pattern Tree Algebras: Sets or Sequences? (SP, HVJ), pp. 349–360.
VLDBVLDB-2005-XinHYC #mining
Mining Compressed Frequent-Pattern Sets (DX, JH, XY, HC), pp. 709–720.
CSMRCSMR-2005-DubeyAJ #keyword #source code
A Technique for Extracting Keyword Based Rules from a Set of Programs (AD, SKA, PJ), pp. 217–225.
CIAACIAA-J-2004-KrawetzLS05 #complexity #finite #monad
State complexity and the monoid of transformations of a finite set (BK, JL, JS), pp. 547–563.
DLTDLT-J-2004-RispalC05 #linear #order
Complementation of rational sets on countable scattered linear orderings (CR, OC), pp. 767–786.
CIAACIAA-2005-Latour #diagrams
Computing Affine Hulls over Q and Z from Sets Represented by Number Decision Diagrams (LL), pp. 213–224.
CIAACIAA-2005-VielhaberC #infinity #on the #transducer
On a Class of Bijective Binary Transducers with Finitary Description Despite Infinite State Set (MV, MdPCC), pp. 356–357.
DLTDLT-2005-AfoninH #problem #regular expression
Membership and Finiteness Problems for Rational Sets of Regular Languages (SA, EH), pp. 88–99.
DLTDLT-2005-Kunc #on the
On Language Inequalities XK subset of LX (MK), pp. 327–337.
DLTDLT-2005-Priese #graph
Semi-rational Sets of DAGs (LP), pp. 385–396.
RTARTA-2005-BouajjaniT #on the #process #reachability #term rewriting
On Computing Reachability Sets of Process Rewrite Systems (AB, TT), pp. 484–499.
CIKMCIKM-2005-Ahonen-Myka #mining #sequence #word
Mining all maximal frequent word sequences in a set of sentences (HAM), pp. 255–256.
CIKMCIKM-2005-DaiS #documentation #retrieval
Minimal document set retrieval (WD, RKS), pp. 752–759.
CIKMCIKM-2005-YuZS #towards
Towards estimating the number of distinct value combinations for a set of attributes (XY, CZ, KCS), pp. 656–663.
KDDKDD-2005-JeskeSLYCXYLHR #generative #information management
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.
KDDKDD-2005-ZakiR #mining #reasoning #using
Reasoning about sets using redescription mining (MJZ, NR), pp. 364–373.
MLDMMLDM-2005-TakigawaKN #classification #combinator #product line #subclass
The Convex Subclass Method: Combinatorial Classifier Based on a Family of Convex Sets (IT, MK, AN), pp. 90–99.
SIGIRSIGIR-2005-FergusonSGW #retrieval #scalability #using
Top subset retrieval on large collections using sorted indices (PF, AFS, CG, PW), pp. 599–600.
SIGIRSIGIR-2005-LinH #fault #retrieval #topic
Revisiting the effect of topic set size on retrieval error (WHL, AGH), pp. 637–638.
SPLCSPLC-2005-ReiserW #using
Using Product Sets to Define Complex Product Decisions (MOR, MW), pp. 21–32.
PADLPADL-2005-Almendros-JimenezC #constraints
Solving Constraints on Sets of Spatial Objects (JMAJ, AC), pp. 158–173.
PADLPADL-2005-BaileyS #constraints #satisfiability #using
Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization (JB, PJS), pp. 174–186.
PADLPADL-2005-BrooksEMR #programming
Character-Based Cladistics and Answer Set Programming (DRB, EE, JWM, DR), pp. 37–51.
SACSAC-2005-DiazLPCV #approach #behaviour #e-commerce #probability #protocol #realtime #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.
SACSAC-2005-SpohnG #network #problem #using
A solution for the location problem in arbitrary computer networks using generic dominating sets (MAS, JJGLA), pp. 739–743.
CASECASE-2005-PengLZ #approach #fuzzy
Intelligent setup planning in manufacturing by fuzzy set theory based approach (GP, WL, YZ), pp. 130–135.
DACDAC-2005-RaoV #energy
Energy optimal speed control of devices with discrete speed sets (RR, SBKV), pp. 901–904.
DATEDATE-2005-BiswasBDPI #generative #named
ISEGEN: Generation of High-Quality Instruction Set Extensions by Iterative Improvement (PB, SB, NDD, LP, PI), pp. 1246–1251.
DATEDATE-2005-CabodiCNQ #bound #model checking #quantifier
Circuit Based Quantification: Back to State Set Manipulation within Unbounded Model Checking (GC, MC, SN, SQ), pp. 688–689.
DATEDATE-2005-MartinelliD #bound #composition
Bound Set Selection and Circuit Re-Synthesis for Area/Delay Driven Decomposition (AM, ED), pp. 430–431.
STOCSTOC-2005-Basu #algebra #algorithm #polynomial
Polynomial time algorithm for computing the top Betti numbers of semi-algebraic sets defined by quadratic inequalities (SB), pp. 313–322.
STOCSTOC-2005-BasuPR #algebra #component
Computing the first Betti number and the connected components of semi-algebraic sets (SB, RP, MFR), pp. 304–312.
STOCSTOC-2005-GafniGP #adaptation #bound #complexity
From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement (EG, RG, BP), pp. 714–722.
STOCSTOC-2005-JiaLNRS #approximate
Universal approximations for TSP, Steiner tree, and set cover (LJ, GL, GN, RR, RS), pp. 386–395.
ICSTSAT-J-2004-GummadiNV05 #algorithm #independence #satisfiability #using
Algorithms for Satisfiability Using Independent Sets of Variables (RG, NSN, VR), pp. 133–144.
ICLPICLP-2005-BaseliceBG #constraints #integration #theorem proving #towards
Towards an Integration of Answer Set and Constraint Solving (SB, PAB, MG), pp. 52–66.
ICLPICLP-2005-GiunchigliaM #on the #satisfiability
On the Relation Between Answer Set and SAT Procedures (or, Between cmodels and smodels) (EG, MM), pp. 37–51.
ICSTSAT-2005-MeierS #algebra #benchmark #metric #problem #satisfiability
A New Set of Algebraic Benchmark Problems for SAT Solvers (AM, VS), pp. 459–466.
TPDLECDL-2004-FrankeG #automation #documentation #random #scalability #strict
Automated Indexing with Restricted Random Walks on Large Document Sets (MF, AGS), pp. 232–243.
TPDLECDL-2004-KumarBHSSW #documentation #functional #library
: Bridging the Gap Between a Simple Set of Structured Documents and a Functional Digital Library (AK, AB, MH, SS, RS, JW), pp. 432–441.
HTHT-2004-HorieY #analysis #documentation #using #web
Structural analysis for web documentation using the non-well-founded set (IH, KY), pp. 42–43.
JCDLJCDL-2004-FanLXW #classification #concept #nondeterminism #semantics #video
Semantic video classification and feature subset selection under context and concept uncertainty (JF, HL, JX, LW), pp. 192–201.
SIGMODSIGMOD-2004-AndritsosMT #database #mining #scalability #tool support
Information-Theoretic Tools for Mining Database Structure from Large Data Sets (PA, RJM, PT), pp. 731–742.
SIGMODSIGMOD-2004-Sarawagi #performance #similarity
Efficient set joins on similarity predicates (SS, AK), pp. 743–754.
VLDBVLDB-2004-DasGGR #distributed #estimation
Distributed Set Expression Cardinality Estimation (AD, SG, MNG, RR), pp. 312–323.
VLDBVLDB-2004-NagarajanAP #challenge #database #integration
Database Challenges in the Integration of Biomedical Data Sets (RN, MA, AP), pp. 1202–1213.
CIAACIAA-2004-KrawetzLS #complexity #finite #monad
State Complexity and the Monoid of Transformations of a Finite Set (BK, JL, JS), pp. 213–224.
CIAACIAA-2004-Lugiez #automaton #linear #logic
From Automata to Semilinear Sets: A Logical Solution for Sets L(C, P) (DL), pp. 321–322.
DLTDLT-2004-Courcelle #graph #overview #relational
Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey (BC), pp. 1–11.
DLTDLT-2004-DAlessandroV
Avoidable Sets and Well Quasi-Orders (FD, SV), pp. 139–150.
DLTDLT-2004-RispalC #linear #order
Complementation of Rational Sets on Countable Scattered Linear Orderings (CR, OC), pp. 381–392.
ICALPICALP-2004-HalperinK #problem
The Minimum-Entropy Set Cover Problem (EH, RMK), pp. 733–744.
ICALPICALP-2004-Midrijanis #bound #polynomial #problem #quantum #query #similarity
A Polynomial Quantum Query Lower Bound for the Set Equality Problem (GM), pp. 996–1005.
ICALPICALP-2004-NikoletseasRS #graph #independence #performance #random #scalability
The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs (SEN, CR, PGS), pp. 1029–1040.
SEFMSEFM-2004-Struth #automation #reasoning
Automated Element-Wise Reasoning with Sets (GS), pp. 320–329.
ICEISICEIS-v2-2004-KooptiwootS #mining #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.
ICEISICEIS-v2-2004-KooptiwootS04a #idea #mining #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.
ICEISICEIS-v2-2004-WuW04a #algorithm #comparison
Result Comparison of Two Rough Set Based Discretization Algorithms (SW, WW), pp. 511–514.
ICEISICEIS-v2-2004-ZaratePSSVD #clustering #network #optimisation #representation
Optimization of Neural Network’s Training Sets via Clustering: Application in Solar Collector Representation (LEZ, EMDP, DAS, JPDS, RV, ASCD), pp. 147–152.
CIKMCIKM-2004-GollapudiS #algorithm #analysis #framework
Framework and algorithms for trend analysis in massive temporal data sets (SG, DS), pp. 168–177.
ICMLICML-2004-BahamondeBDQLCAG #case study #learning
Feature subset selection for learning preferences: a case study (AB, GFB, JD, JRQ, OL, JJdC, JA, FG).
ICPRICPR-v2-2004-BrownCA #classification #performance
Efficient Calculation of the Complete Optimal Classification Set (MB, NC, SA), pp. 307–310.
ICPRICPR-v2-2004-LiT #modelling #recognition
Influence of Language Models and Candidate Set Size on Contextual Post-processing for Chinese Script Recognition (YL, CLT), pp. 537–540.
ICPRICPR-v2-2004-ToyamaSM #image
Image Mosaicing from a Set of Images Without Configuration Information (FT, KS, JM), pp. 899–902.
ICPRICPR-v2-2004-WangZKT #distance #image #segmentation
Level Set Methods, Distance Function and Image Segmentation (DW, JZ, SCK, ZT), pp. 110–115.
ICPRICPR-v3-2004-AdeodatoVASCM #case study #comparative #network #scalability
Neural Networks vs Logistic Regression: a Comparative Study on a Large Data Set (PJLA, GCV, ALA, RAFS, RCLVC, DSMPM), pp. 355–358.
ICPRICPR-v3-2004-GanLY #array #estimation
Missing Microarray Data Estimation Based on Projection onto Convex Sets Method (XG, AWCL, HY), pp. 782–785.
ICPRICPR-v3-2004-KuijperO #symmetry
Transitions of the Pre-Symmetry Set (AK, OFO), pp. 190–193.
ICPRICPR-v3-2004-SotocaSP #multi #naive bayes #using
Attribute Relevance in Multiclass Data Sets Using the Naive Bayes Rule (JMS, JSS, FP), pp. 426–429.
ICPRICPR-v4-2004-HeidemannBBS #clustering #gesture #recognition #scalability #self #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.
ICPRICPR-v4-2004-PrasadSK #image #using
Feature Subset Selection using ICA for Classifying Emphysema in HRCT Images (MNP, AS, IK), pp. 515–518.
KDDKDD-2004-AfratiGM #approximate
Approximating a collection of frequent sets (FNA, AG, HM), pp. 12–19.
KDDKDD-2004-TinoKS #approach #generative #probability #sequence #visualisation
A generative probabilistic approach to visualizing sets of symbolic sequences (PT, AK, YS), pp. 701–706.
KRKR-2004-Brewka #optimisation
Complex Preferences for Answer Set Optimization (GB), pp. 213–223.
KRKR-2004-EiterFFPW #bound #complexity #model checking #programming
Complexity of Model Checking and Bounded Predicate Arities for Non-ground Answer Set Programming (TE, WF, MF, GP, SW), pp. 377–387.
KRKR-2004-EiterLST #logic #programming #semantics #web
Combining Answer Set Programming with Description Logics for the Semantic Web (TE, TL, RS, HT), pp. 141–151.
SIGIRSIGIR-2004-AmitayCLS #evaluation #scalability #using
Scaling IR-system evaluation using term relevance sets (EA, DC, RL, AS), pp. 10–17.
TOOLSTOOLS-USA-2003-Bouktif04 #approach #predict #quality #search-based
Improving Rule Set Based Software Quality Prediction: A Genetic Algorithm-based Approach (SB), pp. 227–241.
PADLPADL-2004-Balduccini #named #quality
USA-Smart: Improving the Quality of Plans in Answer Set Planning (MB), pp. 135–147.
PADLPADL-2004-ElkhatibPS #named #prolog #reasoning #source code
ASP-PROLOG: A System for Reasoning about Answer Set Programs in Prolog (OEK, EP, TCS), pp. 148–162.
PLDIPLDI-2004-KodumalA #constraints #reachability
The set constraint/CFL reachability connection in practice (JK, AA), pp. 207–218.
SACSAC-2004-MassonRB #database #induction #optimisation #query #towards
Optimizing subset queries: a step towards SQL-based inductive databases for itemsets (CM, CR, JFB), pp. 535–539.
SACSAC-2004-QiW #mining
A model for mining outliers from complex data sets (HQ, JW), pp. 595–599.
DACDAC-2004-BiswasCAPID #memory management
Introduction of local memory elements in instruction set extensions (PB, VC, KA, LP, PI, ND), pp. 729–734.
DACDAC-2004-BriskKS #configuration management #design #synthesis
Area-efficient instruction set synthesis for reconfigurable system-on-chip designs (PB, AK, MS), pp. 395–400.
DATEDATE-v1-2004-DimopoulosL #performance #sequence #testing
Efficient Static Compaction of Test Sequence Sets through the Application of Set Covering Techniques (MGD, PL), pp. 194–201.
STOCSTOC-2004-BurgisserC #algebra #complexity
Counting complexity classes for numeric computations II: algebraic and semialgebraic sets (PB, FC), pp. 475–485.
STOCSTOC-2004-KenyonRS
Low distortion maps between point sets (CK, YR, AS), pp. 272–280.
CAVCAV-2004-PingreeM
The HiVy Tool Set (PJP, EM), pp. 466–469.
CSLCSL-2004-RychlikowskiT #constraints
Set Constraints on Regular Terms (PR, TT), pp. 458–472.
ICLPICLP-2004-ErdemW #programming #using
Rectilinear Steiner Tree Construction Using Answer Set Programming (EE, MDFW), pp. 386–399.
ICLPICLP-2004-Gelfond #design #programming
Answer Set Programming and the Design of Deliberative Agents (MG), pp. 19–26.
ICLPICLP-2004-JiaYY #source code
Adding Domain Dependent Knowledge into Answer Set Programs for Planning (XJ, JHY, LYY), pp. 400–415.
ICLPICLP-2004-Pearce #logic programming #semantics #source code
Simplifying Logic Programs Under Answer Set Semantics (DP), pp. 210–224.
ICLPICLP-2004-RayBR #kernel
Generalised Kernel Sets for Inverse Entailment (OR, KB, AR), pp. 165–179.
ICLPICLP-2004-WakakiI #compilation #programming
Compiling Prioritized Circumscription into Answer Set Programming (TW, KI), pp. 356–370.
SATSAT-2004-GummadiNV #algorithm #independence #satisfiability #using
Algorithms for Satisfiability using Independent Sets of Variables (RG, NSN, VR), pp. 56–63.
SATSAT-2004-NishimuraRS #detection
Detecting Backdoor Sets with Respect to Horn and Binary Clauses (NN, PR, SS), pp. 96–103.
VMCAIVMCAI-2004-BagnaraHZ
Widening Operators for Powerset Domains (RB, PMH, EZ), pp. 135–148.
DRRDRR-2003-MaderlechnerS #recognition #using
Extraction of valid data sets in registers using recognition of invalidation lines (GM, PS), pp. 67–72.
ICDARICDAR-2003-BaldiMS #classification #using
Using tree-grammars for training set expansion in page classification (SB, SM, GS), pp. 829–833.
ICDARICDAR-2003-HaoLS03a #algorithm #classification #comparison #search-based
Comparison of Genetic Algorithm and Sequential Search Methods for Classifier Subset Selection (HH, CLL, HS), pp. 765–769.
ICDARICDAR-2003-VelekN #classification #online #performance #recognition #scalability
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.
ICDARICDAR-2003-YangVN #recognition #scalability #using
Accelerating Large Character Set Recognition using Pivots (YY, OV, MN), pp. 262–267.
JCDLJCDL-2003-Ward #analysis #metadata
A Quantitative Analysis of Unqualified Dublin Core Metadata Element Set Usage within Data Providers Registered with the Open Archives Initiative (JW), pp. 315–317.
PODSPODS-2003-Behrend #database #deduction #evaluation #query
Soft stratification for magic set based query evaluation in deductive databases (AB), pp. 102–110.
PODSPODS-2003-MendelzonP
Concise descriptions of subsets of structured sets (AOM, KQP), pp. 123–133.
SIGMODSIGMOD-2003-GangulyGR
Processing Set Expressions over Continuous Update Streams (SG, MNG, RR), pp. 265–276.
SIGMODSIGMOD-2003-KriegelBKPS #similarity #using
Using Sets of Feature Vectors for Similarity Search on Voxelized CAD Objects (HPK, SB, PK, MP, MS), pp. 587–598.
VLDBVLDB-2003-LimWV #adaptation #named #self
SASH: A Self-Adaptive Histogram Set for Dynamically Changing Workloads (LL, MW, JSV), pp. 369–380.
DLTDLT-2003-Gecseg #automaton
Comments on Complete Sets of Tree Automata (FG), pp. 22–34.
DLTDLT-2003-Giammarresi #bound
Computing Languages by (Bounded) Local Sets (DG), pp. 304–315.
ICEISICEIS-v2-2003-HassanienA #algorithm #classification #image #performance #retrieval
An Efficient Classification and Image Retrieval Algorithm Based on Rough Set Theory (AEH, JMHA), pp. 457–460.
ICEISICEIS-v2-2003-SrikumarB #algorithm #mining #transaction
An Algorithm for Mining Maximal Frequent Sets Based on Dominancy of Transactions (KS, BB), pp. 422–425.
ICEISICEIS-v4-2003-LimaCPFSY #component #interactive #named #towards #web
Archcollect: A Set of Components Towards Web Users’ Interactions (JdCL, TGdSC, RMP, JCF, JBMS, ETY), pp. 308–316.
ICMLICML-2003-KondorJ #kernel
A Kernel Between Sets of Vectors (RK, TJ), pp. 361–368.
ICMLICML-2003-MarchandSSS
The Set Covering Machine with Data-Dependent Half-Spaces (MM, MS, JST, MS), pp. 520–527.
KDDKDD-2003-Houle #clustering #navigation
Navigating massive data sets via local clustering (MEH), pp. 547–552.
KDDKDD-2003-YuYH #clustering #scalability #using
Classifying large data sets using SVMs with hierarchical clusters (HY, JY, JH), pp. 306–315.
MLDMMLDM-2003-DehmeshkiKC #rule-based
A Rule-Based Scheme for Filtering Examples from Majority Class in an Imbalanced Training Set (JD, MK, MVC), pp. 215–223.
MLDMMLDM-2003-ImiyaTOH #bound #detection #random
Detecting the Boundary Curve of Planar Random Point Set (AI, KT, HO, VH), pp. 413–424.
SEKESEKE-2003-SuzukiT #information management #web
Path Set Operations for Clipping of Parts of Web Pages and Information Extraction from Web pages (TS, TT), pp. 547–554.
SIGIRSIGIR-2003-BawaMR #named #segmentation #topic
SETS: search enhanced by topic segmentation (MB, GSM, PR), pp. 306–313.
PADLPADL-2003-ErdemLNR #programming #using
Reconstructing the Evolutionary History of Indo-European Languages Using Answer Set Programming (EE, VL, LN, DR), pp. 160–176.
PPDPPPDP-2003-BandaSW #satisfiability
Finding all minimal unsatisfiable subsets (MJGdlB, PJS, JW), pp. 32–43.
PPDPPPDP-2003-PaluDPR #constraints #finite
Integrating finite domain constraints and CLP with sets (ADP, AD, EP, GR), pp. 219–229.
ESEC-FSEESEC-FSE-2003-EshuisBDGR #modelling #named #performance #validation
EFFICIENT: a tool set for supporting the modelling and validation of ebXML (RE, PB, ED, BG, SR), pp. 359–362.
SACSAC-2003-XuKTONOS #biology #database #tool support
Pathways Database System: An Integrated Set of Tools for Biological Pathways (WX, LK, MT, , JHN, ZMÖ, GS), pp. 96–102.
DACDAC-2003-ReshadiMD #flexibility #performance #simulation
Instruction set compiled simulation: a technique for fast and flexible instruction set simulation (MR, PM, NDD), pp. 758–763.
DATEDATE-2003-GoelB #analysis #functional #reachability
Set Manipulation with Boolean Functional Vectors for Symbolic Reachability Analysis (AG, REB), pp. 10816–10821.
DATEDATE-2003-RemondB #design
Set Top Box SoC Design Methodology at STMicroelectronics (FR, PB), pp. 20220–20223.
DATEDATE-2003-SchnerrHR #agile #prototype
Instruction Set Emulation for Rapid Prototyping of SoCs (JS, GH, WR), pp. 10562–10569.
STOCSTOC-2003-AlonAA #online #problem
The online set cover problem (NA, BA, YA, NB, JN), pp. 100–105.
STOCSTOC-2003-MorrisP #evolution #mixin
Evolving sets and mixin (BM, YP), pp. 279–286.
STOCSTOC-2003-RettingerW #complexity
The computational complexity of some julia sets (RR, KW), pp. 177–185.
TACASTACAS-2003-HermannsJ #analysis #component #dependence #performance
A Set of Performance and Dependability Analysis Components for CADP (HH, CJ), pp. 425–430.
CADECADE-2003-Stump
Subset Types and Partial Functions (AS), pp. 151–165.
CSLCSL-2003-Miquel #normalisation
A Strongly Normalising Curry-Howard Correspondence for IZF Set Theory (AM), pp. 441–454.
ICLPICLP-2003-DovierPR
Intensional Sets in CLP (AD, EP, GR), pp. 284–299.
ICLPICLP-2003-ErdoganL #programming
Definitions in Answer Set Programming: (STE, VL), pp. 483–484.
ICLPICLP-2003-LoncT #modelling
Computing Minimal Models, Stable Models, and Answer Sets (ZL, MT), pp. 209–223.
ICLPICLP-2003-SonP
Adding Preferences to Answer Set Planning (TCS, EP), pp. 513–514.
ICLPICLP-2003-ZhaoL #case study #programming #source code
Answer Set Programming Phase Transition: A Study on Randomly Generated Programs (YZ, FL), pp. 239–253.
ICSTSAT-2003-Bruni #fault #satisfiability #scalability
Solving Error Correction for Large Data Sets by Means of a SAT Solver (RB), pp. 229–241.
SIGMODSIGMOD-2002-RundensteinerWYD #data analysis #interactive #named #visual notation
XmdvTool: visual interactive data exploration and trend discovery of high-dimensional data sets (EAR, MOW, JY, PRD), p. 631.
SIGMODSIGMOD-2002-WangWYY #clustering #scalability #similarity
Clustering by pattern similarity in large data sets (HW, WW, JY, PSY), pp. 394–405.
ITiCSEITiCSE-2002-AlmBEOS #c# #exclamation
You’d better set down for this!: creating a set type for CS1 & CS2 in C# (JA, RB, SE, CDO, AS), pp. 14–18.
SCAMSCAM-J-2001-AndersonBRT02 #points-to
Flow insensitive points-to sets (PA, DB, GR, TT), pp. 743–754.
CIAACIAA-2002-Daciuk #algorithm #automaton #comparison #finite #string
Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings (JD), pp. 255–261.
DLTDLT-2002-Holub #similarity
A Unique Structure of Two-Generated Binary Equality Sets (SH), pp. 245–257.
ICALPICALP-2002-Brattka #random #recursion
Random Numbers and an Incomplete Immune Recursive Set (VB), pp. 950–961.
ICALPICALP-2002-CharikarIP #algorithm #orthogonal #problem #query
New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems (MC, PI, RP), pp. 451–462.
ICALPICALP-2002-Nisan #approximate #communication #complexity
The Communication Complexity of Approximate Set Packing and Covering (NN), pp. 868–875.
RTARTA-2002-CharatonikT #constraints
Atomic Set Constraints with Projection (WC, JMT), pp. 311–325.
RTARTA-2002-RetyV
Regular Sets of Descendants by Some Rewrite Strategies (PR, JV), pp. 129–143.
CIKMCIKM-2002-OrdonezO #clustering #named #performance #robust #scalability
FREM: fast and robust EM clustering for large data sets (CO, EO), pp. 590–599.
CIKMCIKM-2002-TangZ
An iterative strategy for pattern discovery in high-dimensional data sets (CT, AZ), pp. 10–17.
ICMLICML-2002-AlphonseM #induction #logic programming
Feature Subset Selection and Inductive Logic Programming (ÉA, SM), pp. 11–18.
ICPRICPR-v1-2002-PhillipsSRGB #algorithm #challenge #identification #problem
The Gait Identification Challenge Problem: Data Sets and Baseline Algorithm (PJP, SS, IRV, PG, KWB), pp. 385–388.
ICPRICPR-v2-2002-BarataP #classification #clustering #modelling #using
Improving Classification Rates by Modelling the Clusters of Trainings Sets in Features Space Using Mathematical Morphology Operators (TB, PP), pp. 328–331.
ICPRICPR-v2-2002-RonnebergerBS #3d #classification #invariant #recognition #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–?.
ICPRICPR-v2-2002-XiaoAX #optimisation
Pair-Wise Sequential Reduced Set for Optimization of Support Vector Machines (XX, HA, GX), pp. 860–863.
ICPRICPR-v3-2002-LiZL
A New Strategy for Selecting Working Sets Applied in SMO (JL, BZ, FL), pp. 427–430.
ICPRICPR-v3-2002-ZhouK #representation #using
Representing and Recognizing Complete Set of Geons Using Extended Superquadrics (LZ, CK), pp. 713–718.
ICPRICPR-v4-2002-BarataP02a #classification #clustering #modelling #using
Improving Classification Rates by Modelling the Clusters of Trainings Sets in Features Space Using Mathematical Morphology Operators (TB, PP), pp. 90–93.
KDDKDD-2002-CohenR #clustering #integration #learning #scalability
Learning to match and cluster large high-dimensional data sets for data integration (WWC, JR), pp. 475–480.
KDDKDD-2002-Frigui #approach #clustering #identification #named #performance #scalability
SyMP: an efficient clustering approach to identify clusters of arbitrary shapes in large data sets (HF), pp. 507–512.
KDDKDD-2002-LiTS #classification #robust
Construct robust rule sets for classification (JL, RWT, HS), pp. 564–569.
KDDKDD-2002-LiuPWH #mining
Mining frequent item sets by opportunistic projection (JL, YP, KW, JH), pp. 229–238.
KDDKDD-2002-TuzhilinL #multi #query
Querying multiple sets of discovered rules (AT, BL), pp. 52–60.
SIGIRSIGIR-2002-Kawatani #categorisation #difference #documentation #topic
Topic difference factor extraction between two document sets and its application to text categorization (TK), pp. 137–144.
SIGIRSIGIR-2002-VoorheesB #empirical #fault #retrieval #topic
The effect of topic set size on retrieval experiment error (EMV, CB), pp. 316–323.
LOPSTRLOPSTR-2002-Berghammer
A Generic Program for Minimal Subsets with Applications (RB), pp. 144–157.
AdaSIGAda-2002-Santhanam #ada #compilation
The anatomy of an FAA-qualifiable Ada subset compiler (VS), pp. 40–43.
SACSAC-2002-Baptista #design #implementation #multi
A geolibrary for multimedia data sets: design and implementation issues (CdSB), pp. 488–492.
SACSAC-2002-ButenkoPSSS #graph #independence
Finding maximum independent sets in graphs arising from coding theory (SB, PMP, IS, VS, PS), pp. 542–546.
SACSAC-2002-Dandashi #automation #metric #object-oriented #reuse #usability #using
A method for assessing the reusability of object-oriented code using a validated set of automated measurements (FD), pp. 997–1003.
SACSAC-2002-JulstromR #algorithm #robust
Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges (BAJ, GRR), pp. 547–552.
DATEDATE-2002-PomeranzR #fault #multi #using
Test Enrichment for Path Delay Faults Using Multiple Sets of Target Faults (IP, SMR), pp. 722–729.
DATEDATE-2002-SchwenckerSPG #adaptation #parametricity #using #worst-case
Analog Circuit Sizing Using Adaptive Worst-Case Parameter Sets (RS, FS, MP, HEG), pp. 581–585.
DATEDATE-2002-ZhaoMB #compilation #design #modelling #using
Practical Instruction Set Design and Compiler Retargetability Using Static Resource Models (QZ, BM, TB), pp. 1021–1026.
CADECADE-2002-Brown #higher-order #proving #theorem proving
Solving for Set Variables in Higher-Order Theorem Proving (CEB), pp. 408–422.
CSLCSL-2002-Goubault-Larrecq #constraints #higher-order
Higher-Order Positive Set Constraints (JGL), pp. 473–489.
ICLPICLP-2002-DimopoulosS #towards
Towards Local Search for Answer Sets (YD, AS), pp. 363–377.
LICSLICS-2002-Simpson #modelling #recursion
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory (AKS), pp. 287–298.
DocEngDocEng-2001-McKechnieSL #case study #documentation #industrial #scalability
Computer assisted processing of large unstructured document sets: a case study in the construction industry (JM, SS, SL), pp. 11–17.
TPDLECDL-2001-Spencer #multi #recognition
Digitization, Coded Character Sets, and Optical Character Recognition for Multi-script Information Resources: The Case of the Letopis’ Zhurnal’nykh Statei (GAS), pp. 429–437.
ICDARICDAR-2001-FreitasBS #approach #recognition #validation #word
Handwritten Isolated Word Recognition: An Approach Based on Mutual Information for Feature Set Validation (COdAF, FB, RS), pp. 665–669.
ICDARICDAR-2001-GatosP #image #performance #segmentation
Applying Fast Segmentation Techniques at a Binary Image Represented by a Set of Non-Overlapping Blocks (BG, NP), pp. 1147–1153.
ICDARICDAR-2001-GomesL #feature model #fuzzy #recognition
Feature Extraction Based on Fuzzy Set Theory for Handwriting Recognition (NRG, LLL), pp. 655–659.
ICDARICDAR-2001-VuoriLOK #online #prototype #recognition
Speeding Up On-line Recognition of Handwritten Characters by Pruning the Prototype Set (VV, JL, EO, JK), pp. 501–507.
ICDARICDAR-2001-WangCFZ #normalisation #recognition
Match Between Normalization Schemes and Feature Sets for Handwritten Chinese Character Recognition (QW, ZC, DDF, RZ), pp. 551–555.
VLDBVLDB-2001-StanoiRAA #database
Discovery of Influence Sets in Frequently Updated Databases (IS, MR, DA, AEA), pp. 99–108.
PASTEPASTE-2001-MockDCE #analysis #comparison #comprehension #optimisation #points-to
Dynamic points-to sets: a comparison with static analyses and potential applications in program understanding and optimization (MM, MD, CC, SJE), pp. 66–72.
SCAMSCAM-2001-AndersonBRT #points-to
Flow Insensitive Points-To Sets (PA, DB, GR, TT), pp. 81–91.
DLTDLT-2001-Kuske #axiom
Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable (DK), pp. 206–216.
ICALPICALP-2001-ComonCM #automaton #constraints #memory management #protocol
Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols (HC, VC, JM), pp. 682–693.
ICEISICEIS-v1-2001-SoonthornphisajK #algorithm #categorisation #problem #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.
CIKMCIKM-2001-Couchot #analysis #composition #termination
Termination Analysis of Active Rules Modular Sets (AC), pp. 326–333.
CIKMCIKM-2001-MarcusML #fault #identification
Ordinal Association Rules for Error Identification in Data Sets (AM, JIM, KIL), pp. 589–591.
CIKMCIKM-2001-ToutanovaCPH #classification
Text Classification in a Hierarchical Mixture Model for Small Training Sets (KT, FC, KP, TH), pp. 105–112.
ICMLICML-2001-MarchandS #learning
Learning with the Set Covering Machine (MM, JST), pp. 345–352.
ICMLICML-2001-PerkinsB #learning
Lyapunov-Constrained Action Sets for Reinforcement Learning (TJP, AGB), pp. 409–416.
KDDKDD-2001-AggarwalP #concept #mining #re-engineering #semistructured data
Mining massively incomplete data sets by conceptual reconstruction (CCA, SP), pp. 227–232.
KDDKDD-2001-DittrichS #algorithm #mining #named #scalability
GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces (JPD, BS), pp. 47–56.
KDDKDD-2001-LiuHM01a
Discovering the set of fundamental rule changes (BL, WH, YM), pp. 335–340.
KDDKDD-2001-Morimoto #database #mining
Mining frequent neighboring class sets in spatial databases (YM), pp. 353–358.
SEKESEKE-2001-Basili #concept #experience #implementation
Implementing the Experience Factory concepts as a set of Experience Bases (VRB), pp. 102–109.
LOPSTRLOPSTR-2001-FioravantiPP #infinity #process #program transformation #using #verification
Verification of Sets of Infinite State Processes Using Program Transformation (FF, AP, MP), pp. 111–128.
LOPSTRLOPSTR-2001-OsorioNA #equivalence #programming
Equivalence in Answer Set Programming (MO, JANP, JA), pp. 57–75.
PADLPADL-2001-FlenerHK01a #metaheuristic #problem
A Meta-heuristic for Subset Problems (PF, BH, ZK), pp. 274–287.
PADLPADL-2001-PontelliE #optimisation #parallel #programming
Construction and Optimization of a Parallel Engine for Answer Set Programming (EP, OEK), pp. 288–303.
ASEASE-2001-XieLB #execution #model checking #uml
Model Checking for an Executable Subset of UML (FX, VL, JCB), pp. 333–336.
ICSEICSE-2001-Shepard #performance #source code
An Efficient Set of Software Degree Programs for One Domain (TS), pp. 623–632.
SACSAC-2001-ZhouCH #correlation #identification #optimisation #problem #using
Identifying the most significant pairwise correlations of residues in different positions of helices: the subset selection problem using least squares optimization (XZ, GC, MTH), pp. 51–55.
DACDAC-2001-WangKMR #hardware
Hardware/Software Instruction Set Configurability for System-on-Chip Processors (AW, EK, DEM, CR), pp. 184–188.
DATEDATE-2001-ChiusanoCPW #on the
On applying the set covering model to reseeding (SC, SDC, PP, HJW), pp. 156–161.
FoSSaCSFoSSaCS-2001-Stirling #decidability #parallel #process #similarity
Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes (CS), pp. 379–393.
STOCSTOC-2001-KlauckNTZ #communication #complexity #interactive #quantum
Interaction in quantum communication and the complexity of set disjointness (HK, AN, ATS, DZ), pp. 124–133.
TACASTACAS-2001-CimattiRB #automaton #model checking
Searching Powerset Automata by Combining Explicit-State and Symbolic Model Checking (AC, MR, PB), pp. 313–327.
IJCARIJCAR-2001-AngerKL #logic programming #reasoning #semantics #source code
NoMoRe : A System for Non-monotonic Reasoning with Logic Programs under Answer Set Semantics (CA, KK, TL), pp. 325–330.
IJCARIJCAR-2001-Lucke #named
Hilberticus — A Tool Deciding an Elementary Sublanguage of Set Theory (JL), pp. 690–695.
IJCARIJCAR-2001-Paulson #proving
SET Cardholder Registration: The Secrecy Proofs (LCP), pp. 5–12.
TPDLECDL-2000-DzeakouD #architecture #documentation #multi
An Architecture for a Multi Criteria Exploration of a Documents Set (PD, JCD), pp. 494–497.
TPDLECDL-2000-MacedoCF
Fusion of Overlapped Result Sets (JM, AC, VF), pp. 376–379.
SIGMODSIGMOD-2000-KornM #nearest neighbour #query
Influence Sets Based on Reverse Nearest Neighbor Queries (FK, SM), pp. 201–212.
SIGMODSIGMOD-2000-RamaswamyRS #algorithm #mining #performance #scalability
Efficient Algorithms for Mining Outliers from Large Data Sets (SR, RR, KS), pp. 427–438.
VLDBVLDB-2000-KoudasIM #identification #roadmap #sketching #using
Identifying Representative Trends in Massive Time Series Data Sets Using Sketches (PI, NK, SM), pp. 363–372.
VLDBVLDB-2000-RamasamyPNK
Set Containment Joins: The Good, The Bad and The Ugly (KR, JMP, JFN, RK), pp. 351–362.
CSMRCSMR-2000-AntoniolCCL #case study #identification #maintenance
Identifying the Starting Impact Set of a Maintenance Request: A Case Study (GA, GC, GC, ADL), pp. 227–230.
CIAACIAA-2000-Wareham #automaton #complexity #composition #finite
The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata (TW), pp. 302–310.
ICALPICALP-2000-KarhumakiP #finite #on the
On the Centralizer of a Finite Set (JK, IP), pp. 536–546.
ICALPICALP-2000-KumarAR
Hardness of Set Cover with Intersection 1 (VSAK, SA, HR), pp. 624–635.
CIKMCIKM-2000-FerhatosmanogluTAA #approximate
Vector Approximation based Indexing for Non-uniform High Dimensional Data Sets (HF, ET, DA, AEA), pp. 202–209.
CIKMCIKM-2000-Yang #3d #named #relational #scalability
n23Tool: a Tool for Exploring Large Relational Data Sets Through 3D Dynamic Projections (LY), pp. 322–327.
ICMLICML-2000-DyB #identification #learning #order
Feature Subset Selection and Order Identification for Unsupervised Learning (JGD, CEB), pp. 247–254.
ICMLICML-2000-KimN #learning #network
Learning Bayesian Networks for Diverse and Varying numbers of Evidence Sets (ZWK, RN), pp. 479–486.
ICMLICML-2000-KomarekM #adaptation #machine learning #performance #scalability
A Dynamic Adaptation of AD-trees for Efficient Machine Learning on Large Data Sets (PK, AWM), pp. 495–502.
ICPRICPR-v1-2000-BaillardHB #3d #segmentation
Cooperation between Level Set Techniques and Dense 3D Registration for the Segmentation of Brain Structures (CB, PH, CB), pp. 1991–1994.
ICPRICPR-v1-2000-WilliamsB #algorithm #evaluation #multi #novel
Evaluation of a Novel Multiple Point Set Registration Algorithm (JAW, MB), pp. 5007–5010.
ICPRICPR-v1-2000-WolfSW #3d
Join Tensors: On 3D-to-3D Alignment of Dynamic Sets (LW, AS, YW), pp. 1388–1391.
ICPRICPR-v2-2000-HolzL #using #validation
Validation of Relative Feature Importance Using a Natural Data Set (HJH, MHL), pp. 2414–2417.
ICPRICPR-v2-2000-MelkemiVC
Shapes of Weighted Points Sets (MM, DV, LC), pp. 6058–6061.
ICPRICPR-v2-2000-SmitsA #cost analysis #image #interactive
Cost-Based Feature Subset Selection for Interactive Image Analysis (PCS, AA), pp. 2386–2389.
ICPRICPR-v2-2000-VarstaHMM #human-computer #interface #performance
Evaluating the Performance of Three Feature Sets for Brain-Computer Interfaces with an Early Stopping MLP Committee (MV, JH, JdRM, JM), pp. 2907–2910.
ICPRICPR-v3-2000-Jehan-BessonBA #detection #using
Detection and Tracking of Moving Objects using a New Level Set Based Method (SJB, MB, GA), pp. 7112–7117.
ICPRICPR-v3-2000-MaenpaaOPM #classification #robust
Robust Texture Classification by Subsets of Local Binary Patterns (TM, TO, MP, MS), pp. 3947–3950.
ICPRICPR-v3-2000-PetrosinoC #clustering #fuzzy #parallel
Unsupervised Texture Discrimination Based on Rough Fuzzy Sets and Parallel Hierarchical Clustering (AP, MC), pp. 7100–7103.
KDDKDD-2000-Bay #mining #multi
Multivariate discretization of continuous variables for set mining (SDB), pp. 315–319.
KDDKDD-2000-McCallumNU #clustering #performance
Efficient clustering of high-dimensional data sets with application to reference matching (AM, KN, LHU), pp. 169–178.
KDDKDD-2000-PadmanabhanT
Small is beautiful: discovering the minimal set of unexpected patterns (BP, AT), pp. 54–63.
KRKR-2000-Mota
Cyclical and Granular Time Theories as Subsets of the Herbrand Universe (EM), pp. 366–377.
SPLCSPLC-2000-Morisawa #distributed #product line
A computing model of product lines for distributed processing systems, its product sets, and its applications (YM), pp. 371–394.
TOOLSTOOLS-PACIFIC-2000-NguyenZA #approach #modelling
A Set Approach to Role Modeling (LTN, LZ, BA), pp. 158–169.
TOOLSTOOLS-USA-2000-BirngruberH #specification #using
Using Plans for Specifying Preconfigured Bean Sets (DB, MH), pp. 217–226.
AdaEuropeAdaEurope-2000-ChenL #on the
On the Minimal Essential Subsets and Minimal Representative Sets (TYC, MFL), pp. 291–301.
PLDIPLDI-2000-LarsenA #parallel
Exploiting superword level parallelism with multimedia instruction sets (SL, SPA), pp. 145–156.
REICRE-2000-Ferdinandi
The Requirement Set (PF), p. 63.
ICSEICSE-2000-MarcaP #approach #internet #re-engineering
A software engineering approach and tool set for developing Internet applications (DAM, BAP), pp. 738–741.
LCTESLCTES-2000-BairagiPA #embedded #framework #quality
A Framework for Enhancing Code Quality in Limited Register Set Embedded Processors (DB, SP, DPA), pp. 81–95.
ESOPESOP-2000-Mauborgne #infinity #representation
Improving the Representation of Infinite Trees to Deal with Sets of Trees (LM), pp. 275–289.
STOCSTOC-2000-DamMMS #fault tolerance #quantum #self
Self-testing of universal and fault-tolerant sets of quantum gates (WvD, FM, MM, MS), pp. 688–696.
TACASTACAS-2000-DelzannoR #representation
Symbolic Representation of Upward-Closed Sets (GD, JFR), pp. 426–440.
ICLPCL-2000-AzevedoB #constraints #modelling #problem
Modelling Digital Circuits Problems with Set Constraints (FA, PB), pp. 414–428.
ICLPCL-2000-DuchierN #constraints
Dominance Constraints with Set Operators (DD, JN), pp. 326–341.
ICLPCL-2000-MoinardR #finite
Smallest Equivalent Sets for Finite Propositional Formula Circumscription (YM, RR), pp. 897–911.
LICSLICS-2000-Krivine
The Curry-Howard Correspondence in Set Theory (JLK), pp. 307–308.
ICDARICDAR-1999-Phillips #how #image
How to Extend and Bootstrap an Existing Data Set with Real-life Degraded Images (ITP), pp. 689–692.
SIGMODSIGMOD-1999-LakshmananNHP #constraints #optimisation #query
Optimization of Constrained Frequent Set Queries with 2-variable Constraints (LVSL, RTN, JH, AP), pp. 157–168.
SIGMODSIGMOD-1999-NgLHM #mining #query
Exploratory Mining via Constrained Frequent Set Queries (RTN, LVSL, JH, TM), pp. 556–558.
CSMRCSMR-1999-RaysideK #deployment #embedded #java #library
Extracting Java Library Subsets for Deployment on Embedded Systems (DR, KK), pp. 102–110.
CSMRCSMR-1999-Tonella #analysis #points-to
Effects of Different Flow Insensitive Points-to Analyses on DEF/USE Sets (PT), pp. 62–71.
ICALPICALP-1999-AndreevBCR #bound #branch #pseudo #source code
Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs (AEA, JLB, AEFC, JDPR), pp. 179–189.
ICALPICALP-1999-Sanders #multi #sequence
Accessing Multiple Sequences Through Set Associative Caches (PS), pp. 655–664.
KDDKDD-1999-BayP #category theory #data mining #detection #mining
Detecting Change in Categorical Data: Mining Contrast Sets (SDB, MJP), pp. 302–306.
KDDKDD-T-1999-KeimH #clustering #scalability
Clustering Techniques for Large Data Sets — from the Past to the Future (DAK, AH), pp. 141–181.
HPDCHPDC-1999-LeighJDBG #analysis #collaboration
A Methodology for Supporting Collaborative Exploratory Analysis of Massive Data Sets in Tele-Immersive Environments (JL, AEJ, TAD, SB, RLG), pp. 62–69.
FoSSaCSFoSSaCS-1999-DantsinV #algorithm #nondeterminism #polynomial #unification
A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees (ED, AV), pp. 180–196.
STOCSTOC-1999-GoelHPT #data transfer #network #problem #scheduling
Scheduling Data Transfers in a Network and the Set Scheduling Problem (AG, MRH, SAP, ÉT), pp. 189–197.
ICLPICLP-1999-CaseauJL #algorithm #named
CLAIRE: Combining Sets, Search, and Rules to Better Express Algorithms (YC, FXJ, FL), pp. 245–259.
ICLPICLP-1999-Lifschitz
Answer Set Planning (VL), pp. 23–37.
LICSLICS-1999-AtseriasK #finite #first-order #fixpoint #logic
First-Order Logic vs. Fixed-Point Logic in Finite Set Theory (AA, PGK), pp. 275–284.
LICSLICS-1999-NiehrenMT #constraints
Entailment of Atomic Set Constraints is PSPACE-Complete (JN, MM, JMT), pp. 285–294.
VLDBVLDB-1998-BraumandlCK #database #functional #object-oriented
Evaluating Functional Joins Along Nested Reference Sets in Object-Relational and Object-Oriented Databases (RB, JC, AK), pp. 110–122.
ICALPICALP-1998-Telle #constraints #independence
Independent Sets with Domination Constraints (MMH, JK, JAT), pp. 176–187.
CIAAWIA-1998-Augros #automaton #finite #infinity #word
Automata to Recognize Finite and Infinite Words with at Least Two Factorizations on a Given Finite Set (XA), pp. 220–225.
RTARTA-1998-CharatonikP #constraints
Co-definite Set Constraints (WC, AP), pp. 211–225.
RTARTA-1998-Genet #approximate #decidability #normalisation
Decidable Approximations of Sets of Descendants and Sets of Normal Forms (TG), pp. 151–165.
CSCWCSCW-1998-HouseBS #information management #trust
Cooperative Knowledge Work and Practices of Trust: Sharing Environmental Planning Data Sets (NAVH, MHB, LRS), pp. 335–343.
CIKMCIKM-1998-JacobsonKSS
Focusing Search in Hierarchical Structures with Directory Sets (GJ, BK, DS, DS), pp. 1–9.
ICMLICML-1998-Bay #classification #multi #nearest neighbour
Combining Nearest Neighbor Classifiers Through Multiple Feature Subsets (SDB), pp. 37–45.
ICMLICML-1998-FrankW #generative #optimisation
Generating Accurate Rule Sets Without Global Optimization (EF, IHW), pp. 144–151.
ICPRICPR-1998-BhattacharyaK #nearest neighbour
Reference set thinning for the k-nearest neighbor decision rule (BKB, DK), pp. 238–242.
ICPRICPR-1998-HerbstM
Building a representative training set based on eigenimages (BMH, NLM), pp. 1846–1848.
ICPRICPR-1998-HuberM #adaptation #named #parallel
ERC — evolutionary resample and combine for adaptive parallel training data set selection (RH, HAM), pp. 882–885.
ICPRICPR-1998-SuzukiKM #fuzzy #memory management #using
Associative memory system using fuzzy sets (YS, NK, JM), pp. 331–333.
ICPRICPR-1998-TakacsSW #3d #design #recognition
Optimal training set design for 3D object recognition (BT, LS, HW), pp. 558–560.
ICPRICPR-1998-YahiaB #segmentation
Segmentation of deformable templates with level sets characterized by particle systems (HMY, JPB), pp. 1421–1423.
KDDKDD-1998-JohnsonD
Comparing Massive High-Dimensional Data Sets (TJ, TD), pp. 229–233.
KRKR-1998-BrewkaE #logic programming #source code
Preferred Answer Sets for Extended Logic Programs (GB, TE), pp. 86–97.
SIGIRSIGIR-1998-LamH #automation #categorisation #using
Using a Generalized Instance Set for Automatic Text Categorization (WL, CYH), pp. 81–89.
PPDPALP-PLILP-1998-CodishS #analysis #logic
The Boolean Logic of Set Sharing Analysis (MC, HS), pp. 89–101.
PLDIPLDI-1998-AdveM #integer #optimisation #program analysis #using
Using Integer Sets for Data-Parallel Program Analysis and Optimization (VSA, JMMC), pp. 186–198.
REFSQREFSQ-1998-LamSJ #requirements
Managing Requirements Change: A Set of Good Practices (WL, VS, SJ), pp. 85–97.
SACSAC-1998-MachucaM #data mining #database #mining #precise #relational
Enhancing the exploitation of data mining in relational database systems via the rough sets theory including precision variables (FM, MM), pp. 70–73.
DATEDATE-1998-Nicoli #behaviour #semantics
Denotational Semantics of a Behavioral Subset of VHDL (FN), pp. 975–976.
ISMMISMM-1998-AzaguryKPY #how
Combining Card Marking with Remembered Sets: How to Save Scanning Time (AA, EKK, EP, ZY), pp. 10–19.
STOCSTOC-1998-HuangR #algebra #approach #black box #composition #problem
A Black Box Approach to the Algebraic Set Decomposition Problem (MDAH, AJR), pp. 497–506.
STOCSTOC-1998-Vorobjov #algebra
Computing Local Dimension of a Semialgebraic Set (NV), pp. 483–487.
ICLPJICSLP-1998-DevienneTT #constraints
Co-definite Set Constraints with Membership Expressions (PD, JMT, ST), pp. 25–39.
ICLPJICSLP-1998-DovierPRP #finite #on the #representation
On the Representation and Management of Finite Sets in CLP Languages (AD, CP, GR, EP), pp. 40–54.
TPDLECDL-1997-DartoisSSTMF #approach #documentation #encapsulation #multi #on the fly
Building a Multi-lingual Electronic Text Collection of Folk Tales as a Set of Encapsulated Document Objects: An Approach for Casual Users to Browse Multi-lingual Documents on the Fly (MD, AM, TF, TS, SS, KT), pp. 215–231.
PODSPODS-1997-GuchtDGV #algebra #database #decidability #on the
On the Decidability of Semi-Linearity of Semi-Algebraic Sets and Its Implications for Spatial Databases (FD, MG, LV, DVG), pp. 68–77.
VLDBVLDB-1997-HelmerM #algorithm #comparison #evaluation #in memory #memory management
Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates (SH, GM), pp. 386–395.
DLTDLT-1997-GecsegI #automaton #on the
On complete sets of tree automata (FG, BI), pp. 37–47.
ICALPICALP-1997-BouajjaniH #analysis #reachability
Symbolic Reachability Analysis of FIFO Channel Systems with Nonregular Sets of Configurations (AB, PH), pp. 560–570.
ICALPICALP-1997-BroersmaKKM #graph #independence
Independent Sets in Asteroidal Triple-Free Graphs (HB, TK, DK, HM), pp. 760–770.
ICALPICALP-1997-CartonP
The Wadge-Wagner Hierarchy of ω-Rational Sets (OC, DP), pp. 17–35.
ICALPICALP-1997-Weihrauch #metric #probability
Computability on the Probability Measures on the Borel Sets of the Unit Interval (KW), pp. 166–176.
CIAAWIA-1997-LescowV #automaton
Minimal Separating Sets for Muller Automata (HL, JV), pp. 109–121.
CIAAWIA-1997-Ziadi #automaton #clustering #problem #sorting
Sorting and Doubling Techniques for Set Partitioning and Automata Minimization Problems (DZ), pp. 241–251.
FMFME-1997-CazierD #2d #term rewriting
Term Rewrite Systems to Derive Set Boolean Operations on 2D Objects (DC, JFD), pp. 605–623.
ICFPICFP-1997-RichardST #using
Intensional Sets Using Explicit Substitutions (GR, FS, ATA), p. 318.
HCIHCI-SEC-1997-HolmquistA #approach #scalability #visualisation
Flip Zooming: A Practical Focus+Context Approach to Visualizing Large Data Sets (LEH, CA), pp. 763–766.
ICMLICML-1997-KubatM
Addressing the Curse of Imbalanced Training Sets: One-Sided Selection (MK, SM), pp. 179–186.
ICMLICML-1997-OatesJ #complexity
The Effects of Training Set Size on Decision Tree Complexity (TO, DJ), pp. 254–262.
KDDKDD-1997-EsterKSX #database #detection
Density-Connected Sets and their Application for Trend Detection in Spatial Databases (ME, HPK, JS, XX), pp. 10–15.
KDDKDD-1997-SmythW #data analysis
Anytime Exploratory Data Analysis for Massive Data Sets (PS, DW), pp. 54–60.
SIGIRSIGIR-1997-SilversteinP #clustering #corpus
Almost-Constant-Time Clustering of Arbitrary Corpus Subsets (CS, JOP), pp. 60–66.
AdaEuropeAdaEurope-1997-Feldman #ada
An Ada 95 Sort Race Construction Set (MBF), pp. 23–34.
PEPMPEPM-1997-MelskiR #constraints #context-free grammar #reachability
Interconveritibility of Set Constraints and Context-Free Language Reachability (DM, TWR), pp. 74–89.
SASSAS-1997-FahndrichA #constraints #program analysis #using
Program Analysis Using Mixed Term and Set Constraints (MF, AA), pp. 114–126.
DACDAC-1997-HadjiyiannisHD #named
ISDL: An Instruction Set Description Language for Retargetability (GH, SH, SD), pp. 299–302.
DACDAC-1997-SentovichTB #optimisation #performance #using
Efficient Latch Optimization Using Exclusive Sets (ES, HT, GB), pp. 8–11.
DATEEDTC-1997-Gonzalez-TorresMH
Full custom chip set for high speed serial communications up to 2.48 Gbit/s (JGT, PAM, JMH), p. 614.
SOSPSOSP-1997-Steere #latency #nondeterminism
Exploiting the Non-Determinism and Asynchrony of Set Iterators to Reduce Aggregate File I/O Latency (DCS), pp. 252–263.
STOCSTOC-1997-AuerLS #approximate #learning #pseudo
Approximating Hyper-Rectangles: Learning and Pseudo-Random Sets (PA, PML, AS), pp. 314–323.
STOCSTOC-1997-ColeH #pattern matching #random
Tree Pattern Matching and Subset Matching in Randomized O(n log3m) Time (RC, RH), pp. 66–75.
TAPSOFTTAPSOFT-1997-AmanissHL
Set Operations for Recurrent Term Schematizations (AA, MH, DL), pp. 333–344.
TAPSOFTTAPSOFT-1997-Caron #automaton #named
AG: A Set of Maple Packages for Symbolic Computing of Automata and Semigroups (PC), pp. 879–882.
TAPSOFTTAPSOFT-1997-MullerNP #constraints
Inclusion Constraints over Non-empty Sets of Trees (MM0, JN, AP), pp. 345–356.
CADECADE-1997-HasegawaIOK #bottom-up #proving #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.
ICLPICLP-1997-BuenoCL #analysis #logic programming #source code #using
Sharing Analysis Using Set Logic Programs (FB, MC, VL), p. 417.
ICLPICLP-1997-Liu #database #deduction #tuple
Supporting Partial and Complete Sets and Tuples in Deductive Databases (ML), p. 415.
ICLPILPS-1997-ZhangF #logic programming #source code
Answer Sets for Prioritized Logic Programs (YZ, NYF), pp. 69–83.
LICSLICS-1997-CharatonikP #constraints
Set Constraints with Intersection (WC, AP), pp. 362–372.
LICSLICS-1997-FiorePP #axiom
Complete Cuboidal Sets in Axiomatic Domain Theory (MPF, GDP, AJP), pp. 268–278.
HTHT-1996-Kendall #hypermedia
Hypertextual Dynamics in A Life Set for Two (RK), pp. 74–83.
VLDBVLDB-1996-Hammond #consistency #using
Using Referential Integrity To Easily Define Consistent Subset Replicas (BH), p. 591.
VLDBVLDB-1996-Padmanabhan #parallel #scalability #using
Extracting Large Data Sets using DB2 Parallel Edition (SP), p. 582.
ICALPICALP-1996-AndreevCR
Hitting Sets Derandomize BPP (AEA, AEFC, JDPR), pp. 357–368.
ICALPICALP-1996-ChengK #axiom #constraints
A Complete Gentzen-Style Axiomatization for Set Constraints (AC, DK), pp. 134–145.
ICALPICALP-1996-Lisovik #linear
Hard Sets Method and Semilinear Reservoir Method with Applications (LPL), pp. 219–231.
CIAAWIA-1996-JohnsonW
Instruction Computation in Subset Construction (JHJ, DW), pp. 64–71.
CIKMCIKM-1996-Greco #bound #unification
Optimal Unification of Bounded Simple Set Terms (SG), pp. 326–336.
ICPRICPR-1996-BhattacharyaCP #segmentation
An MLP-based texture segmentation technique which does not require a feature set (UB, BBC, SKP), pp. 805–809.
ICPRICPR-1996-Bobrowski #classification #learning
Piecewise-linear classifiers, formal neurons and separability of the learning sets (LB), pp. 224–228.
ICPRICPR-1996-DoeringW #classification #composition #cost analysis #network
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.
ICPRICPR-1996-DunkerHS #3d #estimation #prototype #recognition #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.
ICPRICPR-1996-Dzemyda #analysis #visual notation
Visual analysis of a set of function values (GD), pp. 700–704.
ICPRICPR-1996-Karasik #3d #commutative #on the #representation
On a planar representation of 3D figures commutative with respect to set and morphological operations (YBK), pp. 615–619.
ICPRICPR-1996-Matalas #approximate #image #multi
A new set of multiscale texture features based on B-spline image approximation (IM), pp. 810–814.
ICPRICPR-1996-Schikuta #clustering #named #performance #scalability
Grid-clustering: an efficient hierarchical clustering method for very large data sets (ES), pp. 101–105.
ICPRICPR-1996-StoddartH #multi
Registration of multiple point sets (AJS, AH), pp. 40–44.
ICPRICPR-1996-ZribiFG #3d #analysis #invariant
Set of invariant features for three-dimensional gray-level objects by harmonic analysis (MZ, HF, FG), pp. 549–553.
KDDKDD-1996-MannilaT96a #multi
Multiple Uses of Frequent Sets and Condensed Representations (HM, HT), pp. 189–194.
KDDKDD-1996-ShanZHC #classification #database #using
Discovering Classification Knowledge in Databases Using Rough Sets (NS, WZ, HJH, NC), pp. 271–274.
KDDKDD-1996-TsumotoT #automation #database
Automated Discovery of Medical Expert System Rules from Clinical Databases Based on Rough Sets (ST, HT), pp. 63–69.
ASEKBSE-1996-Darche #algorithm #automation #difference #generative
Set Differentiation: A Method for the Automatic Generation of Filtering Algorithms (FDD), p. 19.
SACSAC-1996-AbualiWS #algorithm #design #problem #search-based #using
Solving the subset interconnection design problem using genetic algorithms (FNA, RLW, DAS), pp. 299–304.
SACSAC-1996-LeeHHC #case study #how #implementation #performance #problem #process
Efficient implementations of two variant subset sum problems: a case study of how to process appraisal books resulting from fire-destroyed money (PL, FYH, CYH, HTC), pp. 230–237.
TAPSOFTTAPSOFT-J-1995-Kozen96 #constraints
Rational Spaces and Set Constraints (DK), pp. 73–94.
STOCSTOC-1996-Basu #algebra #bound #on the
On Bounding the Betti Numbers and Computing the Euler Characteristic of Semi-Algebraic Sets (SB), pp. 408–417.
STOCSTOC-1996-BasuPR #algebra
Computing Roadmaps of Semi-Algebraic Sets (SB, RP, MFR), pp. 168–173.
STOCSTOC-1996-Feige #approximate
A Threshold of ln n for Approximating Set Cover (UF), pp. 314–318.
STOCSTOC-1996-Slavik #algorithm #analysis
A Tight Analysis of the Greedy Algorithm for Set Cover (PS), pp. 435–441.
TACASTACAS-1996-BoualiRRS #tool support
The FC2TOOLS Set (AB, AR, VR, RdS), p. 396.
CADECADE-1996-Felty #calculus #proving
Proof Search with Set Variable Instantiation in the Calculus of Constructions (APF), pp. 658–672.
CAVCAV-1996-BoualiRRS #tool support
The FC2TOOLS Set (AB, AR, VR, RdS), pp. 441–445.
LICSLICS-1996-McAllesterGWK #constraints
Tarskian Set Constraints (DAM, RG, CW, DK), pp. 138–147.
ICDARICDAR-v1-1995-Crettez #product line #recognition
A set of handwriting families: style recognition (JPC), pp. 489–494.
ICDARICDAR-v1-1995-DasL #integration #recognition
Recognition of dimension sets and integration with vectorized engineering drawings (AKD, NAL), pp. 347–350.
ICDARICDAR-v2-1995-KimPK #online #personalisation #verification
Applying personalized weights to a feature set for on-line signature verification (SHK, MSP, JK), pp. 882–885.
PODSPODS-1995-AndriesCPB
Applying an Update Method to a Set of Receivers (MA, LC, JP, JVdB), pp. 208–218.
DLTDLT-1995-CurrieS
Cantor Sets and Dejean’s Conjecture (JDC, ROS), pp. 35–43.
ICALPICALP-1995-Chen #algorithm #string
NC Algorithms for Finding a Maximal Set of Paths with Application to Compressing Strings (ZZC), pp. 99–110.
ICALPICALP-1995-MetivierRW #word
Computing the Closure of Sets of Words Under Partial Commutations (YM, GR, PAW), pp. 75–86.
RTARTA-1995-Burghardt
Regular Substitution Sets: A Means of Controlling E-Unification (JB), pp. 382–396.
KDDKDD-1995-DeogunRS #approximate
Exploiting Upper Approximation in the Rough Set Methodology (JSD, VVR, HS), pp. 69–74.
KDDKDD-1995-HuC #database #learning #similarity
Rough Sets Similarity-Based Learning from Databases (XH, NC), pp. 162–167.
KDDKDD-1995-KohaviS #using
Feature Subset Selection Using the Wrapper Method: Overfitting and Dynamic Search Space Topology (RK, DS), pp. 192–197.
KDDKDD-1995-ShanZHC #information management #tool support #using
Using Rough Sets as Tools for Knowledge Discovery (NS, WZ, HJH, NC), pp. 263–268.
KDDKDD-1995-SkowronS #approach #concurrent #modelling
Discovery of Concurrent Data Models from Experimental Tables: A Rough Set Approach (AS, ZS), pp. 288–293.
KDDKDD-1995-TsumotoT95a #automation #component #functional #representation #sequence
Automated Discovery of Functional Components of Proteins from Amino-Acid Sequences Based on Rough Sets and Change of Representation (ST, HT), pp. 318–324.
PPDPPLILP-1995-Arenas-SanchezD #unification
Minimal Set Unification (PAS, AD), pp. 397–414.
ESECESEC-1995-ZellerS #logic
Handling Version Sets Through Feature Logic (AZ, GS), pp. 191–204.
SACSAC-1995-BaudinoCMS
Processing sets on a SIMD machine (AB, GC, GM, GS), pp. 593–598.
SACSAC-1995-Li #algorithm #optimisation #performance
An efficient algorithm for computing a minimum node cutset from a vertex-disjoint path set for timing optimization (WNL), pp. 56–60.
SACSAC-1995-RunklerG #algorithm #multi #performance
Multidimensional defuzzification — fast algorithms for the determination of crisp characteristic subsets (TAR, MG), pp. 575–579.
DACDAC-1995-ChangMC #algorithm #performance
An Efficient Algorithm for Local Don’t Care Sets Calculation (SCC, MMS, KTC), pp. 663–667.
DACDAC-1995-ShenHC #composition
Lambda Set Selection in Roth-Karp Decomposition for LUT-Based FPGA Technology Mapping (WZS, JDH, SMC), pp. 65–69.
PDPPDP-1995-Chamski
Enumeration of dense non-convex iteration sets (ZC), pp. 156–163.
TAPSOFTTAPSOFT-1995-Kozen #constraints
Rational Spaces and Set Constraints (DK), pp. 42–61.
ICLPILPS-1995-Liu #datalog #named #tuple
Relationlog: A Typed Extension to Datalog with Sets and Tuples (ML), pp. 83–97.
PODSPODS-1994-LibkinW
New Techniques for Studying Set Languages, Bag Languages and Aggregate Functions (LL, LW), pp. 155–166.
PODSPODS-1994-SuciuP #algebra #algorithm #exponential #transitive
Any Algorithm in the Complex Object Algebra with Powerset Needs Exponential Space to Compute Transitive Closure (DS, JP), pp. 201–209.
VLDBVLDB-1994-KilgerM #multi
Indexing Multiple Sets (CK, GM), pp. 180–191.
ICALPICALP-1994-Pin #polynomial
Polynomial Closure of Group Languages and Open Sets of the Hall Topology (JÉP), pp. 424–435.
ICGTTAGT-1994-CourcelleS #graph
The Obstructions of a Minor-Closed Set of Graphs Defined by Hyperedge Replacement can be Constructed (BC, GS), pp. 351–367.
CHICHI-1994-GoldsteinR94a #query #scalability #using
Using aggregation and dynamic queries for exploring large data sets (JG, SFR), pp. 23–29.
CIKMCIKM-1994-HuC #approach #database #relational
Discovery of Decision Rules in Relational Databases: A Rough Set Approach (XH, NC), pp. 392–400.
CIKMCIKM-1994-KlemettinenMRTV #scalability
Finding Interesting Rules from Large Sets of Discovered Association Rules (MK, HM, PR, HT, AIV), pp. 401–407.
ICMLICML-1994-AhaLLM #learning #recursion
Learning Recursive Relations with Randomly Selected Small Training Sets (DWA, SL, CXL, SM), pp. 12–18.
ICMLICML-1994-JohnKP #problem
Irrelevant Features and the Subset Selection Problem (GHJ, RK, KP), pp. 121–129.
KDDKDD-1994-MonkMSH #comparison #geometry
Geometric Comparison of Clarifications and Rule Sets (TJM, RSM, LAS, GH), pp. 395–406.
SACSAC-1994-Bloch #fuzzy #image
Fuzzy sets in image processing (IB), pp. 175–179.
DACDAC-1994-AsharM #low cost
Implicit Computation of Minimum-Cost Feedback-Vertex Sets for Partial Scan and Other Applications (PA, SM), pp. 77–80.
DACDAC-1994-HuangD #pipes and filters #synthesis
Synthesis of Instruction Sets for Pipelined Microprocessors (IJH, AMD), pp. 5–11.
DACDAC-1994-KrishnakumarC #hybrid #modelling #on the
On the Computation of the Set of Reachable States of Hybrid Models (ASK, KTC), pp. 615–621.
DACDAC-1994-Minato #algebra #using
Calculation of Unate Cube Set Algebra Using Zero-Suppressed BDDs (SiM), pp. 420–424.
PDPPDP-1994-RodohanGJ #implementation #prolog
An Implementation Of A Set Mode For Prolog On A Parallell Associative Processor (DPR, RJG, IPJ), pp. 413–419.
STOCSTOC-1994-DinitzV #graph #incremental #maintenance
The connectivity carcass of a vertex subset in a graph and its incremental maintenance (YD, AV), pp. 716–725.
STOCSTOC-1994-HalldorssonR #approximate #bound #graph #independence
Greed is good: approximating independent sets in sparse and bounded-degree graphs (MMH, JR), pp. 439–448.
CAVCAV-1994-BoigelotW #verification
Symbolic Verification with Periodic Sets (BB, PW), pp. 55–67.
ICLPICLP-1994-BruscoliDPR #compilation
Compiling Intensional Sets in CLP (PB, AD, EP, GR), pp. 647–661.
ICLPICLP-1994-BurgLH #backtracking
Finding Conflict Sets and Backtrack Points in CLP(R) (JB, SDL, CEH), pp. 323–338.
ICLPICLP-1994-Gervet #constraints #finite #named
Conjunto: Constraint Propagation over Set Constraints with Finite Set Domain Variables (CG), p. 733.
ICLPILPS-1994-FileR #abstract interpretation
Improving Abstract Interpretations by Systematic Lifting to the Powerset (GF, FR), pp. 655–669.
ICLPILPS-1994-Gervet #constraints #finite #logic programming #named
Conjunto: Constraint Logic Programming with Finite Set Domains (CG), pp. 339–358.
LICSLICS-1994-CharatonikP #constraints #similarity
Negative Set Constraints with Equality (WC, LP), pp. 128–136.
LICSLICS-1994-Stefansson #constraints
Systems of Set Constraints with Negative Constraints are NEXPTIME-Complete (KS), pp. 137–141.
ICDARICDAR-1993-CaesarGM93a #adaptation #classification #scalability
Utilization of large disordered sample sets for classifier adaptation in complex domains (TC, JMG, EM), pp. 790–793.
ICDARICDAR-1993-LaiK #detection
Detection of dimension sets in engineering drawings (CPL, RK), pp. 606–613.
ICDARICDAR-1993-Pflug #n-gram #recognition #using
Using n-grams for the definition of a training set for cursive handwriting recognition (VP), pp. 295–298.
SIGMODSIGMOD-1993-AgrawalIS #database #mining #scalability
Mining Association Rules between Sets of Items in Large Databases (RA, TI, ANS), pp. 207–216.
SIGMODSIGMOD-1993-IshikawaKO #evaluation
Evaluation of Signature Files as Set Access Facilities in OODBs (YI, HK, NO), pp. 247–256.
VLDBVLDB-1993-SeegerLM
Reading a Set of Disk Pages (BS, PÅL, RM), pp. 592–603.
ICALPICALP-1993-GargVY #algorithm #approximate #multi
Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover (NG, VVV, MY), pp. 64–75.
HCIHCI-ACS-1993-HollywellH #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.
ECOOPECOOP-1993-BalstersBZ #database #object-oriented
Typed Sets as a Basis for Object-Oriented Database Schemas (HB, RAdB, RZ), pp. 161–184.
PPDPPLILP-1993-DovierP #implementation #logic
A WAM-Based Implementation of a Logical Language with Sets (AD, EP), pp. 275–290.
SACSAC-1993-Kim #problem #program transformation
Program Transformation for the Longest Upsequence Set Problem (HK), pp. 609–613.
SACSAC-1993-LiuM
Dynamic Sets and Their Application in VDM (SL, JAM), pp. 187–192.
SACSAC-1993-Sen #low cost #probability #using
Minimal Cost Set Covering Using Probabilistic Methods (SS), pp. 157–164.
DACDAC-1993-CloutierT #pipes and filters #synthesis
Synthesis of Pipelined Instruction Set Processors (RJC, DET), pp. 583–588.
DACDAC-1993-Minato #combinator #problem
Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems (SiM), pp. 272–277.
PDPPDP-1993-StuartW #algorithm #array #matrix #parallel #scalability #symmetry #using
An algorithm far the parallel computation of subsets of eigenvalues and associated eigenvectors of large symmetric matrices using an array processor (EJS, JSW), pp. 211–217.
PPoPPPPoPP-1993-ChatterjeeGLST #communication #generative #source code
Generating Local Address and Communication Sets for Data-Parallel Programs (SC, JRG, FJEL, RS, SHT), pp. 149–158.
STOCSTOC-1993-ChazelleEGGSW #bound
Improved bounds on weak epsilon-nets for convex sets (BC, HE, MG, LJG, MS, EW), pp. 495–504.
STOCSTOC-1993-FelsnerW #algorithm #combinator
Maximum k-chains in planar point sets: combinatorial structure and algorithms (SF, LW), pp. 146–153.
STOCSTOC-1993-LinialLSZ #combinator #performance
Efficient construction of a small hitting set for combinatorial rectangles in high dimension (NL, ML, MES, DZ), pp. 258–267.
TAPSOFTTAPSOFT-1993-NiehrenP #automaton
Feature Automata and Recognizable Sets of Feature Trees (JN, AP), pp. 356–375.
CAVCAV-1993-Valmari #on the fly #verification
On-the-Fly Verification with Stubborn Sets (AV), pp. 397–408.
CSLCSL-1993-AikenKVW #complexity #constraints
The Complexity of Set Constraints (AA, DK, MYV, ELW), pp. 1–17.
CSLCSL-1993-Kozen #aspect-oriented #constraints #logic
Logical Aspects of Set Constraints (DK), pp. 175–188.
CSLCSL-1993-Marcinkowski #decidability #horn clause
A Horn Clause that Implies and Undecidable Set of Horn Clauses (JM), pp. 223–237.
ICLPILPS-1993-Aparicio #semantics
Assumption Set Semantics (JNA), p. 639.
ICLPILPS-1993-DovierR #finite
Embedding extensional finite sets in CLP (AD, GR), pp. 540–556.
ICLPILPS-1993-OsorioJ
Subset Assertions and Negation As Failure (MO, BJ), p. 637.
VLDBVLDB-1992-ParkerSV #named #parallel
SVP: A Model Capturing Sets, Lists, Streams, and Parallelism (DSPJ, ES, PV), pp. 115–126.
ICALPICALP-1992-ArvindHHKLMOSST #reduction
Reductions to Sets of Low Information Content (VA, YH, LAH, JK, AL, MM, MO, US, RS, TT), pp. 162–173.
ICALPICALP-1992-Shallit #linear
Numeration Systems, Linear Recurrences, and Regular Sets (JS), pp. 89–100.
CHICHI-1992-RotellaBW #user interface
The AT&T Display Construction Set User Interface Management System (UIMS) (JPR, ALB, CAW), pp. 73–74.
KRKR-1992-LifschitzW #reasoning
Answer Sets in General Nonmonotonic Reasoning (VL, TYCW), pp. 603–614.
KRKR-1992-Rymon
Search through Systematic Set Enumeration (RR), pp. 539–550.
TOOLSTOOLS-EUROPE-1992-BreuningA #user interface #visual notation
Hierarchic Views — a Construction Set for Complex Graphical User Interfaces (RB, WA), pp. 325–332.
AdaEuropeAdaEurope-1992-Mangold #ada #multi #named
AMPATS — A Multi Processor Ada Tool Set (KM), pp. 300–311.
AdaEuropeAdaEurope-1992-Treurniet #assessment #interface #tool support
SWG APSE Test Support Toolset (Assessment of the CAIS-A Interface Set) (WT), pp. 214–229.
DACDAC-1992-ChenF #algorithm #logic #optimisation #performance
Efficient Sum-to-One Subsets Algorithm for Logic Optimization (KCC, MF), pp. 443–448.
DACDAC-1992-HuangD #compilation #pipes and filters #synthesis
High Level Synthesis of Pipelined Instruction Set Processors and Back-End Compilers (IJH, AMD), pp. 135–140.
STOCSTOC-1992-Kelsen #complexity #independence #on the #parallel
On the Parallel Complexity of Computing a Maximal Independent Set in a Hypergraph (PK), pp. 339–350.
STOCSTOC-1992-SimonS #complexity #on the #ram
On the Complexity of RAM with Various Operation Sets (JS, MS), pp. 624–631.
CADECADE-1992-Sutcliffe #analysis
Linear-Input Subset Analysis (GS), pp. 268–280.
CADECADE-1992-Uribe #constraints #unification #using
Sorted Unification Using Set Constraints (TEU), pp. 163–177.
CADECADE-1992-ZhangH #induction #proving #theorem
Proving the Chinese Remainder Theorem by the Cover Set Induction (HZ, XH), pp. 431–445.
ICLPJICSLP-1992-Heintze #analysis #aspect-oriented
Practical Aspects of Set Based Analysis (NH), pp. 765–779.
LICSLICS-1992-AikenW #constraints
Solving Systems of Set Constraints (AA, ELW), pp. 329–340.
LICSLICS-1992-KapurN #complexity
Double-exponential Complexity of Computing a Complete Set of AC-Unifiers (DK, PN), pp. 11–21.
LICSLICS-1992-Klarlund #automaton #metric
Progress Measures, Immediate Determinacy, and a Subset Construction for Tree Automata (NK), pp. 382–393.
HTHT-1991-Parunak #hypermedia #reasoning #taxonomy
Don’t Link Me In: Set Based Hypermedia for Taxonomic Reasoning (HVDP), pp. 233–242.
PODSPODS-1991-ImmermanPS #finite #product line
The Expressiveness of a Family of Finite Set Languages (NI, SP, DWS), pp. 37–52.
PODSPODS-1991-Vadaparty #on the #power of #rule-based
On the Power of Rule-Based Languages with Sets (KVV), pp. 26–36.
ICALPICALP-1991-Dershowitz #horn clause
Cononical Sets of Horn Clauses (ND), pp. 267–278.
ICALPICALP-1991-TannenS #aspect-oriented #logic #programming
Logical and Computational Aspects of Programming with Sets/Bags/Lists (VT, RS), pp. 60–75.
FMVDME-1991-Blaue #compilation
A VDM Subset Compiler (CB), pp. 697–698.
FMVDME-1991-LarsenL #execution #specification
An Executable Subset of Meta-IV with Loose Specification (PGL, PBL), pp. 604–618.
ICMLML-1991-Kadie91a #concept #learning
Continous Conceptual Set Covering: Learning Robot Operators From Examples (CMK), pp. 615–619.
ICMLML-1991-Pierce #learning
Learning a Set of Primitive Actions with an Uninterpreted Sensorimotor Apparatus (DRP), pp. 338–342.
SIGIRSIGIR-1991-BooksteinK #correlation
Compression of a Set of Correlated Bitmaps (AB, STK), pp. 63–71.
ASPLOSASPLOS-1991-CmelikKDK #analysis #benchmark #metric #specification
An Analysis of SPARC and MIPS Instruction Set Utilization on the SPEC Benchmarks (RFC, SIK, DRD, EJK), pp. 290–302.
CSLCSL-1991-Fernando #bisimulation #complexity #logic #recursion
A Primitive Recursive Set Theory and AFA: On the Logical Complexity of the Largest Bisimulation (TF), pp. 96–110.
ICLPICLP-1991-ChenW #abstraction #logic #multi
An Intensional Logic of (Multi-Arity) Set Abstractions (WC, DSW), pp. 97–110.
ICLPICLP-1991-DovierOPR #finite #logic programming #programming language
{log}: A Logic Programming Language with Finite Sets (AD, EGO, EP, GR), pp. 111–124.
ICLPICLP-1991-Reintjes #design #tool support
A Set of Tools for VHDL Design (PBR), pp. 549–562.
ICLPISLP-1991-KempSS #bottom-up #evaluation #modelling
Magic Sets and Bottom-Up Evaluation of Well-Founded Models (DBK, DS, PJS), pp. 337–351.
PODSPODS-1990-Ross #composition #datalog #source code
Modular Stratification and Magic Sets for DATALOG Programs with Negation (KAR), pp. 161–171.
VLDBVLDB-1990-HoutsmaAC #approach #distributed #transitive
Distributed Transitive Closure Computations: The Disconnection Set Approach (MAWH, PMGA, SC), pp. 335–346.
ICALPICALP-1990-Pelletier #ambiguity
Boolean Closure and Unambiguity of Rational Sets (MP), pp. 512–525.
ICMLML-1990-Kadie #algorithm #concept
Conceptual Set Covering: Improving Fit-And-Split Algorithms (CMK), pp. 40–48.
SEKESEKE-1990-JeffreyM #petri net
A High-Level Petri Net for a Subset of FGHC (JJ, TM), pp. 260–266.
SIGIRSIGIR-1990-Burkowski #retrieval
Surrogate Subsets: A Free Space Management Strategy for the Index of a Text Retrieval System (FJB), pp. 211–226.
ESOPESOP-1990-Heckmann
Set Domains (RH), pp. 177–196.
STOCSTOC-1990-OgiwaraW #bound #on the #polynomial
On Polynomial Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets (MO, OW), pp. 457–467.
STOCSTOC-1990-SundarT #sequence
Unique Binary Search Tree Representations and Equality-testing of Sets and Sequences (RS, RET), pp. 18–25.
CADECADE-1990-Hines #proving
Str+ve-Subset: The Str+ve-based Subset Prover (LMH), pp. 193–206.
CADECADE-1990-Lescanne #implementation #named
ORME: An Implementation of Completion Procedures as Sets of Transition Rules (PL), pp. 661–662.
CADECADE-1990-McMichael #automation #named
SLIM: An Automated Reasoner For Equivalences, Applied To Set Theory (AFM), pp. 308–321.
CADECADE-1990-Peterson #constraints #reduction
Complete Sets of Reductions with Constraints (GEP), pp. 381–395.
CADECADE-1990-Schwind #decidability #logic #proving #theorem proving
A Tableau-Based Theorem Prover for a Decidable Subset of Default Logic (CS), pp. 528–542.
CSLCSL-1990-CantoneCS #problem
Decision Problems for Tarski and Presburger Arithmetics Extended With Sets (DC, VC, JTS), pp. 95–109.
CSLCSL-1990-Fermuller
A Resolution Variant Deciding some Classes of Clause Sets (CGF), pp. 128–144.
LICSLICS-1990-Courcelle #graph #higher-order #monad #on the
On the Expression of Monadic Second-Order Graph Properties Without Quantifications Over Sets of Edges (BC), pp. 190–196.
LICSLICS-1990-HeintzeJ #constraints
A Decision Procedure for a Class of Set Constraints (NH, JJ), pp. 42–51.
LICSLICS-1990-RobinsonR #call-by #morphism #polymorphism
Polymorphism, Set Theory, and Call-by-Value (ER, GR), pp. 12–18.
PODSPODS-1989-HullS #query
Untyped Sets, Invention, and Computable Queries (RH, JS), pp. 347–359.
RTARTA-1989-BairdPW #commutative #reduction
Complete Sets of Reductions Modulo Associativity, Commutativity and Identity (TBB, GEP, RWW), pp. 29–44.
RTARTA-1989-DarlingtonG #abstraction #evaluation #functional #programming #unification
Narrowing and Unification in Functional Programming — An Evaluation Mechanism for Absolute Set Abstraction (JD, YG), pp. 92–108.
RTARTA-1989-Snyder #algorithm #equation #generative #performance
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.
FPCAFPCA-1989-Hunt #abstract interpretation
Frontiers and Open Sets in Abstract Interpretation (SH), pp. 1–13.
FPCAFPCA-1989-SilbermannJ #abstraction #functional #logic programming
Set Abstraction in Functional and Logic Programming (FSKS, BJ), pp. 313–326.
CAiSECAiSE-1989-Kansala #automation #experience #tool support
Loosely Integrated Sets of CASE tools: Our Experience (KK).
KRKR-1989-Zadrozny #order
Cardinalities and Well Orderings in a Common-Sense Set Theory (WZ), pp. 486–497.
ICMLML-1989-GoodmanS #algorithm #induction #probability
The Induction of Probabilistic Rule Sets — The Itrule Algorithm (RMG, PS), pp. 129–132.
SEKESEKE-1989-HanHZ #compilation
Derivation of Magic Sets by Compilation (JH, LJH, NZ), pp. 164–171.
OOPSLAOOPSLA-1989-TomlinsonS #inheritance
Inheritance and Synchronization with Enabled Sets (CT, VS), pp. 103–112.
ASPLOSASPLOS-1989-AdamsZ #analysis #source code
An Analysis of 8086 Instruction Set Usage in MS DOS Programs (TLA, REZ), pp. 152–160.
DACDAC-1989-WangKL #approach #fault #logic #robust
A New Approach to Derive Robust Sets for Stuck-open Faults in CMOS Combinational Logic Circuits (JFW, TYK, JYL), pp. 726–729.
CSLCSL-1989-Ambos-SpiesY #polynomial #recursion
Honest Polynomial-Time Degrees of Elementary Recursive Sets (KAS, DY), pp. 1–15.
CSLCSL-1989-SpeckenmeyerK #clustering #complexity #on the
On the Average Time Complexity of Set Partitioning (ES, RK), pp. 369–381.
LICSLICS-1989-Fernando #on the #recursion
On Substitutional Recursion Over Non-Well-Founded Sets (RTPF), pp. 273–282.
LICSLICS-1989-Lubarsky #integer
μ-Definable Sets of Integers (RSL), pp. 343–352.
LICSLICS-1989-MisloveMO #fixpoint
Non-Well-Founded Sets Obtained from Ideal Fixed Points (MWM, LSM, FJO), pp. 263–272.
ICLPNACLP-1989-JayaramanP #equation #programming
Programming with Equations, Subsets, and Relations (BJ, DAP), pp. 1051–1068.
PODSPODS-1988-GelderRS #logic programming #semantics #source code
Unfounded Sets and Well-Founded Semantics for General Logic Programs (AVG, KAR, JSS), pp. 221–230.
PODSPODS-1988-HuangL #multi
Stable Set and Multiset Operations in Optimal Time and Space (BCH, MAL), pp. 288–293.
PODSPODS-1988-Kuper #logic programming #on the #power of #programming language
On the Expressive Power of Logic Programming Languages with Sets (GMK), pp. 10–14.
PODSPODS-1988-LaninS #concurrent
Concurrent Set Manipulation without Locking (VL, DS), pp. 211–220.
PODSPODS-1988-ShmueliTZ #logic
Rewriting of Rules Containing Set Terms in a Logic Data Model (LDL) (OS, ST, CZ), pp. 15–28.
SIGMODSIGMOD-1988-GyssensG #algebra #programming #relational
The Powerset Algebra as a Result of Adding Programming Constructs to the Nested Relational Algebra (MG, DVG), pp. 225–232.
ICALPICALP-1988-TangB #polynomial #reduction
Separating Polynomial-Time Turing and Truth-Table Reductions by Tally Sets (ST, RVB), pp. 591–599.
SIGIRSIGIR-1988-Bookstein #retrieval
Set Oriented Retrieval (AB), pp. 583–596.
SIGIRSIGIR-1988-BoscG #flexibility #framework #fuzzy
Flexible Selection among Objects: A Framework Based on Fuzzy Sets (PB, MG), pp. 433–449.
SIGIRSIGIR-1988-Das-Gupta #information retrieval
Rough Sets and Information Retrieval (PDG), pp. 567–581.
PPDPALP-1988-FulopV #automaton #linear #term rewriting
A Characterization of Irreducible Sets Modulo Left-Linear Term Rewriting Systems by Tree Automata (ZF, SV), p. 157.
DACDAC-1988-HenkelG #layout #named #verification
RISCE — A Reduced Instruction Set Circuit Extractor for Hierarchical VLSI Layout Verification (VH, UG), pp. 465–470.
STOCSTOC-1988-FraysseixPP #graph
Small Sets Supporting Fáry Embeddings of Planar Graphs (HdF, JP, RP), pp. 426–433.
STOCSTOC-1988-LoeblN #problem
Linearity and Unprovability of Set Union Problem Strategies (ML, JN), pp. 360–366.
CADECADE-1988-GallierNPRS #canonical #equation #finite #polynomial #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.
ICLPJICSCP-1988-Subrahmanian88 #semantics
Intuitive Semantics for Quantitative Rule Sets (VSS), pp. 1036–1053.
LICSLICS-1988-SalvesenS #type system
The Strength of the Subset Type in Martin-Löf’s Type Theory (AS, JMS), pp. 384–391.
PODSPODS-1987-BeeriNRST #database #logic
Sets and Negation in a Logic Database Language (LDL1) (CB, SAN, RR, OS, ST), pp. 21–37.
PODSPODS-1987-GrahneSS #evaluation #performance #query #recursion
Efficient Evaluation for a Subset of Recursive Queries (GG, SS, ESS), pp. 284–293.
PODSPODS-1987-Kuper #logic programming
Logic Programming With Sets (GMK), pp. 11–20.
SIGMODSIGMOD-1987-AbiteboulKG #on the #query #representation
On the Representation and Querying of Sets of Possible Worlds (SA, PCK, GG), pp. 34–48.
RTARTA-1987-Kirchner #infinity #process
Schematization of Infinite Sets of Rewrite Rules. Application to the Divergence of Completion Processes (HK), pp. 180–191.
FPCAFPCA-1987-JayaramanP #functional #programming
Functional programming with sets (BJ, DAP), pp. 194–211.
POPLPOPL-1987-NeirynckPD #alias
Computation of Aliases and Support Sets (AN, PP, AJD), pp. 274–283.
ESECESEC-1987-Tempel #design #tool support
A Set of Tools supporting the Software Design Based on SDL (HGT), pp. 348–356.
ASPLOSASPLOS-1987-DavidsonV #complexity #memory management #performance
The Effect of Instruction Set Complexity on Program Size and Memory Performance (JWD, RAV), pp. 60–64.
CSLCSL-1987-BohmP #combinator #finite #reduction
Surjectivity for Finite Sets of Combinators by Weak Reduction (CB, AP), pp. 27–43.
ICLPICLP-1987-Kunen87
Answer Sets and Negation-as-Failure (KK), pp. 219–228.
ICLPICLP-1987-ShmueliN87 #horn clause #source code
Set Grouping and Layering in Horn Clause Programs (OS, SAN), pp. 152–177.
ICLPSLP-1987-KimuraC87
An Abstract KL1 Machine and Its Instruction Set (YK, TC), pp. 468–477.
PODSPODS-1986-BancilhonMSU #logic programming #source code
Magic Sets and Other Strange Ways to Implement Logic Programs (FB, DM, YS, JDU), pp. 1–15.
ICALPICALP-1986-Felice #finite #graph
Finite Biprefix Sets of Path in a Graph (CdF), pp. 89–94.
ICALPICALP-1986-HartmanisLY #complexity
Containment, Separation, Complete Sets, and Immunity of Complexity Classes (JH, ML, YY), pp. 136–145.
ICALPICALP-1986-MannilaU #backtracking #problem
The Set Union Problem with Backtracking (HM, EU), pp. 236–243.
ICALPICALP-1986-Metivier #commutative #monad #on the
On Recognizable Subsets of Free Partially Commutative Monoids (YM), pp. 254–264.
LISPLFP-1986-JayaramanS #equation #functional #logic programming #reduction #semantics
Equations, Sets, and Reduction Semantics for Functional and Logic Programming (BJ, FSKS), pp. 320–331.
ICGTGG-1986-Courcelle86a #graph #higher-order #monad #on the
On context-free sets of graphs and their monadic second-order theory (BC), pp. 133–146.
ICGTGG-1986-Nagl #graph grammar
Set theoretic approaches to graph grammars (MN), pp. 41–54.
CADECADE-1986-Buttner #data type #unification
Unification in the Data Structure Sets (WB), pp. 470–488.
CADECADE-1986-KapurN #problem #unification
NP-Completeness of the Set Unification and Matching Problems (DK, PN), pp. 489–495.
CADECADE-1986-Tiden #unification
Unification in Combinations of Collapse-Free Theories with Disjoint Sets of Function Symbols (ET), pp. 431–449.
ICLPICLP-1986-Levy86 #automaton #haskell
A GHC Abstract Machine and Instruction Set (JL), pp. 157–171.
ICALPICALP-1985-BeauquierN #word
About Rational Sets of Factors of a Bi-Infinite Word (DB, MN), pp. 33–42.
ICALPICALP-1985-Cole #clustering
Partitioning Point Sets in 4 Dimensions (RC0), pp. 111–119.
ICALPICALP-1985-KurtzM #algorithm #analysis #distributed #probability
A Probabilistic Distributed Algorithm for Set Intersection and Its Analysis (TGK, UM), pp. 356–362.
ICALPICALP-1985-Stirling #composition #proving
A Complete Compositional Model Proof System for a Subset of CCS (CS), pp. 475–486.
RTARTA-1985-DetlefsF #automation #proving #termination
A Procedure for Automatically Proving the Termination of a Set of Rewrite Rules (DD, RF), pp. 255–270.
RTARTA-1985-Zaionc #regular expression #λ-calculus
The Set of Unifiers in Typed λ-Calculus as Regular Expression (MZ), pp. 430–440.
ICSEICSE-1985-BasiliS #metric #using
Calculation and Use of an Environment’s Characteristic Software Metric Set (VRB, RWS), pp. 386–393.
TAPSOFTCAAP-1985-Sterling #proving
A Complete Modal Proof System for a Subset of SCCS (CS), pp. 253–266.
STOCSTOC-1985-BollobasS #algorithm #behaviour #on the
On the Expected Behaviour of Disjoint Set Union Algorithms (BB, IS), pp. 224–231.
STOCSTOC-1985-Luby #algorithm #independence #parallel #problem
A Simple Parallel Algorithm for the Maximal Independent Set Problem (ML), pp. 1–10.
ICALPICALP-1984-Ambos-Spies
P-Generic Sets (KAS), pp. 58–68.
ICALPICALP-1984-BlumerBEHM #automaton #linear #online #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.
LISPLFP-1984-WholeyF #design #lisp
The Design of an Instruction Set for Common Lisp (SW, SEF), pp. 150–158.
POPLPOPL-1984-JouannaudK #equation
Completion of a Set of Rules Modulo a Set of Equations (JPJ, HK), pp. 83–92.
STOCSTOC-1984-BlumerBEHM #linear
Building a Complete Inverted File for a Set of Text Files in Linear Time (AB, JB, AE, DH, RMM), pp. 349–358.
STOCSTOC-1984-FranzblauK #algorithm #generative #independence
An Algorithm for Constructing Regions with Rectangles: Independence and Minimum Generating Sets for Collections of Intervals (DSF, DJK), pp. 167–174.
STOCSTOC-1984-KarpW #algorithm #independence #parallel #performance #problem
A Fast Parallel Algorithm for the Maximal Independent Set Problem (RMK, AW), pp. 266–272.
CADECADE-1984-JouannaudM #equation #termination
Termination of a Set of Rules Modulo a Set of Equations (JPJ, MM), pp. 175–193.
ICLPSLP-1984-Nakagawa84 #parallel #prolog
AND Parallel PROLOG with Divided Assertion Set (HN), pp. 22–28.
PODSPODS-1983-GinsburgH #relational
Sort Sets in the Relational Model (SG, RH), pp. 332–339.
ICALPICALP-1983-EdelsbrunnerW #on the
On the Number of Equal-Sized Semispaces of a Set of Points in the Plane (HE, EW), pp. 182–187.
ICALPICALP-1983-HartmanisHY
Computation Times of NP Sets of Different Densities (JH, YY), pp. 319–330.
STOCSTOC-1983-GabowT #algorithm #linear
A Linear-Time Algorithm for a Special Case of Disjoint Set Union (HNG, RET), pp. 246–251.
STOCSTOC-1983-HartmanisSI
Sparse Sets in NP-P: EXPTIME versus NEXPTIME (JH, VS, NI), pp. 382–391.
STOCSTOC-1983-Sipser #complexity
Borel Sets and Circuit Complexity (MS), pp. 61–69.
STOCSTOC-1983-Young #polynomial
Some Structural Properties of Polynomial Reducibilities and Sets in NP (PY), pp. 392–401.
VLDBVLDB-1982-SaccoS #database #relational #using
A Mechanism for Managing the Buffer Pool in a Relational Database System Using the Hot Set Model (GMS, MS), pp. 257–262.
ICALPICALP-1982-HarelK #induction #programming language
A Programming Language for the Inductive Sets, and Applications (DH, DK), pp. 313–329.
ICALPICALP-1982-Sipser #on the
On Relativization and the Existence of Complete Sets (MS), pp. 523–531.
ASPLOSASPLOS-1982-McDaniel #analysis #using
An Analysis of a Mesa Instruction Set Using Dynamic Instruction Frequencies (GM), pp. 167–176.
ASPLOSASPLOS-1982-SweetS #analysis #empirical
Empirical Analysis of the Mesa Instruction Set (RES, JGSJ), pp. 158–166.
ASPLOSASPLOS-1982-Wiecek #case study #compilation #execution
A Case Study of VAX-11 Instruction Set Usage for Compiler Execution (CAW), pp. 177–184.
DACDAC-1981-SakauyeLRETSABW #design #source code
A set of programs for MOS design (GS, AL, JR, RE, JT, ESYS, EA, FB, PSW), pp. 435–442.
ICALPICALP-1980-FredericksonJ #generative #network
Generating and Searching Sets Induced by Networks (GNF, DBJ), pp. 221–233.
ICALPICALP-1980-Huynh #complexity #linear
The Complexity of Semilinear Sets (TDH), pp. 324–337.
POPLPOPL-1980-KapurM #abstraction
Expressiveness of the Operation Set of a Data Abstraction (DK, MKS), pp. 139–153.
POPLPOPL-1980-Kfoury #analysis #source code
Analysis of Simple Programs Over Different Sets of Primitives (AJK), pp. 56–61.
STOCSTOC-1980-GuibasY #on the
On Translating a Set of Rectangles (LJG, FFY), pp. 154–160.
CADECADE-1980-FerroOS
Decision Procedures for Some Fragments of Set Theory (AF, EGO, JTS), pp. 88–96.
ICALPICALP-1979-BookB #complexity #representation #similarity
Representing Complexity Classes by Equality Sets (RVB, FJB), pp. 49–57.
ICALPICALP-1979-Selman #behaviour #polynomial
P-Selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP (ALS), pp. 546–555.
PLDISCC-1979-DeRemerP #lalr #performance
Efficient computation of LALR(1) look-ahead sets (FD, TJP), pp. 176–187.
PLDIBest-of-PLDI-1979-PennelloD #lalr #performance
Efficient computation of LALR(1) look-ahead sets (with retrospective) (TJP, FD), pp. 14–27.
DACDAC-1979-Barbacci #evaluation #simulation #specification #synthesis
Instruction set processor specifications for simulation, evaluation, and synthesis (MB), pp. 64–72.
STOCSTOC-1979-Angluin #string
Finding Patterns Common to a Set of Strings (DA), pp. 130–141.
STOCSTOC-1979-GurariI #complexity #equivalence #linear #problem #source code
The Complexity of the Equivalence Problem for Counter Machines, Semilinear Sets, and Simple Programs (EMG, OHI), pp. 142–152.
ICALPICALP-1978-Barth
Grammars with Dynamic Control Sets (GB), pp. 36–51.
ICALPICALP-1978-CoppoDR #finite #λ-calculus
(Semi)-separability of Finite Sets of Terms in Scott’s D∞-Models of the λ-Calculus (MC, MDC, SRDR), pp. 142–164.
ICALPICALP-1978-Restivo #monad
Some Decision Results for Recognizable Sets in Arbitrary Monoids (AR), pp. 363–371.
ICGTGG-1978-Pfaltz #2d #graph grammar #network
A Graph Grammar that Describes the Set of Two-Dimensional Surface Networks (JLP), pp. 379–388.
VLDBVLDB-1977-Childs
Extended Set Theory (DLC), pp. 28–46.
DACDAC-1977-PedroG #algorithm #automation #design #named
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.
SOSPSOSP-1977-Potier #analysis #policy
Analysis of Demand Paging Policies with Swapped Working Sets (DP), pp. 125–131.
STOCSTOC-1977-PrabhalaS #comparison #stack
A Comparison of Instruction Sets for Stack Machines (BP, RS), pp. 132–142.
STOCSTOC-1977-Tarjan #maintenance
Reference Machines Require Non-linear Time to Maintain Disjoint Sets (RET), pp. 18–29.
ICSEICSE-1976-Koppang #design #development #process #tool support
Process Design System: An Integrated Set of Software Development Tools (RGK), pp. 86–90.
ICSEICSE-1976-ParnasHW #design #operating system #product line #specification #system family
Design and Specification of the Minimal Subset of an Operating System Family (DLP, GH, HW), p. 123.
ICSEICSE-1976-Smith #effectiveness #in memory #memory management #on the
On the Effectiveness of Set Associative Page Mapping and Its Application to Main Memory Management (AJS), pp. 286–292.
STOCSTOC-1976-HartmanisB #morphism #on the
On Isomorphisms and Density of NP and Other Complete Sets (JH, LB), pp. 30–40.
STOCSTOC-1976-Yao #algorithm #behaviour #on the
On the Average Behavior of Set Merging Algorithms (ACCY), pp. 192–195.
SIGMODSIGMOD-1975-WelchG #information retrieval #using
Information Retrieval in Files Described Using Sets (JWW, JWG), pp. 92–98.
ICALPICALP-1974-Blattner #context-free grammar
Transductions of Context-Free Languages into Sets of Sentential Forms (MB), pp. 511–522.
ICALPICALP-1974-FlajoletS #on the
On Sets Having Only Hard Subsets (PF, JMS), pp. 446–457.
POPLPOPL-1973-Morris
Types are Not Sets (JHMJ), pp. 120–124.
STOCSTOC-1973-BrockettD #evaluation #on the
On the Optimal Evaluation of a Set of Bilinear Forms (RWB, DPD), pp. 88–95.
STOCSTOC-1973-Eilenberg
Classes of Semigroups and Classes of Sets (SE), pp. 266–267.
STOCSTOC-1973-LynchMF
Sets that Don’t Help (NAL, ARM, MJF), pp. 130–134.
ICALPICALP-1972-Kemp #estimation #lr
An Estimation of the Set of States of the Minimal LR(0)-Acceptor (RK), pp. 563–574.
ICALPICALP-1972-Reghizzi #approximate
Approximation of Phrase Markers by Regular Sets (SCR), pp. 367–376.
ICALPICALP-1972-Takahashi
Primitive Tranformations of Regular Sets and Recognizable Sets (MT), pp. 475–480.
SOSPSOSP-J-1973-DenningS72
Properties of the Working Set Model (PJD, SCS), pp. 191–198.
SIGMODSIGFIDET-1971-Owens #evaluation
Evaluation of Access Authorization Characteristics of Derived Data Sets (RCOJ), pp. 263–278.
SOSPSOSP-1971-DenningS
Properties of the Working Set Model (PJD, SCS), pp. 130–140.
STOCSTOC-1971-McNaughton
A Decision Procedure for Generalized Sequential Mapability-onto of Regular Sets (RM), pp. 206–218.
STOCSTOC-1971-Terrine #algorithm #bottom-up #context-free grammar #generative #parsing
An Algorithm Generating the Decision Table of a Deterministic Bottom Up Parser for a Subset of Context Free Grammars (GT), pp. 185–205.
STOCSTOC-1970-BassY #complexity
Hierarchies Based on Computational Complexity and Irregularities of Class Determining Measured Sets (LJB, PRY), pp. 37–40.
STOCSTOC-1969-Young #order
Speed-Ups by Changing the Order in Which Sets are Enumerated (PRY), pp. 89–92.
SOSPSOSP-1967-Denning68 #behaviour
The Working Set Model for Program Behaviour (PJD), pp. 323–333.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.