51 papers:
- HCI-UC-2015-NakanishiTUYS #safety
- Fukushima No. 1 Nuclear Power Plant: The Moment of “Safety Myth” Collapses (AN, TT, HU, MY, DS), pp. 350–357.
- KDD-2015-SatoN #online #probability
- Stochastic Divergence Minimization for Online Collapsed Variational Bayes Zero Inference of Latent Dirichlet Allocation (IS, HN), pp. 1035–1044.
- CADE-2015-SakaiOO #confluence
- Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent (MS, MO, MO), pp. 111–126.
- LICS-2015-CarvalhoMM #algebra #complexity
- From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP (CC, FRM, BM), pp. 462–474.
- LATA-2013-Ong #automaton #higher-order #model checking #recursion
- Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking (LO), pp. 13–41.
- ICFP-2013-BroadbentCHS #approach #higher-order #named #verification
- C-SHORe: a collapsible approach to higher-order verification (CHB, AC, MH, OS), pp. 13–24.
- KDD-2013-FouldsBDSW #probability
- Stochastic collapsed variational Bayesian inference for latent Dirichlet allocation (JRF, LB, CD, PS, MW), pp. 446–454.
- ICALP-v2-2012-Broadbent #automaton
- Prefix Rewriting for Nested-Words and Collapsible Pushdown Automata (CHB), pp. 153–164.
- ICALP-v2-2012-BroadbentCHS #automaton
- A Saturation Method for Collapsible Pushdown Systems (CHB, AC, MH, OS), pp. 165–176.
- CHI-2012-TomlinsonSPPB #human-computer
- Collapse informatics: augmenting the sustainability & ICT4D discourse in HCI (BT, MSS, DJP, YP, EB), pp. 655–664.
- ICML-2012-SatoN
- Rethinking Collapsed Variational Bayes Inference for LDA (IS, HN), p. 101.
- KDD-2012-SatoKN #process
- Practical collapsed variational bayes inference for hierarchical dirichlet process (IS, KK, HN), pp. 105–113.
- CSL-2012-Ehrhard
- Collapsing non-idempotent intersection types (TE), pp. 259–273.
- CSL-2012-Parys #automaton
- Variants of Collapsible Pushdown Systems (PP), pp. 500–515.
- LICS-2012-CarayolS #automaton #effectiveness #equivalence #recursion #safety
- Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection (AC, OS), pp. 165–174.
- LICS-2012-Parys #on the
- On the Significance of the Collapse Operation (PP), pp. 521–530.
- DLT-2011-CherubiniFP #word
- Short 3-Collapsing Words over a 2-Letter Alphabet (AC, AF, BP), pp. 469–471.
- CSL-2011-Kartzow #automaton #graph
- A Pumping Lemma for Collapsible Pushdown Graphs of Level 2 (AK), pp. 322–336.
- STOC-2010-DellM #polynomial #satisfiability
- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses (HD, DvM), pp. 251–260.
- KDD-2008-PorteousNIASW #performance
- Fast collapsed gibbs sampling for latent dirichlet allocation (IP, DN, ATI, AUA, PS, MW), pp. 569–577.
- KDD-2008-WalkerR #clustering #documentation #modelling
- Model-based document clustering with a collapsed gibbs sampler (DDW, EKR), pp. 704–712.
- CSL-2008-BeyersdorffM #bound
- A Tight Karp-Lipton Collapse Result in Bounded Arithmetic (OB, SM), pp. 199–214.
- LICS-2008-HagueMOS #automaton #recursion
- Collapsible Pushdown Automata and Recursion Schemes (MH, ASM, CHLO, OS), pp. 452–461.
- DATE-2006-KaneMS #pipes and filters #verification
- Monolithic verification of deep pipelines with collapsed flushing (RK, PM, SKS), pp. 1234–1239.
- DLT-J-2005-AnanichevPV06 #word
- Collapsing Words: a Progress Report (DSA, IVP, MVV), pp. 507–518.
- DLT-J-2005-Pribavkina06 #on the #word
- On some Properties of the Language of 2-collapsing Words (EVP), pp. 665–676.
- CSL-2006-BodirskyC #constraints #quantifier
- Collapsibility in Infinite-Domain Quantified Constraint Satisfaction (MB, HC), pp. 197–211.
- ICLP-2006-LiKL
- Collapsing Closures (XL, AK, LL), pp. 148–162.
- DATE-2005-SandireddyA #detection #fault #multi
- Diagnostic and Detection Fault Collapsing for Multiple Output Circuits (RKKRS, VDA), pp. 1014–1019.
- DLT-2005-AnanichevPV #word
- Collapsing Words: A Progress Report (DSA, IVP, MVV), pp. 11–21.
- DLT-2005-Pribavkina #on the #word
- On Some Properties of the Language of 2-Collapsing Words (EVP), pp. 374–384.
- LCTES-2005-SassoneWL #dependence #embedded #performance
- Static strands: safely collapsing dependence chains for increasing embedded power efficiency (PGS, DSW, GHL), pp. 127–136.
- CADE-2005-GodoyT #linear #term rewriting #termination
- Termination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules (GG, AT), pp. 164–176.
- DATE-v1-2004-PomeranzR #fault #metric #similarity
- Level of Similarity: A Metric for Fault Collapsing (IP, SMR), pp. 56–61.
- IWPC-2004-StoermerOV #architecture
- Architectural Views through Collapsing Strategies (CS, LO, CV), pp. 100–110.
- DLT-2002-AnanichevCV #algorithm #automaton #word
- An Inverse Automata Algorithm for Recognizing 2-Collapsing Words (DSA, AC, MVV), pp. 270–282.
- DLT-2001-AnanichevV #word
- Collapsing Words vs. Synchronizing Words (DSA, MVV), pp. 166–174.
- ICALP-2001-CaiJ #algorithm
- Subexponential Parameterized Algorithms Collapse the W-Hierarchy (LC, DWJ), pp. 273–284.
- CSL-2001-Schweikardt #database #order
- The Natural Order-Generic Collapse for ω-Representable Databases over the Rational and the Real Ordered Group (NS), pp. 130–144.
- LICS-2001-ArnoldLM #infinity #monad
- The Hierarchy inside Closed Monadic Σ₁ Collapses on the Infinite Binary Tree (AA, GL, JM), pp. 157–166.
- CSCW-2000-Putnam #community
- Bowling alone: the collapse and revival of American community (RDP), p. 357.
- STOC-1999-KlivansM #graph #morphism #polynomial #proving
- Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses (AK, DvM), pp. 659–667.
- DATE-1998-ChatzigeorgiouN #effectiveness
- Collapsing the Transistor Chain to an Effective Single Equivalent Transistor (AC, SN), pp. 2–6.
- CHI-1998-AuL
- Netscape Communicator’s Collapsible Toolbars (IA, SL), pp. 81–86.
- STOC-1996-Ogihara
- The PL Hierarchy Collapses (MO), pp. 84–88.
- ICALP-1995-KoblerW
- New Collapse Consequences of NP Having Small Circuits (JK, OW), pp. 196–207.
- EDAC-1994-HahnKB #approach #fault
- A Hierarchical Approach to Fault Collapsing (RH, RK, BB), pp. 171–176.
- ICALP-1991-HemachandraH
- Collapsing Degrees via Strong Computation (Extended Abstract) (LAH, AH), pp. 393–404.
- STOC-1987-Hemachandra #exponential
- The Strong Exponential Hierarchy Collapses (LAH), pp. 110–122.
- ICALP-1987-LangeJK
- The Logarithmic Alternation Hierarchy Collapses: AΣᴸ₂=AΠᴸ₂ (KJL, BJ, BK), pp. 531–541.
- CADE-1986-Tiden #set #unification
- Unification in Combinations of Collapse-Free Theories with Disjoint Sets of Function Symbols (ET), pp. 431–449.