54 papers:
RecSys-2015-KoukiFFEG #flexibility #framework #hybrid #named #probability #recommendation- HyPER: A Flexible and Extensible Probabilistic Framework for Hybrid Recommender Systems (PK, SF, JRF, ME, LG), pp. 99–106.
SIGIR-2015-KellyA #behaviour #case study #experience #how #user interface- How many results per page?: A Study of SERP Size, Search Behavior and User Experience (DK, LA), pp. 183–192.
CASE-2014-BrundageCLAX #energy- Utilizing energy opportunity windows and energy profit bottlenecks to reduce energy consumption per part for a serial production line (MPB, QC, YL, JA, GX), pp. 461–466.
DATE-2014-LongLY #analysis #bound #evaluation #modelling #multi- Analysis and evaluation of per-flow delay bound for multiplexing models (YL, ZL, XY), pp. 1–4.
SAC-2014-LeePKH #clustering- Per-cluster allocation of relocation staff on electric vehicle sharing systems (JL, GLP, JK, NH), pp. 1541–1542.
DAC-2013-Ghosh #memory management- Path to a TeraByte of on-chip memory for petabit per second bandwidth with < 5watts of power (SG), p. 2.
DATE-2013-GaoBW #paradigm #performance- A new paradigm for trading off yield, area and performance to enhance performance per wafer (YG, MAB, YW), pp. 1753–1758.
POPL-2013-UpadrastaC #scheduling #using- Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra (RU, AC), pp. 483–496.
DAC-2012-GhasemiSSK #effectiveness #power management- Cost-effective power delivery to support per-core voltage domains for power-constrained processors (HRG, AAS, MJS, NSK), pp. 56–61.
VLDB-2012-HallBBGN- Processing a Trillion Cells per Mouse Click (AH, OB, RB, SG, MN), pp. 1436–1446.
CIKM-2012-WangC #learning #predict #word- Learning to predict the cost-per-click for your ad words (CJW, HHC), pp. 2291–2294.
ICPR-2012-DAmbrosioIS #learning #re-engineering- A One-per-Class reconstruction rule for class imbalance learning (RD, GI, PS), pp. 1310–1313.
RecSys-2012-KluverNESR #how #question #rating- How many bits per rating? (DK, TTN, MDE, SS, JR), pp. 99–106.
SIGIR-2012-RobertsonK #evaluation #information retrieval #on the #topic- On per-topic variance in IR evaluation (SER, EK), pp. 891–900.
QoSA-ISARCS-2011-KoziolekKR #architecture #automation #multi #named #optimisation- PerOpteryx: automated application of tactics in multi-objective software architecture optimization (AK, HK, RHR), pp. 33–42.
VLDB-2011-FunkeKN #query #transaction- HyPer-sonic Combined Transaction AND Query Processing (FF, AK, TN), pp. 1367–1370.
SIGIR-2011-SakaiS #using- Evaluating diversified search results using per-intent graded relevance (TS, RS), pp. 1043–1052.
ICPR-2010-MozaffariBA #classification #gender #geometry #image #using- Gender Classification Using Single Frontal Image Per Person: Combination of Appearance and Geometric Based Features (SM, HB, RA), pp. 1192–1195.
DAC-2009-LeeK #manycore #optimisation #throughput #using- Optimizing throughput of power- and thermal-constrained multicore processors using DVFS and per-core power-gating (JL, NSK), pp. 47–50.
ASPLOS-2009-EyermanE #smt #thread- Per-thread cycle accounting in SMT processors (SE, LE), pp. 133–144.
HPCA-2009-PowellBEMSY #named #parametricity #runtime #using- CAMP: A technique to estimate per-structure power at run-time using a few simple parameters (MDP, AB, JSE, SSM, BRS, SMY), pp. 289–300.
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-JurdzinskiLR #automaton #game studies #hybrid- Average-Price-per-Reward Games on Hybrid Automata with Strong Resets (MJ, RL, MR), pp. 167–181.
HPCA-2008-KimGWB #analysis #performance #using- System level analysis of fast, per-core DVFS using on-chip switching regulators (WK, MSG, GYW, DMB), pp. 123–134.
ECIR-2007-HeO #normalisation- Setting Per-field Normalisation Hyper-parameters for the Named-Page Finding Search Task (BH, IO), pp. 468–480.
ISSTA-2006-McMinnHBT #approach #generative #testing- The species per path approach to SearchBased test data generation (PM, MH, DB, PT), pp. 13–24.
SAS-2005-HuntM- The PER Model of Abstract Non-interference (SH, IM), pp. 171–185.
CIKM-2005-SimonL #automation #information management #named #visual notation- ViPER: augmenting automatic information extraction with visual perceptions (KS, GL), pp. 381–388.
SAT-2005-Wahlstrom #performance #satisfiability- Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable (MW), pp. 309–323.
ICPR-v1-2004-LeL #image #markov #modelling #using- Recognizing Frontal Face Images Using Hidden Markov Models with One Training Image per Person (HSL, HL), pp. 318–321.
SAT-2004-HooryS #satisfiability- Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable (SH, SS), pp. 86–95.
ICALP-2002-GuhaIMS #data type #performance- Histogramming Data Streams with Fast Per-Item Processing (SG, PI, SM, MS), pp. 681–692.
LOPSTR-2002-SimonKH #abstract domain #difference #linear- Two Variables per Linear Inequality as an Abstract Domain (AS, AK, JMH), pp. 71–89.
CSL-2001-AbramskyL #modelling #λ-calculus- Fully Complete Minimal PER Models for the Simply Typed λ-Calculus (SA, ML), pp. 443–457.
ICALP-2000-MargaraS #network #problem- Wavelength Assignment Problem on All-Optical Networks with k Fibres per Link (LM, JS), pp. 768–779.
CSL-2000-AbramskyL #ml #polymorphism- A Fully Complete PER Model for ML Polymorphic Types (SA, ML), pp. 140–155.
ESOP-1999-SabelfeldS #data flow #source code- A Per Model of Secure Information Flow in Sequential Programs (AS, DS), pp. 40–58.
CIKM-1999-AdarKS #named- Haystack: Per-User Information Environments (EA, DRK, LAS), pp. 413–422.
VLDB-1998-CarinoO #execution #optimisation #parallel- Plan-Per-Tuple Optimization Solution — Parallel Execution of Expensive User-Defined Functions (FC, WO), pp. 690–695.
VLDB-1997-GarofalakisOS #database #scheduling- Resource Scheduling in Enhanced Pay-Per-View Continuous Media Databases (MNG, BÖ, AS), pp. 516–525.
STOC-1997-Reif #approximate #constant #evaluation #polynomial- Approximate Complex Polynomial Evaluation in Near Constant Work Per Point (JHR), pp. 30–39.
STOC-1995-HenzingerK #algorithm #graph #random- Randomized dynamic graph algorithms with polylogarithmic time per operation (MRH, VK), pp. 519–527.
PLILP-1995-MycroftS #analysis- Uniform PERs and Comportment Analysis (AM, KLS), pp. 169–187.
TLCA-1995-BellucciAC #morphism #parametricity #polymorphism- A Model for Formal Parametric Polymorphism: A PER Interpretation for System R (RB, MA, PLC), pp. 32–46.
PEPM-1994-Davis #analysis- PERs from Projections for Binding-Time Analysis (KD), pp. 53–60.
CHI-1994-TaniHYTF94a #bibliography #named #scalability- Courtyard: integrating shared overview on a large screen and per-user detail on individual screens (MT, MH, KY, KT, MF), pp. 44–50.
POPL-1992-BruceM #higher-order #modelling #morphism #polymorphism #recursion #type system- PER Models of Subtyping, Recursive Types and Higher-Order Polymorphism (KBB, JCM), pp. 316–327.
STOC-1991-CohenM #algorithm #difference #linear- Improved Algorithms for Linear Inequalities with Two Variables per Inequality (Extended Abstract) (EC, NM), pp. 145–155.
LICS-1990-AbadiP #morphism #polymorphism #recursion- A Per Model of Polymorphism and Recursive Types (MA, GDP), pp. 355–365.
LICS-1990-FreydMRS- Extensional PERs (PJF, PM, GR, DSS), pp. 346–354.
SOSP-1989-BarkleyL #bound #lazy evaluation- A Lazy Buddy System Bounded by Two Coalescing Delays per Class (REB, TPL), pp. 167–176.
LICS-1989-Robinson #how #question- How Complete is PER? (ER), pp. 106–111.
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.
STOC-1986-Seidel- Constructing Higher-Dimensional Convex Hulls at Logarithmic Cost per Face (RS), pp. 404–413.