Stem max$ (all stems)

147 papers:

CASE-2015-David-HenrietRH #constraints #modelling

Modeling and control for (max, +)-linear systems with set-based constraints (XDH, JR, LH, BC), pp. 1369–1374.

SIGMOD-2015-Anagnostopoulos #crowdsourcing #performance

The Importance of Being Expert: Efficient Max-Finding in Crowdsourcing (AA, LB, AF, IM, MR), pp. 983–998.

STOC-2015-Lee #graph

Hardness of Graph Pricing Through Generalized Max-Dicut (EL), pp. 391–399.

ICALP-v1-2015-GaspersS #algorithm #performance #set

Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets (SG, GBS), pp. 567–579.

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.

ICML-2015-PachecoS #approach #pseudo

Proteins, Particles, and Pseudo-Max-Marginals: A Submodular Approach (JP, EBS), pp. 2200–2208.

ICML-2015-YuanHTLC #modelling

Non-Gaussian Discriminative Factor Models via the Max-Margin Rank-Likelihood (XY, RH, ET, RL, LC), pp. 1254–1263.

SEKE-2015-CavalcanteRC #experience #named #user interface

MAX: A Method for Evaluating the Post-use User eXperience through Cards and a Board (EC, LR, TC), pp. 495–500.

SAT-2015-ChenS #algorithm #satisfiability

Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP (RC, RS), pp. 33–45.

SAT-2015-MangalZNN #framework #lazy evaluation #named #satisfiability #scalability

Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT Instances (RM, XZ, AVN, MN), pp. 299–306.

SAT-2015-NevesMJLM #satisfiability

Exploiting Resolution-Based Representations for MaxSAT Solving (MN, RM, MJ, IL, VMM), pp. 272–286.

DATE-2014-ReimerSSB #using

Using MaxBMC for Pareto-optimal circuit initialization (SR, MS, TS, BB), pp. 1–6.

TACAS-2014-AdzkiyaSA #reachability

Forward Reachability Computation for Autonomous Max-Plus-Linear Systems (DA, BDS, AA), pp. 248–262.

FM-2014-RouxG #comparison #invariant #polynomial

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

ICML-c1-2014-ZhangZZ #infinity #markov #modelling

Max-Margin Infinite Hidden Markov Models (AZ, JZ, BZ), pp. 315–323.

ICML-c2-2014-LiZ0 #learning #multi

Bayesian Max-margin Multi-Task Learning with Data Augmentation (CL, JZ, JC), pp. 415–423.

ICML-c2-2014-QuattoniBCG #sequence

Spectral Regularization for Max-Margin Sequence Tagging (AQ, BB, XC, AG), pp. 1710–1718.

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.

ICPR-2014-SouzaRML

Maximal Max-Tree Simplification (RS, LR, RCM, RdAL), pp. 3132–3137.

ICPR-2014-WangGJ #learning #using

Learning with Hidden Information Using a Max-Margin Latent Variable Model (ZW, TG, QJ), pp. 1389–1394.

CAV-2014-LarrazNORR #proving #using

Proving Non-termination Using Max-SMT (DL, KN, AO, ERC, AR), pp. 779–796.

SAT-2014-BacchusN #algorithm #analysis #satisfiability

Cores in Core Based MaxSat Algorithms: An Analysis (FB, NN), pp. 7–15.

SAT-2014-MartinsML #composition #named #satisfiability

Open-WBO: A Modular MaxSAT Solver, (RM, VMM, IL), pp. 438–445.

SAT-2014-SaetherTV #satisfiability

Solving MaxSAT and #SAT on Structured CNF Formulas (SHS, JAT, MV), pp. 16–31.

SAT-2014-SakaiST #reduction #satisfiability #strict

Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction (TS, KS, ST), pp. 32–47.

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.

ICDAR-2013-BreslerPH #modelling #problem #recognition

Modeling Flowchart Structure Recognition as a Max-Sum Problem (MB, DP, VH), pp. 1215–1219.

VLDB-2013-TaoHCC #approximate #database

Approximate MaxRS in Spatial Databases (YT, XH, DWC, CWC), pp. 1546–1557.

STOC-2013-EisenstatK #algorithm #graph #linear #multi

Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs (DE, PNK), pp. 735–744.

STOC-2013-Orlin

Max flows in O(nm) time, or better (JBO), pp. 765–774.

ICALP-v1-2013-KumarMN #bound

Arithmetic Circuit Lower Bounds via MaxRank (MK, GM, JS), pp. 661–672.

ICML-c1-2013-ZhuCPZ #algorithm #modelling #performance #topic

Gibbs Max-Margin Topic Models with Fast Sampling Algorithms (JZ, NC, HP, BZ), pp. 124–132.

ICML-c2-2013-WangK13a #approach #message passing #problem

Subproblem-Tree Calibration: A Unified Approach to Max-Product Message Passing (HW, DK), pp. 190–198.

ICML-c3-2013-HockingRVB #detection #learning #using

Learning Sparse Penalties for Change-point Detection using Max Margin Interval Regression (TH, GR, JPV, FRB), pp. 172–180.

ICML-c3-2013-WangWBLT #learning #multi #taxonomy

Max-Margin Multiple-Instance Dictionary Learning (XW, BW, XB, WL, ZT), pp. 846–854.

ICML-c3-2013-XuZZ #matrix #performance

Fast Max-Margin Matrix Factorization with Data Augmentation (MX, JZ, BZ), pp. 978–986.

KDD-2013-ZhuZZZ #modelling #scalability #topic

Scalable inference in max-margin topic models (JZ, XZ, LZ, BZ), pp. 964–972.

SAC-2013-LarrosaR #bound #constraints #distributed #optimisation

Risk-neutral bounded max-sum for distributed constraint optimization (JL, ER), pp. 92–97.

SAT-2013-CimattiGSS #approach #composition #modulo theories #satisfiability

A Modular Approach to MaxSAT Modulo Theories (AC, AG, BJS, RS), pp. 150–165.

SAT-2013-MartinsML #clustering #satisfiability

Community-Based Partitioning for MaxSAT Solving (RM, VMM, IL), pp. 182–191.

VMCAI-2013-SchrammelS

Logico-Numerical Max-Strategy Iteration (PS, PS), pp. 414–433.

DAC-2012-SinhaVVXZ #concept #statistics

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

PODS-2012-BorodinLY

Max-Sum diversification, monotone submodular functions and dynamic updates (AB, HCL, YY), pp. 155–166.

SIGMOD-2012-GuoPG

So who won?: dynamic max discovery with the crowd (SG, AGP, HGM), pp. 385–396.

ICALP-v1-2012-CrowstonJM #bound

Max-Cut Parameterized above the Edwards-Erdős Bound (RC, MJ, MM), pp. 242–253.

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.

ICML-2012-JalaliS12a #clustering #optimisation #using

Clustering using Max-norm Constrained Optimization (AJ, NS), p. 205.

ICML-2012-Zhu #feature model #modelling #parametricity #predict

Max-Margin Nonparametric Latent Feature Models for Link Prediction (JZ), p. 154.

ICPR-2012-DongYDWYGSM #classification #linear

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

ICPR-2012-DuanHC #approach #image #segmentation

Shape prior regularized continuous max-flow approach to image segmentation (YD, WH, HC), pp. 2516–2519.

ICPR-2012-ShaoS #analysis #distance #reduction

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

KDD-2012-0002L #named #recommendation

RecMax: exploiting recommender systems for fun and profit (AG, LVSL), pp. 1294–1302.

SAC-2012-RodoperBJT #framework #mobile #performance #security

An efficient security framework for mobile WiMAX (MR, AB, EJ, WT), pp. 1494–1501.

SAT-2012-MorgadoHM #satisfiability

Improvements to Core-Guided Binary Search for MaxSAT (AM, FH, JMS), pp. 284–297.

STOC-2011-ItalianoNSW #algorithm #graph

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

ICALP-v1-2011-ElsasserT #complexity

Settling the Complexity of Local Max-Cut (Almost) Completely (RE, TT), pp. 171–182.

ICALP-v1-2011-Nonner #clique #clustering #graph

Clique Clustering Yields a PTAS for max-Coloring Interval Graphs (TN), pp. 183–194.

HIMI-v2-2011-KwackKC #analysis #mobile

Economic Analysis of SON-Enabled Mobile WiMAX (SK, JK, JC), pp. 268–277.

CIKM-2011-ZhaoYX #independence #information management #learning #web

Max margin learning on domain-independent web information extraction (BZ, XY, EPX), pp. 1305–1310.

ICML-2011-Gould #learning #linear #markov #random

Max-margin Learning for Lower Linear Envelope Potentials in Binary Markov Random Fields (SG), pp. 193–200.

ICML-2011-PengHMU #set

Convex Max-Product over Compact Sets for Protein Folding (JP, TH, DAM, RU), pp. 729–736.

KDIR-2011-VanetikG #mining #named

HashMax: A New Method for Mining Maximal Frequent Itemsets (NV, EG), pp. 140–145.

SIGIR-2011-DingS #documentation #performance #retrieval #using

Faster top-k document retrieval using block-max indexes (SD, TS), pp. 993–1002.

SAT-2011-ArgelichLMP #evaluation #satisfiability

Analyzing the Instances of the MaxSAT Evaluation (JA, CML, FM, JP), pp. 360–361.

DATE-2010-Moezzi-MadaniTD #detection #flexibility #standard

A low-area flexible MIMO detector for WiFi/WiMAX standards (NMM, TT, WRD), pp. 1633–1636.

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.

ICML-2010-HariharanZVV #classification #multi #scalability

Large Scale Max-Margin Multi-Label Classification with Priors (BH, LZM, SVNV, MV), pp. 423–430.

KR-2010-XiaoLMQ #consistency #metric #multi #nondeterminism #satisfiability #semantics

Computing Inconsistency Measurements under Multi-Valued Semantics by Partial Max-SAT Solvers (GX, ZL, YM, GQ).

PPDP-2010-BofillBV #approach #declarative #robust #satisfiability

A declarative approach to robust weighted Max-SAT (MB, DB, MV), pp. 67–76.

SAT-2010-PankratovB #on the #problem #satisfiability

On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem (DP, AB), pp. 223–236.

STOC-2009-BateniCG #bound

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

STOC-2009-Trevisan

Max cut and the smallest eigenvalue (LT), pp. 263–272.

ICALP-v1-2009-BecchettiK #analysis #streaming

Competitive Analysis of Aggregate Max in Windowed Streaming (LB, EK), pp. 156–170.

KDD-2009-ZhuXZ #markov #network

Primal sparse Max-margin Markov networks (JZ, EPX, BZ), pp. 1047–1056.

SAT-2009-AnsoteguiBL #satisfiability #testing

Solving (Weighted) Partial MaxSAT through Satisfiability Testing (CA, MLB, JL), pp. 427–440.

SAT-2009-ArgelichCLM #encoding #satisfiability

Sequential Encodings from Max-CSP into Partial Max-SAT (JA, AC, IL, FM), pp. 161–166.

SAT-2009-KrocSS #satisfiability

Relaxed DPLL Search for MaxSAT (LK, AS, BS), pp. 447–452.

SAT-2009-LiffitonS #satisfiability

Generalizing Core-Guided Max-SAT (MHL, KAS), pp. 481–494.

SAT-2009-LiMMP #satisfiability

Exploiting Cycle Structures in Max-SAT (CML, FM, NOM, JP), pp. 467–480.

SAT-2009-Szeider #complexity #satisfiability

The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT (SS), pp. 276–283.

CASE-2008-AddadA #algebra #architecture #evaluation #graph #modelling #using

Modeling and response time evaluation of ethernet-based control architectures using timed event graphs and Max-Plus algebra (BA, SA), pp. 418–423.

SIGMOD-2008-DuTZ #named #privacy #quantifier

Privacy-MaxEnt: integrating background knowledge in privacy quantification (WD, ZT, ZZ), pp. 459–472.

SAS-2008-AllamigeonGG #invariant #using

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

STOC-2008-ODonnellW #algorithm #testing

An optimal sdp algorithm for max-cut, and equally optimal long code tests (RO, YW), pp. 335–344.

ICALP-A-2008-EsparzaGKS #approximate #equation

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

ICML-2008-SarawagiG

Accurate max-margin training for structured output spaces (SS, RG), pp. 888–895.

KR-2008-UckelmanE #modelling

Preference Modeling by Weighted Goals with Max Aggregation (JU, UE), pp. 579–588.

CAV-2008-GulavaniG #abstract domain #abstraction #analysis

A Numerical Abstract Domain Based on Expression Abstraction and Max Operator with Application in Timing Analysis (BSG, SG), pp. 370–384.

SAT-2008-ArgelichCLM #modelling #satisfiability

Modelling Max-CSP as Partial Max-SAT (JA, AC, IL, FM), pp. 1–14.

SAT-2008-ArgelichLM #preprocessor #satisfiability

A Preprocessor for Max-SAT Solvers (JA, CML, FM), pp. 15–20.

SAT-2008-HerasL #clique #preprocessor #satisfiability

A Max-SAT Inference-Based Pre-processing for Max-Clique (FH, JL), pp. 139–152.

ICDAR-2007-ChenLJ #learning #pseudo #recognition

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

VLDB-2007-QiCS #graph #query

Sum-Max Monotonic Ranked Joins for Evaluating Top-K Twig Queries on Weighted Data Graphs (YQ, KSC, MLS), pp. 507–518.

STOC-2007-AndrewsJS #network #protocol #scheduling

Stability of the max-weight routing and scheduling protocol in dynamic networks and at critical loads (MA, KJ, ALS), pp. 145–154.

STOC-2007-AsadpourS #algorithm #approximate

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

STOC-2007-Austrin #satisfiability

Balanced max 2-sat might not be the hardest (PA), pp. 189–197.

STOC-2007-SchoenebeckTT

Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut (GS, LT, MT), pp. 302–310.

ICML-2007-Werner #algorithm #consistency #question #what

What is decreased by the max-sum arc consistency algorithm? (TW), pp. 1007–1014.

KDD-2007-GuoZXF #data mining #database #learning #mining #multimodal

Enhanced max margin learning on multimodal data mining in a multimedia database (ZG, ZZ, EPX, CF), pp. 340–349.

SAT-2007-ArgelichM #learning #satisfiability

Partial Max-SAT Solvers with Clause Learning (JA, FM), pp. 28–40.

SAT-2007-HerasLO #named #satisfiability

MiniMaxSat: A New Weighted Max-SAT Solver (FH, JL, AO), pp. 41–55.

STOC-2006-Zuckerman #clique #linear

Linear degree extractors and the inapproximability of max clique and chromatic number (DZ), pp. 681–690.

ICALP-v1-2006-KhotP #clique

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

CIKM-2006-KunkleZC #mining #performance

Efficient mining of max frequent patterns in a generalized environment (DK, DZ, GC), pp. 810–811.

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

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

SAT-2006-BonetLM #calculus #satisfiability

A Complete Calculus for Max-SAT (MLB, JL, FM), pp. 240–251.

SAT-2006-DantsinW #constant #performance #satisfiability

MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s2) Time (ED, AW), pp. 266–276.

SAT-2006-FuM #on the #problem #satisfiability

On Solving the Partial MAX-SAT Problem (ZF, SM), pp. 252–265.

SAT-2006-WatanabeY #analysis #problem #satisfiability

Average-Case Analysis for the MAX-2SAT Problem (OW, MY), pp. 277–282.

ICALP-2005-PemmarajuR #algorithm #approximate #problem

Approximation Algorithms for the Max-coloring Problem (SVP, RR), pp. 1064–1075.

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.

SAT-J-2004-Interian05 #algorithm #approximate #random

Approximation Algorithm for Random MAX- kSAT (YI), pp. 173–182.

SAT-J-2004-TompkinsH05 #algorithm #implementation #named #satisfiability

UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT (DADT, HHH), pp. 306–320.

SAT-2005-AlsinetMP #satisfiability

Improved Exact Solvers for Weighted Max-SAT (TA, FM, JP), pp. 371–377.

STOC-2004-HolmerinK #equation #linear #verification

A new PCP outer verifier with applications to homogeneous linear equations and max-bisection (JH, SK), pp. 11–20.

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.

SAC-2004-BoughaciD #metaheuristic #optimisation #problem #satisfiability #using

Solving weighted Max-Sat optimization problems using a Taboo Scatter Search metaheuristic (DB, HD), pp. 35–36.

SAT-2004-Interian #algorithm #approximate #random

Approximation Algorithm for Random MAX-kSAT (YI), pp. 64–68.

SAT-2004-TompkinsH #algorithm #implementation #named #satisfiability

UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT & MAX-SAT (DADT, HHH), pp. 37–46.

DLT-2003-KlimannLMP #ambiguity #automaton

Deciding the Sequentiality of a Finitely Ambiguous Max-Plus Automaton (IK, SL, JM, CP), pp. 373–385.

ICALP-2003-Coja-OghlanMS #approximate #graph #random

MAX k-CUT and Approximating the Chromatic Number of Random Graphs (ACO, CM, VS), pp. 200–211.

TLCA-2003-Amadio

Max-Plus Quasi-interpretations (RMA), pp. 31–45.

STOC-2002-AlonVKK #approximate #problem #random

Random sampling and approximation of MAX-CSP problems (NA, WFdlV, RK, MK), pp. 232–239.

SIGIR-2002-Yang #documentation #keyword #string

Chinese keyword extraction based on max-duplicated strings of the documents (WY), pp. 439–440.

DAC-2001-LuCYP #metric #modelling

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

STOC-2001-FeigeS #on the

On the integrality ratio of semidefinite relaxations of MAX CUT (UF, GS), pp. 433–442.

STOC-2001-GoemansW #algorithm #approximate #problem #programming

Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (MXG, DPW), pp. 443–452.

VLDB-2000-LingLL #query

Hierarchical Compact Cube for Range-Max Queries (SYL, TWL, HGL), pp. 232–241.

STOC-1999-Zwick99a #problem #programming

Outward Rotations: A Tool for Rounding Solutions of Semidefinite Programming Relaxations, with Applications to MAX CUT and Other Problems (UZ), pp. 679–687.

ICALP-1999-NiedermeierR #bound #satisfiability

New Upper Bounds for MaxSat (RN, PR), pp. 575–584.

ICALP-1997-SchwiegelshohnT #equation

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

STOC-1996-Karloff #algorithm #how #question

How Good is the Goemans-Williamson MAX CUT Algorithm? (HJK), pp. 427–434.

STOC-1996-KleinL #algorithm #approximate #performance #source code

Efficient Approximation Algorithms for Semidefinite Programs Arising from MAX CUT and COLORING (PNK, HIL), pp. 338–347.

STOC-1994-GoemansW #algorithm #approximate #satisfiability

.879-approximation algorithms for MAX CUT and MAX 2SAT (MXG, DPW), pp. 422–431.

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.

CIKM-1993-Wolin #evaluation #maintenance #performance

Performance Evaluation of MAX — the Maintenance Administrator Expert System (EJW), pp. 729–731.

PLILP-1993-Poetzsch-Heffter #programming language #prototype #specification #using

Programming Language Specification and Prototyping Using the MAX System (APH), pp. 137–150.

ICALP-1989-GambosiNT #data type

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

ICALP-1980-BeckerPS #algorithm #clustering

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