Stem faster$ (all stems)

145 papers:

VLDB-2015-NaidanBN #performance #permutation

Permutation Search Methods are Efficient, Yet Faster Search is Possible (BN, LB, EN), pp. 1618–1629.

VLDB-2015-NaziZT0D #network #online #performance #social

Walk, Not Wait: Faster Sampling Over Online Social Networks (AN, ZZ, ST, NZ, GD), pp. 678–689.

VLDB-2015-Zhou0D #network #online #performance #social

Leveraging History for Faster Sampling of Online Social Networks (ZZ, NZ, GD), pp. 1034–1045.

STOC-2015-SunW #canonical #performance

Faster Canonical Forms for Primitive Coherent Configurations: Extended Abstract (XS, JW), pp. 693–702.

STOC-2015-ZhuO #convergence #performance

Nearly-Linear Time Positive LP Solver with Faster Convergence Rate (ZAZ, LO), pp. 229–236.

ICALP-v1-2015-GaspersS #algorithm #performance #set

Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets (SG, GBS), pp. 567–579.

CHI-2015-DeberJFW #how #latency #performance

How Much Faster is Fast Enough?: User Perception of Latency & Latency Improvements in Direct and Indirect Touch (JD, RJ, CF, DW), pp. 1827–1836.

ICML-2015-FrostigGKS #algorithm #approximate #empirical #named #performance #probability

Un-regularizing: approximate proximal point and faster stochastic algorithms for empirical risk minimization (RF, RG, SK, AS), pp. 2540–2548.

ICML-2015-GarberH #performance #set

Faster Rates for the Frank-Wolfe Method over Strongly-Convex Sets (DG, EH), pp. 541–549.

ICML-2015-IzbickiS #performance

Faster cover trees (MI, CRS), pp. 1162–1170.

ICML-2015-NutiniSLFK #coordination #performance #random

Coordinate Descent Converges Faster with the Gauss-Southwell Rule Than Random Selection (JN, MWS, IHL, MPF, HAK), pp. 1632–1641.

POPL-2015-ChatterjeeIPG #algebra #algorithm #constant #performance #recursion #state machine

Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth (KC, RIJ, AP, PG), pp. 97–109.

SAC-2015-Fournier-VigerZ #mining #named #performance

FOSHU: faster on-shelf high utility itemset mining — with or without negative unit profit (PFV, SZ), pp. 857–864.

SAC-2015-ReddySC #approach #aspect-oriented #incremental #learning #performance #weaving

Incremental aspect weaving: an approach for faster AOP learning (YRR, AS, MC), pp. 1480–1485.

SPLC-2015-SoutoGdMKB #debugging #detection #feature model #modelling #performance #product line

Faster bug detection for software product lines with incomplete feature models (SS, DG, Md, DM, SK, DSB), pp. 151–160.

CC-2015-AfroozehI #gll #parsing #performance

Faster, Practical GLL Parsing (AA, AI), pp. 89–108.

CAV-2015-ChatterjeeIP #algorithm #constant #graph #performance #verification

Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs (KC, RIJ, AP), pp. 140–157.

ICLP-2015-Saleh #performance

Transforming Delimited Control: Achieving Faster Effect Handlers (AHS).

CASE-2014-TanakaT #algorithm #bound #performance #problem

A faster branch-and-bound algorithm for the block relocation problem (ST, KT), pp. 7–12.

DATE-2014-YamashitaMOT #performance

A smaller and faster variant of RSM (NY, KM, TO, YT), pp. 1–6.

VLDB-2014-AndersonCJWZ #development #ide #performance #re-engineering

An Integrated Development Environment for Faster Feature Engineering (MRA, MJC, YJ, GW, BZ), pp. 1657–1660.

VLDB-2014-JugelJHM #performance #visual notation

Faster Visual Analytics through Pixel-Perfect Aggregation (UJ, ZJ, GH, VM), pp. 1705–1708.

VLDB-2015-InoueOT14 #branch #performance #predict #set

Faster Set Intersection with SIMD instructions by Reducing Branch Mispredictions (HI, MO, KT), pp. 293–304.

STOC-2014-Williams14a #complexity #performance

Faster all-pairs shortest paths via circuit complexity (RW), pp. 664–673.

ICALP-v1-2014-AbboudWW #performance #sequence

Consequences of Faster Alignment of Sequences (AA, VVW, OW), pp. 39–51.

ICALP-v1-2014-ReidlRVS #algorithm #performance

A Faster Parameterized Algorithm for Treedepth (FR, PR, FSV, SS), pp. 931–942.

ICALP-v1-2014-Wulff-Nilsen #approximate #distance #graph #performance

Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles (CWN), pp. 1063–1074.

FM-2014-RinastSG #graph #performance #reduction

A Graph-Based Transformation Reduction to Reach UPPAAL States Faster (JR, SS, DG), pp. 547–562.

ICFP-2014-HackettH #performance

Worker/wrapper/makes it/faster (JH, GH), pp. 95–107.

CHI-2014-Gilbert #performance #social #what

What if we ask a different question?: social inferences create product ratings faster (EG), pp. 2759–2762.

CHI-2014-GutwinCSMO #performance

Faster command selection on tablets with FastTap (CG, AC, JS, SM, SCO), pp. 2617–2626.

CHI-2014-HenleyF #editing #navigation #performance #towards

The patchworks code editor: toward faster navigation with less code arranging and fewer navigation mistakes (AZH, SDF), pp. 2511–2520.

ICML-c2-2014-DefazioDC #big data #incremental #named #performance #problem

Finito: A faster, permutable incremental gradient method for big data problems (AD, JD, TSC), pp. 1125–1133.

ICPR-2014-BartoliLKBB #adaptation #detection #multi #performance

Unsupervised Scene Adaptation for Faster Multi-scale Pedestrian Detection (FB, GL, SK, ADB, ADB), pp. 3534–3539.

ICPR-2014-IshaqEW #evaluation #performance

An Evaluation of the Faster STORM Method for Super-resolution Microscopy (OI, JE, CW), pp. 4435–4440.

ICPR-2014-MasselliZ #approach #geometry #performance #problem

A New Geometric Approach for Faster Solving the Perspective-Three-Point Problem (AM, AZ), pp. 2119–2124.

SAC-2014-SilveiraMGCFR #energy #performance

Faster seam carving with minimum energy windows (CLBS, FdOM, LGJ, CAdC, KF, RdRR), pp. 45–48.

LICS-CSL-2014-Williams #first-order #graph #performance

Faster decision of first-order graph properties (RW), p. 6.

TAP-2014-KampmannGZ #bound #execution #named #performance #verification

JTACO: Test Execution for Faster Bounded Verification (AK, JPG, AZ), pp. 134–141.

TACAS-2013-RenaultDKP #automaton #composition #model checking #performance

Strength-Based Decomposition of the Property Büchi Automaton for Faster Model Checking (ER, ADL, FK, DP), pp. 580–593.

ICPC-2013-UddinRS #clone detection #detection #named #performance #scalability

SimCad: An extensible and faster clone detection tool for large scale software systems (MSU, CKR, KAS), pp. 236–238.

ICALP-v1-2013-CyganP #algorithm #bound #graph #performance

Faster Exponential-Time Algorithms in Graphs of Bounded Average Degree (MC, MP), pp. 364–375.

DUXU-WM-2013-WilliamsGMW #approach #enterprise #performance

A User Centred Approach to Determining the Impact of Faster Broadband on Small and Medium Sized Enterprises (DW, AG, JM, JW), pp. 140–149.

SIGIR-2013-KonowNCL #performance

Faster and smaller inverted indices with treaps (RK, GN, CLAC, ALO), pp. 193–202.

SIGIR-2013-TakumaY #bound #performance

Faster upper bounding of intersection sizes (DT, HY), pp. 703–712.

SAC-2013-SouzaRB #clustering #data access #metric #performance

Faster construction of ball-partitioning-based metric access methods (JAdS, HLR, MCNB), pp. 8–12.

CAV-2013-ChatterjeeL #algorithm #markov #performance #process

Faster Algorithms for Markov Decision Processes with Low Treewidth (KC, JL), pp. 543–558.

ISSTA-2013-ZhangMK #mutation testing #performance #reduction #testing

Faster mutation testing inspired by test prioritization and reduction (LZ, DM, SK), pp. 235–245.

VLDB-2012-KangLM #performance #throughput

Flash-based Extended Cache for Higher Throughput and Faster Recovery (WHK, SWL, BM), pp. 1615–1626.

MSR-2012-KhomhDZA #case study #empirical #performance #quality

Do faster releases improve software quality? An empirical case study of Mozilla Firefox (FK, TD, YZ, BA), pp. 179–188.

PLDI-2012-MorrisettTTTG #named #performance

RockSalt: better, faster, stronger SFI for the x86 (GM, GT, JT, JBT, EG), pp. 395–404.

STOC-2012-KelnerMP #approximate #multi #performance #using

Faster approximate multicommodity flow using quadratically coupled flows (JAK, GLM, RP), pp. 1–18.

STOC-2012-Williams #matrix #multi #performance

Multiplying matrices faster than coppersmith-winograd (VVW), pp. 887–898.

ICALP-v1-2012-Jez #pattern matching #performance

Faster Fully Compressed Pattern Matching by Recompression (AJ), pp. 533–544.

ICALP-v1-2012-ThalerUV #algorithm #performance

Faster Algorithms for Privately Releasing Marginals (JT, JU, SPV), pp. 810–821.

LATA-2012-GagieGKNP #grammarware #performance #self

A Faster Grammar-Based Self-index (TG, PG, JK, YN, SJP), pp. 240–251.

CHI-2012-FisherPDs #dataset #incremental #performance #scalability #trust #visualisation

Trust me, I’m partially right: incremental visualization lets analysts explore large datasets faster (DF, IOP, SMD, MMCS), pp. 1673–1682.

ECIR-2012-ToramanC #categorisation #performance

Squeezing the Ensemble Pruning: Faster and More Accurate Categorization for News Portals (CT, FC), pp. 508–511.

ICPR-2012-AskKA #equation #performance #polynomial #symmetry

Exploiting p-fold symmetries for faster polynomial equation solving (EA, YK, KÅ), pp. 3232–3235.

KDD-2012-OuyangG #adaptation #named #performance

NASA: achieving lower regrets and faster rates via adaptive stepsizes (HO, AGG), pp. 159–167.

GPCE-2012-BauerEFP #adaptation #performance

Faster program adaptation through reward attribution inference (TB, ME, AF, JP), pp. 103–111.

FSE-2012-ParkHHCGTFX #named #performance

CarFast: achieving higher statement coverage faster (SP, BMMH, IH, CC, MG, KT, CF, QX), p. 35.

PPoPP-2012-SackG #algorithm #communication #performance

Faster topology-aware collective algorithms through non-minimal communication (PS, WG), pp. 45–54.

CSL-2012-ChatterjeeCK #algorithm #performance #refinement

Faster Algorithms for Alternating Refinement Relations (KC, SC, PK), pp. 167–182.

ICDAR-2011-LouradourK #categorisation #documentation #feature model #image #performance

Sample-Dependent Feature Selection for Faster Document Image Categorization (JL, CK), pp. 309–313.

VLDB-2011-JoshiCNDH #email #performance

Auto-Grouping Emails For Faster E-Discovery (SJ, DC, KN, PMD, TH), pp. 1284–1294.

STOC-2011-ChristianoKMST #approximate #graph #performance

Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs (PC, JAK, AM, DAS, SHT), pp. 273–282.

KDD-2011-ChangR #convergence #linear #memory management #modelling #performance #scalability

Selective block minimization for faster convergence of limited memory large-scale linear models (KWC, DR), pp. 699–707.

SIGIR-2011-DingS #documentation #performance #retrieval #using

Faster top-k document retrieval using block-max indexes (SD, TS), pp. 993–1002.

SIGIR-2011-HeS #performance #query #version control

Faster temporal range queries over versioned text (JH, TS), pp. 565–574.

CC-2011-NaeemL #alias #analysis #performance #set #summary #using

Faster Alias Set Analysis Using Summaries (NAN, OL), pp. 82–103.

SAT-2011-RyvchinS #performance #satisfiability

Faster Extraction of High-Level Minimal Unsatisfiable Cores (VR, OS), pp. 174–187.

DATE-2010-PeiLL #generative #testing

An on-chip clock generation scheme for faster-than-at-speed delay testing (SP, HL, XL), pp. 1353–1356.

STOC-2010-Madry #algorithm #approximate #graph #multi #performance #problem

Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms (AM), pp. 121–130.

ICALP-v1-2010-FakcharoenpholLN #algorithm #performance #problem

Faster Algorithms for Semi-matching Problems (Extended Abstract) (JF, BL, DN), pp. 176–187.

CHI-2010-HarrisonYH #performance #visual notation

Faster progress bars: manipulating perceived duration with visual augmentations (CH, ZY, SEH), pp. 1545–1548.

KDD-2010-TangAOM #empirical #framework #performance

Overlapping experiment infrastructure: more, better, faster experimentation (DT, AA, DO, MM), pp. 17–26.

KDIR-2010-ViswanathBK #classification #nearest neighbour #performance #set

A Method to Generate a Reduced Training Set for Faster and Better Nearest Neighbor Classification (PV, VSB, TNK), pp. 232–236.

LDTA-2010-BastenV #ambiguity #detection #performance

Faster ambiguity detection by grammar filtering (BB, JJV), p. 5.

DATE-2009-ChambersMV #generative #performance #satisfiability

Faster SAT solving with better CNF generation (BC, PM, DV), pp. 1590–1595.

ICALP-v1-2009-BilleT #performance #regular expression

Faster Regular Expression Matching (PB, MT), pp. 171–182.

ICALP-v1-2009-LamLTTW #energy #performance

Sleep with Guilt and Work Faster to Minimize Flow Plus Energy (TWL, LKL, HFT, IKKT, PWHW), pp. 665–676.

OOPSLA-2009-TsafrirWBS #dependence #performance #source code

Minimizing dependencies within generic classes for faster and smaller programs (DT, RWW, DFB, BS), pp. 425–444.

SAC-2009-HendersonCL #performance

Exploiting join cardinality for faster hash joins (MH, BC, RL), pp. 1549–1554.

CC-2009-EconomopoulosKV #glr #parsing #performance

Faster Scannerless GLR Parsing (GRE, PK, JJV), pp. 126–141.

LCTES-2009-BlazyR #performance

Live-range unsplitting for faster optimal coalescing (SB, BR), pp. 70–79.

DAC-2008-DargaSM #performance #symmetry #using

Faster symmetry discovery using sparsity of symmetries (PTD, KAS, ILM), pp. 149–154.

STOC-2008-DaitchS #algorithm #approximate #performance

Faster approximate lossy generalized flow via interior point algorithms (SID, DAS), pp. 451–460.

ICALP-A-2008-HaeuplerKMST #algorithm #incremental #performance

Faster Algorithms for Incremental Topological Ordering (BH, TK, RM, SS, RET), pp. 421–433.

ICALP-A-2008-Koutis #algebra #algorithm #performance #problem

Faster Algebraic Algorithms for Path and Packing Problems (IK), pp. 575–586.

CAV-2008-KupferschmidWNP #performance #question

Faster Than Uppaal? (SK, MW, BN, AP), pp. 552–555.

TACAS-2007-Horn #algorithm #game studies #performance

Faster Algorithms for Finitary Games (FH), pp. 472–484.

TACAS-2007-ZhangHEJ #algorithm #performance #probability #simulation

Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations (LZ, HH, FE, DNJ), pp. 155–169.

STOC-2007-Furer #integer #multi #performance

Faster integer multiplication (MF), pp. 57–66.

LATA-2007-OgasawaraK #approximate #performance #product line

Stochastically Approximating Tree Grammars by Regular Grammars and Its Application to Faster ncRNA Family Annotation (KO, SK), pp. 461–472.

ICFP-2007-MarlowYJ #lazy evaluation #performance #pointer #using

Faster laziness using dynamic pointer tagging (SM, ARY, SLPJ), pp. 277–288.

DATE-2006-AhmedM #design #performance #uml #using

Faster exploration of high level design alternatives using UML for better partitions (WA, DM), pp. 579–580.

DATE-DF-2006-BannowHR #automation #clustering #design #evaluation #performance

Automatic systemC design configuration for a faster evaluation of different partitioning alternatives (NB, KH, WR), pp. 217–218.

ICALP-v1-2006-ColeKL #performance

Suffix Trays and Suffix Trists: Structures for Faster Text Indexing (RC, TK, ML), pp. 358–369.

ICALP-v1-2006-HariharanKM #algorithm #graph #performance

A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs (RH, TK, KM), pp. 250–261.

CHI-2006-CockburnGA #documentation #navigation #performance

Faster document navigation with space-filling thumbnails (AC, CG, JA), pp. 1–10.

LCTES-2006-SandbergEGL #analysis #performance #slicing

Faster WCET flow analysis by program slicing (CS, AE, JG, BL), pp. 103–112.

LICS-2006-PitermanP #game studies #performance

Faster Solutions of Rabin and Streett Games (NP, AP), pp. 275–284.

SAT-2006-DantsinW #constant #performance #satisfiability

MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s2) Time (ED, AW), pp. 266–276.

ASE-2005-CassO #design #performance #process

Process support to help novices design software faster and better (AGC, LJO), pp. 295–299.

DAC-2005-BrennerS #algorithm #performance

Faster and better global placement by a new transportation algorithm (UB, MS), pp. 591–596.

DATE-2005-ShenQL #algorithm #analysis #performance

A Faster Counterexample Minimization Algorithm Based on Refutation Analysis (SS, YQ, SL), pp. 672–677.

ICALP-2005-BilleG #performance #problem

The Tree Inclusion Problem: In Optimal Space and Faster (PB, ILG), pp. 66–77.

ICALP-2005-Farach-ColtonLST #approximate #performance #string

Optimal Spaced Seeds for Faster Approximate String Matching (MFC, GML, SCS, DT), pp. 1251–1262.

ICALP-2005-GairingMW #algorithm #approximate #combinator #parallel #performance #scheduling

A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines (MG, BM, AW), pp. 828–839.

RTA-2005-LynchM #equation #performance

Faster Basic Syntactic Mutation with Sorts for Some Separable Equational Theories (CL, BM), pp. 90–104.

SAT-2005-Wahlstrom #performance #satisfiability

Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable (MW), pp. 309–323.

ICALP-2004-KavithaMMP #algorithm #graph #performance

A Faster Algorithm for Minimum Cycle Basis of Graphs (TK, KM, DM, KEP), pp. 846–857.

CIKM-2003-WuSC #performance #web

Finding more useful information faster from web search results (YfBW, LS, XC), pp. 568–571.

ICML-2003-JinYZH #algorithm #exponential #performance #scalability

A Faster Iterative Scaling Algorithm for Conditional Exponential Model (RJ, RY, JZ, AGH), pp. 282–289.

ICML-2003-SchoknechtM #algorithm #performance

TD(0) Converges Provably Faster than the Residual Gradient Algorithm (RS, AM), pp. 680–687.

LICS-2003-DanosD #approximate #markov #performance #process

Labelled Markov Processes: Stronger and Faster Approximations (VD, JD), pp. 341–350.

ICALP-2002-Pettie #algorithm #graph #performance

A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs (SP), pp. 85–97.

ICML-2002-Seewald #how #performance

How to Make Stacking Better and Faster While Also Taking Care of an Unknown Weakness (AKS), pp. 554–561.

CADE-2002-StumpD #framework #logic #performance #proving

Faster Proof Checking in the Edinburgh Logical Framework (AS, DLD), pp. 392–407.

ICALP-2001-Sibeyn #performance

Faster Gossiping on Butterflies (JFS), pp. 785–796.

DATE-2000-BrennerV #performance

Faster Optimal Single-Row Placement with Fixed Ordering (UB, JV), pp. 117–121.

STOC-2000-ColeH #performance

Faster suffix tree construction with missing suffix links (RC, RH), pp. 407–415.

STOC-1999-LovaszK #performance

Faster Mixing via Average Conductance (LL, RK), pp. 282–287.

CC-1999-AycockH #glr #parsing #performance

Faster Generalized LR Parsing (JA, RNH), pp. 32–46.

ICALP-1998-Hagerup #performance #ram

Simpler and Faster Dictionaries on the AC0 RAM (TH), pp. 79–90.

STOC-1997-Pan #equation #performance

Faster Solution of the Key Equation for Decoding BCH Error-Correcting Codes (VYP), pp. 168–175.

SAS-1996-FechtS #equation #performance

An Even Faster Solver for General Systems of Equations (CF, HS), pp. 189–204.

STOC-1996-Spielman #graph #morphism #performance #testing

Faster Isomorphism Testing of Strongly Regular Graphs (DAS), pp. 576–584.

ICFP-1996-JonesPS #float #named #performance #source code

Let-floating: Moving Bindings to Give Faster Programs (SLPJ, WP, AS), pp. 1–12.

POPL-1996-JacksonJD #performance #specification

Faster Checking of Software Specifications by Eliminating Isomorphs (DJ, SJ, CD), pp. 79–90.

CC-1996-McLeanH #earley #parsing #performance

A Faster Earley Parser (PM, RNH), pp. 281–293.

STOC-1994-KleinRRS #algorithm #graph #performance

Faster shortest-path algorithms for planar graphs (PNK, SR, MRH, SS), pp. 27–37.

ICALP-1994-YusterZ #performance

Finding Even Cycles Even Faster (RY, UZ), pp. 532–543.

DAC-1993-AlpertK #clustering #geometry #multi #performance

Geometric Embeddings for Faster and Better Multi-Way Netlist Partitioning (CJA, ABK), pp. 743–748.

STOC-1992-Rao #algorithm #graph #performance

Faster Algorithms for Finding Small Edge Cuts in Planar Graphs (Extended Abstract) (SR), pp. 229–240.

ML-1992-McCallum #learning #performance #proximity #using

Using Transitional Proximity for Faster Reinforcement Learning (AM), pp. 316–321.

SIGIR-1992-FoxCH #algorithm #performance

A Faster Algorithm for Constructing Minimal Perfect Hash Functions (EAF, QFC, LSH), pp. 266–273.

CAV-1992-CleavelandKS #calculus #model checking #performance #μ-calculus

Faster Model Checking for the Modal μ-Calculus (RC, MK, BS), pp. 410–422.

STOC-1990-KleinST #algorithm #approximate #concurrent #performance

Leighton-Rao Might Be Practical: Faster Approximation Algorithms for Concurrent Flow with Uniform Capacities (PNK, CS, ÉT), pp. 310–321.

NACLP-1989-SaletoreK #execution #logic programming #parallel #performance #source code

Obtaining First Solutions Faster in AND-OR Parallel Execution of Logic Programs (VAS, LVK), pp. 390–406.

STOC-1988-Orlin #algorithm #performance

A Faster Strongly Polynominal Minimum Cost Flow Algorithm (JBO), pp. 377–387.

LFP-1988-Norman #combinator #hardware #performance #reduction #using

Faster Combinator Reduction Using stock Hardware (ACN), pp. 235–243.

DAC-1987-SmithSS #architecture #parallel #performance #simulation

Faster Architectural Simulation Through Parallelism (JWS, KSS, RJSI), pp. 189–194.

GG-1982-Staples #evaluation #performance #representation

Two-level expression representation for faster evaluation (JS), pp. 392–404.