BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
exponential
Google exponential

Tag #exponential

118 papers:

ICMLICML-2019-AwanKRS #functional
Benefits and Pitfalls of the Exponential Mechanism with Applications to Hilbert Spaces and Functional PCA (JA, AK, MR, ABS), pp. 374–384.
ICMLICML-2019-LiSSG #kernel #learning #product line
Learning deep kernels for exponential family densities (WL, DJS, HS, AG), pp. 6737–6746.
ICMLICML-2019-YadavKMM #clustering
Supervised Hierarchical Clustering with Exponential Linkage (NY, AK, NM, AM), pp. 6973–6983.
PPDPPPDP-2019-ValliappanR #category theory #combinator
Exponential Elimination for Bicartesian Closed Categorical Combinators (NV, AR), p. 13.
CASECASE-2019-BaiTYZD #algorithm #evaluation #finite #performance #robust
An Accurate and Robust Algorithm for Performance Evaluation of Exponential Serial Lines with Finite Buffers (YB, JT, MY, LZ, PD), pp. 42–47.
CASECASE-2019-LiuHS #approach #learning #scheduling
A new solution approach for flow shop scheduling with an exponential time-dependent learning effect (LL, HH, LS), pp. 468–473.
ICMLICML-2018-KolarijaniEK #framework #hybrid #performance
Fast Gradient-Based Methods with Exponential Rate: A Hybrid Control Framework (ASK, PME, TK), pp. 2733–2741.
ICPRICPR-2018-GrelssonF #learning #linear #network
Improved Learning in Convolutional Neural Networks with Shifted Exponential Linear Units (ShELUs) (BG, MF), pp. 517–522.
CASECASE-2018-JulienN #coordination #using
Dynamics and Control of Tree-Type Manipulator Systems using Exponential Coordinates (AJ, KN), pp. 136–143.
ICMLICML-2017-LiuB #product line
Zero-Inflated Exponential Family Embeddings (LPL, DMB), pp. 2140–2148.
CIAACIAA-2016-FernauK #automaton #finite #problem
Problems on Finite Automata and the Exponential Time Hypothesis (HF, AK), pp. 89–100.
ICMLICML-2016-InouyeRD #dependence #modelling #multi #product line #visual notation
Square Root Graphical Models: Multivariate Generalizations of Univariate Exponential Families that Permit Positive Dependencies (DII, PR, ISD), pp. 2445–2453.
CSLCSL-2016-Carvalho #injection #linear #logic #multi #relational
The Relational Model Is Injective for Multiplicative Exponential Linear Logic (DdC), p. 19.
ICALPICALP-v1-2015-BjorklundDH #problem #random #set #strict
The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems (AB, HD, TH), pp. 231–242.
ICMLICML-2015-ChaoSMS #integration #monte carlo
Exponential Integration for Hamiltonian Monte Carlo (WLC, JS, DM, FS), pp. 1142–1151.
ICMLICML-2015-CohenW #product line
Harmonic Exponential Families on Manifolds (TC, MW), pp. 1757–1765.
ICMLICML-2015-GajaneUC #algorithm
A Relative Exponential Weighing Algorithm for Adversarial Utility-based Dueling Bandits (PG, TU, FC), pp. 218–227.
ICMLICML-2015-KordaA #approximate #bound #convergence #on the
On TD(0) with function approximation: Concentration bounds and a centered variant with exponential convergence (NK, PLA), pp. 626–634.
ICMLICML-2015-Shamir #algorithm #convergence #probability
A Stochastic PCA and SVD Algorithm with an Exponential Convergence Rate (OS), pp. 144–152.
ICMLICML-2015-TanseyPSR #markov #product line #random
Vector-Space Markov Random Fields via Exponential Families (WT, OHMP, ASS, PR), pp. 684–692.
DACDAC-2015-ZhuangYKWC #algorithm #framework #performance #scalability #simulation #using
An algorithmic framework for efficient large-scale circuit simulation using exponential integrators (HZ, WY, IK, XW, CKC), p. 6.
STOCSTOC-2015-GanorKR #communication
Exponential Separation of Information and Communication for Boolean Functions (AG, GK, RR), pp. 557–566.
ICALPICALP-v1-2014-ChaillouxS #game studies #parallel
Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost (AC, GS), pp. 296–307.
ICMLICML-c1-2014-SinghP #difference #estimation
Generalized Exponential Concentration Inequality for Renyi Divergence Estimation (SS, BP), pp. 333–341.
ICMLICML-c2-2014-GunasekarRG #constraints #matrix #product line
Exponential Family Matrix Completion under Structural Constraints (SG, PR, JG), pp. 1917–1925.
KDDKDD-2014-LuM #difference #estimation #graph #privacy #random
Exponential random graph estimation under differential privacy (WL, GM), pp. 921–930.
CASECASE-2014-ZhaoLH #evaluation #multi #performance
Performance evaluation of multi-product manufacturing systems with asynchronous exponential machines (CZ, JL, NH), pp. 692–697.
STOCSTOC-2014-BerryCCKS #precise #simulation
Exponential improvement in precision for simulating sparse Hamiltonians (DWB, AMC, RC, RK, RDS), pp. 283–292.
STOCSTOC-2014-Rothvoss #complexity
The matching polytope has exponential extension complexity (TR), pp. 263–272.
ICALPICALP-v1-2013-BodlaenderCKN #algorithm #problem
Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth (HLB, MC, SK, JN), pp. 196–207.
ICMLICML-c3-2013-HonorioJ #bound #fault
Two-Sided Exponential Concentration Bounds for Bayes Error Rate and Shannon Entropy (JH, TSJ), pp. 459–467.
CASECASE-2013-BouhnikA #adaptation #correlation #markov
Markov G/G/s model adaptation to factory operational curve though exponential correlation (SB, SA), pp. 730–734.
CASECASE-2013-ZhaoL #analysis #multi
Analysis of multi-product manufacturing systems with homogeneous exponential machines (CZ, JL), pp. 386–391.
STOCSTOC-2013-BuchbinderNS #clustering #multi #problem
Simplex partitioning via exponential clocks and the multiway cut problem (NB, JN, RS), pp. 535–544.
STOCSTOC-2013-Li #independence
New independent source extractors with exponential improvement (XL), pp. 783–792.
ICSTSAT-2013-Johannsen #learning #proving
Exponential Separations in a Hierarchy of Clause Learning Proof Systems (JJ), pp. 40–51.
ICALPICALP-v2-2012-KikotKPZ #bound #query
Exponential Lower Bounds and Separation for Query Rewriting (SK, RK, VVP, MZ), pp. 263–274.
ICMLICML-2012-FreitasSZ #bound #process
Exponential Regret Bounds for Gaussian Process Bandits with Deterministic Observations (NdF, AJS, MZ), p. 125.
ICPRICPR-2012-IsmaeilAO #evaluation #kernel
Bilateral filter evaluation based on exponential kernels (KAI, DA, BEO), pp. 258–261.
FoSSaCSFoSSaCS-2012-Kartzow #automaton #first-order #model checking
First-Order Model Checking on Nested Pushdown Trees is Complete for Doubly Exponential Alternating Time (AK), pp. 376–390.
STOCSTOC-2012-FioriniMPTW #bound #linear
Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds (SF, SM, SP, HRT, RdW), pp. 95–106.
STOCSTOC-2012-OrecchiaSV #algorithm #approximate
Approximating the exponential, the lanczos method and an Õ(m)-time spectral algorithm for balanced separator (LO, SS, NKV), pp. 1141–1160.
ICSTSAT-2012-AchlioptasM #algorithm #bound #random #satisfiability
Exponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas (DA, RMM), pp. 327–340.
ICDARICDAR-2011-ImpedovoP11a #recognition
Tuning between Exponential Functions and Zones for Membership Functions Selection in Voronoi-Based Zoning for Handwritten Character Recognition (SI, GP), pp. 997–1001.
ICALPICALP-v1-2011-FilmusPS #bound
Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds (YF, TP, RS), pp. 618–629.
RTARTA-2011-AvanziniEM #order #term rewriting
A Path Order for Rewrite Systems that Compute Exponential Time Functions (MA, NE, GM), pp. 123–138.
ESOPESOP-2011-HuntS #polynomial #security #type system
From Exponential to Polynomial-Time Security Typing via Principal Types (SH, DS), pp. 297–316.
ICALPICALP-v1-2010-Ambos-SpiesB
Weak Completeness Notions for Exponential Time (KAS, TB), pp. 503–514.
ICALPICALP-v1-2010-DellHW #complexity #polynomial
Exponential Time Complexity of the Permanent and the Tutte Polynomial (HD, TH, MW), pp. 426–437.
ICALPICALP-v2-2010-Fearnley #bound #policy
Exponential Lower Bounds for Policy Iteration (JF), pp. 551–562.
ICPRICPR-2010-DengH #composition #detection #process
Voice Activity Detection Based on Complex Exponential Atomic Decomposition and Likelihood Ratio Test (SD, JH), pp. 89–92.
CASECASE-2010-Zhang #analysis #design
Kanban-controlled exponential production lines: Analysis and design (LZ), pp. 445–450.
STOCSTOC-2010-MicciancioV #algorithm #problem
A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations (DM, PV), pp. 351–358.
CSLCSL-2010-CarraroES #infinity #multi
Exponentials with Infinite Multiplicities (AC, TE, AS), pp. 170–184.
ICSTSAT-2010-DantsinW #on the #satisfiability
On Moderately Exponential Time for SAT (ED, AW), pp. 313–325.
ICALPICALP-v2-2009-MelliesTT #linear #logic
An Explicit Formula for the Free Exponential Modality of Linear Logic (PAM, NT, CT), pp. 247–260.
ICMLICML-2009-LiangJK #learning #metric #product line
Learning from measurements in exponential families (PL, MIJ, DK), pp. 641–648.
SACSAC-2009-Djelloul #finite #infinity #linear
From exponential to almost linear decomposability of finite or infinite trees (KD), pp. 897–902.
LICSLICS-2009-BasaldellaF #interactive
Ludics with Repetitions (Exponentials, Interactive Types and Completeness) (MB, CF), pp. 375–384.
LICSLICS-2009-Friedmann #algorithm #bound #game studies
An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it (OF), pp. 145–156.
ICSTSAT-2009-Johannsen #bound #learning #strict
An Exponential Lower Bound for Width-Restricted Clause Learning (JJ), pp. 128–140.
ICMLICML-2008-WingateS #learning #predict #product line
Efficiently learning linear-linear exponential family predictive representations of state (DW, SPS), pp. 1176–1183.
CSLCSL-2008-TorreMP #automaton #infinity
An Infinite Automaton Characterization of Double Exponential Time (SLT, PM, GP), pp. 33–48.
CIAACIAA-J-2006-BastienCFR07
Reducing Simple Grammars: Exponential against Highly-Polynomial Time in Practice (CB, JC, WF, WR), pp. 715–725.
ICALPICALP-2007-CaragiannisFM #ad hoc #energy #heuristic #network
An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks (IC, MF, LM), pp. 447–458.
STOCSTOC-2007-GavinskyKKRW #communication #complexity #encryption #quantum
Exponential separations for one-way quantum communication complexity, with applications to cryptography (DG, JK, IK, RR, RdW), pp. 516–525.
CSLCSL-2007-NauroisM #correctness #multi #proving
Correctness of Multiplicative (and Exponential) Proof Structures is NL -Complete (PJdN, VM), pp. 435–450.
ICSTSAT-2007-SchederZ #product line #satisfiability
Satisfiability with Exponential Families (DS, PZ), pp. 148–158.
CIAACIAA-2006-BastienCFR
Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice (CB, JC, WF, WR), pp. 90–101.
ICALPICALP-v2-2006-Haghverdi
Typed GoI for Exponentials (EH), pp. 384–395.
ICPRICPR-v3-2006-DuongPBV #behaviour #markov #modelling #product line #recognition
Human Behavior Recognition with Generic Exponential Family Duration Modeling in the Hidden Semi-Markov Model (TVD, DQP, HHB, SV), pp. 202–207.
STOCSTOC-2006-GavinskyKRW #bound #communication #complexity #identification #quantum
Bounded-error quantum state identification and exponential separations in communication complexity (DG, JK, OR, RdW), pp. 594–603.
CSLCSL-2006-Pagani #linear #logic #multi
Acyclicity and Coherence in Multiplicative Exponential Linear Logic (MP), pp. 531–545.
ICALPICALP-2005-LinRTW #fibonacci
Braess’s Paradox, Fibonacci Numbers, and Exponential Inapproximability (HCL, TR, ÉT, AW), pp. 497–512.
ICALPICALP-2004-AlekhnovichHI #algorithm #bound #satisfiability
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas (MA, EAH, DI), pp. 84–96.
ICALPICALP-2004-FominKT #algorithm
Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In (FVF, DK, IT), pp. 568–580.
ICALPICALP-2004-FominT #algorithm #graph #kernel #linear #performance
Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up (FVF, DMT), pp. 581–592.
CIKMCIKM-2004-SiJ #collaboration
Unified filtering by combining collaborative filtering and content-based filtering via mixture model and exponential model (LS, RJ), pp. 156–157.
ICMLICML-2004-BanerjeeDGM #analysis #estimation #product line
An information theoretic analysis of maximum likelihood mixture estimation for exponential families (AB, ISD, JG, SM).
STOCSTOC-2004-Bar-YossefJK #communication #complexity #quantum
Exponential separation of quantum and classical one-way communication complexity (ZBY, TSJ, IK), pp. 128–137.
ICALPICALP-2003-JohannsenL
CTL+ Is Complete for Double Exponential Time (JJ, ML), pp. 767–775.
ICMLICML-2003-JinYZH #algorithm #performance #scalability
A Faster Iterative Scaling Algorithm for Conditional Exponential Model (RJ, RY, JZ, AGH), pp. 282–289.
SIGIRSIGIR-2003-TeevanK #analysis #development #empirical #probability #retrieval #using
Empirical development of an exponential probabilistic model for text retrieval: using textual analysis to build a better model (JT, DRK), pp. 18–25.
STOCSTOC-2003-ChildsCDFGS #algorithm #quantum
Exponential algorithmic speedup by a quantum walk (AMC, RC, ED, EF, SG, DAS), pp. 59–68.
STOCSTOC-2003-KerenidisW #bound #quantum
Exponential lower bound for 2-query locally decodable codes via a quantum argument (IK, RdW), pp. 106–115.
ICALPICALP-2002-BenderCR #algorithm #performance
Exponential Structures for Efficient Cache-Oblivious Algorithms (MAB, RC, RR), pp. 195–207.
ICALPICALP-2002-GrigorievHP #algebra #bound #proving
Exponential Lower Bound for Static Semi-algebraic Proofs (DG, EAH, DVP), pp. 257–268.
STOCSTOC-2002-AlekhnovichJPU
An exponential separation between regular and general resolution (MA, JJ, TP, AU), pp. 448–456.
SATSAT-2002-MonassonC #algorithm #analysis #random #satisfiability #scalability
Restart method and exponential acceleration of random 3-SAT instances resolutions: A large deviation analysis of the Davis-Putnam-Loveland-Logemann algorithm (RM, SC), p. 11.
ICALPICALP-2001-AlberFN #complexity #graph #problem
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems (JA, HF, RN), pp. 261–272.
POPLPOPL-2001-FlanaganS #explosion #generative #verification
Avoiding exponential explosion: generating compact verification conditions (CF, JBS), pp. 193–205.
DATEDATE-2001-VanasscheGS #performance #simulation #using
Efficient time-domain simulation of telecom frontends using a complex damped exponential signal model (PV, GGEG, WMCS), pp. 169–175.
WLCWLC-2000-Brattka #modelling #recursion
The Emperor’s New Recursiveness: The Epigraph of the Exponential Function in Two Models of Computability (VB), pp. 63–72.
ICPRICPR-v2-2000-HansenH #bias #composition #fault #independence #product line
General Bias/Variance Decomposition with Target Independent Variance of Error Functions Derived from the Exponential Family of Distributions (JVH, TH), pp. 2207–2210.
ICPRICPR-v2-2000-WilsonH #capacity #correlation #memory management
Storage Capacity of the Exponential Correlation Associative Memory (RCW, ERH), pp. 2660–2663.
STOCSTOC-2000-KitaevW #interactive #parallel #proving #quantum #simulation
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems (AK, JW), pp. 608–617.
DLTDLT-1999-Wich #ambiguity #context-free grammar
Exponential ambiguity of context-free grammars (KW), pp. 125–138.
STOCSTOC-1999-Raz #communication #complexity #quantum
Exponential Separation of Quantum and Classical Communication Complexity (RR), pp. 358–367.
STOCSTOC-1998-GrigorievK #bound
An Exponential Lower Bound for Depth 3 Arithmetic Circuits (DG, MK), pp. 577–582.
STOCSTOC-1997-ImpagliazzoW
P = BPP if E Requires Exponential Circuits: Derandomizing the XOR Lemma (RI, AW), pp. 220–229.
STOCSTOC-1997-PaturiSZ #bound
Exponential Lower Bounds for Depth 3 Boolean Circuits (RP, MES, FZ), pp. 86–91.
ICPRICPR-1996-HancockP #analysis #correlation #memory management
An analysis of the exponential correlation associative memory (ERH, MP), pp. 291–295.
FPCAFPCA-1995-MeijerH
Bananas in Space: Extending Fold and Unfold to Exponential Types (EM, GH), pp. 324–333.
PODSPODS-1994-SuciuP #algebra #algorithm #set #transitive
Any Algorithm in the Complex Object Algebra with Powerset Needs Exponential Space to Compute Transitive Closure (DS, JP), pp. 201–209.
SACSAC-1994-MahoneyLW #network
Construction of an artificial neural network for simple exponential smoothing in forecasting (DWM, RPL, SIW), pp. 308–312.
STOCSTOC-1992-BeameIKPPW #bound #principle
Exponential Lower Bounds for the Pigeonhole Principle (PB, RI, JK, TP, PP, ARW), pp. 200–220.
STOCSTOC-1992-Safra #automaton
Exponential Determinization for ω-Automata with Strong-Fairness Acceptance Condition (SS), pp. 275–282.
POPLPOPL-1990-Mairson #ml
Deciding ML Typability is Complete for Deterministic Exponential Time (HGM), pp. 382–401.
STOCSTOC-1989-GoodmanPS #coordination #order #representation
Coordinate Representation of Order Types Requires Exponential Storage (JEG, RP, BS), pp. 405–410.
LICSLICS-1988-MullerSS #automaton #decidability #logic #why
Weak Alternating Automata Give a Simple Explanation of Why Most Temporal and Dynamic Logics are Decidable in Exponential Time (DEM, AS, PES), pp. 422–427.
STOCSTOC-1987-Hemachandra
The Strong Exponential Hierarchy Collapses (LAH), pp. 110–122.
ICALPICALP-1986-BookORW #on the
On Exponential Lowness (RVB, PO, DAR, OW), pp. 40–49.
STOCSTOC-1983-Valiant #bound #strict
Exponential Lower Bounds for Restricted Monotone Circuits (LGV), pp. 110–117.
CADECADE-1982-MatwinP #backtracking #data type #implementation #performance
Exponential Improvement of Efficient Backtracking: data Structure and Implementation (SM, TP), pp. 240–259.
CADECADE-1982-PietrzykowskiM #backtracking #deduction #performance
Exponential Improvement of Efficient Backtracking: A Strategy for Plan-Based Deduction (TP, SM), pp. 223–239.
ICALPICALP-1981-FraenkelL
Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N (ASF, DL), pp. 278–293.
STOCSTOC-1976-CardozaLM #commutative #petri net #problem
Exponential Space Complete Problems for Petri Nets and Commutative Semigroups: Preliminary Report (EC, RJL, ARM), pp. 50–54.
STOCSTOC-1973-StockmeyerM #problem #word
Word Problems Requiring Exponential Time: Preliminary Report (LJS, ARM), pp. 1–9.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.