29 papers:
ICALP-v1-2015-BhattacharyaHI #algorithm #design- Design of Dynamic Algorithms via Primal-Dual Method (SB, MH, GFI), pp. 206–218.
ICML-2015-MaSJJRT #distributed #optimisation- Adding vs. Averaging in Distributed Primal-Dual Optimization (CM, VS, MJ, MIJ, PR, MT), pp. 1973–1982.
ICML-2015-ZhangL #coordination #empirical #probability- Stochastic Primal-Dual Coordinate Method for Regularized Empirical Risk Minimization (YZ, XL), pp. 353–361.
STOC-2014-KesselheimTRV #online- Primal beats dual on online packing LPs in the random-order model (TK, KR, AT, BV), pp. 303–312.
ICML-c2-2014-NieHH #linear- Linear Time Solver for Primal SVM (FN, YH, HH), pp. 505–513.
ICML-c3-2013-TakacBRS- Mini-Batch Primal and Dual Methods for SVMs (MT, ASB, PR, NS), pp. 1022–1030.
DAC-2012-LiuH12a #named #optimisation- ComPLx: A Competitive Primal-dual Lagrange Optimization for Global Placement (MCK, ILM), pp. 747–752.
ICALP-v1-2011-Moldenhauer #algorithm #approximate #graph- Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs (CM), pp. 748–759.
ICML-2009-ZhuX #markov #network #on the- On primal and dual sparsity of Markov networks (JZ, EPX), pp. 1265–1272.
KDD-2009-ZhuXZ #markov #network- Primal sparse Max-margin Markov networks (JZ, EPX, BZ), pp. 1047–1056.
CIAA-2008-Salomaa- Language Decompositions, Primality, and Trajectory-Based Operations (KS), pp. 17–22.
LATA-2008-SalomaaSY- Length Codes, Products of Languages and Primality (AS, KS, SY), pp. 476–486.
STOC-2007-AroraK #approach #combinator #source code- A combinatorial, primal-dual approach to semidefinite programs (SA, SK), pp. 227–236.
ICML-2007-Shalev-ShwartzSS #named- Pegasos: Primal Estimated sub-GrAdient SOlver for SVM (SSS, YS, NS), pp. 807–814.
ICPR-v2-2006-DaiZX #generative #image #sketching- Integrating EMD and Gradient for Generating Primal Sketch of Natural Images (FD, NZ, JX), pp. 429–432.
ICALP-2005-BorodinCM #algorithm #how #question- How Well Can Primal-Dual and Local-Ratio Algorithms Perform? (AB, DC, AM), pp. 943–955.
ICALP-2005-KonemannLSZ #problem- From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem (JK, SL, GS, SHMvZ), pp. 930–942.
STOC-2004-LeviRS #algorithm #problem- Primal-dual algorithms for deterministic inventory problems (RL, RR, DBS), pp. 353–362.
ITiCSE-2003-PapamanthouP #algorithm #problem #visualisation- A visualization of the primal simplex algorithm for the assignment problem (CP, KP), p. 267.
STOC-2003-KonemannR #approximate #bound- Primal-dual meets local search: approximating MST’s with nonuniform degree bounds (JK, RR), pp. 389–395.
STOC-2002-JainV #algorithm- Equitable cost allocations via primal-dual-type algorithms (KJ, VVV), pp. 313–321.
ICALP-1997-Fujito #approach #approximate #problem- A Primal-Dual Approach to Approximation of Node-Deletion Problems for Matroidal Properties (TF), pp. 749–759.
CADE-1994-Salzer #unification- Primal Grammars and Unification Modulo a Binary Clause (GS), pp. 282–295.
STOC-1993-WilliamsonGMV #algorithm #approximate #network #problem- A primal-dual approximation algorithm for generalized Steiner network problems (DPW, MXG, MM, VVV), pp. 708–717.
ICALP-1993-GargVY #algorithm #approximate #multi #set- Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover (NG, VVV, MY), pp. 64–75.
STOC-1988-PintzSS #infinity #performance #testing- Two Infinite Sets of Primes with Fast Primality Tests (JP, WLS, ES), pp. 504–509.
ICALP-1985-Furer #algorithm #testing- Deterministic and Las Vegas Primality Testing Algorithms (MF), pp. 199–209.
ICALP-1981-HeintzS #decidability #polynomial #random- Absolute Primality of Polynomials is Decidable in Random Polynomial Time in the Number of Variables (JH, MS), pp. 16–28.
STOC-1975-Miller #testing- Riemann’s Hypothesis and Tests for Primality (GLM), pp. 234–239.