Stem sum$ (all stems)

112 papers:

DAC-2015-AsadJ #programming #using #verification

Verifying inevitability of phase-locking in a charge pump phase lock loop using sum of squares programming (HuA, KDJ), p. 6.

SAS-2015-AdjeGM #generative #invariant #optimisation #polynomial #using

Property-based Polynomial Invariant Generation Using Sums-of-Squares Optimization (AA, PLG, VM), pp. 235–251.

STOC-2015-BarakCK #bound #independence

Sum of Squares Lower Bounds from Pairwise Independence (BB, SOC, PKK), pp. 97–106.

STOC-2015-BarakKS #composition #learning #taxonomy

Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method (BB, JAK, DS), pp. 143–151.

STOC-2015-ChanL #clustering #combinator #integer

Clustered Integer 3SUM via Additive Combinatorics (TMC, ML), pp. 31–40.

STOC-2015-MekaPW #bound #clique

Sum-of-squares Lower Bounds for Planted Clique (RM, AP, AW), pp. 87–96.

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-KayalKPS #bound

Lower Bounds for Sums of Powers of Low Degree Univariates (NK, PK, TP, CS), pp. 810–821.

ICML-2015-AgarwalB #bound #finite #optimisation

A Lower Bound for the Optimization of Finite Sums (AA, LB), pp. 78–86.

ICML-2015-PerolatSPP #approximate #game studies #markov #programming

Approximate Dynamic Programming for Two-Player Zero-Sum Markov Games (JP, BS, BP, OP), pp. 1321–1329.

ICML-2015-ZhaoMP #network #on the

On the Relationship between Sum-Product Networks and Bayesian Networks (HZ, MM, PP), pp. 116–124.

SIGIR-2015-Al-Dhelaan #graph #multi #named #summary

StarSum: A Simple Star Graph for Multi-document Summarization (MAD), pp. 715–718.

QAPL-2015-AldiniB #automaton #markov #similarity

Expected-Delay-Summing Weak Bisimilarity for Markov Automata (AA, MB), pp. 1–15.

SAC-2015-LopesT #framework #performance

A framework for investigating the performance of sum aggregations over encrypted data warehouses (CCL, VCT), pp. 1000–1007.

LICS-2015-BokerHO #problem

The Target Discounted-Sum Problem (UB, TAH, JO), pp. 750–761.

LICS-2015-HeijltjesH #bound #complexity #logic #petri net #proving

Complexity Bounds for Sum-Product Logic via Additive Proof Nets and Petri Nets (WH, DJDH), pp. 80–91.

LICS-2015-Munch-Maccagnoni #representation #λ-calculus

Polarised Intermediate Representation of λ Calculus with Sums (GMM, GS), pp. 127–140.

TLCA-2015-Scherer #multi

Multi-Focusing on Extensional Rewriting with Sums (GS), pp. 317–331.

STOC-2014-BarakKS

Rounding sum-of-squares relaxations (BB, JAK, DS), pp. 31–40.

ICML-c1-2014-RooshenasL #interactive #learning #network

Learning Sum-Product Networks with Direct and Indirect Variable Interactions (AR, DL), pp. 710–718.

ICPR-2014-TouaziMB #feature model #game studies

Feature Selection Scheme Based on Zero-Sum Two-Player Game (AT, FM, DB), pp. 1342–1347.

PPDP-2014-Ilik #continuation #normalisation #proving #tutorial

Proofs in continuation-passing style: normalization of Gödel’s System T extended with sums and delimited control operators: Distilled Tutorial (DI), pp. 55–56.

POPL-2014-ChongDK #abstraction #parallel #reasoning

A sound and complete abstraction for reasoning about parallel prefix sums (NC, AFD, JK), pp. 397–410.

LICS-CSL-2014-Ilik #axiom #decidability #morphism

Axioms and decidability for type isomorphism in the presence of sums (DI), p. 7.

CASE-2013-Pan #combinator #problem #scheduling

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

ICDAR-2013-BreslerPH #modelling #problem #recognition

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

ICDAR-2013-GoelMAJ #word

Whole is Greater than Sum of Parts: Recognizing Scene Text Words (VG, AM, KA, CVJ), pp. 398–402.

STOC-2013-Thorup #independence #set #similarity

Bottom-k and priority sampling, set similarity and subset sums with minimal independence (MT), pp. 371–380.

ICALP-v1-2013-AbboudL

Exact Weight Subgraphs and the k-Sum Conjecture (AA, KL), pp. 1–12.

ICALP-v1-2013-AustrinKKM #algorithm #set #trade-off

Space-Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm (PA, PK, MK, JM), pp. 45–56.

ICALP-v1-2013-ChekuriNS #graph

Maximum Edge-Disjoint Paths in k-Sums of Graphs (CC, GN, FBS), pp. 328–339.

ICML-c2-2013-Rebagliati #clustering #fault #normalisation #strict

Strict Monotonicity of Sum of Squares Error and Normalized Cut in the Lattice of Clusterings (NR), pp. 163–171.

ICML-c3-2013-GensD #learning #network

Learning the Structure of Sum-Product Networks (RG, PMD), pp. 873–880.

KDIR-KMIS-2013-NcirE #clustering #on the #question

On the Extension of k-Means for Overlapping Clustering — Average or Sum of Clusters’ Representatives? (CEBN, NE), pp. 208–213.

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

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

PODS-2012-BorodinLY

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

VLDB-2012-ChoiCT #algorithm #database #scalability

A Scalable Algorithm for Maximizing Range Sum in Spatial Databases (DWC, CWC, YT), pp. 1088–1099.

STOC-2012-BarakBHKSZ #proving

Hypercontractivity, sum-of-squares proofs, and their applications (BB, FGSLB, AWH, JAK, DS, YZ), pp. 307–326.

FLOPS-2012-Morihata #algorithm #parallel #problem

Calculational Developments of New Parallel Algorithms for Size-Constrained Maximum-Sum Segment Problems (AM), pp. 213–227.

ICALP-v1-2012-VerbinZ #distance #named #sketching

Rademacher-Sketch: A Dimensionality-Reducing Embedding for Sum-Product Norms, with an Application to Earth-Mover Distance (EV, QZ), pp. 834–845.

DATE-2011-DraneC #optimisation

Optimisation of mutually exclusive arithmetic sum-of-products (TD, GAC), pp. 1388–1393.

STOC-2011-ColeCGMO #coordination

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

CSL-2011-BokerH #automaton

Determinizing Discounted-Sum Automata (UB, TAH), pp. 82–96.

CASE-2010-KwokHFRW #approach #image #using

Color image contrast enhancement using a local equalization and weighted sum approach (NMK, QPH, GF, ABR, DW), pp. 568–573.

DAC-2010-GaoYWY #analysis #correlation #estimation #performance #statistics

Efficient tail estimation for massive correlated log-normal sums: with applications in statistical leakage analysis (MG, ZY, YW, ZY), pp. 475–480.

STOC-2010-HrubesWY #commutative #problem

Non-commutative circuits and the sum-of-squares problem (PH, AW, AY), pp. 667–676.

ICALP-v1-2010-Litow #on the

On Sums of Roots of Unity (BEL), pp. 420–425.

LATA-2010-Penaloza #reasoning #standard #using

Using Sums-of-Products for Non-standard Reasoning (RP), pp. 488–499.

ICPR-2010-DiezFSS #edit distance #normalisation

Normalized Sum-over-Paths Edit Distances (SGD, FF, MS, MS), pp. 1044–1047.

SEKE-2010-BackerM #algorithm #network

Evaluating the Weighted Sum Algorithm for Estimating Conditional Probabilities in Bayesian Networks (SB, EM), pp. 319–324.

SIGIR-2010-ZhangWL #interactive #multi #named #summary #using #visualisation

VisualSum: an interactive multi-document summarization system using visualization (YZ, DW, TL), pp. 857–858.

DLT-2009-Kirsten #commutative

The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable (DK), pp. 326–333.

ICALP-v1-2009-GuhaH #bound #order #random #theorem

Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams (SG, ZH), pp. 513–524.

FM-2009-McIverM #case study #composition #refinement #security

Sums and Lovers: Case Studies in Security, Compositionality and Refinement (AM, CCM), pp. 289–304.

HCI-NIMT-2009-WechsungESSMM #evaluation #interface #multimodal #question #usability

Usability Evaluation of Multimodal Interfaces: Is the Whole the Sum of Its Parts? (IW, KPE, SS, JS, FM, SM), pp. 113–119.

CIKM-2009-WangWLL #named #query #ranking #summary

HyperSum: hypergraph based semi-supervised sentence ranking for query-oriented summarization (WW, FW, WL, SL), pp. 1855–1858.

SIGIR-2009-HinneKRVWH

Annotation of URLs: more than the sum of parts (MH, WK, SR, SV, TPvdW, MvdH), pp. 632–633.

GPCE-2009-NedunuriC #performance #problem #source code #synthesis

Synthesis of fast programs for maximum segment sum problems (SN, WRC), pp. 117–126.

SAC-2009-Brand #composition #constraints #matrix #problem

The sum-of-increments constraint in the consecutive-ones matrix decomposition problem (SB), pp. 1417–1418.

PEPM-2008-Mu #algorithm #bound #problem

Maximum segment sum is back: deriving algorithms for two segment problems with bounded lengths (SCM), pp. 31–39.

CIKM-2008-ZhangCWX #adaptation #named #summary

AdaSum: an adaptive model for summarization (JZ, XC, GW, HX), pp. 901–910.

CSL-2008-Katsumata

A Characterisation of λ Definability with Sums Via TT-Closure Operators (SyK), pp. 278–292.

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.

ICALP-2007-MotwaniPX

Estimating Sum by Weighted Sampling (RM, RP, YX), pp. 53–64.

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

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

SIGIR-2007-WanY #clustering #collaboration #documentation #multi #named

CollabSum: exploiting multiple document clustering for collaborative single document summarizations (XW, JY), pp. 143–150.

TLCA-2007-Lindley

Extensional Rewriting with Sums (SL), pp. 255–271.

PODS-2005-AlonDLT #set

Estimating arbitrary subset sums with few probes (NA, NGD, CL, MT), pp. 317–325.

ICALP-2005-Kovacs #multi #polynomial

Polynomial Time Preemptive Sum-Multicoloring on Paths (AK), pp. 840–852.

ICML-2005-CrandallG #game studies #learning

Learning to compete, compromise, and cooperate in repeated general-sum games (JWC, MAG), pp. 161–168.

SAT-2005-MaarenN #satisfiability

Sums of Squares, Satisfiability and Maximum Satisfiability (HvM, LvN), pp. 294–308.

DATE-v2-2004-SogomonyanMOG #self

A New Self-Checking Sum-Bit Duplicated Carry-Select Adder (ESS, DM, VO, MG), pp. 1360–1361.

STOC-2004-Feige #bound #graph #independence #on the #random

On sums of independent random variables with unbounded variance, and estimating the average degree in a graph (UF), pp. 594–603.

KDD-2004-AiroldiF #network

Recovering latent time-series from their observed sums: network tomography with particle filters (EA, CF), pp. 30–39.

KDD-2004-DengPML #rank

A rank sum test method for informative gene discovery (LD, JP, JM, DLL), pp. 410–419.

POPL-2004-BalatCF #normalisation #partial evaluation #λ-calculus

Extensional normalisation and type-directed partial evaluation for typed λ calculus with sums (VB, RDC, MPF), pp. 64–76.

CIAA-2003-FanLLTWY #algorithm

An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics Extended Abstract (THF, SL, HIL, TST, TCW, AY), pp. 251–257.

ICALP-2003-JainRS #communication #complexity #theorem

A Direct Sum Theorem in Communication Complexity via Message Compression (RJ, JR, PS), pp. 300–315.

ICFP-2003-NeubauerT #fault

Discriminative sum types locate the source of type errors (MN, PT), pp. 15–26.

ICML-2003-ConitzerS03a #bound #framework #game studies #named

BL-WoLF: A Framework For Loss-Bounded Learnability In Zero-Sum Games (VC, TS), pp. 91–98.

PODS-2002-SchmidtS #how #multi #query

How to Evaluate Multiple Range-Sum Queries Progressively (RRS, CS), pp. 133–141.

LICS-2002-FioreCB #morphism #λ-calculus

Remarks on Isomorphisms in Typed λ Calculi with Empty and Sum Types (MPF, RDC, VB), p. 147–?.

VLDB-2001-ChungCLL #query

Dynamic Update Cube for Range-sum Queries (SJC, CWC, JHL, SLL), pp. 521–530.

STOC-2001-BartalCR #approximate #clustering #metric

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

STOC-2001-CharikarP #clustering

Clustering to minimize the sum of cluster diameters (MC, RP), pp. 1–10.

ICML-2001-Littman #game studies

Friend-or-Foe Q-learning in General-Sum Games (MLL), pp. 322–328.

STOC-2000-CsirikJKOSW #algorithm #on the

On the sum-of-squares algorithm for bin packing (JC, DSJ, CK, JBO, PWS, RRW), pp. 208–217.

CIKM-2000-WuAA #approximate #composition #query #using

Using Wavelet Decomposition to Support Progressive and Approximate Range-Sum Queries over Data Cubes (YLW, DA, AEA), pp. 414–421.

ICML-2000-Bowling #convergence #learning #multi #problem

Convergence Problems of General-Sum Multiagent Reinforcement Learning (MHB), pp. 89–94.

ICML-2000-HuW #game studies #probability

Experimental Results on Q-Learning for General-Sum Stochastic Games (JH, MPW), pp. 407–414.

VLDB-1999-ChanI #query

Hierarchical Prefix Cubes for Range-Sum Queries (CYC, YEI), pp. 675–686.

STOC-1999-SkutellaW #parallel

A PTAS for Minimizing the Weighted Sum of Job Completion Times on Parallel Machines (MS, GJW), pp. 400–407.

TLCA-1999-FioreS #logic

λ Definability with Sums via Grothendieck Logical Relations (MPF, AKS), pp. 147–161.

ICALP-1998-BazganST #algorithm #approximate #performance #problem #similarity

Efficient Approximation Algorithms for the Subset-Sums Equality Problem (CB, MS, ZT), pp. 387–396.

PODS-1997-HoBA #query #using

Partial-Sum Queries in Data Cubes Using Covering Codes (CTH, JB, RA), pp. 228–237.

ICALP-1997-Bar-NoyK #graph

The Minimum Color Sum of Bipartite Graphs (ABN, GK), pp. 738–748.

ICPR-1996-Cinque #parallel

A parallel partial-sums computation on a pyramid machine (LC), pp. 616–619.

SAC-1996-LeeHHC #case study #how #implementation #performance #problem #process #set

Efficient implementations of two variant subset sum problems: a case study of how to process appraisal books resulting from fire-destroyed money (PL, FYH, CYH, HTC), pp. 230–237.

STOC-1994-LiptonY #complexity #game studies #scalability

Simple strategies for large zero-sum games with applications to complexity theory (RJL, NEY), pp. 734–740.

ICALP-1993-CosmoK #confluence #recursion #reduction #λ-calculus

A Confluent Reduction for the Extensional Typed λ-Calculus with Pairs, Sums, Recursion and terminal Object (RDC, DK), pp. 645–656.

ICALP-1993-Schonhage #adaptation #finite #parallel #performance

Fast Parallel Computation of Characteristic Polynomials by Leverrier’s POwer Sum Method Adapted to Fields of Finite Characteristic (AS), pp. 410–417.

RTA-1993-Dougherty #λ-calculus

Some λ Calculi with Categorial Sums and Products (DJD), pp. 137–151.

DAC-1992-ChenF #algorithm #logic #optimisation #performance #set

Efficient Sum-to-One Subsets Algorithm for Logic Optimization (KCC, MF), pp. 443–448.

CADE-1992-WalshNB #proving #theorem proving

The Use of Proof Plans to Sum Series (TW, AN, AB), pp. 325–339.

ICALP-1991-GalilM #algorithm #linear #problem

An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem (ZG, OM), pp. 719–727.

STOC-1989-Bshouty #on the

On the Extended Direct Sum Conjecture (NHB), pp. 177–185.

ML-1989-Selfridge #adaptation #case study #contest #learning

Atoms of Learning II: Adaptive Strategies A Study of Two-Person Zero-Sum Competition (OGS), pp. 412–415.

LICS-1989-Middeldorp #term rewriting #termination

A Sufficient Condition for the Termination of the Direct Sum of Term Rewriting Systems (AM), pp. 396–401.

RTA-1989-ToyamaKB #linear #term rewriting #termination

Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft- (YT, JWK, HPB), pp. 477–491.

STOC-1988-GabowW #algorithm #game studies

Forests, Frames and Games: Algorithms for Matroid Sums and Applications (HNG, HHW), pp. 407–421.

ICALP-1987-Dietzfelbinger #bound #sorting

Lower Bounds for Sorting of Sums (MD), pp. 457–466.

STOC-1984-BachMS

Sums of Divisors, Perfect Numbers, and Factoring (Extended Abstract) (EB, GLM, JS), pp. 183–190.