Stem min$ (all stems)

72 papers:

DRR-2015-DavisBS #documentation #segmentation

Min-cut segmentation of cursive handwriting in tabular documents (BLD, WAB, SDS), p. 940208.

ICALP-v1-2015-BehsazFSS #algorithm #approximate #clustering

Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median (BB, ZF, MRS, RS), pp. 116–128.

ICALP-v1-2015-GawrychowskiN #encoding

Optimal Encodings for Range Top- k k , Selection, and Min-Max (PG, PKN), pp. 593–604.

ICALP-v2-2015-EtessamiSY #branch #equation #fixpoint #markov #polynomial #probability #process #reachability

Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes (KE, AS, MY), pp. 184–196.

PODS-2014-PaghSW #question #set

Is min-wise hashing optimal for summarizing set intersection? (RP, MS, DPW), pp. 109–120.

FM-2014-RouxG #comparison #invariant #polynomial

Computing Quadratic Invariants with Min- and Max-Policy Iterations: A Practical Comparison (PR, PLG), pp. 563–578.

ICML-c2-2014-GleichM #algorithm #approximate #case study

Anti-differentiating approximation algorithms: A case study with min-cuts, spectral, and flow (DG, MWM), pp. 1018–1025.

ICML-c2-2014-RavanbakhshSFG #graph #problem

Min-Max Problems on Factor Graphs (S(R, CS, BJF, RG), pp. 1035–1043.

ICPR-2014-HuDGX #analysis #distance #reduction

Max-K-Min Distance Analysis for Dimension Reduction (JH, WD, JG, YX), pp. 726–731.

CASE-2013-Pan #combinator #problem #scheduling

A combinatorial auctions perspective on min-sum scheduling problems (YP), pp. 564–569.

DAC-2013-KuruvillaSPVC #analysis #optimisation #set #statistics

Speeding up computation of the max/min of a set of gaussians for statistical timing analysis and optimization (VK, DS, JP, CV, NC), p. 7.

DocEng-2013-FerilliER #documentation #html #multi

Hi-Fi HTML rendering of multi-format documents in DoMinUS (SF, FE, DR), pp. 173–176.

ICALP-v1-2013-Uppman #complexity

The Complexity of Three-Element Min-Sol and Conservative Min-Cost-Hom (HU), pp. 804–815.

DAC-2012-SinhaVVXZ #concept #statistics

Reversible statistical max/min operation: concept and applications to timing (DS, CV, NV, JX, VZ), pp. 1067–1073.

ICALP-v1-2012-EtessamiSY #algorithm #branch #equation #markov #polynomial #probability #process

Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations (KE, AS, MY), pp. 314–326.

ICALP-v1-2012-PolacekS #strict

Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation (LP, OS), pp. 726–737.

ICPR-2012-DongYDWYGSM #classification #linear

A Linear Max K-min classifier (MD, LY, WD, QW, CY, JG, LS, LM), pp. 2967–2971.

ICPR-2012-ShaoS #analysis #distance #reduction

Fractional-step max-min distance analysis for dimension reduction (GS, NS), pp. 396–400.

DAC-2011-JooK #fine-grained #named

WaveMin: a fine-grained clock buffer polarity assignment combined with buffer sizing (DJ, TK), pp. 522–527.

STOC-2011-ColeCGMO #coordination

Inner product spaces for MinSum coordination mechanisms (RC, JRC, VG, VSM, NO), pp. 539–548.

STOC-2011-ItalianoNSW #algorithm #graph

Improved algorithms for min cut and max flow in undirected planar graphs (GFI, YN, PS, CWN), pp. 313–322.

DATE-2010-PerezSF #data flow #graph #optimisation #relational

Optimizing Data-Flow Graphs with min/max, adding and relational operations (JP, PS, VF), pp. 1361–1364.

ICALP-v1-2010-EpsteinLS #online #order

Max-min Online Allocations with a Reordering Buffer (LE, AL, RvS), pp. 336–347.

ICALP-v1-2010-GuptaNR #algorithm #optimisation #robust

Thresholded Covering Algorithms for Robust and Max-min Optimization (AG, VN, RR), pp. 262–274.

ICALP-v1-2010-KratschW #preprocessor #problem

Preprocessing of Min Ones Problems: A Dichotomy (SK, MW), pp. 653–665.

ICPR-2010-PhamTN #bound #segmentation #similarity #using

Bounding-Box Based Segmentation with Single Min-cut Using Distant Pixel Similarity (VQP, KT, TN), pp. 4420–4423.

SAT-2010-LiMQZ #satisfiability

Exact MinSAT Solving (CML, FM, ZQ, ZZ), pp. 363–368.

DAC-2009-LuZSZ #algorithm #manycore #parallel

Multicore parallel min-cost flow algorithm for CAD applications (YL, HZ, LS, XZ), pp. 832–837.

STOC-2009-BateniCG #bound

MaxMin allocation via degree lower-bounded arborescences (MB, MC, VG), pp. 543–552.

DAC-2008-HurstMB #constraints #scalability

Scalable min-register retiming under timing and initializability constraints (APH, AM, RKB), pp. 534–539.

DAC-2008-WangZ #algorithm #incremental #performance

An efficient incremental algorithm for min-area retiming (JW, HZ), pp. 528–533.

DATE-2008-FangH #algorithm #approximate #performance #satisfiability

A Fast Approximation Algorithm for MIN-ONE SAT (LF, MSH), pp. 1087–1090.

PODS-2008-GollapudiP #power of #similarity

The power of two min-hashes for similarity search among hierarchical data objects (SG, RP), pp. 211–220.

SAS-2008-AllamigeonGG #invariant #using

Inferring Min and Max Invariants Using Max-Plus Polyhedra (XA, SG, EG), pp. 189–204.

ICALP-A-2008-EsparzaGKS #approximate #equation

Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations (JE, TG, SK, HS), pp. 698–710.

ICPR-2008-ChenS #constraints #image #segmentation

Medical image segmentation via min s-t cuts with sides constraints (JHC, LGS), pp. 1–4.

ICPR-2008-MirzaeiR #clustering #transitive #using

Combining hierarchical clusterings using min-transitive closure (AM, MR), pp. 1–4.

DAC-2007-ChenZ #performance #process

Fast Min-Cost Buffer Insertion under Process Variations (RC, HZ), pp. 338–343.

ICDAR-2007-ChenLJ #learning #pseudo #recognition

Learning Handwritten Digit Recognition by the Max-Min Posterior Pseudo-Probabilities Method (XC, XL, YJ), pp. 342–346.

STOC-2007-AsadpourS #algorithm #approximate

An approximation algorithm for max-min fair allocation of indivisible goods (AA, AS), pp. 114–121.

VLDB-2006-ZhangDXT #query

Progressive Computation of the Min-Dist Optimal-Location Query (DZ, YD, TX, YT), pp. 643–654.

STOC-2006-Rao #constant #independence

Extractors for a constant number of polynomially small min-entropy independent sources (AR), pp. 497–506.

ICALP-v1-2006-KhotP #clique

Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion (SK, AKP), pp. 226–237.

ICPR-v2-2006-NandedkarB #classification #fuzzy #network

A Reflex Fuzzy Min Max Neural Network for Granular Data Classification (AVN, PKB), pp. 650–653.

STOC-2005-AgarwalCMM #algorithm #approximate #problem

O(sqrt(log n)) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems (AA, MC, KM, YM), pp. 573–581.

SAC-2005-LiuSC #distributed #low cost #nondeterminism #query

Cost-efficient processing of MIN/MAX queries over distributed sensors with uncertainty (ZL, KCS, JC), pp. 634–641.

DAC-2004-KahngR #concept #feedback

Placement feedback: a concept and method for better min-cut placements (ABK, SR), pp. 357–362.

DATE-v2-2004-KahngMR #named

Boosting: Min-Cut Placement with Improved Signal Delay (ABK, ILM, SR), pp. 1098–1103.

PLDI-2004-JohnsonEV #composition #concurrent #thread

Min-cut program decomposition for thread-level speculation (TAJ, RE, TNV), pp. 59–70.

STOC-2004-Obata #approximate #multi #theorem

Approximate max-integral-flow/min-multicut theorems (KO), pp. 539–545.

ICPR-v1-2004-Vliet #normalisation #robust

Robust Local Max-Min Filters by Normalized Power-Weighted Filtering (LJvV), pp. 696–699.

ICPR-v4-2004-NandedkarB #architecture #classification #fuzzy #network

A Fuzzy Min-Max Neural Network Classifier with Compensatory Neuron Architecture (AVN, PKB), pp. 553–556.

STOC-2003-ItohTT #independence #on the #permutation #strict

On the sample size of k-restricted min-wise independent permutations and other k-wise distributions (TI, YT, JT), pp. 710–719.

DATE-2002-GoldbergN #named #performance #robust

BerkMin: A Fast and Robust Sat-Solver (EIG, YN), pp. 142–149.

ICALP-2002-BermanK #approximate #bound

Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION (PB, MK), pp. 623–632.

DAC-2001-LuCYP #metric #modelling

Min/max On-Chip Inductance Models and Delay Metrics (YCL, MC, TY, LTP), pp. 341–346.

STOC-2001-BartalCR #approximate #clustering #metric

Approximating min-sum k-clustering in metric spaces (YB, MC, DR), pp. 11–20.

STOC-2001-Thorup

Fully-dynamic min-cut (MT), pp. 224–230.

DAC-2000-SundararajanSP #named

MINFLOTRANSIT: min-cost flow based transistor sizing tool (VS, SSS, KKP), pp. 649–664.

ICALP-2000-Broder #independence #permutation #theory and practice

Min-wise Independent Permutations: Theory and Practice (AZB), p. 808.

STOC-1998-BroderCFM #independence #permutation

Min-Wise Independent Permutations (Extended Abstract) (AZB, MC, AMF, MM), pp. 327–336.

ICALP-1997-SchwiegelshohnT #equation

Periodic and Non-periodic Min-Max Equations (US, LT), pp. 379–389.

STOC-1993-GargVY #approximate #multi #theorem

Approximate max-flow min-(multi)cut theorems and their applications (NG, VVV, MY), pp. 698–707.

STOC-1993-PlotkinT #bound #multi

Improved bounds on the max-flow min-cut ratio for multicommodity flows (SAP, ÉT), pp. 691–697.

DAC-1990-TeraiTS #algorithm #assurance #constraints #design #layout

A New Min-Cut Placement Algorithm for Timing Assurance Layout Design Meeting Net Length Constraint (MT, KT, KS), pp. 96–102.

DAC-1989-Vijayan #clustering

Min-cost Partitioning on a Tree Structure and Applications (GV), pp. 771–774.

ICALP-1989-GambosiNT #data type

A Pointer-Free Data Structure for Merging Heaps and Min-Max Heaps (GG, EN, MT), pp. 405–422.

DAC-1988-BhandariHS #problem #towards

The Min-cut Shuffle: Toward a Solution for the Global Effect Problem of Min-cut Placement (ISB, MH, DPS), pp. 681–685.

ICALP-1986-MonienS

Min Cut is NP-Complete for Edge Weighted Trees (BM, IHS), pp. 265–274.

ICALP-1980-BeckerPS #algorithm #clustering

A Shifting Algorithm for Min-Max Tree Partitioning (RIB, YP, SRS), pp. 64–75.

DAC-1979-Lauther #algorithm #graph #representation

A min-cut placement algorithm for general cell assemblies based on a graph representation (UL), pp. 1–10.

DAC-1977-Breuer #algorithm

A class of min-cut placement algorithms (MAB), pp. 284–290.