BibSLEIGH — minim stem

Used together with:

algorithm (68)
use (61)
time (56)
automata (46)
base (44)

Stem minim$ (all stems)

756 papers:

CASE-2015-HuZW: Direct computation of minimal rotation for support slimming (KH, XZ, CCLW), pp. 936–941.
CASE-2015-McKinleyGSKMNLP #single use: A single-use haptic palpation probe for locating subcutaneous blood vessels in robot-assisted minimally invasive surgery (SM, AG, SS, RK, AM, KAN, SL, SP, PA, AMO, KG), pp. 1151–1158.
CASE-2015-Michalek #bound #standard: Motion control with minimization of a boundary off-track for non-Standard N-trailers along forward-followed paths (MMM), pp. 1564–1569.
DAC-2015-ChiangCLJ #design #power management #scalability: Scalable sequence-constrained retention register minimization in power gating design (TWC, KHC, YTL, JHRJ), p. 6.
DAC-2015-CuiWCZNP #energy #grid #smarttech: Optimal control of PEVs for energy cost minimization and frequency regulation in the smart grid accounting for battery state-of-health degradation (TC, YW, SC, QZ, SN, MP), p. 6.
DATE-2015-0001KVSMA #adaptation #embedded #energy #nondeterminism #scalability: Workload uncertainty characterization and adaptive frequency scaling for energy minimization of embedded systems (AD, AK, BV, RAS, GVM, BMAH), pp. 43–48.
DATE-2015-ChenYCK #migration #named: PWL: a progressive wear leveling to minimize data migration overheads for nand flash devices (FHC, MCY, YHC, TWK), pp. 1209–1212.
DATE-2015-FuLX #energy #memory management: Race to idle or not: balancing the memory sleep time with DVS for energy minimization (CF, ML, CJX), pp. 13–18.
DATE-2015-HanFNQ #energy #fault tolerance #multi #scheduling: Energy minimization for fault tolerant scheduling of periodic fixed-priority applications on multiprocessor platforms (QH, MF, LN, GQ), pp. 830–835.
DATE-2015-HuangLH #multi: Volume-oriented sample preparation for reactant minimization on flow-based microfluidic biochips with multi-segment mixers (CMH, CHL, JDH), pp. 1114–1119.
DATE-2015-LiuHFRQR #power management: Power minimization for data center with guaranteed QoS (SL, SH, MF, SR, GQ, SR), pp. 1347–1352.
DATE-2015-ShonikerCHP #design #process #simulation #verification: Minimizing the number of process corner simulations during design verification (MS, BFC, JH, WP), pp. 289–292.
DATE-2015-TrinadhBSPK #approach #named #programming #testing: DP-fill: a dynamic programming approach to X-filling for minimizing peak test power in scan tests (ST, CSB, SGS, SP, VK), pp. 836–841.
SIGMOD-2015-ClinkenbeardN #communication #scheduling: Job Scheduling with Minimizing Data Communication Costs (TC, AN), pp. 2071–2072.
SIGMOD-2015-HungTWA #validation: Minimizing Efforts in Validating Crowd Answers (NQVH, DCT, MW, KA), pp. 999–1014.
SIGMOD-2015-NawabAAA #commit #latency #transaction: Minimizing Commit Latency of Transactions in Geo-Replicated Data Stores (FN, VA, DA, AEA), pp. 1279–1294.
VLDB-2015-HammoudRNBS #adaptation #communication #distributed #named #query #rdf: DREAM: Distributed RDF Engine with Adaptive Query Planner and Minimal Communication (MH, DAR, RN, SMRB, SS), pp. 654–665.
STOC-2015-BansalK: Minimizing Flow-Time on Unrelated Machines (NB, JK), pp. 851–860.
STOC-2015-ZhuLO #matrix #multi: Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates (ZAZ, ZL, LO), pp. 237–245.
DLT-2015-AvgustinovichFP #complexity #infinity #permutation: Ergodic Infinite Permutations of Minimal Complexity (SVA, AEF, SP), pp. 71–84.
DLT-2015-HolzerJK #automaton #finite: Minimal Reversible Deterministic Finite Automata (MH, SJ, MK), pp. 276–287.
LATA-2015-DaiW #algorithm #parallel #random #sequence: A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk (HKD, ZW), pp. 133–144.
ICML-2015-EneN #coordination #random: Random Coordinate Descent Methods for Minimizing Decomposable Submodular Functions (AE, HLN), pp. 787–795.
ICML-2015-FrostigGKS #algorithm #approximate #empirical #named #performance #probability: Un-regularizing: approximate proximal point and faster stochastic algorithms for empirical risk minimization (RF, RG, SK, AS), pp. 2540–2548.
ICML-2015-SunLXB #clustering #multi: Multi-view Sparse Co-clustering via Proximal Alternating Linearized Minimization (JS, JL, TX, JB), pp. 757–766.
ICML-2015-SwaminathanJ #feedback #learning: Counterfactual Risk Minimization: Learning from Logged Bandit Feedback (AS, TJ), pp. 814–823.
ICML-2015-XinW #adaptation #probability #rank: Pushing the Limits of Affine Rank Minimization by Adapting Probabilistic PCA (BX, DPW), pp. 419–427.
ICML-2015-ZhangL #coordination #empirical #probability: Stochastic Primal-Dual Coordinate Method for Regularized Empirical Risk Minimization (YZ, XL), pp. 353–361.
ICML-2015-ZhaoZ #optimisation #probability: Stochastic Optimization with Importance Sampling for Regularized Loss Minimization (PZ, TZ), pp. 1–9.
KDD-2015-SatoN #online #probability: Stochastic Divergence Minimization for Online Collapsed Variational Bayes Zero Inference of Latent Dirichlet Allocation (IS, HN), pp. 1035–1044.
SAC-2015-YangCHCLK #performance: Reliability-aware striping with minimized performance overheads for flash-based storage devices (MCY, YMC, PCH, YHC, LJL, TWK), pp. 1906–1912.
ASPLOS-2015-MishraZLH #approach #constraints #energy #modelling #performance #probability #visual notation: A Probabilistic Graphical Model-based Approach for Minimizing Energy Under Performance Constraints (NM, HZ, JDL, HH), pp. 267–281.
CAV-2015-BacchusK #satisfiability #set #using: Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets (FB, GK), pp. 70–86.
LICS-2015-BallePP #approximate #automaton #canonical: A Canonical Form for Weighted Automata and Applications to Approximate Minimization (BB, PP, DP), pp. 701–712.
SAT-2015-LonsingE #api #incremental #satisfiability: Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API (FL, UE), pp. 191–198.
ASE-2014-HagiharaESY #satisfiability #set #specification: Minimal strongly unsatisfiable subsets of reactive system specifications (SH, NE, MS, NY), pp. 629–634.
DAC-2014-LinRGDS #algorithm #performance: An Efficient Wire Routing and Wire Sizing Algorithm for Weight Minimization of Automotive Systems (CWL, LR, PG, JD, ALSV), p. 6.
DAC-2014-LiuCCJ: Simultaneous EUV Flare Variation Minimization and CMP Control with Coupling-Aware Dummification (CYL, HJKC, YWC, JHRJ), p. 6.
DAC-2014-WangMZSS: Walking Pads: Managing C4 Placement for Transient Voltage Noise Minimization (KW, BHM, RZ, MRS, KS), p. 6.
DATE-2014-BurlyaevFG: Verification-guided voter minimization in triple-modular redundant circuits (DB, PF, AG), pp. 1–6.
DATE-2014-ChenCH #array #configuration management #constraints #synthesis: Area minimization synthesis for reconfigurable single-electron transistor arrays with fabrication constraints (YHC, JYC, JDH), pp. 1–4.
DATE-2014-ConosMDP #coordination #energy #power management #using: Provably minimal energy using coordinated DVS and power gating (NAC, SM, FD, MP), pp. 1–6.
DATE-2014-DongZ #manycore #memory management #realtime #stack: Minimizing stack memory for hard real-time applications on multicore platforms (CD, HZ), pp. 1–6.
DATE-2014-JonnaJRM: Minimally buffered single-cycle deflection router (GRJ, JJ, RR, MM), pp. 1–4.
DATE-2014-LinWCH #logic: Rewiring for threshold logic circuit minimization (CCL, CYW, YCC, CYH), pp. 1–6.
DATE-2014-LiuCHWCDN #array #synthesis: Width minimization in the Single-Electron Transistor array synthesis (CWL, CEC, CYH, CYW, YCC, SD, VN), pp. 1–4.
DATE-2014-SarmaD #estimation #network #runtime: Minimal sparse observability of complex networks: Application to MPSoC sensor placement and run-time thermal estimation & tracking (SS, ND), pp. 1–6.
DATE-2014-WangLXCP #energy #hybrid: Minimizing state-of-health degradation in hybrid electrical energy storage systems with arbitrary source and load profiles (YW, XL, QX, NC, MP), pp. 1–4.
DATE-2014-YehHN #power management: Leakage-power-aware clock period minimization (HHY, SHH, YTN), pp. 1–6.
SIGMOD-2014-IleanaCDK #constraints #query: Complete yet practical search for minimal query reformulations under constraints (II, BC, AD, YK), pp. 1015–1026.
SIGMOD-2014-PolychroniouSR #distributed #network: Track join: distributed joins with minimal network traffic (OP, RS, KAR), pp. 1483–1494.
VLDB-2014-ChesterTVW #set: Computing k-Regret Minimizing Sets (SC, AT, SV, SW), pp. 389–400.
VLDB-2015-LongWJ14 #fault: Trajectory Simplification: On Minimizing the Direction-based Error (CL, RCWW, HVJ), pp. 49–60.
AFL-2014-MalettiQ #automaton: Hyper-Minimization for Deterministic Weighted Tree Automata (AM, DQ), pp. 314–326.
CIAA-2014-Blanchet-SadriGS #automaton: Minimal Partial Languages and Automata (FBS, KG, AS), pp. 110–123.
DLT-2014-HolzerJ #automaton: Minimal and Hyper-Minimal Biautomata — (Extended Abstract) (MH, SJ), pp. 291–302.
LATA-2014-Gysel #algorithm #problem: Minimal Triangulation Algorithms for Perfect Phylogeny Problems (RG), pp. 421–432.
GRAPHITE-2014-BlancoBM: Entity-Linking via Graph-Distance Minimization (RB, PB, AM), pp. 30–43.
CIKM-2014-LvZ #feedback: Revisiting the Divergence Minimization Feedback Model (YL, CZ), pp. 1863–1866.
ICML-c1-2014-HsiehO: Nuclear Norm Minimization via Active Subspace Selection (CJH, PAO), pp. 575–583.
ICML-c1-2014-Shalev-Shwartz0 #coordination #probability: Accelerated Proximal Stochastic Dual Coordinate Ascent for Regularized Loss Minimization (SSS, TZ), pp. 64–72.
ICML-c2-2014-HonorioJ #consistency #framework: A Unified Framework for Consistency of Regularized Loss Minimizers (JH, TSJ), pp. 136–144.
ICML-c2-2014-SongGJMHD #learning #locality #on the: On learning to localize objects with minimal supervision (HOS, RBG, SJ, JM, ZH, TD), pp. 1611–1619.
ICML-c2-2014-WangNH #distance #learning #metric #robust: Robust Distance Metric Learning via Simultaneous L1-Norm Minimization and Maximization (HW, FN, HH), pp. 1836–1844.
ICML-c2-2014-YiCS #linear: Alternating Minimization for Mixed Linear Regression (XY, CC, SS), pp. 613–621.
ICPR-2014-HuangZLW #distance #feature model: A Method of Discriminative Information Preservation and In-Dimension Distance Minimization Method for Feature Selection (SH, JZ, XL, LW), pp. 1615–1620.
ICPR-2014-Kanatani #estimation #geometry #optimisation #statistics: Statistical Optimization for Geometric Estimation: Minimization vs. Non-minimization (KK), pp. 1–8.
ICPR-2014-LiuZH #energy #graph #optimisation: Improved Optimization Based on Graph Cuts for Discrete Energy Minimization (KL, JZ, KH), pp. 2424–2429.
KDD-2014-HasanKHT #adaptation: User effort minimization through adaptive diversification (MH, AK, VH, VJT), pp. 203–212.
KDD-2014-ZhangCSWZ #network #probability #set #social: Minimizing seed set selection with probabilistic coverage guarantee in a social network (PZ, WC, XS, YW, JZ), pp. 1306–1315.
KEOD-2014-BrucatoD #modelling #ontology #simulation: The Minimal Ontology Principle — Philosophical Foundations of OPM-based Modelling and Simulation (JB, DD), pp. 405–409.
KR-2014-Coste-MarquisKMM #on the: On the Revision of Argumentation Systems: Minimal Change of Arguments Statuses (SCM, SK, JGM, PM).
KR-2014-RibeiroW #logic: Minimal Change in AGM Revision for Non-Classical Logics (MMR, RW).
MLDM-2014-Manzanilla-SalazarEG #classification #clustering #fault: Minimizing Cluster Errors in LP-Based Nonlinear Classification (OMS, JEK, UMGP), pp. 163–174.
POPL-2014-DAntoniV #automaton: Minimization of symbolic automata (LD, MV), pp. 541–554.
SAC-2014-BertoutFO #automation #clustering #heuristic #realtime #set: A heuristic to minimize the cardinality of a real-time task set by automated task clustering (AB, JF, RO), pp. 1431–1436.
FSE-2014-Kasi #detection #scheduling: Minimizing software conflicts through proactive detection of conflicts and task scheduling (BKK), pp. 807–810.
HPCA-2014-AnsariMXT #energy #named #network: Tangle: Route-oriented dynamic voltage minimization for variation-afflicted, energy-efficient on-chip networks (AA, AKM, JX, JT), pp. 440–451.
HPCA-2014-ChenZWP #named #performance: MP3: Minimizing performance penalty for power-gating of Clos network-on-chip (LC, LZ, RW, TMP), pp. 296–307.
PPoPP-2014-DieguesR #lightweight #memory management #named #transaction: Time-warp: lightweight abort minimization in transactional memory (NLD, PR), pp. 167–178.
CAV-2014-BrazdilKKN #low cost: Minimizing Running Costs in Consumption Systems (TB, DK, AK, PN), pp. 457–472.
ICST-2014-AmmannDO #set: Establishing Theoretical Minimal Sets of Mutants (PA, MED, JO), pp. 21–30.
ICST-2014-LiGP #database #outsourcing: Sanitizing and Minimizing Databases for Software Application Test Outsourcing (BL, MG, DP), pp. 233–242.
ICTSS-2014-TurkerUY #adaptation #sequence: Lookahead-Based Approaches for Minimizing Adaptive Distinguishing Sequences (UCT, TÜ, HY), pp. 32–47.
IJCAR-2014-BeyersdorffC #complexity #proving #theorem proving: The Complexity of Theorem Proving in Circumscription and Minimal Entailment (OB, LC), pp. 403–417.
IJCAR-2014-PapacchiniS #generative #logic: Terminating Minimal Model Generation Procedures for Propositional Modal Logics (FP, RAS), pp. 381–395.
SAT-2014-LarrazORR #constraints #polynomial: Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions (DL, AO, ERC, AR), pp. 333–350.
ASE-2013-NejatiABHBC #cpu #embedded #risk management: Minimizing CPU time shortage risks in integrated embedded software (SN, MA, LCB, JH, JB, YC), pp. 529–539.
CASE-2013-LiJJ #algorithm #heuristic: A heuristic algorithm for minimizing total absolute deviation from distinct due dates on a single machine (YL, ZJ, WJ), pp. 392–397.
CASE-2013-SpensieriBC #coordination: Coordination of robot paths for cycle time minimization (DS, RB, JSC), pp. 522–527.
DATE-2013-Belov0MM #abstraction #satisfiability: Core minimization in SAT-based abstraction (AB, HC, AM, JMS), pp. 1411–1416.
DATE-2013-BernasconiCTV #using: Minimization of P-circuits using Boolean relations (AB, VC, GT, TV), pp. 996–1001.
DATE-2013-ChaG #approach #detection #effectiveness #metric: Trojan detection via delay measurements: a new approach to select paths and vectors to maximize effectiveness and minimize cost (BC, SKG), pp. 1265–1270.
DATE-2013-JoseNKM #adaptation #named: DeBAR: deflection based adaptive router with minimal buffering (JJ, BN, DKK, MM), pp. 1583–1588.
DATE-2013-LuZ #constraints #fault: Retiming for Soft Error Minimization Under Error-Latching Window Constraints (YL, HZ), pp. 1008–1013.
ICDAR-2013-TatawRK #clustering #using: Clustering of Symbols Using Minimal Description Length (OMT, TR, EJK), pp. 180–184.
SIGMOD-2013-TaoLX #algorithm #pipes and filters: Minimal MapReduce algorithms (YT, WL, XX), pp. 529–540.
TACAS-2013-EisentrautHST0 #automaton #probability: The Quest for Minimal Quotients for Probabilistic Automata (CE, HH, JS, AT, LZ), pp. 16–31.
SCAM-2013-Baca: Tracing with a minimal number of probes (DB), pp. 74–83.
STOC-2013-JainNS #matrix #rank #using: Low-rank matrix completion using alternating minimization (PJ, PN, SS), pp. 665–674.
STOC-2013-Thorup #independence #set #similarity: Bottom-k and priority sampling, set similarity and subset sums with minimal independence (MT), pp. 371–380.
CIAA-J-2012-JezM13 #automaton: Hyper-Minimization for Deterministic Tree Automata (AJ, AM), pp. 815–830.
DLT-J-2012-HolzerJ13 #automaton #equivalence #fault: From Equivalence to Almost-Equivalence, and beyond: Minimizing Automata with Errors (MH, SJ), pp. 1083–1098.
CIAA-2013-HolzerJ #algorithm #robust: Brzozowski’s Minimization Algorithm — More Robust than Expected — (Extended Abstract) (MH, SJ), pp. 181–192.
ICALP-v1-2013-0002BFGK: Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines (SA, KB, TF, NG, AK), pp. 13–24.
ICALP-v1-2013-GolovachHKV #algorithm #incremental #polynomial #set: An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets (PAG, PH, DK, YV), pp. 485–496.
LATA-2013-BabaaliK #automaton #on the #product line: On the Construction of a Family of Automata That Are Generically Non-minimal (PB, CK), pp. 80–91.
LATA-2013-MerweFG #difference #symmetry: Counting Minimal Symmetric Difference NFAs (BvdM, MF, JG), pp. 419–430.
GT-VMT-2013-AlshanqitiHK #graph transformation #learning: Learning Minimal and Maximal Rules from Observations of Graph Transformations (AMA, RH, TAK).
CHI-2013-MentisT: Imaging the body: embodied vision in minimally invasive surgery (HMM, AST), pp. 1479–1488.
DUXU-CXC-2013-HassB #testing #usability: Usability Testing Medical Devices: A Practical Guide to Minimizing Risk and Maximizing Success (CH, DB), pp. 407–416.
DUXU-NTE-2013-Osen #design #gesture #interface: Minimal Yet Integral — Designing a Gestural Interface (MO), pp. 383–392.
HCI-UC-2013-AhnK #design #interface: Interface Design for Minimizing Loss of Context in In-situ Remote Robot Control (JgA, GJK), pp. 87–96.
ICEIS-v1-2013-CoutinhoPB #energy #scheduling: A Scheduling Strategy for Global Scientific Grids — Minimizing Simultaneously Time and Energy Consumption (FC, LLP, CTB), pp. 545–553.
CIKM-2013-BagdouriWLO #classification #towards: Towards minimizing the annotation cost of certified text classification (MB, WW, DDL, DWO), pp. 989–998.
ECIR-2013-MetrikovPA #consistency #nondeterminism #optimisation: Optimizing nDCG Gains by Minimizing Effect of Label Inconsistency (PM, VP, JAA), pp. 760–763.
ECIR-2013-MorenoD #clustering #image #interface #mobile #using #web: Using Text-Based Web Image Search Results Clustering to Minimize Mobile Devices Wasted Space-Interface (JGM, GD), pp. 532–544.
ICML-c2-2013-Tran-DinhKC #framework #graph #learning #matrix: A proximal Newton framework for composite minimization: Graph learning without Cholesky decompositions and matrix inversions (QTD, ATK, VC), pp. 271–279.
ICML-c3-2013-DembczynskiJKWH #approach #classification #multi #optimisation #plugin: Optimizing the F-Measure in Multi-Label Classification: Plug-in Rule Approach versus Structured Loss Minimization (KD, AJ, WK, WW, EH), pp. 1130–1138.
ICML-c3-2013-QiG #message passing: Message passing with l1 penalized KL minimization (YQ, YG), pp. 262–270.
ICML-c3-2013-WangK #algorithm #energy #performance: A Fast and Exact Energy Minimization Algorithm for Cycle MRFs (HW, DK), pp. 190–198.
OOPSLA-2013-ChoiNS #android #approximate #learning #testing #user interface: Guided GUI testing of android apps with minimal restart and approximate learning (WC, GCN, KS), pp. 623–640.
POPL-2013-MayrC #automaton: Advanced automata minimization (RM, LC), pp. 63–74.
SAC-2013-CostaFLAV #metaheuristic #optimisation #statistics: Optimization metaheuristics for minimizing variance in a real-world statistical application (EC, FF, ARL, HA, FMV), pp. 206–207.
ICSE-2013-BlueSTZ #testing: Interaction-based test-suite minimization (DB, IS, RTB, AZ), pp. 182–191.
ICSE-2013-KasiS #named #scheduling: Cassandra: proactive conflict minimization through optimized task scheduling (BKK, AS), pp. 732–741.
ICSE-2013-NelsonSDFK #named: Aluminum: principled scenario exploration through minimality (TN, SS, DJD, KF, SK), pp. 232–241.
CC-2013-BaranyK #heuristic: Optimal and Heuristic Global Code Motion for Minimal Spilling (GB, AK), pp. 21–40.
HPCA-2013-AgrawalJAT #multi #named: Refrint: Intelligent refresh to minimize power in on-chip multiprocessor cache hierarchies (AA, PJ, AA, JT), pp. 400–411.
HPCA-2013-LeeKH0 #power management: Skinflint DRAM system: Minimizing DRAM chip writes for low power (YL, SK, SH, JL), pp. 25–34.
LCTES-2013-BouakazT #data flow #graph #scheduling: Buffer minimization in earliest-deadline first scheduling of dataflow graphs (AB, JPT), pp. 133–142.
PPoPP-2013-WuZZJS #algorithm #analysis #complexity #design #gpu #memory management: Complexity analysis and algorithm design for reorganizing data to minimize non-coalesced memory accesses on GPU (BW, ZZ, EZZ, YJ, XS), pp. 57–68.
CAV-2013-Marques-SilvaJB #set: Minimal Sets over Monotone Predicates in Boolean Formulae (JMS, MJ, AB), pp. 592–607.
ICLP-J-2013-KaminskiSSV #logic #network: Minimal intervention strategies in logical signaling networks with ASP (RK, TS, AS, SV), pp. 675–690.
SAT-2013-IserST #modelling #satisfiability: Minimizing Models for Tseitin-Encoded SAT Instances (MI, CS, MT), pp. 224–232.
CASE-2012-NazeemR #algorithm #performance #resource management: An efficient algorithm for the enumeration of the minimal unsafe states in complex resource allocation systems (AN, SAR), pp. 686–693.
DAC-2012-FangC: Simultaneous flare level and flare variation minimization with dummification in EUVL (SYF, YWC), pp. 1179–1184.
DAC-2012-MirhoseiniPK #energy #memory management: Coding-based energy minimization for phase change memory (AM, MP, FK), pp. 68–76.
DAC-2012-Seok #design: Decoupling capacitor design strategy for minimizing supply noise of ultra low voltage circuits (MS), pp. 968–973.
DATE-2012-DoustiP #latency #quantum: Minimizing the latency of quantum circuits during mapping to the ion-trap circuit fabric (MJD, MP), pp. 840–843.
DATE-2012-RahmanS #power management: Post-synthesis leakage power minimization (MR, CS), pp. 99–104.
DATE-2012-Shahid #estimation #performance: Cross entropy minimization for efficient estimation of SRAM failure rate (MAS), pp. 230–235.
DATE-2012-SheHMC #architecture #energy #scheduling: Scheduling for register file energy minimization in explicit datapath architectures (DS, YH, BM, HC), pp. 388–393.
SIGMOD-2012-NanongkaiLSM #interactive: Interactive regret minimization (DN, AL, ADS, KM), pp. 109–120.
VLDB-2012-ErdosILTB #multi #problem: The Filter-Placement Problem and its Application to Minimizing Information Multiplicity (DE, VI, AL, ET, AB), pp. 418–429.
FoSSaCS-2012-AdamekBHKMS #algebra: A Coalgebraic Perspective on Minimization and Determinization (JA, FB, MH, BK, SM, AS), pp. 58–73.
TACAS-2012-WimmerJABK #markov #modelling: Minimal Critical Subsystems for Discrete-Time Markov Models (RW, NJ, EÁ, BB, JPK), pp. 299–314.
AFL-J-2011-MalettiQ12: Unweighted and Weighted Hyper-Minimization (AM, DQ), pp. 1207–1226.
CIAA-2012-JezM #automaton: Hyper-minimization for Deterministic Tree Automata (AJ, AM), pp. 217–228.
CIAA-2012-JiraskovaM #complexity #on the: On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs (GJ, TM), pp. 229–239.
DLT-2012-HolzerJ #automaton #equivalence #fault: From Equivalence to Almost-Equivalence, and Beyond — Minimizing Automata with Errors — (Extended Abstract) (MH, SJ), pp. 190–201.
ICALP-v2-2012-Bar-YehudaKKR #communication: Growing Half-Balls: Minimizing Storage and Communication Costs in CDNs (RBY, EK, SK, DR), pp. 416–427.
ICALP-v2-2012-BrazdilKNW #markov #process #termination: Minimizing Expected Termination Time in One-Counter Markov Decision Processes (TB, AK, PN, DW), pp. 141–152.
ICALP-v2-2012-FominGNP #game studies #multi: Minimizing Rosenthal Potential in Multicast Games (FVF, PAG, JN, MP), pp. 525–536.
LATA-2012-AbdullaAS #automaton #low cost #problem #reachability: The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems (PAA, MFA, JS), pp. 58–69.
ICML-2012-Ben-DavidLSS #classification #fault #using: Minimizing The Misclassification Error Rate Using a Surrogate Convex Loss (SBD, DL, NS, KS), p. 16.
ICML-2012-HaiderS #clustering #graph #using: Finding Botnets Using Minimal Graph Clusterings (PH, TS), p. 37.
ICML-2012-OuyangG #probability: Stochastic Smoothing for Nonsmooth Minimizations: Accelerating SGD by Exploiting Structure (HO, AGG), p. 198.
ICML-2012-Petrik #approximate #bound #programming #robust: Approximate Dynamic Programming By Minimizing Distributionally Robust Bounds (MP), p. 207.
ICPR-2012-BurgessKA12a #estimation: Pose estimation from minimal dual-receiver configurations (SB, YK, KÅ), pp. 2553–2556.
ICPR-2012-ChauhanL #distance: Manhattan-Pyramid Distance: A solution to an anomaly in pyramid matching by minimization (AC, LSL), pp. 2668–2672.
ICPR-2012-ChernoffLN #fault #learning #metric: Metric learning by directly minimizing the k-NN training error (KC, ML, MN), pp. 1265–1268.
ICPR-2012-GhoseMOMLFVCSM12a #3d #energy #framework #graph #learning #probability #segmentation: Graph cut energy minimization in a probabilistic learning framework for 3D prostate segmentation in MRI (SG, JM, AO, RM, XL, JF, JCV, JC, DS, FM), pp. 125–128.
ICPR-2012-HinoWM #slicing: Sliced inverse regression with conditional entropy minimization (HH, KW, NM), pp. 1185–1188.
ICPR-2012-LiuW12a #feature model #kernel: Unsupervised discriminative feature selection in a kernel space via L2, 1-norm minimization (YL, YW), pp. 1205–1208.
ICPR-2012-WeiY #representation #segmentation: Subspace segmentation with a Minimal Squared Frobenius Norm Representation (SW, YY), pp. 3509–3512.
KDD-2012-Holada #low cost: Maximizing return and minimizing cost with the right decision management systems (RH), p. 407.
KDD-2012-LiZ: Sampling minimal frequent boolean (DNF) patterns (GL, MJZ), pp. 87–95.
KDD-2012-XiangZSY #rank: Optimal exact least squares rank minimization (SX, YZ, XS, JY), pp. 480–488.
KR-2012-LacknerP #algorithm #modelling #parametricity: Fixed-Parameter Algorithms for Finding Minimal Models (ML, AP).
MLDM-2012-LiHO #approach #correlation #mining: Top-N Minimization Approach for Indicative Correlation Change Mining (AL, MH, YO), pp. 102–116.
SEKE-2012-LuZZBA #decidability #invariant #petri net: Decidability of Minimal Supports of S-invariants and the Computation of their Supported S-invariants of Petri Nets (FL, QZ, HZ, YB, JA), pp. 340–345.
TOOLS-EUROPE-J-2011-IngesmanE12 #calculus #java #morphism #polymorphism: Lifted Java: A Minimal Calculus for Translation Polymorphism (MDI, EE), pp. 1–23.
PPoPP-2012-SackG #algorithm #communication #performance: Faster topology-aware collective algorithms through non-minimal communication (PS, WG), pp. 45–54.
ICST-2012-LiLO #algorithm #cost analysis: Better Algorithms to Minimize the Cost of Test Paths (NL, FL, JO), pp. 280–289.
SAT-2012-KullmannZ #on the #reduction #satisfiability: On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets (OK, XZ), pp. 270–283.
CASE-2011-WangZW #petri net: Extracting all minimal siphons from maximal unmarked siphons in manufacturing-oriented Petri nets (SW, MZ, CW), pp. 399–404.
DAC-2011-BanY #layout #modelling #optimisation: Layout aware line-edge roughness modeling and poly optimization for leakage minimization (YB, JSY), pp. 447–452.
DAC-2011-ZhangDWT #composition #detection #self: Self-aligned double patterning decomposition for overlay minimization and hot spot detection (HZ, YD, MDFW, ROT), pp. 71–76.
DATE-2011-HuangQ #constraints #energy #realtime: Leakage aware energy minimization for real-time systems under the maximum temperature constraint (HH, GQ), pp. 479–484.
DATE-2011-WilleKD #scalability: Determining the minimal number of lines for large reversible circuits (RW, OK, RD), pp. 1204–1207.
ICDAR-2011-HadjarI #generative #layout: Minimizing User Annotations in the Generation of Layout Ground-Truthed Data (KH, RI), pp. 703–707.
ICDAR-2011-VajdaJF #approach #learning: A Semi-supervised Ensemble Learning Approach for Character Labeling with Minimal Human Effort (SV, AJ, GAF), pp. 259–263.
ICDAR-2011-WakaharaY #invariant #recognition: Affine-Invariant Recognition of Handwritten Characters via Accelerated KL Divergence Minimization (TW, YY), pp. 1095–1099.
PODS-2011-AmsterdamerDMT #on the: On provenance minimization (YA, DD, TM, VT), pp. 141–152.
PODS-2011-KimelfeldS #constraints: Finding a minimal tree pattern under neighborhood constraints (BK, YS), pp. 235–246.
ESOP-2011-FournetP #compilation #data flow #security: Compiling Information-Flow Security to Minimal Trusted Computing Bases (CF, JP), pp. 216–235.
FoSSaCS-2011-HalamishK #automaton: Minimizing Deterministic Lattice Automata (SH, OK), pp. 199–213.
CIAA-J-2010-MalettiQ11: Optimal Hyper-Minimization (AM, DQ), pp. 1877–1891.
DLT-J-2010-FrieseSM11 #bottom-up #normalisation #transducer: Earliest Normal Form and Minimization for Bottom-up Tree Transducers (SF, HS, SM), pp. 1607–1623.
DLT-J-2010-Shur11 #on the: On the existence of Minimal β-powers (AMS), pp. 1683–1696.
AFL-2011-Maletti: Notes on Hyper-minimization (AM), pp. 34–49.
CIAA-2011-ChairungseeC #word: Building Phylogeny with Minimal Absent Words (SC, MC), pp. 100–109.
DLT-2011-KortelainenS #bound #context-free grammar: There Does Not Exist a Minimal Full Trio with Respect to Bounded Context-Free Languages (JK, TS), pp. 312–323.
DLT-2011-RestivoV #automaton: Some Remarks on Automata Minimality (AR, RV), pp. 15–27.
DLT-2011-RodaroS #automaton #problem: Never Minimal Automata and the Rainbow Bipartite Subgraph Problem (ER, PVS), pp. 374–385.
ICALP-v1-2011-NordstromR #on the #satisfiability #trade-off: On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution (JN, AAR), pp. 642–653.
GCM-2010-PlumpSS11 #automaton #finite #graph #source code: Minimizing Finite Automata with Graph Programs (DP, RS, AS).
ICML-2011-BradleyKBG #coordination #parallel: Parallel Coordinate Descent for L1-Regularized Loss Minimization (JKB, AK, DB, CG), pp. 321–328.
ICML-2011-JegelkaB #combinator #online: Online Submodular Minimization for Combinatorial Structures (SJ, JAB), pp. 345–352.
ICML-2011-KotlowskiDH #ranking: Bipartite Ranking through Minimization of Univariate Loss (WK, KD, EH), pp. 1113–1120.
ICML-2011-NaganoKA: Size-constrained Submodular Minimization through Minimum Norm Base (KN, YK, KA), pp. 977–984.
ICML-2011-NorouziF: Minimal Loss Hashing for Compact Binary Codes (MN, DJF), pp. 353–360.
ICML-2011-Shalev-ShwartzGS #constraints #rank #scalability: Large-Scale Convex Minimization with a Low-Rank Constraint (SSS, AG, OS), pp. 329–336.
KDD-2011-ChangR #convergence #linear #memory management #modelling #performance #scalability: Selective block minimization for faster convergence of limited memory large-scale linear models (KWC, DR), pp. 699–707.
KDD-2011-GleichL #rank: Rank aggregation via nuclear norm minimization (DFG, LHL), pp. 60–68.
KEOD-2011-AarnioSK #industrial #lightweight #semantics: A Lightweight Element Matching Method for Industrial Terminology Harmonization — Exploiting Minimal Semantics based on Naming Conventions (PA, SS, KK), pp. 390–395.
SIGIR-2011-KrikonK #ad hoc #feedback #retrieval: Utilizing minimal relevance feedback for ad hoc retrieval (EK, OK), pp. 1099–1100.
TOOLS-EUROPE-2011-IngesmanE #calculus #java #morphism #polymorphism: Lifted Java: A Minimal Calculus for Translation Polymorphism (MDI, EE), pp. 179–193.
PPDP-2011-ChristiansenS #polymorphism #strict: Minimally strict polymorphic functions (JC, DS), pp. 53–64.
PADL-2011-Christiansen #named #strict: Sloth — A Tool for Checking Minimal-Strictness (JC), pp. 160–174.
POPL-2011-LiangTN #abstraction #learning: Learning minimal abstractions (PL, OT, MN), pp. 31–42.
SAC-2011-BelcaidBHP #clustering #performance #using: Efficient clustering of populations using a minimal SNP panel (MB, KB, DH, GP), pp. 83–88.
ICLP-2011-WangS: Minimizing the overheads of dependent {AND}-parallelism (PW, ZS), pp. 128–138.
ISSTA-2011-BurgerZ: Minimizing reproduction of software failures (MB, AZ), pp. 221–231.
SAT-2011-BelovS #satisfiability: Minimally Unsatisfiable Boolean Circuits (AB, JPMS), pp. 145–158.
SAT-2011-RyvchinS #performance #satisfiability: Faster Extraction of High-Level Minimal Unsatisfiable Cores (VR, OS), pp. 174–187.
DAC-2010-KahngKKS #design #power management: Recovery-driven design: a power minimization methodology for error-tolerant processor modules (ABK, SK, RK, JS), pp. 825–830.
DAC-2010-YuP #clustering #manycore #memory management: Off-chip memory bandwidth minimization through cache partitioning for multi-core platforms (CY, PP), pp. 132–137.
DAC-2010-ZhangLR: Bayesian virtual probe: minimizing variation characterization cost for nanoscale IC technologies via Bayesian inference (WZ, XL, RAR), pp. 262–267.
DATE-2010-GarciaM #energy #named: Spinto: High-performance energy minimization in spin glasses (HJG, ILM), pp. 160–165.
DATE-2010-Yu: A memory- and time-efficient on-chip TCAM minimizer for IP lookup (HY), pp. 926–931.
VLDB-2010-CormodeLLS: Minimizing Minimality and Maximizing Utility: Analyzing Method-based attacks on Anonymized Data (GC, NL, TL, DS), pp. 1045–1056.
VLDB-2010-NanongkaiSLLX #database: Regret-Minimizing Representative Databases (DN, ADS, AL, RJL, J(X), pp. 1114–1124.
CIAA-2010-CastiglioneNS #algorithm #automaton #product line: A Challenging Family of Automata for Classical Minimization Algorithms (GC, CN, MS), pp. 251–260.
CIAA-2010-Egri-NagyN #finite #on the #word: On Straight Words and Minimal Permutators in Finite Transformation Semigroups (AEN, CLN), pp. 115–124.
CIAA-2010-Maletti #fault #performance: Better Hyper-minimization — Not as Fast, But Fewer Errors (AM), pp. 201–210.
DLT-2010-FrieseSM #bottom-up #transducer: Minimization of Deterministic Bottom-Up Tree Transducers (SF, HS, SM), pp. 185–196.
DLT-2010-RestivoV #automaton: Automata with Extremal Minimality Conditions (AR, RV), pp. 399–410.
DLT-2010-Shur #on the: On the Existence of Minimal β-Powers (AMS), pp. 411–422.
ICALP-v1-2010-BhattacharyaDMT #approximate #on the: On Approximate Horn Formula Minimization (AB, BD, DM, GT), pp. 438–450.
ICALP-v1-2010-JacobsCLM #complexity #on the: On the Complexity of Searching in Trees: Average-Case Minimization (TJ, FC, ESL, MM), pp. 527–539.
LATA-2010-Tamm #automaton: Some Minimality Results on Biresidual and Biseparable Automata (HT), pp. 573–584.
CIKM-2010-BatalH #classification #predict #using: Constructing classification features using minimal predictive patterns (IB, MH), pp. 869–878.
ICML-2010-Masnadi-ShiraziV #elicitation #probability: Risk minimization, probability elicitation, and cost-sensitive SVMs (HMS, NV), pp. 759–766.
ICML-2010-Scherrer #difference #fixpoint #perspective: Should one compute the Temporal Difference fix point or minimize the Bellman Residual? The unified oblique projection view (BS), pp. 959–966.
ICPR-2010-ChenSW #distance #geometry #linear #optimisation: Minimizing Geometric Distance by Iterative Linear Optimization (YC, JS, GW), pp. 1–4.
ICPR-2010-GassDN #energy #image #recognition: Constrained Energy Minimization for Matching-Based Image Recognition (TG, PD, HN), pp. 3304–3307.
ICPR-2010-LindbladSL #image: De-noising of SRµCT Fiber Images by Total Variation Minimization (JL, NS, TL), pp. 4621–4624.
ICPR-2010-XuHL #distance #reduction: Dimensionality Reduction by Minimal Distance Maximization (BX, KH, CLL), pp. 569–572.
KR-2010-KoniecznyGP #problem #taxonomy: Taxonomy of Improvement Operators and the Problem of Minimal Change (SK, MMG, RPP).
SAC-PL-J-2008-DennyM10 #algorithm #generative #lr #parsing: The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution (JED, BAM), pp. 943–979.
SAC-2010-GhoshS #constraints #design #energy #performance: Efficient mapping and voltage islanding technique for energy minimization in NoC under design constraints (PG, AS), pp. 535–541.
LDTA-2010-HoldermansH #on the #program transformation #type system: On the rôle of minimal typing derivations in type-driven program transformation (SH, JH), p. 2.
CGO-2010-WeiYYG #communication #pipes and filters #source code: Minimizing communication in rate-optimal software pipelining for stream programs (HW, JY, HY, GRG), pp. 210–217.
LCTES-2010-LiXLZ #analysis #approximate #architecture #memory management: Analysis and approximation for bank selection instruction minimization on partitioned memory architecture (ML, CJX, TL, YZ), pp. 1–8.
OSDI-2010-MahajanSLCADW #named #trust: Depot: Cloud Storage with Minimal Trust (PM, STVS, SL, AC, LA, MD, MW), pp. 307–322.
SAT-2010-Cotton #proving: Two Techniques for Minimizing Resolution Proofs (SC), pp. 306–312.
SAT-2010-MatthewsP #satisfiability: Uniquely Satisfiable k-SAT Instances with Almost Minimal Occurrences of Each Variable (WM, RP), pp. 369–374.
CASE-2009-LiQW #parallel #scheduling: ACO-based scheduling of parallel batch processing machines to minimize the total weighted tardiness (LL, FQ, QW), pp. 280–285.
DAC-2009-ChenCH #design #information retrieval #order: New spare cell design for IR drop minimization in Engineering Change Order (HTC, CCC, TH), pp. 402–407.
DAC-2009-JangK: Simultaneous clock buffer sizing and polarity assignment for power/ground noise minimization (HJ, TK), pp. 794–799.
DAC-2009-VillenaS #automation #modelling #multi #named: ARMS — automatic residue-minimization based sampling for multi-point modeling techniques (JFV, LMS), pp. 951–956.
DATE-2009-BildBD #performance #using: Minimization of NBTI performance degradation using internal node control (DRB, GEB, RPD), pp. 148–153.
DATE-2009-DabiriVPS #energy #realtime: Energy minimization for real-time systems with non-convex and discrete operation modes (FD, AV, MP, MS), pp. 1416–1421.
DATE-2009-GhasemzadehJSJ #communication #network: Communication minimization for in-network processing in body sensor networks: A buffer assignment technique (HG, NJ, MS, RJ), pp. 358–363.
DATE-2009-Gomez-PradoRCGB #data flow #graph #hardware #implementation #optimisation: Optimizing data flow graphs to minimize hardware implementation (DGP, QR, MJC, JG, EB), pp. 117–122.
DATE-2009-ZhuSJ #architecture #cpu #hybrid #realtime #scheduling #streaming: Buffer minimization of real-time streaming applications scheduling on hybrid CPU/FPGA architectures (JZ, IS, AJ), pp. 1506–1511.
SIGMOD-2009-ZhangCPT #communication #maintenance: Minimizing the communication cost for continuous skyline maintenance (ZZ, RC, DP, AKHT), pp. 495–508.
VLDB-2009-LeeDCLZ #database #manycore #named: MCC-DB: Minimizing Cache Conflicts in Multi-core Processors for Databases (RL, XD, FC, QL, XZ), pp. 373–384.
ESOP-2009-BonchiM #algorithm #similarity: Minimization Algorithm for Symbolic Bisimilarity (FB, UM), pp. 267–284.
FoSSaCS-2009-AbdullaM #low cost #petri net #reachability: Minimal Cost Reachability/Coverability in Priced Timed Petri Nets (PAA, RM), pp. 348–363.
TACAS-2009-ChenFCTW #automaton #composition #learning #verification: Learning Minimal Separating DFA’s for Compositional Verification (YFC, AF, EMC, YKT, BYW), pp. 31–45.
WCRE-1999-AbdeenDSA99a #automation: Automatic Package Coupling and Cycle Minimization (HA, SD, HAS, IA), pp. 103–112.
STOC-2009-ChadhaGKM #algorithm: A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation (JSC, NG, AK, VNM), pp. 679–684.
STOC-2009-Even-DarMN #convergence #game studies #on the: On the convergence of regret minimization dynamics in concave games (EED, YM, UN), pp. 523–532.
STOC-2009-KarpinskiS #approximate #game studies #linear #problem: Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems (MK, WS), pp. 313–322.
STOC-2009-VassilevskaW: Finding, minimizing, and counting weighted subgraphs (VV, RW), pp. 455–464.
CIAA-J-2008-Badr09: Hyper-minimization in O(n²) (AB), pp. 735–746.
CIAA-2009-HolzerM #algorithm #automaton: An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton (MH, AM), pp. 4–13.
DLT-2009-MogaveroM #logic #quantifier: Branching-Time Temporal Logics with Minimal Model Quantifiers (FM, AM), pp. 396–409.
ICALP-v1-2009-AilonL #clustering #correlation #cost analysis #fault #problem: Correlation Clustering Revisited: The “True” Cost of Error Minimization Problems (NA, EL), pp. 24–36.
ICALP-v1-2009-LamLTTW #energy #performance: Sleep with Guilt and Work Faster to Minimize Flow Plus Energy (TWL, LKL, HFT, IKKT, PWHW), pp. 665–676.
ICALP-v2-2009-FanghanelKV #algorithm #latency #network: Improved Algorithms for Latency Minimization in Wireless Networks (AF, TK, BV), pp. 447–458.
LATA-2009-AfoninG #regular expression: Minimal Union-Free Decompositions of Regular Languages (SA, DG), pp. 83–92.
CIKM-2009-LongLVZT #adaptation #framework: A risk minimization framework for domain adaptation (BL, SL, SV, YZ, BLT), pp. 1347–1356.
CIKM-2009-WangYPL: Minimal common container of tree patterns (JW, JXY, CP, CL), pp. 1409–1412.
ICML-2009-FooDN #algorithm #learning #multi: A majorization-minimization algorithm for (multiple) hyperparameter learning (CSF, CBD, AYN), pp. 321–328.
ICML-2009-JiY: An accelerated gradient method for trace norm minimization (SJ, JY), pp. 457–464.
ICML-2009-MooijJPS #dependence #modelling: Regression by dependence minimization and its application to causal inference in additive noise models (JMM, DJ, JP, BS), pp. 745–752.
ICML-2009-Shalev-ShwartzT #probability: Stochastic methods for l1 regularized loss minimization (SSS, AT), pp. 929–936.
KDD-2009-Macskassy #empirical #graph #learning #metric #using: Using graph-based metrics with empirical risk minimization to speed up active learning on networked data (SAM), pp. 597–606.
ECOOP-2009-LagorioSZ #calculus #composition: Featherweight Jigsaw: A Minimal Core Calculus for Modular Composition of Classes (GL, MS, EZ), pp. 244–268.
OOPSLA-2009-TsafrirWBS #dependence #performance #source code: Minimizing dependencies within generic classes for faster and smaller programs (DT, RWW, DFB, BS), pp. 425–444.
ICSE-2009-HsuO #framework #named #testing: MINTS: A general framework and tool for supporting test-suite minimization (HYH, AO), pp. 419–429.
ASPLOS-2009-HofmannRW: Maximum benefit from a minimal HTM (OSH, CJR, EW), pp. 145–156.
LICS-2009-DurandHN #complexity: Trichotomy in the Complexity of Minimal Inference (AD, MH, GN), pp. 387–396.
SAT-2009-Gelder #proving: Improved Conflict-Clause Minimization Leads to Improved Propositional Proof Traces (AVG), pp. 141–146.
SAT-2009-SorenssonB: Minimizing Learned Clauses (NS, AB), pp. 237–243.
TLCA-2009-HerbelinZ #call-by #deduction #λ-calculus: An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in “Natural Deduction” Form (HH, SZ), pp. 142–156.
CASE-2008-Monch #heuristic #parallel: Heuristics to minimize total weighted tardiness of jobs on unrelated parallel machines (LM), pp. 572–577.
DAC-2008-AlkabaniMKP #variability: Input vector control for post-silicon leakage current minimization in the presence of manufacturing variability (YA, TM, FK, MP), pp. 606–609.
DATE-2008-FaruqueH #architecture #communication: Minimizing Virtual Channel Buffer for Routers in On-chip Communication Architectures (MAAF, JH), pp. 1238–1243.
DATE-2008-YoshidaF: Performance-Constrained Different Cell Count Minimization for Continuously-Sized Circuits (HY, MF), pp. 1099–1102.
SIGMOD-2008-ChenC #constraints #query: Minimization of tree pattern queries with constraints (DC, CYC), pp. 609–622.
STOC-2008-BlumHLR: Regret minimization and the price of total anarchy (AB, MH, KL, AR), pp. 373–382.
STOC-2008-Racke #network: Optimal hierarchical decompositions for congestion minimization in networks (HR), pp. 255–264.
DLT-J-2007-JirasekJS08 #automaton #finite #nondeterminism: Deterministic blow-UPS of Minimal Nondeterministic Finite Automata over a Fixed Alphabet (JJ, GJ, AS), pp. 617–631.
DLT-J-2007-Tamm08 #automaton #on the: On Transition Minimality of Bideterministic Automata (HT), pp. 677–690.
AFL-2008-GeffertBS #automaton: Hyper-Minimizing Minimized Deterministic Automata (VG, AB, IS), pp. 9–30.
CIAA-2008-Badr: Hyper-Minimization in O(n2) (AB), pp. 223–231.
CIAA-2008-ChamparnaudDJ #automaton #geometry #regular expression #testing: Testing Whether a Binary and Prolongeable Regular Language LIs Geometrical or Not on the Minimal Deterministic Automaton of Pref(L) (JMC, JPD, HJ), pp. 68–77.
CIAA-2008-PaunPR #question: Hopcroft’s Minimization Technique: Queues or Stacks? (AP, MP, ARP), pp. 78–91.
ICALP-A-2008-BuchfuhrerU #complexity: The Complexity of Boolean Formula Minimization (DB, CU), pp. 24–35.
ICALP-A-2008-GrecoS #game studies: Tree Projections: Hypergraph Games and Minimality (GG, FS), pp. 736–747.
ICALP-B-2008-BjorklundM #automaton #nondeterminism: The Tractability Frontier for NFA Minimization (HB, WM), pp. 27–38.
LATA-2008-Maletti #automaton: Minimizing Deterministic Weighted Tree Automata (AM), pp. 357–372.
FM-2008-TorlakCJ #declarative #satisfiability #specification: Finding Minimal Unsatisfiable Cores of Declarative Specifications (ET, FSHC, DJ), pp. 326–341.
SEFM-2008-EdelkampS #ltl #model checking: Flash-Efficient LTL Model Checking with Minimal Counterexamples (SE, DS), pp. 73–82.
ICFP-2008-Krauss #data type #problem #recursion: Pattern minimization problems over recursive data types (AK), pp. 267–274.
ICML-2008-MekaJCD #learning #online #rank: Rank minimization via online learning (RM, PJ, CC, ISD), pp. 656–663.
ICML-2008-TakedaS: nu-support vector machine as conditional value-at-risk minimization (AT, MS), pp. 1056–1063.
ICML-2008-WangJC #graph: Graph transduction via alternating minimization (JW, TJ, SFC), pp. 1144–1151.
ICPR-2008-SukumarBPKA #locality #multi #nondeterminism #using: Uncertainty minimization in multi-sensor localization systems using model selection theory (SRS, HB, DLP, AK, MAA), pp. 1–4.
ICPR-2008-TarghiGZ #classification #image: Texture classification with minimal training images (ATT, JMG, AZ), pp. 1–4.
ICPR-2008-YangB #algorithm #fault #sketching #using: Curve fitting algorithm using iterative error minimization for sketch beautification (JY, HB), pp. 1–4.
KR-2008-HunterK #consistency #nondeterminism #set: Measuring Inconsistency through Minimal Inconsistent Sets (AH, SK), pp. 358–366.
KR-2008-Varzinczak: Action Theory Erasure and Minimal Change (IJV), pp. 651–661.
SEKE-2008-BiswasG #transaction: Minimal Observability for Transactional Hierarchical Services (DB, BG), pp. 531–536.
SAC-2008-BelliH #generative #testing: Test generation and minimization with “basic” statecharts (FB, AH), pp. 718–723.
SAC-2008-Chen #energy: Expected energy consumption minimization in DVS systems with discrete frequencies (JJC), pp. 1720–1725.
SAC-2008-PerngCK #configuration management #embedded #hardware: The minimization of hardware size in reconfigurable embedded platforms (NCP, JJC, TWK), pp. 1517–1522.
ASPLOS-2008-McCunePPRS #execution #how #recommendation: How low can you go?: recommendations for hardware-supported minimal TCB code execution (JMM, BP, AP, MKR, AS), pp. 14–25.
CC-2008-BondhugulaBKRRS #automation #locality #optimisation #parallel: Automatic Transformations for Communication-Minimized Parallelization and Locality Optimization in the Polyhedral Model (UB, MMB, SK, JR, AR, PS), pp. 132–146.
ASE-2007-LeitnerOZCM #performance #testing: Efficient unit test case minimization (AL, MO, AZ, IC, BM), pp. 417–420.
CASE-2007-JinBS #approach: A Consolidated Approach to Minimize Semiconductor Production Loss Due to Unscheduled ATE Downtime (TJ, FB, CHS), pp. 188–193.
CASE-2007-KobetskiRAF #behaviour: Minimization of Expected Cycle Time in Manufacturing Cells with Uncontrollable Behavior (AK, JR, KÅ, MF), pp. 14–19.
CASE-2007-SalernoZBLDGSPYBN #automation #design: Design Considerations for a Minimally Invasive High-Throughput Automation System for Radiation Biodosimetry (AS, JZ, AB, OVL, AD, GG, NS, GRP, YLY, DJB, JN), pp. 846–852.
DAC-2007-ChiouJCC #algorithm #fine-grained #power management: Fine-Grained Sleep Transistor Sizing Algorithm for Leakage Power Minimization (DSC, DCJ, YTC, SCC), pp. 81–86.
DAC-2007-HuangCCN: Clock Period Minimization with Minimum Delay Insertion (SHH, CHC, CMC, YTN), pp. 970–975.
DAC-2007-MalyLM #design: OPC-Free and Minimally Irregular IC Design Style (WM, YWL, MMS), pp. 954–957.
DAC-2007-SeomunKS: Skewed Flip-Flop Transformation for Minimizing Leakage in Sequential Circuits (JS, JK, YS), pp. 103–106.
DAC-2007-ShachamY #on the fly: On-The-Fly Resolve Trace Minimization (OS, KY), pp. 594–599.
DAC-2007-YeZL #optimisation #performance #power management #statistics #using: Statistical Leakage Power Minimization Using Fast Equi-Slack Shell Based Optimization (XY, YZ, PL), pp. 853–858.
DATE-2007-BolotinCGK: Routing table minimization for irregular mesh NoCs (EB, IC, RG, AK), pp. 942–947.
DATE-2007-JayakumarK #algorithm: An algorithm to minimize leakage through simultaneous input vector control and circuit modification (NJ, SPK), pp. 618–623.
DATE-2007-NiuQ #energy #interactive #realtime #scheduling: Interactive presentation: Peripheral-conscious scheduling on energy minimization for weakly hard real-time systems (LN, GQ), pp. 791–796.
DATE-2007-QiuXSS #embedded #energy #multi #realtime: Energy minimization with soft real-time and DVS for uniprocessor and multiprocessor embedded systems (MQ, CX, ZS, EHMS), pp. 1641–1646.
DATE-2007-RousseauMGMLDG #certification #configuration management #using: Enabling certification for dynamic partial reconfiguration using a minimal flow (BR, PM, DG, DM, JDL, FD, YG), pp. 983–988.
VLDB-2007-KochSS #evaluation #streaming #xquery: The GCX System: Dynamic Buffer Minimization in Streaming XQuery Evaluation (CK, SS, MS), pp. 1378–1381.
VLDB-2007-WongFWP #privacy: Minimality Attack in Privacy Preserving Data Publishing (RCWW, AWCF, KW, JP), pp. 543–554.
STOC-2007-Basu #combinator #complexity #geometry: Combinatorial complexity in O-minimal geometry (SB), pp. 47–56.
CIAA-J-2006-AbdullaHK07 #automaton #bisimulation: Bisimulation Minimization of Tree Automata (PAA, JH, LK), pp. 699–713.
CIAA-2007-CarrascoDF #automaton #implementation: An Implementation of Deterministic Tree Automata Minimization (RCC, JD, MLF), pp. 122–129.
DLT-2007-JirasekJS #automaton #finite #nondeterminism: Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet (JJ, GJ, AS), pp. 254–265.
DLT-2007-Tamm #automaton #on the: On Transition Minimality of Bideterministic Automata (HT), pp. 411–421.
LATA-2007-GruberH #automaton #complexity #finite #nondeterminism: Computational Complexity of NFA Minimization for Finite and Unary Languages (HG, MH), pp. 261–272.
CHI-2007-HalversonH #human-computer #interactive #predict #visual notation: A minimal model for predicting visual search in human-computer interaction (TH, AJH), pp. 431–434.
HCI-MIE-2007-KopparapuSR #concept #parsing: Minimal Parsing Key Concept Based Question Answering System (SKK, AS, PVSR), pp. 104–113.
HIMI-MTT-2007-ChonRL #adaptation: Converting Information Through a Complete and Minimal Unit Transcoder for QoS Adaptation (SC, DR, YL), pp. 594–603.
ICML-2007-ZhangC #analysis #component #independence: Nonlinear independent component analysis with minimal nonlinear distortion (KZ, LC), pp. 1127–1134.
KDD-2007-TeoSVL #composition #scalability: A scalable modular convex solver for regularized risk minimization (CHT, AJS, SVNV, QVL), pp. 727–736.
RE-2007-MaidenNKSG #requirements: Exploring Scenario Forms and Ways of Use to Discover Requirements on Airports that Minimize Environmental Impact (NAMM, CN, SK, NS, PG), pp. 29–38.
SPLC-2007-JepsenDB #migration #product line: Minimally Invasive Migration to Software Product Lines (HPJ, JGD, DB), pp. 203–211.
ICLP-2007-CabalarPV #logic programming #source code: Minimal Logic Programs (PC, DP, AV), pp. 104–118.
ASE-2006-SatohKU #diagrams #uml: Contradiction Finding and Minimal Recovery for UML Class Diagrams (KS, KK, TU), pp. 277–280.
CASE-2006-ChandrasekaranSPV #algorithm #optimisation #permutation #problem #scheduling: An Application of Particle Swarm Optimization Algorithm to Permutation Flowshop Scheduling Problems to Minimize Makespan, Total Flowtime and Completion Time Variance (SC, RKS, SGP, NV), pp. 513–518.
CASE-2006-PonnambalamSSG #algorithm #assembly #parallel #search-based: PARALLEL POPULATIONS GENETIC ALGORITHM FOR MINIMIZING ASSEMBLY VARIATION IN SELECTIVE ASSEMBLY (SGP, SSS, SS, MG), pp. 496–500.
DAC-2006-ChengC: Minimization for LED-backlit TFT-LCDs (WCC, CFC), pp. 608–611.
DAC-2006-HuangCNY: Register binding for clock period minimization (SHH, CHC, YTN, WCY), pp. 439–444.
DAC-2006-VattikondaWC #design #modelling #robust: Modeling and minimization of PMOS NBTI effect for robust nanometer design (RV, WW, YC), pp. 1047–1052.
DATE-2006-BernardiSSSR #cost analysis #effectiveness: An effective technique for minimizing the cost of processor software-based diagnosis in SoCs (PB, ES, MS, GS, MSR), pp. 412–417.
DATE-2006-BernasconiCDV #network #performance: Efficient minimization of fully testable 2-SPP networks (AB, VC, RD, TV), pp. 1300–1305.
DATE-2006-BudnikR #distributed #network #novel #power management #using: Minimizing ohmic loss and supply voltage variation using a novel distributed power supply network (MMB, KR), pp. 1116–1121.
DATE-2006-DililloRAG #process #reduction: Minimizing test power in SRAM through reduction of pre-charge activity (LD, PMR, BMAH, PG), pp. 1159–1164.
DATE-2006-GandhiM #energy #multi #using: Exploiting data-dependent slack using dynamic multi-VDD to minimize energy consumption in datapath circuits (KRG, NRM), pp. 1001–1006.
DATE-2006-IizukaIA #layout #optimisation: Timing-driven cell layout de-compaction for yield optimization by critical area minimization (TI, MI, KA), pp. 884–889.
STOC-2006-AndrewsZ #problem: Logarithmic hardness of the directed congestion minimization problem (MA, LZ), pp. 517–526.
STOC-2006-Feldman #approximate #learning #logic #query: Hardness of approximate two-level logic minimization and PAC learning with membership queries (VF), pp. 363–372.
STOC-2006-FellowsRRS #clique #np-hard: Clique-width minimization is NP-hard (MRF, FAR, UR, SS), pp. 354–362.
STOC-2006-GargK: Minimizing average flow time on related machines (NG, AK), pp. 730–738.
CIAA-2006-AbdullaKH #automaton #bisimulation: Bisimulation Minimization of Tree Automata (PAA, LK, JH), pp. 173–185.
CIAA-2006-ChengWC #analysis #bisimulation #branch #composition #on the fly: On-the-Fly Branching Bisimulation Minimization for Compositional Analysis (YPC, HYW, YRC), pp. 219–229.
ICALP-v1-2006-GargK #algorithm: Better Algorithms for Minimizing Average Flow-Time on Related Machines (NG, AK), pp. 181–190.
ICPR-v1-2006-BriassouliA #estimation #fault #fourier #segmentation: Spatial and Fourier Error Minimization for Motion Estimation and Segmentation (AB, NA), pp. 94–97.
ICPR-v3-2006-ChanL #algorithm #approximate #fault #multi #performance: Multiplierless Fast DCT Algorithms with Minimal Approximation Errors (RKWC, MCL), pp. 921–925.
ICPR-v3-2006-LiGYCG #feature model: Facial Feature Selection Based on SVMs by Regularized Risk Minimization (WL, WG, LY, WC, XG), pp. 540–543.
ICPR-v4-2006-WangJ #image #segmentation: Segmentation of the Left Ventricle from Cardiac MR Images Based on Degenerated Minimal Surface Diffusion and Shape Priors (YW, YJ), pp. 671–674.
KDD-2006-FormanKS #mining: Pragmatic text mining: minimizing human effort to quantify many issues in call logs (GF, EK, JS), pp. 852–861.
SIGIR-2006-CarteretteAS #evaluation #retrieval: Minimal test collections for retrieval evaluation (BC, JA, RKS), pp. 268–275.
LCTES-2006-ZhangP #mobile: Minimizing downtime in seamless migrations of mobile applications (KZ, SP), pp. 12–21.
PPoPP-2006-SpringerLRF #clustering #energy #execution #source code: Minimizing execution time in MPI programs on an energy-constrained, power-scalable cluster (RS, DKL, BR, VWF), pp. 230–238.
CAV-2006-JuvekarP #automaton: Minimizing Generalized Büchi Automata (SJ, NP), pp. 45–58.
LICS-2006-BouyerBC #hybrid: Control in o-minimal Hybrid Systems (PB, TB, FC), pp. 367–378.
SAT-2006-BuningZ #quantifier: Minimal False Quantified Boolean Formulas (HKB, XZ), pp. 339–352.
SAT-2006-DershowitzHN #algorithm #satisfiability #scalability: A Scalable Algorithm for Minimal Unsatisfiable Core Extraction (ND, ZH, AN), pp. 36–41.
SAT-2006-KullmannLM #agile #categorisation #kernel #normalisation #satisfiability: Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel (OK, IL, JMS), pp. 22–35.
TestCom-2006-BerradaCFS #bound #realtime #testing #using: Test Case Minimization for Real-Time Systems Using Timed Bound Traces (IB, RC, PF, AS), pp. 289–305.
ASE-2005-HennessyP #analysis #generative #grammarware #testing: An analysis of rule coverage as a criterion in generating minimal test suites for grammar-based software (MH, JFP), pp. 104–113.
DAC-2005-AhmadM #logic: TCAM enabled on-chip logic minimization (SA, RNM), pp. 678–683.
DAC-2005-BhardwajV #random: Leakage minimization of nano-scale circuits in the presence of systematic and random variations (SB, SBKV), pp. 541–546.
DAC-2005-LiQTWCH #approach #clustering #performance: Partitioning-based approach to fast on-chip decap budgeting and minimization (HL, ZQ, SXDT, LW, YC, XH), pp. 170–175.
DAC-2005-LuSHZCHH #navigation #network: Navigating registers in placement for clock network minimization (YL, CCNS, XH, QZ, YC, LH, JH), pp. 176–181.
DAC-2005-ManiDO #algorithm #constraints #performance #statistics: An efficient algorithm for statistical minimization of total power under timing yield constraints (MM, AD, MO), pp. 309–314.
DAC-2005-NiehHH: Minimizing peak current via opposite-phase clock tree (YTN, SHH, SYH), pp. 182–185.
DAC-2005-PengL #named #performance #power management #using: Freeze: engineering a fast repeater insertion solver for power minimization using the ellipsoid method (YP, XL), pp. 813–818.
DATE-2005-AndreiSEPH #constraints #energy #scalability: Quasi-Static Voltage Scaling for Energy Minimization with Time Constraints (AA, MTS, PE, ZP, BMAH), pp. 514–519.
DATE-2005-LaMeresK #encoding #induction: Encoding-Based Minimization of Inductive Cross-Talk for Off-Chip Data Transmission (BJL, SPK), pp. 1318–1323.
DATE-2005-ResanoMC #configuration management #hardware #heuristic #hybrid #runtime #scheduling: A Hybrid Prefetch Scheduling Heuristic to Minimize at Run-Time the Reconfiguration Overhead of Dynamically Reconfigurable Hardware (JR, DM, FC), pp. 106–111.
DATE-2005-ShenQL #algorithm #analysis #performance: A Faster Counterexample Minimization Algorithm Based on Refutation Analysis (SS, YQ, SL), pp. 672–677.
PASTE-2005-TallamG #algorithm #concept analysis #testing: A concept analysis inspired greedy algorithm for test suite minimization (ST, NG), pp. 35–42.
SCAM-2005-BinkleyDGHKK #slicing: Minimal Slicing and the Relationships Between Forms of Slicing (DB, SD, TG, MH, ÁK, BK), pp. 45–56.
STOC-2005-AndrewsZ05a #problem: Hardness of the undirected congestion minimization problem (MA, LZ), pp. 284–293.
CIAA-2005-AbdullaDKN #automaton #nondeterminism #scalability: Minimization of Non-deterministic Automata with Large Alphabets (PAA, JD, LK, MN), pp. 31–42.
CIAA-2005-CampeanuPS #algorithm #automaton #finite #incremental: An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata (CC, AP, JRS), pp. 90–103.
CIAA-2005-DaciukMS #automaton #incremental #pseudo: Incremental and Semi-incremental Construction of Pseudo-Minimal Automata (JD, DM, AS), pp. 341–342.
CIKM-2005-DaiS #documentation #retrieval #set: Minimal document set retrieval (WD, RKS), pp. 752–759.
ICML-2005-ChangK #learning: Hedged learning: regret-minimization with learning experts (YHC, LPK), pp. 121–128.
KDD-2005-GuhaH #data type #fault: Wavelet synopsis for data streams: minimizing non-euclidean error (SG, BH), pp. 88–97.
PADL-2005-BaileyS #constraints #satisfiability #set #using: Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization (JB, PJS), pp. 174–186.
SAC-2005-DalkilicS05a #classification #design #implementation #named: Circle: design and implementation of a classifier based on circuit minimization (MMD, AS), pp. 547–548.
ICLP-2005-MoralesCPH #automaton #generative #implementation #performance: A Generator of Efficient Abstract Machine Implementations and Its Application to Emulator Minimization (JFM, MC, GP, MVH), pp. 21–36.
LICS-2005-GodefroidH #logic #model checking #semantics: Model Checking Vs. Generalized Model Checking: Semantic Minimizations for Temporal Logics (PG, MH), pp. 158–167.
SAT-2005-LiffitonS #on the #satisfiability: On Finding All Minimally Unsatisfiable Subformulas (MHL, KAS), pp. 173–186.
SAT-2005-MneimnehLASS #algorithm #bound #satisfiability: A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas (MNM, IL, ZSA, JPMS, KAS), pp. 467–474.
VMCAI-2005-ShenQL #incremental #satisfiability: Minimizing Counterexample with Unit Core Extraction and Incremental SAT (SS, YQ, SL), pp. 298–312.
DAC-2004-LiRP #fault #generative #on the #testing: On test generation for transition faults with minimized peak power dissipation (WL, SMR, IP), pp. 504–509.
DAC-2004-LyuhK #energy #memory management #multi #scheduling: Memory access scheduling and binding considering energy minimization in multi-bank memory systems (CGL, TK), pp. 81–86.
DAC-2004-OhMASM #named #satisfiability: AMUSE: a minimally-unsatisfiable subformula extractor (YO, MNM, ZSA, KAS, ILM), pp. 518–523.
DAC-2004-ResanoM #configuration management #hardware #scheduling: Specific scheduling support to minimize the reconfiguration overhead of dynamically reconfigurable hardware (JR, DM), pp. 119–124.
DAC-2004-SrivastavaSB04a #power management #using: Power minimization using simultaneous gate sizing, dual-Vdd and dual-Vth assignment (AS, DS, DB), pp. 783–787.
DAC-2004-WangM #constraints #power management: Buffer sizing for clock power minimization subject to general skew constraints (KW, MMS), pp. 159–164.
DATE-v1-2004-ChengHP #concurrent #power management #scalability: Power Minimization in a Backlit TFT-LCD Display by Concurrent Brightness and Contrast Scaling (WCC, YH, MP), pp. 252–259.
DATE-v1-2004-KretzschmarNM #power management #why: Why Transition Coding for Power Minimization of On-Chip Buses Does Not Work (CK, AKN, DM), pp. 512–517.
DATE-v1-2004-LeeDBS #power management: Simultaneous State, Vt and Tox Assignment for Total Standby Power Minimization (DL, HD, DB, DS), pp. 494–499.
DATE-v1-2004-SinanogluO #power management: Scan Power Minimization through Stimulus and Response Transformations (OS, AO), pp. 404–409.
DATE-v2-2004-DengW #algorithm: Optimal Algorithm for Minimizing the Number of Twists in an On-Chip Bus (LD, MDFW), pp. 1104–1109.
DATE-v2-2004-LampropoulosAR #using: Minimization of Crosstalk Noise, Delay and Power Using a Modified Bus Invert Technique (ML, BMAH, PMR), pp. 1372–1373.
DATE-v2-2004-LiuWH #logic #synthesis: Crosstalk Minimization in Logic Synthesis for PLA (YYL, KHW, TH), pp. 790–795.
VLDB-2004-ChanFZ #query #xpath: Taming XPath Queries by Minimizing Wildcard Steps (CYC, WF, YZ), pp. 156–167.
VLDB-2004-KochSSS #data type #query #scheduling: Schema-based Scheduling of Event Processors and Buffer Minimization for Queries on Structured Data Streams (CK, SS, NS, BS), pp. 228–239.
VLDB-2004-LiHG #approach: High-Dimensional OLAP: A Minimal Cubing Approach (XL, JH, HG), pp. 528–539.
VLDB-2004-TajimaF #network #query #xpath: Answering XPath Queries over Networks by Sending Minimal Views (KT, YF), pp. 48–59.
TACAS-2004-RaviS #bound #model checking: Minimal Assignments for Bounded Model Checking (KR, FS), pp. 31–45.
STOC-2004-ChekuriGKK #multi #scheduling: Multi-processor scheduling to minimize flow time with epsilon resource augmentation (CC, AG, SK, AK), pp. 363–372.
STOC-2004-ChuzhoyN #scheduling: New hardness results for congestion minimization and machine scheduling (JC, JN), pp. 28–34.
CIAA-2004-BerstelC #algorithm #complexity #on the: On the Complexity of Hopcroft’s State Minimization Algorithm (JB, OC), pp. 35–44.
CIAA-2004-John #ambiguity: Minimal Unambiguous eNFA (SJ), pp. 190–201.
CIAA-2004-Polak #automaton #nondeterminism #using: Minimalizations of NFA Using the Universal Automaton (LP), pp. 325–326.
DLT-2004-Verlan: Tissue P Systems with Minimal Symport/Antiport (SV), pp. 418–430.
CHI-2004-BittonAK #named: RAW: conveying minimally-mediated impressions of everyday life with an audio-photographic tool (JB, SA, MK), pp. 495–502.
ICEIS-v3-2004-LopesPAM #distributed #requirements #specification: Distributed Requirements Specification: Minimizing the Effect of Geographic Dispersion (LL, RP, JLNA, AM), pp. 531–534.
ICML-2004-LingYWZ #low cost: Decision trees with minimal costs (CXL, QY, JW, SZ).
ICML-2004-ZhangKY #algorithm: Surrogate maximization/minimization algorithms for AdaBoost and the logistic regression model (ZZ, JTK, DYY).
ICPR-v1-2004-KangD #approximate #bound #classification #fault: Product Approximation by Minimizing the Upper Bound of Bayes Error Rate for Bayesian Combination of Classifiers (HJK, DSD), pp. 252–255.
ICPR-v2-2004-CorsoDH #energy #image #segmentation: Image Segmentation Through Energy Minimization Based Subspace Fusion (JJC, MD, GDH), pp. 120–123.
ICPR-v3-2004-ParedesV #fault #learning #nearest neighbour #prototype #reduction: Learning Prototypes and Distances (LPD). A Prototype Reduction Technique based on Nearest Neighbor Error Minimization (RP, EV), pp. 442–445.
ICPR-v3-2004-UsoPG #energy #image #novel #segmentation: A Novel Energy Minimization Criterion for Color Image Segmentation (AMU, FP, PGS), pp. 206–209.
SEKE-2004-LiLCWL #using: Extracting Minimal Non-Redundant Implication Rules by Using Quantized Closed Itemset Lattice (YL, ZL, WC, QW, WL), pp. 402–405.
SAC-2004-BaggioWE #scheduling #workflow: Applying scheduling techniques to minimize the number of late jobs in workflow systems (GB, JW, CAE), pp. 1396–1403.
SAC-2004-CugolaFMP #configuration management: Minimizing the reconfiguration overhead in content-based publish-subscribe (GC, DF, ALM, GPP), pp. 1134–1140.
DAC-2003-LeeKBS #analysis: Analysis and minimization techniques for total leakage considering gate oxide leakage (DL, WK, DB, DS), pp. 175–180.
DAC-2003-LyseckyV #logic: On-chip logic minimization (RLL, FV), pp. 334–337.
DAC-2003-MishchenkoS #composition #functional #scalability #using: Large-scale SOP minimization using decomposition and functional properties (AM, TS), pp. 149–154.
DATE-2003-EbendtGD #bound: Combination of Lower Bounds in Exact BDD Minimization (RE, WG, RD), pp. 10758–10763.
DATE-2003-GoelM #architecture #design: Layout-Driven SOC Test Architecture Design for Test Time and Wire Length Minimization (SKG, EJM), pp. 10738–10741.
DATE-2003-MolinaMH #hardware: High-Level Allocation to Minimize Internal Hardware Wastage (MCM, JMM, RH), pp. 10264–10269.
PODS-2003-ChirkovaL #query: Materializing views with minimal size to answer queries (RC, CL), pp. 38–48.
PODS-2003-HeerenJP #using: Optimal indexing using near-minimal space (CH, HVJ, LP), pp. 244–251.
SIGMOD-2003-BabcockBDM #data type #memory management #scheduling: Chain : Operator Scheduling for Memory Minimization in Data Stream Systems (BB, SB, MD, RM), pp. 253–264.
VLDB-2003-FlescaFM #on the #query #xpath: On the minimization of Xpath queries (SF, FF, EM), pp. 153–164.
WCRE-2003-AndritsosT #clustering: Software Clustering based on Information Loss Minimization (PA, VT), pp. 334–344.
STOC-2003-KleinbergL #consistency: Consistent load balancing via spread minimization (RDK, FTL), pp. 565–574.
CIAA-2003-Ravikumar #algorithm #automaton: Weak Minimization of DFA — An Algorithm and Applications (BR), pp. 226–238.
CIAA-2003-TammU #automaton #regular expression: Bideterministic Automata and Minimal Representations of Regular Languages (HT, EU), pp. 61–71.
CIAA-2003-XieLD #complexity #equation #linear #problem #using: New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations (GX, CL, ZD), pp. 163–175.
DLT-2003-Malcher #automaton #finite: Minimizing Finite Automata Is Computationally Hard (AM), pp. 386–397.
ICALP-2003-AriolaH #logic: Minimal Classical Logic and Control Operators (ZMA, HH), pp. 871–885.
ICALP-2003-Jagerskupper #algorithm #analysis: Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces (JJ), pp. 1068–1079.
ICML-2003-WuS #optimisation: New í-Support Vector Machines and their Sequential Minimal Optimization (XW, RKS), pp. 824–831.
KDD-2003-EtzioniTKY #mining: To buy or not to buy: mining airfare data to minimize ticket purchase price (OE, RT, CAK, AY), pp. 119–128.
PPDP-2003-BandaSW #satisfiability #set: Finding all minimal unsatisfiable subsets (MJGdlB, PJS, JW), pp. 32–43.
ICLP-2003-LoncT #modelling #set: Computing Minimal Models, Stable Models, and Answer Sets (ZL, MT), pp. 209–223.
DAC-2002-BernasconiCLP #logic #performance #symmetry: Fast three-level logic minimization based on autosymmetry (AB, VC, FL, LP), pp. 425–430.
DAC-2002-ZhangHC #energy #scheduling: Task scheduling and voltage selection for energy minimization (YZ, XH, DZC), pp. 183–188.
DATE-2002-BeniniBMM #embedded #energy: Hardware-Assisted Data Compression for Energy Minimization in Systems with Embedded Processors (LB, DB, AM, EM), pp. 449–453.
DATE-2002-GoorAC #fault: Minimal Test for Coupling Faults in Word-Oriented Memories (AJvdG, MSA, AC), pp. 944–948.
DATE-2002-LeeLFCH #problem: A New Formulation for SOC Floorplan Area Minimization Problem (CHL, YCL, WYF, CCC, TMH), p. 1100.
DATE-2002-LinLC #feedback #performance: An Efficient Test and Diagnosis Scheme for the Feedback Type of Analog Circuits with Minimal Added Circuits (JWL, CLL, JEC), p. 1119.
DATE-2002-MacchiaruloMP #energy: Wire Placement for Crosstalk Energy Minimization in Address Buses (LM, EM, MP), pp. 158–162.
SIGMOD-2002-ChangH #query: Minimal probing: supporting expensive predicates for top-k queries (KCCC, SwH), pp. 346–357.
SIGMOD-2002-Ramanan #algorithm #performance #query: Efficient algorithms for minimizing tree pattern queries (PR), pp. 299–309.
ITiCSE-2002-Scott #named #set: MISC: the minimal instruction set computer (KS), p. 223.
FoSSaCS-2002-FerrariMP #algebra #calculus: Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation (GLF, UM, MP), pp. 129–158.
CIAA-J-2000-CampeanuPY02 #algorithm #automaton #finite #performance: An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages (CC, AP, SY), pp. 83–97.
CIAA-2002-CampeanuP #automaton #finite #similarity: The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata (CC, AP), pp. 67–76.
CIAA-2002-Daciuk #algorithm #automaton #comparison #finite #set #string: Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings (JD), pp. 255–261.
CIAA-2002-Korner #automaton #finite #on the: On Minimizing Cover Automata for Finite Languages in O(n log n) Time (HK), pp. 117–127.
IFM-2002-JeskeB: Minimally and Maximally Abstract Retrenchments (CJ, RB), pp. 380–400.
ICPR-v4-2002-JainXHX #testing #using: Uniformity Testing Using Minimal Spanning Tree (AKJ, XX, TKH, FX), pp. 281–284.
LOPSTR-2002-Berghammer #set: A Generic Program for Minimal Subsets with Applications (RB), pp. 144–157.
CAV-2002-GurumurthyBS #simulation: Fair Simulation Minimization (SG, RB, FS), pp. 610–624.
LICS-2002-RepsLS #semantics: Semantic Minimization of 3-Valued Propositional Formulae (TWR, AL, SS), p. 40–?.
SAT-2002-Bruni #satisfiability: Exact selection of minimal unsatisfiable subformulae for special classes of propositional formulae (RB), p. 22.
SAT-2002-BueningX #complexity #morphism #satisfiability: The complexity of homomorphisms and renamings of minimal unsatisfiable formulas (HKB, DX), p. 9.
SAT-2002-ZhaoB #equivalence #problem: Extension and equivalence problems for clause minimal formulas (XZ, HKB), p. 43.
DAC-2001-ChangWM #logic #using: Layout-Driven Hot-Carrier Degradation Minimization Using Logic Restructuring Techniques (CWJC, KW, MMS), pp. 97–102.
DAC-2001-Ciriani #logic #using: Logic Minimization using Exclusive OR Gates (VC), pp. 115–120.
DAC-2001-MassoudKMW #analysis #difference #induction #modelling: Modeling and Analysis of Differential Signaling for Minimizing Inductive Cross-Talk (YM, JK, DM, JW), pp. 804–809.
DAC-2001-ParkK #representation #synthesis: Digital Filter Synthesis Based on Minimal Signed Digit Representation (ICP, HJK), pp. 468–473.
DAC-2001-SinghMM #latency: Latency and Latch Count Minimization in Wave Steered Circuits (AS, AM, MMS), pp. 383–388.
DAC-2001-TaylorDZ #energy #modelling: Modeling and Minimization of Interconnect Energy Dissipation in Nanometer Technologies (CNT, SD, YZ), pp. 754–757.
DATE-2001-NaiduJ #power management: Minimizing stand-by leakage power in static CMOS circuits (SRN, ETAFJ), pp. 370–376.
DATE-2001-PasseroneWL #generative #graph #scheduling: Generation of minimal size code for scheduling graphs (CP, YW, LL), pp. 668–673.
DATE-2001-YildizSV #bias #float #integer #linear #programming: Minimizing the number of floating bias voltage sources with integer linear programming (EY, AvS, CJMV), p. 816.
STOC-2001-BecchettiL #parallel #scheduling: Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines (LB, SL), pp. 94–103.
STOC-2001-CharikarP #clustering: Clustering to minimize the sum of cluster diameters (MC, RP), pp. 1–10.
STOC-2001-ChekuriKZ #algorithm: Algorithms for minimizing weighted flow time (CC, SK, AZ), pp. 84–93.
CIAA-2001-GranaBA #automaton #compilation #finite #scalability: Compilation Methods of Minimal Acyclic Finite-State Automata for Large Dictionaries (JG, FMB, MAA), pp. 135–148.
CIAA-2001-NedjahM #adaptation #automaton #pattern matching #performance #term rewriting: Minimal Adaptive Pattern-Matching Automata for Efficient Term Rewriting (NN, LdMM), pp. 221–233.
DLT-2001-DomaratzkiSY #formal method: Minimal Covers of Formal Languages (MD, JS, SY), pp. 319–329.
ICALP-2001-BorosEGKM #generative #integer #linear #on the: On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities (EB, KME, VG, LK, KM), pp. 92–103.
ICALP-2001-ChekuriK: A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines (CC, SK), pp. 848–861.
ICALP-2001-ChrobakCINSW #multi #problem #scheduling: The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts (MC, JC, CI, JN, JS, GJW), pp. 862–874.
ICALP-2001-FishkinJP #multi #on the: On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates (AVF, KJ, LP), pp. 875–886.
ICALP-2001-ShankarKSR: Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct (PS, PNAK, HS, BSR), pp. 627–638.
SIGIR-2001-LaffertyZ #documentation #information retrieval #modelling #query: Document Language Models, Query Models, and Risk Minimization for Information Retrieval (JDL, CZ), pp. 111–119.
CSL-2001-AbramskyL #modelling #λ-calculus: Fully Complete Minimal PER Models for the Simply Typed λ-Calculus (SA, ML), pp. 443–457.
DAC-2000-GebotysGW #architecture #power management: Power minimization derived from architectural-usage of VLIW processors (CHG, RJG, SW), pp. 308–311.
DAC-2000-KimNK #logic #synthesis: Domino logic synthesis minimizing crosstalk (KWK, UN, SMK), pp. 280–285.
DAC-2000-RaoN #power management #using: Power minimization using control generated clocks (MSR, SKN), pp. 794–799.
DATE-2000-BouraiS #layout #optimisation: Layout Compaction for Yield Optimization via Critical Area Minimization (YB, CJRS), pp. 122–125.
DATE-2000-CiricYS #implementation #logic #using: Delay Minimization and Technology Mapping of Two-Level Structures and Implementation Using Clock-Delayed Domino Logic (JC, GY, CS), pp. 277–282.
DATE-2000-GaoW #using: Wire-Sizing for Delay Minimization and Ringing Control Using Transmission Line Model (YG, DFW), pp. 512–516.
DATE-2000-LiuAW #constraints: Meeting Delay Constraints in DSM by Minimal Repeater Insertion (IML, AA, DFW), pp. 436–440.
DATE-2000-MunchWWMS #automation #power management: Automating RT-Level Operand Isolation to Minimize Power Consumption in Datapaths (MM, NW, BW, RM, JS), pp. 624–631.
DATE-2000-NicoliciA #clustering #multi #power management: Scan Latch Partitioning into Multiple Scan Chains for Power Minimization in Full Scan Sequential Circuits (NN, BMAH), pp. 715–722.
DATE-2000-SugiharaYD #analysis #approach: Analysis and Minimization of Test Time in a Combined BIST and External Test Approach (MS, HY, HD), pp. 134–140.
STOC-2000-FleischerI #algorithm: Improved algorithms for submodular function minimization and submodular flow (LF, SI), pp. 107–116.
STOC-2000-IwataFF #algorithm #combinator #polynomial: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions (SI, LF, SF), pp. 97–106.
STOC-2000-KabanetsC #problem: Circuit minimization problem (VK, JyC), pp. 73–79.
STOC-2000-Schulman #clustering: Clustering for edge-cost minimization (extended abstract) (LJS), pp. 547–555.
CIAA-2000-MihovM #transducer: Direct Construction of Minimal Acyclic Subsequential Transducers (SM, DM), pp. 217–229.
CIAA-2000-PaunSY #algorithm #automaton #finite: An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages (AP, NS, SY), pp. 243–251.
CIAA-2000-Watson #algorithm: Directly Constructing Minimal DFAs: Combining Two Algorithms by Brzozowski (BWW), pp. 311–317.
WLC-2000-MargolisPV #image #word: Words Guaranteeing Minimal Image (SWM, JÉP, MVV), pp. 297–310.
AdaEurope-2000-ChenL #on the #set: On the Minimal Essential Subsets and Minimal Representative Sets (TYC, MFL), pp. 291–301.
ICML-2000-ThollardDH #automaton #probability #using: Probabilistic DFA Inference using Kullback-Leibler Divergence and Minimality (FT, PD, CdlH), pp. 975–982.
ICPR-v2-2000-ShenIT #detection #energy: Detecting Reflection Axes by Energy Minimization (DS, HHSI, EKT), pp. 6026–6029.
ICPR-v3-2000-OukilS #algorithm #energy #markov #random: Markovian Random Fields Energy Minimization Algorithms (AO, AS), pp. 3522–3525.
KDD-2000-PadmanabhanT #set: Small is beautiful: discovering the minimal set of unexpected patterns (BP, AT), pp. 54–63.
LOPSTR-2000-Wilson #specification: A minimal specification language (WWW).
CADE-2000-BustanG #simulation: Simulation Based Minimization (DB, OG), pp. 255–270.
CADE-2000-HasegawaFK #branch #generative #performance #using: Efficient Minimal Model Generation Using Branching Lemmas (RH, HF, MK), pp. 184–199.
CL-2000-BastidePTSL #mining #using: Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets (YB, NP, RT, GS, LL), pp. 972–986.
DAC-1999-DrechslerG #bound #using: Using Lower Bounds During Dynamic BDD Minimization (RD, WG), pp. 29–32.
DAC-1999-SaxenaL #using: Crosstalk Minimization Using Wire Perturbations (PS, CLL), pp. 100–103.
DAC-1999-SirichotiyakulEOZDPB #power management: Stand-by Power Minimization Through Simultaneous Threshold Voltage Selection and Circuit Sizing (SS, TE, CO, JZ, AD, RP, DB), pp. 436–441.
DATE-1999-BeniniMMMPS #power management: Glitch Power Minimization by Gate Freezing (LB, GDM, AM, EM, MP, RS), pp. 163–167.
DATE-1999-GomesC #testing #using: Minimal Length Diagnostic Tests for Analog Circuits using Test History (AVG, AC), pp. 189–194.
DATE-1999-KaulV #clustering #design #latency #runtime: Temporal Partitioning combined with Design Space Exploration for Latency Minimization of Run-Time Reconfigured Designs (MK, RV), pp. 202–209.
DATE-1999-LiuPF: Minimizing Sensitivity to Delay Variations in High-Performance Synchronous Circuits (XL, MCP, EGF), pp. 643–649.
DATE-1999-NagC: Post-Placement Residual-Overlap Removal with Minimal Movement (SN, KC), pp. 581–586.
ICDAR-1999-KangL #classification #fault: Combining Classifiers based on Minimization of a Bayes Error Rate (HJK, SWL), pp. 398–401.
PODS-1999-DawsonVLS: Minimal Data Upgrading to Prevent Inference and Association (SD, SDCdV, PL, PS), pp. 114–125.
STOC-1999-AwerbuchALR #migration: Minimizing the Flow Time Without Migration (BA, YA, SL, OR), pp. 198–205.
STOC-1999-JansenSS #approximate #polynomial: Makespan Minimization in Job Shops: A Polynomial Time Approximation Scheme (KJ, RSO, MS), pp. 394–399.
STOC-1999-SkutellaW #parallel: A PTAS for Minimizing the Weighted Sum of Job Completion Times on Parallel Machines (MS, GJW), pp. 400–407.
WIA-1999-Watson #algorithm #automaton #finite #taxonomy: A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Finite Automata (BWW), pp. 174–182.
FM-v2-1999-Baumgarten #framework #specification: A Minimal Framework for Specification Theory (BB), p. 1861.
OOPSLA-1999-IgarashiPW #calculus #java: Featherweight Java: A Minimal Core Calculus for Java and GJ (AI, BCP, PW), pp. 132–146.
LCTES-1999-EcksteinK #low cost: Minimizing Cost of Local Variables Access for DSP-Processors (EE, AK), pp. 20–27.
IWTCS-1999-YevtushenkoCA #embedded #finite #nondeterminism #state machine #testing: Test Suite Minimization for Embedded Nondeterministic Finite State Machines (NY, ARC, RA), pp. 237–250.
DAC-1998-DrechslerDG #performance: Fast Exact Minimization of BDDs (RD, ND, WG), pp. 200–205.
DAC-1998-HongBLS #embedded: Don’t Care-Based BDD Minimization for Embedded Software (YH, PAB, LL, ES), pp. 506–509.
DAC-1998-LiH #embedded #energy #estimation #framework: A Framework for Estimation and Minimizing Energy Dissipation of Embedded HW/SW Systems (YL, JH), pp. 188–193.
DAC-1998-MassoudMBW #layout: Layout Techniques for Minimizing On-Chip Interconnect Self Inductance (YM, SSM, TB, JW), pp. 566–571.
DAC-1998-MurgaiFO #using: Using Complementation and Resequencing to Minimize Transitions (RM, MF, ALO), pp. 694–697.
DATE-1998-HorethD #diagrams: Dynamic Minimization of Word-Level Decision Diagrams (SH, RD), pp. 612–617.
DATE-1998-LuSJ: Technology Mapping for Minimizing Gate and Routing Area (AL, GS, FMJ), pp. 664–669.
DATE-1998-OhP: Gated Clock Routing Minimizing the Switched Capacitance (JO, MP), pp. 692–697.
DATE-1998-RuttenBEK #algorithm #divide and conquer #logic #performance: An Efficient Divide and Conquer Algorithm for Exact Hazard Free Logic Minimization (JWJMR, MRCMB, CAJvE, MAJK), pp. 749–754.
ICSM-1998-RothermelHOH #detection #empirical #fault #testing: An Empirical Study of the Effects of Minimization on the Fault Detection Capabilities of Test Suites (GR, MJH, JO, CH), pp. 34–43.
IWPC-1998-SomeL #compilation #parsing: Parsing Minimization when Extracting Information from Code in the Presence of Conditional Compilation (SSS, TCL), pp. 118–125.
STOC-1998-AlbersGL #parallel: Minimizing Stall Time in Single and Parallel Disk Systems (SA, NG, SL), pp. 454–462.
ICALP-1998-KaoW #fault #performance: Efficient Minimization of Numerical Summation Errors (MYK, JW), pp. 375–386.
ICALP-1998-LiuS #algorithm #fixpoint #linear: Simple Linear-Time Algorithms for Minimal Fixed Points (Extended Abstract) (XL, SAS), pp. 53–66.
WIA-1998-CampeanuSY #finite: Minimal Cover-Automata for Finite Languages (CC, NS, SY), pp. 43–56.
WIA-1998-Watson #algorithm #performance: A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs (BWW), pp. 121–132.
ICML-1998-BradleyM #feature model: Feature Selection via Concave Minimization and Support Vector Machines (PSB, OLM), pp. 82–90.
ICPR-1998-PalubinskasDK #clustering #using: An unsupervised clustering method using the entropy minimization (GP, XD, FK), pp. 1816–1818.
KR-1998-DohertyLM: The PMA and Relativizing Minimal Change for Action Update (PD, WL, EMB), pp. 258–269.
KR-1998-Thielscher #how: How (Not) To Minimize Events (MT), pp. 60–73.
CSL-1998-Buning #bound: An Upper Bound for Minimal Resolution Refutations (HKB), pp. 171–178.
IWTCS-1998-YevtushenkoCL #testing: Test Suite Minimization for Testing in Context (NY, ARC, LAPLJ), pp. 127–146.
RTA-1998-Schmidt-SchaussS #equation #on the: On the Exponent of Periodicity of Minimal Solutions of Context Equation (MSS, KUS), pp. 61–75.
ASE-1997-JilaniDFMM #adaptation #component: Retrieving Software Components that Minimize Adaptation Effort (LLJ, JD, MF, RM, AM), p. 255–?.
DAC-1997-ChangC #approach #multi #performance: An Efficient Approach to Multi-Layer Layer Assignment with Application to Via Minimization (CCC, JC), pp. 600–603.
DAC-1997-CongW #pipes and filters #synthesis: FPGA Synthesis with Retiming and Pipelining for Clock Period Minimization of Sequential Circuits (JC, CW), pp. 644–649.
DAC-1997-HongBBM #using: Safe BDD Minimization Using Don’t Cares (YH, PAB, JRB, KLM), pp. 208–213.
DAC-1997-PantDC #energy #logic #network #optimisation #power management #random: Device-Circuit Optimization for Minimal Energy and Power Consumption in CMOS Random Logic Networks (PP, VD, AC), pp. 403–408.
DAC-1997-WangG #testing: ATPG for Heat Dissipation Minimization During Scan Testing (SW, SKG), pp. 614–619.
EDTC-1997-Fishburn: Shaping a VLSI wire to minimize Elmore delay (JPF), pp. 244–251.
EDTC-1997-SchollMHM #symmetry: Minimizing ROBDD sizes of incompletely specified Boolean functionsby exploiting strong symmetries (CS, SM, GH, PM), pp. 229–234.
EDTC-1997-TurgisDPA #modelling: Internal power modelling and minimization in CMOS inverters (ST, JMD, JMP, DA), pp. 603–608.
PLDI-1997-BergnerDEO: Spill Code Minimization via Interference Region Spilling (PB, PD, DE, MTO), pp. 287–295.
PLDI-1997-TauraY #approach #compilation #effectiveness #implementation #multi #performance #thread: Fine-grain Multithreading with Minimal Compiler Support — A Cost Effective Approach to Implementing Efficient Multithreading Languages (KT, AY), pp. 320–333.
DLT-1997-CaludeCK #automaton #simulation: Deterministic Automata: Simulation, Universality and Minimality. Extended Abstract (CSC, EC, BK), pp. 519–537.
ICALP-1997-AlstrupHLT: Minimizing Diameters of Dynamic Trees (SA, JH, KdL, MT), pp. 270–280.
WIA-1997-LescowV #automaton #set: Minimal Separating Sets for Muller Automata (HL, JV), pp. 109–121.
WIA-1997-MaurelC #pseudo #transducer: Pseudo-minimal Transducers: A Transducer with Proper Elements (DM, LC), pp. 122–132.
WIA-1997-Ziadi #automaton #clustering #problem #set #sorting: Sorting and Doubling Techniques for Set Partitioning and Automata Minimization Problems (DZ), pp. 241–251.
AdaEurope-1997-DobbingR #ada #named #realtime #tool support: T-SMART — Task-Safe, Minimal Ada Realtime Toolset (BD, MRF), pp. 244–253.
KDD-1997-SiebesK #database #interactive #named: KESO: Minimizing Database Interaction (AS, MLK), pp. 247–250.
POPL-1997-LimL #parallel: Maximizing Parallelism and Minimizing Synchronization with Affine Transforms (AWL, MSL), pp. 201–214.
POPL-1997-Rehof #type system: Minimal Typings in Atomic Subtyping (JR), pp. 278–291.
CADE-1997-Slaney #logic #named #proving #theorem proving: Minlog: A Minimal Logic Theorem Prover (JKS), pp. 268–271.
DAC-1996-ChenH #algorithm #approximate #performance: Efficient Approximation Algorithms for Floorplan Area Minimization (DZC, XH), pp. 483–486.
DAC-1996-ThakurWK #composition #multi: Delay Minimal Decomposition of Multiplexers in Technology Mapping (ST, DFW, SK), pp. 254–257.
DAC-1996-TheobaldNW #heuristic #logic #named: Espresso-HF: A Heuristic Hazard-Free Minimizer for Two-Level Logic (MT, SMN, TW), pp. 71–76.
VLDB-1996-DiwanRSS #clustering: Clustering Techniques for Minimizing External Path Length (AAD, SR, SS, SS), pp. 342–353.
ESOP-1996-MontanariPY #equivalence #performance: Efficient Minimization up to Location Equivalence (UM, MP, DY), pp. 265–279.
STOC-1996-KellererTW: Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine (HK, TT, GJW), pp. 418–426.
STOC-1996-Milenkovic #linear #programming #strict #using: Translational Polygon Containment and Minimal Enclosure using Linear Programming Based Restriction (VM), pp. 109–118.
WIA-1996-Schubert #automaton #how #sorting: How to Use Sorting Procedures to Minimize DFA (BS), pp. 159–166.
KDD-1996-MannilaT #using: Discovering Generalized Episodes Using Minimal Occurrences (HM, HT), pp. 146–151.
KR-1996-BaralGP: Value Minimization in Circumscription (CB, AG, AP), pp. 474–481.
PLILP-1996-Kessler #graph #scheduling: Scheduling Expression DAGs for Minimal Register Need (CWK), pp. 228–242.
SAC-1996-MerkleGLGP #algorithm #energy #hybrid #search-based: Hybrid genetic algorithms for polypeptide energy minimization (LDM, RLG, GBL, GHGJ, RP), pp. 305–311.
DAC-1995-VaishnavP #logic: Minimizing the Routing Cost During Logic Extraction (HV, MP), pp. 70–75.
DAC-1995-WuL: Register Minimization beyond Sharing among Variables (TYW, YLL), pp. 164–169.
DAC-1995-YuguchiNWF #logic #multi: Multi-Level Logic Minimization Based on Multi-Signal Implications (MY, YN, KW, TF), pp. 658–662.
DLT-1995-Galvez #lr #parsing #stack: A Practical Small LR Parser with Action Decision Through Minimal Stack Suffix Scanning (JFG), pp. 460–465.
ICALP-1995-ParraS #graph #how: How to Use the Minimal Separators of a Graph for its Chordal Triangulation (AP, PS), pp. 123–134.
ICML-1995-KohaviJ #fault #parametricity: Autmatic Parameter Selection by Minimizing Estimated Error (RK, GHJ), pp. 304–312.
OOPSLA-1995-DriesenH: Minimizing Row Displacement Dispatch Tables (KD, UH), pp. 141–155.
PLILP-1995-Arenas-SanchezD #set #unification: Minimal Set Unification (PAS, AD), pp. 397–414.
ICSE-1995-WongHLM #detection #effectiveness #fault #testing: Effect of Test Set Minimization on Fault Detection Effectiveness (WEW, JRH, SL, APM), pp. 41–50.
DAC-1994-DagaB #composition #interface #state machine: The Minimization and Decomposition of Interface State Machines (AJD, WPB), pp. 120–125.
DAC-1994-KamVBS #algorithm: A Fully Implicit Algorithm for Exact State Minimization (TK, TV, RKB, ALSV), pp. 684–690.
DAC-1994-KolsonND #memory management #synthesis: Minimization of Memory Traffic in High-Level Synthesis (DJK, AN, NDD), pp. 149–154.
DAC-1994-KuznarBZ #clustering #multi: Multi-way Netlist Partitioning into Heterogeneous FPGAs and Minimization of Total Device Cost and Interconnect (RK, FB, BZ), pp. 238–243.
DAC-1994-LiuSC #clustering #data flow #latency: Data Flow Partitioning for Clock Period and Latency Minimization (LTL, MS, CKC), pp. 658–663.
DAC-1994-ShipleHSB #heuristic #using: Heuristic Minimization of BDDs Using Don’t Cares (TRS, RH, ALSV, RKB), pp. 225–231.
DAC-1994-VittalM #design #using: Minimal Delay Interconnect Design Using Alphabetic Trees (AV, MMS), pp. 392–396.
DAC-1994-ZhuW94a: Clock Skew Minimization During FPGA Placement (KZ, DFW), pp. 232–237.
EDAC-1994-ChangCM #multi: Minimizing ROBDD Size of Incompletely Specified Multiple Output Functions (SCC, DIC, MMS), pp. 620–624.
EDAC-1994-FranssenNSCM #control flow #optimisation #performance #simulation: Control flow optimization for fast system simulation and storage minimization (FHMF, LN, HS, FC, HDM), pp. 20–24.
EDAC-1994-WatanabeB #automaton #nondeterminism #pseudo: State Minimization of Pseudo Non-Deterministic FSM’s (YW, RKB), pp. 184–191.
STOC-1994-FeigeKN: A minimal model for secure computation (extended abstract) (UF, JK, MN), pp. 554–563.
CHI-1994-Oviatt94a #interface: Interface techniques for minimizing disfluent input to spoken language systems (SLO), pp. 205–210.
ICML-1994-MooreL #algorithm #fault #performance #validation: Efficient Algorithms for Minimizing Cross Validation Error (AWM, MSL), pp. 190–198.
KDD-1994-ApteH #generative #predict: Predicting Equity Returns from Securities Data with Minimal Rule Generation (CA, SJH), pp. 407–418.
KR-1994-Ben-EliyahuP #algorithm #modelling #performance #reasoning: Reasoning with Minimal Models: Efficient Algorithms and Applications (RBE, LP), pp. 39–50.
ALP-1994-JonesR #functional #graph #higher-order: Higher-Order Minimal Functional Graphs (NDJ, MR), pp. 242–252.
SAC-1994-Chen #learning: Application of Boolean expression minimization to learning via hierarchical generalization (JC), pp. 303–307.
SAC-1994-Rodriguez #architecture: A minimal TTL processor for architecture exploration (BJR), pp. 338–340.
CADE-1994-MullerW #composition #higher-order #theory and practice: Theory and Practice of Minimal Modular Higher-Order E-Unification (OM, FW), pp. 650–664.
DAC-1993-ChaiyakulGR: High-Level Transformations for Minimizing Syntactic Variances (VC, DG, LR), pp. 413–418.
DAC-1993-CoudertMF #logic: A New Viewpoint on Two-Level Logic Minimization (OC, JCM, HF), pp. 625–630.
DAC-1993-DharchoudhuryK #variability #worst-case: Performance-Constrained Worst-Case Variability Minimization of VLSI Circuits (AD, SMK), pp. 154–158.
DAC-1993-IqbalPDP #algebra #using: Critical Path Minimization Using Retiming and Algebraic Speed-Up (ZI, MP, SD, ACP), pp. 573–577.
DAC-1993-KajiharaPKR #effectiveness #fault #generative #logic #testing: Cost-Effective Generation of Minimal Test Sets for Stuck-at Faults in Combinational Logic Circuits (SK, IP, KK, SMR), pp. 102–106.
DAC-1993-KuznarBK #multi: Cost Minimization of Partitions into Multiple Devices (RK, FB, KK), pp. 315–320.
DAC-1993-McGeerSBS #logic #named: Espresso-Signature: A New Exact Minimizer for Logic Functions (PCM, JVS, RKB, ALSV), pp. 618–624.
DAC-1993-RajaramanW #clustering: Optimal Clustering for Delay Minimization (RR, DFW), pp. 309–314.
DAC-1993-Tokarnia: Minimal Shift Counters and Frequency Division (AMT), pp. 19–24.
DAC-1993-YaoCDNL #using: Cell-Based Hierarchical Pitchmatching Compaction Using Minimal LP (SZY, CKC, DD, SN, CYL), pp. 395–400.
PODS-1993-Schaerf #database: Negation and Minimality in Non-Horn Databases (MS), pp. 147–157.
STOC-1993-LundY #approximate #on the #problem: On the hardness of approximating minimization problems (CL, MY), pp. 286–293.
WSA-1993-Amtoft: Minimal Thunkification (TA), pp. 218–229.
ICALP-1993-Kann #approximate #bound #problem: Polynomially Bounded Minimization Problems which are Hard to Approximate (VK), pp. 52–63.
HCI-SHI-1993-RenM: The Minimal Sizes and the Quasi-Optimal Sizes for the Input Square During Pen-Input of Characters (XR, SM), pp. 1028–1033.
TOOLS-USA-1993-KatzMZC #integration: System Integration with Minimal Object Wrappers (MLK, TJM, RZ, DLC), pp. 31–42.
SAC-1993-Sen #low cost #probability #set #using: Minimal Cost Set Covering Using Probabilistic Methods (SS), pp. 157–164.
CAV-1993-YannakakisL #algorithm #performance #realtime: An Efficient Algorithm for Minimizing Real-time Transition Systems (MY, DL), pp. 210–224.
CSL-1993-GradelM #problem #random: Approximable Minimization Problems and Optimal Solutions on Random Inputs (EG, AM), pp. 139–149.
ICLP-1993-DiazC: A Minimal Extension of the WAM for clp(FD) (DD, PC), pp. 774–790.
DAC-1992-ChaudharyP #algorithm #constraints: A Near Optimal Algorithm for Technology Mapping Minimizing Area under Delay Constraints (KC, MP), pp. 492–498.
DAC-1992-Malik #multi #network #optimisation #using: Optimization of Primitive Gate Networks Using Multiple Output Two-Level Minimization (AAM), pp. 449–453.
DAC-1992-PuriG #algorithm #performance: An Efficient algorithm for Microword Length Minimization (RP, JG), pp. 651–656.
DAC-1992-SarabiP #canonical #network #performance: Fast Exact and Quasi-Minimal Minimization of Highly Testable Fixed-Polarity AND/XOR Canonical Networks (AS, MAP), pp. 30–35.
PODS-1992-Chan #query: Containment and Minimization of Positive Conjunctive Queries in OODB’s (EPFC), pp. 202–211.
STOC-1992-LeeY #online: Online Minimization of Transition Systems (Extended Abstract) (DL, MY), pp. 264–274.
WSA-1992-MycroftR #graph: Minimal Function Graphs are not Instrumented (AM, MR), pp. 60–67.
TRI-Ada-C-1992-Moore92a #ada #embedded #sql: Minimizing the Disadvantages of Embedded SQL/Ada (JWM), pp. 407–414.
KR-1992-RaimanK #maintenance: A Minimality Maintenance System (OR, JdK), pp. 532–538.
SIGIR-1992-FoxCH #algorithm #performance: A Faster Algorithm for Constructing Minimal Perfect Hash Functions (EAF, QFC, LSH), pp. 266–273.
LICS-1992-Schwarz #logic #semantics: Minimal Model Semantics for Nonmonotonic Modal Logics (GS), pp. 34–43.
DAC-1991-CaiW #on the: On Minimizing the Number of L-Shaped Channels (YC, DFW), pp. 328–334.
DAC-1991-DuttL #assembly #constraints #generative #on the: On Minimal Closure Constraint Generation for Symbolic Cell Assembly (DD, CYL), pp. 736–739.
DAC-1991-FangCFC #multi #problem: Constrained via Minimization with Practical Considerations for Multi-Layer VLSI/PCB Routing Problems (SCF, KEC, WSF, SJC), pp. 60–65.
DAC-1991-HuHB #pipes and filters: Minimizing the Number of Delay Buffers in the Synchronization of Pipelined Systems (XH, RGH, SCB), pp. 758–763.
DAC-1991-HussG #testing: Optimal Ordering of Analog Integrated Circuit Tests to Minimize Test Time (SDH, RSG), pp. 494–499.
DAC-1991-JoyC #multi: Placement for Clock Period Minimization With Multiple Wave Propagation (DAJ, MJC), pp. 640–643.
DAC-1991-MaziaszH: Exact Width and Height Minimization of CMOS Cells (RLM, JPH), pp. 487–493.
DAC-1991-SoeK #logic #using: Logic Minimization using Two-column Rectangle Replacement (SS, KK), pp. 470–473.
ICALP-1991-JiangR #automaton #nondeterminism #problem: Minimal NFA Problems Are Hard (TJ, BR), pp. 629–640.
ICALP-1991-LagergrenA #congruence #finite #using: Finding Minimal Forbidden Minors Using a Finite Congruence (JL, SA), pp. 532–543.
KDD-1991-Pednault #encoding #induction: Minimal-Length Encoding and Inductive Inference (EPDP), pp. 71–92.
ML-1991-ChienGD #learning #on the: On Becoming Decreasingly Reactive: Learning to Deliberate Minimally (SAC, MTG, GD), pp. 288–292.
ML-1991-OliveiraS #concept #learning #network: Learning Concepts by Synthesizing Minimal Threshold Gate Networks (ALO, ALSV), pp. 193–197.
ASPLOS-1991-CullerSSEW #automaton #hardware #parallel #thread: Fine-Grain Parallelism with Minimal Hardware Support: A Compiler-Controlled Threaded Abstract Machine (DEC, AS, KES, TvE, JW), pp. 164–175.
CAV-1991-FinkelP #composition #graph: Avoiding State Exposion by Composition of Minimal Covering Graphs (AF, LP), pp. 169–180.
CSL-1991-Schwichtenberg #proving: Minimal from Classical Proofs (HS), pp. 326–328.
LICS-1991-PacholskiS #higher-order #on the #similarity: On the 0-1 Law for the class of Existential Second Order Minimal Gödel Sentences with Equality (LP, WS), pp. 280–285.
RTA-1991-Pottier #algorithm #bound #linear: Minimal Solutions of Linear Diophantine Systems: Bounds and Algorithms (LP), pp. 162–173.
DAC-1990-AbouzeidSSP #multi #synthesis: Multilevel Synthesis Minimizing the Routing Factor (PA, KS, GS, FP), pp. 365–368.
DAC-1990-MalikBNS #logic #multi: Reduced Offsets for Two-Level Multi-Valued Logic Minimization (AAM, RKB, ARN, ALSV), pp. 290–296.
CHI-1990-Carroll #human-computer #infinity: Infinite detail and emulation in an ontologically minimized HCI (JMC), pp. 321–328.
CHI-1990-GongE #approach #design #documentation #evaluation #usability #using: Designing minimal documentation using a GOMS model: a usability evaluation of an engineering approach (RG, JE), pp. 99–107.
ML-1990-Velde #incremental #induction: Incremental Induction of Topologically Minimal Trees (WVdV), pp. 66–74.
SIGIR-1990-FoxCDH #information retrieval #order: Order Preserving Minimal Perfect Hash Functions and Information Retrieval (EAF, QFC, AMD, LSH), pp. 279–311.
CADE-1990-Tour: Minimizing the Number of Clauses by Renaming (TBdlT), pp. 558–572.
CAV-1990-BouajjaniFH #generative: Minimal Model Generation (AB, JCF, NH), pp. 197–203.
CAV-1990-GrafS #composition #finite: Compositional Minimization of Finite State Systems (SG, BS), pp. 186–196.
DAC-1989-ChengY #difference #fault #memory management #performance #simulation #using: Differential Fault Simulation — a Fast Method Using Minimal Memory (WTC, MLY), pp. 424–428.
DAC-1989-Coppola #algorithm #analysis #logic: New Methods in the Analysis of Logic Minimization Data and Algorithms (AJC), pp. 226–231.
DAC-1989-TheWC #layout: VIA Minimization by Layout Modification (KST, DFW, JC), pp. 799–802.
PLDI-1989-BernsteinGGKMNP #compilation #optimisation: Spill Code Minimization Techniques for Optimizing Compilers (DB, DQG, MCG, HK, YM, IN, RYP), pp. 258–263.
KR-1989-Geffner #reasoning: Default Reasoning, Minimality and Coherence (HG), pp. 137–148.
ML-1989-Segen #clustering #incremental #representation: Incremental Clustering by Minimizing Representation Length (JS), pp. 400–403.
OOPSLA-1989-Jerrell #automation #c++ #difference #using: Function Minimization and Automatic Differentiation Using C++ (MEJ), pp. 169–173.
NACLP-1989-Suchenek: A Syntactic Characterization of Minimal Entailment (MAS), pp. 81–91.
DAC-1988-ChengD: Improved Channel Routing by Via Minimization and Shifting (CKC, DND), pp. 677–680.
DAC-1988-HelliwellP #algorithm #multi #performance: A Fast Algorithm to Minimize Multi-Output Mixed-Polarity Generalized Reed-Muller Forms (MH, MAP), pp. 427–432.
DAC-1988-WeyC #named: PLAYGROUND: Minimization of PLAs with Mixed Ground True Outputs (CLW, TYC), pp. 421–426.
DAC-1988-XiongK #design #problem: The Constrained Via Minimization Problem for PCB and VLSI Design (XMX, ESK), pp. 573–578.
PODS-1988-YuR #database #version control: Minimizing Time-Space Cost For Database Version Control (LY, DJR), pp. 294–301.
PLDI-1988-Chow: Minimizing Register Usage Penalty at Procedure Calls (FCC), pp. 85–94.
CSL-1988-VoigtW: A Remark on Minimal Polynomials of Boolean Functions (BV, IW), pp. 372–383.
DAC-1987-GalivancheR #parallel: A Parallel PLA Minimization Program (RG, SMR), pp. 600–607.
DAC-1987-NaclerieMN: Via Minimization for Gridless Layouts (NJN, SM, KN), pp. 159–165.
DAC-1987-NguyenPG #named #performance: PALMINI — Fast Boolean Minimizer for Personal Computers (LBN, MAP, NBG), pp. 615–621.
PODS-1987-SegallW #communication #transaction: Transaction Commitment at Minimal Communication Cost (AS, OW), pp. 112–118.
ICALP-1987-Beauquier #automaton: Minimal Automaton of a Rational Cover (DB), pp. 174–189.
ICALP-1987-SchwartzS #on the #problem: On the Bivariate Function Minimization Problem And Its Applications to Motion Planning (JTS, MS), pp. 357–363.
LICS-1987-BidoitF #logic programming: Minimalism subsumes Default Logic and Circumscription in Stratified Logic Programming (NB, CF), pp. 89–97.
DAC-1986-ChangD #preprocessor #problem: A preprocessor for the via minimization problem (KCC, DHCD), pp. 702–707.
DAC-1986-LinA #bound #layout #named: Minplex — a compactor that minimizes the bounding rectangle and individual rectangles in a layout (SLL, JA), pp. 123–130.
PODS-1986-BidoitH #database #deduction: Positivism vs. Minimalism in Deductive Databases (NB, RH), pp. 123–132.
ICALP-1986-AverbuchWG #algorithm #classification #polynomial: Classification of all the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial (AA, SW, ZG), pp. 31–39.
POPL-1986-JonesM #analysis #data flow #graph #source code #using: Data Flow Analysis of Applicative Programs Using Minimal Function Graphs (NDJ, AM), pp. 296–306.
DAC-1985-AgrawalAB #multi: Multiple output minimization (PA, VDA, NNB), pp. 674–680.
DAC-1985-ChowdhuryB: The construction of minimal area power and ground nets for VLSI circuits (SUC, MAB), pp. 794–797.
DAC-1985-DagenaisAR #logic: The McBOOLE logic minimizer (MD, VKA, NCR), pp. 667–673.
DAC-1985-LaarhovenAD #algorithm #logic: PHIPLA-a new algorithm for logic minimization (PJMvL, EHLA, MD), pp. 739–743.
PODS-1985-AusielloDM #concept #graph #modelling #semantics: Chordality Properties on Graphs and Minimal Conceptual Connections in Semantic Data Models (GA, AD, MM), pp. 164–170.
STOC-1985-Feldman #fault tolerance #network: Fault Tolerance of Minimal Path Routings in a Network (PF), pp. 327–334.
DAC-1984-Biswas: Computer aided minimization procedure for boolean functions (NNB), pp. 699–702.
ICALP-1984-BlumerBEHM #automaton #linear #online #set #word: Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time (AB, JB, AE, DH, RMM), pp. 109–118.
DAC-1983-Litke: Minimizing PWB NC drilling (JDL), pp. 444–447.
DAC-1983-Schiele: Improved compaction by minimized length of wires (WLS), pp. 121–127.
STOC-1983-Turner #algorithm #analysis #probability: Probabilistic Analysis of Bandwidth Minimization Algorithms (JST), pp. 467–476.
ICALP-1983-MakedonS #linear: Minimizing Width in Linear Layouts (FM, IHS), pp. 478–490.
DAC-1982-TeelW #design #logic: A logic minimizer for VLSI PLA design (BT, DW), pp. 156–162.
PODS-1982-Hadzilacos #algorithm: An Algorithm for Minimizing Roll Back Cost (VH), pp. 93–97.
ICALP-1982-BergstraK #algebra #data type #parametricity #specification: Algebraic Specifications for Parametrized Data Types with Minimal Parameter and Target Algebras (JAB, JWK), pp. 23–34.
VLDB-1979-Reuter #database: Minimizing the I/O-Operations for Undo-Logging in Database Systems (AR0), pp. 164–172.
ICALP-1979-Janko: Hierarchic Index Sequential Search with Optimal Variable Block Size and Its Minimal Expected Number of Comparisons (WJ), pp. 304–315.
POPL-1977-BerryL #recursion #source code: Minimal and Optimal Computations of Recursive Programs (GB, JJL), pp. 215–226.
ICSE-1976-ParnasHW #design #operating system #product line #set #specification #system family: Design and Specification of the Minimal Subset of an Operating System Family (Abstract) (DLP, GH, HW), p. 123.
STOC-1974-Horvath #performance #sorting: Efficient Stable Sorting with Minimal Extra Space (ECH), pp. 194–215.
ICALP-1972-Kemp #estimation #lr #set: An Estimation of the Set of States of the Minimal LR(0)-Acceptor (RK), pp. 563–574.
DAC-1970-CorreiaCPS #design #interactive #logic #problem #testing: Minimizing the problem of logic testing by the interaction of a design group with user-oriented facilities (MC, DC, FP, TJS), pp. 100–107.
STOC-1969-Loveland #complexity #metric #on the: On Minimal-Program Complexity Measures (DWL), pp. 61–65.