Stem inequ$ (all stems)

74 papers:

VLDB-2015-KhayyatLSOPQ0K #difference #performance

Lightning Fast and Space Efficient Inequality Joins (ZK, WL, MS, MO, PP, JAQR, NT, PK), pp. 2074–2085.

STOC-2015-AbdullahV #bound #difference

A Directed Isoperimetric Inequality with application to Bregman Near Neighbor Lower Bounds (AA, SV), pp. 509–518.

STOC-2015-LovettZ #difference

Improved Noisy Population Recovery, and Reverse Bonami-Beckner Inequality for Sparse Functions (SL, JZ), pp. 137–142.

ICALP-v1-2015-ImM #order

Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities (SI, BM), pp. 737–748.

ECIR-2015-WilkieA #bias #comparison #difference #metric #retrieval

Retrievability and Retrieval Bias: A Comparison of Inequality Measures (CW, LA), pp. 209–214.

ICML-2015-RalaivolaA

Entropy-Based Concentration Inequalities for Dependent Variables (LR, MRA), pp. 2436–2444.

ICML-c1-2014-SinghP #difference #estimation #exponential

Generalized Exponential Concentration Inequality for Renyi Divergence Estimation (SS, BP), pp. 333–341.

ICML-c2-2014-GardnerKZWC #constraints #difference #optimisation

Bayesian Optimization with Inequality Constraints (JRG, MJK, ZEX, KQW, JC), pp. 937–945.

ICML-c2-2014-LiuZWY

Safe Screening with Variational Inequalities and Its Application to Lasso (JL, ZZ, JW, JY), pp. 289–297.

KDD-2014-GhoshTLY #community #difference #network

The interplay between dynamics and networks: centrality, communities, and cheeger inequality (RG, SHT, KL, XY), pp. 1406–1415.

KR-2014-DistelAB #concept #difference

Concept Dissimilarity with Triangle Inequality (FD, JA, IB).

SMT-2014-KhanhTO #difference #named #polynomial #smt

raSAT: SMT for Polynomial Inequality (TVK, VXT, MO), p. 67.

TACAS-2013-JohnC #linear #quantifier

Extending Quantifier Elimination to Linear Inequalities on Bit-Vectors (AKJ, SC), pp. 78–92.

STOC-2013-KwokLLGT #algorithm #analysis #clustering #difference #higher-order

Improved Cheeger’s inequality: analysis of spectral partitioning algorithms through higher order spectral gap (TCK, LCL, YTL, SOG, LT), pp. 11–20.

STOC-2013-NaorRV #commutative #difference #performance

Efficient rounding for the noncommutative grothendieck inequality (AN, OR, TV), pp. 71–80.

ICALP-v1-2013-BunT #approximate #bound

Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities (MB, JT), pp. 303–314.

ICALP-v1-2013-DeDS #algorithm #analysis #difference #fourier #geometry #robust

A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry (AD, ID, RAS), pp. 376–387.

ICML-c2-2013-TranPV #learning #multi

Thurstonian Boltzmann Machines: Learning from Multiple Inequalities (TT, DQP, SV), pp. 46–54.

POPL-2013-UpadrastaC #scheduling #using

Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra (RU, AC), pp. 483–496.

STOC-2012-KleinbergW

Matroid prophet inequalities (RK, SMW), pp. 123–136.

STOC-2012-LeeGT #clustering #higher-order #multi

Multi-way spectral partitioning and higher-order cheeger inequalities (JRL, SOG, LT), pp. 1117–1130.

PADL-2012-CampagnaSS #approximate #constraints #datalog #difference #optimisation

Optimizing Inequality Joins in Datalog with Approximated Constraint Propagation (DC, BSS, TS), pp. 108–122.

SAC-2012-ZhaoHWA #constraints #diagrams #difference #equation #polynomial

Real solution formulas of cubic and quartic equations applied to generate dynamic diagrams with inequality constraints (TZ, HH, DW, PA), pp. 94–101.

CAV-2012-Venet #analysis #difference #invariant #linear #scalability

The Gauge Domain: Scalable Analysis of Linear Inequality Invariants (AV), pp. 139–154.

ICML-2011-LiuI #bound #difference #using

Bounding the Partition Function using Holder’s Inequality (QL, ATI), pp. 849–856.

CADE-2011-KorovinV #bound #linear

Solving Systems of Linear Inequalities by Bound Propagation (KK, AV), pp. 369–383.

CSCW-2010-ArazyN #difference #quality #wiki

Determinants of wikipedia quality: the roles of global and local contribution inequality (OA, ON), pp. 233–236.

ICPR-2010-BuloP #clustering #difference #probability #using

Probabilistic Clustering Using the Baum-Eagon Inequality (SRB, MP), pp. 1429–1432.

SIGMOD-2009-OlteanuH #query

Secondary-storage confidence computation for conjunctive queries with inequalities (DO, JH), pp. 389–402.

CAV-2009-DilligDA #integer #linear #proving

Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers (ID, TD, AA), pp. 233–247.

ICLP-2009-Li #algorithm #constraints #difference #functional #integer #research #summary

Research Summary: Extending Elimination Algorithms for Functional Constraints to Solve Two Integer Variables per Inequality (CL), pp. 530–531.

VMCAI-2009-LavironL #approach #linear #named #scalability

SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities (VL, FL), pp. 229–244.

STOC-2008-GamaN #difference

Finding short lattice vectors within mordell’s inequality (NG, PQN), pp. 207–216.

FLOPS-2008-Yokouchi #algorithm #analysis #difference #lazy evaluation #strict

Strictness Analysis Algorithms Based on an Inequality System for Lazy Types (HY), pp. 255–271.

SIGIR-2008-NieD #topic

Separate and inequal: preserving heterogeneity in topical authority flows (LN, BDD), pp. 443–450.

SAC-2008-GoldsztejnMR #algorithm #approximate #performance #quantifier

An efficient algorithm for a sharp approximation of universally quantified inequalities (AG, CM, MR), pp. 134–139.

ESOP-2007-SeidlFP #difference #linear

Interprocedurally Analysing Linear Inequality Relations (HS, AF, MP), pp. 284–299.

SAT-2007-Kojevnikov #bound #linear

Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities (AK), pp. 70–79.

CASE-2006-ChenYTCW #difference #fuzzy #hybrid #linear #matrix

Applying the Linear Matrix Inequality for Hybrid Fuzzy/H-infinity Control of Active Structural Damping (CWC, KY, CHT, CYC, DJW), pp. 678–682.

PODS-2006-JayramKV #problem #query

The containment problem for REAL conjunctive queries with inequalities (TSJ, PGK, EV), pp. 80–89.

STOC-2005-Basu #algebra #algorithm #polynomial #set

Polynomial time algorithm for computing the top Betti numbers of semi-algebraic sets defined by quadratic inequalities (SB), pp. 313–322.

DLT-2005-Kunc #on the #set

On Language Inequalities XK subset of LX (MK), pp. 327–337.

STOC-2004-AlonN #approximate #difference

Approximating the cut-norm via Grothendieck’s inequality (NA, AN), pp. 72–80.

ICALP-2004-Kunc

Regular Solutions of Language Inequalities and Well Quasi-orders (MK), pp. 870–881.

ICPR-v4-2004-ZhangS #difference #metric

Discovery of the Tri-Edge Inequality with Binary Vector Dissimilarity Measures (BZ, SNS), pp. 669–672.

STOC-2003-BobkovT

Modified log-sobolev inequalities, mixing and hypercontractivity (SB, PT), pp. 287–296.

DLT-2003-ChamparnaudC #algorithm #automaton #nondeterminism #reduction

NFA Reduction Algorithms by Means of Regular Inequalities (JMC, FC), pp. 194–205.

ICALP-2003-Blaser #algorithm #approximate #difference #symmetry

An Improved Approximation Algorithm for the Asymmetric TSP with Strengthened Triangle Inequality (MB), pp. 157–163.

ICALP-2003-BorosEGKM #difference #generative #problem

An Intersection Inequality for Discrete Distributions and Related Generation Problems (EB, KME, VG, LK, KM), pp. 543–555.

CHI-2003-ShechtmanH #difference #how #people

Media inequality in conversation: how people behave differently when interacting with computers and people (NS, LMH), pp. 281–288.

ICML-2003-Elkan #difference #using

Using the Triangle Inequality to Accelerate k-Means (CE), pp. 147–153.

STOC-2002-Smyth #difference

Reimer’s inequality and tardos’ conjecture (CDS), pp. 218–221.

ICPR-v1-2002-KanekoMM #agile #constraints #correlation #difference #image #using

Using Constraint Inequality on Estimated Correlation for Rapid Image Search (SK, TM, AM), pp. 87–90.

LOPSTR-2002-SimonKH #abstract domain #difference #linear

Two Variables per Linear Inequality as an Abstract Domain (AS, AK, JMH), pp. 71–89.

CADE-2002-Moller #difference #library #named #quantifier

DDDLIB: A Library for Solving Quantified Difference Inequalities (JBM), pp. 129–133.

ICALP-2001-BorosEGKM #generative #integer #linear #on the

On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities (EB, KME, VG, LK, KM), pp. 92–103.

SAS-1997-Frey #polynomial #type system

Satisfying Subtype Inequalities in Polynomial Space (AF), pp. 265–277.

RTA-1995-AbdulrabM #equation #linear

General Solution of Systems of Linear Diophantine Equations and Inequations (HA, MM), pp. 339–351.

TLCA-1995-Kondoh #data type #equation

Basic Properties of Data Types with Inequational Refinements (HK), pp. 279–296.

LICS-1992-Tiuryn #type system

Subtype Inequalities (JT), pp. 308–315.

PODS-1991-BrodskyS #constraints #difference #logic programming #source code

Inference of Inequality Constraints in Logic Programs (AB, YS), pp. 227–240.

STOC-1991-CohenM #algorithm #difference #linear

Improved Algorithms for Linear Inequalities with Two Variables per Inequality (Extended Abstract) (EC, NM), pp. 145–155.

CLP-1990-Plumer90 #logic programming #proving #source code #termination

Termination Proofs for Logic Programs Based on Predicate Inequalities (LP), pp. 634–648.

LICS-1990-Comon #algebra #equation

Solving Inequations in Term Algebras (Extended Abstract) (HC), pp. 62–69.

LICS-1990-CosmadakisMR #lazy evaluation

Completeness for typed lazy inequalities (SSC, ARM, JGR), pp. 312–320.

CADE-1988-Kafl #linear #reasoning

Reasoning about Systems of Linear Inequalities (TK), pp. 563–572.

CSL-1988-Plumer #automation #prolog #proving #source code #termination

Predicate Inequalities as a Basis for Automated Termination Proofs for Prolog Programs (LP), pp. 254–271.

STOC-1986-LuekerMR #difference #linear #programming

Linear Programming with Two Variables per Inequality in Poly-Log Time (Preliminary Version) (GSL, NM, VR), pp. 196–205.

CADE-1986-CherifaL #implementation #polynomial #term rewriting #termination

An Actual Implementation of a Procedure That Mechanically Proves Termination of Rewriting Systems Based on Inequalities Between Polynomial Interpretations (ABC, PL), pp. 42–51.

CADE-1986-Kafl #linear #reasoning #verification

Program Verifier “Tatzelwurm”: Reasoning about Systems of Linear Inequalities (TK), pp. 300–305.

STOC-1985-ChungHS #self

Self-Organizing Sequential Search and Hilbert’s Inequalities (FRKC, DJH, PDS), pp. 217–223.

VLDB-1984-YoshikawaK #difference #query

Processing Inequality Queries Based on Generalized Semi-Joins (MY, YK), pp. 416–428.

STOC-1980-Yao #performance #programming #using

Efficient Dynamic Programming Using Quadrangle Inequalities (FFY), pp. 429–435.

CADE-1980-BledsoeH #proving

Variable Elimination and Chaining in a Resolution-based Prover for Inequalities (WWB, LMH), pp. 70–87.