BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
algorithm (51)
tree (33)
span (29)
time (29)
approxim (28)

Stem minimum$ (all stems)

216 papers:

DATEDATE-2015-Sharma #optimisation #power management
Minimum current consumption transition time optimization methodology for low power CTS (VS), pp. 412–416.
SIGMODSIGMOD-2015-HuangFL #graph
Minimum Spanning Trees in Temporal Graphs (SH, AWCF, RL), pp. 419–430.
SIGMODSIGMOD-2015-RuchanskyBGGK #problem
The Minimum Wiener Connector Problem (NR, FB, DGS, FG, NK), pp. 1587–1602.
VLDBVLDB-2015-AslayLB0L #social
Viral Marketing Meets Social Advertising: Ad Allocation with Minimum Regret (ÇA, WL, FB, AG, LVSL), pp. 822–833.
STOCSTOC-2015-KawarabayashiT #graph
Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time (KiK, MT), pp. 665–674.
ICALPICALP-v1-2015-MitchellPSW #algorithm
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains (JSBM, VP, MS, HW), pp. 947–959.
ICMLICML-2015-SunWKM #geometry #network
Information Geometry and Minimum Description Length Networks (KS, JW, AK, SMM), pp. 49–58.
CASECASE-2014-ChuKS #dependence #energy #grid #integration
Optimal integration of alternative energy sources in production systems for minimum grid dependency and outage risk (KCC, KK, KS), pp. 640–645.
STOCSTOC-2014-CyganLPPS #parametricity
Minimum bisection is fixed parameter tractable (MC, DL, MP, MP, SS), pp. 323–332.
DLTDLT-2014-ReinhardtY
The Minimum Amount of Useful Space: New Results and New Directions (KR, AY), pp. 315–326.
ICALPICALP-v2-2014-Ghaffari #approximate #distributed #set
Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set (MG), pp. 483–494.
ICPRICPR-2014-JinIHS #approach #using
A New Approach of Arc Skeletonization for Tree-like Objects Using Minimum Cost Path (DJ, KSI, EAH, PKS), pp. 942–947.
OOPSLAOOPSLA-2014-PavlinovicKW #fault
Finding minimum type error sources (ZP, TK, TW), pp. 525–542.
SACSAC-2014-SilveiraMGCFR #energy #performance
Faster seam carving with minimum energy windows (CLBS, FdOM, LGJ, CAdC, KF, RdRR), pp. 45–48.
ICLPICLP-J-2014-CharalambidisER #higher-order #logic programming #semantics
Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation (AC, , PR), pp. 725–737.
ICTSSICTSS-2014-DwarakanathJ #test coverage
Minimum Number of Test Paths for Prime Path and Other Structural Coverage Criteria (AD, AJ), pp. 63–79.
ICSTSAT-2014-IgnatievMM #independence #on the #satisfiability #set
On Reducing Maximum Independent Set to Minimum Satisfiability (AI, AM, JMS), pp. 103–120.
DACDAC-2013-LiuCHVNBP #design #energy #logic #physics
Minimum-energy state guided physical design for nanomagnet logic (SL, GC, XSH, EV, MTN, GHB, WP), p. 7.
DATEDATE-2013-TuHC
Co-synthesis of data paths and clock control paths for minimum-period clock gating (WPT, SHH, CHC), pp. 1831–1836.
ICDARICDAR-2013-ZhouTLW #markov #random #recognition #using
Minimum Risk Training for Handwritten Chinese/Japanese Text Recognition Using Semi-Markov Conditional Random Fields (XDZ, FT, CLL, HW), pp. 940–944.
VLDBVLDB-2013-LiKHYYS #clustering #memory management #performance #string
Memory Efficient Minimum Substring Partitioning (YL, PK, FH, SY, XY, SS), pp. 169–180.
ICALPICALP-v1-2013-MarxV #algorithm #parametricity
Fixed-Parameter Algorithms for Minimum Cost Edge-Connectivity Augmentation (DM, LAV), pp. 721–732.
HCIHIMI-D-2013-KoedaKN #estimation
Relative Position Calibration between Two Haptic Devices Based on Minimum Variance Estimation (MK, YK, HN), pp. 72–79.
CGOCGO-2013-LiHCZ0L #debugging #effectiveness #fault #locality #set
Effective fault localization based on minimum debugging frontier set (FL, WH, CC, LZ, XF, ZL), p. 10.
DATEDATE-2012-Brenner
VLSI legalization with minimum perturbation by iterative augmentation (UB), pp. 1385–1390.
STOCSTOC-2012-Vegh #algorithm #low cost #polynomial #problem
Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (LAV), pp. 27–40.
DLTDLT-J-2011-ChenYSLL12 #multi #network #set
Minimum Local Disk Cover Sets for Broadcasting in Heterogeneous Multihop Wireless Networks (GC, CWY, MTS, FCL, WCL), pp. 1147–1172.
ICALPICALP-v1-2012-ImNZ #latency
Minimum Latency Submodular Cover (SI, VN, RvdZ), pp. 485–497.
ICALPICALP-v1-2012-LaekhanukitGS #approach #problem
A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem (BL, SOG, MS), pp. 606–616.
ICPRICPR-2012-KarsnasSS #distance
The vectorial Minimum Barrier Distance (AK, RS, PKS), pp. 792–795.
KDDKDD-2012-LiuZW #set
Finding minimum representative pattern sets (GL, HZ, LW), pp. 51–59.
MLDMMLDM-2012-SapkotaBS #grammar inference #principle #using
Unsupervised Grammar Inference Using the Minimum Description Length Principle (US, BRB, APS), pp. 141–153.
SACSAC-2012-ChhelLGS #biology #multi #using
Minimum multiple characterization of biological data using partially defined boolean formulas (FC, FL, AG, FS), pp. 1399–1405.
SACSAC-2012-ShahidPO #bound
Minimum bounding boxes for regular cross-polytopes (SS, SP, CBO), pp. 879–884.
HPDCHPDC-2012-LiSBKS #in the cloud #named #pipes and filters
CAM: a topology aware minimum cost flow based resource manager for MapReduce applications in the cloud (ML, DS, ARB, AK, PS), pp. 211–222.
PPoPPPPoPP-2012-NobariCKB #parallel #scalability
Scalable parallel minimum spanning forest computation (SN, TTC, PK, SB), pp. 205–214.
CAVCAV-2012-DilligDMA #smt
Minimum Satisfying Assignments for SMT (ID, TD, KLM, AA), pp. 394–409.
ICSTICST-2012-GotliebHB #constraints #programming #using
Minimum Pairwise Coverage Using Constraint Programming Techniques (AG, AH, BB), pp. 773–774.
DACDAC-2011-FuketaIYTNSS #logic
A closed-form expression for estimating minimum operating voltage (VDDmin) of CMOS logic gates (HF, SI, TY, MT, MN, HS, TS), pp. 984–989.
DACDAC-2011-HuangY #algorithm
An exact algorithm for the construction of rectilinear Steiner minimum trees among complex obstacles (TH, EFYY), pp. 164–169.
DATEDATE-2011-NalamCAC
Dynamic write limited minimum operating voltage for nanoscale SRAMs (SN, VC, RCA, BHC), pp. 467–472.
ICALPICALP-v1-2011-AustrinK #distance #problem #reduction
A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem (PA, SK), pp. 474–485.
ICALPICALP-v1-2011-DingX #clustering #problem
Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere (HD, JX), pp. 773–784.
ICALPICALP-v1-2011-Laekhanukit #algorithm #approximate #low cost #set
An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity — (Extended Abstract) (BL), pp. 13–24.
CIKMCIKM-2011-CaoCS #graph #named
Skynets: searching for minimum trees in graphs with incomparable edge weights (HC, KSC, MLS), pp. 1775–1784.
ICMLICML-2011-NaganoKA
Size-constrained Submodular Minimization through Minimum Norm Base (KN, YK, KA), pp. 977–984.
ICMLICML-2011-Sohl-DicksteinBD #learning #probability
Minimum Probability Flow Learning (JSD, PB, MRD), pp. 905–912.
KDIRKDIR-2011-LiVM #graph #learning #relational #using #visual notation
Unsupervised Handwritten Graphical Symbol Learning — Using Minimum Description Length Principle on Relational Graph (JL, CVG, HM), pp. 172–178.
SACSAC-2011-Jamil #graph #query #unification #using
Computing subgraph isomorphic queries using structural unification and minimum graph structures (HMJ), pp. 1053–1058.
CIAACIAA-2010-GerbushH #approximate #sequence
Approximating Minimum Reset Sequences (MG, BH), pp. 154–162.
KDDKDD-2010-MarchRG #algorithm #analysis #performance
Fast euclidean minimum spanning tree: algorithm, analysis, and applications (WBM, PR, AGG), pp. 603–612.
SACSAC-2010-AlmeidaYA10a #principle #using
Filtering spams using the minimum description length principle (TAA, AY, JA), pp. 1854–1858.
DACDAC-2009-HuLA #approximate #polynomial
A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion (SH, ZL, CJA), pp. 424–429.
DACDAC-2009-JiangCCH #design #low cost
Matching-based minimum-cost spare cell selection for design changes (IHRJ, HYC, LGC, HBH), pp. 408–411.
ICDARICDAR-2009-WangH #classification #design #fault #modelling #parametricity #precise #using
Design Compact Recognizers of Handwritten Chinese Characters Using Precision Constrained Gaussian Models, Minimum Classification Error Training and Parameter Compression (YW, QH), pp. 36–40.
STOCSTOC-2009-ChengW #distance #problem #reduction
A deterministic reduction for the gap minimum distance problem: [extended abstract] (QC, DW), pp. 33–38.
ICALPICALP-v1-2009-DemaineLW #on the #query
On Cartesian Trees and Range Minimum Queries (EDD, GML, OW), pp. 341–353.
HCIHCD-2009-JonesND #information retrieval #set
Use of Nursing Management Minimum Data Set (NMMDS) for a Focused Information Retrieval (JFJ, ETN, CD), pp. 972–978.
SACSAC-2009-CaldersGPR #mining #process #using
Using minimum description length for process mining (TC, CWG, MP, AR), pp. 1451–1455.
PPoPPPPoPP-2009-KangB #algorithm #graph #memory management #performance #transaction
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs (SK, DAB), pp. 15–24.
STOCSTOC-2008-Thorup
Minimum k-way cuts via deterministic greedy tree packing (MT), pp. 159–166.
CSCWCSCW-2008-NakanishiMNI #matter #social
Minimum movement matters: impact of robot-mounted cameras on social telepresence (HN, YM, DN, HI), pp. 303–312.
CIKMCIKM-2008-RoyWDNM #database
Minimum-effort driven dynamic faceted search in structured databases (SBR, HW, GD, UN, MKM), pp. 13–22.
ICPRICPR-2008-HulkkonenH #detection #monitoring
A minimum description length principle based method for signal change detection in machine condition monitoring (JJH, JVH), pp. 1–4.
SACSAC-2008-ChengC #monitoring #named #programmable #thread
SoftMon: programmable software monitoring with minimum overhead by helper-threading (YPC, HSC), pp. 741–747.
SMTSMT-2007-RozanovS08 #constraints #generative #logic #similarity #transitive
Generating Minimum Transitivity Constraints in P-time for Deciding Equality Logic (MR, OS), pp. 3–17.
DACDAC-2007-HuangCCN
Clock Period Minimization with Minimum Delay Insertion (SHH, CHC, CMC, YTN), pp. 970–975.
DATEDATE-2007-KhanATE #algorithm #implementation #pipes and filters #sorting
A new pipelined implementation for minimum norm sorting used in square root algorithm for MIMO-VBLAST systems (ZK, TA, JST, ATE), pp. 1569–1574.
DATEDATE-2007-LataireVP #design #interactive #multi #optimisation #using
Interactive presentation: Optimizing analog filter designs for minimum nonlinear distortions using multisine excitations (JL, GV, RP), pp. 267–272.
DATEDATE-2007-WangC #energy #mobile #realtime
Minimum-energy LDPC decoder for real-time mobile application (WW, GC), pp. 343–348.
ICDARICDAR-2007-ZhangLS #fault #online #recognition
Minimum Error Discriminative Training for Radical-Based Online Chinese Handwriting Recognition (YZ, PL, FKS), pp. 53–57.
STOCSTOC-2007-SinghL #approximate #bound
Approximating minimum bounded degree spanning trees to within one of optimal (MS, LCL), pp. 661–670.
ICALPICALP-2007-BergerG #graph
Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs (AB, MG), pp. 90–101.
ICALPICALP-2007-BrihayeHPR #game studies #reachability
Minimum-Time Reachability in Timed Games (TB, TAH, VSP, JFR), pp. 825–837.
ICALPICALP-2007-CaragiannisFM #ad hoc #energy #exponential #heuristic #network
An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks (IC, MF, LM), pp. 447–458.
ICMLICML-2007-ChenJ #classification #feature model #set
Minimum reference set based feature selection for small sample classifications (XwC, JCJ), pp. 153–160.
KDDKDD-2007-GaoESCX #consistency #data mining #mining #problem #set
The minimum consistent subset cover problem and its applications in data mining (BJG, ME, JyC, OS, HX), pp. 310–319.
MLDMMLDM-2007-GrimH #analysis #category theory #clustering
Minimum Information Loss Cluster Analysis for Categorical Data (JG, JH), pp. 233–247.
ICSTSAT-2007-Buresh-OppenheimM #polynomial
Minimum 2CNF Resolution Refutations in Polynomial Time (JBO, DGM), pp. 300–313.
CASECASE-2006-ChenZY #multi #quality #research
Research of Multi-operation Quality Control based on Minimum Quality Loss (CC, LZ, YY), pp. 437–441.
DACDAC-2006-HuAHKLSS #algorithm #performance
Fast algorithms for slew constrained minimum cost buffering (SH, CJA, JH, SKK, ZL, WS, CCNS), pp. 308–313.
DACDAC-2006-SinghMPO #nondeterminism #runtime
Gain-based technology mapping for minimum runtime leakage under input vector uncertainty (AKS, MM, RP, MO), pp. 522–527.
DATEDATE-2006-PanditKMP #hardware #higher-order #synthesis
High level synthesis of higher order continuous time state variable filters with minimum sensitivity and hardware count (SP, SK, CAM, AP), pp. 1203–1204.
DocEngDocEng-2006-HurstMM
Minimum sized text containment shapes (NH, KM, PM), pp. 3–12.
STOCSTOC-2006-DevanurKSV #linear #problem
Integrality gaps for sparsest cut and minimum linear arrangement problems (NRD, SK, RS, NKV), pp. 537–546.
STOCSTOC-2006-RemyS #approximate
A quasi-polynomial time approximation scheme for minimum weight triangulation (JR, AS), pp. 316–325.
ICALPICALP-v1-2006-Fujito #algorithm #approximate #how
How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover (TF), pp. 431–442.
ICALPICALP-v1-2006-HariharanKM #algorithm #graph #performance
A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs (RH, TK, KM), pp. 250–261.
ICALPICALP-v1-2006-RaviS #algorithm #approximate
Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs (RR, MS), pp. 169–180.
ICPRICPR-v1-2006-KimK #classification #using
Simultaneous Classification and VisualWord Selection using Entropy-based Minimum Description Length (SK, ISK), pp. 650–653.
ICPRICPR-v3-2006-LiuZ
Minimum Enclosing and Maximum Excluding Machine for Pattern Description and Discrimination (YL, YFZ), pp. 129–132.
ICPRICPR-v3-2006-WangNC #approach #classification
A Minimum Sphere Covering Approach to Pattern Classification (JW, PN, LNC), pp. 433–436.
ICSTSAT-2006-Buresh-OppenheimM #satisfiability
Minimum Witnesses for Unsatisfiable 2CNFs (JBO, DGM), pp. 42–47.
DATEDATE-2005-Dubrova #kernel #testing
Structural Testing Based on Minimum Kernels (ED), pp. 1168–1173.
STOCSTOC-2005-FeigeHL #algorithm #approximate
Improved approximation algorithms for minimum-weight vertex separators (UF, MTH, JRL), pp. 563–572.
ICALPICALP-2005-Kavitha #algorithm #graph #random
An Õ(m2n) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph (TK), pp. 273–284.
SACSAC-2005-ZhouP #approach #data-driven #design #distance
Data driven approach to designing minimum hamming distance polychotomizer (JZ, GP), pp. 27–31.
STOCSTOC-2004-CzumajS #metric
Estimating the weight of metric minimum spanning trees in sublinear-time (AC, CS), pp. 175–183.
STOCSTOC-2004-Elkin #approximate #bound #distributed #problem #trade-off
Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem (ME), pp. 331–340.
ICALPICALP-2004-FominKT #algorithm #exponential
Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In (FVF, DK, IT), pp. 568–580.
ICALPICALP-2004-HalperinK #problem #set
The Minimum-Entropy Set Cover Problem (EH, RMK), pp. 733–744.
ICALPICALP-2004-JothiR #algorithm #approximate #design #network #problem
Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design (RJ, BR), pp. 805–818.
ICALPICALP-2004-KavithaMMP #algorithm #graph #performance
A Faster Algorithm for Minimum Cycle Basis of Graphs (TK, KM, DM, KEP), pp. 846–857.
CAiSECAiSE-2004-SebastianiGM #low cost #modelling #satisfiability
Simple and Minimum-Cost Satisfiability for Goal Models (RS, PG, JM), pp. 20–35.
ICPRICPR-v3-2004-WestphalW #performance #recognition
Fast Object and Pose Recognition Through Minimum Entropy Coding (GW, RPW), pp. 53–56.
ICPRICPR-v4-2004-LaiY #algorithm #fault #network #predict
Successive-Least-Squares Error Algorithm on Minimum Description Length Neural Networks for Time Series Prediction (YNL, SYY), pp. 609–612.
DATEDATE-2003-HuangCW #nondeterminism
Global Wire Bus Configuration with Minimum Delay Uncertainty (LDH, HMC, DFW), pp. 10050–10055.
ICALPICALP-2003-DeanG #algorithm #approximate #scheduling
Improved Approximation Algorithms for Minimum-Space Advertisement Scheduling (BCD, MXG), pp. 1138–1152.
ICMLICML-2003-KrishnapuramCJ #classification #documentation
Classification of Text Documents Based on Minimum System Entropy (RK, KPC, SJ), pp. 384–391.
SACSAC-2003-RaidlJ #algorithm #bound #heuristic #problem
Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem (GRR, BAJ), pp. 747–752.
ICLPICLP-2003-AbreuD #named
Objective: In Minimum Context (SA, DD), pp. 128–147.
DATEDATE-2002-QuanH #energy #scheduling
Minimum Energy Fixed-Priority Scheduling for Variable Voltage Processor (GQ, XH), pp. 782–787.
STOCSTOC-2002-CheriyanVV #algorithm #approximate #low cost
Approximation algorithms for minimum-cost k-vertex connected subgraphs (JC, SV, AV), pp. 306–312.
CAiSECAiSE-2002-LeeKL #data-driven #database #distance #performance #similarity
Efficient Similarity Search for Time Series Data Based on the Minimum Distance (SL, DK, SL), pp. 377–391.
ICMLICML-2002-ElomaaR #fault #performance
Fast Minimum Training Error Discretization (TE, JR), pp. 131–138.
ICPRICPR-v1-2002-ZhangD #classification #fault #recognition
Minimum Classification Error Training for Handwritten Character Recognition (RZ, XD), pp. 580–583.
ICPRICPR-v2-2002-GibsonCT #abstraction #modelling #using #visual notation
Visual Abstraction of Wildlife Footage Using Gaussian Mixture Models and the Minimum Description Length Criterion (DPG, NWC, BTT), pp. 814–817.
DATEDATE-2001-LiuWHL #diagrams
Binary decision diagram with minimum expected path length (YYL, KHW, TH, CLL), pp. 708–712.
ICALPICALP-2001-ChazelleRT #approximate #sublinear
Approximating the Minimum Spanning Tree Weight in Sublinear Time (BC, RR, LT), pp. 190–200.
ICEISICEIS-v1-2001-Rao #algorithm #clustering #multi
An Algorithm for Determining Subspaces Containing Clusters with Multiple Minimum Density Thresholds for Numerical Data (PRR), pp. 530–532.
UMLUML-2001-GenovaLM #multi #semantics #uml
Semantics of the Minimum Multiplicity in Ternary Associations in UML (GG, JL, PM), pp. 329–341.
DATEDATE-2000-Strolenberg
Stay Away from Minimum Design-Rule Values (CWHS), pp. 71–72.
STOCSTOC-2000-FeigeKN #approximate
Approximating the minimum bisection size (extended abstract) (UF, RK, KN), pp. 530–536.
STOCSTOC-2000-KonemannR #algorithm #approximate #bound #matter
A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees (JK, RR), pp. 537–546.
STOCSTOC-2000-Vygen #algorithm #on the
On dual minimum cost flow algorithms (extended abstract) (JV), pp. 117–125.
ICALPICALP-2000-PettieR #algorithm
An Optimal Minimum Spanning Tree Algorithm (SP, VR), pp. 49–60.
ICMLICML-2000-NomotoM #analysis #automation
Comparing the Minimum Description Length Principle and Boosting in the Automatic Analysis of Discourse (TN, YM), pp. 687–694.
ICPRICPR-v2-2000-KimK #estimation #graph #parametricity #random #recognition
Minimum Entropy Estimation of Hierarchical Random Graph Parameters for Character Recognition (HYK, JHK), pp. 6050–6053.
ICPRICPR-v2-2000-Sato #classification #fault #learning
A Learning Method for Definite Canonicalization Based on Minimum Classification Error (AS), pp. 2199–2202.
ICPRICPR-v2-2000-Theera-UmponG #fault #network
Training Neural Networks to Count White Blood Cells via a Minimum Counting Error Objective Function (NTU, PDG), pp. 2299–2302.
ICPRICPR-v3-2000-RuizMMRL #algorithm #multi
New Algorithm for Searching Minimum Bit Rate Wavelet Representations with Application to Multiresolution-Based Perceptual Audio Coding (NR, DM, RM, MR, FL), pp. 3290–3293.
ICPRICPR-v3-2000-WinkNV #heuristic #using
Minimum Cost Path Determination Using a Simple Heuristic Function (OW, WJN, MAV), pp. 7010–7013.
SACSAC-2000-RaidlJ #algorithm #problem #search-based
A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem (GRR, BAJ), pp. 440–445.
SACSAC-2000-WuL #clustering #fuzzy #named #network
F3MCNN: A Fuzzy Minimum Mean Maximum Clustering Neural Network (LGW, HL), pp. 10–14.
DATEDATE-1999-MartinezAQH #algorithm #encoding #using
An Algorithm for Face-Constrained Encoding of Symbols Using Minimum Code Length (MM, MJA, JMQ, JLH), pp. 521–525.
ICDARICDAR-1999-SuralD #algorithm #documentation #generative #image #parallel #segmentation
A Two-step Algorithm and its Parallelization for the Generation of Minimum Containing Rectangles for Document Image Segmentation (SS, PKD), pp. 173–176.
ITiCSEITiCSE-1999-Campos #distance #education #effectiveness #requirements
Minimum requirements for effective distance teaching systems (GLdC), p. 182.
STOCSTOC-1999-AroraK #approximate #latency #problem
Approximation Schemes for Minimum Latency Problems (SA, GK), pp. 688–693.
STOCSTOC-1999-KargerKSTY #algorithm #geometry #multi
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut (DRK, PNK, CS, MT, NEY), pp. 668–678.
STOCSTOC-1999-Wayne #algorithm #combinator #polynomial
A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow (KDW), pp. 11–18.
HCIHCI-EI-1999-Dzida #quality #requirements #testing
Developing Scenario-Based Requirements and Testing them for Minimum Quality (WD), pp. 1205–1208.
ICMLICML-1999-BlanzieriR #classification #metric #nearest neighbour
A Minimum Risk Metric for Nearest Neighbor Classification (EB, FR), pp. 22–31.
ICMLICML-1999-Harries
Boosting a Strong Learner: Evidence Against the Minimum Margin (MBH), pp. 171–180.
KDDKDD-1999-LiuHM99a #mining #multi
Mining Association Rules with Multiple Minimum Supports (BL, WH, YM), pp. 337–341.
STOCSTOC-1998-BlumKRV #problem
Semi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering Problems (AB, GK, RR, SV), pp. 100–105.
STOCSTOC-1998-HolmLT #algorithm
Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge, and Biconnectivity (JH, KdL, MT), pp. 79–89.
STOCSTOC-1998-NatanzonSS #algorithm #approximate #polynomial #problem
A Polynomial Approximation Algorithm for the Minimum Fill-In Problem (AN, RS, RS), pp. 41–47.
ICALPICALP-1998-CzumajL #approximate #polynomial
A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity (AC, AL), pp. 682–694.
ICALPICALP-1998-Peleg #distributed
Distributed Matroid Basis Completion via Elimination Upcast and Distributed Correction of Minimum-Weight Spanning Trees (DP), pp. 164–175.
ICALPICALP-1998-PelegR #approximate #communication
Deterministic Polylog Approximation for Minimum Communication Spanning Trees (DP, ER), pp. 670–681.
ICPRICPR-1998-Mizutani #classification #fault #learning
Discriminative learning for minimum error and minimum reject classification (HM), pp. 136–140.
SACSAC-1998-CappJ #algorithm #problem #search-based
A weight-coded genetic algorithm for the minimum weight triangulation problem (KC, BAJ), pp. 327–331.
DACDAC-1997-MaheshwariS #algorithm
An Improved Algorithm for Minimum-Area Retiming (NM, SSS), pp. 2–7.
STOCSTOC-1997-Vardy #algorithm #complexity #distance #problem
Algorithmic Complexity in Coding Theory and the Minimum Distance Problem (AV), pp. 92–109.
ICALPICALP-1997-Bar-NoyK #graph
The Minimum Color Sum of Bipartite Graphs (ABN, GK), pp. 738–748.
ICALPICALP-1997-HenzingerK #graph #maintenance
Maintaining Minimum Spanning Trees in Dynamic Graphs (MRH, VK), pp. 594–604.
TLCATLCA-1997-BerardiB #data type #functional
Minimum Information Code in a Pure Functional Language with Data Types (SB, LB), pp. 30–45.
STOCSTOC-1996-BenczurK #approximate
Approximating s-t Minimum Cuts in Õ(n2) Time (AAB, DRK), pp. 47–55.
STOCSTOC-1996-Karger
Minimum Cuts in Near-Linear Time (DRK), pp. 56–63.
ICALPICALP-1996-KloksKW #graph
Minimum Fill-In on Circle and Circular-Arc Graphs (TK, DK, CKW), pp. 256–267.
ICMLICML-1996-Suzuki #algorithm #learning #network #performance #using
Learning Bayesian Belief Networks Based on the Minimum Description Length Principle: An Efficient Algorithm Using the B & B Technique (JS), pp. 462–470.
ICPRICPR-1996-FredL #clustering
A minimum code length technique for clustering of syntactic patterns (ALNF, JMNL), pp. 680–684.
ICPRICPR-1996-Marchand-MailletS #analysis #approach #image
A minimum spanning tree approach to line image analysis (SMM, YMS), pp. 225–230.
ICPRICPR-1996-RaudysD #classification #empirical #fault
Expected error of minimum empirical error and maximal margin classifiers (SR, VD), pp. 875–879.
ICPRICPR-1996-SardoK #complexity #correlation #estimation
Minimum complexity PDF estimation for correlated data (LS, JK), pp. 750–754.
POPLPOPL-1996-KurlanderF #interprocedural
Minimum Cost Interprocedural Register Allocation (SMK, CNF), pp. 230–241.
SACSAC-1996-HoeltingSW96a #algorithm #precedence #problem #search-based #using
A genetic algorithm for the minimum broadcast time problem using a global precedence vector (CJH, DAS, RLW), pp. 258–262.
DACDAC-1995-SawkarT #clustering #multi
Multi-way Partitioning for Minimum Delay for Look-Up Table Based FPGAs (PS, DET), pp. 201–205.
SIGMODSIGMOD-1995-PapadiasTSE #bound #case study
Topological Relations in the World of Minimum Bounding Rectangles: A Study with R-trees (DP, YT, TKS, MJE), pp. 92–103.
STOCSTOC-1995-AwerbuchABV #approximate
Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen (BA, YA, AB, SV), pp. 277–283.
STOCSTOC-1995-DinitzN #graph #incremental #maintenance
A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance (YD, ZN), pp. 509–518.
ICALPICALP-1995-Henzinger #approximate
Approximating Minimum Cuts under Insertions (MRH), pp. 280–291.
ICMLICML-1995-OliveiraS #graph #order
Inferring Reduced Ordered Decision Graphs of Minimum Description Length (ALO, ALSV), pp. 421–429.
SACSAC-1995-Li #algorithm #optimisation #performance #set
An efficient algorithm for computing a minimum node cutset from a vertex-disjoint path set for timing optimization (WNL), pp. 56–60.
DACDAC-1994-AsharM #low cost #set
Implicit Computation of Minimum-Cost Feedback-Vertex Sets for Partial Scan and Other Applications (PA, SM), pp. 77–80.
DACDAC-1994-BoeseKMR
Rectilinear Steiner Trees with Minimum Elmore Delay (KDB, ABK, BAM, GR), pp. 381–386.
DACDAC-1994-LamBS #finite #state machine
Exact Minimum Cycle Times for Finite State Machines (WKCL, RKB, ALSV), pp. 100–105.
STOCSTOC-1994-BlumCCPRS #latency #problem
The minimum latency problem (AB, PC, DC, WRP, PR, MS), pp. 163–171.
STOCSTOC-1994-GargH #algorithm #approximate #problem
An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane (NG, DSH), pp. 432–438.
STOCSTOC-1994-Hagerup #algorithm #parallel #sorting #string
Optimal parallel string algorithms: sorting, merging and computing the minimum (TH), pp. 382–391.
STOCSTOC-1994-KleinT #algorithm #linear #random
A randomized linear-time algorithm for finding minimum spanning trees (PNK, RET), pp. 9–15.
ICMLICML-1994-Quinlan #category theory
The Minimum Description Length Principle and Categorical Theories (JRQ), pp. 233–241.
SACSAC-1994-AbualiSW #algorithm #design #network #probability #search-based #using
Designing telecommunications networks using genetic algorithms and probabilistic minimum spanning trees (FNA, DAS, RLW), pp. 242–246.
DACDAC-1993-RhoSP #finite #sequence #state machine
Minimum Length Synchronizing Sequences of Finite State Machine (JKR, FS, CP), pp. 463–468.
STOCSTOC-1993-KargerS #algorithm
An O~(n2) algorithm for minimum cuts (DRK, CS), pp. 757–765.
STOCSTOC-1993-ParkP #graph
Finding minimum-quotient cuts in planar graphs (JKP, CAP), pp. 766–775.
DACDAC-1992-BamjiV #design #using
Hierarchical Pitchmatching Compaction Using Minimum Design (CB, RV), pp. 311–317.
STOCSTOC-1992-LinV #approximate #constraints
epsilon-Approximations with Minimum Packing Constraint Violation (Extended Abstract) (JHL, JSV), pp. 771–782.
PODSPODS-1991-GangulyGZ #logic programming
Minimum and Maximum Predicates in Logic Programming (SG, SG, CZ), pp. 154–163.
CAVCAV-1991-Courcoubetis #problem #realtime
Minimum and Maximum Delay Problems in Real-Time Systems (CC), pp. 399–409.
CHICHI-1990-CushmanOD #performance #question #requirements #what
Usable OCR: what are the minimum performance requirements? (WHC, PSO, CMD), pp. 145–152.
STOCSTOC-1989-PittW #approximate #automaton #consistency #polynomial #problem
The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial (LP, MKW), pp. 421–432.
KRKR-1989-Ishida #framework #information management #representation
A Framework for Dynamic Representation of Knowledge: A Minimum Principle in Organizing Knowledge Representation (YI), pp. 170–179.
STOCSTOC-1988-GoldbergT #low cost
Finding Minimum-Cost Circulations by Canceling Negative Cycles (AVG, RET), pp. 388–397.
STOCSTOC-1988-Orlin #algorithm #performance
A Faster Strongly Polynominal Minimum Cost Flow Algorithm (JBO), pp. 377–387.
ICALPICALP-1988-Simon #on the #reduction #transitive
On Minimum Flow and Transitive Reduction (KS), pp. 535–546.
DACDAC-1987-Chowdhury #automation #design
An Automated Design of Minimum-Area IC Power/Ground Nets (SC), pp. 223–229.
STOCSTOC-1987-Awerbuch #algorithm #distributed #problem #summary
Optimal Distributed Algorithms for Minimum Weight Spanning Tree, Counting, Leader Election and Related Problems (Detailed Summary) (BA), pp. 230–240.
STOCSTOC-1987-GoldbergT #approximate #low cost #problem
Solving Minimum-Cost Flow Problems by Successive Approximation (AVG, RET), pp. 7–18.
ICALPICALP-1986-VarmanD #algorithm #parallel
A Parallel Vertex Insertion Algorithm For Minimum Spanning Trees (PJV, KD), pp. 424–433.
STOCSTOC-1984-BilardiP #network #sorting
A Minimum Area VLSI Network for O(log n) Time Sorting (GB, FPP), pp. 64–70.
STOCSTOC-1984-Clarkson #algorithm #approximate #geometry #performance
Fast Expected-Time and Approximation Algorithms for Geometric Minimum Spanning Trees (Extended Abstract) (KLC), pp. 342–348.
STOCSTOC-1984-FranzblauK #algorithm #generative #independence #set
An Algorithm for Constructing Regions with Rectangles: Independence and Minimum Generating Sets for Collections of Intervals (DSF, DJK), pp. 167–174.
STOCSTOC-1984-Post
Minimum Spanning Ellipsoids (MJP), pp. 108–116.
ICALPICALP-1984-Jerrum #complexity #generative #sequence
The Complexity of Finding Minimum-Length Generator Sequences (Extended Abstract) (MJ), pp. 270–280.
ICALPICALP-1984-MehlhornP #integer #multi
Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time (KM, FPP), pp. 347–357.
STOCSTOC-1983-Frederickson #data type #online
Data Structures for On-Line Updating of Minimum Spanning Trees (Preliminary Version) (GNF), pp. 252–257.
DACDAC-1982-Supowit #algorithm
A minimum-impact routing algorithm (KJS), pp. 104–112.
ICALPICALP-1981-Reif #network
Minimum S-T Cut of a Planar Undirected Network in O(n log²(n)) Time (JHR), pp. 56–67.
DACDAC-1979-KawamotoK
The minimum width routing of A 2-row 2-layer polycell-layout (TK, YK), pp. 290–296.
STOCSTOC-1979-Maier #database #relational
Minimum Covers in the Relational Database Model (Extended Abstract) (DM), pp. 330–337.
ICALPICALP-1979-PapadimitriouY #complexity #problem #strict
The Complexity of Restricted Minimum Spanning Tree Problems (Extended Abstract) (CHP, MY), pp. 460–470.
DACDAC-1978-DoreauA #algorithm #distance
A topologically based non-minimum distance routing algorithm (MTD, LCA), pp. 92–99.
STOCSTOC-1977-Itai #graph
Finding a Minimum Circuit in a Graph (AI), pp. 1–10.
DACDAC-1975-ChienSTR #design #layout
A computer-aided minimum cost transfer machine layout design (TTC, SS, WAT, PR), pp. 202–209.
DACDAC-1971-BossenOPS #network
Minimum test patterns for residue networks (DCB, DLO, AMP, MSS), pp. 278–284.

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