## Stem smaller$ (all stems)

### 19 papers:

- KDD-2015-FeldmanT #approximate #big data #constraints #matrix
- More Constraints, Smaller Coresets: Constrained Matrix Approximation of Sparse Big Data (DF, TT), pp. 249–258.
- DATE-2014-YamashitaMOT #performance
- A smaller and faster variant of RSM (NY, KM, TO, YT), pp. 1–6.
- SAC-2014-LoulergueRTLH #parallel #problem
- Formal derivation and extraction of a parallel program for the all nearest smaller values problem (FL, SR, JT, JL, ZH), pp. 1577–1584.
- SIGIR-2013-KonowNCL #performance
- Faster and smaller inverted indices with treaps (RK, GN, CLAC, ALO), pp. 193–202.
- ECOOP-2012-GilS #java
- Smaller Footprint for Java Collections (JYG, YS), pp. 356–382.
- CIAA-2011-DaciukW #automaton #finite #representation
- Smaller Representation of Finite State Automata (JD, DW), pp. 118–129.
- ICALP-v2-2011-Clemente #automaton
- Büchi Automata Can Have Smaller Quotients (LC), pp. 258–270.
- CIKM-2011-PapagelisBG
- Suggesting ghost edges for a smaller world (MP, FB, AG), pp. 2305–2308.
- ICSM-2010-ParandeK #analysis #dependence #open source
- A longitudinal analysis of the dependency concentration in smaller modules for open-source software products (MAP, GK), pp. 1–5.
- DAC-2009-XuCWZ
- Improving STT MRAM storage density through smaller-than-worst-case transistor sizing (WX, YC, XW, TZ), pp. 87–90.
- OOPSLA-2009-TsafrirWBS #dependence #performance #source code
- Minimizing dependencies within generic classes for faster and smaller programs (DT, RWW, DFB, BS), pp. 425–444.
- SCAM-2005-BinkleyH #slicing
- Forward slices are smaller than backward slices (DB, MH), pp. 15–24.
- DATE-v2-2004-ShendeMB #communication #quantum
- Smaller Two-Qubit Circuits for Quantum Communication and Computation (VVS, ILM, SSB), pp. 980–987.
- CSMR-2003-AntoniolPN #algorithm #clustering #library #search-based
- Moving to Smaller Libraries via Clustering and Genetic Algorithms (GA, MDP, MN), pp. 307–316.
- STOC-2002-GuruswamiI #linear
- Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets (VG, PI), pp. 812–821.
- ICDAR-2001-RahmanAHA #automation #summary #web
- Automatic Summarization of Web Content to Smaller Display Devices (AFRR, HA, RH, KA), pp. 1064–1068.
- DAC-2000-JainMMWL #analysis #canonical #complexity #composition #graph #how
- Analysis of composition complexity and how to obtain smaller canonical graphs (JJ, KM, DM, IW, YL), pp. 681–686.
- TOOLS-EUROPE-2000-NobleW00a #design pattern #memory management
- Smaller Software: Patterns for Objects in Limited Memory (JN, CW), p. 471.
- STOC-1984-AdlerM #algorithm #bound #polynomial
- A Simplex Algorithm Whose Average Number of Steps is Bounded between Two Quadratic Functions of the Smaller Dimension (IA, NM), pp. 312–323.