BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
use (33)
test (23)
model (23)
base (21)
generat (18)

Stem compact$ (all stems)

249 papers:

DACDAC-2015-SonghoriHSK #logic #nearest neighbour #privacy #synthesis #using
Compacting privacy-preserving k-nearest neighbor search using logic synthesis (EMS, SUH, ARS, FK), p. 6.
DATEDATE-2015-PaganiCSH #modelling #named #performance
MatEx: efficient transient and peak temperature computation for compact thermal models (SP, JJC, MS, JH), pp. 1515–1520.
PODSPODS-2015-Cormode #dataset #scalability #summary
Compact Summaries over Large Datasets (GC), pp. 157–158.
VLDBVLDB-2015-AhmadK #distributed
Compaction Management in Distributed Key-Value Datastores (MYA, BK), pp. 850–861.
ICFPICFP-2015-YangCAEKN #communication #normalisation #performance
Efficient communication and collection with compact normal forms (EZY, GC, ÖSA, AEH, AK, RRN), pp. 362–374.
SIGIRSIGIR-2015-ZhangSTSWL
Compact Snippet Caching for Flash-based Search Engines (RZ, PS, JT, RJS, GW, XL), pp. 1015–1018.
SACSAC-2015-PedrosaT #approach #encoding #visual notation #word
Compact and discriminative approach for encoding spatial-relationship of visual words (GVP, AJMT), pp. 92–95.
ISMMISMM-2015-OsterlundL #concurrent #protocol #using
Concurrent compaction using a field pinning protocol (, WL), pp. 56–69.
CASECASE-2014-WangW #algorithm #estimation #problem #scheduling #testing
Compact estimation of distribution algorithm for semiconductor final testing scheduling problem (SW, LW), pp. 113–118.
DACDAC-2014-HerrewegeV
Software Only, Extremely Compact, Keccak-based Secure PRNG on ARM Cortex-M (AVH, IV), p. 6.
DACDAC-2014-YuSHEAB #metric #parametricity #using
Remembrance of Transistors Past: Compact Model Parameter Extraction Using Bayesian Inference and Incomplete New Measurements (LY, SS, CH, IAME, DAA, DSB), p. 6.
DATEDATE-2014-YasinSE #manycore #polynomial
Unified, ultra compact, quadratic power proxies for multi-core processors (MY, AS, IAME), pp. 1–4.
STOCSTOC-2014-Belazzougui #linear
Linear time construction of compressed text indices in compact space (DB), pp. 148–193.
CIKMCIKM-2014-TongWZ #incremental #repository #scalability
Compact Auxiliary Dictionaries for Incremental Compression of Large Repositories (JT, AW, JZ), pp. 1629–1638.
ICMLICML-c2-2014-Cherian #nearest neighbour #using
Nearest Neighbors Using Compact Sparse Codes (AC), pp. 1053–1061.
ICMLICML-c2-2014-HamidXGD #random
Compact Random Feature Maps (RH, YX, AG, DD), pp. 19–27.
ICPRICPR-2014-BekhetA #using #video
Compact Signature-Based Compressed Video Matching Using Dominant Color Profiles (DCP) (SB, AA), pp. 3933–3938.
ICPRICPR-2014-DuHZWD #case study #classification #design #network #online #recognition #using
A Study of Designing Compact Classifiers Using Deep Neural Networks for Online Handwritten Chinese Character Recognition (JD, JSH, BZ, SW, LRD), pp. 2950–2955.
ICPRICPR-2014-NeubertP #algorithm #segmentation #trade-off
Compact Watershed and Preemptive SLIC: On Improving Trade-offs of Superpixel Segmentation Algorithms (PN, PP), pp. 996–1001.
DATEDATE-2013-CabodiLV #bound #model checking #optimisation
Optimization techniques for craig interpolant compaction in unbounded model checking (GC, CL, DV), pp. 1417–1422.
DATEDATE-2013-SauerRSPB #performance #satisfiability
Efficient SAT-based dynamic compaction and relaxation for longest sensitizable paths (MS, SR, TS, IP, BB), pp. 448–453.
DATEDATE-2013-SchneiderP #adaptation #embedded
An extremely compact JPEG encoder for adaptive embedded systems (JS, SP), pp. 1063–1064.
VLDBVLDB-2013-YuanLWJZL #named #performance #rdf #scalability
TripleBit: a Fast and Compact System for Large Scale RDF Data (PY, PL, BW, HJ, WZ, LL), pp. 517–528.
PLDIPLDI-2013-CohenP #bound #towards
Limitations of partial compaction: towards practical bounds (NC, EP), pp. 309–320.
CHICHI-2013-PerinVF #graph #interactive #multi #visualisation
Interactive horizon graphs: improving the compact visualization of multiple time series (CP, FV, JDF), pp. 3217–3226.
CIKMCIKM-2013-LiHZW #clustering #mining
Mining entity attribute synonyms via compact clustering (YL, BJPH, CZ, KW), pp. 867–872.
ICMLICML-c3-2013-JiaVD #on the
On Compact Codes for Spatially Pooled Features (YJ, OV, TD), pp. 549–557.
SIGIRSIGIR-2013-MaxwellC #query #topic #using
Compact query term selection using topically related text (KTM, WBC), pp. 583–592.
SACSAC-2013-ToledoAOD #algorithm #hybrid #multi #problem #search-based
A hybrid compact genetic algorithm applied to the multi-level capacitated lot sizing problem (CFMT, MdSA, RRRdO, ACBD), pp. 200–205.
ISMMISMM-2013-MorikawaUI #adaptation #garbage collection #lisp
Adaptive scanning reduces sweep time for the Lisp2 mark-compact garbage collector (KM, TU, HI), pp. 15–26.
ICLPICLP-J-2013-Tarau #prolog
Compact serialization of Prolog terms (with catalan skeletons, cantor tupling and Gödel numberings) (PT), pp. 847–861.
ISSTAISSTA-2013-PurandareDE #finite #monitoring #optimisation
Optimizing monitoring of finite state properties through monitor compaction (RP, MBD, SGE), pp. 280–290.
DATEDATE-2012-MahmoodSD #framework #linear #modelling #multi #performance
An efficient framework for passive compact dynamical modeling of multiport linear systems (ZM, RS, LD), pp. 1203–1208.
VLDBVLDB-2012-FunkeKN #database #hybrid #transaction
Compacting Transactional Data in Hybrid OLTP & OLAP Databases (FF, AK, TN), pp. 1424–1435.
ICALPICALP-v2-2012-KosowskiLNS #graph
k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth (AK, BL, NN, KS), pp. 610–622.
ICMLICML-2012-LiuWMKC
Compact Hyperplane Hashing with Bilinear Functions (WL, JW, YM, SK, SFC), p. 64.
ICPRICPR-2012-NegrelPG #categorisation #image #using
Using spatial pyramids with compacted VLAT for image categorization (RN, DP, PHG), pp. 2460–2463.
ICPRICPR-2012-SchickFS
Measuring and evaluating the compactness of superpixels (AS, MF, RS), pp. 930–934.
KDIRKDIR-2012-KharbatBO #algorithm #case study #dataset
A New Compaction Algorithm for LCS Rules — Breast Cancer Dataset Case Study (FK, LB, MO), pp. 382–385.
KRKR-2012-Huang #reasoning
Compactness and Its Implications for Qualitative Spatial and Temporal Reasoning (JH).
ISMMISMM-2012-IyengarTWG
The Collie: a wait-free compacting collector (BI, GT, MW, EFG), pp. 85–96.
ICSTSAT-2012-TanjoTB #csp #encoding #named #order #satisfiability #using
Azucar: A SAT-Based CSP Solver Using Compact Order Encoding — (Tool Presentation) (TT, NT, MB), pp. 456–462.
DATEDATE-2011-EnemanCMMCMMBHP #estimation #multi
An analytical compact model for estimation of stress in multiple Through-Silicon Via configurations (GE, JC, VM, DM, MC, KDM, AM, EB, TH, GVdP), pp. 505–506.
DATEDATE-2011-YeHL #fault #multi #on the #using
On diagnosis of multiple faults using compacted responses (JY, YH, XL), pp. 679–684.
PLDIPLDI-2011-DilligDAS #composition #precise #source code #summary
Precise and compact modular procedure summaries for heap manipulating programs (ID, TD, AA, MS), pp. 567–577.
ICALPICALP-v1-2011-FarzanK #distance #graph #navigation
Compact Navigation and Distance Oracles for Graphs with Small Treewidth (AF, SK), pp. 268–280.
ICALPICALP-v2-2011-Chechik #fault tolerance #graph
Fault-Tolerant Compact Routing Schemes for General Graphs (SC), pp. 101–112.
CIKMCIKM-2011-PCK #problem #repository #trade-off
More or better: on trade-offs in compacting textual problem solution repositories (DP, SC, DK), pp. 2321–2324.
ICMLICML-2011-NorouziF
Minimal Loss Hashing for Compact Binary Codes (MN, DJF), pp. 353–360.
ICMLICML-2011-PengHMU #set
Convex Max-Product over Compact Sets for Protein Folding (JP, TH, DAM, RU), pp. 729–736.
POPLPOPL-2011-BenderskyP #bound #memory management
Space overhead bounds for dynamic memory management with partial compaction (AB, EP), pp. 475–486.
HPCAHPCA-2011-FungA #concurrent #control flow #performance #thread
Thread block compaction for efficient SIMT control flow (WWLF, TMA), pp. 25–36.
ISMMISMM-2011-TeneIW #concurrent #named
C4: the continuously concurrent compacting collector (GT, BI, MW), pp. 79–88.
PPoPPPPoPP-2011-MurarasuWBBP #algorithm #data type #grid #scalability
Compact data structure and scalable algorithms for the sparse grid technique (AFM, JW, GB, DB, DP), pp. 25–34.
ICSTSAT-2011-TanjoTB #csp #encoding #finite #performance
A Compact and Efficient SAT-Encoding of Finite Domain CSP (TT, NT, MB), pp. 375–376.
DACDAC-2010-BanP #layout #modelling #optimisation #robust
Compact modeling and robust layout optimization for contacts in deep sub-wavelength lithography (YB, DZP), pp. 408–411.
DACDAC-2010-BondD #automation #design #modelling
Automated compact dynamical modeling: an enabling tool for analog designers (BNB, LD), pp. 415–420.
DACDAC-2010-DadgourHSB #analysis #design #energy #logic #using
Design and analysis of compact ultra energy-efficient logic gates using laterally-actuated double-electrode NEMS (HFD, MMH, CS, KB), pp. 893–896.
DATEDATE-2010-ChengDMMRWRA #parametricity #using
Capturing intrinsic parameter fluctuations using the PSP compact model (BC, DD, NM, CM, GR, XW, SR, AA), pp. 650–653.
DATEDATE-2010-ChironiDBCI
A compact digital amplitude modulator in 90nm CMOS (VC, BD, AB, JC, MI), pp. 702–705.
DATEDATE-2010-LiH
Compact model of memristors and its application in computing systems (HL, MH), pp. 673–678.
CSMRCSMR-2010-MyersSS #debugging #scalability
Utilizing Debug Information to Compact Loops in Large Program Traces (DM, MADS, MS), pp. 41–50.
LISPILC-2010-UgawaIY #garbage collection #incremental
Starvation-free heap size for replication-based incremental compacting garbage collection (TU, HI, TY), pp. 43–52.
CHICHI-2010-LipfordWWFR #comparison #interface #policy #privacy #visual notation
Visual vs. compact: a comparison of privacy policy interfaces (HRL, JW, MW, KF, RWR), pp. 1111–1114.
CIKMCIKM-2010-KohnckeB #category theory #documentation #using #wiki
Using Wikipedia categories for compact representations of chemical documents (BK, WTB), pp. 1809–1812.
ICMLICML-2010-WangKC #learning
Sequential Projection Learning for Hashing with Compact Codes (JW, SK, SFC), pp. 1127–1134.
ICPRICPR-2010-TorrentPLFSMP #approach #detection #using
Detecting Faint Compact Sources Using Local Features and a Boosting Approach (AT, MP, XL, JF, JRSS, JM, JMP), pp. 4613–4616.
ICPRICPR-2010-WangH10a #case study #classification #design #multi #prototype #using
A Study of Designing Compact Recognizers of Handwritten Chinese Characters Using Multiple-Prototype Based Classifiers (YW, QH), pp. 1872–1875.
SIGIRSIGIR-2010-ChatzichristofisA #database #image #retrieval
Late fusion of compact composite descriptorsfor retrieval from heterogeneous image databases (SAC, AA), pp. 825–826.
PADLPADL-2010-RaimundoR #evaluation
Compact Lists for Tabled Evaluation (JR, RR), pp. 249–263.
CGOCGO-2010-KochBF #code generation
Integrated instruction selection and register allocation for compact code generation exploiting freeform mixing of 16- and 32-bit instructions (TJKEvK, IB, BF), pp. 180–189.
DACDAC-2009-GlassLTBC #analysis #architecture #design #encoding #hybrid #network
Designing heterogeneous ECU networks via compact architecture encoding and hybrid timing analysis (MG, ML, JT, UDB, SC), pp. 43–46.
DATEDATE-2009-BobbaZPAM #design #logic #standard #synthesis
Design of compact imperfection-immune CNFET layouts for standard-cell-based logic synthesis (SB, JZ, AP, DA, GDM), pp. 616–621.
DATEDATE-2009-HolstW #algorithm
A diagnosis algorithm for extreme space compaction (SH, HJW), pp. 1355–1360.
DATEDATE-2009-KavousianosC #fault #generative #testing
Generation of compact test sets with high defect coverage (XK, KC), pp. 1130–1135.
ICDARICDAR-2009-WangH #classification #design #fault #modelling #parametricity #precise #using
Design Compact Recognizers of Handwritten Chinese Characters Using Precision Constrained Gaussian Models, Minimum Classification Error Training and Parameter Compression (YW, QH), pp. 36–40.
CIAACIAA-2009-InabaH #query #representation #set
Compact Representation for Answer Sets of n-ary Regular Queries (KI, HH), pp. 94–104.
CIAACIAA-2009-VuilleminG #automaton #normalisation #regular expression
Compact Normal Form for Regular Languages as Xor Automata (JV, NG), pp. 24–33.
HCIHCI-AUII-2009-SchenkSDSFGL
Ultra Compact Laser Based Projectors and Imagers (HS, TS, CD, MS, KF, CG, HL), pp. 501–510.
CIKMCIKM-2009-HeYS #documentation #version control
Compact full-text indexing of versioned document collections (JH, HY, TS), pp. 415–424.
ECIRECIR-2009-TsegayPTZ #documentation #generative #performance #query
Document Compaction for Efficient Query Biased Snippet Generation (YT, SJP, AT, JZ), pp. 509–520.
ICSTSAT-2009-LonsingB #dependence #representation
A Compact Representation for Syntactic Dependencies in QBFs (FL, AB), pp. 398–411.
DACDAC-2008-ChoYBP #named #performance #predict
ELIAD: efficient lithography aware detailed router with compact post-OPC printability prediction (MC, KY, YB, DZP), pp. 504–509.
DACDAC-2008-PiyachonL #automaton #design #finite #pattern matching #performance
Design of high performance pattern matching engine through compact deterministic finite automata (PP, YL), pp. 852–857.
CSMRCSMR-2008-AbdeenADPS #visualisation
Package Reference Fingerprint: a Rich and Compact Visualization to Understand Package Relationships (HA, IA, SD, DP, MS), pp. 213–222.
ICMLICML-2008-RanzatoS #documentation #learning #network
Semi-supervised learning of compact document representations with deep networks (MR, MS), pp. 792–799.
ICPRICPR-2008-GurumoorthyRBR #image #representation
Beyond SVD: Sparse projections onto exemplar orthonormal bases for compact image representation (KSG, AR, AB, AR), pp. 1–4.
ICPRICPR-2008-KanataniS #algorithm #ml #strict
Compact algorithm for strictly ML ellipse fitting (KK, YS), pp. 1–4.
ICPRICPR-2008-SezerMAC #detection #markov #named
NorMaL: Non-compact Markovian Likelihood for change detection (OGS, JLM, YA, DBC), pp. 1–4.
ICPRICPR-2008-TsaiWY #named
CDIKP: A highly-compact local feature descriptor (YTT, QW, SY), pp. 1–4.
ASPLOSASPLOS-2008-WegielK #concurrent #memory management #parallel
The mapping collector: virtual memory support for generational, parallel, and concurrent compaction (MW, CK), pp. 91–102.
CASECASE-2007-YangC
A Compact Separation Column For Hazardous Chemicals (YY, JC), pp. 853–856.
DACDAC-2007-PiyachonL #pattern matching #performance #state machine
Compact State Machines for High Performance Pattern Matching (PP, YL), pp. 493–496.
DATEDATE-2007-AlhoHHH #design #hardware
Compact hardware design of Whirlpool hashing core (TA, PH, MH, TDH), pp. 1247–1252.
DATEDATE-2007-FaragES #2d #configuration management #using
Improving utilization of reconfigurable resources using two dimensional compaction (AAEF, HMEB, SIS), pp. 135–140.
ICDARICDAR-2007-LongJ #classification
Building Compact MQDF Classifier for Off-line Handwritten Chinese Characters by Subspace Distribution Sharing (TL, LJ), pp. 909–913.
GT-VMTGT-VMT-2007-LaraGB #generative #graph grammar #specification
Triple Patterns: Compact Specifications for the Generation of Operational Triple Graph Grammar Rules (JdL, EG, PB).
POPLPOPL-2007-VaswaniNC #profiling
Preferential path profiling: compactly numbering interesting paths (KV, AVN, TMC), pp. 351–362.
SACSAC-2007-MuSZ
Compact sequential aggregate signatures (YM, WS, HZ), pp. 249–253.
CGOCGO-2007-HeTPDA #kernel #operating system
Code Compaction of an Operating System Kernel (HH, JT, SP, SKD, GRA), pp. 283–298.
DACDAC-2006-ChaoCWCW #analysis #using
Unknown-tolerance analysis and test-quality control for test response compaction using space compactors (MCTC, KTC, SW, STC, WW), pp. 1083–1088.
DACDAC-2006-VrankenGGSH #detection #fault
Fault detection and diagnosis with parity trees for space compaction of test responses (HPEV, SKG, AG, JS, FH), pp. 1095–1098.
DATEDATE-2006-IizukaIA #layout #optimisation
Timing-driven cell layout de-compaction for yield optimization by critical area minimization (TI, MI, KA), pp. 884–889.
DATEDATE-2006-PomeranzR06a #fault
Test compaction for transition faults under transparent-scan (IP, SMR), pp. 1264–1269.
DATEDATE-2006-RosselloS #fault #identification
A compact model to identify delay faults due to crosstalk (JLR, JS), pp. 902–906.
DATEDATE-DF-2006-NazarianPGB #named #set #statistics
STAX: statistical crosstalk target set compaction (SN, MP, SKG, MAB), pp. 172–177.
VLDBVLDB-2006-ReissGH #identifier
Compact Histograms for Hierarchical Identifiers (FR, MNG, JMH), pp. 870–881.
PLDIPLDI-2006-KermanyP #concurrent #incremental #parallel
The Compressor: concurrent, incremental, and parallel compaction (HK, EP), pp. 354–363.
ICALPICALP-v2-2006-LyubashevskyM
Generalized Compact Knapsacks Are Collision Resistant (VL, DM), pp. 144–155.
ICPRICPR-v1-2006-IshiyamaIS
A Compact Model of Human Postures Extracting Common Motion from Individual Samples (RI, HI, SS), pp. 187–190.
SACSAC-2006-NikovskiK #induction #personalisation #recommendation
Induction of compact decision trees for personalized recommendation (DN, VK), pp. 575–581.
ASPLOSASPLOS-2006-KgilDSBDMRF #3d #energy #multi #named #performance #using
PicoServer: using 3D stacking technology to enable a compact energy efficient chip multiprocessor (TK, SD, AGS, NLB, RGD, TNM, SKR, KF), pp. 117–128.
ISMMISMM-2006-McGacheyH
Reducing generational copy reserve overhead with fallback compaction (PM, ALH), pp. 17–28.
DACDAC-2005-KajiharaFWMHS #process
Path delay test compaction with process variation tolerance (SK, MF, XW, TM, SH, YS), pp. 845–850.
DACDAC-2005-VolkerinkM #architecture #using
Response compaction with any number of unknowns using a new LFSR architecture (EHV, SM), pp. 117–122.
DATEDATE-2005-BiswasLBP #specification
Specification Test Compaction for Analog Circuits and MEMS (SB, PL, RD(B, LTP), pp. 164–169.
ICDARICDAR-2005-LiuMK #classification #feature model #recognition #scalability #set #using
Building Compact Classifier for Large Character Set Recognition Using Discriminative Feature Extraction (CLL, RM, MK), pp. 846–850.
CSMRCSMR-2005-GreevyD #analysis #approach #correlation #using
Correlating Features and Code Using a Compact Two-Sided Trace Analysis Approach (OG, SD), pp. 314–323.
CIKMCIKM-2005-HeWYY #reachability
Compact reachability labeling for graph-structured data (HH, HW, JY, PSY), pp. 594–601.
ICMLICML-2005-SnelsonG #approximate #predict
Compact approximations to Bayesian predictive distributions (ES, ZG), pp. 840–847.
MODELSMoDELS-2005-CuccuruDMB #modelling #towards #uml
Towards UML 2 Extensions for Compact Modeling of Regular Complex Topologies (AC, JLD, PM, PB), pp. 445–459.
MODELSMoDELS-2005-CuccuruDMB #modelling #towards #uml
Towards UML 2 Extensions for Compact Modeling of Regular Complex Topologies (AC, JLD, PM, PB), pp. 445–459.
LCTESLCTES-2005-ChanetSBPB #kernel #linux
System-wide compaction and specialization of the linux kernel (DC, BDS, BDB, LVP, KDB), pp. 95–104.
DACDAC-2004-HuangSSSGV #design #modelling
Compact thermal modeling for temperature-aware design (WH, MRS, KS, KS, SG, SV), pp. 878–883.
DATEDATE-v1-2004-DimopoulosL #performance #sequence #set #testing
Efficient Static Compaction of Test Sequence Sets through the Application of Set Covering Techniques (MGD, PL), pp. 194–201.
DATEDATE-v1-2004-GuptaDGN #control flow #design #synthesis
Loop Shifting and Compaction for the High-Level Synthesis of Designs with Complex Control Flow (SG, ND, RG, AN), pp. 114–121.
DATEDATE-v2-2004-LanD #analysis #modelling #synthesis
Synthesized Compact Models (SCM) of Substrate Noise Coupling Analysis and Synthesis in Mixed-Signal ICs (HL, RWD), pp. 836–843.
DATEDATE-v2-2004-RosselloS
A Compact Propagation Delay Model for Deep-Submicron CMOS Gates including Crosstalk (JLR, JS), pp. 954–961.
DATEDATE-v2-2004-ShoganC
Compact Binaries with Code Compression in a Software Dynamic Translator (SS, BRC), pp. 1052–1059.
DATEDATE-v2-2004-WangLC #fault #hardware #hybrid #testing
Hybrid Delay Scan: A Low Hardware Overhead Scan-Based Delay Test Technique for High Fault Coverage and Compact Test Sets (SW, XL, STC), pp. 1296–1301.
CIKMCIKM-2004-LvCL #data type #image #similarity
Image similarity search with compact data structures (QL, MC, KL), pp. 208–217.
CIKMCIKM-2004-ZouLC #query #using #xml
Using a compact tree to index and query XML data (QZ, SL, WWC), pp. 234–235.
ICPRICPR-v1-2004-WangA #composition #multi #representation #using
Compact Representation of Multidimensional Data Using Tensor Rank-One Decomposition (HW, NA), pp. 44–47.
OOPSLAOOPSLA-2004-AbuaiadhOPS #algorithm #parallel #performance
An efficient parallel heap compaction algorithm (DA, YO, EP, US), pp. 224–236.
ISMMISMM-2004-OssiaBS #concurrent #garbage collection
Mostly concurrent compaction for mark-sweep GC (YO, OBY, MS), pp. 25–36.
DACDAC-2003-LiP #named #order #reduction
NORM: compact model order reduction of weakly nonlinear systems (PL, LTP), pp. 472–477.
DACDAC-2003-MukhopadhyayRR #estimation #logic #modelling
Accurate estimation of total leakage current in scaled CMOS logic circuits based on compact current modeling (SM, AR, KR), pp. 169–174.
DATEDATE-2003-DrineasM #concurrent #detection #fault #monitoring
Non-Intrusive Concurrent Error Detection in FSMs through State/Output Compaction and Monitoring via Parity Trees (PD, YM), pp. 11164–11167.
DATEDATE-2003-PomeranzR #approach #generative #testing
A New Approach to Test Generation and Test Compaction for Scan Circuits (IP, SMR), pp. 11000–11005.
DocEngDocEng-2003-Vion-Dury #towards #xml #xpath
XPath on left and right sides of rules: toward compact XML tree rewriting through node patterns (JYVD), pp. 19–25.
SASSAS-2003-ChenLG #multi
Code Compaction of Matching Single-Entry Multiple-Exit Regions (WKC, BL, RG), pp. 401–417.
PADLPADL-2003-HillS #logic programming #source code
Logic Programs as Compact Denotations (PMH, FS), pp. 339–356.
PPoPPPPoPP-2003-GoelRM #parallel #representation
Compactly representing parallel program executions (AG, AR, TM), pp. 191–202.
DATEDATE-2002-CiesielskiKZR #canonical #diagrams #representation #verification
Taylor Expansion Diagrams: A Compact, Canonical Representation with Applications to Symbolic Verification (MJC, PK, ZZ, BR), pp. 285–289.
DATEDATE-2002-KhazakaN #megamodelling
Compact Macromodel for Lossy Coupled Transmission Lines (RK, MSN), p. 1114.
SIGMODSIGMOD-2002-BumbulisB
A compact B-tree (PB, ITB), pp. 533–541.
FoSSaCSFoSSaCS-2002-Martin
The Informatic Derivative at a Compact Element (KM), pp. 310–325.
SASSAS-2002-ManevichRFGS #first-order #representation #static analysis
Compactly Representing First-Order Structures for Static Analysis (RM, GR, JF, DG, SS), pp. 196–212.
CIAACIAA-2002-HolubC #implementation #on the
On the Implementation of Compact DAWG’s (JH, MC), pp. 289–294.
CIKMCIKM-2002-StehlingNF #approach #classification #image #performance #retrieval
A compact and efficient image retrieval approach based on border/interior pixel classification (ROS, MAN, AXF), pp. 102–109.
ISMMISMM-2002-Ben-YitzhakGKKL #algorithm #incremental #parallel
An algorithm for parallel incremental compaction (OBY, IG, EKK, KK, VL), pp. 207–212.
CSLCSL-2002-BridgesIS #revisited
Compactness and Continuity, Constructively Revisited (DSB, HI, PS), pp. 89–102.
DACDAC-2001-PomeranzR #approach #testing
An Approach to Test Compaction for Scan Circuits that Enhances At-Speed Testing (IP, SMR), pp. 156–161.
DATEDATE-2001-PomeranzR #order #sequence
Sequence reordering to improve the levels of compaction achievable by static compaction procedures (IP, SMR), pp. 214–218.
PODSPODS-2001-RajaramanU #query #using
Querying Websites Using Compact Skeletons (AR, JDU).
CIAACIAA-2001-DaciukN #automaton #finite #modelling #representation
Finite Automata for Compact Representation of Language Models in NLP (JD, GvN), pp. 65–73.
POPLPOPL-2001-FlanaganS #explosion #exponential #generative #verification
Avoiding exponential explosion: generating compact verification conditions (CF, JBS), pp. 193–205.
LCTESLCTES-OM-2001-SutterBBD
Combining Global Code and Data Compaction (BDS, BDB, KDB, SKD), pp. 29–38.
DATEDATE-2000-BouraiS #layout #optimisation
Layout Compaction for Yield Optimization via Critical Area Minimization (YB, CJRS), pp. 122–125.
DATEDATE-2000-WambacqDDEB #communication #modelling
Compact Modeling of Nonlinear Distortion in Analog Communication Circuits (PW, PD, SD, ME, IB), pp. 350–354.
VLDBVLDB-2000-LingLL #query
Hierarchical Compact Cube for Range-Max Queries (SYL, TWL, HGL), pp. 232–241.
ICPRICPR-v4-2000-AchardDL #image #retrieval
Object Image Retrieval with Image Compactness Vectors (CA, JD, LL), pp. 4271–4274.
ISMMISMM-2000-Tarditi #garbage collection
Compact Garbage Collection Tables (DT), pp. 50–58.
DACDAC-1999-GuoRP #generative #named #using
Proptest: A Property Based Test Pattern Generator for Sequential Circuits Using Test Compaction (RG, SMR, IP), pp. 653–659.
DATEDATE-1999-SantosoMRA #generative #named #testing #using
FreezeFrame: Compact Test Generation Using a Frozen Clock Strategy (YS, MCM, EMR, MA), p. 747–?.
ICDARICDAR-1999-RemakiC #documentation #image #kernel #product line #using #visual notation
Visual Data Extraction from Bi-level Document Images using a Generalized Kernel Family with Compact Support, in Scale-Space (LR, MC), pp. 609–612.
ESOPESOP-1999-JanssonJ #parsing
Polytypic Compact Printing and Parsing (PJ, JJ), pp. 273–287.
PLDIPLDI-1999-RaoP #embedded #optimisation #performance
Storage Assignment Optimizations to Generate Compact and Efficient Code on Embedded DSPs (AR, SP), pp. 128–138.
STOCSTOC-1999-MuthukrishnanPSS #grid #multi #network
Compact Grid Layouts of Multi-Level Networks (SM, MP, SCS, TS), pp. 455–463.
ICALPICALP-1999-GavoilleH #bound #graph
Compact Routing Tables for Graphs of Bounded Genus (CG, NH), pp. 351–360.
CIAAWIA-1999-SeuringG #automaton
A Structural Method for Output Compaction of Sequential Automata Implemented as Circuits (MS, MG), pp. 158–163.
CSLCSL-1999-Balcazar #consistency #learning #query
The Consistency Dimension, Compactness, and Query Learning (JLB), pp. 2–13.
DATEDATE-1998-GuoPR #sequence #testing
Procedures for Static Compaction of Test Sequences for Synchronous Sequential Circuits Based on Vector Restoration (RG, IP, SMR), pp. 583–587.
DATEDATE-1998-HsiaoC #performance #sequence
State Relaxation Based Subsequence Removal for Fast Static Compaction in Sequential Circuits (MSH, STC), pp. 577–582.
DATEDATE-1998-MetraFR
Highly Testable and Compact 1-out-of-n Code Checker with Single Output (CM, MF, BR), pp. 981–982.
ICALPICALP-1998-ChuangGHKL #canonical #encoding #graph #multi #order
Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses (RCNC, AG, XH, MYK, HIL), pp. 118–129.
ISMMISMM-1998-LaroseF #compilation #incremental #performance #quality
A Compacting Incremental Collector and its Performance in a Production Quality Compiler (ML, MF), pp. 1–9.
ISSTAISSTA-1998-Corbett #concurrent #java #modelling #source code
Constructing Compact Models of Concurrent Java Programs (JCC), pp. 1–10.
DACDAC-1997-MarculescuMP #analysis #finite #probability #sequence #state machine
Sequence Compaction for Probabilistic Analysis of Finite-State Machines (DM, RM, MP), pp. 12–15.
DACDAC-1997-MarculescuMP97a #estimation #sequence
Hierarchical Sequence Compaction for Power Estimation (RM, DM, MP), pp. 570–575.
DATEEDTC-1997-CornoPRR #sequence #testing
New static compaction techniques of test sequences for sequential circuits (FC, PP, MR, MSR), pp. 37–43.
DATEEDTC-1997-KaalK #generative #metaprogramming #testing
Compact structural test generation for analog macros (VK, HGK), pp. 581–587.
DATEEDTC-1997-RenovellAB
On-chip analog output response compaction (MR, FA, YB), pp. 568–572.
IFLIFL-1997-BoortzS #garbage collection
A Compacting Garbage Collector for Unidirectional Heaps (KB, DS), p. 358–?.
KDDKDD-1997-WangS
Selecting Features by Vertical Compactness of Data (KW, SS), pp. 275–278.
DACDAC-1996-HuangCCL #generative #simulation
Compact Vector Generation for Accurate Power Simulation (SYH, KCC, KTC, TCL), pp. 161–164.
DACDAC-1996-Koch
Module Compaction in FPGA-based Regular Datapaths (AK), pp. 471–476.
DACDAC-1996-PomeranzR #on the #sequence #testing
On Static Compaction of Test Sequences for Synchronous Sequential Circuits (IP, SMR), pp. 215–220.
DACDAC-1996-TsuiMMP #performance
Improving the Efficiency of Power Simulators by Input Vector Compaction (CYT, RM, DM, MP), pp. 165–168.
ICPRICPR-1996-LabonteDC #representation #sequence
A compact representation for stereoscopic sequences with NTSC spectral compatibility (FL, CTLD, PC), pp. 646–650.
ICPRICPR-1996-MaurerBFTD
A compact vision system for road vehicle guidance (MM, RB, SF, FT, EDD), pp. 313–317.
CCCC-1996-VitekH #object-oriented
Compact Dispatch Tables for Dynamically Typed Object Oriented Languages (JV, RNH), pp. 309–325.
DACDAC-1995-VenkataramanHFRCP #agile #fault #simulation #using
Rapid Diagnostic Fault Simulation of Stuck-at Faults in Sequential Circuits Using Compact Lists (SV, IH, WKF, EMR, SC, JHP), pp. 133–138.
ICALPICALP-1995-HarjuKP #equation
Compactness of Systems of Equations in Semigroups (TH, JK, WP), pp. 444–454.
SACSAC-1995-HalgamugeBG #algorithm #classification #comparison #generative #heuristic #rule-based #search-based
Comparison of a heuristic method with a genetic algorithm for generation of compact rule based classifiers (SKH, AB, MG), pp. 580–585.
ICSEICSE-1995-DwyerCN #concurrent #petri net #representation #source code
A Compact Petri Net Representation for Concurrent Programs (MBD, LAC, KAN), pp. 147–157.
ISMMIWMM-1995-SuzukiKT #named #performance #scalability
MOA — A Fast Sliding Compaction Scheme for a Large Storage Space (MS, HK, MT), pp. 197–210.
VLDBVLDB-1994-SetzerZ #algorithm #concurrent
New Concurrency Control Algorithms for Accessing and Compacting B-Trees (VWS, AZ), pp. 238–248.
CHICHI-1994-AhlbergS94d #agile
The alphaslider: a compact and rapid selector (CA, BS), pp. 365–371.
DACDAC-1993-BamjiV #constraints #identification #named
MSTC: A Method for Identifying Overconstraints during Hierarchical Compaction (CB, RV), pp. 389–394.
DACDAC-1993-DaoMHOM
A Compaction Method for Full Chip VLSI Layouts (JD, NM, TH, CO, SM), pp. 407–412.
DACDAC-1993-PanDL #constraints #graph #layout #reduction
Optimal Graph Constraint Reduction for Symbolic Layout Compaction (PP, SkD, CLL), pp. 401–406.
DACDAC-1993-YaoCDNL #using
Cell-Based Hierarchical Pitchmatching Compaction Using Minimal LP (SZY, CKC, DD, SN, CYL), pp. 395–400.
ICALPICALP-1993-Frederickson
Searching among Intervals and Compact Routing Tables (GNF), pp. 28–39.
SOSPSOSP-1993-OTooleNG #concurrent #garbage collection #persistent
Concurrent Compacting Garbage Collection of a Persistent Heap (JO, SN, DKG), pp. 161–174.
DACDAC-1992-BamjiV #design #using
Hierarchical Pitchmatching Compaction Using Minimum Design (CB, RV), pp. 311–317.
DACDAC-1992-Boyer #constraints #graph #independence #process
Process Independent Constraint Graph Compaction (DGB), pp. 318–322.
DACDAC-1991-DevadasKM #algorithm #generative #multi #testing
A Synthesis-Based Test Generation and Compaction Algorithm for Multifaults (SD, KK, SM), pp. 359–365.
DACDAC-1991-Harrison #layout #using
VLSI Layout Compaction Using Radix Priority Search Trees (AJH), pp. 732–735.
DACDAC-1990-LoV #algorithm
An O(n1.5logn) 1-d Compaction Algorithm (CYL, RV), pp. 382–387.
DACDAC-1990-Onozawa #constraints #layout
Layout Compaction with Attractive and Repulsive Constraints (AO), pp. 369–374.
PLDIPLDI-1990-CytronFS #dependence
Compact Representations for Control Dependence (RC, JF, VS), pp. 337–351.
STOCSTOC-1990-AggarwalHL #diagrams #problem
Solving Query-Retrieval Problems by Compacting Voronoi Diagrams (Extended Abstract) (AA, MH, FTL), pp. 331–340.
ICALPICALP-1990-PanR #multi #on the
On the Bit-Complexity of Discrete Solutions of PDEs: Compact Multigrid (VYP, JHR), pp. 612–625.
ICALPICALP-1990-Radge #parallel
The Parallel Simplicity of Compaction and Chaining (PR), pp. 744–751.
CSLCSL-1990-GrandjeanR #memory management #ram #robust
RAM with Compact Memory: A Realistic and Robust Model of Computation (EG, JMR), pp. 195–233.
ICLPNACLP-1990-WeemeeuwD #memory management #multi
A la Recherche de la Mémoire Perdue OR Memory Compaction for Shard Memory Multiprocessors (PW, BD), pp. 306–320.
DACDAC-1989-GangulyP
Compaction of a Routed Channel on the Connection Machine (SG, VP), pp. 779–782.
DACDAC-1989-Lo #automation #generative #layout
Automatic Tub Region Generation for Symbolic Layout Compaction (CYL), pp. 302–306.
DACDAC-1989-ShinL #2d #algorithm #layout #performance
An Efficient Two-Dimensional Layout Compaction Algorithm (HS, CYL), pp. 290–295.
STOCSTOC-1989-AwerbuchBLP #adaptation #data type #distributed
Compact Distributed Data Structures for Adaptive Routing (Extended Abstract) (BA, ABN, NL, DP), pp. 479–489.
CHICHI-1989-Glushko #hypermedia
Transforming text into hypertext for a compact disc encyclopedia (RJG), pp. 293–298.
DACDAC-1988-Boyer #bibliography #layout #perspective
Symbolic Layout Compaction Review (DGB), pp. 383–389.
DACDAC-1988-CongW #how
How to Obtain More Compactable Channel Routing Solutions (JC, DFW), pp. 663–666.
DACDAC-1988-HarelK #approach #fault #graph #simulation
A Graph Compaction Approach to Fault Simulation (DH, BK), pp. 601–604.
DACDAC-1988-Schiele #constraints #incremental
Compaction with Incremental Over-Constraint Resolution (WLS), pp. 390–395.
VLDBVLDB-1988-OrlandicP
Compact 0-Complete Trees (RO, JLP), pp. 372–381.
DACDAC-1987-CarpenterH #constraints #generative #incremental
Generating Incremental VLSI Compaction Spacing Constraints (CWC, MH), pp. 291–297.
DACDAC-1987-NylandDR
Improving Virtual-Grid Compaction Through Grouping (LSN, SWD, CDR), pp. 305–310.
DACDAC-1987-Polkl
A Three-Layer Gridless Channel Router with Compaction (DBP), pp. 146–151.
DACDAC-1987-RoylePVNS #geometry
Geometrical Compaction in One Dimension for Channel Routing (JR, MP, HV, NN, JS), pp. 140–145.
DACDAC-1987-ShahM
A New Compaction Scheme Based on Compression Ridges (PCS, HNM), pp. 645–648.
PLDIPLDI-1987-LangD #garbage collection #incremental
Incremental incrementally compacting garbage collection (BL, FD), pp. 253–263.
DACDAC-1986-ShinSS #2d
Two-dimensional compaction by “zone refining” (HS, ALSV, CHS), pp. 115–122.
DACDAC-1985-Cho #bibliography #tutorial
A subjective review of compaction (tutorial session) (YEC), pp. 396–404.
DACDAC-1985-HillFL #effectiveness #generative #grid
Effective use of virtual grid compaction in macro-module generators (DDH, JPF, MDPL), pp. 777–780.
DACDAC-1984-Mori #interactive #layout
Interactive compaction router for VLSI layout (HM), pp. 137–143.
DACDAC-1984-ScottO #interactive #named
Plowing: Interactive stretching and compaction in magic (WSS, JKO), pp. 166–172.
SIGMODSIGMOD-1984-ArnowT #comparison #empirical #multi
An Empirical Comparison of B-Trees, Compact B-Trees and Multiway Trees (DMA, AMT), pp. 33–46.
STOCSTOC-1984-KimA
Digital Disks and a Digital Compactness Measure (CEK, TAA), pp. 117–124.
DACDAC-1983-KedemW #layout
Graph-optimization techniques for IC layout and compaction (GK, HW), pp. 113–120.
DACDAC-1983-LiaoW #algorithm #constraints #layout
An algorithm to compact a VLSI symbolic layout with mixed constraints (YZL, CKW), pp. 107–112.
DACDAC-1983-Schiele
Improved compaction by minimized length of wires (WLS), pp. 121–127.
DACDAC-1982-CiesielskiK
An analytical method for compacting routing area in integrated circuits (MJC, EK), pp. 30–37.
VLDBVLDB-1982-BancilhonRS #on the
On Line Processing of Compacted Relations (FB, PR, MS), pp. 263–269.
LISPLISP-1980-Rowan #compilation #lisp
A LISP Compiler Producing Compact Code (WR), pp. 216–222.
SIGMODSIGMOD-1979-RosenbergS
Compact B-Trees (ALR, LS), pp. 43–51.
ICALPICALP-1979-Ukkonen #bottom-up #lr #parsing
A Modification of the LR(k) Method for Constructing Compact Bottom-Up Parsers (EU), pp. 646–658.
POPLPOPL-1979-Fraser #independence
A Compact, Machine-Independent Peephole Optimizer (CWF), pp. 1–6.

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.