21 papers:
ICML-2015-HockingRB #detection #learning #named #segmentation- PeakSeg: constrained optimal segmentation and supervised penalty learning for peak detection in count data (TH, GR, GB), pp. 324–332.
HPCA-2014-ChenZWP #named #performance- MP3: Minimizing performance penalty for power-gating of Clos network-on-chip (LC, LZ, RW, TMP), pp. 296–307.
ICML-c3-2013-HockingRVB #detection #learning #using- Learning Sparse Penalties for Change-point Detection using Max Margin Interval Regression (TH, GR, JPV, FRB), pp. 172–180.
CASE-2012-KimMBS #image- An improved rigidity penalty for deformable registration of head and neck images in intensity-modulated radiation therapy (JK, MM, JB, KS), pp. 377–382.
DATE-2011-NicolaidisBZ- Eliminating speed penalty in ECC protected memories (MN, TB, NEZ), pp. 1614–1619.
ICML-2011-HockingVBJ #algorithm #clustering #named #using- Clusterpath: an Algorithm for Clustering using Convex Fusion Penalties (TH, JPV, FRB, AJ), pp. 745–752.
SAC-2011-LiuQR #online #realtime #scheduling- On-line scheduling of real-time services with profit and penalty (SL, GQ, SR), pp. 1476–1481.
ICML-2010-GoldbergE #classification- Boosting Classifiers with Tightened L0-Relaxation Penalties (NG, JE), pp. 383–390.
ICML-2010-ZhangS #reduction- Projection Penalties: Dimension Reduction without Loss (YZ, JGS), pp. 1223–1230.
SAC-2010-YuRCW #execution #scheduling- Profit and penalty aware (PP-aware) scheduling for tasks with variable task execution time (YY, SR, NC, XW), pp. 334–339.
ICSE-2010-WangZ #case study #development #multi #policy- Penalty policies in professional software development practice: a multi-method field study (YW, MZ), pp. 39–47.
DATE-2008-ParkSP #embedded #execution #using- Hiding Cache Miss Penalty Using Priority-based Execution for Embedded Processors (SP, AS, YP), pp. 1190–1195.
KR-2008-Chetcuti-SperandioL #how #logic #strict- How to Choose Weightings to Avoid Collisions in a Restricted Penalty Logic (NCS, SL), pp. 340–347.
KR-2006-BonetG #heuristic #using- Heuristics for Planning with Penalties and Rewards using Compiled Knowledge (BB, HG), pp. 452–462.
SCAM-2005-Anderson #performance #xml- The Performance Penalty of XML for Program Intermediate Representations (PA), pp. 193–202.
HPCA-2004-GandhiAS #branch #predict- Reducing Branch Misprediction Penalty via Selective Branch Recovery (AG, HA, STS), pp. 254–264.
CGO-2003-CollardL #optimisation- Optimizations to Prevent Cache Penalties for the Intel ® Itanium 2 Processor (JFC, DML), pp. 105–114.
ECOOP-2002-ArnoldR #effectiveness- Thin Guards: A Simple and Effective Technique for Reducing the Penalty of Dynamic Class Loading (MA, BGR), pp. 498–524.
SIGMOD-1996-MogiK #case study- Hot Mirroring: A Study to Hide Parity Upgrade Penalty and Degradations During Rebuilds for RAID5 (KM, MK), pp. 183–194.
ASPLOS-1991-KatevenisT #branch #memory management- Reducing the Branch Penalty by Rearranging Instructions in Double-Width Memory (MK, NT), pp. 15–27.
PLDI-1988-Chow- Minimizing Register Usage Penalty at Procedure Calls (FCC), pp. 85–94.