Tag #performance
8018 papers:
POPL-2020-Pavlogiannis #effectiveness #predict- Fast, sound, and effectively complete dynamic race prediction (AP), p. 29.
ASPLOS-2020-0002PJ #how #why- Why GPUs are Slow at Executing NFAs and How to Make them Faster (HL0, SP, AJ), pp. 251–265.
- ASPLOS-2020-AbeydeeraS #named #parallel
- Chronos: Efficient Speculative Parallelism for Accelerators (MA, DS0), pp. 1247–1262.
- ASPLOS-2020-ChenLYWWS #memory management #named #persistent
- FlatStore: An Efficient Log-Structured Key-Value Storage Engine for Persistent Memory (YC, YL, FY, QW, YW, JS), pp. 1077–1091.
- ASPLOS-2020-GhasemazarNL #clustering #named
- Thesaurus: Efficient Cache Compression via Dynamic Clustering (AG, PN, ML), pp. 527–540.
- ASPLOS-2020-HyunKCKR #architecture #named
- NeuMMU: Architectural Support for Efficient Address Translations in Neural Processing Units (BH, YK, YC, JK, MR), pp. 1109–1124.
- ASPLOS-2020-KarandikarOAMKN #co-evolution #design #hardware #named #profiling
- FirePerf: FPGA-Accelerated Full-System Hardware/Software Performance Profiling and Co-Design (SK, AJO, AA, HM, RHK, BN, KA), pp. 715–731.
- ASPLOS-2020-KatsarakisGKJDG #fault tolerance #named #protocol #replication
- Hermes: A Fast, Fault-Tolerant and Linearizable Replication Protocol (AK, VG, MRSK, AJ, AD, BG, VN), pp. 201–217.
- ASPLOS-2020-KimPCKOMK #architecture #named
- Evanesco: Architectural Support for Efficient Data Sanitization in Modern Flash-Based Storage Systems (MK, JP, GC, YK, LO, OM, JK), pp. 1311–1326.
- ASPLOS-2020-LiD0 #architecture #design #quantum #towards
- Towards Efficient Superconducting Quantum Processor Architecture Design (GL, YD, YX0), pp. 1031–1045.
- ASPLOS-2020-LiHNGGPZBGB #named
- LeapIO: Efficient and Portable Virtual NVMe Storage on ARM SoCs (HL, MH, SN, VG, SG, DRKP, IZ, RB, HSG, AB), pp. 591–605.
- ASPLOS-2020-LimN #hardware #optimisation #using
- Optimizing Nested Virtualization Performance Using Direct Virtual Hardware (JTL, JN), pp. 557–574.
- ASPLOS-2020-MaZCSWQ #architecture #data type #framework #implementation #named #persistent #symmetry
- AsymNVM: An Efficient Framework for Implementing Persistent Data Structures on Asymmetric NVM Architecture (TM, MZ, KC, ZS, YW, XQ), pp. 757–773.
- ASPLOS-2020-MemaripourIS #data type #named #persistent
- Pronto: Easy and Fast Persistence for Volatile Data Structures (AM, JI, SS), pp. 789–806.
- ASPLOS-2020-MinBLNK #architecture #effectiveness #named #scalability
- CryoCache: A Fast, Large, and Cost-Effective Cache Architecture for Cryogenic Computing (DM, IB, GhL, SN, JK), pp. 449–464.
- ASPLOS-2020-SadrediniRLSS #adaptation #automaton #named
- FlexAmata: A Universal and Efficient Adaption of Applications to Spatial Automata Processing Accelerators (ES, RR, ML, MS, KS), pp. 219–234.
- ASPLOS-2020-ShenTCCWXXY #multi #named
- Occlum: Secure and Efficient Multitasking Inside a Single Enclave of Intel SGX (YS, HT, YC, KC, RW, YX, YX, SY), pp. 955–970.
- ASPLOS-2020-XuSS #memory management #named #persistent #reduction #security
- MERR: Improving Security of Persistent Memory Objects via Efficient Memory Exposure Reduction and Randomization (YX, YS, XS), pp. 987–1000.
- ASPLOS-2020-ZhangSYZS0 #execution #named #obfuscation
- Klotski: Efficient Obfuscated Execution against Controlled-Channel Attacks (PZ, CS, HY, DZ, ES, HJ0), pp. 1263–1276.
CC-2020-ChenKKVH #automation #database #query- Improving database query performance with automatic fusion (HC, AK, BK, CV, LJH), pp. 63–73.
- CC-2020-GorgovanCL #case study #development #tool support
- Balancing performance and productivity for the development of dynamic binary instrumentation tools: a case study on Arm systems (CG, GC, ML), pp. 132–142.
- CC-2020-PizzutiSD #functional #generative #information retrieval #matrix #multi
- Generating fast sparse matrix vector multiplication from a high level generic functional IR (FP, MS, CD), pp. 85–95.
- CC-2020-SerranoF #javascript #towards
- Dynamic property caches: a step towards faster JavaScript proxy objects (MS, RBF), pp. 108–118.
CGO-2020-DamaniJSKYMG - Speculative reconvergence for improved SIMT efficiency (SD, DRJ, MS, SWK, EY, MM, OG), pp. 121–132.
- CGO-2020-IsmailS #manycore
- Efficient nursery sizing for managed languages on multi-core processors with shared caches (MI, GES), pp. 1–15.
- CGO-2020-KangCP #framework #named #precise #scalability
- PreScaler: an efficient system-aware precision scaling framework on heterogeneous systems (SK, KC, YP), pp. 280–292.
- CGO-2020-WangYZM #hardware #memory management #scalability #transaction
- Efficient and scalable cross-ISA virtualization of hardware transactional memory (WW, PCY, AZ, SM), pp. 107–120.
ECSA-2019-Yasaweerasinghelage #architecture #optimisation #security- Optimising Architectures for Performance, Cost, and Security (RY, MS, HYP, IW), pp. 161–177.
ICSA-2019-ArcelliCPET #architecture #modelling #runtime #traceability- Exploiting Architecture/Runtime Model-Driven Traceability for Performance Improvement (DA, VC, DDP, RE, MT0), pp. 81–90.
- ICSA-2019-EismannGWKK #architecture #modelling #statistics
- Integrating Statistical Response Time Models in Architectural Performance Models (SE, JG, JW, JvK, SK), pp. 71–80.
EDM-2019-BoumiV #markov #modelling #student- Application of Hidden Markov Models to quantify the impact of enrollment patterns on student performance (SB, AV).
- EDM-2019-CaoPB #analysis #learning
- Incorporating Prior Practice Difficulty into Performance Factor Analysis to Model Mandarin Tone Learning (MC, PIPJ, GMB).
- EDM-2019-DoanS #predict #student
- Rank-Based Tensor Factorization for Student Performance Prediction (TND, SS).
- EDM-2019-EmondV #3d #learning #predict #visualisation
- Visualizing Learning Performance Data and Model Predictions as Objects in a 3D Space (BE, JJV).
- EDM-2019-FlemmingSMCS #evaluation #game studies
- A generalizable performance evaluation model of driving games via risk-weighted trajectories (RF, ES, DM, PCL, PS).
- EDM-2019-HuR #estimation #graph #network
- Academic Performance Estimation with Attention-based Graph Convolutional Networks (QH, HR).
- EDM-2019-KarumbaiahOB #behaviour #metric #student
- The Influence of School Demographics on the Relationship Between Students' Help-Seeking Behavior and Performance and Motivational Measures (SK, JO, RSB).
- EDM-2019-OliveiraM #bias #identification #student
- Identifying bias and underlying knowledge structures in Brazilian National Exam of Students Performance (MSO, CEM).
- EDM-2019-Unal #composition #modelling #student #using
- Modeling Student Performance and Disengagement Using Decomposition of Response Time Data (DSU).
ICSME-2019-Alshoaibi - Characterizing Performance Regression Introducing Code Changes (DA), pp. 634–638.
- ICSME-2019-Gallaba #deployment #integration #robust
- Improving the Robustness and Efficiency of Continuous Integration and Deployment (KG), pp. 619–623.
- ICSME-2019-Khalil #debugging #policy
- Studying the Impact of Policy Changes on Bug Handling Performance (ZAK), pp. 590–594.
- ICSME-2019-LyuAH #mobile #sql
- Quantifying the Performance Impact of SQL Antipatterns on Mobile Applications (YL, AA, WGJH), pp. 53–64.
- ICSME-2019-Shah #analysis #data type #framework
- Lib Metamorphosis: A Performance Analysis Framework for Exchanging Data Structures in Performance Sensitive Applications (MDS), pp. 379–381.
SANER-2019-ArcelliCP #automation #detection #modelling #refactoring #uml- Automating Performance Antipattern Detection and Software Refactoring in UML Models (DA, VC, DDP), pp. 639–643.
- IFM-2019-Benoit0 #alias #embedded #programming
- Uniqueness Types for Efficient and Verifiable Aliasing-Free Embedded Systems Programming (TB, BJ0), pp. 46–64.
- IFM-2019-CoullonJL #design #distributed #model checking
- Integrated Model-Checking for the Design of Safe and Efficient Distributed Software Commissioning (HC, CJ, DL), pp. 120–137.
SEFM-2019-OliveiraCO #kernel #linux #verification- Efficient Formal Verification for the Linux Kernel (DBdO, TC, RSdO), pp. 315–332.
Haskell-2019-DownenSAJ - Making a faster Curry with extensional types (PD, ZS, ZMA, SPJ), pp. 58–70.
- ICFP-2019-MiraldoS #algorithm #difference #type safety
- An efficient algorithm for type-safe structural diffing (VCM, WS), p. 29.
- ICFP-2019-ShaikhhaFVJ #functional #programming
- Efficient differentiable programming in a functional array-processing language (AS, AF, DV, SPJ), p. 30.
- ICFP-2019-WaliaNCTS #algorithm
- From high-level inference algorithms to efficient code (RW, PN, JC, STH, CcS), p. 30.
AIIDE-2019-Schiffer #game studies #how- How Actors Can Animate Game Characters: Integrating Performance Theory in the Emotion Model of a Game Character (SS), pp. 227–229.
CoG-2019-Eidelberg0D #game studies #using- Using Active Probing by a Game Management AI to Faster Classify Players (AE, CJ0, JD), pp. 1–8.
- CoG-2019-LiuR0S #heuristic #using
- Using Restart Heuristics to Improve Agent Performance in Angry Birds (TL, JR, PZ0, MS), pp. 1–8.
- CoG-2019-RatcliffeHD #optimisation #policy
- Win or Learn Fast Proximal Policy Optimisation (DSR, KH, SD), pp. 1–4.
DiGRA-2019-BryanT #adaptation #game studies- Adapting the Empty Orchestra: the Performance of Play in Karaoke (JSB, TJT).
- DiGRA-2019-Ho #experience
- Exploring the Effects of VR Gameplay Videos on Performance and Experience (JCFH).
FDG-2019-KaoS #game studies #how- Exploring how preference and perceived performance vary in different game genres across time of day (DK, JJDS), p. 5.
- FDG-2019-RobertsonJY #design
- Efficient choice enumeration for narrative world design (JR, AJ, RMY), p. 10.
- VS-Games-2019-BornAM #game studies #motivation
- Exergaming in VR: The Impact of Immersive Embodiment on Motivation, Performance, and Perceived Exertion (FB, SA, MM), pp. 1–8.
- VS-Games-2019-Jercic #game studies #metric #predict #set #what
- What could the baseline measurements predict about decision-making performance in serious games set in the financial context (PJ), pp. 1–4.
CIKM-2019-0002LG #data type #semistructured data- Efficient Join Processing Over Incomplete Data Streams (WR0, XL, KG), pp. 209–218.
- CIKM-2019-ChekolS #graph
- Leveraging Graph Neighborhoods for Efficient Inference (MWC, HS), pp. 1893–1902.
- CIKM-2019-ChenSTCS #network #random
- Fast and Accurate Network Embeddings via Very Sparse Random Projection (HC, SFS, YT, MC, SS), pp. 399–408.
- CIKM-2019-DongSLLQZD
- Forecasting Pavement Performance with a Feature Fusion LSTM-BPNN Model (YD, YS, XL, SL, LQ, WZ0, JD), pp. 1953–1962.
- CIKM-2019-DongZ #algorithm #set
- Faster Algorithms for k-Regret Minimizing Sets via Monotonicity and Sampling (QD, JZ), pp. 2213–2216.
- CIKM-2019-FujiwaraIKKAU #algorithm #bound #incremental #random
- Fast Random Forest Algorithm via Incremental Upper Bound (YF, YI, SK, AK, JA, NU), pp. 2205–2208.
- CIKM-2019-GaoLL0 #effectiveness #retrieval
- A Lossy Compression Method on Positional Index for Efficient and Effective Retrieval (SG, JL, XL, GW0), pp. 2317–2320.
- CIKM-2019-MauryaLM #approximate #graph #network
- Fast Approximations of Betweenness Centrality with Graph Neural Networks (SKM, XL0, TM), pp. 2149–2152.
- CIKM-2019-RekatsinasDP #adaptation #crowdsourcing #named #query
- CRUX: Adaptive Querying for Efficient Crowdsourced Data Extraction (TR, AD, AGP), pp. 841–850.
- CIKM-2019-Wang0CRR #algorithm #higher-order #parallel
- Efficient Sequential and Parallel Algorithms for Estimating Higher Order Spectra (ZW, AAM0, XC, NR, SR), pp. 1743–1752.
- CIKM-2019-WuWZJ #effectiveness #learning #recommendation
- Learning to Effectively Estimate the Travel Time for Fastest Route Recommendation (NW, JW, WXZ, YJ), pp. 1923–1932.
- CIKM-2019-YafayA #query
- Caching Scores for Faster Query Processing with Dynamic Pruning in Search Engines (EY, ISA), pp. 2457–2460.
ECIR-p1-2019-MalliaP - Faster BlockMax WAND with Longer Skipping (AM, EP), pp. 771–778.
- ECIR-p2-2019-PenhaCCGS #automation #classification #documentation #predict
- Document Performance Prediction for Automatic Text Classification (GP, RRC, SDC, MAG, RLTS), pp. 132–139.
- ECIR-p2-2019-Zlabinger #effectiveness
- Improving the Annotation Efficiency and Effectiveness in the Text Domain (MZ), pp. 343–347.
ICML-2019-0001PRW #algorithm #matrix- Faster Algorithms for Binary Matrix Factorization (RK0, RP, AR, DPW), pp. 3551–3559.
- ICML-2019-0002VBB #learning
- Provably Efficient Imitation Learning from Observation Alone (WS0, AV, BB, DB), pp. 6036–6045.
- ICML-2019-AgarwalBCHSZZ #adaptation
- Efficient Full-Matrix Adaptive Regularization (NA, BB, XC, EH, KS, CZ, YZ), pp. 102–110.
- ICML-2019-AgrawalTHB #interactive #kernel
- The Kernel Interaction Trick: Fast Bayesian Discovery of Pairwise Interactions in High Dimensions (RA, BLT, JHH, TB), pp. 141–150.
- ICML-2019-BeatsonA #optimisation #random
- Efficient optimization of loops and limits with randomized telescoping sums (AB, RPA), pp. 534–543.
- ICML-2019-BeygelzimerPSTW #algorithm #classification #linear #multi
- Bandit Multiclass Linear Classification: Efficient Algorithms for the Separable Case (AB, DP, BS, DT, CYW, CZ), pp. 624–633.
- ICML-2019-BibautMVL #evaluation #learning
- More Efficient Off-Policy Evaluation through Regularized Targeted Learning (AB, IM, NV, MJvdL), pp. 654–663.
- ICML-2019-ChenW0R #algorithm #graph #incremental
- Fast Incremental von Neumann Graph Entropy Computation: Theory, Algorithm, and Applications (PYC, LW, SL0, IR), pp. 1091–1101.
- ICML-2019-CohenB #analysis #empirical #modelling #sequence
- Empirical Analysis of Beam Search Performance Degradation in Neural Sequence Models (EC, JCB), pp. 1290–1299.
- ICML-2019-DaoGERR #algorithm #learning #linear #using
- Learning Fast Algorithms for Linear Transforms Using Butterfly Factorizations (TD, AG, ME, AR, CR), pp. 1517–1527.
- ICML-2019-DuKJAD0
- Provably efficient RL with Rich Observations via Latent State Decoding (SSD, AK, NJ, AA, MD, JL0), pp. 1665–1674.
- ICML-2019-FrognerP #flexibility
- Fast and Flexible Inference of Joint Distributions from their Marginals (CF, TAP), pp. 2002–2011.
- ICML-2019-GilboaB0 #learning #taxonomy
- Efficient Dictionary Learning with Gradient Descent (DG, SB, JW0), pp. 2252–2259.
- ICML-2019-GillenwaterKMV #process
- A Tree-Based Method for Fast Repeated Sampling of Determinantal Point Processes (JG, AK, ZM, SV), pp. 2260–2268.
- ICML-2019-GongHLQWL
- Efficient Training of BERT by Progressively Stacking (LG, DH, ZL, TQ, LW0, TYL), pp. 2337–2346.
- ICML-2019-GuY #algorithm #modelling #multi #ranking
- Fast Algorithm for Generalized Multinomial Models with Ranking Data (JG, GY), pp. 2445–2453.
- ICML-2019-HarshawFWK #algorithm
- Submodular Maximization beyond Non-negativity: Guarantees, Fast Algorithms, and Applications (CH, MF, JW, AK), pp. 2634–2643.
- ICML-2019-HazanKSS
- Provably Efficient Maximum Entropy Exploration (EH, SMK, KS, AVS), pp. 2681–2691.
- ICML-2019-HoLCSA #learning #policy
- Population Based Augmentation: Efficient Learning of Augmentation Policy Schedules (DH, EL, XC0, IS, PA), pp. 2731–2741.
- ICML-2019-HuangCH #multi #optimisation #probability
- Faster Stochastic Alternating Direction Method of Multipliers for Nonconvex Optimization (FH, SC, HH), pp. 2839–2848.
- ICML-2019-JangJ #clustering #scalability #towards
- DBSCAN++: Towards fast and scalable density clustering (JJ, HJ), pp. 3019–3029.
- ICML-2019-JeongKKN #graph #modelling #music #network
- Graph Neural Network for Music Score Data and Modeling Expressive Piano Performance (DJ, TK, YK, JN), pp. 3060–3070.
- ICML-2019-KleimanP #machine learning #metric #modelling #multi #named
- AUCμ: A Performance Metric for Multi-Class Machine Learning Models (RK, DP), pp. 3439–3447.
- ICML-2019-LeeW #algorithm #first-order #problem
- First-Order Algorithms Converge Faster than $O(1/k)$ on Convex Problems (CPL, SW), pp. 3754–3762.
- ICML-2019-LinHJ #algorithm #analysis #on the
- On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithms (TL, NH, MIJ), pp. 3982–3991.
- ICML-2019-LinKS #approximate
- Fast and Simple Natural-Gradient Variational Inference with Mixture of Exponential-family Approximations (WL, MEK, MWS), pp. 3992–4002.
- ICML-2019-LiuSX #learning
- Taming MAML: Efficient unbiased meta-reinforcement learning (HL, RS, CX), pp. 4061–4071.
- ICML-2019-MakkuvaVKO #algorithm #consistency
- Breaking the gridlock in Mixture-of-Experts: Consistent and Efficient Algorithms (AVM, PV, SK, SO), pp. 4304–4313.
- ICML-2019-MaTPHNZ #named
- EDDI: Efficient Dynamic Discovery of High-Value Information with Partial VAE (CM, ST, KP, JMHL, SN, CZ), pp. 4234–4243.
- ICML-2019-MavrinYKWY #learning
- Distributional Reinforcement Learning for Efficient Exploration (BM, HY, LK, KW, YY), pp. 4424–4434.
- ICML-2019-MendisRAC #estimation #named #network #throughput #using
- Ithemal: Accurate, Portable and Fast Basic Block Throughput Estimation using Deep Neural Networks (CM, AR, SPA, MC), pp. 4505–4515.
- ICML-2019-MeyerH #classification #kernel #statistics
- Optimality Implies Kernel Sum Classifiers are Statistically Efficient (RAM, JH), pp. 4566–4574.
- ICML-2019-MoonAS #black box #combinator #optimisation
- Parsimonious Black-Box Adversarial Attacks via Efficient Combinatorial Optimization (SM, GA, HOS), pp. 4636–4645.
- ICML-2019-MostafaW #network #parametricity
- Parameter efficient training of deep convolutional neural networks by dynamic sparse reparameterization (HM, XW), pp. 4646–4655.
- ICML-2019-PerraultPV #nondeterminism
- Exploiting structure of uncertainty for efficient matroid semi-bandits (PP, VP, MV), pp. 5123–5132.
- ICML-2019-RakellyZFLQ #learning #probability
- Efficient Off-Policy Meta-Reinforcement Learning via Probabilistic Context Variables (KR, AZ, CF, SL, DQ), pp. 5331–5340.
- ICML-2019-Ravi #modelling #using
- Efficient On-Device Models using Neural Projections (SR), pp. 5370–5379.
- ICML-2019-ReeveK #classification #robust #symmetry
- Fast Rates for a kNN Classifier Robust to Unknown Asymmetric Label Noise (HWJR, AK), pp. 5401–5409.
- ICML-2019-RoederGPDM
- Efficient Amortised Bayesian Inference for Hierarchical and Nonlinear Dynamical Systems (GR, PKG, AP, ND, EM), pp. 4445–4455.
- ICML-2019-RollandKISC #learning #probability #testing
- Efficient learning of smooth probability functions from Bernoulli tests with guarantees (PR, AK, AI, AS, VC), pp. 5459–5467.
- ICML-2019-SharanTBV #rank
- Compressed Factorization: Fast and Accurate Low-Rank Factorization of Compressively-Sensed Data (VS, KST, PB, GV), pp. 5690–5700.
- ICML-2019-Shi0 #learning #multi
- Fast Direct Search in an Optimally Compressed Continuous Target Space for Efficient Multi-Label Active Learning (WS, QY0), pp. 5769–5778.
- ICML-2019-StelznerPK #modelling #probability
- Faster Attend-Infer-Repeat with Tractable Probabilistic Models (KS, RP, KK), pp. 5966–5975.
- ICML-2019-Stickland0 #adaptation #learning #multi
- BERT and PALs: Projected Attention Layers for Efficient Adaptation in Multi-Task Learning (ACS, IM0), pp. 5986–5995.
- ICML-2019-XieCJZZ #on the #scalability
- On Scalable and Efficient Computation of Large Scale Optimal Transport (YX, MC, HJ, TZ, HZ), pp. 6882–6892.
- ICML-2019-YangWLCXS0X #named #network
- LegoNet: Efficient Convolutional Neural Networks with Lego Filters (ZY, YW, CL, HC, CX, BS, CX0, CX0), pp. 7005–7014.
- ICML-2019-YaoK0
- Efficient Nonconvex Regularized Tensor Completion with Structure-aware Proximal Iterations (QY, JTYK, BH0), pp. 7035–7044.
- ICML-2019-YuJY #analysis #communication #distributed #linear #on the #optimisation
- On the Linear Speedup Analysis of Communication Efficient Momentum SGD for Distributed Non-Convex Optimization (HY, RJ, SY), pp. 7184–7193.
- ICML-2019-ZhangHY #learning #named #recognition #visual notation
- LatentGNN: Learning Efficient Non-local Relations for Visual Recognition (SZ, XH, SY), pp. 7374–7383.
- ICML-2019-ZhangY #estimation #modelling #multi
- Fast and Stable Maximum Likelihood Estimation for Incomplete Multinomial Models (CZ, GY), pp. 7463–7471.
- ICML-2019-ZintgrafSKHW #adaptation
- Fast Context Adaptation via Meta-Learning (LMZ, KS, VK, KH, SW), pp. 7693–7702.
KDD-2019-Chang #clique #graph #scalability- Efficient Maximum Clique Computation over Large Sparse Graphs (LC), pp. 529–538.
- KDD-2019-ChengSHZ #analysis #modelling
- Incorporating Interpretability into Latent Factor Models via Fast Influence Analysis (WC, YS, LH, YZ), pp. 885–893.
- KDD-2019-ChenSJ0Z0 #behaviour #effectiveness #recommendation #reuse #using
- Effective and Efficient Reuse of Past Travel Behavior for Route Recommendation (LC, SS, CSJ, BY0, ZZ, LS0), pp. 488–498.
- KDD-2019-ChiangLSLBH #algorithm #clustering #graph #named #network #scalability
- Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks (WLC, XL, SS, YL0, SB, CJH), pp. 257–266.
- KDD-2019-FuZCR #gpu #named #optimisation #robust #visualisation
- AtSNE: Efficient and Robust Visualization on GPU through Hierarchical Optimization (CF, YZ, DC, XR), pp. 176–186.
- KDD-2019-JinSH #architecture #named
- Auto-Keras: An Efficient Neural Architecture Search System (HJ, QS, XH), pp. 1946–1956.
- KDD-2019-LiZY #effectiveness #learning
- Efficient and Effective Express via Contextual Cooperative Reinforcement Learning (YL, YZ, QY), pp. 510–519.
- KDD-2019-WangD #approximate #empirical
- Fast Approximation of Empirical Entropy via Subsampling (CW, BD), pp. 658–667.
- KDD-2019-WangLCJ #effectiveness #game studies #learning #representation #retrieval
- Effective and Efficient Sports Play Retrieval with Deep Representation Learning (ZW, CL, GC, CJ), pp. 499–509.
- KDD-2019-WangYCZ #convergence #learning
- ADMM for Efficient Deep Learning with Global Convergence (JW, FY, XC0, LZ0), pp. 111–119.
- KDD-2019-WengZBT #named
- OCC: A Smart Reply System for Efficient In-App Communications (YW, HZ, FB, GT), pp. 2596–2603.
- KDD-2019-WuYHZX0JA #kernel #random #string
- Efficient Global String Kernel with Random Features: Beyond Counting Substructures (LW, IEHY, SH, LZ0, KX, LM0, SJ, CCA), pp. 520–528.
- KDD-2019-YangWZK #named
- ET-Lasso: A New Efficient Tuning of Lasso-type Regularization for High-Dimensional Data (SY, JW, XZ, DK), pp. 607–616.
- KDD-2019-YoonHSF #approach #detection #graph
- Fast and Accurate Anomaly Detection in Dynamic Graphs with a Two-Pronged Approach (MY, BH, KS, CF), pp. 647–657.
- KDD-2019-Zhang0 #named #similarity
- MinJoin: Efficient Edit Similarity Joins via Local Hash Minima (HZ, QZ0), pp. 1093–1103.
ECOOP-2019-ChungNV #algorithm #tuple #type system- Julia's Efficient Algorithm for Subtyping Unions and Covariant Tuples (Pearl) (BC, FZN, JV), p. 15.
- ECOOP-2019-SpringerM #memory management #named #object-oriented #parallel #programming
- DynaSOAr: A Parallel Memory Allocator for Object-Oriented Programming on GPUs with Efficient Memory Access (MS, HM), p. 37.
OOPSLA-2019-BastianKN #reliability #stack- Reliable and fast DWARF-based stack unwinding (TB, SK, FZN), p. 24.
- OOPSLA-2019-LuX #analysis #context-sensitive grammar #pointer
- Precision-preserving yet fast object-sensitive pointer analysis with partial context sensitivity (JL, JX), p. 29.
- OOPSLA-2019-WangHZTT #named #polymorphism #type system
- IVT: an efficient method for sharing subtype polymorphic objects (YPW, XQH, ZXZ, WT, GT), p. 22.
- OOPSLA-2019-WeiCR #composition #metaprogramming #program analysis #staged
- Staged abstract interpreters: fast and modular whole-program analysis via meta-programming (GW, YC, TR), p. 32.
- OOPSLA-2019-WimmerSHJWKPW
- Initialize once, start fast: application initialization at build time (CW, CS, PH, VJ, PW, PBK, OP, TW), p. 29.
- OOPSLA-2019-ZurielFSCP #set
- Efficient lock-free durable sets (YZ, MF, GS, NC, EP), p. 26.
PADL-2019-PietersS #pipes and filters #re-engineering- Faster Coroutine Pipelines: A Reconstruction (RPP, TS), pp. 133–149.
PLDI-2019-ChoiST #javascript #reuse- Reusable inline caching for JavaScript performance (JC, TS, JT), pp. 889–901.
- PLDI-2019-GuanSL #framework #named
- Wootz: a compiler-based framework for fast CNN pruning via composability (HG, XS, SHL), pp. 717–730.
- PLDI-2019-GysiGBH
- A fast analytical model of fully associative caches (TG, TG, LB, TH), pp. 816–829.
- PLDI-2019-KuhlenschmidtAS #towards #type system
- Toward efficient gradual typing for structural types via coercions (AK, DA, JGS), pp. 517–532.
- PLDI-2019-MohammadiYCDHDN #data flow #dependence
- Sparse computation data dependence simplification for efficient compiler-generated inspectors (MSM, TY, KC, ECD, MWH, MMD, PN, CO, AV, MMS), pp. 594–609.
- PLDI-2019-PultePKLH #concurrent #named
- Promising-ARM/RISC-V: a simpler and faster operational concurrency model (CP, JPP, JK, SHL, CKH), pp. 1–15.
- POPL-2019-ChatterjeeGOP #algorithm
- Efficient parameterized algorithms for data packing (KC, AKG, NO, AP), p. 28.
- POPL-2019-FromherzGHPRS #assembly
- A verified, efficient embedding of a verifiable assembly language (AF, NG, CH, BP, AR, NS), p. 30.
- POPL-2019-GorinovaGS #flexibility #probability #programming
- Probabilistic programming with densities in SlicStan: efficient, flexible, and deterministic (MIG, ADG, CAS), p. 30.
- POPL-2019-TouzeauMMR #analysis
- Fast and exact analysis for LRU caches (VT, CM, DM, JR), p. 29.
- POPL-2019-YiCMJ #automation #fault #float #library
- Efficient automated repair of high floating-point errors in numerical libraries (XY, LC, XM, TJ), p. 29.
SAS-2019-LeiS #analysis #pointer #precise- Fast and Precise Handling of Positive Weight Cycles for Field-Sensitive Pointer Analysis (YL, YS), pp. 27–47.
- SAS-2019-LiLYCHZ #network #precise #towards #verification
- Analyzing Deep Neural Networks with Symbolic Propagation: Towards Higher Precision and Faster Verification (JL, JL, PY, LC, XH0, LZ0), pp. 296–319.
- SAS-2019-YuM #linear #parametricity #programming
- An Efficient Parametric Linear Programming Solver and Application to Polyhedral Projection (HY, DM), pp. 203–224.
ASE-2019-GodioBPAF #generative #test coverage #testing- Efficient Test Generation Guided by Field Coverage Criteria (AG, VSB, PP, NA, MFF), pp. 91–101.
- ASE-2019-HortonP #detection #named #python
- V2: Fast Detection of Configuration Drift in Python (EH, CP), pp. 477–488.
- ASE-2019-LiuFXLGGY #automation #evaluation #named #simulation #tool support #workflow
- FogWorkflowSim: An Automated Simulation Toolkit for Workflow Performance Evaluation in Fog Computing (XL, LF, JX, XL, LG, JCG, YY), pp. 1114–1117.
- ASE-2019-MuGCCGXMS #alias #analysis #execution #named
- RENN: Efficient Reverse Execution with Neural-Network-Assisted Alias Analysis (DM, WG, AC, YC, JG, XX, BM, CS), pp. 924–935.
- ASE-2019-MuhlbauerAS #evolution #modelling
- Accurate Modeling of Performance Histories for Evolving Software Systems (SM, SA, NS), pp. 640–652.
- ASE-2019-PobeeMC #concurrent #multi #source code #thread #transaction
- Efficient Transaction-Based Deterministic Replay for Multi-threaded Programs (EBP, XM, WKC), pp. 760–771.
- ASE-2019-ReicheltKH #identification #named
- PeASS: A Tool for Identifying Performance Changes at Code Level (DGR, SK, WH), pp. 1146–1149.
- ASE-2019-TangZZLXZY #android #library
- Demystifying Application Performance Management Libraries for Android (YT, XZ, HZ, XL, ZX, YZ, QY), pp. 682–685.
- ASE-2019-TaoTLXQ #api #data analysis #how #question #runtime
- How Do API Selections Affect the Runtime Performance of Data Analytics Tasks? (YT, ST, YL, ZX, SQ), pp. 665–668.
- ASE-2019-WuLZYZ0 #analysis #mobile #named
- MalScan: Fast Market-Wide Mobile Malware Scanning by Social-Network Centrality Analysis (YW, XL, DZ, WY0, XZ, HJ0), pp. 139–150.
- ASE-2019-Zhou #collaboration #development
- Improving Collaboration Efficiency in Fork-Based Development (SZ), pp. 1218–1221.
ESEC-FSE-2019-He19a #comprehension #debugging #detection #fault- Tuning backfired? not (always) your fault: understanding and detecting configuration-related performance bugs (HH), pp. 1229–1231.
- ESEC-FSE-2019-HeMS0PS #statistics #testing
- A statistics-based performance testing methodology for cloud applications (SH, GM, JS, WW0, LLP, MLS), pp. 188–199.
- ESEC-FSE-2019-KulaRHDG #case study
- Releasing fast and slow: an exploratory case study at ING (EK, AR, HH, AvD, GG), pp. 785–795.
- ESEC-FSE-2019-LiM0CX0 #testing
- Boosting operational DNN testing efficiency through conditioning (ZL, XM, CX0, CC, JX0, JL0), pp. 499–509.
- ESEC-FSE-2019-LinCLLZ #algorithm #combinator #generative #metaheuristic #testing #towards
- Towards more efficient meta-heuristic algorithms for combinatorial test generation (JL, SC, CL, QL, HZ0), pp. 212–222.
- ESEC-FSE-2019-Loukeris
- Efficient computing in a safe environment (ML), pp. 1208–1210.
- ESEC-FSE-2019-Moghadam #machine learning #testing
- Machine learning-assisted performance testing (MHM), pp. 1187–1189.
- ESEC-FSE-2019-PobeeC #concurrent #multi #named #source code #thread
- AggrePlay: efficient record and replay of multi-threaded programs (EBP, WKC), pp. 567–577.
- ESEC-FSE-2019-SuWC0 #java
- Pinpointing performance inefficiencies in Java (PS, QW, MC, XL0), pp. 818–829.
- ESEC-FSE-2019-ZhouVK #case study #social #what
- What the fork: a study of inefficient and efficient forking practices in social coding (SZ, BV, CK), pp. 350–361.
- ICSE-2019-CitoLRG #feedback #ide #interactive
- Interactive production performance feedback in the IDE (JC, PL, MR, HCG), pp. 971–981.
- ICSE-2019-HaZ #configuration management #named #network #predict
- DeepPerf: performance prediction for configurable software with deep sparse neural network (HH, HZ0), pp. 1095–1106.
- ICSE-2019-YangYWLC #optimisation #web
- View-centric performance optimization for database-backed web applications (JY, CY, CW, SL, AC), pp. 994–1004.
SLE-2019-SchutzeC #composition- Efficient late binding of dynamic function compositions (LS, JC), pp. 141–151.
- ASPLOS-2019-0001WZKK #flexibility #framework #memory management #named #persistent #source code #testing
- PMTest: A Fast and Flexible Testing Framework for Persistent Memory Programs (SL0, YW, JZ, AK, SMK), pp. 411–425.
- ASPLOS-2019-GanZHCHPD #big data #complexity #debugging #named
- Seer: Leveraging Big Data to Navigate the Complexity of Performance Debugging in Cloud Microservices (YG0, YZ, KH, DC, YH, MP, CD), pp. 19–33.
- ASPLOS-2019-KondguliH #hardware #named #smt #thread #using
- Bootstrapping: Using SMT Hardware to Improve Single-Thread Performance (SK, MH), pp. 687–700.
- ASPLOS-2019-KungMZ #array #implementation #network #optimisation
- Packing Sparse Convolutional Neural Networks for Efficient Systolic Array Implementations: Column Combining Under Joint Optimization (HTK, BM, SQZ), pp. 821–834.
- ASPLOS-2019-MerrifieldRDE #lazy evaluation #multi #thread
- Lazy Determinism for Faster Deterministic Multithreading (TM, SR, JD, JE), pp. 879–891.
- ASPLOS-2019-PanwarBG #fine-grained #named
- HawkEye: Efficient Fine-grained OS Support for Huge Pages (AP, SB, KG), pp. 347–360.
- ASPLOS-2019-PellauerSCCHVKF #composition #distributed #named
- Buffets: An Efficient and Composable Storage Idiom for Explicit Decoupled Data Orchestration (MP, YSS, JC, NCC, KH, RV, SWK, CWF, JSE), pp. 137–151.
- ASPLOS-2019-ShenSSBDRW #named
- X-Containers: Breaking Down Barriers to Improve Performance and Isolation of Cloud-Native Containers (ZS, ZS, GES, EB, CD, RvR, HW), pp. 121–135.
- ASPLOS-2019-TangZQC #architecture #message passing #named
- pLock: A Fast Lock for Architectures with Explicit Inter-core Message Passing (XT, JZ, XQ, WC), pp. 765–778.
- ASPLOS-2019-WangFL #fine-grained
- Fast Fine-Grained Global Synchronization on GPUs (KW, DF, CL), pp. 793–806.
- ASPLOS-2019-XuKMS #memory management #persistent
- Finding and Fixing Performance Pathologies in Persistent Memory Software Stacks (JX0, JK, AM, SS), pp. 427–439.
- ASPLOS-2019-ZhangL0HLG #graph #multi #named
- DiGraph: An Efficient Path-based Iterative Directed Graph Processing System on Multiple GPUs (YZ0, XL, HJ0, BH, HL, LG0), pp. 601–614.
- ASPLOS-2019-ZhangZWLFZS #framework #scalability
- Fast and Scalable VMM Live Upgrade in Large Cloud Infrastructure (XZ, XZ, ZW0, QL0, JF, YZ, YS), pp. 93–105.
- ASPLOS-2019-ZhengOZSYC #framework #named #pipes and filters
- HiWayLib: A Software Framework for Enabling High Performance Communications for Heterogeneous Pipeline Computations (ZZ, CO, JZ, XS, YY, WC), pp. 153–166.
CASE-2019-BaiTYZD #algorithm #evaluation #exponential #finite #robust- An Accurate and Robust Algorithm for Performance Evaluation of Exponential Serial Lines with Finite Buffers (YB, JT, MY, LZ, PD), pp. 42–47.
- CASE-2019-BaltaTB #detection #framework #modelling #monitoring
- A Digital Twin Framework for Performance Monitoring and Anomaly Detection in Fused Deposition Modeling (ECB, DMT, KB), pp. 823–829.
- CASE-2019-ChenJD #analysis #flexibility #geometry #realtime
- Real-Time Performance Analysis of Batch-Based Serial Flexible Production Lines With Geometric Machines (JC, ZJ, YD), pp. 97–102.
- CASE-2019-GildertPT #communication
- Comparing The Performance of Explicit and Implicit Communication in Simple Object Manipulation Tasks (NG, AP, JT), pp. 1456–1462.
- CASE-2019-HagelskjaerSKB #constraints #estimation #industrial #precise #using
- Using spatial constraints for fast set-up of precise pose estimation in an industrial setting (FH, TRS, NK, AGB), pp. 1308–1314.
- CASE-2019-HaltPTPS #assembly
- A Transferable Force Controller based on Prescribed Performance for Contact Establishment in Robotic Assembly Tasks (LH, FP, PT, AP, TS), pp. 830–835.
- CASE-2019-MarzanoFM #energy #policy #tool support
- Energy Efficient State Control of Machine Tools: a Time-Based Dynamic Control Policy (LM, NF, AM), pp. 596–601.
- CASE-2019-Niu0JM #3d #visual notation
- Efficient 3D Visual Perception for Robotic Rock Breaking (LN, KC0, KJ, JM), pp. 1124–1130.
- CASE-2019-PerdomoPMMKP #2d #detection #named
- c-M2DP: A Fast Point Cloud Descriptor with Color Information to Perform Loop Closure Detection (LP, DP, MM, RM, MLK, EP), pp. 1145–1150.
- CASE-2019-PotluriD #detection #injection #learning #process
- Deep Learning based Efficient Anomaly Detection for Securing Process Control Systems against Injection Attacks (SP, CD), pp. 854–860.
- CASE-2019-QianAX0 #learning
- Improved Production Performance Through Manufacturing System Learning (YQ, JA, GX, QC0), pp. 517–522.
- CASE-2019-SartoriZY #3d #approach #design #multi
- An efficient approach to near-optimal 3D trajectory design in cluttered environments for multirotor UAVs (DS, DZ, WY), pp. 1016–1022.
- CASE-2019-WangMWNWL #reliability
- Dynamic Pricing for Autonomous Vehicle E-hailing Services Reliability and Performance Improvement (QW, FM, JW, YN, CW, NEL), pp. 948–953.
- CASE-2019-XuLWZCQ #approach #learning
- An Improved GA-KRR Nested Learning Approach for Refrigeration Compressor Performance Forecasting* (CX, XL, JW, JZ, JC, WQ), pp. 622–627.
- CASE-2019-Yan #energy #optimisation
- Energy Consumption optimization in Two-Machine Bernoulli Serial Lines with Limits on Machine Efficiency (CBY), pp. 85–90.
- CC-2019-AloorN
- Efficiency and expressiveness in UW-OpenMP (RA, VKN), pp. 182–192.
- CC-2019-BlassP #algorithm #analysis #compilation #fixpoint
- GPU-accelerated fixpoint algorithms for faster compiler analyses (TB, MP), pp. 122–134.
- CC-2019-LiC0 #testing
- Efficient concolic testing of MPI applications (HL, ZC, RG0), pp. 193–204.
- CGO-2019-BaghdadiRRSAZSK #compilation #named
- Tiramisu: A Polyhedral Compiler for Expressing Fast and Portable Code (RB, JR, MBR, EDS, AA, YZ, PS, SK, SPA), pp. 193–205.
- CGO-2019-GonzaloHGHMH #automation #generative #parallel #reduction
- Automatic Generation of Warp-Level Primitives and Atomic Instructions for Fast and Portable Parallel Reduction on GPUs (SGDG, SH, JGL, SDH, OM, WMH), pp. 73–84.
- CGO-2019-ZhouM #analysis
- A Tool for Performance Analysis of GPU-Accelerated Applications (KZ, JMMC), p. 282.
FASE-2019-FritscheKST #automation #process- Efficient Model Synchronization by Automatically Constructed Repair Processes (LF, JK, AS, GT), pp. 116–133.
CADE-2019-0001CV - Faster, Higher, Stronger: E 2.3 (SS0, SC, PV), pp. 495–507.
- CADE-2019-ChvalovskyJ0U #named
- ENIGMA-NG: Efficient Neural and Gradient-Boosted Inference Guidance for E (KC, JJ, MS0, JU), pp. 197–215.
CAV-2019-DrewsAD #constraints #probability #synthesis- Efficient Synthesis with Probabilistic Constraints (SD, AA, LD), pp. 278–296.
- CAV-2019-Gastin0S #algorithm #automaton #constraints
- Fast Algorithms for Handling Diagonal Constraints in Timed Automata (PG, SM0, BS), pp. 41–59.
- CAV-2019-GiannarakisBMW #fault tolerance #network #refinement #verification
- Efficient Verification of Network Fault Tolerance via Counterexample-Guided Refinement (NG, RB, RM, DW), pp. 305–323.
- CAV-2019-JonasS #named #quantifier #smt
- Q3B: An Efficient BDD-based SMT Solver for Quantified Bit-Vectors (MJ, JS), pp. 64–73.
- CAV-2019-ReynoldsBNBT #named #synthesis
- cvc4sy: Smart and Fast Term Enumeration for Syntax-Guided Synthesis (AR, HB, AN, CWB, CT), pp. 74–83.
ICST-2019-JendeleSCJR #automation #composition #scalability- Efficient Automated Decomposition of Build Targets at Large-Scale (LJ, MS, DC, IJ, MR), pp. 457–464.
ICTSS-2019-Huerta-GuevaraA #adaptation #testing #towards- Towards an Efficient Performance Testing Through Dynamic Workload Adaptation (OHG, VAR, LM0, AOPD), pp. 215–233.
- ICTSS-2019-Huerta-GuevaraA19a #adaptation #named #testing #using
- DYNAMOJM: A JMeter Tool for Performance Testing Using Dynamic Workload Adaptation (OHG, VAR, LM0, AOPD), pp. 234–241.
- ICTSS-2019-KluckZWN #comparison #search-based #testing #validation
- Performance Comparison of Two Search-Based Testing Strategies for ADAS System Validation (FK, MZ, FW, MN), pp. 140–156.
TAP-2019-LavillonniereMC #algorithm #automation #formal method #generative #search-based #testing- Fast, Automatic, and Nearly Complete Structural Unit-Test Generation Combining Genetic Algorithms and Formal Methods (EL, DM, DC0), pp. 55–63.
VMCAI-2019-LopesR #scalability #simulation- Fast BGP Simulation of Large Datacenters (NPL, AR), pp. 386–408.
- ECSA-2018-AvritzerFJRSH #approach #architecture #assessment #automation #deployment #testing
- A Quantitative Approach for the Assessment of Microservice Architecture Deployment Alternatives by Automated Performance Testing (AA, VF, AJ, BR, HS, AvH), pp. 159–174.
- ICSA-2018-EismannWKK #component #dependence #modelling #parametricity #predict #runtime
- Modeling of Parametric Dependencies for Performance Prediction of Component-Based Software Systems at Run-Time (SE, JW, JvK, SK), pp. 135–144.
- ICSA-2018-Yasaweerasinghelage #architecture #data analysis #modelling #predict #privacy #simulation #using
- Predicting the Performance of Privacy-Preserving Data Analytics Using Architecture Modelling and Simulation (RY, MS, IW, HYP), pp. 166–175.
JCDL-2018-MaiGS #learning #semantics #using- Using Deep Learning for Title-Based Semantic Subject Indexing to Reach Competitive Performance to Full-Text (FM, LG, AS), pp. 169–178.
- EDM-2018-KimVG #learning #named #predict #student
- GritNet: Student Performance Prediction with Deep Learning (BHK, EV, VG).
- EDM-2018-PolyzouK #feature model #student
- Feature extraction for classifying students based on their academic performance (AP, GK).
- EDM-2018-SahebiB #predict #student
- Student Performance Prediction by Discovering Inter-Activity Relations (SS, PB).
- EDM-2018-SheshadriGLBH #case study #online #predict #student
- Predicting Student Performance Based on Online Study Habits: A Study of Blended Courses (AS, NG, CL, TB, SH).
- ICSME-2018-BagheriWAM #analysis #android #security
- Efficient, Evolutionary Security Analysis of Interacting Android Apps (HB, JW, JA, SM), pp. 357–368.
- ICSME-2018-GuoMYW #automation #empirical #program repair #slicing
- An Empirical Study on the Effect of Dynamic Slicing on Automated Program Repair Efficiency (AG, XM, DY, SW), pp. 554–558.
MSR-2018-CaiJ #analysis #android #precise- Leveraging historical versions of Android apps for efficient and precise taint analysis (HC, JJ), pp. 265–269.
- MSR-2018-JinS #code completion #comprehension #recommendation
- The hidden cost of code completion: understanding the impact of the recommendation-list length on its efficiency (XJ, FS), pp. 70–73.
- MSR-2018-LaaberL #assessment #benchmark #evaluation #open source
- An evaluation of open-source software microbenchmark suites for continuous performance assessment (CL, PL), pp. 119–130.
- MSR-2018-MajumderBBFM08 #case study #learning #mining #stack overflow
- 500+ times faster than deep learning: a case study exploring faster methods for text mining stackoverflow (SM, NB, KB, WF0, TM), pp. 554–563.
- MSR-2018-RodriguezTK #developer #empirical
- Empirical study on the relationship between developer's working habits and efficiency (AR, FT, YK), pp. 74–77.
- SANER-2018-KaramitasK #bytecode
- Efficient features for function matching between binary executables (CK, AK), pp. 335–345.
- Haskell-2018-HandleyH #haskell #named #source code
- AutoBench: comparing the time performance of Haskell programs (MATH, GH), pp. 26–37.
- Haskell-2018-SunF #maintenance
- Autobahn 2.0: minimizing bangs while maintaining performance (system demonstration) (MS, KF), pp. 38–40.
- ICFP-2018-Campora0W #safety #type system
- Casts and costs: harmonizing safety and performance in gradual typing (JPCI, SC0, EW), p. 30.
- ICFP-2018-GreenmanF
- A spectrum of type soundness and performance (BG, MF), p. 32.
CHI-PLAY-2018-FrommelS0 #adaptation #game studies #recognition #towards- Towards Emotion-based Adaptive Games: Emotion Recognition Via Input and Performance Features (JF, CS, MW0), pp. 173–185.
- CHI-PLAY-2018-LongG #experience #game studies #latency #modelling
- Characterizing and Modeling the Effects of Local Latency on Game Performance and Experience (ML, CG), pp. 285–297.
- CIG-2018-ChenANCSE #game studies #named #recommendation
- Q-DeckRec: A Fast Deck Recommendation System for Collectible Card Games (ZC, CA, THDN, SC, YS, MSEN), pp. 1–8.
- CIG-2018-Cutumisu #assessment #feedback #game studies #student
- The Influence of Feedback Choice on University Students' Revision Choices and Performance in a Digital Assessment Game (MC), pp. 1–7.
- CIG-2018-Lucas #game studies #research
- Game AI Research with Fast Planet Wars Variants (SML), pp. 1–4.
- DiGRA-2018-SeulaAF #case study #game studies
- Play to Win, Profit & Entertain: a Study of Double Performance as Athlete and Streamer (RS, MA, SF).
- VS-Games-2018-SpyridonisDO #collaboration #communication #game studies #multi #online
- Efficient In-Game Communication in Collaborative Online Multiplayer Games (FS, DDZ, MPO), pp. 1–4.
- CIKM-2018-CatenaFT #distributed #energy #web
- Efficient Energy Management in Distributed Web Search (MC, OF, NT), pp. 1555–1558.
- CIKM-2018-CazzolatoTB #estimation #reliability
- Efficient and Reliable Estimation of Cell Positions (MTC, AJMT, KB), pp. 1043–1052.
- CIKM-2018-GaikwadMA #data type #query
- Data Structure for Efficient Line of Sight Queries (SG, MM, DCA), pp. 1535–1538.
- CIKM-2018-HuNY #framework #linear #predict
- A Fast Linear Computational Framework for User Action Prediction in Tencent MyApp (YH, DN, JY), pp. 2047–2055.
- CIKM-2018-JangCJK #memory management #named
- Zoom-SVD: Fast and Memory Efficient Method for Extracting Key Patterns in an Arbitrary Time Range (JGJ, DC, JJ, UK), pp. 1083–1092.
- CIKM-2018-KrishnanSSS #approach #collaboration
- An Adversarial Approach to Improve Long-Tail Performance in Neural Collaborative Filtering (AK, AS, AS, HS), pp. 1491–1494.
- CIKM-2018-KuralenokSKS #data analysis #taxonomy
- Construction of Efficient V-Gram Dictionary for Sequential Data Analysis (IK, NS, AK, JS), pp. 1343–1352.
- CIKM-2018-LuccheseN0TV #effectiveness #query #web
- Efficient and Effective Query Expansion for Web Search (CL, FMN, RP0, RT, RV), pp. 1551–1554.
- CIKM-2018-MizusawaTMAM #crowdsourcing #pipes and filters #workflow
- Efficient Pipeline Processing of Crowdsourcing Workflows (KM, KT, MM, TA, AM), pp. 1559–1562.
- CIKM-2018-NagarkarC #execution #named #query #set
- PSLSH: An Index Structure for Efficient Execution of Set Queries in High-Dimensional Spaces (PN, KSC), pp. 477–486.
- CIKM-2018-RoyGBBM #how #information retrieval #normalisation #using #word
- Using Word Embeddings for Information Retrieval: How Collection and Term Normalization Choices Affect Performance (DR, DG, SB, SB, MM), pp. 1835–1838.
- CIKM-2018-ShaabaniM #dependence #detection
- Improving the Efficiency of Inclusion Dependency Detection (NS, CM), pp. 207–216.
- CIKM-2018-XuL #adaptation #constraints #similarity #taxonomy
- Efficient Taxonomic Similarity Joins with Adaptive Overlap Constraint (PX0, JL), pp. 1563–1566.
- CIKM-2018-YangS #learning #multi #named
- FALCON: A Fast Drop-In Replacement of Citation KNN for Multiple Instance Learning (SY, XS), pp. 67–76.
- CIKM-2018-ZhangWFSL #mobile #named
- FastInput: Improving Input Efficiency on Mobile Devices (JZ, XW, YF, MS, PL0), pp. 2057–2065.
- ECIR-2018-ChehreghaniC #nearest neighbour
- Efficient Context-Aware K-Nearest Neighbor Search (MHC, MHC), pp. 466–478.
- ECIR-2018-JiaS #approach #recommendation
- Local Is Good: A Fast Citation Recommendation Approach (HJ, ES), pp. 758–764.
- ICML-2018-ArenzZN #policy #using
- Efficient Gradient-Free Variational Inference using Policy Search (OA, MZ, GN), pp. 234–243.
- ICML-2018-BajgarKK #architecture
- A Boo(n) for Evaluating Architecture Performance (OB, RK, JK), pp. 344–352.
- ICML-2018-BravermanCKLWY #data type #matrix #multi
- Matrix Norms in Data Streams: Faster, Multi-Pass and Row-Order (VB, SRC, RK, YL0, DPW, LFY), pp. 648–657.
- ICML-2018-CaiYZHY #architecture #network
- Path-Level Network Transformation for Efficient Architecture Search (HC, JY, WZ0, SH, YY0), pp. 677–686.
- ICML-2018-ChenLCWPC #estimation
- Continuous-Time Flows for Efficient Inference and Density Estimation (CC, CL, LC, WW, YP, LC), pp. 823–832.
- ICML-2018-CorneilGB #learning
- Efficient ModelBased Deep Reinforcement Learning with Variational State Tabulation (DSC, WG, JB), pp. 1057–1066.
- ICML-2018-DepewegHDU #composition #learning #nondeterminism
- Decomposition of Uncertainty in Bayesian Deep Learning for Efficient and Risk-sensitive Learning (SD, JMHL, FDV, SU), pp. 1192–1201.
- ICML-2018-FalknerKH #named #optimisation #robust #scalability
- BOHB: Robust and Efficient Hyperparameter Optimization at Scale (SF, AK, FH), pp. 1436–1445.
- ICML-2018-FathonyBZZ #consistency
- Efficient and Consistent Adversarial Bipartite Matching (RF, SB, XZ, BDZ), pp. 1456–1465.
- ICML-2018-FruitPLO #learning
- Efficient Bias-Span-Constrained Exploration-Exploitation in Reinforcement Learning (RF, MP, AL, RO), pp. 1573–1581.
- ICML-2018-GuHDH #algorithm #memory management #probability
- Faster Derivative-Free Stochastic Algorithm for Shared Memory Machines (BG, ZH, CD, HH), pp. 1807–1816.
- ICML-2018-HammN #learning #optimisation
- K-Beam Minimax: Efficient Optimization for Deep Adversarial Learning (JH, YKN), pp. 1876–1884.
- ICML-2018-HoPW #robust
- Fast Bellman Updates for Robust MDPs (CPH, MP, WW), pp. 1984–1993.
- ICML-2018-ImaniW
- Improving Regression Performance with Distributional Losses (EI, MW), pp. 2162–2171.
- ICML-2018-JeongS #learning
- Efficient end-to-end learning for quantizable representations (YJ, HOS), pp. 2269–2278.
- ICML-2018-JinYXYJFY #named #network
- WSNet: Compact and Efficient Networks Through Weight Sampling (XJ, YY, NX0, JY, NJ, JF, SY), pp. 2357–2366.
- ICML-2018-KaiserBRVPUS #modelling #sequence #using
- Fast Decoding in Sequence Models Using Discrete Latent Variables (LK, SB, AR, AV, NP, JU, NS), pp. 2395–2404.
- ICML-2018-KalchbrennerESN #synthesis
- Efficient Neural Audio Synthesis (NK, EE, KS, SN, NC, EL, FS, AvdO, SD, KK), pp. 2415–2424.
- ICML-2018-KhanNTLGS #learning #scalability
- Fast and Scalable Bayesian Deep Learning by Weight-Perturbation in Adam (MEK, DN, VT, WL, YG, AS), pp. 2616–2625.
- ICML-2018-KolarijaniEK #exponential #framework #hybrid
- Fast Gradient-Based Methods with Exponential Rate: A Hybrid Control Framework (ASK, PME, TK), pp. 2733–2741.
- ICML-2018-KuhnleSCT #integer
- Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice (AK, JDS, VGC, MTT), pp. 2791–2800.
- ICML-2018-LangeKA #bound #clustering #correlation
- Partial Optimality and Fast Lower Bounds for Weighted Correlation Clustering (JHL, AK, BA), pp. 2898–2907.
- ICML-2018-LiuH #probability #reduction
- Fast Variance Reduction Method with Stochastic Batch Size (XL, CJH), pp. 3185–3194.
- ICML-2018-LiuZCWY #probability
- Fast Stochastic AUC Maximization with O(1/n)-Convergence Rate (ML, XZ, ZC, XW, TY), pp. 3195–3203.
- ICML-2018-MalikPFHRD #learning
- An Efficient, Generalized Bellman Update For Cooperative Inverse Reinforcement Learning (DM, MP, JFF, DHM, SJR, ADD), pp. 3391–3399.
- ICML-2018-MartinLV #approximate #clustering #network
- Fast Approximate Spectral Clustering for Dynamic Networks (LM, AL, PV), pp. 3420–3429.
- ICML-2018-MassiasSG #named
- Celer: a Fast Solver for the Lasso with Dual Extrapolation (MM, JS, AG), pp. 3321–3330.
- ICML-2018-McLeodRO #optimisation
- Optimization, Fast and Slow: Optimally Switching between Local and Bayesian Optimization (MM, SJR, MAO), pp. 3440–3449.
- ICML-2018-MussmannL #fault #nondeterminism #on the
- On the Relationship between Data Efficiency and Error for Uncertainty Sampling (SM, PL), pp. 3671–3679.
- ICML-2018-NguyenRF #framework #robust #testing
- Active Testing: An Efficient and Robust Framework for Estimating Accuracy (PXN, DR, CCF), pp. 3756–3765.
- ICML-2018-OdenaBOBORG #generative #question
- Is Generator Conditioning Causally Related to GAN Performance? (AO, JB, CO, TBB, CO, CR, IJG), pp. 3846–3855.
- ICML-2018-OordLBSVKDLCSCG #parallel #speech #synthesis
- Parallel WaveNet: Fast High-Fidelity Speech Synthesis (AvdO, YL, IB, KS, OV, KK, GvdD, EL, LCC, FS, NC, DG, SN, SD, EE, NK, HZ, AG, HK, TW, DB, DH), pp. 3915–3923.
- ICML-2018-OstrovskiiH #adaptation #algorithm #first-order
- Efficient First-Order Algorithms for Adaptive Signal Denoising (DO, ZH), pp. 3943–3952.
- ICML-2018-PhamGZLD #architecture #parametricity
- Efficient Neural Architecture Search via Parameter Sharing (HP, MYG, BZ, QVL, JD), pp. 4092–4101.
- ICML-2018-Pouliot #equivalence #multi #statistics
- Equivalence of Multicategory SVM and Simplex Cone SVM: Fast Computations and Statistical Theory (GP), pp. 4130–4137.
- ICML-2018-RaeDDL #learning #parametricity
- Fast Parametric Learning with Activation Memorization (JWR, CD, PD, TPL), pp. 4225–4234.
- ICML-2018-RuMGO #optimisation
- Fast Information-theoretic Bayesian Optimisation (BXR, MM, DG, MAO), pp. 4381–4389.
- ICML-2018-ShenMZZQ #communication #convergence #distributed #learning #probability #towards
- Towards More Efficient Stochastic Decentralized Learning: Faster Convergence and Sparse Communication (ZS, AM, TZ, PZ, HQ), pp. 4631–4640.
- ICML-2018-SibliniMK #clustering #learning #multi #random
- CRAFTML, an Efficient Clustering-based Random Forest for Extreme Multi-label Learning (WS, FM, PK), pp. 4671–4680.
- ICML-2018-WangSQ #learning #modelling #multi #scalability #visual notation
- A Fast and Scalable Joint Estimator for Integrating Additional Knowledge in Learning Multiple Related Sparse Gaussian Graphical Models (BW, AS, YQ), pp. 5148–5157.
- ICML-2018-WangZLMM #approximate #parametricity
- Approximate Leave-One-Out for Fast Parameter Tuning in High Dimensions (SW, WZ, HL, AM, VSM), pp. 5215–5224.
- ICML-2018-WengZCSHDBD #network #robust #towards
- Towards Fast Computation of Certified Robustness for ReLU Networks (TWW, HZ0, HC, ZS, CJH, LD, DSB, ISD), pp. 5273–5282.
- ICML-2018-YeA
- Communication-Computation Efficient Gradient Coding (MY, EA), pp. 5606–5615.
- ICML-2018-YenKYHKR #composition #learning #scalability
- Loss Decomposition for Fast Learning in Large Output Spaces (IEHY, SK, FXY, DNHR, SK, PR), pp. 5626–5635.
- ICML-2018-YuanST #algorithm #clustering
- An Efficient Semismooth Newton Based Algorithm for Convex Clustering (YY, DS, KCT), pp. 5704–5712.
- ICML-2018-ZhangDG #induction #matrix #multi
- Fast and Sample Efficient Inductive Matrix Completion via Multi-Phase Procrustes Flow (XZ, SSD, QG), pp. 5751–5760.
- ICML-2018-ZhangFL
- High Performance Zero-Memory Overhead Direct Convolutions (JZ, FF, TML), pp. 5771–5780.
- ICML-2018-ZhangLD #network
- Stabilizing Gradients for Deep Neural Networks via Efficient SVD Parameterization (JZ, QL, ISD), pp. 5801–5809.
- ICML-2018-ZhouF #comprehension #optimisation
- Understanding Generalization and Optimization Performance of Deep CNNs (PZ, JF), pp. 5955–5964.
- ICML-2018-ZhouSC #algorithm #convergence #probability
- A Simple Stochastic Variance Reduced Algorithm with Fast Convergence Rates (KZ, FS, JC), pp. 5975–5984.
- ICML-2018-ZhouZZ #algorithm
- Racing Thompson: an Efficient Algorithm for Thompson Sampling with Non-conjugate Priors (YZ, JZ0, JZ), pp. 5995–6003.
ICPR-2018-CaoLZSLS #detection #named #network- ThinNet: An Efficient Convolutional Neural Network for Object Detection (SC, YL, CZ, QSS, PL, SS), pp. 836–841.
- ICPR-2018-ChangWZ #linear #network #self
- Piecewise Linear Units for Fast Self-Normalizing Neural Networks (YC, XW, SZ), pp. 429–434.
- ICPR-2018-ChenDHLH #automation #classification #clustering #image
- Improving Image Classification Performance with Automatically Hierarchical Label Clustering (ZC, CD, LH, DL, HH), pp. 1863–1868.
- ICPR-2018-ChenLZ #gesture #recognition #taxonomy
- Temporal Hierarchical Dictionary with HMM for Fast Gesture Recognition (HC, XL0, GZ), pp. 3378–3383.
- ICPR-2018-FaulaBE #analysis #image
- A Fast Local Analysis by Thresholding applied to image matching (YF, SB, VE), pp. 3055–3060.
- ICPR-2018-GaoXLY
- A fast Cascade Shape Regression Method based on CNN-based Initialization (PG, JX, KL, YY), pp. 3037–3042.
- ICPR-2018-GarrettR #3d #network #using
- Fast Descriptor Extraction for Contextless 3D Registration Using a Fully Convolutional Network (TG, RR), pp. 1211–1216.
- ICPR-2018-LiH #algorithm #estimation #robust #using
- Fast and Robust Pose Estimation Algorithm for Bin Picking Using Point Pair Feature (ML, KH), pp. 1604–1609.
- ICPR-2018-LiLWL #correlation #image
- Fast Single Image Dehazing via Positive Correlation (BL, YL, CW, YL0), pp. 2020–2025.
- ICPR-2018-LingLZL #estimation #image #network
- Joint Haze-relevant Features Selection and Transmission Estimation via Deep Belief Network for Efficient Single Image Dehazing (ZL, XL, WZ, ML), pp. 133–139.
- ICPR-2018-LiuMZ #named #quality
- Artsy-GAN: A style transfer system with improved quality, diversity and performance (HL, PNM, DZ), pp. 79–84.
- ICPR-2018-LuoY #architecture #network #segmentation
- Fast Skin Lesion Segmentation via Fully Convolutional Network with Residual Architecture and CRF (WL, MY), pp. 1438–1443.
- ICPR-2018-MaWWW #detection #multi #named #network
- MDCN: Multi-Scale, Deep Inception Convolutional Neural Networks for Efficient Object Detection (WM, YW, ZW, GW), pp. 2510–2515.
- ICPR-2018-MengYXHHY #recognition #robust
- A robust and efficient method for license plate recognition (AM, WY0, ZX, HH, LH, CY), pp. 1713–1718.
- ICPR-2018-MohantyDG #detection #using
- An Efficient System for Hazy Scene Text Detection using a Deep CNN and Patch-NMS (SM, TD, HPG), pp. 2588–2593.
- ICPR-2018-MoTWW #approach #detection
- An Efficient Approach for Polyps Detection in Endoscopic Videos Based on Faster R-CNN (XM, KT, QW, GW), pp. 3929–3934.
- ICPR-2018-MustaniemiKSMH #detection #metric #using
- Fast Motion Deblurring for Feature Detection and Matching Using Inertial Measurements (JM, JK, SS, JM, JH), pp. 3068–3073.
- ICPR-2018-Savchenko #recognition #statistics #using
- Efficient Statistical Face Recognition Using Trigonometric Series and CNN Features (AVS), pp. 3262–3267.
- ICPR-2018-SinhaNGG #analysis #hybrid #navigation #network
- Hybrid Path Planner for Efficient Navigation in Urban Road Networks through Analysis of Trajectory Traces (SS, MKN, SG, SKG), pp. 3250–3255.
- ICPR-2018-SuHK #analysis #classification #component #multi #using
- Efficient Text Classification Using Tree-structured Multi-linear Principal Component Analysis (YS, YH, CCJK), pp. 585–590.
- ICPR-2018-SunYW0 #retrieval
- Discriminate Cross-modal Quantization for Efficient Retrieval (PS, CY, SW, XB0), pp. 3328–3334.
- ICPR-2018-WangLH #algorithm #multi
- An Efficient Budget Allocation Algorithm for Multi-Channel Advertising (XW, PL, AH), pp. 886–891.
- ICPR-2018-WangWL #education #learning
- Weakly- and Semi-supervised Faster R-CNN with Curriculum Learning (JW, XW, WL0), pp. 2416–2421.
- ICPR-2018-WuLPL #embedded #named #robust
- Em-SLAM: a Fast and Robust Monocular SLAM Method for Embedded Systems (YW, ZL, SP, TL), pp. 1882–1887.
- ICPR-2018-Yan0R #classification #framework #representation #scalability
- An Efficient Deep Representation Based Framework for Large-Scale Terrain Classification (YY, AR0, SR), pp. 940–945.
- ICPR-2018-ZhangCSZWHJL #assessment #named #network #quality
- SlideNet: Fast and Accurate Slide Quality Assessment Based on Deep Neural Networks (TZ, JC, DFS, KZ, AW, PH, AJ, BCL), pp. 2314–2319.
- ICPR-2018-ZhangZZL #bound #detection #image
- Boundary-based Image Forgery Detection by Fast Shallow CNN (ZZ, YZ, ZZ, JL), pp. 2658–2663.
- ICPR-2018-ZhongZ #segmentation #semantics
- Efficient Object Region Discovery for Weakly-supervised Semantic Segmentation (MZ, GZ), pp. 2166–2171.
- ICPR-2018-ZuGBT #scalability
- Saliency guided fast interpolation for large displacement optical flow (YZ, KG, XB, WT), pp. 1145–1150.
- KDD-2018-0001C #probability #recommendation
- Efficient Attribute Recommendation with Probabilistic Guarantee (CW0, KC), pp. 2387–2396.
- KDD-2018-ConoverHBSS #named
- Pangloss: Fast Entity Linking in Noisy Text Environments (MDC, MH, SB, PS, SS), pp. 168–176.
- KDD-2018-DasSCHLCKC #learning #named #using
- SHIELD: Fast, Practical Defense and Vaccination for Deep Learning using JPEG Compression (ND, MS, STC, FH, SL, LC, MEK, DHC), pp. 196–204.
- KDD-2018-DuT #equation #graph #mining #named
- FASTEN: Fast Sylvester Equation Solver for Graph Mining (BD, HT), pp. 1339–1347.
- KDD-2018-HuangMFFT #symmetry
- Accurate and Fast Asymmetric Locality-Sensitive Hashing Scheme for Maximum Inner Product Search (QH, GM, JF, QF, AKHT), pp. 1561–1570.
- KDD-2018-IyengarLISW #approach #data-driven #energy #named
- WattHome: A Data-driven Approach for Energy Efficiency Analytics at City-scale (SI, SL, DEI, PJS, BW), pp. 396–405.
- KDD-2018-LiMSGLDQ0 #privacy
- An Efficient Two-Layer Mechanism for Privacy-Preserving Truth Discovery (YL, CM, LS, JG0, QL0, BD, ZQ, KR0), pp. 1705–1714.
- KDD-2018-LinZXZ #learning #multi #scalability
- Efficient Large-Scale Fleet Management via Multi-Agent Deep Reinforcement Learning (KL, RZ, ZX, JZ), pp. 1774–1783.
- KDD-2018-LiuZC #learning #metric
- Efficient Similar Region Search with Deep Metric Learning (YL, KZ0, GC), pp. 1850–1859.
- KDD-2018-ManapragadaWS
- Extremely Fast Decision Tree (CM, GIW, MS), pp. 1953–1962.
- KDD-2018-ManzoorLA
- Extremely Fast Decision Tree (EAM, HL, LA), pp. 1963–1972.
- KDD-2018-NaKY #data type #detection #effectiveness #memory management #named
- DILOF: Effective and Memory Efficient Local Outlier Detection in Data Streams (GSN, DHK, HY), pp. 1993–2002.
- KDD-2018-Park0 #effectiveness #graph #named #scalability
- EvoGraph: An Effective and Efficient Graph Upscaling Method for Preserving Graph Properties (HP, MSK0), pp. 2051–2059.
- KDD-2018-PellegrinaV #mining #mutation testing #permutation #testing
- Efficient Mining of the Most Significant Patterns with Permutation Testing (LP, FV), pp. 2070–2079.
- KDD-2018-ShiPHMWMMLDC
- Audience Size Forecasting: Fast and Smart Budget Planning for Media Buyers (YS, CP, RH, WM, MHW, JM, PM, PL, RDW, RC), pp. 744–753.
- KDD-2018-TangW #learning #modelling #ranking #recommendation
- Ranking Distillation: Learning Compact Ranking Models With High Performance for Recommender System (JT, KW), pp. 2289–2298.
- KDD-2018-Valdez-VivasGKF #detection #distributed #framework #realtime
- A Real-time Framework for Detecting Efficiency Regressions in a Globally Distributed Codebase (MVV, CG, AK, EF, KG, SC), pp. 821–829.
- KDD-2018-WangZBZCY #learning #mobile #privacy
- Not Just Privacy: Improving Performance of Private Deep Learning in Mobile Cloud (JW0, JZ, WB, XZ, BC, PSY), pp. 2407–2416.
- KDD-2018-WongPKFJ #biology #community #named #network
- SDREGION: Fast Spotting of Changing Communities in Biological Networks (SWHW, CP, MK, CF, IJ), pp. 867–875.
- KDD-2018-YeZXZGD #mobile #paradigm #parallel #recommendation
- Multi-User Mobile Sequential Recommendation: An Efficient Parallel Computing Paradigm (ZY, LZ, KX, WZ, YG, YD), pp. 2624–2633.
- KDD-2018-YeZZGZ #evaluation #named #parallel
- RapidScorer: Fast Tree Ensemble Evaluation by Maximizing Compactness in Data Level Parallelization (TY, HZ, WYZ, BG, RZ), pp. 941–950.
- KDD-2018-ZhaoAS0 #classification #dependence #predict #using
- Prediction-time Efficient Classification Using Feature Computational Dependencies (LZ0, AAF, MS, KZ0), pp. 2787–2796.
ECMFA-2018-YohannisRPK #modelling #towards- Towards Efficient Loading of Change-Based Models (AY, HHR, FP, DSK), pp. 235–250.
MoDELS-2018-Boronat #domain-specific language #model transformation- Expressive and Efficient Model Transformation with an Internal DSL of Xtend (AB), pp. 78–88.
- MoDELS-2018-RioMBB #energy #modelling #process
- Efficient use of local energy: An activity oriented modeling to guide Demand Side Management (AR, YM, OB, YB), pp. 458–468.
- ECOOP-2018-GrechKS #analysis #graph #string
- Efficient Reflection String Analysis via Graph Coloring (NG, GK, YS), p. 25.
Onward-2018-BrandauerCW #approach #composition #implementation- C♭: a new modular approach to implementing efficient and tunable collections (SB, EC, TW), pp. 57–71.
- OOPSLA-2018-BezansonCCKSVZ #design #named
- Julia: dynamism and performance reconciled by design (JB, JC, BC, SK, VBS, JV, LZ), p. 23.
- OOPSLA-2018-WongMLK #bytecode #execution #program transformation
- Faster variational execution with transparent bytecode transformation (CPW, JM, LL, CK), p. 30.
PLATEAU-2018-SantolucitoGWP #programming- Programming by Example: Efficient, but Not “Helpful” (MS, DG, AW, RP), p. 10.
- PLDI-2018-AcarCGRS #parallel #scheduling
- Heartbeat scheduling: provable efficiency for nested parallelism (UAA, AC, AG, MR, FS), pp. 769–782.
- PLDI-2018-Adams #float #named #string
- Ryū: fast float-to-string conversion (UA), pp. 270–282.
- PLDI-2018-LiuH #analysis #concurrent #debugging #difference #named #parallel
- D4: fast concurrency debugging with parallel differential analysis (BL, JH0), pp. 359–373.
- PLDI-2018-ShiXWZFZ #analysis #named #precise
- Pinpoint: fast and precise sparse value flow analysis for million lines of code (QS, XX0, RW, JZ, GF, CZ), pp. 693–706.
- PLDI-2018-SteindorferV #exclamation #functional #multi
- To-many or to-one? all-in-one! efficient purely functional multi-maps with type-heterogeneous hash-tries (MJS, JJV), pp. 283–295.
- POPL-2018-AgrawalC0 #approach #probability #ranking #source code #termination
- Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs (SA, KC, PN0), p. 32.
PPDP-2018-KlemenS0MH #runtime #source code- Static Performance Guarantees for Programs with Runtime Checks (MK, NS, PLG0, JFM, MVH), p. 13.
- SAS-2018-BecchiZ #abstract domain
- An Efficient Abstract Domain for Not Necessarily Closed Polyhedra (AB, EZ), pp. 146–165.
- SAS-2018-ChawdharyK
- Closing the Performance Gap Between Doubles and Rationals for Octagons (AC, AK), pp. 187–204.
- ASE-2018-BeyerL #execution #named #symbolic computation
- CPA-SymExec: efficient symbolic execution in CPAchecker (DB, TL), pp. 900–903.
- ASE-2018-HabchiBR #android #on the
- On adopting linters to deal with performance concerns in Android apps (SH, XB0, RR), pp. 6–16.
- ASE-2018-HanYL #debugging #learning #named
- PerfLearner: learning from bug reports to understand and generate performance test frames (XH, TY, DL0), pp. 17–28.
- ASE-2018-Traini #distributed #effectiveness #fault #framework #injection #multi
- A multi-objective framework for effective performance fault injection in distributed systems (LT), pp. 936–939.
- ESEC-FSE-2018-FedorovaMBRWMY #comprehension
- Performance comprehension at WiredTiger (AF, CM, IB, JR, AW, SM, LY), pp. 83–94.
- ESEC-FSE-2018-FooCYAS #library #static analysis
- Efficient static checking of library updates (DF, HC, JY, MYA, AS), pp. 791–796.
- ESEC-FSE-2018-GadelhaMCN #debugging #detection #towards
- Towards counterexample-guided k-induction for fast bug detection (MYRG, FRM, LCC, DAN), pp. 765–769.
- ESEC-FSE-2018-JamshidiVKS #configuration management #learning #modelling
- Learning to sample: exploiting similarities across environments to learn performance models for configurable systems (PJ, MV, CK, NS), pp. 71–82.
- ICSE-2018-ArifSS #empirical #physics #testing
- Empirical study on the discrepancy between performance testing results from virtual and physical environments (MMA, WS, ES), p. 822.
- ICSE-2018-ChenCXWCLX #named #optimisation
- Speedoo: prioritizing performance optimization opportunities (ZC, BC0, LX0, XW, LC0, YL0, BX), pp. 811–821.
- ICSE-2018-DutraLBS #satisfiability #testing
- Efficient sampling of SAT solutions for testing (RD, KL, JB, KS), pp. 549–559.
- ICSE-2018-MirandaCVB #scalability #similarity #testing
- FAST approaches to scalable similarity-based test case prioritization (BM, EC, RV, AB), pp. 222–232.
- ICSE-2018-SirresBKLKKT #code search #query
- Augmenting and structuring user queries to support efficient free-form code search (RS, TFB, DK0, DL0, JK, KK, YLT), p. 945.
- ICSE-2018-TsantalisMEMD #commit #detection #refactoring
- Accurate and efficient refactoring detection in commit history (NT, MM, LME, DM, DD), pp. 483–494.
- ICSE-2018-WangCH #comprehension #empirical #stack
- Understanding the factors for fast answers in technical Q&A websites: an empirical study of four stack exchange websites (SW0, THC, AEH), p. 884.
- ICSE-2018-YangSLYC #case study #debugging #how #web
- How not to structure your database-backed web applications: a study of performance bugs in the wild (JY, PS, SL, CY, AC), pp. 800–810.
- ASPLOS-2018-BestaHYAMH #energy #network #scalability
- Slim NoC: A Low-Diameter On-Chip Network Topology for High Energy Efficiency and Scalability (MB, SMH, SY, RA, OM, TH), pp. 43–55.
- ASPLOS-2018-DickensGFH #encryption #named #using
- StrongBox: Confidentiality, Integrity, and Performance using Stream Ciphers for Full Drive Encryption (BDI, HSG, AJF, HH), pp. 708–721.
- ASPLOS-2018-LeeKLCGK #evaluation #named
- WSMeter: A Performance Evaluation Methodology for Google's Production Warehouse-Scale Computers (JL, CK, KL, LC, RG, JK), pp. 549–563.
- ASPLOS-2018-MallonGJ #named
- DLibOS: Performance and Protection with a Network-on-Chip (SM, VG, GJ), pp. 737–750.
- ASPLOS-2018-TaassoriSB #named #verification
- VAULT: Reducing Paging Overheads in SGX with Efficient Integrity Verification Structures (MT, AS, RB), pp. 665–678.
- CASE-2018-AshouriHNS #approximate #detection #energy #using
- Energy Performance Based Anomaly Detection in Non-Residential Buildings Using Symbolic Aggregate Approximation (AA, YH, GRN, WS0), pp. 1400–1405.
- CASE-2018-Cho #automation #design #fault
- CKF-based Fast Error Compensation Filter Design for IR-UWB Indoor Positioning System for Building Automation (SYC), pp. 668–670.
- CASE-2018-FeiLCWH #energy #fuzzy #petri net
- Fuzzy Petri Net Based Intelligent Machine Operation of Energy Efficient Manufacturing System (ZF, SL, QC, JW, YH), pp. 1593–1598.
- CASE-2018-GalvanauskasSLB #algorithm #design #development #process
- Development and Investigation of Efficient Substrate Feeding and Dissolved Oxygen Control Algorithms for Design of Recombinant E. coli Cultivation Process (VG, RS, DL, MB, RU), pp. 657–660.
- CASE-2018-KangYJ #analysis #realtime #using
- Real-time Production Performance Analysis Using Machine Degradation Signals: a Two-Machine Case (YK, HY, FJ), pp. 1501–1506.
- CASE-2018-KastnerKSJH #architecture #communication #cyber-physical #design
- Design of an efficient Communication Architecture for Cyber-Physical Production Systems (FK, DK, CS, BJ, MH), pp. 829–835.
- CASE-2018-KoppMPS #assessment
- Simulation-based Performance Assessment of Tool Requalification Strategies in Wafer Fabs (DK, LM, DP, MS), pp. 638–641.
- CASE-2018-LiuFHW #contest #hybrid
- Increasing Fuel Efficiency of a Hybrid Electric Competition Car by a Binary Equivalent Consumption Minimization Strategy (TL, LF, MH, JW), pp. 1–7.
- CASE-2018-LiXPC #markov #probability
- Efficient Sampling Procedure for Selecting the Largest Stationary Probability of a Markov Chain (HL, XX, YP, CHC), pp. 899–905.
- CASE-2018-MaierUG #automation #continuation #implementation #multi
- Efficient Implementation of Task Automation to Support Multidisciplinary Engineering of CPS (RM, SU, MG), pp. 1388–1393.
- CASE-2018-OutafraoutAN #analysis #approach #hybrid #modelling #multi #petri net
- A colored hybrid Petri net-based modeling approach for performance analysis of a multi-modal transportation system (KO, EhCEA, ANSM), pp. 1568–1573.
- CASE-2018-RoselliBA #comparison #evaluation #modelling #problem #scheduling #smt
- SMT Solvers for Job-Shop Scheduling Problems: Models Comparison and Performance Evaluation (SFR, KB, KÅ), pp. 547–552.
- CASE-2018-SarkarDA #multi #semantics #towards
- Semantic knowledge driven utility calculation towards efficient multi-robot task allocation (CS, SD, MA), pp. 144–147.
- CASE-2018-SundstromWL #energy #probability #robust
- Robust and Energy Efficient Trajectories in a Stochastic Common Workspace Setting (NS, OW, BL), pp. 77–83.
- CASE-2018-VitoloMCM #algorithm #evaluation #navigation
- Performance Evaluation of the Dyna-Q algorithm for Robot Navigation (EV, ASM, JC, CM), pp. 322–327.
- CASE-2018-Zou0HAX #analysis
- Analysis of End-of-State Impact on Manufacturing System Production Performance (JZ, QC0, JH0, JA, GX), pp. 823–828.
- CC-2018-ErtelGAC #compilation
- Compiling for concise code and efficient I/O (SE, AG, JA, JC), pp. 104–115.
- CC-2018-KastrinisBFPS #alias #analysis #data type
- An efficient data structure for must-alias analysis (GK, GB, KF, NPK, YS), pp. 48–58.
- CC-2018-SunBHB #dynamic analysis
- Efficient dynamic analysis for Node.js (HS, DB, CH, WB), pp. 196–206.
- CC-2018-ThierEK #constraints #flexibility
- Fast and flexible instruction selection with constraints (PT, MAE, AK), pp. 93–103.
- CGO-2018-BaghsorkhiM #automation #power management
- Automating efficient variable-grained resiliency for low-power IoT systems (SSB, CM), pp. 38–49.
- CGO-2018-CostaA #framework #named
- CollectionSwitch: a framework for efficient and dynamic collection selection (DC0, AA0), pp. 16–26.
- CGO-2018-HagedornSSGD #code generation
- High performance stencil code generation with lift (BH, LS, MS, SG, CD), pp. 100–112.
- CGO-2018-ToffolaPG #source code
- Synthesizing programs that expose performance bottlenecks (LDT, MP, TRG), pp. 314–326.
- CGO-2018-XieZLGJHZ #named
- CVR: efficient vectorization of SpMV on x86 processors (BX, JZ, XL0, WG, ZJ, XH, LZ0), pp. 149–162.
- FASE-2018-ChechikSDR #analysis #commutative #named
- FPH: Efficient Non-commutativity Analysis of Feature-Based Systems (MC, IS, CD, JR), pp. 319–336.
- FASE-2018-LechenetKG #dependence
- Fast Computation of Arbitrary Control Dependencies (JCL, NK, PLG), pp. 207–224.
- CAV-2018-SinghPV #learning #program analysis
- Fast Numerical Program Analysis with Reinforcement Learning (GS, MP, MTV), pp. 211–229.
- CAV-2018-LiDPRV #approximate #named #reachability
- SimpleCAR: An Efficient Bug-Finding Tool Based on Approximate Reachability (JL, RD, GP, KYR, MYV), pp. 37–44.
- ICST-2018-AlsharifKM #database #effectiveness #generative #named #relational #testing
- DOMINO: Fast and Effective Test Data Generation for Relational Database Schemas (AA, GMK, PM), pp. 12–22.
- ICST-2018-WalterSPR #clustering #execution #independence #order
- Improving Test Execution Efficiency Through Clustering and Reordering of Independent Test Steps (BW, MS, MP, SR), pp. 363–373.
- ICST-2018-WangTHHSSP #testing
- Testing Cloud Applications under Cloud-Uncertainty Performance Effects (WW0, NT, SH, SH, AS, MLS, LLP), pp. 81–92.
IJCAR-2018-ClaessenS #encoding #equation #first-order #logic- Efficient Encodings of First-Order Horn Formulas in Equational Logic (KC, NS), pp. 388–404.
- IJCAR-2018-HoenickeS #array #formal method
- Efficient Interpolation for the Theory of Arrays (JH, TS), pp. 549–565.
- IJCAR-2018-UrbaniKJDC #logic
- Efficient Model Construction for Horn Logic with VLog - System Description (JU, MK, CJHJ, ID, DC), pp. 680–688.
- ECSA-2017-NguyenOG #analysis #design #process #repository
- PARAD Repository: On the Capitalization of the Performance Analysis Process for AADL Designs (TDN, YO, EG), pp. 22–39.
CSEET-2017-SchoeffelWR #motivation #re-engineering #student- Impact of Pre-University Factors on the Motivation and Performance of Undergraduate Students in Software Engineering (PS, RSW, VFCR), pp. 266–275.
- EDM-2017-KlinglerWKSG #classification #student
- Efficient Feature Embeddings for Student Classification with Variational Auto-encoders (SK, RW, TK, BS, MHG).
- EDM-2017-RihakP #education #similarity #using
- Measuring Similarity of Educational Items Using Data on Learners' Performance (JR, RP).
- EDM-2017-ShiPG #analysis #learning #using
- Using an Additive Factor Model and Performance Factor Analysis to Assess Learning Gains in a Tutoring System to Help Adults with Reading Difficulties (GS, PIPJ, ACG).
- EDM-2017-WanDGYL #online #predict
- Predicting Performance in a Small Private Online Course (HW, JD, XG, QY, KL).
ICPC-2017-HozanoGAFC #detection #developer #exclamation #smell- Smells are sensitive to developers!: on the efficiency of (un)guided customized detection (MH, AG, NA, BF, EdBC), pp. 110–120.
- ICSME-2017-ChenS #case study
- An Exploratory Study of Performance Regression Introducing Code Changes (JC, WS), pp. 341–352.
- MSR-2017-BisongTB #modelling #predict
- Built to last or built too fast?: evaluating prediction models for build times (EB, ET, OB), pp. 487–490.
- SANER-2017-AltingerHSGW #fault #predict
- Performance tuning for automotive Software Fault Prediction (HA, SH, FS, JG, FW), pp. 526–530.
- SANER-2017-EttingerTM #automation
- Efficient method extraction for automatic elimination of type-3 clones (RE, SST, SM), pp. 327–337.
- SANER-2017-NucciPPPZL #android #energy #profiling #question #reliability
- Software-based energy profiling of Android apps: Simple, efficient and reliable? (DDN, FP, AP, AP, AZ, ADL), pp. 103–114.
- Haskell-2017-WiegleyD #coq #haskell #using
- Using Coq to write fast and correct Haskell (JW, BD), pp. 52–62.
- Haskell-2017-YatesS #transaction
- Improving STM performance with transactional structs (RY, MLS), pp. 186–196.
- ICFP-2017-OwensNKMT #verification
- Verifying efficient function calls in CakeML (SO, MN, RK, MOM, YKT), p. 27.
- ICFP-2017-Spivey #pipes and filters
- Faster coroutine pipelines (JMS), p. 23.
- AIIDE-2017-ClarkF #random #scalability #search-based
- Fast Random Genetic Search for Large-Scale RTS Combat Scenarios (CC, AF), pp. 165–171.
- CHI-PLAY-2017-JohansonGM #3d #game studies #learning #navigation
- The Effects of Navigation Assistance on Spatial Learning and Performance in a 3D Game (CJ, CG, RLM), pp. 341–353.
- CIG-2017-JeonYYK #game studies #mobile #predict
- Extracting gamers' cognitive psychological features and improving performance of churn prediction from mobile games (JJ, DY, SIY, KJK), pp. 150–153.
- DiGRA-2017-WitkowskiM #game studies
- Playing with(out) Power: Negotiated conventions of high performance networked play practices (EW, JM).
- FDG-2017-ChungKYMRC #game studies #visual notation
- The impact of visual load on performance in a human-computation game (CC, AK, YY, AM, JR, MC), p. 4.
- FDG-2017-Mawhorter #case study #generative #product line #representation #using
- Efficiency, realism, and representation in generated content: a case study using family tree generation (PAM), p. 4.
- CIKM-2017-AnwarNH #approach #community #novel
- A Novel Approach for Efficient Computation of Community Aware Ridesharing Groups (SA, SN, TH), pp. 1971–1974.
- CIKM-2017-BaskaranKCGS #dependence #functional #ontology
- Efficient Discovery of Ontology Functional Dependencies (SB, AK0, FC, LG, JS), pp. 1847–1856.
- CIKM-2017-BastB #named #query
- QLever: A Query Engine for Efficient SPARQL+Text Search (HB, BB), pp. 647–656.
- CIKM-2017-ChenAS #analysis #bias #empirical
- An Empirical Analysis of Pruning Techniques: Performance, Retrievability and Bias (RCC, LA, FS), pp. 2023–2026.
- CIKM-2017-CristoHCLP #modelling #recognition #word
- Fast Word Recognition for Noise channel-based Models in Scenarios with Noise Specific Domain Knowledge (MC, RH, ALdCC, FAL, MdGCP), pp. 607–616.
- CIKM-2017-DingLHM #fault tolerance #recommendation #using
- Efficient Fault-Tolerant Group Recommendation Using alpha-beta-core (DD, HL, ZH0, NM), pp. 2047–2050.
- CIKM-2017-DongCWT0LLC #enterprise #security #sequence
- Efficient Discovery of Abnormal Event Sequences in Enterprise Security Systems (BD, ZC, WHW, LAT, KZ0, YL, ZL, HC), pp. 707–715.
- CIKM-2017-HoangL #clustering #mining #network
- Highly Efficient Mining of Overlapping Clusters in Signed Weighted Networks (TAH, EPL), pp. 869–878.
- CIKM-2017-HuHQ #algorithm #communication #parallel #parametricity
- A Communication Efficient Parallel DBSCAN Algorithm based on Parameter Server (XH, JH0, MQ), pp. 2107–2110.
- CIKM-2017-HuWBZC #clustering #scalability
- Fast K-means for Large Scale Clustering (QH, JW, LB0, YZ0, JC0), pp. 2099–2102.
- CIKM-2017-KimPP #machine learning #modelling
- Machine Learning based Performance Modeling of Flash SSDs (JK, JP, SP), pp. 2135–2138.
- CIKM-2017-LeL #personalisation #ranking #recommendation
- Indexable Bayesian Personalized Ranking for Efficient Top-k Recommendation (DDL, HWL), pp. 1389–1398.
- CIKM-2017-ProskurniaM0AC #detection #documentation #topic #using
- Efficient Document Filtering Using Vector Space Topic Expansion and Pattern-Mining: The Case of Event Detection in Microposts (JP, RM, CC0, KA, PCM), pp. 457–466.
- CIKM-2017-RahmanAKD #category theory
- Efficient Computation of Subspace Skyline over Categorical Domains (MFR, AA, NK, GD0), pp. 407–416.
- CIKM-2017-SchaferL #classification
- Fast and Accurate Time Series Classification with WEASEL (PS0, UL), pp. 637–646.
- CIKM-2017-SeoK #algorithm #clustering #graph #named #scalability
- pm-SCAN: an I/O Efficient Structural Clustering Algorithm for Large-scale Graphs (JHS, MHK), pp. 2295–2298.
- CIKM-2017-WuSZ #approach #behaviour #detection #modelling
- A Fast Trajectory Outlier Detection Approach via Driving Behavior Modeling (HW0, WS, BZ), pp. 837–846.
- CIKM-2017-YanCYL #comprehension #database #web
- Understanding Database Performance Inefficiencies in Real-world Web Applications (CY, AC, JY, SL), pp. 1299–1308.
- CIKM-2017-YuQL0CZ #algorithm
- Fast Algorithms for Pareto Optimal Group-based Skyline (WY, ZQ, JL, LX0, XC, HZ), pp. 417–426.
- ECIR-2017-ArguelloA0 #predict #query #using
- Using Query Performance Predictors to Reduce Spoken Queries (JA, SA, FD0), pp. 27–39.
- ECIR-2017-HafizogluKA #on the
- On the Efficiency of Selective Search (FH, ECK, ISA), pp. 705–712.
- ECIR-2017-HasibiBB #effectiveness #query
- Entity Linking in Queries: Efficiency vs. Effectiveness (FH, KB, SEB), pp. 40–53.
- ECIR-2017-KhandelwalA #clustering #estimation
- Faster K-Means Cluster Estimation (SK, AA), pp. 520–526.
- ICML-2017-AliWK #programming
- A Semismooth Newton Method for Fast, Generic Convex Programming (AA, EW, JZK), pp. 70–79.
- ICML-2017-Allen-Zhu #named #optimisation #parametricity #probability
- Natasha: Faster Non-Convex Stochastic Optimization via Strongly Non-Convex Parameter (ZAZ), pp. 89–97.
- ICML-2017-Allen-ZhuL
- Doubly Accelerated Methods for Faster CCA and Generalized Eigendecomposition (ZAZ, YL), pp. 98–106.
- ICML-2017-Allen-ZhuL17a #approximate #component #matrix
- Faster Principal Component Regression and Stable Matrix Chebyshev Approximation (ZAZ, YL), pp. 107–115.
- ICML-2017-Allen-ZhuL17b #learning #online
- Follow the Compressed Leader: Faster Online Learning of Eigenvectors and Faster MMWU (ZAZ, YL), pp. 116–125.
- ICML-2017-AndersonG #algorithm #approximate #online #rank
- An Efficient, Sparsity-Preserving, Online Algorithm for Low-Rank Approximation (DGA, MG0), pp. 156–165.
- ICML-2017-BackursT #algorithm #clique
- Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms (AB, CT), pp. 311–321.
- ICML-2017-BeygelzimerOZ #learning #multi #online
- Efficient Online Bandit Multiclass Learning with Õ(√T) Regret (AB, FO, CZ), pp. 488–497.
- ICML-2017-BolukbasiWDS #adaptation #network
- Adaptive Neural Networks for Efficient Inference (TB, JW0, OD, VS), pp. 527–536.
- ICML-2017-BrownS #convergence #game studies
- Reduced Space and Faster Convergence in Imperfect-Information Games via Pruning (NB, TS), pp. 596–604.
- ICML-2017-CaiDK #testing
- Priv'IT: Private and Sample Efficient Identity Testing (BC, CD, GK0), pp. 635–644.
- ICML-2017-ChenLK #estimation #matrix #towards
- Toward Efficient and Accurate Covariance Matrix Estimation on Compressed Data (XC, MRL, IK), pp. 767–776.
- ICML-2017-ChenYLZ #online #optimisation #scalability
- Online Partial Least Square Optimization: Dropping Convexity for Better Efficiency and Scalability (ZC, LFY, CJL, TZ), pp. 777–786.
- ICML-2017-FinnAL #adaptation #network
- Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks (CF, PA, SL), pp. 1126–1135.
- ICML-2017-GautierBV
- Zonotope Hit-and-run for Efficient Sampling from Projection DPPs (GG, RB, MV), pp. 1223–1232.
- ICML-2017-GraveJCGJ #approximate
- Efficient softmax approximation for GPUs (EG, AJ, MC, DG, HJ), pp. 1302–1310.
- ICML-2017-HanKPS #process
- Faster Greedy MAP Inference for Determinantal Point Processes (IH, PK, KP, JS), pp. 1384–1393.
- ICML-2017-HazanSZ #game studies
- Efficient Regret Minimization in Non-Convex Games (EH, KS, CZ), pp. 1433–1441.
- ICML-2017-HenriquesV
- Warped Convolutions: Efficient Invariance to Spatial Transformations (JFH, AV), pp. 1461–1469.
- ICML-2017-HongHZ #algorithm #distributed #learning #named #network #optimisation
- Prox-PDA: The Proximal Primal-Dual Algorithm for Fast Distributed Nonconvex Optimization and Learning Over Networks (MH, DH, MMZ), pp. 1529–1538.
- ICML-2017-JiangMCSMG
- Efficient Nonmyopic Active Search (SJ, GM, GC, AS, BM, RG), pp. 1714–1723.
- ICML-2017-JingSDPSLTS #network
- Tunable Efficient Unitary Neural Networks (EUNN) and their application to RNNs (LJ, YS, TD, JP, SAS, YL, MT, MS), pp. 1733–1741.
- ICML-2017-KaleKLP #adaptation #feature model #linear #online
- Adaptive Feature Selection: Computationally Efficient Online Sparse Linear Regression under RIP (SK, ZSK, TL, DP), pp. 1780–1788.
- ICML-2017-LiM #nearest neighbour
- Fast k-Nearest Neighbour Search via Prioritized DCI (KL, JM), pp. 2081–2090.
- ICML-2017-MhammediHRB #network #orthogonal #using
- Efficient Orthogonal Parametrisation of Recurrent Neural Networks Using Householder Reflections (ZM, ADH, AR, JB0), pp. 2401–2409.
- ICML-2017-RahmaniA #robust
- Coherence Pursuit: Fast, Simple, and Robust Subspace Recovery (MR, GKA), pp. 2864–2873.
- ICML-2017-Shrivastava
- Optimal Densification for Fast and Accurate Minwise Hashing (AS), pp. 3154–3163.
- ICML-2017-WalderB #estimation #process
- Fast Bayesian Intensity Estimation for the Permanental Process (CJW, ANB), pp. 3579–3588.
- ICML-2017-WangJ #optimisation
- Max-value Entropy Search for Efficient Bayesian Optimization (ZW, SJ), pp. 3627–3635.
- ICML-2017-WangKS0 #distributed #learning
- Efficient Distributed Learning with Sparsity (JW, MK, NS, TZ0), pp. 3636–3645.
- ICML-2017-WuZ #metric #multi
- A Unified View of Multi-Label Performance Measures (XZW, ZHZ), pp. 3780–3788.
- ICML-2017-XuLY #convergence #optimisation #probability
- Stochastic Convex Optimization: Faster Local Growth Implies Faster Global Convergence (YX, QL, TY), pp. 3821–3830.
- ICML-2017-ZaheerKAMS
- Canopy Fast Sampling with Cover Trees (MZ, SK, AA, JMFM, AJS), pp. 3977–3986.
- KDD-2017-BifetZFHZQHP #data type #evolution #mining
- Extremely Fast Decision Tree Mining for Evolving Data Streams (AB, JZ, WF0, CH, JZ, JQ, GH0, BP), pp. 1733–1742.
- KDD-2017-BlalockG #data mining #mining #named
- Bolt: Accelerated Data Mining with Fast Vector Compression (DWB, JVG), pp. 727–735.
- KDD-2017-BorisyukZK #named #towards
- LiJAR: A System for Job Application Redistribution towards Efficient Career Marketplace (FB, LZ, KK), pp. 1397–1406.
- KDD-2017-ChenG #optimisation
- Fast Newton Hard Thresholding Pursuit for Sparsity Constrained Nonconvex Optimization (JC, QG), pp. 757–766.
- KDD-2017-ConteFMPT #scalability
- Fast Enumeration of Large k-Plexes (AC, DF, CM, MP, RT), pp. 115–124.
- KDD-2017-DuZCT #interactive #named
- FIRST: Fast Interactive Attributed Subgraph Matching (BD, SZ, NC, HT), pp. 1447–1456.
- KDD-2017-HeHBHX #correlation #modelling #topic
- Efficient Correlated Topic Modeling with Topic Embedding (JH, ZH, TBK, YH, EPX), pp. 225–233.
- KDD-2017-HillNLIV #algorithm #multi #optimisation #realtime
- An Efficient Bandit Algorithm for Realtime Multivariate Optimization (DNH, HN, YL0, AI, SVNV), pp. 1813–1821.
- KDD-2017-KoutraDBWIFB #design #named
- PNP: Fast Path Ensemble Method for Movie Design (DK, AD, SB, UW, SI, CF, JB), pp. 1527–1536.
- KDD-2017-LouO #named
- BDT: Gradient Boosted Decision Tables for High Accuracy and Scoring Efficiency (YL, MO), pp. 1893–1901.
- KDD-2017-RuizPWL #quote #tool support
- “The Leicester City Fairytale?”: Utilizing New Soccer Analytics Tools to Compare Performance in the 15/16 & 16/17 EPL Seasons (HR, PP, XW, PL), pp. 1991–2000.
- KDD-2017-Song0H #clustering #named #parallel
- PAMAE: Parallel k-Medoids Clustering with High Accuracy and Efficiency (HS, JGL0, WSH), pp. 1087–1096.
- KDD-2017-WangAL #kernel #random #re-engineering
- Randomized Feature Engineering as a Fast and Accurate Alternative to Kernel Methods (SW, CCA, HL0), pp. 485–494.
- KDD-2017-Zhang0 #named #similarity
- EmbedJoin: Efficient Edit Similarity Joins via Embeddings (HZ, QZ0), pp. 585–594.
- ECMFA-2017-KonigD #consistency #modelling
- Efficient Consistency Checking of Interrelated Models (HK, ZD), pp. 161–178.
ICMT-2017-Strueber #generative #modelling #search-based- Generating Efficient Mutation Operators for Search-Based Model-Driven Engineering (DS), pp. 121–137.
- ECOOP-2017-HuangR #concurrent #detection #perspective #precise #what
- What's the Optimal Performance of Precise Dynamic Race Detection? - A Redundancy Perspective (JH, AKR), p. 22.
- Onward-2017-FrancoHWDE #abstraction
- You can have it all: abstraction and good cache performance (JF, MH, TW, SD, SE), pp. 148–167.
- OOPSLA-2017-ChaudhuriVGRL #javascript #precise #type checking
- Fast and precise type checking for JavaScript (AC, PV, SG, MR, GL), p. 30.
- OOPSLA-2017-CohenFL #memory management #protocol
- Efficient logging in non-volatile memory by exploiting coherency protocols (NC, MF, JRL), p. 24.
- OOPSLA-2017-SpathAB #alias #analysis #data flow #named #precise
- IDEal: efficient and precise alias-aware dataflow analysis (JS, KA0, EB), p. 27.
- PADL-2017-FowlerH #testing
- Failing Faster: Overlapping Patterns for Property-Based Testing (JF, GH), pp. 103–119.
- PLDI-2017-AbdullaACDHRR #analysis #constraints #framework #string
- Flatten and conquer: a framework for efficient analysis of string constraints (PAA, MFA, YFC, BPD, LH, AR, PR), pp. 602–617.
- PLDI-2017-KediaCPVVB #memory management
- Simple, fast, and safe manual memory management (PK, MC, MJP, KV, DV, AB), pp. 233–247.
- PLDI-2017-MamourasRAIK #composition #evaluation #named #query #specification #streaming
- StreamQRE: modular specification and efficient evaluation of quantitative queries over streaming data (KM, MR, RA, ZGI, SK), pp. 693–708.
- PLDI-2017-PetrashkoLO #compilation #composition #named #program transformation #using
- Miniphases: compilation using modular and efficient tree transformations (DP, OL, MO), pp. 201–216.
- PLDI-2017-TanLX #analysis #automaton #modelling #points-to #precise
- Efficient and precise points-to analysis: modeling the heap by merging equivalent automata (TT0, YL0, JX), pp. 278–291.
- POPL-2017-SinghPV #abstract domain
- Fast polyhedra abstract domain (GS, MP, MTV), pp. 46–59.
- PPDP-2017-BelangerA #exclamation
- Shrink fast correctly! (OSB, AWA), pp. 49–60.
- SAS-2017-MukherjeePSDR #abstraction #semantics #source code #thread
- Thread-Local Semantics and Its Efficient Sequential Abstractions for Race-Free Programs (SM, OP, SS, DD, NR), pp. 253–276.
- ASE-2017-AlatawiSM #abstract interpretation #execution #symbolic computation
- Leveraging abstract interpretation for efficient dynamic symbolic execution (EA, HS, TM0), pp. 619–624.
- ASE-2017-IncertoTT #adaptation #predict #self
- Software performance self-adaptation through efficient model predictive control (EI, MT, CT), pp. 485–496.
- ASE-2017-JamshidiSVKPA #analysis #configuration management #learning #modelling
- Transfer learning for performance modeling of configurable systems: an exploratory analysis (PJ, NS, MV, CK, AP, YA), pp. 497–508.
- ASE-2017-JiangWLC #android #named #sequence
- SimplyDroid: efficient event sequence simplification for Android application (BJ0, YW, TL, WKC0), pp. 297–307.
- ASE-2017-LessenichAKSS #precise
- Renaming and shifted code in structured merging: looking ahead for precision and performance (OL, SA, CK, GS, JS), pp. 543–553.
- ASE-2017-MenariniYG #case study #code review #overview #semantics #user study
- Semantics-assisted code review: an efficient toolchain and a user study (MM, YY, WGG), pp. 554–565.
- ESEC-FSE-2017-Schramm #automation #heuristic #program repair #using
- Improving performance of automatic program repair using learned heuristics (LS), pp. 1071–1073.
- ESEC-FSE-2017-SiegmundPPAHKBB #comprehension
- Measuring neural efficiency of program comprehension (JS, NP, CP, SA, JH, CK, AB, AB, AB), pp. 140–150.
- ESEC-FSE-2017-Tang #design #optimisation
- System performance optimization via design and configuration space exploration (CT0), pp. 1046–1049.
- ESEC-FSE-2017-YogaN #parallel #profiling #source code
- A fast causal profiler for task parallel programs (AY, SN), pp. 15–26.
- ICSE-2017-ChoudharyLP #concurrent #detection #generative #safety #testing #thread
- Efficient detection of thread safety violations via coverage-guided generation of concurrent tests (AC, SL, MP), pp. 266–277.
- ICSE-2017-SongL
- Performance diagnosis for inefficient loops (LS, SL), pp. 370–380.
- ICSE-2017-SoutodG #configuration management #testing
- Balancing soundness and efficiency for practical testing of configurable systems (SS, Md, RG), pp. 632–642.
- ICSE-2017-SuCFR #evaluation #markov #named #runtime
- ProEva: runtime proactive performance evaluation based on continuous-time markov chains (GS, TC, YF0, DSR), pp. 484–495.
- ICSE-2017-TsutanoBSRD #android #approach #robust #scalability
- An efficient, robust, and scalable approach for analyzing interacting android apps (YT, SB, WSa, GR, JD), pp. 324–334.
GPCE-2017-Perard-GayotWMS #abstraction #algorithm #named #traversal- RaTrace: simple and efficient abstractions for BVH ray traversal algorithms (APG, MW, RM, PS, RL, SH), pp. 157–168.
- SLE-2017-LuhunuS #code generation #comparison #tool support
- Comparison of the expressiveness and performance of template-based code generation tools (LL, ES), pp. 206–216.
- SLE-2017-Pereira0RRCFS #energy #how #memory management #programming language #question
- Energy efficiency across programming languages: how do energy, time, and memory relate? (RP, MC, FR, RR, JC, JPF, JS), pp. 256–267.
- ASPLOS-2017-BaiLI #power management
- Voltage Regulator Efficiency Aware Power Management (YB, VWL, EI), pp. 825–838.
- ASPLOS-2017-Bianchini
- Improving Datacenter Efficiency (RB), p. 327.
- ASPLOS-2017-CoxB #architecture #multi
- Efficient Address Translation for Architectures with Multiple Page Sizes (GC, AB), pp. 435–448.
- ASPLOS-2017-ElyasiASKDJ
- Exploiting Intra-Request Slack to Improve SSD Performance (NE, MA, AS, MTK, CRD, MJ), pp. 375–388.
- ASPLOS-2017-GaoPYHK #3d #memory management #named #network #scalability
- TETRIS: Scalable and Efficient Neural Network Acceleration with 3D Memory (MG, JP, XY, MH, CK), pp. 751–764.
- ASPLOS-2017-HuangAZ #debugging #named #semantics
- Pallas: Semantic-Aware Checking for Finding Deep Bugs in Fast Path (JH0, MAB, XZ), pp. 709–722.
- ASPLOS-2017-ParkPM #multi #resource management
- Dynamic Resource Management for Efficient Utilization of Multitasking GPUs (JJKP, YP, SAM), pp. 527–540.
- ASPLOS-2017-RajbhandariHRCC #multi #optimisation #scalability
- Optimizing CNNs on Multicores for Scalability, Performance and Goodput (SR, YH, OR, MC, TMC), pp. 267–280.
- ASPLOS-2017-VoraGX #approximate #graph #named #streaming
- KickStarter: Fast and Accurate Computations on Streaming Graphs via Trimmed Approximations (KV, RG0, G(X), pp. 237–251.
- ASPLOS-2017-WuLZJ #flexibility #named
- FLEP: Enabling Flexible and Efficient Preemption on GPUs (BW0, XL0, XZ0, CJ), pp. 483–496.
- CASE-2017-ChangCC #how #modelling #variability
- How simplified models of different variability affects performance of ordinal transformation (CMC, SCC, CHC), pp. 1065–1066.
- CASE-2017-ChenGL #analysis #identification #markov #online
- Load identification based on Factorial Hidden Markov Model and online performance analysis (SC, FG, TL0), pp. 1249–1253.
- CASE-2017-HonarpardazMH #design
- Fast grasp tool design: From force to form closure (MH, MM, RH), pp. 782–788.
- CASE-2017-HuangMY #algorithm #difference #evolution #throughput #using
- Forecasting of throughput performance using an ARMA model with improved differential evolution algorithm (JTH, YM, YY), pp. 376–381.
- CASE-2017-InuiKU #gpu #parallel #using
- Fast extraction of cutter engagement features by using the parallel processing function of a GPU (MI, MK, NU), pp. 668–673.
- CASE-2017-LeeLH #algorithm #constraints #design #evaluation
- Iteration algorithms for performance evaluation and buffer design of Bernoulli serial lines with waiting time constraints (JHL, JL, JAH), pp. 654–655.
- CASE-2017-LiuJXX #higher-order #probability
- Fast terminal sliding mode control of high-order stochastic systems (XL, XJ, LX, HX), pp. 1592–1597.
- CASE-2017-SuryajayaCHLLL #data transformation #industrial
- A fast large-size production data transformation scheme for supporting smart manufacturing in semiconductor industry (BS, CCC, MHH, YYL, JXL, YCL), pp. 275–281.
- CASE-2017-WangJL #case study #cyber-physical #evaluation
- A study on performance evaluation and status-based decision for cyber-physical production systems (FW, FJ, YL), pp. 1000–1005.
- CASE-2017-WangXDLC #energy #fuzzy
- Fuzzy decision of machine switch on-off for energy efficient operation of manufacturing system (JW, JX, ETD, SL, QC), pp. 1158–1162.
- CASE-2017-WangYCX #evaluation
- Performance evaluation of bernoulli serial lines with batching machines (JQW, FYY, PHC, TX), p. 295.
- CASE-2017-WigstromMRL #energy #multi #optimisation
- Computationally efficient energy optimization of multiple robots (OW, NM, SR, BL), pp. 515–522.
- CASE-2017-XiaoLYW #data-driven #database #energy #industrial #parametricity #process
- An industrial data based investigation into effects of process parameters on cutting power and energy efficiency (QX, CL, QY, QW), pp. 1481–1486.
- CASE-2017-XuLC #data analysis
- Local AIS data analytics for efficient operation management in Vessel Traffic Service (GX, FL, CHC), pp. 1668–1672.
- CASE-2017-YanZ #analysis
- Efficiency analysis of series machines under operation-dependent-failures (CBY, QZ), pp. 476–481.
- CASE-2017-ZhangWZ #adaptation
- Fast adaptive search on the line in dual environments (JZ, YW, MZ), pp. 1540–1545.
- CASE-2017-ZhaoLHD #analysis #flexibility #problem
- Optimal planning of plant flexibility: Problem formulation and performance analysis (CZ, JL, NH, GAD), p. 986.
- CGO-2017-DotM0 #profiling
- Removing checks in dynamically typed languages through efficient profiling (GD, AM, AG0), pp. 257–268.
- CGO-2017-SuLX #approach #automation #compilation #generative
- Automatic generation of fast BLAS3-GEMM: a portable compiler approach (XS, XL, JX), pp. 122–133.
ESOP-2017-ChatterjeeKMP #algorithm #recursion #state machine- Faster Algorithms for Weighted Recursive State Machines (KC, BK, SM, AP), pp. 287–313.
- ESOP-2017-TangWXZW0 #analysis #library #reachability #summary
- Conditional Dyck-CFL Reachability Analysis for Complete and Efficient Library Summarization (HT, DW, YX, LZ, XW, LZ0), pp. 880–908.
- CADE-2017-Cruz-FilipeHHKS #verification
- Efficient Certified RAT Verification (LCF, MJHH, WAHJ, MK, PSK), pp. 220–236.
- CADE-2017-Lammich #satisfiability
- Efficient Verified (UN)SAT Certificate Checking (PL), pp. 237–254.
- CAV-2017-KatzBDJK #named #network #smt #verification
- Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks (GK, CWB, DLD, KJ, MJK), pp. 97–117.
- CAV-2017-Fearnley #game studies #parallel
- Efficient Parallel Strategy Improvement for Parity Games (JF), pp. 137–154.
- CAV-2017-TouzeauMMR #analysis #nondeterminism
- Ascertaining Uncertainty for Efficient Exact Cache Analysis (VT, CM, DM, JR), pp. 22–40.
CSL-2017-BresolinMS #logic #reasoning- Fast(er) Reasoning in Interval Temporal Logic (DB, EMV, GS), p. 17.
- ICST-2017-DarkeCCV #abstraction #bound #model checking #proving #safety #using
- Efficient Safety Proofs for Industry-Scale Code Using Abstractions and Bounded Model Checking (PD, BC, AC, RV), pp. 468–475.
- ICST-2017-Gyori0PM #linear #metric #runtime
- Efficient Incrementalized Runtime Checking of Linear Measures on Lists (AG, PG0, EP, PM), pp. 310–320.
- ICST-2017-OliveiraFDHS #effectiveness #named #testing
- Perphecy: Performance Regression Test Selection Made Simple but Effective (ABdO, SF, AD, MH, PFS), pp. 103–113.
- VMCAI-2017-MarechalP
- Efficient Elimination of Redundancies in Polyhedra by Raytracing (AM, MP), pp. 367–385.
QoSA-2016-LehrigB #as a service #case study #modelling #using- Using Performance Models for Planning the Redeployment to Infrastructure-as-a-Service Environments: A Case Study (SL, SB0), pp. 11–20.
- QoSA-2016-StierK #adaptation #analysis #modelling #self
- Considering Transient Effects of Self-Adaptations in Model-Driven Performance Analyses (CS, AK), pp. 80–89.
WICSA-2016-GesvindrB #architecture #as a service #design- Architectural Tactics for the Design of Efficient PaaS Cloud Applications (DG, BB), pp. 158–167.
- JCDL-2016-HolzmannGA #named #web
- ArchiveSpark: Efficient Web Archive Access, Extraction and Derivation (HH, VG, AA), pp. 83–92.
- EDM-2016-al-RifaieYd #predict
- Investigating Swarm Intelligence for Performance Prediction (MMaR, MYK, Md), pp. 264–269.
- EDM-2016-Bydzovska #analysis #comparative #predict #student
- A Comparative Analysis of Techniques for Predicting Student Performance (HB), pp. 306–311.
- EDM-2016-Mojarad #student #using
- Studying Assignment Size and Student Performance Using Propensity Score Matching (SM), pp. 701–702.
- EDM-2016-MoriC #behaviour #identification #online #student
- Identifying Student Behaviors Early in the Term for Improving Online Course Performance (MM, PC), pp. 611–612.
- EDM-2016-RenRJ #modelling #multi #predict #using
- Predicting Performance on MOOC Assessments using Multi-Regression Models (ZR, HR, AJ), pp. 484–489.
- EDM-2016-SahebiLB #modelling #predict #student
- Tensor Factorization for Student Modeling and Performance Prediction in Unstructured Domain (SS, YRL, PB), pp. 502–506.
- EDM-2016-SnowKPFB #how #learning #online #student
- Quantifying How Students Use an Online Learning System: A Focus on Transitions and Performance (ELS, AEK, TEP, MF, AJB), pp. 640–641.
- EDM-2016-StapelZP #learning #online #predict #student
- An Ensemble Method to Predict Student Performance in an Online Math Learning Environment (MS, ZZ, NP), pp. 231–238.
- EDM-2016-SweeneyLRJ #approach #predict #recommendation #student
- Next-Term Student Performance Prediction: A Recommender Systems Approach (MS, JL, HR, AJ), p. 7.
- EDM-2016-TomkinsRG #behaviour #case study #predict #student
- Predicting Post-Test Performance from Student Behavior: A High School MOOC Case Study (ST, AR, LG), pp. 239–246.
- ICSME-2016-AlghmadiSSH #approach #automation #recommendation #testing
- An Automated Approach for Recommending When to Stop Performance Tests (HMA, MDS, WS, AEH), pp. 279–289.
- ICSME-2016-MarijanL #testing
- Effect of Time Window on the Performance of Continuous Regression Testing (DM, ML), pp. 568–571.
- ICSME-2016-NewmanMC #named #static typing
- srcType: A Tool for Efficient Static Type Resolution (CDN, JIM, MLC), pp. 604–606.
- ICSME-2016-PalombaZFLO #debugging #predict #smell #using
- Smells Like Teen Spirit: Improving Bug Prediction Performance Using the Intensity of Code Smells (FP, MZ, FAF, ADL, RO), pp. 244–255.
- ICSME-2016-PintoLCL #energy #java #thread
- A Comprehensive Study on the Energy Efficiency of Java's Thread-Safe Collections (GP0, KL, FC, YDL), pp. 20–31.
- ICSME-2016-PintoLCL16a #energy #java #thread
- Artifacts for “A Comprehensive Study on the Energy Efficiency of Java's Thread-Safe Collections” (GP0, KL, FC, YDL), pp. 614–615.
- MSR-2016-AhmedBCHS #case study #detection #effectiveness #experience #tool support #web
- Studying the effectiveness of application performance management (APM) tools for detecting performance regressions for web applications: an experience report (TMA, CPB, THC, AEH, WS), pp. 1–12.
- MSR-2016-GomezRAS #android #automation #detection #mining #repository #user interface
- Mining test repositories for automatic detection of UI performance regressions in Android apps (MG0, RR, BA, LS), pp. 13–24.
- MSR-2016-LuoPG #evolution #mining
- Mining performance regression inducing code changes in evolving software (QL, DP, MG), pp. 25–36.
- SANER-2016-ChowdhurySH #developer #energy #mobile #web
- Client-Side Energy Efficiency of HTTP/2 for Web and Mobile App Developers (SAC, VS, AH), pp. 529–540.
- SANER-2016-SwidanHK #case study #scalability #spreadsheet
- Improving the Performance of a Large Scale Spreadsheet: A Case Study (AS, FH, RK), pp. 673–677.
- SANER-2016-YeZMYZ #javascript #precise #slicing #source code
- Efficient and Precise Dynamic Slicing for Client-Side JavaScript Programs (JY, CZ, LM0, HY0, JZ), pp. 449–459.
SCAM-2016-MingW #concurrent #control flow #multi #named #profiling #thread- BinCFP: Efficient Multi-threaded Binary Code Control Flow Profiling (JM0, DW), pp. 61–66.
CIAA-2016-WaszczukSP #parsing- Enhancing Practical TAG Parsing Efficiency by Capturing Redundancy (JW, AS, YP0), pp. 310–321.
- IFM-2016-0002HB #code review #formal method #question
- Can Formal Methods Improve the Efficiency of Code Reviews? (MH0, RH, RB), pp. 3–19.
- IFM-2016-AntoninoGR #analysis #satisfiability #using
- Efficient Deadlock-Freedom Checking Using Local Analysis and SAT Solving (PA, TGR, AWR), pp. 345–360.
- Haskell-2016-Yamamoto #case study #experience #haskell
- Experience report: developing high performance HTTP/2 server in Haskell (KY), pp. 74–79.
- AIIDE-2016-FarrellW
- Fast and Diverse Narrative Planning through Novelty Pruning (RF, SGW), pp. 37–43.
- CHI-PLAY-2016-EmmerichM #experience
- The Influence of Virtual Agents on Player Experience and Performance (KE, MM), pp. 10–21.
- CHI-PLAY-2016-RaptisFA #behaviour #difference #game studies #question
- Do Field Dependence-Independence Differences of Game Players Affect Performance and Behaviour in Cultural Heritage Games? (GER, CAF, NMA), pp. 38–43.
- CIG-2016-HolmgardTH #assessment #game studies
- Computational intelligence and cognitive performance assessment games (CH, JT, LH), pp. 1–8.
- DiGRA-FDG-2016-Karhulahti
- Prank, Troll, Gross and Gore: Performance Issues in Esport Live-Streaming (VMK).
- DiGRA-FDG-2016-ParkerG #community #game studies #process
- Creative Communities: Shaping Process through Performance and Play (LP, DG).
- CIKM-2016-0003LRA
- Q+Tree: An Efficient Quad Tree based Data Indexing for Parallelizing Dynamic and Reverse Skylines (MSI0, CL, JWR, TA), pp. 1291–1300.
- CIKM-2016-ChenLYWLZ #graph #keyword #multi #query
- Efficient Batch Processing for Multiple Keyword Queries on Graph Data (LC, CL, XY0, BW0, JL, RZ0), pp. 1261–1270.
- CIKM-2016-ChenWPT #community #network #using
- Efficient Computation of Importance Based Communities in Web-Scale Networks Using a Single Machine (SC, RW, DP, AT), pp. 1553–1562.
- CIKM-2016-EtemadiLT #estimation #graph #scalability
- Efficient Estimation of Triangles in Very Large Graphs (RE, JL, YHT), pp. 1251–1260.
- CIKM-2016-HamooniDXZJM #named #pattern matching #pattern recognition #recognition
- LogMine: Fast Pattern Recognition for Log Analytics (HH, BD, JX, HZ0, GJ, AM), pp. 1573–1582.
- CIKM-2016-JangFKKH #information management #named #trust
- PIN-TRUST: Fast Trust Propagation Exploiting Positive, Implicit, and Negative Information (MHJ, CF, SWK, UK, JH), pp. 629–638.
- CIKM-2016-LeekaBBA #framework #named #rdf
- Quark-X: An Efficient Top-K Processing Framework for RDF Quad Stores (JL, SB, DB, MA), pp. 831–840.
- CIKM-2016-LiCC0Y #query
- Efficient Processing of Location-Aware Group Preference Queries (ML, LC, GC, YG0, GY0), pp. 559–568.
- CIKM-2016-LiZZWZWXHWZLCR #analysis #delivery #framework #named #platform
- DI-DAP: An Efficient Disaster Information Delivery and Analysis Platform in Disaster Management (TL0, WZ, CZ, QW, QZ, DW0, JX0, YH, WW0, MZ, SL, SCC, NR), pp. 1593–1602.
- CIKM-2016-MaSCYKV #distributed #network #query
- Query Answering Efficiency in Expert Networks Under Decentralized Search (LM0, MS, DC, XY, SK, MV), pp. 2119–2124.
- CIKM-2016-MaxwellA #analysis #behaviour
- Agents, Simulated Users and Humans: An Analysis of Performance and Behaviour (DM, LA), pp. 731–740.
- CIKM-2016-PhamP #scalability
- Scalability and Total Recall with Fast CoveringLSH (NP, RP), pp. 1109–1118.
- CIKM-2016-RajasekaranS #algorithm #problem
- Efficient Algorithms for the Two Locus Problem in Genome-Wide Association Study: Algorithms for the Two Locus Problem (SR, SS), pp. 2305–2310.
- CIKM-2016-RenZRZYW #learning #optimisation
- User Response Learning for Directly Optimizing Campaign Performance in Display Advertising (KR, WZ0, YR, HZ, YY0, JW0), pp. 679–688.
- CIKM-2016-RongZYSL #approach #markov #optimisation #process
- The Rich and the Poor: A Markov Decision Process Approach to Optimizing Taxi Driver Revenue Efficiency (HR, XZ, CY, MZS, AXL), pp. 2329–2334.
- CIKM-2016-WangWZ #distributed #graph #partial evaluation #query #rdf #using
- Efficient Distributed Regular Path Queries on RDF Graphs Using Partial Evaluation (XW0, JW, XZ), pp. 1933–1936.
- CIKM-2016-XuK #clustering #effectiveness
- Effective and Efficient Spectral Clustering on Text and Link Data (ZX, YK), pp. 357–366.
- CIKM-2016-YangY #re-engineering
- Efficient Hidden Trajectory Reconstruction from Sparse Data (NY0, PSY), pp. 821–830.
- CIKM-2016-ZhangTSYS #matrix #orthogonal
- Efficient Orthogonal Non-negative Matrix Factorization over Stiefel Manifold (WEZ, MT, QZS, LY, QS), pp. 1743–1752.
- ECIR-2016-ArguelloAD #predict #query #using
- Using Query Performance Predictors to Improve Spoken Queries (JA, SA, FD0), pp. 309–321.
- ECIR-2016-JurgovskyGS #memory management #robust #word
- Evaluating Memory Efficiency and Robustness of Word Embeddings (JJ, MG, CS), pp. 200–211.
- ECIR-2016-ValcarcePB #collaboration #feedback #pseudo #recommendation
- Efficient Pseudo-Relevance Feedback Methods for Collaborative Filtering Recommendation (DV, JP, AB), pp. 602–613.
- ECIR-2016-Welleck #optimisation #ranking
- Efficient AUC Optimization for Information Ranking Applications (SJW), pp. 159–170.
- ICML-2016-AbernethyH #optimisation
- Faster Convex Optimization: Simulated Annealing with an Efficient Universal Barrier (JDA, EH), pp. 2520–2528.
- ICML-2016-AcharyaDLS #algorithm
- Fast Algorithms for Segmented Regression (JA, ID, JL0, LS), pp. 2878–2886.
- ICML-2016-BlondelIFU #algorithm #network #polynomial
- Polynomial Networks and Factorization Machines: New Insights and Efficient Training Algorithms (MB, MI, AF, NU), pp. 850–858.
- ICML-2016-DavidS #algorithm #bound #problem
- PAC Lower Bounds and Efficient Algorithms for The Max K-Armed Bandit Problem (YD, NS), pp. 878–887.
- ICML-2016-Fan #estimation #fault #robust
- Accurate Robust and Efficient Error Estimation for Decision Trees (LF), pp. 239–247.
- ICML-2016-GarberHJKMNS
- Faster Eigenvector Computation via Shift-and-Invert Preconditioning (DG, EH, CJ, SMK, CM, PN, AS), pp. 2626–2634.
- ICML-2016-GeJKNS #algorithm #analysis #canonical #correlation #scalability
- Efficient Algorithms for Large-scale Generalized Eigenvector Computation and Canonical Correlation Analysis (RG0, CJ, SMK, PN, AS), pp. 2741–2750.
- ICML-2016-GuanRW #learning #markov #multi #process #recognition #using
- Efficient Multi-Instance Learning for Activity Recognition from Time Series Data Using an Auto-Regressive Hidden Markov Model (XG, RR, WKW), pp. 2330–2339.
- ICML-2016-GuiHG #estimation #matrix #rank #towards
- Towards Faster Rates and Oracle Property for Low-Rank Matrix Estimation (HG, JH0, QG), pp. 2300–2309.
- ICML-2016-HardtRS #probability
- Train faster, generalize better: Stability of stochastic gradient descent (MH, BR, YS), pp. 1225–1234.
- ICML-2016-Kasiviswanathan #empirical #learning
- Efficient Private Empirical Risk Minimization for High-dimensional Learning (SPK, HJ), pp. 488–497.
- ICML-2016-KhetanO #data-driven #rank
- Data-driven Rank Breaking for Efficient Rank Aggregation (AK, SO), pp. 89–98.
- ICML-2016-KomiyamaHN #algorithm #bound #problem
- Copeland Dueling Bandit Problem: Regret Lower Bound, Optimal Algorithm, and Computationally Efficient Algorithm (JK, JH, HN), pp. 1235–1244.
- ICML-2016-LiJS #kernel
- Fast DPP Sampling for Nystrom with Application to Kernel Methods (CL, SJ, SS), pp. 2061–2070.
- ICML-2016-LiM #nearest neighbour
- Fast k-Nearest Neighbour Search via Dynamic Continuous Indexing (KL, JM), pp. 671–679.
- ICML-2016-LouizosW #learning #matrix
- Structured and Efficient Variational Deep Learning with Matrix Gaussian Posteriors (CL, MW), pp. 1708–1716.
- ICML-2016-MirzasoleimanBK #personalisation #summary
- Fast Constrained Submodular Maximization: Personalized Data Summarization (BM, AB, AK), pp. 1358–1367.
- ICML-2016-NewlingF #bound
- Fast k-means with accurate bounds (JN, FF), pp. 936–944.
- ICML-2016-NiuRFH #parametricity #using
- Fast Parameter Inference in Nonlinear Dynamical Systems using Iterative Gradient Matching (MN, SR, MF, DH), pp. 1699–1707.
- ICML-2016-QuXO #algorithm #analysis #optimisation #probability
- Fast Rate Analysis of Some Stochastic Optimization Algorithms (CQ, HX, CJO), pp. 662–670.
- ICML-2016-RahmaniA #approach #composition #learning #matrix
- A Subspace Learning Approach for High Dimensional Matrix Decomposition with Efficient Column/Row Sampling (MR, GKA), pp. 1206–1214.
- ICML-2016-RakhlinS #named
- BISTRO: An Efficient Relaxation-Based Method for Contextual Bandits (AR, KS), pp. 1977–1985.
- ICML-2016-SaeediHJA #infinity
- The Segmented iHMM: A Simple, Efficient Hierarchical Infinite HMM (AS, MDH, MJJ0, RPA), pp. 2682–2691.
- ICML-2016-Shamir #algorithm #convergence #probability
- Fast Stochastic Algorithms for SVD and PCA: Convergence Properties and Convexity (OS), pp. 248–256.
- ICML-2016-SiHD #approximate #using
- Computationally Efficient Nyström Approximation using Fast Transforms (SS, CJH, ISD), pp. 2655–2663.
- ICML-2016-SyrgkanisKS #algorithm #learning
- Efficient Algorithms for Adversarial Contextual Learning (VS, AK, RES), pp. 2159–2168.
- ICML-2016-UbaruS #matrix #rank #scalability
- Fast methods for estimating the Numerical rank of large matrices (SU, YS), pp. 468–477.
- ICML-2016-WangWK #programming
- Epigraph projections for fast general convex programming (PWW, MW, JZK), pp. 2868–2877.
- ICML-2016-YaoK #learning #product line
- Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity (QY, JTK), pp. 2645–2654.
- ICML-2016-YuL #learning #multi
- Learning from Multiway Data: Simple and Efficient Tensor Regression (RY, YL0), pp. 373–381.
- ICML-2016-ZhuH #optimisation #reduction
- Variance Reduction for Faster Non-Convex Optimization (ZAZ, EH), pp. 699–707.
- ICML-2016-ZhuQRY #coordination #using
- Even Faster Accelerated Coordinate Descent Using Non-Uniform Sampling (ZAZ, ZQ, PR, YY), pp. 1110–1119.
- ICPR-2016-Aldana-IuitMCM
- In the Saddle: Chasing fast and repeatable features (JAI, DM, OC, JM), pp. 675–680.
- ICPR-2016-BandyopadhyayM #axiom #clustering #incremental
- Axioms to characterize efficient incremental clustering (SB, MNM), pp. 450–455.
- ICPR-2016-Bodis-SzomoruRG #re-engineering
- Efficient volumetric fusion of airborne and street-side data for urban reconstruction (ABS, HR, LVG), pp. 3204–3209.
- ICPR-2016-BorghiVC #3d #gesture #multi #recognition
- Fast gesture recognition with Multiple Stream Discrete HMMs on 3D skeletons (GB, RV, RC), pp. 997–1002.
- ICPR-2016-Burlina #named
- MRCNN: A stateful Fast R-CNN (PB), pp. 3518–3523.
- ICPR-2016-CardosoMA #analysis #problem
- Plücker correction problem: Analysis and improvements in efficiency (JRC, PM, HA), pp. 2795–2800.
- ICPR-2016-ChowdhuryBMKS #image #network #retrieval #using
- An efficient radiographic Image Retrieval system using Convolutional Neural Network (MC, SRB, RM, MKK, ÖS), pp. 3134–3139.
- ICPR-2016-DaiMZ #evolution #image #segmentation #set
- A Bregman divergence based Level Set Evolution for efficient medical image segmentation (SD, HM, SZ), pp. 1113–1118.
- ICPR-2016-FerreiraG #3d #lens
- Accurate and fast micro lenses depth maps from a 3D point cloud in light field cameras (RF, NG), pp. 1893–1898.
- ICPR-2016-FleischmannK #interactive
- Fast projector-camera calibration for interactive projection mapping (OF, RK), pp. 3798–3803.
- ICPR-2016-GaldiD #mobile #recognition
- Fusing iris colour and texture information for fast iris recognition on mobile devices (CG, JLD), pp. 160–164.
- ICPR-2016-GhorbelBBSL #recognition
- A fast and accurate motion descriptor for human action recognition applications (EG, RB, JB, XS, SL), pp. 919–924.
- ICPR-2016-JohnKGNMI #learning #modelling #segmentation #using
- Fast road scene segmentation using deep learning and scene-based models (VJ, KK, CG, HTN, SM, KI), pp. 3763–3768.
- ICPR-2016-KabkabHC #network #on the
- On the size of Convolutional Neural Networks and generalization performance (MK, EMH, RC), pp. 3572–3577.
- ICPR-2016-KimuraKSK #classification #multi #random #scalability
- Fast random k-labELsets for large-scale multi-label classification (KK, MK, LS, SK), pp. 438–443.
- ICPR-2016-LeHWO #detection
- Temporally subsampled detection for accurate and efficient face tracking and diarization (NL, AH, DW0, JMO), pp. 1792–1797.
- ICPR-2016-LiangSWMWSG #image #learning #optimisation #precise #retrieval #similarity
- Optimizing top precision performance measure of content-based image retrieval by learning similarity function (RZL, LS, HW, JM, JJYW, QS, YG), pp. 2954–2958.
- ICPR-2016-LiH #approach #detection #image
- A fast approach for traffic panel detection from natural scene images (ZML, LLH), pp. 579–584.
- ICPR-2016-LiuHWLL #image #retrieval #segmentation #using
- Efficient segmentation for Region-based Image Retrieval using Edge Integrated Minimum Spanning Tree (YL0, LH0, SW, XL, BL), pp. 1929–1934.
- ICPR-2016-LiWS #towards
- Towards protecting biometric templates without sacrificing performance (JL0, YW, TS), pp. 1029–1034.
- ICPR-2016-Lourakis
- An efficient solution to absolute orientation (MIAL), pp. 3816–3819.
- ICPR-2016-MaoFWH #identification #kernel
- Fast kernel SVM training via support vector identification (XM, ZF, OW, WH), pp. 1554–1559.
- ICPR-2016-Martinez-DiazCH #encoding #recognition #using #video
- Efficient video face recognition by using Fisher Vector encoding of binary features (YMD, LC, NH, HMV, LES), pp. 1436–1441.
- ICPR-2016-McCaneS #network
- Deep networks are efficient for circular manifolds (BM, LS), pp. 3464–3469.
- ICPR-2016-OgawaMDCFH #adaptation #multi #predict
- A new efficient measure for accuracy prediction and its application to multistream-based unsupervised adaptation (TO, SHRM, ED, JC, NHF, HH), pp. 2222–2227.
- ICPR-2016-OsmanliogluOHS #analysis #approximate #problem
- Efficient approximation of labeling problems with applications to immune repertoire analysis (YO, SO, UH, AS), pp. 2410–2415.
- ICPR-2016-PeiM #3d #estimation #interactive #mobile
- Fast 3D hand estimation for mobile interactions (YP, GM), pp. 979–984.
- ICPR-2016-Pham0PV #network
- Faster training of very deep networks via p-norm gates (TP, TT0, DQP, SV), pp. 3542–3547.
- ICPR-2016-RampalSI #estimation
- Fast and accurate scale estimation method for object tracking (KR, KS, HI), pp. 2712–2715.
- ICPR-2016-Rowekamp #using
- Fast thresholding of high dimensional Euclidean distances using binary squaring (JHR), pp. 3103–3108.
- ICPR-2016-SharabatiX #approach #polynomial
- Fast local polynomial regression approach for speckle noise removal (WKS, BX), pp. 3198–3203.
- ICPR-2016-SorelB #multi
- Efficient JPEG decompression by the alternating direction method of multipliers (MS, MB), pp. 271–276.
- ICPR-2016-Teerapittayanon #named #network
- BranchyNet: Fast inference via early exiting from deep neural networks (ST, BM, HTK), pp. 2464–2469.
- ICPR-2016-ToyamaMS #clustering #using
- Fast template matching using Brick Partitioning and initial threshold (FT, HM, KS), pp. 687–691.
- ICPR-2016-WuARN #recognition
- Computationally efficient template-based face recognition (YW0, WAA, SR, PN), pp. 1424–1429.
- ICPR-2016-XiaoY
- Efficient tracking with distinctive target colors and silhouette (CX, AY), pp. 2728–2733.
- ICPR-2016-YangLWW #empirical
- An Empirical Study of Deformable Part Model with fast feature pyramid (JY, GL, WW, RW), pp. 567–572.
- ICPR-2016-YorukOA #estimation #multi #recognition
- An efficient Hough transform for multi-instance object recognition and pose estimation (EY, KTO, CBA), pp. 1352–1357.
- ICPR-2016-ZhangCUL #algorithm
- MLPF algorithm for tracking fast moving target against light interference (LZ, YC, ZU, TL), pp. 3939–3944.
- ICPR-2016-ZhaoMFQH #predict #using
- Fast motion deblurring using gyroscopes and strong edge prediction (JZ, JM, BF, SQ, FH), pp. 739–744.
- KDD-2016-BalcanLSW0 #analysis #communication #component #distributed #kernel
- Communication Efficient Distributed Kernel Principal Component Analysis (MFB, YL, LS, DPW, BX0), pp. 725–734.
- KDD-2016-ChenTXYH #dependence #multi #named #network
- FASCINATE: Fast Cross-Layer Dependency Inference on Multi-layered Networks (CC0, HT, LX, LY, QH), pp. 765–774.
- KDD-2016-CoskunGK #network #proximity #query
- Efficient Processing of Network Proximity Queries via Chebyshev Acceleration (MC, AG, MK), pp. 1515–1524.
- KDD-2016-GeyikFSOK #metric #multi #online #optimisation #video
- Joint Optimization of Multiple Performance Metrics in Online Video Advertising (SCG, SF, JS, SO, SK), pp. 471–480.
- KDD-2016-GhashamiLP #algorithm #matrix
- Efficient Frequent Directions Algorithm for Sparse Matrices (MG, EL, JMP), pp. 845–854.
- KDD-2016-HanZZ #component #estimation #scalability
- Fast Component Pursuit for Large-Scale Inverse Covariance Estimation (LH0, YZ0, TZ0), pp. 1585–1594.
- KDD-2016-HuangJA #composition #distributed #online
- Online Dual Decomposition for Performance and Delivery-Based Distributed Ad Allocation (JCH, RJ, CA), pp. 117–126.
- KDD-2016-HuVQ #detection
- Temporal Order-based First-Take-All Hashing for Fast Attention-Deficit-Hyperactive-Disorder Detection (HH, JVG, GJQ), pp. 905–914.
- KDD-2016-LiMLFDYLQ #big data #data analysis #learning #scalability #taxonomy
- Scalable Fast Rank-1 Dictionary Learning for fMRI Big Data Analysis (XL0, MM, BL, MSF, ID, JY, TL, SQ), pp. 511–519.
- KDD-2016-MaiAS #algorithm #clustering #dataset #named #scalability
- AnyDBC: An Efficient Anytime Density-based Clustering Algorithm for Very Large Complex Datasets (STM, IA, MS), pp. 1025–1034.
- KDD-2016-ManzoorMA #detection #graph #streaming
- Fast Memory-efficient Anomaly Detection in Streaming Heterogeneous Graphs (EAM, SMM, LA), pp. 1035–1044.
- KDD-2016-MueenK
- Extracting Optimal Performance from Dynamic Time Warping (AM, EJK), pp. 2129–2130.
- KDD-2016-NakagawaSKTT #approach #mining #predict
- Safe Pattern Pruning: An Efficient Approach for Predictive Pattern Mining (KN, SS, MK, KT, IT), pp. 1785–1794.
- KDD-2016-ReisFMB #detection #incremental #online #using
- Fast Unsupervised Online Drift Detection Using Incremental Kolmogorov-Smirnov Test (DMdR, PAF, SM, GEAPAB), pp. 1545–1554.
- KDD-2016-WuYCY #convergence #random
- Revisiting Random Binning Features: Fast Convergence and Strong Parallelizability (LW, IEHY, JC, RY), pp. 1265–1274.
- KDD-2016-ZhangBSS #named #optimisation #pipes and filters
- FLASH: Fast Bayesian Optimization for Data Analytic Pipelines (YZ, MTB, HS, JS), pp. 2065–2074.
- KDD-2016-ZhangT #named #network
- FINAL: Fast Attributed Network Alignment (SZ, HT), pp. 1345–1354.
- KDD-2016-ZhengYC #invariant #learning #taxonomy
- Efficient Shift-Invariant Dictionary Learning (GZ, YY, JGC), pp. 2095–2104.
SKY-2016-ExmanS #natural language #programming language #reliability- Fast and Reliable Software Translation of Programming Languages to Natural Language (IE, OS), pp. 57–64.
- MoDELS-2016-FalknerSC #modelling #predict
- Model-driven performance prediction of systems of systems (KEF, CS, VC), p. 44.
- MoDELS-2016-PrzigodaWD #ocl #smt
- Ground setting properties for an efficient translation of OCL in SMT-based model finding (NP, RW, RD), pp. 261–271.
- OOPSLA-2016-BhandariCB #memory management #named
- Makalu: fast recoverable allocation of non-volatile memory (KB, DRC, HJB), pp. 677–694.
- OOPSLA-2016-DalozeMBM #dynamic typing #thread
- Efficient and thread-safe objects for dynamically-typed languages (BD, SM, DB, HM), pp. 642–659.
LOPSTR-2016-Tarau #generative #normalisation #order #λ-calculus- A Hiking Trip Through the Orders of Magnitude: Deriving Efficient Generators for Closed Simply-Typed Lambda Terms and Normal Forms (PT), pp. 240–255.
PEPM-2016-SuzukiKK #query- Finally, safely-extensible and efficient language-integrated query (KS, OK, YK), pp. 37–48.
- PLDI-2016-0001HM #complexity #on the #parsing
- On the complexity and performance of parsing with derivatives (MDA0, CH, MM), pp. 224–236.
- PLDI-2016-JacekCMM #garbage collection
- Assessing the limits of program-specific garbage collection performance (NJ, MCC, BMM, EM), pp. 584–598.
- PLDI-2016-LoncaricTE #synthesis
- Fast synthesis of fast collections (CL, ET, MDE), pp. 355–368.
- PLDI-2016-TruongBTLMFS #compilation #named #network #runtime
- Latte: a language, compiler, and runtime for elegant and efficient deep neural networks (LT, RB, ET, HL, CM, AF, TS), pp. 209–223.
- POPL-2016-AndryscoJL #float
- Printing floating-point numbers: a faster, always correct method (MA, RJ, SL), pp. 555–567.
- POPL-2016-WuXCZZ #approach #named
- Casper: an efficient approach to call trace collection (RW, XX0, SCC, HZ0, CZ), pp. 678–690.
QAPL-2016-BergPH #energy #policy- Evaluating load balancing policies for performance and energy-efficiency (FvdB, BFP, BRH), pp. 98–117.
- SAS-2016-KojimaKS #invariant #synthesis
- Generalized Homogeneous Polynomials for Efficient Template-Based Nonlinear Invariant Synthesis (KK, MK, KS), pp. 278–299.
- ASE-2016-DemuthRE #consistency #detection #developer #multi #nondeterminism
- Efficient detection of inconsistencies in a multi-developer engineering environment (AD, MRE, AE), pp. 590–601.
- ASE-2016-Le #automation #effectiveness #program repair #towards
- Towards efficient and effective automatic program repair (XBDL), pp. 876–879.
- ASE-2016-Puschel #generative
- Program generation for performance (MP), p. 1.
- ASE-2016-RazaF #analysis #automation #development #named #recommendation
- ProcessPAIR: a tool for automated performance analysis and improvement recommendation in software development (MR, JPF), pp. 798–803.
FSE-2016-BagheriM #alloy #analysis #evolution #named #specification- Titanium: efficient analysis of evolving alloy specifications (HB, SM), pp. 27–38.
- FSE-2016-BergerVJDS #editing #empirical #projectional
- Efficiency of projectional editing: a controlled experiment (TB, MV, HPJ, TD, JS), pp. 763–774.
- FSE-2016-BruninkR #mining #specification
- Mining performance specifications (MB, DSR), pp. 39–49.
- FSE-2016-GhassabaniGW #generative #induction #safety
- Efficient generation of inductive validity cores for safety properties (EG, AG, MWW), pp. 314–325.
- FSE-2016-KangZXL #android #named
- DiagDroid: Android performance diagnosis via anatomizing asynchronous executions (YK, YZ, HX, MRL), pp. 410–421.
- FSE-2016-KimRLZX #monitoring #named
- PerfGuard: binary-centric application performance monitoring in production environments (CHK, JR, KHL, XZ0, DX), pp. 595–606.
- FSE-2016-Luo #testing
- Input-sensitive performance testing (QL), pp. 1085–1087.
- FSE-2016-Luo16a #automation #profiling #testing #using
- Automatic performance testing using input-sensitive profiling (QL), pp. 1139–1141.
- ICSE-2016-BersaniBGKP #pipes and filters #scalability #using
- Efficient large-scale trace checking using mapreduce (MMB, DB, CG, SK, PSP), pp. 888–898.
- ICSE-2016-ChenLL #execution #generative #probability #symbolic computation
- Generating performance distributions via probabilistic symbolic execution (BC0, YL0, WL), pp. 49–60.
- ICSE-2016-LiuCB #detection #dynamic analysis #fault #named #precise
- DoubleTake: fast and precise error detection via evidence-based dynamic analysis (TL, CC, EDB), pp. 911–922.
- ICSE-2016-PanichellaPBZG #debugging #empirical #summary #testing
- The impact of test case summaries on bug fixing performance: an empirical investigation (SP, AP, MB, AZ, HCG), pp. 547–558.
- ICSE-2016-RubinR #case study #challenge
- The challenges of staying together while moving fast: an exploratory study (JR, MR), pp. 982–993.
- ICSE-2016-SelakovicP #empirical #javascript #optimisation
- Performance issues and optimizations in JavaScript: an empirical study (MS, MP), pp. 61–72.
- GPCE-2016-Al-HajjajiKTLS #incremental #named #product line #testing #using
- IncLing: efficient product-line testing using incremental pairwise sampling (MAH, SK, TT, ML, GS), pp. 144–155.
- SLE-2016-BenelallamTCLC #clustering #distributed #model transformation
- Efficient model partitioning for distributed model transformations (AB, MT, JSC, JdL, JC), pp. 226–238.
- SLE-2016-VoelterSLKEB #consistency #development #editing #projectional #using
- Efficient development of consistent projectional editors using grammar cells (MV, TS, SL, BK, SE, TB), pp. 28–40.
- ASPLOS-2016-AbadalCAT #architecture #communication #named
- WiSync: An Architecture for Fast Synchronization through On-Chip Wireless Communication (SA, ACA, EA, JT), pp. 3–17.
- ASPLOS-2016-DidonaDKGNR #abstraction #memory management #named #transaction
- ProteusTM: Abstraction Meets Performance in Transactional Memory (DD, ND, AMK, RG, RN, PR0), pp. 757–771.
- ASPLOS-2016-KaufmannPSAK
- High Performance Packet Processing with FlexNIC (AK, SP, NKS, TEA, AK), pp. 67–81.
- ASPLOS-2016-LiaqatJLGTLGS #architecture #developer #energy #mobile #named
- Sidewinder: An Energy Efficient and Developer Friendly Heterogeneous Architecture for Continuous Mobile Sensing (DL, SJ, EdL, AG, WT, KL, IDMG, MS), pp. 205–215.
- ASPLOS-2016-MarkuzeMT
- True IOMMU Protection from DMA Attacks: When Copy is Faster than Zero Copy (AM, AM0, DT), pp. 249–262.
- ASPLOS-2016-WangM #manycore #named #resource management #runtime
- ReBudget: Trading Off Efficiency vs. Fairness in Market-Based Multicore Resource Allocation via Runtime Budget Reassignment (XW, JFM), pp. 19–32.
- ASPLOS-2016-ZhangH #comparison #hardware #hybrid
- Maximizing Performance Under a Power Cap: A Comparison of Hardware, Software, and Hybrid Techniques (HZ, HH), pp. 545–559.
- ASPLOS-2016-ZhangLJ #concurrent #detection #hardware #memory management #named #transaction #using
- TxRace: Efficient Data Race Detection Using Commodity Hardware Transactional Memory (TZ, DL, CJ), pp. 159–173.
- CASE-2016-AntunesCB #analysis #petri net #probability
- A stochastic Petri net model for simulation-based performance analysis of public bicycle sharing systems (IA, LKC, JCB), pp. 433–439.
- CASE-2016-JanSFF #automation #scalability
- Fast automatic seat assignment for large-scale passengers reservation systems (GEJ, CCS, CTFT, KF), pp. 239–244.
- CASE-2016-JiaZCAX #evaluation #finite #geometry
- Performance evaluation in finite production run-based serial lines with geometric machines (ZJ, LZ, GC, JA, GX), pp. 450–455.
- CASE-2016-KaipaKKSTMG
- Enhancing robotic unstructured bin-picking performance by enabling remote human interventions in challenging perception scenarios (KNK, ASKN, NBK, SS, SSTK, JAM, SKG), pp. 639–645.
- CASE-2016-LiLTYZ #energy
- Operational strategies for energy efficiency improvement of CNC machining (CL, LL, YT, QY, YZ), pp. 1270–1275.
- CASE-2016-OltjenBKO #difference #parallel
- Efficient computation of system-specific motion commands for serial and parallel robots based on differential flatness (JÖ, DB, JK, TO), pp. 328–334.
- CASE-2016-PizziBPF #delivery #online
- Performance improvement for online schedulers for packaging systems (EP, AB, AP, LF), pp. 1243–1248.
- CASE-2016-SussD #behaviour #classification #component #simulation
- Classification of mechatronic components for efficient plant behaviour simulation (SS, CD), pp. 1146–1151.
- CC-2016-MurphyJMC #automation #data flow #dependence
- Performance implications of transient loop-carried data dependences in automatically parallelized loops (NM, TMJ0, RDM, SC), pp. 23–33.
- CC-2016-ScholzJSW #datalog #on the #program analysis #scalability
- On fast large-scale program analysis in Datalog (BS, HJ, PS, TW), pp. 196–206.
- CGO-2016-BrownLRSSAO #abstraction #parallel
- Have abstraction and eat performance, too: optimized heterogeneous computing with parallel patterns (KJB, HL, TR, AKS, CDS, CRA, KO), pp. 194–205.
- CGO-2016-JibajaCBM #manycore #symmetry
- Portable performance on asymmetric multicore processors (IJ, TC, SMB, KSM), pp. 24–35.
- ESOP-2016-MalechaB #automation
- Extensible and Efficient Automation Through Reflective Tactics (GM, JB), pp. 532–559.
- CAV-2016-KlenzeBH #flexibility #smt #synthesis
- Fast, Flexible, and Minimal CTL Synthesis via SMT (TK, SB, AJH), pp. 136–156.
- CAV-2016-FuS #float #named #satisfiability
- XSat: A Fast Floating-Point Satisfiability Solver (ZF, ZS), pp. 187–209.
- CAV-2016-HerdtLGD #named #simulation
- ParCoSS: Efficient Parallelized Compiled Symbolic Simulation (VH, HML0, DG, RD), pp. 177–183.
- ICST-2016-BernardinoZR #domain-specific language #modelling #named #testing
- Canopus: A Domain-Specific Language for Modeling Performance Testing (MB, AFZ, EdMR), pp. 157–167.
- IJCAR-2016-BrombergerW #constraints #testing #theorem proving
- Fast Cube Tests for LIA Constraint Solving (MB, CW), pp. 116–132.
- IJCAR-2016-SchulzM #heuristic #proving #theorem proving
- Performance of Clause Selection Heuristics for Saturation-Based Theorem Proving (SS0, MM), pp. 330–345.
- ECSA-2015-StierKGR #analysis #architecture #energy #modelling
- Model-Based Energy Efficiency Analysis of Software Architectures (CS, AK, HG, RHR), pp. 221–238.
- ECSA-2015-TrubianiGE #analysis #architecture #modelling #nondeterminism #traceability
- Exploiting Traceability Uncertainty Between Software Architectural Models and Performance Analysis Results (CT, AG, AE), pp. 305–321.
- ECSA-2015-WangC #architecture #network #social
- A Specialised Social Network Software Architecture for Efficient Household Water Use Management (ZW, AC), pp. 146–153.
- QoSA-2015-LehrigEB #in the cloud #metric #overview #scalability
- Scalability, Elasticity, and Efficiency in Cloud Computing: a Systematic Literature Review of Definitions and Metrics (SL, HE, SB), pp. 83–92.
- QoSA-2015-WuLG #architecture #modelling
- Exploring Performance Models of Hadoop Applications on Cloud Architecture (XW, YL, IG), pp. 93–101.
DocEng-2015-MeiKYRIMM #word- Efficient Computation of Co-occurrence Based Word Relatedness (JM, XK, ZY, ARC, AI, AM, EEM), pp. 43–46.
DRR-2015-Fan0N #documentation #image- Separation of text and background regions for high performance document image compression (WF, JS, SN).
- JCDL-2015-CuongCKL #documentation #higher-order #information management #using
- Scholarly Document Information Extraction using Extensible Features for Efficient Higher Order Semi-CRFs (NVC, MKC, MYK, WSL), pp. 61–64.
PODS-2015-AcharyaDHLS #algorithm #approximate- Fast and Near-Optimal Algorithms for Approximating Distributions by Histograms (JA, ID, CH, JZL, LS), pp. 249–263.
- PODS-2015-BarceloPS #approximate #evaluation
- Efficient Evaluation and Approximation of Well-designed Pattern Trees (PB, RP, SS), pp. 131–144.
SIGMOD-2015-0001MK #concurrent #database #in memory #multi- Fast Serializable Multi-Version Concurrency Control for Main-Memory Database Systems (TN, TM, AK), pp. 677–689.
- SIGMOD-2015-Anagnostopoulos #crowdsourcing
- The Importance of Being Expert: Efficient Max-Finding in Crowdsourcing (AA, LB, AF, IM, MR), pp. 983–998.
- SIGMOD-2015-BerlowitzCK
- Efficient Enumeration of Maximal k-Plexes (DB, SC, BK), pp. 431–444.
- SIGMOD-2015-BraunEGKKWAILL #database #realtime
- Analytics in Motion: High Performance Event-Processing AND Real-Time Analytics in the Same Database (LB, TE, GG, MK, DK, DW, AA, AI, EL, NL), pp. 251–264.
- SIGMOD-2015-ChevalierSGL #incremental #named
- Slider: An Efficient Incremental Reasoner (JC, JS, CG, FL), pp. 1081–1086.
- SIGMOD-2015-ChuBS #database #evaluation #parallel #query #theory and practice
- From Theory to Practice: Efficient Join Query Evaluation in a Parallel Database System (SC, MB, DS), pp. 63–78.
- SIGMOD-2015-ColgroveDHMSSTV #component #enterprise #named
- Purity: Building Fast, Highly-Available Enterprise Flash Storage from Commodity Components (JC, JDD, JH, ELM, CS, RS, AT, NV, FW), pp. 1683–1694.
- SIGMOD-2015-GuoCC #algorithm #keyword #query
- Efficient Algorithms for Answering the m-Closest Keywords Query (TG, XC, GC), pp. 405–418.
- SIGMOD-2015-LiHDL #multi #similarity
- Efficient Similarity Join and Search on Multi-Attribute Data (GL, JH, DD, JL), pp. 1137–1151.
- SIGMOD-2015-OktayMKK #hybrid #named #pipes and filters
- SEMROD: Secure and Efficient MapReduce Over HybriD Clouds (KYO, SM, VK, MK), pp. 153–166.
- SIGMOD-2015-PaparrizosG #clustering #named
- k-Shape: Efficient and Accurate Clustering of Time Series (JP, LG), pp. 1855–1870.
- SIGMOD-2015-PrasadFGMLXHR #data transfer #distributed #predict #scalability
- Large-scale Predictive Analytics in Vertica: Fast Data Transfer, Distributed Model Creation, and In-database Prediction (SP, AF, VG, JM, JL, VX, MH, IR), pp. 1657–1668.
- SIGMOD-2015-SunFSKHX #graph #named
- SQLGraph: An Efficient Relational-Based Property Graph Store (WS, AF, KS, AK, GH, GTX), pp. 1887–1901.
- SIGMOD-2015-TeflioudiGM #matrix #named #retrieval #scalability
- LEMP: Fast Retrieval of Large Entries in a Matrix Product (CT, RG, OM), pp. 107–122.
- SIGMOD-2015-WangLYXZ #approach #network
- Efficient Route Planning on Public Transportation Networks: A Labelling Approach (SW, WL, YY, XX, SZ), pp. 967–982.
- SIGMOD-2015-YangWWW #approximate #query #string
- Local Filtering: Improving the Performance of Approximate Queries on String Collections (XY, YW, BW, WW), pp. 377–392.
- SIGMOD-2015-YuSC #dependence #distributed #matrix
- Exploiting Matrix Dependency for Efficient Distributed Matrix Computation (LY, YS, BC), pp. 93–105.
- SIGMOD-2015-ZhangYQS
- Divide & Conquer: I/O Efficient Depth-First Search (ZZ, JXY, LQ, ZS), pp. 445–458.
VLDB-2015-ArmbrustDDGORSW #scalability #usability- Scaling Spark in the Real World: Performance and Usability (MA, TD, AD, AG, AO, JR, IS, PW, RX, MZ), pp. 1840–1851.
- VLDB-2015-BursztynGM #query #rdf
- Reformulation-based query answering in RDF: alternatives and performance (DB, FG, IM), pp. 1888–1899.
- VLDB-2015-ChangLZYZQ
- Optimal Enumeration: Efficient Top-k Tree Matching (LC, XL, WZ, JXY, YZ, LQ), pp. 533–544.
- VLDB-2015-ChoBBFKP #algorithm #named #parallel
- PARADIS: An Efficient Parallel Algorithm for In-place Radix Sort (MC, DB, RB, UF, VK, RP), pp. 1518–1529.
- VLDB-2015-DingWDFZZ #clustering #named #scalability
- YADING: Fast Clustering of Large-Scale Time Series Data (RD, QW, YD, QF, HZ, DZ), pp. 473–484.
- VLDB-2015-KatsarouNT #query #scalability
- Performance and Scalability of Indexed Subgraph Query Processing Methods (FK, NN, PT), pp. 1566–1577.
- VLDB-2015-KhayyatLSOPQ0K #difference
- Lightning Fast and Space Efficient Inequality Joins (ZK, WL, MS, MO, PP, JAQR, NT, PK), pp. 2074–2085.
- VLDB-2015-LeisKK0 #query #sql
- Efficient Processing of Window Functions in Analytical SQL Queries (VL, KK, AK, TN), pp. 1058–1069.
- VLDB-2015-Liroz-GistauAV #execution #named #parallel
- FP-Hadoop: Efficient Execution of Parallel Jobs Over Skewed Data (MLG, RA, PV), pp. 1856–1867.
- VLDB-2015-LoghinTZOT #big data
- A Performance Study of Big Data on Small Nodes (DL, BMT, HZ, BCO, YMT), pp. 762–773.
- VLDB-2015-MitliagkasBDC #approximate #exclamation #graph #rank
- FrogWild! — Fast PageRank Approximations on Graph Engines (IM, MB, AGD, CC), pp. 874–885.
- VLDB-2015-NaidanBN #permutation
- Permutation Search Methods are Efficient, Yet Faster Search is Possible (BN, LB, EN), pp. 1618–1629.
- VLDB-2015-NaziZT0D #network #online #social
- Walk, Not Wait: Faster Sampling Over Online Social Networks (AN, ZZ, ST, NZ, GD), pp. 678–689.
- VLDB-2015-PelkonenFCHMTV #database #in memory #named #scalability
- Gorilla: A Fast, Scalable, In-Memory Time Series Database (TP, SF, PC, QH, JM, JT, KV), pp. 1816–1827.
- VLDB-2015-ShaoC0LX #framework #graph #scalability #similarity
- An Efficient Similarity Search Framework for SimRank over Large Dynamic Graphs (YS, BC, LC, ML, XX), pp. 838–849.
- VLDB-2015-ShiokawaFO #algorithm #clustering #graph #scalability
- SCAN++: Efficient Algorithm for Finding Clusters, Hubs and Outliers on Large-scale Graphs (HS, YF, MO), pp. 1178–1189.
- VLDB-2015-SundaramSPDAV0D #effectiveness #graph #named
- GraphMat: High performance graph analytics made productive (NS, NS, MMAP, SD, MJA, SGV, DD, PD), pp. 1214–1225.
- VLDB-2015-VartakRMPP #data-driven #named #recommendation #visual notation #visualisation
- SEEDB: Efficient Data-Driven Visualization Recommendations to Support Visual Analytics (MV, SR, SM, AGP, NP), pp. 2182–2193.
- VLDB-2015-WuHYY #evaluation #query #visualisation
- Efficient Evaluation of Object-Centric Exploration Queries for Visualization (YW, BH, JY, CY), pp. 1752–1763.
- VLDB-2015-YuM #network #scalability
- Efficient Partial-Pairs SimRank Search for Large Networks (WY, JAM), pp. 569–580.
- VLDB-2015-Zhou0D #network #online #social
- Leveraging History for Faster Sampling of Online Social Networks (ZZ, NZ, GD), pp. 1034–1045.
- VLDB-2015-ZhouLLZ #graph #named #optimisation
- GraphTwist: Fast Iterative Graph Computation with Two-tier Optimizations (YZ, LL, KL, QZ), pp. 1262–1273.
- EDM-2015-BotelhoAWH #predict #student #using
- Predicting Student Aptitude Using Performance History (AFB, SAA, HW, NTH), pp. 622–623.
- EDM-2015-BrownLEABBBM #community #question
- Good Communities and Bad Communities: Does Membership Affect Performance? (RB, CL, ME, JA, TB, RSB, YB, DSM), pp. 612–613.
- EDM-2015-Bydzovska #predict #towards
- Towards Freshmen Performance Prediction (HB), pp. 602–603.
- EDM-2015-DowellSJGDGVHK #modelling #social
- Modeling Learners' Social Centrality and Performance through Language and Discourse (ND, OS, SJ, ACG, SD, DG, PdV, TH, VK), pp. 250–257.
- EDM-2015-Feild #student #using
- Improving Student Performance Using Nudge Analytics (JLF), pp. 464–467.
- EDM-2015-Garcia-SaizZ #consistency #detection
- Detection of Learners with a Performance Inconsistent with Their Effort (DGS, MEZ), pp. 606–607.
- EDM-2015-JiangPBC #student
- Comparing Novice and Experienced Students in Virtual Performance Assessments (YJ, LP, RSB, JCM), pp. 136–143.
- EDM-2015-KlinglerKSG #modelling #on the
- On the Performance Characteristics of Latent-Factor and Knowledge Tracing Models (SK, TK, BS, MHG), pp. 37–44.
- EDM-2015-LuoK0 #classification #predict #student
- Discrimination-Aware Classifiers for Student Performance Prediction (LL, IK, WL0), pp. 384–387.
- EDM-2015-OlsenAR #collaboration #learning #predict #student
- Predicting Student Performance In a Collaborative Learning Environment (JKO, VA, NR), pp. 211–217.
- EDM-2015-OstrowDH #algorithm #optimisation #predict #student
- Optimizing Partial Credit Algorithms to Predict Student Performance (KO, CD, NTH), pp. 404–407.
- EDM-2015-StrechtCSMA #algorithm #case study #classification #comparative #modelling #student
- A Comparative Study of Regression and Classification Algorithms for Modelling Students' Academic Performance (PS, LC0, CS, JMM, RA), pp. 392–395.
- EDM-2015-ViePGBB #adaptation #modelling #predict #scalability #testing
- Predicting Performance on Dichotomous Questions: Comparing Models for Large-Scale Adaptive Testing (JJV, FP, JBG, EB, YB), pp. 618–619.
- EDM-2015-WanB
- Considering the Influence of Prerequisite Performance on Wheel Spinning (HW, JB), pp. 129–135.
- EDM-2015-ZhengVP #composition #learning
- The Impact of Small Learning Group Composition on Drop-Out Rate and Learning Performance in a MOOC (ZZ, TV, NP), pp. 500–503.
ITiCSE-2015-BellettiniLMMMT #analysis #how #student- How Challenging are Bebras Tasks?: An IRT Analysis Based on the Performance of Italian Students (CB, VL, DM, MM, AM, MT), pp. 27–32.
- ITiCSE-2015-CaetanoO
- Computational Thinking and Child Performance in a Preschool (GC, OO), pp. 57–62.
- ITiCSE-2015-ClearCKLSC #education #quality
- Global Perspectives on Assessing Educational Performance and Quality (AC, JC, AK, CL, S, ECV), pp. 326–327.
SIGITE-2015-StrongGS #network- Work in Progress: Improving the Performance of the Radial Basis Function Network (AS, TG, LS), p. 103.
- ICSME-2015-EkelundE #evaluation #industrial #testing
- Efficient regression testing based on test history: An industrial evaluation (EDE, EE), pp. 449–457.
- ICSME-2015-VasquezVLP #android #detection #developer #how
- How developers detect and fix performance bottlenecks in Android apps (MLV, CV, QL, DP), pp. 352–361.
- MSR-2015-HashimotoTMM #effectiveness #fact extraction #optimisation #predict
- Extracting Facts from Performance Tuning History of Scientific Applications for Predicting Effective Optimization Patterns (MH, MT, TM, KM), pp. 13–23.
- SANER-2015-AlawnehHH #analysis #metamodelling #towards
- Towards a common metamodel for traces of high performance computing systems to enable software analysis tasks (LA, AHL, JH), pp. 111–120.
- SANER-2015-BezemerPG #comprehension #difference #graph #using
- Understanding software performance regressions using differential flame graphs (CPB, JP, BG), pp. 535–539.
- SCAM-2015-PintoKT #analysis #automation #multi
- Automating the performance deviation analysis for multiple system releases: An evolutionary study (FP, UK, CT), pp. 201–210.
ICALP-v1-2015-GaspersS #algorithm #set- Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets (SG, GBS), pp. 567–579.
- ICALP-v1-2015-GrosseGKSS #algorithm
- Fast Algorithms for Diameter-Optimally Augmenting Paths (UG, JG, CK, MHMS, FS), pp. 678–688.
LATA-2015-BjorklundDZ #algorithm #automaton- An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring (JB, FD, NZ), pp. 97–108.
RTA-2015-LepperW #towards- A Simple and Efficient Step Towards Type-Correct XSLT Transformations (ML, BTyW), pp. 350–364.
- SEFM-2015-HusterBELRKR #testing
- Efficient Testing of Different Loop Paths (SH, SB, HE, JL, JR, TK, WR), pp. 117–131.
ICFP-2015-SmolkaEFG #compilation- A fast compiler for NetKAT (SS, SAE, NF, AG), pp. 328–341.
- ICFP-2015-SteuwerFLD #functional #generative #using
- Generating performance portable code using rewrite rules: from high-level functional expressions to high-performance OpenCL code (MS, CF, SL, CD), pp. 205–217.
- ICFP-2015-YangCAEKN #communication #normalisation
- Efficient communication and collection with compact normal forms (EZY, GC, ÖSA, AEH, AK, RRN), pp. 362–374.
- CHI-PLAY-2015-DenisovaC15a #adaptation #challenge #experience #game studies
- Adaptation in Digital Games: The Effect of Challenge Adjustment on Player Performance and Experience (AD, PAC), pp. 97–101.
- CIG-2015-AsayamaMFN #game studies #predict #realtime #video
- Prediction as faster perception in a real-time fighting video game (KA, KM, KiF, MN), pp. 517–522.
- CIG-2015-KaoH #education #game studies #modelling #towards
- Toward avatar models to enhance performance and engagement in educational games (DK, DFH), pp. 246–253.
- CIG-2015-OliveiraM #game studies #realtime #using
- Creating efficient walls using potential fields in real-time strategy games (CFdO, CAGM), pp. 138–145.
- VS-Games-2015-WangC #approach #gamification
- A Social-Centred Gamification Approach to Improve Household Water Use Efficiency (ZW, AC), pp. 1–4.
CHI-2015-AmershiCDLSS #analysis #machine learning #named #tool support- ModelTracker: Redesigning Performance Analysis Tools for Machine Learning (SA, MC, SMD, BL, PYS, JS), pp. 337–346.
- CHI-2015-Avrahami
- The Effect of Edge Targets on Touch Performance (DA), pp. 1837–1846.
- CHI-2015-BachynskyiPOSW #case study #comparative #simulation #using
- Performance and Ergonomics of Touch Surfaces: A Comparative Study using Biomechanical Simulation (MB, GP, AO, JS, TW), pp. 1817–1826.
- CHI-2015-DeberJFW #how #latency
- How Much Faster is Fast Enough?: User Perception of Latency & Latency Improvements in Direct and Indirect Touch (JD, RJ, CF, DW), pp. 1827–1836.
- CHI-2015-FowlerPCBOZ #modelling #personalisation #type system
- Effects of Language Modeling and its Personalization on Touchscreen Typing Performance (AF, KP, CC, XB, TO, SZ), pp. 649–658.
- CHI-2015-GunaratneN #behaviour #user interface #using
- Informing and Improving Retirement Saving Performance using Behavioral Economics Theory-driven User Interfaces (JG, ON), pp. 917–920.
- CHI-2015-HarozKF #memory management #visualisation
- ISOTYPE Visualization: Working Memory, Performance, and Engagement with Pictographs (SH, RK, SLF), pp. 1191–1200.
- CHI-2015-HarteveldS #education #game studies
- The Goal of Scoring: Exploring the Role of Game Performance in Educational Games (CH, SCS), pp. 2235–2244.
- CHI-2015-LeeHL
- Investigating the Information Transfer Efficiency of a 3x3 Watch-back Tactile Display (JL, JH, GL), pp. 1229–1232.
- CHI-2015-LuL #gesture #mobile
- Gesture On: Enabling Always-On Touch Gestures for Fast Mobile Access from the Device Standby Mode (HL, YL), pp. 3355–3364.
- CHI-2015-OppermannPBLP #smarttech
- The Smartphone Project: An Augmented Dance Performance (LO, CP, CB, OL, FP), pp. 2569–2572.
- CHI-2015-PritchardBVO #how #mobile
- How to Drive a London Bus: Measuring Performance in a Mobile and Remote Workplace (GWP, PB, JV, PO), pp. 1885–1894.
- CHI-2015-ReyalZK #experience #gesture #user interface
- Performance and User Experience of Touchscreen and Gesture Keyboards in a Lab Setting and in the Wild (SR, SZ, POK), pp. 679–688.
- CHI-2015-RobertR
- Crowd Size, Diversity and Performance (LR, DMR), pp. 1379–1382.
- CHI-2015-Ruiz0 #bias #constraints #elicitation #gesture #legacy
- Soft-Constraints to Reduce Legacy and Performance Bias to Elicit Whole-body Gestures with Low Arm Fatigue (JR, DV), pp. 3347–3350.
- CHI-2015-TholanderN #experience #using
- Snot, Sweat, Pain, Mud, and Snow: Performance and Experience in the Use of Sports Watches (JT, SN), pp. 2913–2922.
- CHI-2015-VertanenMERK #mobile #named #using
- VelociTap: Investigating Fast Mobile Text Entry using Sentence-Based Decoding of Touchscreen Keyboard Input (KV, HM, JE, SR, POK), pp. 659–668.
- CHI-2015-ZezschwitzLBH #named #smarttech
- SwiPIN: Fast and Secure PIN-Entry on Smartphones (EvZ, ADL, BB, HH), pp. 1403–1406.
CSCW-2015-PinelleG - The Effects of View Portals on Performance and Awareness in Co-Located Tabletop Groupware (DP, CG), pp. 195–206.
DHM-EH-2015-BoZDYWF #hybrid #kernel #recognition #using- Hybrid BFO-PSO and Kernel FCM for the Recognition of Pilot Performance Influenced by Simulator Movement Using Diffusion Maps (JB, YBZ, LD, BTY, QW, SF), pp. 239–247.
- DHM-HM-2015-BoringJM #analysis #modelling #reliability
- Human Performance Modeling for Dynamic Human Reliability Analysis (RLB, JCJ, DM), pp. 223–234.
- DHM-HM-2015-KanazawaOWTTGH #experience #research
- Research on the Performance of Three Tea Whisks of “The Way of Tea” with Different Experience (SK, TO, ZW, AT, YT, AG, HH), pp. 95–103.
- HCI-IT-2015-DibitontoM #automation
- Improving User Performance in a Smart Surveillance Scenario through Different Levels of Automation (MD, CMM), pp. 706–716.
- HCI-IT-2015-MurataMF #modelling
- Effects of Target Shape and Display Location on Pointing Performance by Eye-Gaze Input System — Modeling of Pointing Time by Extended Fitts’ Law (AM, MM, DF), pp. 94–106.
- HCI-IT-2015-WalkerSJ #interactive
- Interactive Sonification Markup Language (ISML) for Efficient Motion-Sound Mappings (JWW, MTS, MJ), pp. 385–394.
- HCI-UC-2015-JeongJ #on the #personalisation
- On Time: Efficient and Personalized Hospital Service (SYJ, DYJ), pp. 190–197.
- LCT-2015-DalipiYK #analysis #semantics #using
- Enhancing the Learner’s Performance Analysis Using SMEUS Semantic E-learning System and Business Intelligence Technologies (FD, SYY, ZK), pp. 208–217.
- LCT-2015-FatahiMZ
- A Computational Model to Determine Desirability of Events Based on Personality for Performance Motivational Orientation Learners (SF, HM, ANZ), pp. 227–237.
- LCT-2015-KimOP #education #game studies #gesture
- Developing an Educational Game for Art Education — Gesture Recognition-Based Performance Guidance for Mozart’s Opera Magic Flute (HSK, SHO, YHP), pp. 573–582.
- SCSM-2015-HallC #collaboration #information management #process #social
- Analysing Yammer Usage Pattern in the Context of Social Collaborative Activity Performance by Knowledge Workers (JH, BBC), pp. 127–137.
CAiSE-2015-WeilerGS #detection #runtime #twitter- Run-Time and Task-Based Performance of Event Detection Techniques for Twitter (AW, MG, MHS), pp. 35–49.
ICEIS-v1-2015-AbakumovK - Approaches to Enhancing Efficiency of Production Management on Shop Floor Level (EMA, SBK), pp. 559–564.
- ICEIS-v1-2015-BedoBOCCRTT #detection #effectiveness #image #social #social media
- Techniques for Effective and Efficient Fire Detection from Social Media Images (MVNB, GB, WDO, MTC, AFC, JFRJ, AJMT, CTJ), pp. 34–45.
- ICEIS-v1-2015-GruppiMAFL #heuristic
- An Efficient and Topologically Correct Map Generalization Heuristic (MGG, SVGM, MVAA, WRF, WL), pp. 516–525.
- ICEIS-v1-2015-SirohiS #multitenancy #optimisation #query #sql
- Context-sensitive Indexes in RDBMS for Performance Optimization of SQL Queries in Multi-tenant/Multi-application Environments (AKS, VS), pp. 259–270.
- ICEIS-v2-2015-DutraPC #development #question #what
- What Are the Main Characteristics of High Performance Teams for Software Development? (ACSD, RP, TC), pp. 145–152.
- ICEIS-v2-2015-KamalKVB #delivery #using
- Efficient Use of Voice as a Channel for Delivering Public Services (KKK, MK, BV, KB), pp. 626–631.
- ICEIS-v2-2015-Martin-Fernandez #alias #encryption #using
- Efficient Management of Revoked Pseudonyms in VANETs using ID-Based Cryptography (FMF, PCG, CCG), pp. 701–708.
- ICEIS-v2-2015-MazurKW #data access #modelling #on the #security
- On the Modelling of the Influence of Access Control Management to the System Security and Performance (KM, BK, AW), pp. 346–354.
- ICEIS-v3-2015-GhezziCRB #agile #approach #case study #comparative #design #mobile
- A Comparative Study on the Impact of Business Model Design & Lean Startup Approach versus Traditional Business Plan on Mobile Startups Performance (AG, AC, AR, RB), pp. 196–203.
- CIKM-2015-AnastasiuK #graph #named #nearest neighbour
- L2Knng: Fast Exact K-Nearest Neighbor Graph Construction with L2-Norm Pruning (DCA, GK), pp. 791–800.
- CIKM-2015-BeecksUH0 #database #multi #scalability #similarity
- Gradient-based Signatures for Efficient Similarity Search in Large-scale Multimedia Databases (CB, MSU, JH, TS0), pp. 1241–1250.
- CIKM-2015-BidoitHT #polynomial
- Efficient Computation of Polynomial Explanations of Why-Not Questions (NB, MH, AT), pp. 713–722.
- CIKM-2015-BjorklundMT #evaluation #incremental #regular expression
- Efficient Incremental Evaluation of Succinct Regular Expressions (HB, WM, TT), pp. 1541–1550.
- CIKM-2015-DavtyanEH #crowdsourcing #documentation
- Exploiting Document Content for Efficient Aggregation of Crowdsourcing Votes (MD, CE, TH), pp. 783–790.
- CIKM-2015-GuoSA #correlation #distributed #streaming
- Fast Distributed Correlation Discovery Over Streaming Time-Series Data (TG0, SS, KA), pp. 1161–1170.
- CIKM-2015-HashemBAKT #product line
- Efficient Computation of Trips with Friends and Families (TH, SB, MEA, LK, ET), pp. 931–940.
- CIKM-2015-HuangLY #approach #clustering #data type #parallel
- A Parallel GPU-Based Approach to Clustering Very Fast Data Streams (PH, XL, BY0), pp. 23–32.
- CIKM-2015-JoKB #analysis #gpu #matrix #multi #network #scalability #social
- Efficient Sparse Matrix Multiplication on GPU for Large Social Network Analysis (YYJ, SWK, DHB), pp. 1261–1270.
- CIKM-2015-ParkHL #nearest neighbour #using
- A Fast k-Nearest Neighbor Search Using Query-Specific Signature Selection (YP, HH, SgL), pp. 1883–1886.
- CIKM-2015-ViegasGMR #classification #documentation #effectiveness #lazy evaluation #naive bayes #parallel
- Parallel Lazy Semi-Naive Bayes Strategies for Effective and Efficient Document Classification (FV, MAG, WM, LCdR), pp. 1071–1080.
- CIKM-2015-WangG #metric #multi #tuple
- Partially Labeled Data Tuple Can Optimize Multivariate Performance Measures (JJYW, XG0), pp. 1915–1918.
- CIKM-2015-WilkieA #bias #query
- Query Length, Retrievability Bias and Performance (CW, LA), pp. 1787–1790.
- ECIR-2015-EdwardsKA #design #interface #query
- The Impact of Query Interface Design on Stress, Workload and Performance (AE, DK, LA), pp. 691–702.
- ICML-2015-BachHBG #learning
- Paired-Dual Learning for Fast Training of Latent Variable Hinge-Loss MRFs (SHB, BH, JLBG, LG), pp. 381–390.
- ICML-2015-FlaxmanWNNS #process
- Fast Kronecker Inference in Gaussian Processes with non-Gaussian Likelihoods (SF, AGW, DN, HN, AJS), pp. 607–616.
- ICML-2015-FrostigGKS #algorithm #approximate #empirical #named #probability
- Un-regularizing: approximate proximal point and faster stochastic algorithms for empirical risk minimization (RF, RG, SK, AS), pp. 2540–2548.
- ICML-2015-GarberH #set
- Faster Rates for the Frank-Wolfe Method over Strongly-Convex Sets (DG, EH), pp. 541–549.
- ICML-2015-GouwsBC #distributed #named #word
- BilBOWA: Fast Bilingual Distributed Representations without Word Alignments (SG, YB, GC), pp. 748–756.
- ICML-2015-IzbickiS
- Faster cover trees (MI, CRS), pp. 1162–1170.
- ICML-2015-JerniteRS #approach #learning #markov #modelling #random
- A Fast Variational Approach for Learning Markov Random Field Language Models (YJ, AMR, DS), pp. 2209–2217.
- ICML-2015-KuklianskyS #linear
- Attribute Efficient Linear Regression with Distribution-Dependent Sampling (DK, OS), pp. 153–161.
- ICML-2015-LimKPJ #scalability #set
- Double Nyström Method: An Efficient and Accurate Nyström Scheme for Large-Scale Data Sets (WL, MK, HP, KJ), pp. 1367–1375.
- ICML-2015-NarasimhanK0 #metric #optimisation
- Optimizing Non-decomposable Performance Measures: A Tale of Two Classes (HN, PK, PJ), pp. 199–208.
- ICML-2015-NarasimhanRS0 #algorithm #consistency #metric #multi
- Consistent Multiclass Algorithms for Complex Performance Measures (HN, HGR, AS, SA), pp. 2398–2407.
- ICML-2015-NutiniSLFK #coordination #random
- Coordinate Descent Converges Faster with the Gauss-Southwell Rule Than Random Selection (JN, MWS, IHL, MPF, HAK), pp. 1632–1641.
- ICML-2015-TristanTS #estimation #gpu
- Efficient Training of LDA on a GPU by Mean-for-Mode Estimation (JBT, JT, GLSJ), pp. 59–68.
- ICML-2015-WenKA #combinator #learning #scalability
- Efficient Learning in Large-Scale Combinatorial Semi-Bandits (ZW, BK, AA), pp. 1113–1122.
- ICML-2015-YiCP #algorithm
- Binary Embedding: Fundamental Limits and Fast Algorithm (XY, CC, EP), pp. 2162–2170.
- ICML-2015-ZhangWJ #algorithm #bound #distributed #estimation #matrix #rank
- Distributed Estimation of Generalized Matrix Rank: Efficient Algorithms and Lower Bounds (YZ, MJW, MIJ), pp. 457–465.
- KDD-2015-BifetMRHP #big data #classification #data type #evaluation #online
- Efficient Online Evaluation of Big Data Stream Classifiers (AB, GDFM, JR, GH, BP), pp. 59–68.
- KDD-2015-CaiTFJH #higher-order #mining #named
- Facets: Fast Comprehensive Mining of Coevolving High-order Time Series (YC, HT, WF, PJ, QH), pp. 79–88.
- KDD-2015-ChierichettiEKL #algorithm #network #social
- Efficient Algorithms for Public-Private Social Networks (FC, AE, RK, SL, VSM), pp. 139–148.
- KDD-2015-FujiwaraNSIT #adaptation
- Adaptive Message Update for Fast Affinity Propagation (YF, MN, HS, YI, MT), pp. 309–318.
- KDD-2015-Llinares-LopezS #mining #mutation testing #permutation #testing
- Fast and Memory-Efficient Significant Pattern Mining via Permutation Testing (FLL, MS, LP, KMB), pp. 725–734.
- KDD-2015-OhHYJ #matrix #parallel #robust
- Fast and Robust Parallel SGD Matrix Factorization (JO, WSH, HY, XJ), pp. 865–874.
- KDD-2015-OhsakaMK #evolution #network #rank
- Efficient PageRank Tracking in Evolving Networks (NO, TM, KiK), pp. 875–884.
- KDD-2015-SongMT #network #recommendation
- Efficient Latent Link Recommendation in Signed Networks (DS, DAM, DT), pp. 1105–1114.
- KDD-2015-UlanovaYCJKZ #physics #profiling
- Efficient Long-Term Degradation Profiling in Time Series for Complex Physical Systems (LU, TY, HC, GJ, EJK, KZ), pp. 2167–2176.
- KDD-2015-XieBDG #personalisation #rank
- Edge-Weighted Personalized PageRank: Breaking A Decade-Old Performance Barrier (WX, DB, AJD, JG), pp. 1325–1334.
- KDD-2015-YanRHC #distributed #learning #modelling #optimisation #scalability
- Performance Modeling and Scalability Optimization of Distributed Deep Learning Systems (FY, OR, YH, TMC), pp. 1355–1364.
- KDD-2015-Yi0YLW #algorithm #clustering #constraints
- An Efficient Semi-Supervised Clustering Algorithm with Sequential Constraints (JY, LZ, TY, WL, JW), pp. 1405–1414.
- KDD-2015-ZhangTMTJL #named #network #scalability #similarity
- Panther: Fast Top-k Similarity Search on Large Networks (JZ, JT, CM, HT, YJ, JL), pp. 1445–1454.
- KDD-2015-ZhangZMH #assembly #co-evolution #named
- Assembler: Efficient Discovery of Spatial Co-evolving Patterns in Massive Geo-sensory Data (CZ, YZ, XM, JH), pp. 1415–1424.
- KDD-2015-ZhaoJCJ #estimation #parametricity #quality
- SAME but Different: Fast and High Quality Gibbs Parameter Estimation (HZ, BJ, JFC, BJ), pp. 1495–1502.
MLDM-2015-Al-SaleemAAB #education #mining #predict #student- Mining Educational Data to Predict Students’ Academic Performance (MAS, NAK, SAO, GB), pp. 403–414.
- MLDM-2015-MoldovanM #data mining #learning #mining #using
- Learning the Relationship Between Corporate Governance and Company Performance Using Data Mining (DM, SM), pp. 368–381.
- MLDM-2015-SalahAM #mining #optimisation #pipes and filters
- Optimizing the Data-Process Relationship for Fast Mining of Frequent Itemsets in MapReduce (SS, RA, FM), pp. 217–231.
- MLDM-2015-ZidaFWLT #mining
- Efficient Mining of High-Utility Sequential Rules (SZ, PFV, CWW, JCWL, VST), pp. 157–171.
RecSys-2015-ForsatiBMER #algorithm #named #recommendation #trust- PushTrust: An Efficient Recommendation Algorithm by Leveraging Trust and Distrust Relations (RF, IB, FM, AHE, HR), pp. 51–58.
- RecSys-2015-Guardia-Sebaoun #modelling #recommendation
- Latent Trajectory Modeling: A Light and Efficient Way to Introduce Time in Recommender Systems (ÉGS, VG, PG), pp. 281–284.
- RecSys-2015-LiuWS #matrix
- Fast Differentially Private Matrix Factorization (ZL, YXW, AJS), pp. 171–178.
- RecSys-2015-MaksaiGF #evaluation #metric #online #predict #recommendation
- Predicting Online Performance of News Recommender Systems Through Richer Evaluation Metrics (AM, FG, BF), pp. 179–186.
SEKE-2015-GoswamiWS #learning #using- Using Learning Styles of Software Professionals to Improve their Inspection Team Performance (AG, GSW, AS), pp. 680–685.
- SEKE-2015-KinneerKMW #automation #database #generative #relational #search-based #testing
- Automatically Evaluating the Efficiency of Search-Based Test Data Generation for Relational Database Schemas (CK, GMK, PM, CJW), pp. 352–357.
- SEKE-2015-ManiPW #co-evolution #modelling #using
- Exploring SOA Pattern Performance using Coupled Transformations and Performance Models (NM, DCP, CMW), pp. 552–557.
- SEKE-2015-PeiYF #data access #in the cloud #policy
- Achieving Efficient Access Control via XACML Policy in Cloud Computing (XP, HY, GF), pp. 110–115.
SIGIR-2015-CanutoGSRM #approach #classification #documentation #parallel #scalability- An Efficient and Scalable MetaFeature-based Document Classification Approach based on Massively Parallel Computing (SDC, MAG, WS, TR, WM), pp. 333–342.
- SIGIR-2015-LuccheseNOPTV #algorithm #documentation #named #rank
- QuickScorer: A Fast Algorithm to Rank Documents with Additive Ensembles of Regression Trees (CL, FMN, SO, RP, NT, RV), pp. 73–82.
- SIGIR-2015-MalherbeCB #categorisation #order
- Bringing Order to the Job Market: Efficient Job Offer Categorization in E-Recruitment (EM, MC, AB), pp. 1101–1104.
- MoDELS-2015-KetataMFLC #migration #modelling #predict
- Performance prediction upon toolchain migration in model-based software (AK, CM, SF, JHL, KC), pp. 302–311.
- MoDELS-2015-Moawad0FNKT #modelling
- Beyond discrete modeling: A continuous and efficient model for IoT (AM, TH, FF, GN, JK, YLT), pp. 90–99.
SPLC-2015-SoutoGdMKB #debugging #detection #feature model #modelling #product line- Faster bug detection for software product lines with incomplete feature models (SS, DG, Md, DM, SK, DSB), pp. 151–160.
- SPLC-2015-ValovGC #comparison #empirical #predict #variability
- Empirical comparison of regression methods for variability-aware performance prediction (PV, JG, KC), pp. 186–190.
- ECOOP-2015-FangDX #detection #named #problem
- PerfBlower: Quickly Detecting Memory-Related Performance Problems via Amplification (LF, LD, G(X), pp. 296–320.
- Onward-2015-GreweEWM #proving #type system
- Type systems for the masses: deriving soundness proofs and efficient checkers (SG, SE, PW, MM), pp. 137–150.
- Onward-2015-MattisHRHA
- Columnar objects: improving the performance of analytical applications (TM, JH, PR, RH, MA), pp. 197–210.
- OOPSLA-2015-0003KLS #data type #memory management #multi #scalability
- Fast, multicore-scalable, low-fragmentation memory allocation through large virtual memory and global data structures (MA, CMK, ML, AS), pp. 451–469.
- OOPSLA-2015-BiswasZBL #exception #named
- Valor: efficient, software-only region conflict exceptions (SB, MZ, MDB, BL), pp. 241–259.
- OOPSLA-2015-SteindorferV #agile #optimisation #virtual machine
- Optimizing hash-array mapped tries for fast and lean immutable JVM collections (MJS, JJV), pp. 783–800.
- OOPSLA-2015-ToffolaPG #dynamic analysis #problem
- Performance problems you can fix: a dynamic analysis of memoization opportunities (LDT, MP, TRG), pp. 607–622.
- PLATEAU-2015-CuencaBLC #case study #domain-specific language #execution #interactive #multimodal #programming #user study
- A user study for comparing the programming efficiency of modifying executable multimodal interaction descriptions: a domain-specific language versus equivalent event-callback code (FC, JVdB0, KL, KC), pp. 31–38.
AdaEurope-2015-NelissenPP #architecture #monitoring #novel #runtime- A Novel Run-Time Monitoring Architecture for Safe and Efficient Inline Monitoring (GN, DP, LMP), pp. 66–82.
- PADL-2015-ShterionovJ #implementation #pipes and filters #probability
- Implementation and Performance of Probabilistic Inference Pipelines (DSS, GJ), pp. 90–104.
- PLDI-2015-MarrSD #metaprogramming #protocol
- Zero-overhead metaprogramming: reflection and metaobject protocols fast and without compromises (SM, CS, SD), pp. 545–554.
- PLDI-2015-McClurgHCF #network #synthesis
- Efficient synthesis of network updates (JM, HH, PC, NF), pp. 196–207.
- PLDI-2015-NoriORV #probability #source code #synthesis
- Efficient synthesis of probabilistic programs (AVN, SO, SKR, DV), pp. 208–217.
- PLDI-2015-OlivoDL #debugging #detection #static analysis #traversal
- Static detection of asymptotic performance bugs in collection traversals (OO, ID, CL), pp. 369–378.
- PLDI-2015-RenJKAK #execution #hardware #recursion #source code
- Efficient execution of recursive programs on commodity vector hardware (BR, YJ, SK, KA, MK), pp. 509–520.
- PLDI-2015-SinghPV #program analysis
- Making numerical program analysis fast (GS, MP, MTV), pp. 303–313.
- POPL-2015-ChatterjeeIPG #algebra #algorithm #constant #recursion #state machine
- Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth (KC, RIJ, AP, PG), pp. 97–109.
- POPL-2015-RastogiSFBV #type system #typescript
- Safe & Efficient Gradual Typing for TypeScript (AR, NS, CF, GMB, PV), pp. 167–180.
- QAPL-2015-BortolussiH #markov #modelling
- Efficient Checking of Individual Rewards Properties in Markov Population Models (LB, JH), pp. 32–47.
REFSQ-2015-LiHT #case study #formal method #requirements #towards- Towards More Efficient Requirements Formalization: A Study (WL, JHH, MT), pp. 181–197.
- ASE-2015-BocicB #logic #verification
- Efficient Data Model Verification with Many-Sorted Logic (T) (IB, TB), pp. 42–52.
- ASE-2015-DeligiannisDR #analysis #concurrent #debugging #precise
- Fast and Precise Symbolic Analysis of Concurrency Bugs in Device Drivers (T) (PD, AFD, ZR), pp. 166–177.
- ASE-2015-KowalTTS #modelling #parametricity #scalability #variability
- Scaling Size and Parameter Spaces in Variability-Aware Software Performance Models (T) (MK, MT, MT, IS), pp. 407–417.
- ASE-2015-LinLCSH0 #algorithm #combinator #generative #metaheuristic #named #testing
- TCA: An Efficient Two-Mode Meta-Heuristic Algorithm for Combinatorial Test Generation (T) (JL, CL, SC, KS, DH, LZ), pp. 494–505.
- ASE-2015-SarkarGSAC #configuration management #low cost #predict
- Cost-Efficient Sampling for Performance Prediction of Configurable Systems (T) (AS, JG, NS, SA, KC), pp. 342–352.
- ASE-2015-ShermanD #analysis #data flow #precise
- Exploiting Domain and Program Structure to Synthesize Efficient and Precise Data Flow Analyses (T) (ES, MBD), pp. 608–618.
- ASE-2015-ZhangGBC #configuration management #fourier #learning #predict
- Performance Prediction of Configurable Software Systems by Fourier Learning (T) (YZ, JG, EB, KC), pp. 365–373.
- ESEC-FSE-2015-BellKMD #dependence #detection #java
- Efficient dependency detection for safe Java test acceleration (JB, GEK, EM, MD), pp. 770–781.
- ESEC-FSE-2015-KimNYCK #api #fault #named #predict #testing
- REMI: defect prediction for efficient API testing (MK, JN, JY, SC, SK), pp. 990–993.
- ESEC-FSE-2015-WestNM #concurrent #object-oriented
- Efficient and reasonable object-oriented concurrency (SW, SN, BM), pp. 734–744.
- ESEC-FSE-2015-White #generative #parametricity #search-based #testing #using
- Increasing the efficiency of search-based unit test generation using parameter control (TW), pp. 1042–1044.
ICSE-v1-2015-BaresiKR #ltl #scalability #specification #verification- Efficient Scalable Verification of LTL Specifications (LB, MMPK, MR), pp. 711–721.
- ICSE-v1-2015-BocicB #verification
- Coexecutability for Efficient Verification of Data Model Updates (IB, TB), pp. 744–754.
- ICSE-v1-2015-FilieriGL #adaptation #learning #lightweight #modelling #probability
- Lightweight Adaptive Filtering for Efficient Learning and Updating of Probabilistic Models (AF, LG, AL), pp. 200–211.
- ICSE-v1-2015-GhotraMH #classification #fault #modelling #predict
- Revisiting the Impact of Classification Techniques on the Performance of Defect Prediction Models (BG, SM, AEH), pp. 789–800.
- ICSE-v1-2015-NistorCRL #detection #named #problem
- CARAMEL: Detecting and Fixing Performance Problems That Have Non-Intrusive Fixes (AN, PCC, CR, SL), pp. 902–912.
- ICSE-v1-2015-PapadakisJHT #compilation #detection #effectiveness #empirical #equivalence #scalability
- Trivial Compiler Equivalence: A Large Scale Empirical Study of a Simple, Fast and Effective Equivalent Mutant Detection Technique (MP, YJ, MH, YLT), pp. 936–946.
- ICSE-v1-2015-Tantithamthavorn #fault #modelling #predict
- The Impact of Mislabelling on the Performance and Interpretation of Defect Prediction Models (CT, SM, AEH, AI, KiM), pp. 812–823.
- ICSE-v2-2015-ChenGSYH #energy #named
- StressCloud: A Tool for Analysing Performance and Energy Consumption of Cloud Applications (FC, JCG, JGS, YY, QH), pp. 721–724.
- ICSE-v2-2015-EtienneMAD #modelling #predict #process #proving #trust
- Improving Predictability, Efficiency and Trust of Model-Based Proof Activity (JFÉ, MM, FA, VD), pp. 139–148.
- ICSE-v2-2015-FooJAHZF #automation #case study #detection #industrial
- An Industrial Case Study on the Automated Detection of Performance Regressions in Heterogeneous Environments (KCF, ZMJ, BA, AEH, YZ, PF), pp. 159–168.
- ICSE-v2-2015-MaplesdenRTHG #analysis #case study #industrial #using
- Performance Analysis Using Subsuming Methods: An Industrial Case Study (DM, KvR, EDT, JGH, JCG), pp. 149–158.
- ICSE-v2-2015-ProcacciantiLVF #energy
- The Green Lab: Experimentation in Software Energy Efficiency (GP, PL, AV, DMF, RW), pp. 941–942.
- ICSE-v2-2015-Rastogi
- Contributor’s Performance, Participation Intentions, Its Influencers and Project Performance (AR), pp. 919–922.
- ICSE-v2-2015-Roos #code completion #precise #statistics
- Fast and Precise Statistical Code Completion (PR), pp. 757–759.
- ICSE-v2-2015-VetroOF0 #empirical #feedback #re-engineering #research
- Fast Feedback Cycles in Empirical Software Engineering Research (AV, SO, DMF, SW), pp. 583–586.
SAC-2015-BoitoKND #profiling #towards- Towards fast profiling of storage devices regarding access sequentiality (FZB, RK, POAN, YD), pp. 2015–2020.
- SAC-2015-BorgesDSEAS #approach #reasoning #reuse #using
- Efficient approach for reusing and sharing train driving plans using case-based reasoning (APB, OBD, DMVS, FE, BCÁ, EES), pp. 505–508.
- SAC-2015-BritoE #branch #named #query
- BranchGuide: an indexing technique for efficient, lossless processing of branching path queries (TBV, GEdS), pp. 1086–1092.
- SAC-2015-DecatBLJ #as a service #data access #middleware #multitenancy #named
- Amusa: middleware for efficient access control management of multi-tenant SaaS applications (MD, JB, BL, WJ), pp. 2141–2148.
- SAC-2015-DuanZHX #analysis #delivery #framework #network #platform
- Performance analysis for a service delivery platform in software defined network (QD, MZ, JH, CCX), pp. 2257–2262.
- SAC-2015-ErnstKR #evaluation #network
- Performance evaluation of heterogeneous wireless networks considering competing objectives and viewpoints (JBE, SCK, JJPCR), pp. 680–687.
- SAC-2015-Fournier-VigerZ #mining #named
- FOSHU: faster on-shelf high utility itemset mining — with or without negative unit profit (PFV, SZ), pp. 857–864.
- SAC-2015-HendersonGE #clustering #empirical #named #parametricity #probability
- EP-MEANS: an efficient nonparametric clustering of empirical probability distributions (KH, BG, TER), pp. 893–900.
- SAC-2015-HsiehNKC #approximate #query #recommendation
- Efficient approximate thompson sampling for search query recommendation (CCH, JN, TK, JC), pp. 740–746.
- SAC-2015-InacioDBNM #file system #operating system #parallel #parametricity
- Performance impact of operating systems’ caching parameters on parallel file systems (ECI, MARD, FZB, POAN, DDJdM), pp. 2066–2068.
- SAC-2015-JakobssonKS #c #hybrid #memory management #monitoring
- Fast as a shadow, expressive as a tree: hybrid memory monitoring for C (AJ, NK, JS), pp. 1765–1772.
- SAC-2015-JeremicPM #array #random
- Improving random write performance in heterogeneous erasure-coded drive arrays by offloading code block requests (NJ, HP, GM), pp. 2007–2014.
- SAC-2015-JuniorDOFB #web
- Handling flash-crowd events to improve the performance of web applications (UdPJ, LMdAD, DdO, YF, VCB), pp. 769–774.
- SAC-2015-KapoorDC #capacity #energy #reduction
- Static energy reduction by performance linked cache capacity management in tiled CMPs (HKK, SD, SC), pp. 1913–1918.
- SAC-2015-LeeRH #file system #memory management
- Performance implications of cache flushes for non-volatile memory file systems (KL, SR, HH), pp. 2069–2071.
- SAC-2015-LopesT #framework
- A framework for investigating the performance of sum aggregations over encrypted data warehouses (CCL, VCT), pp. 1000–1007.
- SAC-2015-ManhaesCZ #automation #predict #source code #student #towards
- Towards automatic prediction of student performance in STEM undergraduate degree programs (LMBM, SMSdC, GZ), pp. 247–253.
- SAC-2015-MinHJCH #distributed #process #scalability
- An efficient backup-recovery technique to process large data in distributed key-value store (DM, TH, JJ, YC, JH), pp. 2072–2074.
- SAC-2015-MukherjeeKCDCM #as a service #design #framework #platform #scalability
- Performance characterization and scalable design of sensing-as-a-service platform (TM, AK, DC, KD, AC, AM), pp. 592–595.
- SAC-2015-OliveiraLV #framework #security #web #web service
- Characterizing the performance of web service frameworks under security attacks (RAO, NL, MV), pp. 1711–1718.
- SAC-2015-PapeBH #adaptation #data type #execution #optimisation
- Adaptive just-in-time value class optimization: transparent data structure inlining for fast execution (TP, CFB, RH), pp. 1970–1977.
- SAC-2015-ReddySC #approach #aspect-oriented #incremental #learning #weaving
- Incremental aspect weaving: an approach for faster AOP learning (YRR, AS, MC), pp. 1480–1485.
- SAC-2015-Rekha #big data #detection #using
- A fast support vector data description system for anomaly detection using big data (AGR), pp. 931–932.
- SAC-2015-RiediBP #algorithm #scalability
- Channel and power allocation algorithm to optimize the performance of large WLANs (MR, GGB, MEP), pp. 673–679.
- SAC-2015-RochaRCOMVADGF #algorithm #classification #dataset #documentation #named #using
- G-KNN: an efficient document classification algorithm for sparse datasets on GPUs using KNN (LCdR, GSR, RC, RSO, DM, FV, GA, SD, MAG, RF), pp. 1335–1338.
- SAC-2015-SidneyMRH #predict #set #similarity
- Performance prediction for set similarity joins (CFS, DSM, LAR, TH), pp. 967–972.
- SAC-2015-TodaT #satisfiability
- BDD construction for all solutions SAT and efficient caching mechanism (TT, KT), pp. 1880–1886.
- SAC-2015-YangCHCLK
- Reliability-aware striping with minimized performance overheads for flash-based storage devices (MCY, YMC, PCH, YHC, LJL, TWK), pp. 1906–1912.
- SLE-2015-BousseCCGB #debugging
- Supporting efficient and advanced omniscient debugging for xDSMLs (EB, JC, BC, JGG, BB), pp. 137–148.
- ASPLOS-2015-DuanHT #memory management #optimisation #symmetry
- Asymmetric Memory Fences: Optimizing Both Performance and Implementability (YD, NH, JT), pp. 531–543.
- ASPLOS-2015-HosekC #execution #framework
- VARAN the Unbelievable: An Efficient N-version Execution Framework (PH, CC), pp. 339–353.
- ASPLOS-2015-MalkaABT #named
- rIOMMU: Efficient IOMMU for I/O Devices that Employ Ring Buffers (MM, NA, MBY, DT), pp. 355–368.
- ASPLOS-2015-MishraZLH #approach #constraints #energy #modelling #probability #visual notation
- A Probabilistic Graphical Model-based Approach for Minimizing Energy Under Performance Constraints (NM, HZ, JDL, HH), pp. 267–281.
- ASPLOS-2015-SungA #named
- DeNovoSync: Efficient Support for Arbitrary Synchronization without Writer-Initiated Invalidations (HS, SVA), pp. 545–559.
- CASE-2015-AndersenDBH #architecture #flexibility #reuse
- An architecture for efficient reuse in flexible production scenarios (RHA, LD, ABB, JH), pp. 151–157.
- CASE-2015-CarliDPR #energy #multi #optimisation #using
- Using multi-objective optimization for the integrated energy efficiency improvement of a smart city public buildings’ portfolio (RC, MD, RP, LR), pp. 21–26.
- CASE-2015-HandokoL #delivery #order #privacy
- Efficient order sharing with privacy preservation via double auction with split delivery (SDH, HCL), pp. 69–74.
- CASE-2015-HolmOFUHAK #evolution #industrial #integration #process
- Engineering method for the integration of modules into fast evolving production systems in the process industry (TH, MO, AF, LU, UH, TA, SK), pp. 1042–1047.
- CASE-2015-HuangHCC #synthesis
- Efficient grasp synthesis and control strategy for robot hand-arm system (MBH, HPH, CCC, CAC), pp. 1256–1257.
- CASE-2015-JiaZAX #analysis
- Performance analysis of Bernoulli serial production lines with switch-on/off machine control (ZJ, LZ, JA, GX), pp. 477–482.
- CASE-2015-LiuC #algorithm #evaluation #quality #using
- A fast algorithm for grasp quality evaluation using the object wrench space (SL, SC), pp. 558–563.
- CASE-2015-MeddouriDF #analysis #generative #induction #predict #using
- Performance analysis of an autonomous induction generator under different operating conditions using predictive control (SM, LAD, LF), pp. 1118–1124.
- CASE-2015-PellicciariBBG #energy
- Increasing position accuracy and energy efficiency of servo-actuated mechanisms (MP, GB, FB, MG), pp. 1339–1344.
- CASE-2015-SaezMBT #analysis #hybrid #realtime #simulation
- Real-time hybrid simulation of manufacturing systems for performance analysis and control (MS, FPM, KB, DMT), pp. 526–531.
- CASE-2015-WangTG #automation
- Automated performance tracking for heat exchangers in HVAC (PW, XT, RG), pp. 949–954.
- CASE-2015-ZakharovZYJ #algorithm #configuration management #distributed #fault tolerance #optimisation #predict
- A performance optimization algorithm for controller reconfiguration in fault tolerant distributed model predictive control (AZ, EZ, MY, SLJJ), pp. 886–891.
- CASE-2015-ZhangWZZ #automaton #learning #optimisation
- Incorporation of ordinal optimization into learning automata for high learning efficiency (JZ, CW, DZ, MZ), pp. 1206–1211.
- CASE-2015-ZhaoLH #estimation #flexibility #problem
- Plant flexibility planning: Problem formulation and performance estimation (CZ, JL, NH), pp. 659–664.
- CC-2015-AfroozehI #gll #parsing
- Faster, Practical GLL Parsing (AA, AI), pp. 89–108.
- CC-2015-DemangePS #coq #optimisation #verification
- Verifying Fast and Sparse SSA-Based Optimizations in Coq (DD, DP, LS), pp. 233–252.
- CGO-2015-RohouSS #branch #predict #trust
- Branch prediction and the performance of interpreters: don’t trust folklore (ER, BNS, AS), pp. 103–114.
- CGO-2015-StepanovS #c++ #detection #memory management #named
- MemorySanitizer: fast detector of uninitialized memory use in C++ (ES, KS), pp. 46–55.
- CGO-2015-ZhangGCCH #named
- HERMES: a fast cross-ISA binary translator with post-optimization (XZ, QG, YC, TC, WH), pp. 246–256.
- CGO-2015-ZhengLHWJ #approach #debugging #manycore #on the
- On performance debugging of unnecessary lock contentions on multicore processors: a replay-based approach (LZ, XL, BH, SW, HJ), pp. 56–67.
DAC-2015-Bowen #quality- Walking a thin line: performance and quality grading vs. yield overcut (CB), p. 2.
- DAC-2015-ChangCKLL #memory management
- Achieving SLC performance with MLC flash memory (YMC, YHC, TWK, YCL, HPL), p. 6.
- DAC-2015-ChenMRC #execution #paradigm
- Opportunistic turbo execution in NTC: exploiting the paradigm shift in performance bottlenecks (HC, DM, SR, KC), p. 6.
- DAC-2015-DingCZ #algorithm #invariant
- An efficient shift invariant rasterization algorithm for all-angle mask patterns in ILT (YD, CCNC, XZ), p. 6.
- DAC-2015-DuraisamyKCLPMM #energy #manycore #pipes and filters #platform
- Energy efficient MapReduce with VFI-enabled multicore platforms (KD, RGK, WC, GL, PPP, RM, DM), p. 6.
- DAC-2015-GuSZCH #embedded #memory management
- Area and performance co-optimization for domain wall memory in application-specific embedded systems (SG, EHMS, QZ, YC, JH), p. 6.
- DAC-2015-HuangFYZL #estimation #multi
- Efficient multivariate moment estimation via Bayesian model fusion for analog and mixed-signal circuits (QH, CF, FY, XZ, XL), p. 6.
- DAC-2015-IsmailLS #worst-case
- Improving worst-case cache performance through selective bypassing and register-indexed cache (MI, DL, GES), p. 6.
- DAC-2015-JiangLZYW #effectiveness #feature model #image
- A 127 fps in full hd accelerator based on optimized AKAZE with efficiency and effectiveness for image feature extraction (GJ, LL, WZ, SY, SW), p. 6.
- DAC-2015-JungC #embedded #multi #named #platform #simulation
- ΣVP: host-GPU multiplexing for efficient simulation of multiple embedded GPUs on virtual platforms (YJ, LPC), p. 6.
- DAC-2015-KadjoAKG #approach #cpu #energy #gpu #mobile #platform
- A control-theoretic approach for energy efficient CPU-GPU subsystem in mobile platforms (DK, RA, MK, PVG), p. 6.
- DAC-2015-LeeHLP #data flow #debugging #information management #interface
- Efficient dynamic information flow tracking on a processor with core debug interface (JL, IH, YL, YP), p. 6.
- DAC-2015-LeeNL #optimisation
- Optimizing stream program performance on CGRA-based systems (HL, DN, JL), p. 6.
- DAC-2015-LiBTO #communication #energy
- Complementary communication path for energy efficient on-chip optical interconnects (HL, SLB, YT, IO), p. 6.
- DAC-2015-LinYP #constraints
- High performance dummy fill insertion with coupling and uniformity constraints (YL, BY, DZP), p. 6.
- DAC-2015-LiuZ #configuration management
- A reconfigurable analog substrate for highly efficient maximum flow computation (GL, ZZ), p. 6.
- DAC-2015-LiZHLHX #automation #compilation #stack
- Compiler directed automatic stack trimming for efficient non-volatile processors (QL, MZ, JH, YL, YH, CJX), p. 6.
- DAC-2015-LukasiewyczSS #design #embedded #platform
- Efficient design space exploration of embedded platforms (ML, FS, SS), p. 6.
- DAC-2015-MengYOLW #array #clustering #data access #memory management #parallel
- Efficient memory partitioning for parallel data access in multidimensional arrays (CM, SY, PO, LL, SW), p. 6.
- DAC-2015-MilutinovicQAC #estimation #named
- PACO: fast average-performance estimation for time-randomized caches (SM, EQ, JA, FJC), p. 6.
- DAC-2015-PapamichaelMH #algorithm #automation #design #named #search-based #using
- Nautilus: fast automated IP design space search using guided genetic algorithms (MKP, PM, JCH), p. 6.
- DAC-2015-RamprasathV #algorithm #optimisation #statistics
- An efficient algorithm for statistical timing yield optimization (SR, VV), p. 6.
- DAC-2015-RanjanVFRR #approximate #energy
- Approximate storage for energy efficient spintronic memories (AR, SV, XF, KR, AR), p. 6.
- DAC-2015-RoseM #analysis #design
- Performance analysis of a memristive crossbar PUF design (GSR, CAM), p. 6.
- DAC-2015-RoyLUP #multi #named #optimisation #paradigm
- OSFA: a new paradigm of gate-sizing for power/performance optimizations under multiple operating conditions (SR, DL, JU, DZP), p. 6.
- DAC-2015-RozicYDV #generative #random
- Highly efficient entropy extraction for true random number generators on FPGAs (VR, BY, WD, IV), p. 6.
- DAC-2015-SarmaMBDN #energy #linux #named
- SmartBalance: a sensing-driven linux load balancer for energy efficiency of heterogeneous MPSoCs (SS, TM, LADB, NDD, AN), p. 6.
- DAC-2015-VasudevanR #algorithm
- An efficient algorithm for frequency-weighted balanced truncation of VLSI interconnects in descriptor form (VV, MR), p. 6.
- DAC-2015-VenkataramaniCR #approximate
- Approximate computing and the quest for computing efficiency (SV, STC, KR, AR), p. 6.
- DAC-2015-WangJZWY #energy
- Selective restore: an energy efficient read disturbance mitigation scheme for future STT-MRAM (RW, LJ, YZ, LW, JY), p. 6.
- DAC-2015-ZaheerWGL #markov #named #process
- mTunes: efficient post-silicon tuning of mixed-signal/RF integrated circuits based on Markov decision process (MZ, FW, CG, XL), p. 6.
- DAC-2015-ZhuangYKWC #algorithm #exponential #framework #scalability #simulation #using
- An algorithmic framework for efficient large-scale circuit simulation using exponential integrators (HZ, WY, IK, XW, CKC), p. 6.
DATE-2015-0001B #clustering #energy #manycore- A ultra-low-energy convolution engine for fast brain-inspired vision in multicore clusters (FC, LB), pp. 683–688.
- DATE-2015-AhmadyanGNCV #analysis #diagrams
- Fast eye diagram analysis for high-speed CMOS circuits (SNA, CG, SN, EC, SV), pp. 1377–1382.
- DATE-2015-ArumugamSAPUBPY #algorithm #co-evolution #design #energy #memory management #novel
- Novel inexact memory aware algorithm co-design for energy efficient computation: algorithmic principles (GPA, PS, JA, KVP, EU, AB, P, SY), pp. 752–757.
- DATE-2015-AwanoHS #named #probability
- ECRIPSE: an efficient method for calculating RTN-induced failure probability of an SRAM cell (HA, MH, TS), pp. 549–554.
- DATE-2015-AzarkhishRLB #memory management
- High performance AXI-4.0 based interconnect for extensible smart memory cubes (EA, DR, IL, LB), pp. 1317–1322.
- DATE-2015-ChenM #distributed #learning #manycore #optimisation
- Distributed reinforcement learning for power limited many-core system performance optimization (ZC, DM), pp. 1521–1526.
- DATE-2015-ChenWY #parallel
- A fast parallel sparse solver for SPICE-based circuit simulators (XC, YW, HY), pp. 205–210.
- DATE-2015-ClercqRVV #encryption #implementation
- Efficient software implementation of ring-LWE encryption (RdC, SSR, FV, IV), pp. 339–344.
- DATE-2015-CourbonLFT #detection #hardware
- A high efficiency hardware trojan detection technique based on fast SEM imaging (FC, PLM, JJAF, AT), pp. 788–793.
- DATE-2015-DinizSDBH #architecture #hardware #standard #video
- A deblocking filter hardware architecture for the high efficiency video coding standard (CMD, MS, FVD, SB, JH), pp. 1509–1514.
- DATE-2015-DoumaAP #estimation #execution #precise
- Fast and precise cache performance estimation for out-of-order execution (RD, SA, ADP), pp. 1132–1137.
- DATE-2015-DubenSPYAEPP #big data #case study #energy
- Opportunities for energy efficient computing: a study of inexact general purpose processors for high-performance and big-data applications (PDD, JS, P, SY, JA, CCE, KVP, TNP), pp. 764–769.
- DATE-2015-FangHYZLG #estimation #fault
- Efficient bit error rate estimation for high-speed link by Bayesian model fusion (CF, QH, FY, XZ, XL, CG), pp. 1024–1029.
- DATE-2015-FaravelonFP #branch #predict #simulation
- Fast and accurate branch predictor simulation (AF, NF, FP), pp. 317–320.
- DATE-2015-GarciaMSN #multi
- High performance single supply CMOS inverter level up shifter for multi: supply voltages domains (JCG, JAMN, JS, SN), pp. 1273–1276.
- DATE-2015-GerumBR #gpu #simulation
- Source level performance simulation of GPU cores (CG, OB, WR), pp. 217–222.
- DATE-2015-GoncalvesLCTCB #algorithm #modelling #reduction
- A fast spatial variation modeling algorithm for efficient test cost reduction of analog/RF circuits (HRG, XL, MVC, VT, JMCJ, KMB), pp. 1042–1047.
- DATE-2015-KobbeBH #adaptation #modelling #on the fly
- Adaptive on-the-fly application performance modeling for many cores (SK, LB, JH), pp. 730–735.
- DATE-2015-KriebelRSASH #analysis #combinator #configuration management #fault #named
- ACSEM: accuracy-configurable fast soft error masking analysis in combinatorial circuits (FK, SR, DS, PVA, MS, JH), pp. 824–829.
- DATE-2015-LeeJG #functional #hardware #simulation
- Dynamic power and performance back-annotation for fast and accurate functional hardware simulation (DL, LKJ, AG), pp. 1126–1131.
- DATE-2015-LiaperdosSATAL #deployment #using
- Fast deployment of alternate analog test using Bayesian model fusion (JL, HGDS, LA, YT, AA, XL), pp. 1030–1035.
- DATE-2015-LiLZGSSZCLY #energy
- An energy efficient backup scheme with low inrush current for nonvolatile SRAM in energy harvesting sensor nodes (HL, YL, QZ, YG, XS, GS, CZ, MFC, RL, HY), pp. 7–12.
- DATE-2015-LinSKRM #debugging #detection #effectiveness #fault #testing #validation
- Quick error detection tests with fast runtimes for effective post-silicon validation and debug (DL, ES, SK, ER, SM), pp. 1168–1173.
- DATE-2015-LiSGWXZS #memory management #reduction
- Maximizing IO performance via conflict reduction for flash memory storage systems (QL, LS, CG, KW, CJX, QZ, EHMS), pp. 904–907.
- DATE-2015-MineoRPACM #architecture #energy #self
- A closed loop transmitting power self-calibration scheme for energy efficient WiNoC architectures (AM, MSR, MP, GA, VC, MNM), pp. 513–518.
- DATE-2015-MirkhaniMCA #design #estimation #fault
- Efficient soft error vulnerability estimation of complex designs (SM, SM, CYC, JA), pp. 103–108.
- DATE-2015-NguyenSCM #robust #set
- Efficient attacks on robust ring oscillator PUF with enhanced challenge-response set (PHN, DPS, RSC, DM), pp. 641–646.
- DATE-2015-PaganiCSH #modelling #named
- MatEx: efficient transient and peak temperature computation for compact thermal models (SP, JJC, MS, JH), pp. 1515–1520.
- DATE-2015-PaoneRPZSS #constraints #framework #platform
- Customization of OpenCL applications for efficient task mapping under heterogeneous platform constraints (EP, FR, GP, VZ, IS, CS), pp. 736–741.
- DATE-2015-ParkAHYL #big data #energy #gpu #low cost #memory management
- Memory fast-forward: a low cost special function unit to enhance energy efficiency in GPU for big data processing (EP, JA, SH, SY, SL), pp. 1341–1346.
- DATE-2015-ParkTNII #platform
- Platform-aware dynamic configuration support for efficient text processing on heterogeneous system (MSP, OT, VN, MJI, RI), pp. 1503–1508.
- DATE-2015-PsarrasSND #named #network #scheduling
- PhaseNoC: TDM scheduling at the virtual-channel level for efficient network traffic isolation (AP, IS, CN, GD), pp. 1090–1095.
- DATE-2015-RahaVRR #approximate #configuration management #energy #quality
- Quality configurable reduce-and-rank for energy efficient approximate computing (AR, SV, VR, AR), pp. 665–670.
- DATE-2015-TeysseyreNOCCG #set #simulation #using
- Fast optical simulation from a reduced set of impulse responses using SystemC-AMS (FT, DN, IO, FC, FC, OG), pp. 405–409.
HPCA-2015-BeckmannS #named- Talus: A simple way to remove cliffs in cache performance (NB, DS), pp. 64–75.
- HPCA-2015-JimenezBBOCV #manycore
- Increasing multicore system efficiency through intelligent bandwidth shifting (VJ, AB, PB, FPO, FJC, MV), pp. 39–50.
- HPCA-2015-KimE #reliability #trade-off
- Balancing reliability, cost, and performance tradeoffs with FreeFault (DWK, ME), pp. 439–450.
- HPCA-2015-MenezoPG #energy #hybrid #protocol #scalability
- Flask coherence: A morphable hybrid coherence protocol to balance energy, performance and scalability (LGM, VP, JÁG), pp. 198–209.
- HPCA-2015-OzsoyDGAP #detection #framework #online
- Malware-aware processors: A framework for efficient online malware detection (MO, CD, IG, NBAG, DVP), pp. 651–661.
- HPCA-2015-PalframanKL #energy #fault #named
- iPatch: Intelligent fault patching to improve energy efficiency (DJP, NSK, MHL), pp. 428–438.
- HPCA-2015-RosDK #classification #clustering
- Hierarchical private/shared classification: The key to simple and efficient coherence for clustered cache hierarchies (AR, MD, SK), pp. 186–197.
- HPCA-2015-WuGLJC #estimation #machine learning #using
- GPGPU performance and power estimation using machine learning (GYW, JLG, AL, NJ, DC), pp. 564–576.
HPDC-2015-KocoloskiL #memory management #multi #named- XEMEM: Efficient Shared Memory for Composed Applications on Multi-OS/R Exascale Systems (BK, JRL), pp. 89–100.
- HPDC-2015-Malony #adaptation
- Through the Looking-Glass: From Performance Observation to Dynamic Adaptation (ADM), p. 1.
- HPDC-2015-OuyangKLP #kernel #lightweight
- Achieving Performance Isolation with Lightweight Co-Kernels (JO, BK, JRL, KTP), pp. 149–160.
- HPDC-2015-PatkiLSMRSS #resource management
- Practical Resource Management in Power-Constrained, High Performance Computing (TP, DKL, AS, MM, BR, MS, BRdS), pp. 121–132.
- HPDC-2015-SuWA #data analysis #generative
- In-Situ Bitmaps Generation and Efficient Data Analysis based on Bitmaps (YS, YW, GA), pp. 61–72.
- HPDC-2015-ZhouLLPZ #abstraction #graph #parallel
- Fast Iterative Graph Computation with Resource Aware Graph Parallel Abstractions (YZ, LL, KL, CP, QZ), pp. 179–190.
ISMM-2015-Kuszmaul #named #parallel #thread- SuperMalloc: a super fast multithreaded malloc for 64-bit machines (BCK), pp. 41–55.
- ISMM-2015-MirandaB #object-oriented #programming
- A partial read barrier for efficient support of live object-oriented programming (EM, CB), pp. 93–104.
- ISMM-2015-StancuWBLF #hybrid #java #memory management
- Safe and efficient hybrid memory management for Java (CS, CW, SB, PL, MF), pp. 81–92.
LCTES-2015-BardizbanyanSWL #data access #using- Improving Data Access Efficiency by Using Context-Aware Loads and Stores (AB, MS, DBW, PLE), p. 10.
- LCTES-2015-GhoshPR #alias
- Enabling Efficient Alias Speculation (SG, YP, AR), p. 10.
PDP-2015-BravoSW #algorithm #architecture #implementation- Efficient Implementation of a Fast Viewshed Algorithm on SIMD Architectures (JCB, TS, JW), pp. 199–202.
- PDP-2015-ChetsaLPSC #energy #framework #multi
- Application-Agnostic Framework for Improving the Energy Efficiency of Multiple HPC Subsystems (GLTC, LL, JMP, PS, GDC), pp. 62–69.
- PDP-2015-CostaP
- DVFS Governor for HPC: Higher, Faster, Greener (GDC, JMP), pp. 533–540.
- PDP-2015-CruzDPN #algorithm
- An Efficient Algorithm for Communication-Based Task Mapping (EHMdC, MD, LLP, POAN), pp. 207–214.
- PDP-2015-DiavastosST #data flow #manycore #named
- TFluxSCC: Exploiting Performance on Future Many-Core Systems through Data-Flow (AD, GS, PT), pp. 190–198.
- PDP-2015-Eisserer #embedded #framework #image #parallel #platform #realtime
- Portable Framework for Real-Time Parallel Image Processing on High Performance Embedded Platforms (CE), pp. 721–724.
- PDP-2015-GeorgakarakosTL #evaluation #parallel
- Performance Evaluation of Parallel HEVC Strategies (GG, LT, JL, JH, UF), pp. 137–144.
- PDP-2015-GuerreiroIRT #energy #kernel #multi #optimisation
- Multi-kernel Auto-Tuning on GPUs: Performance and Energy-Aware Optimization (JG, AI, NR, PT), pp. 438–445.
- PDP-2015-KonstantinidisC #bound #gpu #kernel #memory management
- A Practical Performance Model for Compute and Memory Bound GPU Kernels (EK, YC), pp. 651–658.
- PDP-2015-Loucif
- Concentration and Its Impact on Mesh and Torus-Based NoC Performance (SL), pp. 361–364.
- PDP-2015-LuWWCZ #identification #named
- RaceChecker: Efficient Identification of Harmful Data Races (KL, ZW, XW, CC, XZ), pp. 78–85.
- PDP-2015-MorenoULC #data flow #framework #named #scalability
- NanoCheckpoints: A Task-Based Asynchronous Dataflow Framework for Efficient and Scalable Checkpoint/Restart (JAM, OSÜ, JL, AC), pp. 99–102.
- PDP-2015-MukunokiIT #implementation #multi
- Fast Implementation of General Matrix-Vector Multiplication (GEMV) on Kepler GPUs (DM, TI, DT), pp. 642–650.
- PDP-2015-NanriSAMHKTS #communication #interface #memory management
- Channel Interface: A Primitive Model for Memory Efficient Communication (TN, TS, YA, YM, HH, TK, TT, SS), pp. 177–181.
- PDP-2015-NgWSM #manycore #named #resource management #runtime
- DeFrag: Defragmentation for Efficient Runtime Resource Allocation in NoC-Based Many-core Systems (JN, XW, AKS, TSTM), pp. 345–352.
- PDP-2015-ProkopecPO
- Efficient Lock-Free Work-Stealing Iterators for Data-Parallel Collections (AP, DP, MO), pp. 248–252.
- PDP-2015-SelfaSRG #metric #multi
- Methodologies and Performance Metrics to Evaluate Multiprogram Workloads (VS, JS, CGR, MEG), pp. 150–154.
- PDP-2015-SieglBB #hybrid
- Revealing Potential Performance Improvements by Utilizing Hybrid Work-Sharing for Resource-Intensive Seismic Applications (PS, RB, MB), pp. 659–663.
- PDP-2015-SilveiraMCBFM #configuration management #fault tolerance #preprocessor
- Preprocessing of Scenarios for Fast and Efficient Routing Reconfiguration in Fault-Tolerant NoCs (JS, CAMM, PC, GCB, JMF, RM), pp. 404–411.
- PDP-2015-SousaMP #algorithm #parallel
- A Generic and Highly Efficient Parallel Variant of Boruvka’s Algorithm (CdSS, AM, AP), pp. 610–617.
- PDP-2015-UtreraGM #communication #multi
- Evaluating the Performance Impact of Communication Imbalance in Sparse Matrix-Vector Multiplication (GU, MG, XM), pp. 321–328.
- PDP-2015-XavierORPMR #analysis
- A Performance Isolation Analysis of Disk-Intensive Workloads on Container-Based Clouds (MGX, ICDO, FDR, RDDP, KJM, CAFDR), pp. 253–260.
- PDP-2015-YounessIMO #gpu #implementation #optimisation #problem #satisfiability
- An Efficient Implementation of Ant Colony Optimization on GPU for the Satisfiability Problem (HAY, AI, MM, MO), pp. 230–235.
- PDP-2015-ZahidGBJS #algorithm #clustering #enterprise
- A Weighted Fat-Tree Routing Algorithm for Efficient Load-Balancing in Infini Band Enterprise Clusters (FZ, EGG, BB, BDJ, TS), pp. 35–42.
PPoPP-2015-AlSaberK #multi #semantics- SemCache++: semantics-aware caching for efficient multi-GPU offloading (NA, MK), pp. 255–256.
- PPoPP-2015-BaldassinBA #memory management #transaction
- Performance implications of dynamic memory allocators on transactional memory systems (AB, EB, GA), pp. 87–96.
- PPoPP-2015-BensonB #framework #matrix #parallel
- A framework for practical parallel fast matrix multiplication (ARB, GB), pp. 42–53.
- PPoPP-2015-ChabbiFM #multi
- High performance locks for multi-level NUMA systems (MC, MWF, JMMC), pp. 215–226.
- PPoPP-2015-MuralidharanGCSH #programming
- A collection-oriented programming model for performance portability (SM, MG, BCC, AS, MWH), pp. 263–264.
- PPoPP-2015-RamachandranM #concurrent #named #using
- CASTLE: fast concurrent internal binary search tree using edge-based locking (AR, NM), pp. 281–282.
- PPoPP-2015-ThebaultPD #3d #assembly #case study #implementation #matrix #scalability
- Scalable and efficient implementation of 3d unstructured meshes computation: a case study on matrix assembly (LT, EP, QD), pp. 120–129.
- PPoPP-2015-WestNM #concurrent #object-oriented
- Efficient and reasonable object-oriented concurrency (SW, SN, BM), pp. 273–274.
SOSP-2015-DragojevicNNRSB #consistency #distributed #transaction- No compromises: distributed transactions with consistency, availability, and performance (AD, DN, EBN, MR, AS, AB, MC), pp. 54–70.
- SOSP-2015-WeiSCCC #in memory #transaction #using
- Fast in-memory transaction processing using RDMA and HTM (XW, JS, YC, RC, HC), pp. 87–104.
- ESOP-2015-AbdullaAP
- The Best of Both Worlds: Trading Efficiency and Optimality in Fence Insertion for TSO (PAA, MFA, NTP), pp. 308–332.
- ESOP-2015-SiekVCTG #type system
- Monotonic References for Efficient Gradual Typing (JGS, MMV, MC, STH, RG), pp. 432–456.
- FASE-2015-StruberRCT #approach #model transformation #reuse #variability
- A Variability-Based Approach to Reusable and Efficient Model Transformations (DS, JR, MC, GT), pp. 283–298.
STOC-2015-AmbainisFG #matrix #multi- Fast Matrix Multiplication: Limitations of the Coppersmith-Winograd Method (AA, YF, FLG), pp. 585–593.
- STOC-2015-BassilyS #protocol
- Local, Private, Efficient Protocols for Succinct Histograms (RB, ADS), pp. 127–135.
- STOC-2015-LackiOPSZ #algorithm #distance #power of
- The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree (JL, JO, MP, PS, AZ), pp. 11–20.
- STOC-2015-SunW #canonical
- Faster Canonical Forms for Primitive Coherent Configurations: Extended Abstract (XS, JW), pp. 693–702.
- STOC-2015-ZhuO #convergence
- Nearly-Linear Time Positive LP Solver with Faster Convergence Rate (ZAZ, LO), pp. 229–236.
- CAV-2015-BozzanoCGM #analysis #modelling #safety
- Efficient Anytime Techniques for Model-Based Safety Analysis (MB, AC, AG, CM), pp. 603–621.
- CAV-2015-ChatterjeeIP #algorithm #constant #graph #verification
- Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs (KC, RIJ, AP), pp. 140–157.
- CAV-2015-VizelGM
- Fast Interpolating BMC (YV, AG, SM), pp. 641–657.
ICLP-2015-Saleh - Transforming Delimited Control: Achieving Faster Effect Handlers (AHS), pp. 338–347.
- ICST-2015-MohacsiFB #case study #modelling #testing
- A Case Study on the Efficiency of Model-Based Testing at the European Space Agency (SM, MF, AB), pp. 1–2.
- ICST-2015-RodriguesBCZO #modelling #named #testing
- PLeTsPerf — A Model-Based Performance Testing Tool (EdMR, MB, LTC, AFZ, FMdO), pp. 1–8.
ISSTA-2015-EpitropakisYHB #empirical #evaluation #multi #testing- Empirical evaluation of pareto efficient multi-objective regression test case prioritisation (MGE, SY, MH, EKB), pp. 234–245.
- ISSTA-2015-Narayanaswamy #concurrent
- When truth is efficient: analysing concurrency (GN), pp. 141–152.
- ISSTA-2015-ShenLPG #automation #detection #profiling #search-based #using
- Automating performance bottleneck detection using search-based application profiling (DS, QL, DP, MG), pp. 270–281.
LICS-2015-FigueiraL #graph #logic #query- Path Logics for Querying Graphs: Combining Expressiveness and Efficiency (DF, LL), pp. 329–340.
- SAT-2015-ArifMM #axiom
- Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing (MFA, CM, JMS), pp. 324–342.
- SAT-2015-FalknerLH #analysis #automation #named #satisfiability
- SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers (SF, MTL, FH), pp. 215–222.
- TAP-2015-BirchFP #fault #locality #modelling #testing
- Fast Model-Based Fault Localisation with Test Suites (GB, BF, MRP), pp. 38–57.
CBSE-2014-NoorshamsRRKR #architecture #modelling #predict #statistics- Enriching software architecture models with statistical models for performance prediction in modern storage environments (QN, RR, AR, SK, RHR), pp. 45–54.
- ECSA-2014-BerardinelliMP #analysis #design #network
- fUML-Driven Design and Performance Analysis of Software Agents for Wireless Sensor Network (LB, ADM, SP), pp. 324–339.
- ECSA-2014-ChiprianovFSP #architecture #distributed #embedded #modelling #predict #realtime
- Architectural Support for Model-Driven Performance Prediction of Distributed Real-Time Embedded Systems of Systems (VC, KEF, CS, GP), pp. 357–364.
- ECSA-2014-XiongFPM #architecture #as a service #cost analysis #platform #scalability
- Scalable Architectures for Platform-as-a-Service Clouds: Performance and Cost Analysis (HX, FF, CP, NM), pp. 226–233.
- QoSA-2014-BrunnertWK #architecture #enterprise #modelling #using
- Using architecture-level performance models as resource profiles for enterprise applications (AB, KW, HK), pp. 53–62.
- QoSA-2014-JohnsonC #architecture #evolution #smt #specification
- Efficient re-resolution of SMT specifications for evolving software architectures (KJ, RC), pp. 93–102.
- QoSA-2014-Perez-PalacinM #modelling #nondeterminism
- Dealing with uncertainties in the performance modelling of software systems (DPP, RM), pp. 33–42.
- QoSA-2014-WertOHF #anti #automation #component #detection
- Automatic detection of performance anti-patterns in inter-component communications (AW, MO, CH, RF), pp. 3–12.
- WICSA-2014-SmileyMW #adaptation #architecture #product line #reuse
- A Dynamic Software Product Line Architecture for Prepackaged Expert Analytics: Enabling Efficient Capture, Reuse and Adaptation of Operational Knowledge (KS, SM, PW), pp. 205–214.
- DocEng-2014-KolbergFRF #analysis #documentation #throughput #using
- JAR tool: using document analysis for improving the throughput of high performance printing environments (MLK, LGF, MR, CF), pp. 175–178.
- DRR-2014-GaoRKL #database #documentation #image #retrieval
- Fast structural matching for document image retrieval through spatial databases (HG, MR, DK, JL), p. ?–10.
HT-2014-ChengKWT #architecture #distributed #memory management #rdf #scalability- A two-tier index architecture for fast processing large RDF data over distributed memory (LC, SK, TEW, GT), pp. 300–302.
- JCDL-2014-GaoWLXMW #retrieval #scalability
- Fast Image-based Chinese Calligraphic Character Retrieval on Large Scale Data (PG, JW, YL, YX, TM, BW), pp. 211–220.
- JCDL-2014-KellyNW #html #javascript
- The Archival Acid Test: Evaluating archive performance on advanced HTML and JavaScript (MK, MLN, MCW), pp. 25–28.
- SIGMOD-2014-AgarwalMKTJMMS #approximate #query #reliability
- Knowing when you’re wrong: building fast and reliable approximate query processing systems (SA, HM, AK, AT, MIJ, SM, BM, IS), pp. 481–492.
- SIGMOD-2014-CheneyLW #evaluation #multi #query #relational
- Query shredding: efficient relational evaluation of queries over nested multisets (JC, SL, PW), pp. 1027–1038.
- SIGMOD-2014-ChenLWXML #algorithm #network #query
- Efficient algorithms for optimal location queries in road networks (ZC, YL, RCWW, JX, GM, CL), pp. 123–134.
- SIGMOD-2014-GoelCGMMHW #database #facebook
- Fast database restarts at facebook (AG, BC, CG, DM, JM, FUH, JLW), pp. 541–549.
- SIGMOD-2014-KarnagelHLHLHM #query
- Demonstrating efficient query processing in heterogeneous environments (TK, MH, ML, DH, WL, MH, VM), pp. 693–696.
- SIGMOD-2014-LiCFTL
- Efficient location-aware influence maximization (GL, SC, JF, KLT, WSL), pp. 87–98.
- SIGMOD-2014-PapailiouTKKK #data transformation #graph #rdf
- H2RDF+: an efficient data management system for big RDF graphs (NP, DT, IK, PK, NK), pp. 909–912.
- SIGMOD-2014-ShaoCC #detection #parallel
- Efficient cohesive subgraphs detection in parallel (YS, LC, BC), pp. 613–624.
- SIGMOD-2014-TangXS #complexity
- Influence maximization: near-optimal time complexity meets practical efficiency (YT, XX, YS), pp. 75–86.
- SIGMOD-2014-TaoL #similarity
- Efficient top-K SimRank-based similarity join (WT, GL), pp. 1603–1604.
- SIGMOD-2014-WangKFGKM #framework #query
- A sample-and-clean framework for fast and accurate query processing on dirty data (JW, SK, MJF, KG, TK, TM), pp. 469–480.
- SIGMOD-2014-WuJZ #graph #nearest neighbour #query #random #scalability
- Fast and unified local search for random walk based k-nearest-neighbor query in large graphs (YW, RJ, XZ), pp. 1139–1150.
- SIGMOD-2014-XiongHN #approach #distributed #network #query
- A software-defined networking based approach for performance management of analytical queries on distributed data stores (PX, HH, JFN), pp. 955–966.
- SIGMOD-2014-XuKM #framework #multi #nondeterminism #summary
- Efficient summarization framework for multi-attribute uncertain data (JX, DVK, SM), pp. 421–432.
- SIGMOD-2014-ZengGMZ #approximate #estimation #fault #query
- The analytical bootstrap: a new method for fast error estimation in approximate query processing (KZ, SG, BM, CZ), pp. 277–288.
- VLDB-2014-AlaviZPC #in the cloud #named #query
- RASP-QS: Efficient and Confidential Query Services in the Cloud (ZA, LZ, JP, KC), pp. 1685–1688.
- VLDB-2014-AndersonCJWZ #development #ide #re-engineering
- An Integrated Development Environment for Faster Feature Engineering (MRA, MJC, YJ, GW, BZ), pp. 1657–1660.
- VLDB-2014-CaoYX #database #low cost
- Realization of the Low Cost and High Performance MySQL Cloud Database (WC, FY, JX), pp. 1742–1747.
- VLDB-2014-ChenCCC #named
- SOPS: A System for Efficient Processing of Spatial-Keyword Publish/Subscribe (LC, YC, GC, XC), pp. 1601–1604.
- VLDB-2014-ChenNC #detection #sql
- Fast Foreign-Key Detection in Microsoft SQL Server PowerPivot for Excel (ZC, VRN, SC), pp. 1417–1428.
- VLDB-2014-ChiangDN #algorithm
- Tracking Entities in the Dynamic World: A Fast Algorithm for Matching Temporal Records (YHC, AD, JFN), pp. 469–480.
- VLDB-2014-JugelJHM #visual notation
- Faster Visual Analytics through Pixel-Perfect Aggregation (UJ, ZJ, GH, VM), pp. 1705–1708.
- VLDB-2014-KlonatosKRC #query
- Building Efficient Query Engines in a High-Level Language (YK, CK, TR, HC), pp. 853–864.
- VLDB-2014-KlonatosKRC14a #query
- Errata for “Building Efficient Query Engines in a High-Level Language” (PVLDB 7(10): 853-864) (YK, CK, TR, HC), p. 1784.
- VLDB-2014-KorulaL #algorithm #network #social
- An efficient reconciliation algorithm for social networks (NK, SL), pp. 377–388.
- VLDB-2014-LiagourisT #identification #knowledge base #owl
- Efficient Identification of Implicit Facts in Incomplete OWL2-EL Knowledge Bases (JL, MT), pp. 1993–2004.
- VLDB-2014-LiLWB #in the cloud #privacy #query
- Fast Range Query Processing with Strong Privacy Protection for Cloud Computing (RL, AXL, ALW, BB), pp. 1953–1964.
- VLDB-2014-LiuCHLS #approximate #named #nearest neighbour
- SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search (YL, JC, ZH, HL, HTS), pp. 745–756.
- VLDB-2014-NagelBV #code generation #query
- Code Generation for Efficient Query Processing in Managed Runtimes (FN, GMB, SDV), pp. 1095–1106.
- VLDB-2014-XiongH #distributed #named #network #query
- Pronto: A Software-Defined Networking based System for Performance Management of Analytical Queries on Distributed Data Stores (PX, HH), pp. 1661–1664.
- VLDB-2014-YanCXLNB #algorithm #graph #problem
- Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees (DY, JC, KX, YL, WN, YB), pp. 1821–1832.
- VLDB-2014-ZhangCT #database
- An Efficient Publish/Subscribe Index for ECommerce Databases (DZ, CYC, KLT), pp. 613–624.
- VLDB-2014-ZhangTCO #analysis #data transformation #in memory
- Efficient In-memory Data Management: An Analysis (HZ, BMT, GC, BCO), pp. 833–836.
- VLDB-2015-GraefeVKKTLV14 #big data #in memory
- In-Memory Performance for Big Data (GG, HV, HK, HAK, JT, ML, ACV), pp. 37–48.
- VLDB-2015-InoueOT14 #branch #predict #set
- Faster Set Intersection with SIMD instructions by Reducing Branch Mispredictions (HI, MO, KT), pp. 293–304.
- VLDB-2015-ShenCJLOT14 #distributed #graph
- Fast Failure Recovery in Distributed Graph Processing Systems (YS, GC, HVJ, WL, BCO, BMT), pp. 437–448.
- VLDB-2015-TaoYL14 #similarity
- Efficient Top-K SimRank-based Similarity Join (WT, MY, GL), pp. 317–328.
- VLDB-2015-ThenKCHPK0V14 #graph #multi #traversal
- The More the Merrier: Efficient Multi-Source Graph Traversal (MT, MK, FC, TAHV, KP, AK, TN, HTV), pp. 449–460.
- EDM-2014-Barmaki #communication #education
- Nonverbal Communication and Teaching Performance (RB), pp. 441–443.
- EDM-2014-BeheshtiD #assessment #predict #set
- Predictive performance of prevailing approaches to skills assessment techniques: Insights from real vs. synthetic data sets (BB, MCD), pp. 409–410.
- EDM-2014-JiangWSWO #behaviour #predict
- Predicting MOOC performance with Week 1 Behavior (SJ, AEW, KS, MW, DKO), pp. 273–275.
- EDM-2014-VelasquezGMM #learning #online
- Learning Aid Use Patterns and Their Impact on Exam Performance in Online Developmental Mathematics (NFV, IMG, TM, JM), pp. 379–380.
- EDM-2014-XiongAH #predict
- Improving Retention Performance Prediction with Prerequisite Skill Features (XX, SA, NTH), pp. 375–376.
- ITiCSE-2014-DagieneMPRS #contest #student
- Students’ performance on programming-related tasks in an informatics contest in Finland, Sweden and Lithuania (VD, LM, TP, LR, PS), pp. 153–158.
- SIGITE-2014-Hartpence #challenge #metric
- Curricular and performance measurement challenges in cloud environments (BH), pp. 51–54.
- SIGITE-2014-JacksonEC #analysis #contest #programming
- An analysis of team performance in high school programming contests (SJ, HJCE, RC), pp. 27–32.
- ICPC-2014-MatsumuraIKI #execution #java #visualisation
- Repeatedly-executed-method viewer for efficient visualization of execution paths and states in Java (TM, TI, YK, KI), pp. 253–257.
- ICSME-2014-AsaduzzamanRSH #code completion #named
- CSCC: Simple, Efficient, Context Sensitive Code Completion (MA, CKR, KAS, DH), pp. 71–80.
- ICSME-2014-BellomoENO
- Evolutionary Improvements of Cross-Cutting Concerns: Performance in Practice (SB, NAE, RLN, IO), pp. 545–548.
- ICSME-2014-Syer #evolution #maintenance #testing
- The Maintenance and Evolution of Field-Representative Performance Tests (MDS), p. 665.
- ICSME-2014-VieiraFC #embedded #maintenance #metric #using
- Using Software Metrics to Estimate the Impact of Maintenance in the Performance of Embedded Software (AV, PF, ÉFC), pp. 521–525.
- MSR-2014-NguyenNHNF #automation #case study #identification #industrial
- An industrial case study of automatically identifying performance regression-causes (THDN, MN, AEH, MNN, PF), pp. 232–241.
- SCAM-2014-BazrafshanK #debugging #developer
- Effect of Clone Information on the Performance of Developers Fixing Cloned Bugs (SB, RK), pp. 1–10.
- SCAM-2014-KargenS #scalability #slicing
- Efficient Utilization of Secondary Storage for Scalable Dynamic Slicing (UK, NS), pp. 155–164.
- SCAM-2014-LiangSM #analysis
- Fast Flow Analysis with Godel Hashes (SL, WS, MM), pp. 225–234.
- ICALP-v1-2014-AbboudWW #sequence
- Consequences of Faster Alignment of Sequences (AA, VVW, OW), pp. 39–51.
- ICALP-v1-2014-BringmannKPPT #physics #simulation
- Internal DLA: Efficient Simulation of a Physical Growth Model — (KB, FK, KP, UP, HT), pp. 247–258.
- ICALP-v1-2014-ColeK #algorithm #summary
- Fast Algorithms for Constructing Maximum Entropy Summary Trees (RC, HJK), pp. 332–343.
- ICALP-v1-2014-DobzinskiL
- Efficiency Guarantees in Auctions with Budgets (SD, RPL), pp. 392–404.
- ICALP-v1-2014-KoppartyKS #finite
- Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields (SK, MK, MES), pp. 726–737.
- ICALP-v1-2014-MekaRRR #independence #pseudo
- Fast Pseudorandomness for Independence and Load Balancing — (RM, OR, GNR, RDR), pp. 859–870.
- ICALP-v1-2014-ReidlRVS #algorithm
- A Faster Parameterized Algorithm for Treedepth (FR, PR, FSV, SS), pp. 931–942.
- ICALP-v1-2014-Wulff-Nilsen #approximate #distance #graph
- Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles (CWN), pp. 1063–1074.
- LATA-2014-BellaouarCZ #kernel #sequence #string
- Efficient List-Based Computation of the String Subsequence Kernel (SB, HC, DZ), pp. 138–148.
FM-2014-GunadiT #android #case study #logic #metric #monitoring #operating system #runtime- Efficient Runtime Monitoring with Metric Temporal Logic: A Case Study in the Android Operating System (HG, AT), pp. 296–311.
- FM-2014-PonzioRAF #bound
- Efficient Tight Field Bounds Computation Based on Shape Predicates (PP, NR, NA, MFF), pp. 531–546.
- FM-2014-RinastSG #graph #reduction
- A Graph-Based Transformation Reduction to Reach UPPAAL States Faster (JR, SS, DG), pp. 547–562.
- FM-2014-SchebenS #calculus #composition #self
- Efficient Self-composition for Weakest Precondition Calculi (CS, PHS), pp. 579–594.
- Haskell-2014-Pike #automation #named #reduction
- SmartCheck: automatic and efficient counterexample reduction and generalization (LP), pp. 53–64.
- ICFP-2014-HackettH
- Worker/wrapper/makes it/faster (JH, GH), pp. 95–107.
- ICFP-2014-MarlowBCP #abstraction #concurrent #data access
- There is no fork: an abstraction for efficient, concurrent, and concise data access (SM, LB, JC, JP), pp. 325–337.
IFL-2014-AdsitF #analysis #control flow #system f- An Efficient Type- and Control-Flow Analysis for System F (CA, MF), p. 3.
ILC-2014-SmithP #finite #lisp #permutation- Efficient Finite Permutation Groups and Homomesy Computation in Common Lisp (RS, BP), p. 60.
- ILC-2014-Strandh #lisp
- Fast Generic Dispatch for Common Lisp (RS), p. 89.
- CHI-PLAY-2014-BarataGJG #experience #game studies #learning #student
- Relating gaming habits with student performance in a gamified learning experience (GB, SG, JAJ, DJVG), pp. 17–25.
- CIG-2014-PerezSL #game studies #knowledge-based #video
- Knowledge-based fast evolutionary MCTS for general video game playing (DPL, SS, SML), pp. 1–8.
ICGT-2014-AnjorinLST #graph grammar #model transformation #static analysis- A Static Analysis of Non-confluent Triple Graph Grammars for Efficient Model Transformation (AA, EL, AS, GT), pp. 130–145.
- CHI-2014-AtachiantsGJD #design #parallel #tool support
- Design considerations for parallel performance tools (RA, DG, KJ, GD), pp. 2501–2510.
- CHI-2014-BarkhuusEZ #interactive #music
- Watching the footwork: second screen interaction at a dance and music performance (LB, AE, GZ), pp. 1305–1314.
- CHI-2014-DontchevaMBG #crowdsourcing #learning
- Combining crowdsourcing and learning to improve engagement and performance (MD, RRM, JRB, EMG), pp. 3379–3388.
- CHI-2014-GerlingMMBS #experience #game studies #physics #self
- Effects of balancing for physical abilities on player performance, experience and self-esteem in exergames (KMG, MM, RLM, MVB, JDS), pp. 2201–2210.
- CHI-2014-Gilbert #social #what
- What if we ask a different question?: social inferences create product ratings faster (EG), pp. 2759–2762.
- CHI-2014-GutwinCSMO
- Faster command selection on tablets with FastTap (CG, AC, JS, SM, SCO), pp. 2617–2626.
- CHI-2014-HalfakerGT #design #named
- Snuggle: designing for efficient socialization and ideological critique (AH, RSG, LGT), pp. 311–320.
- CHI-2014-HenleyF #editing #navigation #towards
- The patchworks code editor: toward faster navigation with less code arranging and fewer navigation mistakes (AZH, SDF), pp. 2511–2520.
- CHI-2014-HongA #modelling #predict #recommendation #user interface #using
- Novice use of a predictive human performance modeling tool to produce UI recommendations (KWH, RSA), pp. 2251–2254.
- CHI-2014-LohseRPKE #gesture
- Robot gestures make difficult tasks easier: the impact of gestures on perceived workload and task performance (ML, RR, JGP, DEK, VE), pp. 1459–1466.
- CHI-2014-MuellerMGFB #3d #functional #named
- faBrickation: fast 3D printing of functional objects by integrating construction kit building blocks (SM, TM, KG, JF, PB), pp. 3827–3834.
- CHI-2014-NguyenK #matter #multi
- Orientation matters: efficiency of translation-rotation multitouch tasks (QN, MK), pp. 2013–2016.
- CHI-2014-NicosiaOK #modelling
- Modeling the perception of user performance (MN, AO, POK), pp. 1747–1756.
- CHI-2014-RadleJMR #navigation
- Bigger is not always better: display size, performance, and task load during peephole map navigation (RR, HCJ, JM, HR), pp. 4127–4136.
- CHI-2014-SampathRI #crowdsourcing #design #platform
- Cognitively inspired task design to improve user performance on crowdsourcing platforms (HAS, RR, BI), pp. 3665–3674.
- CHI-2014-ShamiNC #social #social media
- Social media participation and performance at work: a longitudinal study (NSS, JN, JC), pp. 115–118.
- CHI-2014-SoloveyZPRM #using
- Classifying driver workload using physiological and driving performance data: two field studies (ETS, MZ, EAGP, BR, BM), pp. 4057–4066.
- CSCW-2014-EhrlichC #communication #development
- The communication patterns of technical leaders: impact on product development team performance (KE, MC), pp. 733–744.
- CSCW-2014-MunsonKRR #email #monitoring
- Monitoring email to indicate project team performance and mutual attraction (SAM, KK, LPRJ), pp. 542–549.
- CSCW-2014-QuinnB #named #spreadsheet
- AskSheet: efficient human computation for decision making with spreadsheets (AJQ, BBB), pp. 1456–1466.
- CSCW-2014-SaveryGGB #consistency #experience #game studies #maintenance
- The effects of consistency maintenance methods on player experience and performance in networked games (CS, TCNG, CG, MB), pp. 1344–1355.
- CSCW-2014-TeoJ #functional #online #quality
- Fast, functional, and fitting: expert response dynamics and response quality in an online newcomer help forum (HJT, AJ), pp. 332–341.
- CSCW-2014-ZhuDKK #assessment #learning
- Reviewing versus doing: learning and performance in crowd assessment (HZ, SPD, REK, AK), pp. 1445–1455.
- DHM-2014-HuangLCCC #quality
- The Influence of Shift Workers Sleeping Quality upon Job Performance (YCH, FLL, HCC, CCC, CLC), pp. 254–262.
- DHM-2014-LiuTZSLSF #assessment #behaviour #framework #modelling #named #platform
- COMPAss: A Space Cognitive Behavior Modeling and Performance Assessment Platform (YL, ZT, YZ, QS, JL, JS, FF), pp. 630–636.
- DHM-2014-NishimuraTGEK
- Effect of Wall Material of a Room on Performance in Long Monotonous Work (HN, YT, AG, AE, NK), pp. 282–291.
- DHM-2014-YamadaOFYGKH #behaviour #music #visual notation
- Visual Behavior in a Japanese Drum Performance of Gion Festival Music (KY, MO, TF, HY, AG, NK, HH), pp. 301–310.
- DUXU-TMT-2014-Lamontagne #paradigm #smarttech
- Techno-Theoretical Paradigm: Performance, Fashion and Wearables (VL), pp. 153–162.
- DUXU-TMT-2014-WetzlingerAD #effectiveness #experience #usability #user interface #using
- Comparing Effectiveness, Efficiency, Ease of Use, Usability and User Experience When Using Tablets and Laptops (WW, AA, MD), pp. 402–412.
- HCI-AIMT-2014-JonssonD #interactive #speech
- Driving with a Speech Interaction System: Effect of Personality on Performance and Attitude of Driver (IMJ, ND), pp. 417–428.
- HCI-AS-2014-NoorHAS #design #interactive
- Mapping Graceful Interaction Design from Dance Performance (NLMN, WNWH, WAWA, FMS), pp. 301–311.
- HCI-AS-2014-YoungCGC #metric #mobile #physics #process
- Snappy App: A Mobile Continuous Performance Test with Physical Activity Measurement for Assessing Attention Deficit Hyperactivity Disorder (ZY, MPC, MG, JC), pp. 363–373.
- HCI-TMT-2014-HankiewiczB #quality #source code #using #word
- Efficiency in Performing Basic Tasks Using Word Processing Programs by the Elderly as a Measure of the Ergonomic Quality of Software (KH, MB), pp. 481–488.
- HCI-TMT-2014-JuniorSFMC
- Fast and Not Furious (LLLJ, FES, FAF, LFVM, JPC), pp. 219–229.
- HCI-TMT-2014-SzklannySWCW #interface #metaprogramming #named
- SyncBox — Synchronizer and Interface for High-Speed Macro Photography (KS, AS, PW, SC, AW), pp. 652–661.
- HIMI-AS-2014-MikamiT #learning #music
- A Music Search System for Expressive Music Performance Learning (TM, KT), pp. 80–89.
- HIMI-DE-2014-SakaguchiIH #development #using
- Development of High-Speed Thermal Display Using Water Flow (MS, KI, KH), pp. 233–240.
- LCT-TRE-2014-GoodeC #collaboration #online #predict
- Online Collaboration: Individual Involvement Used to Predict Team Performance (AWG, GC), pp. 408–416.
- LCT-TRE-2014-TzanavariMCP #experience #user interface #using
- User Experience Observations on Factors That Affect Performance in a Road-Crossing Training Application for Children Using the CAVE (AT, SM, CGC, CP), pp. 91–101.
- CAiSE-2014-PolyvyanyyRH #modelling #process #retrieval #using
- Indexing and Efficient Instance-Based Retrieval of Process Models Using Untanglings (AP, MLR, AHMtH), pp. 439–456.
EDOC-2014-BorhaniLLLH #benchmark #metric #named #virtual machine- WPress: An Application-Driven Performance Benchmark for Cloud-Based Virtual Machines (AHB, PL, BSL, XL, TH), pp. 101–109.
- ICEIS-v1-2014-DavarG #distributed #information management #object-oriented
- Performance Tuning of Object-Oriented Applications in Distributed Information Systems (ZD, JRG), pp. 201–208.
- ICEIS-v1-2014-KannistoHPK #architecture #assessment #distributed #information management #mobile #reasoning #rule-based
- Distributed Knowledge Management Architecture and Rule Based Reasoning for Mobile Machine Operator Performance Assessment (PK, DH, LP, SK), pp. 440–449.
- ICEIS-v1-2014-SilvaNMFMM #algorithm #detection #distributed #pipes and filters #using
- Efficient and Distributed DBScan Algorithm Using MapReduce to Detect Density Areas on Traffic Data (TLCdS, ACAN, RPM, VAEdF, JAFdM, JCM), pp. 52–59.
- ICEIS-v2-2014-SantosBLHC #development #distributed #metric
- Managing Distributed Software Development with Performance Measures (GSdS, RB, GCLL, EHMH, EC), pp. 307–314.
- ICEIS-v2-2014-SilvaMS #aspect-oriented #evaluation #overview #programming
- A Systematic Review on Performance Evaluation of Aspect-Oriented Programming Techniques used to Implement Crosscutting Concerns (RFGdS, MdAM, MSS), pp. 5–13.
- ICEIS-v3-2014-KwanroengjaiLTS #framework
- Operational Alignment Framework for Improving Business Performance of an Organisation (JK, KL, CT, LS), pp. 352–359.
- ICEIS-v3-2014-ObsivacBB #privacy #student
- Do Desperate Students Trade Their Privacy for a Hope? — An Evidence of the Privacy Settings Influence on the User Performance (TO, HB, MB), pp. 156–161.
- CIKM-2014-AbedjanSN #dependence #functional #named
- DFD: Efficient Functional Dependency Discovery (ZA, PS, FN), pp. 949–958.
- CIKM-2014-BudaCMK #database #named
- VFDS: An Application to Generate Fast Sample Databases (TSB, TC, JM, MK), pp. 2048–2050.
- CIKM-2014-CanutoSGRRGRM #classification #effectiveness #on the
- On Efficient Meta-Level Features for Effective Text Classification (SDC, TS, MAG, LCdR, GSR, LG, TCR, WSM), pp. 1709–1718.
- CIKM-2014-ChatzistergiouV #clustering #data type #heuristic
- Fast Heuristics for Near-Optimal Task Allocation in Data Stream Processing over Clusters (AC, SDV), pp. 1579–1588.
- CIKM-2014-Huo0LM #query
- Improving Tail Query Performance by Fusion Model (SH, MZ, YL, SM), pp. 559–568.
- CIKM-2014-KangKL #automation #owl
- A Meta-reasoner to Rule Them All: Automated Selection of OWL Reasoners Based on Efficiency (YBK, SK, YFL), pp. 1935–1938.
- CIKM-2014-KimC #array
- Efficient Static and Dynamic In-Database Tensor Decompositions on Chunk-Based Array Stores (MK, KSC), pp. 969–978.
- CIKM-2014-LimCK #data type
- Fast, Accurate, and Space-efficient Tracking of Time-weighted Frequent Items from Data Streams (YL, JC, UK), pp. 1109–1118.
- CIKM-2014-LiuLK #classification #information management #using
- Using Local Information to Significantly Improve Classification Performance (WL, DL, RK), pp. 1947–1950.
- CIKM-2014-LiZZW #keyword #named
- INK: A Cloud-Based System for Efficient Top-k Interval Keyword Search (RL, XZ, XZ, SW), pp. 2003–2005.
- CIKM-2014-OzdemirayA #predict #query
- Query Performance Prediction for Aspect Weighting in Search Result Diversification (AMO, ISA), pp. 1871–1874.
- CIKM-2014-QinSFSC #internet #linked data #open data #towards
- Towards Efficient Dissemination of Linked Data in the Internet of Things (YQ, QZS, NJGF, AS, EC), pp. 1779–1782.
- CIKM-2014-SchuthSWLR #evaluation #multi #online
- Multileaved Comparisons for Fast Online Evaluation (AS, FS, SW, DL, MdR), pp. 71–80.
- CIKM-2014-TaoW #predict #query
- Query Performance Prediction By Considering Score Magnitude and Variance Together (YT, SW), pp. 1891–1894.
- CIKM-2014-TongZC0 #graph #nondeterminism #probability #scalability
- Efficient Probabilistic Supergraph Search Over Large Uncertain Graphs (YT, XZ, CCC, LC), pp. 809–818.
- CIKM-2014-UysalBSS #approximate #database #distance #multi #scalability #using
- Efficient Filter Approximation Using the Earth Mover’s Distance in Very Large Multimedia Databases with Feature Signatures (MSU, CB, JS, TS), pp. 979–988.
- CIKM-2014-WangSZS #scalability #semantics #similarity
- Sparse Semantic Hashing for Efficient Large Scale Similarity Search (QW, BS, ZZ, LS), pp. 1899–1902.
- CIKM-2014-WilkieA #analysis #bias #retrieval
- A Retrievability Analysis: Exploring the Relationship Between Retrieval Bias and Retrieval Performance (CW, LA), pp. 81–90.
- CIKM-2014-WuF14a #modelling #query
- Analytical Performance Modeling for Top-K Query Processing (HW, HF), pp. 1619–1628.
- CIKM-2014-XuHCWHBA #framework
- A Demonstration of SearchonTS: An Efficient Pattern Search Framework for Time Series Data (XX, SH, YC, CW, IH, KB, MA), pp. 2015–2017.
- CIKM-2014-ZhengZLHZ #graph #scalability
- Efficient Subgraph Skyline Search Over Large Graphs (WZ, LZ, XL, LH, DZ), pp. 1529–1538.
- ECIR-2014-CatenaMO #on the
- On Inverted Index Compression for Search Engine Efficiency (MC, CM, IO), pp. 359–371.
- ECIR-2014-KazaiS #difference #evaluation #information retrieval #query
- Dissimilarity Based Query Selection for Efficient Preference Based IR Evaluation (GK, HS), pp. 172–183.
- ICML-c1-2014-HajiaghayiKWB #estimation #markov
- Efficient Continuous-Time Markov Chain Estimation (MH, BK, LW, ABC), pp. 638–646.
- ICML-c1-2014-HutterHL #approach
- An Efficient Approach for Assessing Hyperparameter Importance (FH, HH, KLB), pp. 754–762.
- ICML-c1-2014-LiuJL #approximate #kernel #using
- Efficient Approximation of Cross-Validation for Kernel Methods using Bouligand Influence Function (YL, SJ, SL), pp. 324–332.
- ICML-c1-2014-NguyenB #process
- Fast Allocation of Gaussian Process Experts (TVN, EVB), pp. 145–153.
- ICML-c1-2014-Shrivastava0 #permutation
- Densifying One Permutation Hashing via Rotation for Fast Near Neighbor Search (AS, PL), pp. 557–565.
- ICML-c1-2014-SiHD #approximate #kernel #memory management
- Memory Efficient Kernel Approximation (SS, CJH, ISD), pp. 701–709.
- ICML-c1-2014-SomaKIK #algorithm
- Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm (TS, NK, KI, KiK), pp. 351–359.
- ICML-c1-2014-ZhangHL #heuristic
- Covering Number for Efficient Heuristic-based POMDP Planning (ZZ, DH, WSL), pp. 28–36.
- ICML-c1-2014-ZhongK #multi #probability
- Fast Stochastic Alternating Direction Method of Multipliers (WZ, JTYK), pp. 46–54.
- ICML-c2-2014-0005YJ #algorithm #robust
- Efficient Algorithms for Robust One-bit Compressive Sensing (LZ, JY, RJ), pp. 820–828.
- ICML-c2-2014-AgarwalHKLLS #algorithm
- Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits (AA, DH, SK, JL, LL, RES), pp. 1638–1646.
- ICML-c2-2014-AnarakiH #memory management #random
- Memory and Computation Efficient PCA via Very Sparse Random Projections (FPA, SMH), pp. 1341–1349.
- ICML-c2-2014-CelikLL #estimation #network #reduction
- Efficient Dimensionality Reduction for High-Dimensional Network Estimation (SC, BAL, SIL), pp. 1953–1961.
- ICML-c2-2014-CuturiD
- Fast Computation of Wasserstein Barycenters (MC, AD), pp. 685–693.
- ICML-c2-2014-DefazioDC #big data #incremental #named #problem
- Finito: A faster, permutable incremental gradient method for big data problems (AD, JD, TSC), pp. 1125–1133.
- ICML-c2-2014-FujiwaraI
- Efficient Label Propagation (YF, GI), pp. 784–792.
- ICML-c2-2014-GiesenLW #kernel #robust
- Robust and Efficient Kernel Hyperparameter Paths with Guarantees (JG, SL, PW), pp. 1296–1304.
- ICML-c2-2014-GrandeWH #learning #process
- Sample Efficient Reinforcement Learning with Gaussian Processes (RCG, TJW, JPH), pp. 1332–1340.
- ICML-c2-2014-JunB #memory management #monte carlo
- Memory (and Time) Efficient Sequential Monte Carlo (SHJ, ABC), pp. 514–522.
- ICML-c2-2014-KingmaW
- Efficient Gradient-Based Inference through Transformations between Bayes Nets and Neural Nets (DPK, MW), pp. 1782–1790.
- ICML-c2-2014-LimL #learning #metric #ranking
- Efficient Learning of Mahalanobis Metrics for Ranking (DL, GRGL), pp. 1980–1988.
- ICML-c2-2014-LinK #constraints #learning #representation
- Stable and Efficient Representation Learning with Nonnegativity Constraints (THL, HTK), pp. 1323–1331.
- ICML-c2-2014-Sohl-DicksteinPG #optimisation #probability #scalability
- Fast large-scale optimization by unifying stochastic gradient and quasi-Newton methods (JSD, BP, SG), pp. 604–612.
- ICML-c2-2014-WeiIB #multi
- Fast Multi-stage Submodular Maximization (KW, RKI, JAB), pp. 1494–1502.
- ICPR-2014-AhmetovicBGM #locality #named #precise
- ZebraRecognizer: Efficient and Precise Localization of Pedestrian Crossings (DA, CB, AG, SM), pp. 2566–2571.
- ICPR-2014-Ahn #adaptation #online #robust
- Fast Adaptive Robust Subspace Tracking for Online Background Subtraction (JHA), pp. 2555–2559.
- ICPR-2014-BartoliLKBB #adaptation #detection #multi
- Unsupervised Scene Adaptation for Faster Multi-scale Pedestrian Detection (FB, GL, SK, ADB, ADB), pp. 3534–3539.
- ICPR-2014-BorgiLEA #named #recognition
- ShearFace: Efficient Extraction of Anisotropic Features for Face Recognition (MAB, DL, ME, CBA), pp. 1806–1811.
- ICPR-2014-BougueliaBB #classification #data type #detection #novel
- Efficient Active Novel Class Detection for Data Stream Classification (MRB, YB, AB), pp. 2826–2831.
- ICPR-2014-ChandrasekharTMLLL #clustering #graph #incremental #retrieval #streaming #video
- Incremental Graph Clustering for Efficient Retrieval from Streaming Egocentric Video Data (VC, CT, WM, LL, XL, JHL), pp. 2631–2636.
- ICPR-2014-Desrosiers #adaptation #approach #image #random #segmentation
- A Fast and Adaptive Random Walks Approach for the Unsupervised Segmentation of Natural Images (CD), pp. 130–135.
- ICPR-2014-EikvilH #automation #evaluation #identification
- Evaluation of Binary Descriptors for Fast and Fully Automatic Identification (LE, MH), pp. 154–159.
- ICPR-2014-HavaeiJL #classification #interactive #segmentation
- Efficient Interactive Brain Tumor Segmentation as Within-Brain kNN Classification (MH, PMJ, HL), pp. 556–561.
- ICPR-2014-HiltunenELK #comparison
- Comparison of General Object Trackers for Hand Tracking in High-Speed Videos (VH, TE, LL, HK), pp. 2215–2220.
- ICPR-2014-HtikeH #adaptation #detection #video
- Efficient Non-iterative Domain Adaptation of Pedestrian Detectors to Video Scenes (KKH, DCH), pp. 654–659.
- ICPR-2014-HuangCZ
- An Improved Filtering for Fast Stereo Matching (XH, GC, YZ), pp. 2448–2452.
- ICPR-2014-IshaqEW #evaluation
- An Evaluation of the Faster STORM Method for Super-resolution Microscopy (OI, JE, CW), pp. 4435–4440.
- ICPR-2014-KasturiGRPKHRZSAPAKCKEVPI #algorithm #evaluation #recognition
- Performance Evaluation of Neuromorphic-Vision Object Recognition Algorithms (RK, DBG, ER, GAP, EK, DH, YR, QZ, RS, MA, MP, MA, DK, YC, KK, LE, RCV, DFP, LI), pp. 2401–2406.
- ICPR-2014-LiewY #detection #feature model #novel #robust
- Generalized BRIEF: A Novel Fast Feature Extraction Method for Robust Hand Detection (CFL, TY), pp. 3014–3019.
- ICPR-2014-MajtnerSS #image #named
- RSURF — The Efficient Texture-Based Descriptor for Fluorescence Microscopy Images of HEP-2 Cells (TM, RS, DS), pp. 1194–1199.
- ICPR-2014-MarteauGR #gesture #kernel #recognition
- Down-sampling Coupled to Elastic Kernel Machines for Efficient Recognition of Isolated Gestures (PFM, SG, CR), pp. 363–368.
- ICPR-2014-MasselliZ #approach #geometry #problem
- A New Geometric Approach for Faster Solving the Perspective-Three-Point Problem (AM, AZ), pp. 2119–2124.
- ICPR-2014-MehriMHGMM #benchmark #documentation #evaluation #metric #set
- Performance Evaluation and Benchmarking of Six Texture-Based Feature Sets for Segmenting Historical Documents (MM, MM, PH, PGK, MAM, RM), pp. 2885–2890.
- ICPR-2014-MicoO #algorithm
- Dynamic Insertions in TLAESA Fast NN Search Algorithm (LM, JO), pp. 3828–3833.
- ICPR-2014-MoyouIP #3d #estimation #retrieval #using
- LBO-Shape Densities: Efficient 3D Shape Retrieval Using Wavelet Density Estimation (MM, KEI, AMP), pp. 52–57.
- ICPR-2014-NegrelPG #image #learning #metric #reduction #retrieval #using
- Efficient Metric Learning Based Dimension Reduction Using Sparse Projectors for Image Near Duplicate Retrieval (RN, DP, PHG), pp. 738–743.
- ICPR-2014-OuyangYLW #robust
- A FAST Extreme Illumination Robust Feature in Affine Space (PO, SY, LL, SW), pp. 2365–2370.
- ICPR-2014-PatriciaTC #adaptation #learning #multi
- Multi-source Adaptive Learning for Fast Control of Prosthetics Hand (NP, TT, BC), pp. 2769–2774.
- ICPR-2014-RavalTJ #classification #encoding #evaluation #fault #using
- Efficient Evaluation of SVM Classifiers Using Error Space Encoding (NR, RVT, CVJ), pp. 4411–4416.
- ICPR-2014-RothermelHWB #generative #modelling #robust #semantics #video
- Fast and Robust Generation of Semantic Urban Terrain Models from UAV Video Streams (MR, NH, KW, DB), pp. 592–597.
- ICPR-2014-SatzodaT #estimation #evaluation #metric #on the
- On Performance Evaluation Metrics for Lane Estimation (RKS, MMT), pp. 2625–2630.
- ICPR-2014-Shirakawa #multi #similarity #using
- Fast Similarity Search Using Multiple Binary Codes (SS), pp. 3714–3719.
- ICPR-2014-SongLZC #adaptation #using
- Scale Adaptive Tracking Using Mean Shift and Efficient Feature Matching (YS, SL, JZ, HC), pp. 2233–2238.
- ICPR-2014-TaxSRM #type system
- The Effect of Aggregating Subtype Performances Depends Strongly on the Performance Measure Used (DMJT, HMJS, MJTR, PDM), pp. 3720–3725.
- ICPR-2014-UbukataSTMKMU #detection #image #segmentation
- Fast Human Detection Combining Range Image Segmentation and Local Feature Based Detection (TU, MS, KT, AM, TK, GM, KU), pp. 4281–4286.
- ICPR-2014-WangFH0KH #detection #image
- Fast and Accurate Text Detection in Natural Scene Images with User-Intention (LW, WF, YH, JS, YK, YH), pp. 2920–2925.
- ICPR-2014-WatanabeW #analysis #component #distance #learning #metric
- Logistic Component Analysis for Fast Distance Metric Learning (KW, TW), pp. 1278–1282.
- ICPR-2014-YunJKHC #detection #modelling #self
- Self-Organizing Cascaded Structure of Deformable Part Models for Fast Object Detection (SY, HJ, WSK, BH, JYC), pp. 4246–4250.
- ICPR-2014-ZhaoTHTY #comparison #segmentation
- A Performance Comparison between Circular and Spline-Based Methods for Iris Segmentation (YZ, CT, XH, AOT, RY), pp. 351–356.
- ICPR-2014-ZhenS #evaluation #recognition
- A Performance Evaluation on Action Recognition with Local Features (XZ, LS), pp. 4495–4500.
- ICPR-2014-ZhouIWBPKO #learning
- Transfer Learning of a Temporal Bone Performance Model via Anatomical Feature Registration (YZ, II, SNRW, JB, PP, GK, SO), pp. 1916–1921.
- KDD-2014-ChenCW #classification #scalability
- Fast flux discriminant for large-scale sparse nonlinear classification (WC, YC, KQW), pp. 621–630.
- KDD-2014-Cohen #distance #query
- Distance queries from sampled data: accurate and efficient (EC), pp. 681–690.
- KDD-2014-FangP #algorithm #linear
- Fast DTT: a near linear algorithm for decomposing a tensor into factor tensors (XF, RP), pp. 967–976.
- KDD-2014-GongZFY #learning #multi
- Efficient multi-task feature learning with calibration (PG, JZ, WF, JY), pp. 761–770.
- KDD-2014-LiuWY #algorithm
- An efficient algorithm for weak hierarchical lasso (YL, JW, JY), pp. 283–292.
- KDD-2014-LiZCS #optimisation #probability
- Efficient mini-batch training for stochastic optimization (ML, TZ, YC, AJS), pp. 661–670.
- KDD-2014-MaeharaKK
- Efficient SimRank computation via linearizationPublication of this article pending inquiry (TM, MK, KiK), pp. 1426–1435.
- KDD-2014-PrabhuV #classification #learning #multi #named
- FastXML: a fast, accurate and stable tree-classifier for extreme multi-label learning (YP, MV), pp. 263–272.
- KDD-2014-PurohitPKZS #network #scalability
- Fast influence-based coarsening for large networks (MP, BAP, CK, YZ, VSS), pp. 1296–1305.
- KDD-2014-TongCC #named #topic
- TCS: efficient topic discovery over crowd-oriented service data (YT, CCC, LC), pp. 861–870.
- KDD-2014-ZhaoLC
- Safe and efficient screening for sparse support vector machine (ZZ, JL, JC), pp. 542–551.
KDIR-2014-ChakrabortyGR #approach #retrieval #word- A Word Association Based Approach for Improving Retrieval Performance from Noisy OCRed Text (AC, KG, UR), pp. 450–456.
- KDIR-2014-PlansangketG #evaluation #query #retrieval #state of the art
- Performance Evaluation of State-of-the-Art Ranked Retrieval Methods and Their Combinations for Query Suggestion (SP, JQG), pp. 141–148.
KEOD-2014-BellCBB #ontology- Reasoner Performance on Ontologies for Operations (SB, JC, MB, RPB), pp. 304–311.
KMIS-2014-KimKO - System Improvement for the Management of Subcontracted Service Performance Information in Korea’s Public Construction (SJK, NK, HO), pp. 382–386.
- KMIS-2014-ToureAD #approach #enterprise #named
- AM2O — An Efficient Approach for Managing Training in Enterprise (FT, EA, KD), pp. 405–412.
KR-2014-SazonauSB #owl #predict #question- Predicting Performance of OWL Reasoners: Locally or Globally? (VS, US, GB).
- MLDM-2014-AndreaSVU #detection
- A New Measure of Outlier Detection Performance (KA, GS, NV, AU), pp. 190–197.
- MLDM-2014-BugaychenkoZ #diagrams #learning #multi #pattern matching #pattern recognition #recognition #using
- Fast Pattern Recognition and Deep Learning Using Multi-Rooted Binary Decision Diagrams (DB, DZ), pp. 73–77.
- MLDM-2014-FuMD #classification #multi #network #towards
- Towards the Efficient Recovery of General Multi-Dimensional Bayesian Network Classifier (SF, SM, MCD), pp. 16–30.
- MLDM-2014-JayabalR #clustering #modelling #student
- Clustering Students Based on Student’s Performance — A Partial Least Squares Path Modeling (PLS-PM) Study (YJ, CR), pp. 393–407.
- MLDM-2014-ShahamSB #fault
- Efficient Error Setting for Subspace Miners (ES, DS, BBM), pp. 1–15.
- SEKE-2014-ChenHQJ #static analysis #using
- Improving Static Analysis Performance Using Rule-Filtering Technique (DC, RH, BQ, SJ), pp. 19–24.
- SEKE-2014-GrieblerAF #architecture #evaluation #interface #manycore #parallel #programming #usability
- Performance and Usability Evaluation of a Pattern-Oriented Parallel Programming Interface for Multi-Core Architectures (DG, DA, LGF), pp. 25–30.
- SEKE-2014-RockHW #benchmark #challenge #comparison #evaluation #framework #metric
- Performance Benchmarking of BPEL Engines: A Comparison Framework, Status Quo Evaluation and Challenges (CR, SH, GW), pp. 31–34.
- SEKE-2014-SchotsRS #analysis #process
- A Body of Knowledge for Executing Performance Analysis of Software Processes (NCLS, ARR, GS), pp. 560–565.
- SEKE-2014-WangKN #classification #fault #metric #predict
- Choosing the Best Classification Performance Metric for Wrapper-based Software Metric Selection for Defect Prediction (HW, TMK, AN), pp. 540–545.
- SEKE-2014-WanZWS #analysis #graph #points-to
- Efficient Points-To Analysis for Partial Call Graph Construction (ZW, BZ, YW, YS), pp. 416–421.
- SIGIR-2014-ArkhipovaG #mobile #web
- Evaluating mobile web search performance by taking good abandonment into account (OA, LG), pp. 1043–1046.
- SIGIR-2014-CambazogluB #challenge #scalability #web
- Scalability and efficiency challenges in large-scale web search engines (BBC, RABY), p. 1285.
- SIGIR-2014-KatzSKSR #predict #query
- Wikipedia-based query performance prediction (GK, AS, OK, BS, LR), pp. 1235–1238.
- SIGIR-2014-PerezJ #microblog #predict #query #retrieval
- Predicting query performance in microblog retrieval (JARP, JMJ), pp. 1183–1186.
- SIGIR-2014-RavivKC #predict #query #retrieval
- Query performance prediction for entity retrieval (HR, OK, DC), pp. 1099–1102.
- SIGIR-2014-YuWYTLZ #retrieval #taxonomy
- Discriminative coupled dictionary hashing for fast cross-media retrieval (ZY, FW, YY, QT, JL, YZ), pp. 395–404.
- SIGIR-2014-ZhangWRS #recommendation
- Preference preserving hashing for efficient recommendation (ZZ, QW, LR, LS), pp. 183–192.
- SKY-2014-ExmanN #network #recommendation #social
- Location-based Fast Recommendation Social Network (IE, EN), pp. 55–62.
- ECMFA-2014-AnjorinRDS #graph grammar
- Efficient Model Synchronization with View Triple Graph Grammars (AA, SR, FD, AS), pp. 1–17.
- ECOOP-2014-LavoieDF #javascript #monitoring #runtime #using #virtual machine
- Portable and Efficient Run-time Monitoring of JavaScript Applications Using Virtual Machine Layering (EL, BD, MF), pp. 541–566.
- OOPSLA-2014-JonnalageddaCSRO #combinator #parsing #staged
- Staged parser combinators for efficient data processing (MJ, TC, SS, TR, MO), pp. 637–653.
- OOPSLA-2014-KumarH #compilation #matlab #named
- MIX10: compiling MATLAB to X10 for high performance (VK, LJH), pp. 617–636.
- OOPSLA-2014-ShahriyarBM #garbage collection
- Fast conservative garbage collection (RS, SMB, KSM), pp. 121–139.
- OOPSLA-2014-SongL #debugging #problem #statistics
- Statistical debugging for real-world performance problems (LS, SL), pp. 561–578.
- OOPSLA-2014-SteeleLF #generative #pseudo
- Fast splittable pseudorandom number generators (GLSJ, DL, CHF), pp. 453–472.
- OOPSLA-2014-ZhangXZYS #alias #analysis #c
- Efficient subcubic alias analysis for C (QZ, XX, CZ, HY, ZS), pp. 829–845.
- PADL-2014-AreiasR #correctness #logic programming #on the #source code
- On the Correctness and Efficiency of Lock-Free Expandable Tries for Tabled Logic Programs (MA, RR), pp. 168–183.
- PEPM-2014-KerneisSH #continuation #named #static analysis
- QEMU/CPC: static analysis and CPS conversion for safe, portable, and efficient coroutines (GK, CS, SH), pp. 83–94.
- PLDI-2014-AhnCSGT #javascript #type system
- Improving JavaScript performance by deconstructing the type system (WA, JC, TS, MJG, JT), p. 51.
- PLDI-2014-BiswasHSB #named #precise
- DoubleChecker: efficient sound and precise atomicity checking (SB, JH, AS, MDB), p. 6.
- PLDI-2014-DAntoniVLM #named #transducer
- Fast: a transducer-based language for tree manipulation (LD, MV, BL, DM), p. 40.
- PLDI-2014-SridharanGS #adaptation #execution #parallel #source code
- Adaptive, efficient, parallel execution of parallel programs (SS, GG, GSS), p. 21.
- PPDP-2014-KranzS #compilation #domain-specific language #functional #integration #legacy
- Structure-Preserving Compilation: Efficient Integration of Functional DSLs into Legacy Systems (JK, AS), pp. 187–198.
- QAPL-2014-TschaikowskiT #algebra #biology #difference #process
- Extended Differential Aggregations in Process Algebra for Performance and Biology (MT, MT), pp. 34–47.
RE-2014-LaueHBN #communication #visual notation- Efficient visual notations for efficient stakeholder communication (RL, FH, BB, MN), pp. 329–330.
- RE-2014-WohlrabGKB #experience #industrial #requirements
- Experience of pragmatically combining RE methods for performance requirements in industry (RW, TdG, AK, SB), pp. 344–353.
- REFSQ-2014-Condori-FernandezESDG #collaboration #interactive #requirements #validation
- Analyzing the Effect of the Collaborative Interactions on Performance of Requirements Validation (NCF, SE, KS, MD, AG), pp. 216–231.
- REFSQ-2014-RiegelD #analysis #elicitation #heuristic #optimisation
- An Analysis of Priority-Based Decision Heuristics for Optimizing Elicitation Efficiency (NR, JD), pp. 268–284.
- REFSQ-2014-SethiaP #analysis #elicitation #empirical #requirements
- The Effects of Requirements Elicitation Issues on Software Project Performance: An Empirical Analysis (NKS, ASP), pp. 285–300.
- ASE-2014-HarmanJMP #effectiveness #empirical #higher-order
- Angels and monsters: an empirical investigation of potential test effectiveness and efficiency improvement from strongly subsuming higher order mutation (MH, YJ, PRM, MP), pp. 397–408.
- ASE-2014-MarkerBG #comprehension #heuristic
- Understanding performance stairs: elucidating heuristics (BM, DSB, RAvdG), pp. 301–312.
- ASE-2014-TarvoR #analysis #automation #modelling #parallel #source code #thread
- Automated analysis of multithreaded programs for performance modeling (AT, SPR), pp. 7–18.
- FSE-2014-Banerjee #energy #static analysis #testing
- Static analysis driven performance and energy testing (AB), pp. 791–794.
- FSE-2014-BohmeP #automation #on the #testing
- On the efficiency of automated testing (MB, SP), pp. 632–642.
- FSE-2014-GulwaniRZ #feedback #generative #problem #programming
- Feedback generation for performance problems in introductory programming assignments (SG, IR, FZ), pp. 41–51.
- FSE-2014-JoinerRJDG #policy #weaving
- Efficient runtime-enforcement techniques for policy weaving (RJ, TWR, SJ, MD, VG), pp. 224–234.
- FSE-2014-LerchHBM #analysis #named #scalability
- FlowTwist: efficient context-sensitive inside-out taint analysis for large codebases (JL, BH, EB, MM), pp. 98–108.
- ICSE-2014-ChenSJHNF #anti #detection #using
- Detecting performance anti-patterns for applications developed using object-relational mapping (THC, WS, ZMJ, AEH, MNN, PF), pp. 1001–1012.
- ICSE-2014-HuangMSZ #analysis #testing
- Performance regression testing target prioritization via performance risk analysis (PH, XM, DS, YZ), pp. 60–71.
- ICSE-2014-IgnatievJM #optimisation #towards
- Towards efficient optimization in package management systems (AI, MJ, JMS), pp. 745–755.
- ICSE-2014-LiTH #energy #smarttech #web
- Making web applications more energy efficient for OLED smartphones (DL, AHT, WGJH), pp. 527–538.
- ICSE-2014-LiuXC #debugging #detection #smarttech
- Characterizing and detecting performance bugs for smartphone applications (YL, CX, SCC), pp. 1013–1024.
- SAC-2014-AhmedWK #clustering #energy #named
- EENC — energy efficient nested clustering in UASN (SHA, AW, DK), pp. 706–710.
- SAC-2014-AndradeRMOCFR #architecture #hybrid #scheduling
- Efficient dynamic scheduling of heterogeneous applications in hybrid architectures (GA, GSR, DM, RSO, EC, RF, LCdR), pp. 866–871.
- SAC-2014-CostaTT #image #named
- MFS-Map: efficient context and content combination to annotate images (AFC, AJMT, CTJ), pp. 945–950.
- SAC-2014-HuangLD #analysis #delivery #modelling #multi #network
- Modeling and analysis on network performance for cloud service delivery with multiple paths (JH, JL, QD), pp. 667–673.
- SAC-2014-NabeezathP #algorithm #detection
- Global value numbering for redundancy detection: a simple and efficient algorithm (SN, VP), pp. 1609–1611.
- SAC-2014-ParkH #analysis #network
- Performance analysis of the golden-SM in the V2V network (MCP, DSH), pp. 1739–1740.
- SAC-2014-PetroccoCPE
- Hiding user content interest while preserving P2P performance (RP, MC, JAP, DHJE), pp. 501–508.
- SAC-2014-RockiBS #abstraction #future of #programming #question
- The future of accelerator programming: abstraction, performance or can we have both? (KR, MB, RS), pp. 886–895.
- SAC-2014-SerranoG
- Locking fast (MS, JG), pp. 1556–1561.
- SAC-2014-SilveiraMGCFR #energy
- Faster seam carving with minimum energy windows (CLBS, FdOM, LGJ, CAdC, KF, RdRR), pp. 45–48.
- SAC-2014-SpiegelJA #classification #distance
- Fast time series classification under lucky time warping distance (SS, BJJ, SA), pp. 71–78.
- SAC-2014-TinK #clustering #distributed
- Method for fast clustering of data distributed on a sphere surface (TT, SRK), pp. 1735–1736.
- SAC-2014-WangH #data access #fine-grained
- An I/O scheduler based on fine-grained access patterns to improve SSD performance and lifespan (MW, YH), pp. 1511–1516.
- SAC-2014-WenD #protocol
- Efficient protocols for private record linkage (ZW, CD), pp. 1688–1694.
- GPCE-2014-MaAZS #product line #testing
- Efficient testing of software product lines via centralization (LM, CA, CZ, HS), pp. 49–52.
- GPCE-2014-SteindorferV #memory management
- Code specialization for memory efficient hash tries (MJS, JJV), pp. 11–14.
- SLE-2014-Ridge #combinator #context-free grammar #parsing #using
- Simple, Efficient, Sound and Complete Combinator Parsing for All Context-Free Grammars, Using an Oracle (TR), pp. 261–281.
- ASPLOS-2014-JungCSK #array #named
- Triple-A: a Non-SSD based autonomic all-flash array for high performance storage systems (MJ, WC, JS, MTK), pp. 441–454.
- ASPLOS-2014-KastureS #named #strict
- Ubik: efficient cache sharing with strict qos for latency-critical workloads (HK, DS), pp. 729–742.
- ASPLOS-2014-MenychtasSS #scheduling
- Disengaged scheduling for fair, protected access to fast computational accelerators (KM, KS, MLS), pp. 301–316.
- ASPLOS-2014-YuHZX #execution
- Comprehending performance from real-world execution traces: a device-driver case (XY, SH, DZ, TX), pp. 193–206.
- CASE-2014-BehlNM #named
- IMpACT: Inverse model accuracy and control performance toolbox for buildings (MB, TXN, RM), pp. 1109–1114.
- CASE-2014-CaoMDZ #detection #visual notation
- A gabor based fast interest point detector for image-based robot visual servo control (ZC, FM, JSD, JZ), pp. 883–888.
- CASE-2014-HuiM #assessment #reduction
- Performance assessment of virtual metrology in APC applications for the viability of sampling reductions (KH, JM), pp. 750–755.
- CASE-2014-KaoCC #variability
- Target setting with consideration of target-induced operation variability for performance improvement of semiconductor fabrication (YTK, SCC, CMC), pp. 774–779.
- CASE-2014-KhodabakhshianFW #predict
- Predictive control of the engine cooling system for fuel efficiency improvement (MK, LF, JW), pp. 61–66.
- CASE-2014-LaiTCL #energy #industrial #monitoring
- Non-Intrusive Load Monitoring applied in energy efficiency of the smart manufacturing industry: A case of air-conditioner (YHL, IJT, CYC, CFL), pp. 1127–1132.
- CASE-2014-OhnishiY
- Switching control of DC-DC converters with Electric Double-Layer Capacitor based on control performance index (YO, TY), pp. 188–193.
- CASE-2014-ParidariPSJ #energy #scheduling
- Energy and CO2 efficient scheduling of smart appliances in active houses equipped with batteries (KP, AP, HS, KHJ), pp. 632–639.
- CASE-2014-ParkLH #generative #using
- Trajectory generation method using Bézier spiral curves for high-speed on-road autonomous vehicles (BP, YCL, WYH), pp. 927–932.
- CASE-2014-TanakaT #algorithm #bound #problem
- A faster branch-and-bound algorithm for the block relocation problem (ST, KT), pp. 7–12.
- CASE-2014-ZengXLMS #evaluation
- An analytical model for performance evaluation of operating room schedules in orthopedic surgery (ZZ, XX, JL, HM, SGSR), pp. 570–575.
- CASE-2014-ZhaoLH #evaluation #exponential #multi
- Performance evaluation of multi-product manufacturing systems with asynchronous exponential machines (CZ, JL, NH), pp. 692–697.
- CC-2014-AulerBHMT #adaptation #compilation #crowdsourcing #javascript #jit
- Addressing JavaScript JIT Engines Performance Quirks: A Crowdsourced Adaptive Compiler (RA, EB, PdH, MM, NT), pp. 218–237.
- CC-2014-FeautrierVK #source code
- Improving the Performance of X10 Programs by Clock Removal (PF, EV, AK), pp. 113–132.
- CC-2014-SulzmannS #flexibility #ml #regular expression
- A Flexible and Efficient ML Lexer Tool Based on Extended Regular Expression Submatching (MS, PvS), pp. 174–191.
- CGO-2014-BarikKMLSHNA #c++
- Efficient Mapping of Irregular C++ Applications to Integrated GPUs (RB, RK, DM, BTL, TS, CH, YN, ARAT), p. 33.
- DAC-2014-AmaruGM #algorithm #graph #logic #novel #optimisation
- Majority-Inverter Graph: A Novel Data-Structure and Algorithms for Efficient Logic Optimization (LGA, PEG, GDM), p. 6.
- DAC-2014-AxerTED #bound #network
- Exploiting Shaper Context to Improve Performance Bounds of Ethernet AVB Networks (PA, DT, RE, JD), p. 6.
- DAC-2014-DaviKS #control flow #embedded #fine-grained #towards
- Hardware-Assisted Fine-Grained Control-Flow Integrity: Towards Efficient Protection of Embedded Systems Against Software Exploitation (LD, PK, ARS), p. 6.
- DAC-2014-DengBZW
- An Efficient Two-level DC Operating Points Finder for Transistor Circuits (JD, KB, YZ, NW), p. 6.
- DAC-2014-DongZC #algorithm #online #reduction
- A Cost Efficient Online Algorithm for Automotive Idling Reduction (CD, HZ, MC), p. 6.
- DAC-2014-FangYZL #estimation #named
- BMF-BD: Bayesian Model Fusion on Bernoulli Distribution for Efficient Yield Estimation of Integrated Circuits (CF, FY, XZ, XL), p. 6.
- DAC-2014-HoC #optimisation #pipes and filters
- A New Asynchronous Pipeline Template for Power and Performance Optimization (KHH, YWC), p. 6.
- DAC-2014-LinLCLH #algorithm
- An Efficient Bi-criteria Flow Channel Routing Algorithm For Flow-based Microfluidic Biochips (CXL, CHL, ICC, DTL, TYH), p. 6.
- DAC-2014-LinRGDS #algorithm
- An Efficient Wire Routing and Wire Sizing Algorithm for Weight Minimization of Automotive Systems (CWL, LR, PG, JD, ALSV), p. 6.
- DAC-2014-PanthSDL #3d
- Power-Performance Study of Block-Level Monolithic 3D-ICs Considering Inter-Tier Performance Variations (SP, KS, YD, SKL), p. 6.
- DAC-2014-PengPL #optimisation
- Fast and Accurate Full-chip Extraction and Optimization of TSV-to-Wire Coupling (YP, DP, SKL), p. 6.
- DAC-2014-QiuLX #power management
- Write Mode Aware Loop Tiling for High Performance Low Power Volatile PCM (KQ, QL, CJX), p. 6.
- DAC-2014-RaiHST #detection #fault #framework #realtime
- An Efficient Real Time Fault Detection and Tolerance Framework Validated on the Intel SCC Processor (DR, PH, NS, LT), p. 6.
- DAC-2014-RaoJDBDM #named
- VIX: Virtual Input Crossbar for Efficient Switch Allocation (SR, SJ, RD, DB, RGD, TNM), p. 6.
- DAC-2014-RoyMIT #multi
- Tile Before Multiplication: An Efficient Strategy to Optimize DSP Multiplier for Accelerating Prime Field ECC for NIST Curves (DBR, DM, MI, JT), p. 6.
- DAC-2014-SamalPSSDL #3d #modelling #optimisation
- Fast and Accurate Thermal Modeling and Optimization for Monolithic 3D ICs (SKS, SP, KS, MS, YD, SKL), p. 6.
- DAC-2014-SamavatianAAS #architecture
- An Efficient STT-RAM Last Level Cache Architecture for GPUs (MHS, HA, MA, HSA), p. 6.
- DAC-2014-UbalSMGUCSK #design #reliability
- Exploring the Heterogeneous Design Space for both Performance and Reliability (RU, DS, PM, XG, YU, ZC, GS, DRK), p. 6.
- DAC-2014-WangOC #optimisation #polynomial #synthesis
- Enabling Efficient Analog Synthesis by Coupling Sparse Regression and Polynomial Optimization (YW, MO, CC), p. 6.
- DAC-2014-WangX #on the #simulation
- On the Simulation of NBTI-Induced Performance Degradation Considering Arbitrary Temperature and Voltage Variations (TW, QX), p. 6.
- DAC-2014-WietfeldID #mobile
- Resource Efficient Mobile Communications for Crowd-Sensing (CW, CI, BD), p. 6.
- DATE-2014-0001GWKAWG #optimisation #runtime
- Exploiting expendable process-margins in DRAMs for run-time performance optimization (KC, SG, CW, MK, BA, NW, KG), pp. 1–6.
- DATE-2014-0002LLCXY #big data #data analysis #energy #network
- Energy efficient neural networks for big data analytics (YW, BL, RL, YC, NX, HY), pp. 1–2.
- DATE-2014-AghaeePE #3d
- An efficient temperature-gradient based burn-in technique for 3D stacked ICs (NA, ZP, PE), pp. 1–4.
- DATE-2014-AhmadC #predict #simulation
- Fast STA prediction-based gate-level timing simulation (TBA, MJC), pp. 1–6.
- DATE-2014-AlaghiH #probability #using
- Fast and accurate computation using stochastic circuits (AA, JPH), pp. 1–4.
- DATE-2014-AmaruGM #diagrams
- An efficient manipulation package for Biconditional Binary Decision Diagrams (LGA, PEG, GDM), pp. 1–6.
- DATE-2014-AshammagariMH #configuration management #design #functional #power management
- Exploiting STT-NV technology for reconfigurable, high performance, low power, and low temperature functional unit design (ARA, HM, HH), pp. 1–6.
- DATE-2014-BeuxLOCLTN #named
- Chameleon: Channel efficient Optical Network-on-Chip (SLB, HL, IO, KC, XL, JT, GN), pp. 1–6.
- DATE-2014-BhargavaM #encryption #generative #reliability
- An efficient reliable PUF-based cryptographic key generator in 65nm CMOS (MB, KM), pp. 1–6.
- DATE-2014-ChenCT #simulation
- An activity-sensitive contention delay model for highly efficient deterministic full-system simulations (SYC, CHC, RST), pp. 1–6.
- DATE-2014-ErbSSB #fault #smt
- Efficient SMT-based ATPG for interconnect open defects (DE, KS, MS, BB), pp. 1–6.
- DATE-2014-FourmigueBN #3d #simulation
- Efficient transient thermal simulation of 3D ICs with liquid-cooling and through silicon vias (AF, GB, GN), pp. 1–6.
- DATE-2014-GangopadhyayLNR #adaptation #analysis #linear #modelling
- Modeling and analysis of digital linear dropout regulators with adaptive control for high efficiency under wide dynamic range digital loads (SG, YL, SBN, AR), pp. 1–6.
- DATE-2014-GomonyAG #optimisation #realtime
- Coupling TDM NoC and DRAM controller for cost and performance optimization of real-time systems (MDG, BA, KG), pp. 1–6.
- DATE-2014-Guan0 #analysis #scheduling
- General and efficient Response Time Analysis for EDF scheduling (NG, WY), pp. 1–6.
- DATE-2014-GuerreAL #architecture #benchmark #metric #parallel
- A unified methodology for a fast benchmarking of parallel architecture (AG, JTA, YL), pp. 1–4.
- DATE-2014-HillerS
- Increasing the efficiency of syndrome coding for PUFs with helper data compression (MH, GS), pp. 1–6.
- DATE-2014-HsuCMGB #architecture #named #validation
- ArChiVED: Architectural checking via event digests for high performance validation (CHH, DC, RM, RG, VB), pp. 1–6.
- DATE-2014-Huang
- A high performance SEU-tolerant latch for nanoscale CMOS technology (ZH), pp. 1–5.
- DATE-2014-Huang14a #manycore #network #predict
- Leveraging on-chip networks for efficient prediction on multicore coherence (LH), pp. 1–4.
- DATE-2014-KamalGAP #approximate #using
- Improving efficiency of extensible processors by using approximate custom instructions (MK, AG, AAK, MP), pp. 1–4.
- DATE-2014-KhanSH #architecture #manycore #power management #video
- Software architecture of High Efficiency Video Coding for many-core systems with power-efficient workload balancing (MUKK, MS, JH), pp. 1–6.
- DATE-2014-KimKGH #energy
- Utilization-aware load balancing for the energy efficient operation of the big.LITTLE processor (MK, KK, JRG, SH), pp. 1–4.
- DATE-2014-LuCC #correlation #memory management
- Achieving efficient packet-based memory system by exploiting correlation of memory requests (TL, LC, MC), pp. 1–6.
- DATE-2014-MahmoodPM #reduction #using
- Cache aging reduction with improved performance using dynamically re-sizable cache (HM, MP, EM), pp. 1–6.
- DATE-2014-MineoPAC #adaptation #energy
- An adaptive transmitting power technique for energy efficient mm-wave wireless NoCs (AM, MP, GA, VC), pp. 1–6.
- DATE-2014-MooreC #modelling
- Program affinity performance models for performance and utilization (RWM, BRC), pp. 1–4.
- DATE-2014-MottaghiRD #framework #named #network
- RETLab: A fast design-automation framework for arbitrary RET networks (MDM, AR, CD), pp. 1–6.
- DATE-2014-NawinneSJP
- Hardware-based fast exploration of cache hierarchies in application specific MPSoCs (IN, JS, HJ, SP), pp. 1–6.
- DATE-2014-NoursPB #architecture #evaluation #manycore
- A dynamic computation method for fast and accurate performance evaluation of multi-core architectures (SLN, AP, NWB), pp. 1–6.
- DATE-2014-NovoFIAC #approximate #case study #energy #runtime
- Energy efficient MIMO processing: A case study of opportunistic run-time approximations (DN, NF, PI, UA, FC), pp. 1–6.
- DATE-2014-PalominoSASH #named #video
- hevcDTM: Application-driven Dynamic Thermal Management for High Efficiency Video Coding (DP, MS, HA, AAS, JH), pp. 1–4.
- DATE-2014-QiZ #modelling #simulation
- Efficient simulation and modelling of non-rectangular NoC topologies (JQ, MZ), pp. 1–4.
- DATE-2014-ReinekeW #predict #resource management
- Impact of resource sharing on performance and performance prediction (JR, RW), pp. 1–2.
- DATE-2014-SampaioSZBH #architecture #distributed #energy #memory management #named #video
- dSVM: Energy-efficient distributed Scratchpad Video Memory Architecture for the next-generation High Efficiency Video Coding (FS, MS, BZ, SB, JH), pp. 1–6.
- DATE-2014-SharmaPLAC #composition #data flow #energy
- Energy efficient data flow transformation for Givens Rotation based QR Decomposition (NS, PRP, ML, PA, FC), pp. 1–4.
- DATE-2014-SongDY #analysis #bound #multi #order #parametricity #reduction
- Zonotope-based nonlinear model order reduction for fast performance bound analysis of analog circuits with multiple-interval-valued parameter variations (YS, SMPD, HY), pp. 1–6.
- DATE-2014-Stenstrom #effectiveness #resource management #towards
- Effective resource management towards efficient computing (PS), p. 1.
- DATE-2014-TangZS #design #development
- System-level design methodology enabling fast development of baseband MP-SoC for 4G small cell base station (ST, ZZ, YS), pp. 1–6.
- DATE-2014-Torrellas #architecture #energy
- Extreme-scale computer architecture: Energy efficiency from the ground up‡ (JT), pp. 1–5.
- DATE-2014-Velasco-JimenezCRF #composition #implementation #modelling
- Implementation issues in the hierarchical composition of performance models of analog circuits (MVJ, RCL, ER, FVF), pp. 1–6.
- DATE-2014-VillenaS #analysis #network #variability
- Efficient analysis of variability impact on interconnect lines and resistor networks (JFV, LMS), pp. 1–6.
- DATE-2014-WangYSK #encryption #energy #in memory
- Energy efficient in-memory AES encryption based on nonvolatile domain-wall nanowire (YW, HY, DS, PK), pp. 1–4.
- DATE-2014-WettinMKYPH #evaluation #network
- Performance evaluation of wireless NoCs in presence of irregular network routing strategies (PW, JM, RK, XY, PPP, DHH), pp. 1–6.
- DATE-2014-YamashitaMOT
- A smaller and faster variant of RSM (NY, KM, TO, YT), pp. 1–6.
- DATE-2014-YuSHEAB #estimation #physics
- Efficient performance estimation with very small sample size via physical subspace projection and maximum a posteriori estimation (LY, SS, CH, IME, DAA, DSB), pp. 1–6.
- DATE-2014-ZhangLHCW #multi #predict
- Joint Virtual Probe: Joint exploration of multiple test items’ spatial patterns for efficient silicon characterization and test prediction (SZ, FL, CKH, KTC, HW), pp. 1–6.
- DATE-2014-ZhangYW #analysis #problem
- Efficient high-sigma yield analysis for high dimensional problems (MZ, ZY, YW), pp. 1–6.
- DATE-2014-ZussaDTDMGCT #detection #fault #injection
- Efficiency of a glitch detector against electromagnetic fault injection (LZ, AD, KT, JMD, PM, LGS, JC, AT), pp. 1–6.
- HPCA-2014-ChangLCAWKM
- Improving DRAM performance by parallelizing refreshes with accesses (KKWC, DL, ZC, ARA, CW, YK, OM), pp. 356–367.
- HPCA-2014-ChenZWP #named
- MP3: Minimizing performance penalty for power-gating of Clos network-on-chip (LC, LZ, RW, TMP), pp. 296–307.
- HPCA-2014-ElTantawyMOA #architecture #control flow #gpu #multi #scalability
- A scalable multi-path microarchitecture for efficient GPU control flow (AE, JWM, MO, TMA), pp. 248–259.
- HPCA-2014-FletcherRYDKD #information management #ram #trade-off
- Suppressing the Oblivious RAM timing channel while making information leakage and program efficiency trade-offs (CWF, LR, XY, MvD, OK, SD), pp. 213–224.
- HPCA-2014-HayengaNL #architecture #execution #named
- Revolver: Processor architecture for power efficient loop execution (MH, VRKN, MHL), pp. 591–602.
- HPCA-2014-KarnagelDRLLSL #database #in memory #transaction
- Improving in-memory database index performance with Intel® Transactional Synchronization Extensions (TK, RD, RR, KL, TL, BS, WL), pp. 476–487.
- HPCA-2014-KhanAWMJ #clustering #using
- Improving cache performance using read-write partitioning (SMK, ARA, CW, OM, DAJ), pp. 452–463.
- HPDC-2014-BehzadBWPS #modelling #parallel
- Improving parallel I/O autotuning with performance modeling (BB, SB, SMW, P, MS), pp. 253–256.
- HPDC-2014-ChenDWCZG #communication #distributed #graph #perspective
- Computation and communication efficient graph processing with distributed immutable view (RC, XD, PW, HC, BZ, HG), pp. 215–226.
- HPDC-2014-ChenZJ #community #locality #named #network #online #social
- CBL: exploiting community based locality for efficient content search in online social networks (HC, FZ, HJ), pp. 299–304.
- HPDC-2014-LeeV #compilation #named #research
- OpenARC: open accelerator research compiler for directive-based, efficient heterogeneous computing (SL, JSV), pp. 115–120.
- HPDC-2014-LiZMTZBF #named #online #pipes and filters
- MRONLINE: MapReduce online performance tuning (ML, LZ, SM, JT, LZ, ARB, NF), pp. 165–176.
- HPDC-2014-MittalVL #embedded #energy
- Improving energy efficiency of embedded DRAM caches for high-end computing systems (SM, JSV, DL), pp. 99–110.
- HPDC-2014-PrisacariRHCMH #nearest neighbour #network
- Efficient task placement and routing of nearest neighbor exchanges in dragonfly networks (BP, GR, PH, DC, CM, TH), pp. 129–140.
- HPDC-2014-XueYQHD #concurrent #graph #low cost #named
- Seraph: an efficient, low-cost system for concurrent graph processing (JX, ZY, ZQ, SH, YD), pp. 227–238.
- ISMM-2014-Joisha #scalability
- Sticky tries: fast insertions, fast lookups, no deletions for large key universes (PGJ), pp. 35–46.
- ISMM-2014-RatnakarN #analysis #constraints #graph #points-to
- Push-pull constraint graph for efficient points-to analysis (BR, RN), pp. 25–33.
- LCTES-2014-Guo #co-evolution #data access #design #energy
- Energy efficient data access and storage through HW/SW co-design (MG), p. 83.
- LCTES-2014-LeeLLP #architecture
- Improving performance of loops on DIAM-based VLIW architectures (JL, JL, JL, YP), pp. 135–144.
- LCTES-2014-SpinkWFT #code generation
- Efficient code generation in a region-based dynamic binary translator (TS, HW, BF, NPT), pp. 3–12.
- LCTES-2014-Whalley #data access #energy
- Energy efficient data access techniques (DBW), p. 1.
OSDI-2014-AngelBKOT - End-to-end Performance Isolation Through Virtual Datacenters (SA, HB, TK, GO, ET), pp. 233–248.
- OSDI-2014-ChilimbiSAK #learning #scalability
- Project Adam: Building an Efficient and Scalable Deep Learning Training System (TMC, YS, JA, KK), pp. 571–582.
- OSDI-2014-ChowMFPW #analysis #internet #scalability
- The Mystery Machine: End-to-end Performance Analysis of Large-scale Internet Services (MC, DM, JF, DP, TFW), pp. 217–231.
- OSDI-2014-LeesatapornwongsaHJLG #debugging #model checking #named #semantics
- SAMC: Semantic-Aware Model Checking for Fast Discovery of Deep Bugs in Cloud Systems (TL, MH, PJ, JFL, HSG), pp. 399–414.
- OSDI-2014-ZhengTKL #database #manycore #parallel
- Fast Databases with Fast Durability and Recovery Through Multicore Parallelism (WZ, ST, EK, BL), pp. 465–477.
- PDP-2014-AcostaA #analysis #source code
- Performance Analysis of Paralldroid Generated Programs (AA, FA), pp. 60–67.
- PDP-2014-Al-KhalissiSB #implementation #parallel
- An Efficient Barrier Implementation for OpenMP-Like Parallelism on the Intel SCC (HAK, SAAS, MB), pp. 76–83.
- PDP-2014-AtaeeG #named #protocol #reliability #replication #streaming
- EagleMacaw: A Dual-Tree Replication Protocol for Efficient and Reliable P2P Media Streaming (SA, BG), pp. 112–121.
- PDP-2014-BoobGP #automation #cpu #gpu #parallel
- Automated Instantiation of Heterogeneous Fast Flow CPU/GPU Parallel Pattern Applications in Clouds (SB, HGV, AMP), pp. 162–169.
- PDP-2014-BrownJHSIG #parallel #refactoring #tool support #using
- Agricultural Reform: More Efficient Farming Using Advanced Parallel Refactoring Tools (CB, VJ, KH, HS, KI, CWG), pp. 36–43.
- PDP-2014-ChervenakSGSH #adaptation #resource management #staging #using
- Efficient Data Staging Using Performance-Based Adaptation and Policy-Based Resource Allocation (ALC, AS, JG, RS, NH), pp. 244–247.
- PDP-2014-DalKT #graph #scalability #using
- Fast Diameter Computation of Large Sparse Graphs Using GPUs (GHD, WAK, FWT), pp. 632–639.
- PDP-2014-EinzigerF #named #policy
- TinyLFU: A Highly Efficient Cache Admission Policy (GE, RF), pp. 146–153.
- PDP-2014-Fernandez-CampusanoCL #algorithm
- A Performance Study of Consensus Algorithms in Omission and Crash-Recovery Scenarios (CFC, RC, ML), pp. 240–243.
- PDP-2014-GarzonGGLD #fault tolerance #named
- FT-RUFT: A Performance and Fault-Tolerant Efficient Indirect Topology (DBG, CGR, MEG, PL, JD), pp. 405–409.
- PDP-2014-GrilloRS #compilation #evaluation
- Performance Evaluation of OpenACC Compilers (LG, RR, FdS), pp. 656–663.
- PDP-2014-Hadim #communication #concurrent #multi #network
- The Multi-level Communication: Minimal Deadlock-Free and Storage Efficient Routing for Torus Networks (MBH), pp. 44–51.
- PDP-2014-LakhlefMB #algorithm #configuration management #parallel #self
- Efficient Parallel Self-Reconfiguration Algorithm for MEMS Microrobots (HL, HM, JB), pp. 154–161.
- PDP-2014-RuiCGF #memory management #transaction
- Evaluating the Impact of Transactional Characteristics on the Performance of Transactional Memory Applications (FR, MBC, DG, LGF), pp. 93–97.
- PDP-2014-TesserPDNMM #simulation
- Improving the Performance of Seismic Wave Simulations with Dynamic Load Balancing (RKT, LLP, FD, POAN, JFM, CLM), pp. 196–203.
- PDP-2014-Topa #automaton #gpu #memory management
- Cellular Automata Model Tuned for Efficient Computation on GPU with Global Memory Cache (PT), pp. 380–383.
- PDP-2014-TsujitaYHSNI #file system #parallel #thread
- Multithreaded Two-Phase I/O: Improving Collective MPI-IO Performance on a Lustre File System (YT, KY, AH, MS, MN, YI), pp. 232–235.
- PDP-2014-XavierNR #clustering #comparison #pipes and filters
- A Performance Comparison of Container-Based Virtualization Systems for MapReduce Clusters (MGX, MVN, CAFDR), pp. 299–306.
- PPoPP-2014-BauerTA #named
- Singe: leveraging warp specialization for high performance on GPUs (MB, ST, AA), pp. 119–130.
- PPoPP-2014-ChiangGRS #fault #float
- Efficient search for inputs causing high floating-point errors (WFC, GG, ZR, AS), pp. 43–52.
- PPoPP-2014-CunninghamGHIKMSTT #programming
- Resilient X10: efficient failure-aware programming (DC, DG, BH, AI, KK, HM, VAS, MT, OT), pp. 67–80.
- PPoPP-2014-LiuM #architecture #parallel #source code #thread
- A tool to analyze the performance of multithreaded programs on NUMA architectures (XL, JMMC), pp. 259–272.
- PPoPP-2014-LuZBW #multi #thread
- Efficient deterministic multithreading without global barriers (KL, XZ, TB, XW), pp. 287–300.
- PPoPP-2014-NatarajanM #concurrent
- Fast concurrent lock-free binary search trees (AN, NM), pp. 317–328.
- PPoPP-2014-PetrovicRS #concurrent #hardware #message passing #thread
- Leveraging hardware message passing for efficient thread synchronization (DP, TR, AS), pp. 143–154.
- PPoPP-2014-RaoZ #scheduling #towards #virtual machine
- Towards fair and efficient SMP virtual machine scheduling (JR, XZ), pp. 273–286.
- FASE-2014-KowalST #analysis
- Family-Based Performance Analysis of Variant-Rich Software Systems (MK, IS, MT), pp. 94–108.
- FASE-2014-MudduluruR #abstraction #incremental #static analysis #using
- Efficient Incremental Static Analysis Using Path Abstraction (RM, MKR), pp. 125–139.
- STOC-2014-ChanDSS #approximate #estimation #polynomial
- Efficient density estimation via piecewise polynomial approximation (SoC, ID, RAS, XS), pp. 604–613.
- STOC-2014-DeS #approximate #polynomial
- Efficient deterministic approximate counting for low-degree polynomial threshold functions (AD, RAS), pp. 832–841.
- STOC-2014-DobzinskiNO #interactive
- Economic efficiency requires interaction (SD, NN, SO), pp. 233–242.
- STOC-2014-KrishnaswamyNPS #approximate #clustering #design #energy #network
- Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing (RK, VN, KP, CS), pp. 734–743.
- STOC-2014-PengS #linear #parallel
- An efficient parallel solver for SDD linear systems (RP, DAS), pp. 333–342.
- STOC-2014-Williams14a #complexity
- Faster all-pairs shortest paths via circuit complexity (RW), pp. 664–673.
- ICLP-J-2014-TachmazidisAF #big data #semantics
- Efficient Computation of the Well-Founded Semantics over Big Data (IT, GA, WF), pp. 445–459.
- ICST-2014-BardinKC #execution #symbolic computation #test coverage
- Efficient Leveraging of Symbolic Execution to Advanced Coverage Criteria (SB, NK, FC), pp. 173–182.
- ISSTA-2014-HendersonPYHWZY #analysis #framework #platform
- Make it work, make it right, make it fast: building a platform-neutral whole-system dynamic binary analysis platform (AH, AP, LKY, XH, XW, RZ, HY), pp. 248–258.
- ISSTA-2014-Just #analysis #framework #java #mutation testing #scalability
- The major mutation framework: efficient and scalable mutation analysis for Java (RJ), pp. 433–436.
- ISSTA-2014-JustEF #analysis #clustering #execution #mutation testing
- Efficient mutation analysis by propagating and partitioning infected execution states (RJ, MDE, GF), pp. 315–326.
- ISSTA-2014-NistorR #developer #named #predict #problem #smarttech
- SunCat: helping developers understand and predict performance problems in smartphone applications (AN, LR), pp. 282–292.
- ISSTA-2014-PradelHG #concurrent #testing
- Performance regression testing of concurrent classes (MP, MH, TRG), pp. 13–25.
- ISSTA-2014-Zuo #debugging #statistics
- Efficient statistical debugging via hierarchical instrumentation (ZZ), pp. 457–460.
- ISSTA-2014-ZuoKS #debugging #mining
- Efficient predicated bug signature mining via hierarchical instrumentation (ZZ, SCK, CS), pp. 215–224.
- LICS-CSL-2014-Williams #first-order #graph
- Faster decision of first-order graph properties (RW), p. 6.
- SAT-2014-FinkbeinerT
- Fast DQBF Refutation (BF, LT), pp. 243–251.
- SAT-2014-NewshamGFAS #community #satisfiability
- Impact of Community Structure on SAT Solver Performance (ZN, VG, SF, GA, LS), pp. 252–268.
- SAT-2014-WetzlerHH #named #proving #using
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs (NW, MH, WAHJ), pp. 422–429.
- TAP-2014-KampmannGZ #bound #execution #named #verification
- JTACO: Test Execution for Faster Bounded Verification (AK, JPG, AZ), pp. 134–141.
- CBSE-2013-DruilheAPDS #component #energy
- Components mobility for energy efficiency of digital home (RD, MA, JP, LD, LS), pp. 153–158.
- QoSA-2013-BeckerLB #adaptation #analysis #requirements #self #validation
- Performance analysis of self-adaptive systems for requirements validation at design-time (MB, ML, SB), pp. 43–52.
- QoSA-2013-TrubianiMCAG #analysis #architecture #modelling #nondeterminism
- Model-based performance analysis of software architectures under uncertainty (CT, IM, VC, AA, LG), pp. 69–78.
- DocEng-2013-EsserMS #documentation #information management #smarttech
- Information extraction efficiency of business documents captured with smartphones and tablets (DE, KM, DS), pp. 111–114.
- DocEng-2013-SilvaSMB #on the #xpath
- On the performance of the position() XPath function (LAMdS, LLNdSJ, MM, VB), pp. 229–230.
- DRR-2013-NayefB13a #retrieval
- Efficient symbol retrieval by building a symbol index from a collection of line drawings (NN, TMB).
ICDAR-2013-ChenYL #hybrid #segmentation- Hybrid Page Segmentation with Efficient Whitespace Rectangles Extraction and Grouping (KC, FY, CLL), pp. 958–962.
- ICDAR-2013-Deryagin #evaluation #segmentation
- Unified Performance Evaluation for OCR Zoning: Calculating Page Segmentation’s Score, That Includes Text Zones, Tables and Non-text Objects (DD), pp. 953–957.
- ICDAR-2013-ImpedovoMPBI #classification #effectiveness
- Voronoi Tessellation for Effective and Efficient Handwritten Digit Classification (SI, FMM, GP, DB, DI), pp. 435–439.
- ICDAR-2013-LebourgeoisDGD #documentation #image #segmentation
- Fast Integral MeanShift: Application to Color Segmentation of Document Images (FL, FD, DG, JD), pp. 52–56.
- ICDAR-2013-MondalRRP #kernel #locality #retrieval #word
- A Fast Word Retrieval Technique Based on Kernelized Locality Sensitive Hashing (TM, NR, JYR, UP), pp. 1195–1199.
- ICDAR-2013-NafchiAMC
- An Efficient Ground Truthing Tool for Binarization of Historical Manuscripts (HZN, SMA, RFM, MC), pp. 807–811.
- ICDAR-2013-OliveiraLTFT #algorithm #documentation #image
- An Efficient Algorithm for Segmenting Warped Text-Lines in Document Images (DMO, RDL, GT, JF, MT), pp. 250–254.
- ICDAR-2013-PhamDBR #consistency #geometry #locality #robust
- Robust Symbol Localization Based on Junction Features and Efficient Geometry Consistency Checking (TAP, MD, SB, JYR), pp. 1083–1087.
- ICDAR-2013-Saabni #distance #embedded #image #retrieval #using #word
- Efficient Word Image Retrieval Using Earth Movers Distance Embedded to Wavelets Coefficients Domain (RS), pp. 314–318.
- ICDAR-2013-ToselliV #approach #documentation #word
- Fast HMM-Filler Approach for Key Word Spotting in Handwritten Documents (AHT, EV), pp. 501–505.
- ICDAR-2013-ZhouYL #learning #polynomial #recognition
- GPU-Based Fast Training of Discriminative Learning Quadratic Discriminant Function for Handwritten Chinese Character Recognition (MKZ, FY, CLL), pp. 842–846.
- JCDL-2013-RahnemoonfarP #automation #documentation #evaluation #scalability
- Automatic performance evaluation of dewarping methods in large scale digitization of historical documents (MR, BP), pp. 331–334.
- SIGMOD-2013-AkibaIY #distance #network #query #scalability
- Fast exact shortest-path distance queries on large networks by pruned landmark labeling (TA, YI, YY), pp. 349–360.
- SIGMOD-2013-BorneaDKSDUB #database #rdf #relational
- Building an efficient RDF store over a relational database (MAB, JD, AK, KS, PD, OU, BB), pp. 121–132.
- SIGMOD-2013-ChenCC #query
- An efficient query indexing mechanism for filtering geo-textual data (LC, GC, XC), pp. 749–760.
- SIGMOD-2013-FanXS #adaptation #monitoring #named #realtime
- FAST: differentially private real-time aggregate monitor with filtering and adaptive sampling (LF, LX, VSS), pp. 1065–1068.
- SIGMOD-2013-FinisBK0FM #named #version control
- DeltaNI: an efficient labeling scheme for versioned hierarchical data (JF, RB, AK, TN, FF, NM), pp. 905–916.
- SIGMOD-2013-FujiwaraNSMO #ad hoc #personalisation #rank
- Efficient ad-hoc search for personalized PageRank (YF, MN, HS, TM, MO), pp. 445–456.
- SIGMOD-2013-KimS #algorithm #approximate #string
- Efficient top-k algorithms for approximate substring matching (YK, KS), pp. 385–396.
- SIGMOD-2013-LiP #in memory #memory management #named
- BitWeaving: fast scans for main memory data processing (YL, JMP), pp. 289–300.
- SIGMOD-2013-MishneDLSL #architecture #big data #query #realtime #twitter
- Fast data in the era of big data: Twitter’s real-time related query suggestion architecture (GM, JD, ZL, AS, JL), pp. 1147–1158.
- SIGMOD-2013-MozafariCJM #modelling
- Performance and resource modeling in highly-concurrent OLTP workloads (BM, CC, AJ, SM), pp. 301–312.
- SIGMOD-2013-NarasayyaDSCLP #as a service #multitenancy #relational
- A demonstration of SQLVM: performance isolation in multi-tenant relational database-as-a-service (VRN, SD, MS, SC, FL, HP), pp. 1077–1080.
- SIGMOD-2013-TsytsarauAP #correlation #scalability #sentiment
- Efficient sentiment correlation for large-scale demographics (MT, SAY, TP), pp. 253–264.
- SIGMOD-2013-WoodsTA
- Less watts, more performance: an intelligent storage engine for data appliances (LW, JT, GA), pp. 1073–1076.
- SIGMOD-2013-ZhangYQCL #graph
- I/O efficient: computing SCCs in massive graphs (ZZ, JXY, LQ, LC, XL), pp. 181–192.
- SIGMOD-2013-ZhengJPL #kernel #quality #scalability
- Quality and efficiency for kernel density estimates in large data (YZ, JJ, JMP, FL), pp. 433–444.
- SIGMOD-2013-ZhuZQ #approach #graph #mining
- A direct mining approach to efficient constrained graph pattern discovery (FZ, ZZ, QQ), pp. 821–832.
TPDL-2013-SuchodoletzR #as a service #challenge #requirements- Efficient Access to Emulation-as-a-Service — Challenges and Requirements (DvS, KR), pp. 409–412.
- VLDB-2013-0001SZL
- Efficient Recovery of Missing Events (JW, SS, XZ, XL), pp. 841–852.
- VLDB-2013-0007TR #effectiveness #graph #keyword #probability #query
- Probabilistic Query Rewriting for Efficient and Effective Keyword Search on Graph Data (LZ, TT, AR), pp. 1642–1653.
- VLDB-2013-AchakeevS #multi
- Efficient Bulk Updates on Multiversion B-trees (DA, BS), pp. 1834–1845.
- VLDB-2013-AjiWVLL0S #named #pipes and filters
- Hadoop-GIS: A High Performance Spatial Data Warehousing System over MapReduce (AA, FW, HV, RL, QL, XZ, JHS), pp. 1009–1020.
- VLDB-2013-BambaRHA #geometry #graph #statistics
- Statistics Collection in Oracle Spatial and Graph: Fast Histogram Construction for Complex Geometry Objects (BB, SR, YH, RA), pp. 1021–1032.
- VLDB-2013-Bress #gpu #hybrid #query #why
- Why it is time for a HyPE: A Hybrid Query Processing Engine for Efficient GPU Coprocessing in DBMS (SB), pp. 1398–1403.
- VLDB-2013-CaoB #implementation #quantifier #query #relational
- Efficient Implementation of Generalized Quantification in Relational Query Languages (BC, AB), pp. 241–252.
- VLDB-2013-EldawyM #framework #pipes and filters
- A Demonstration of SpatialHadoop: An Efficient MapReduce Framework for Spatial Data (AE, MFM), pp. 1230–1233.
- VLDB-2013-JinW #reachability #scalability
- Simple, Fast, and Scalable Reachability Oracle (RJ, GW), pp. 1978–1989.
- VLDB-2013-KhanWAY #graph #named #similarity
- NeMa: Fast Graph Search with Label Similarity (AK, YW, CCA, XY), pp. 181–192.
- VLDB-2013-KolaitisPT #consistency #database #integer #programming #query
- Efficient Querying of Inconsistent Databases with Binary Integer Programming (PGK, EP, WCT), pp. 397–408.
- VLDB-2013-Kozak #security #similarity
- Efficiency and Security in Similarity Cloud Services (SK), pp. 1450–1455.
- VLDB-2013-LiC #query
- Efficient Indexing for Diverse Query Results (LL, CYC), pp. 745–756.
- VLDB-2013-LiKHYYS #clustering #memory management #string
- Memory Efficient Minimum Substring Partitioning (YL, PK, FH, SY, XY, SS), pp. 169–180.
- VLDB-2013-LiuSW #query
- A Performance Study of Three Disk-based Structures for Indexing and Querying Frequent Itemsets (GL, AS, LW), pp. 505–516.
- VLDB-2013-Rao0HT #keyword #named
- Bitlist: New Full-text Index for Low Space Cost and Efficient Keyword Search (WR, LC, PH, ST), pp. 1522–1533.
- VLDB-2013-Sellam
- Fast Cartography for Data Explorers (TS), pp. 1456–1461.
- VLDB-2013-SimoesGG #algorithm #approximate #information management #using
- When Speed Has a Price: Fast Information Extraction Using Approximate Algorithms (GS, HG, LG), pp. 1462–1473.
- VLDB-2013-StoicaA #using
- Improving Flash Write Performance by Using Update Frequency (RS, AA), pp. 733–744.
- VLDB-2013-XiaoQ0ITS #query
- Efficient Error-tolerant Query Autocompletion (CX, JQ, WW, YI, KT, KS), pp. 373–384.
- VLDB-2013-XieWBDG #graph
- Fast Iterative Graph Computation with Block Updates (WX, GW, DB, AJD, JG), pp. 2014–2025.
- VLDB-2013-YuanLWJZL #named #rdf #scalability
- TripleBit: a Fast and Compact System for Large Scale RDF Data (PY, PL, BW, HJ, WZ, LL), pp. 517–528.
- VLDB-2013-ZhangHHL #architecture #cpu #gpu #named #parallel #query #towards
- OmniDB: Towards Portable and Efficient Query Processing on Parallel CPU/GPU Architectures (SZ, JH, BH, ML), pp. 1374–1377.
- VLDB-2013-ZhengZF0Z #graph #scalability #similarity
- Efficient SimRank-based Similarity Join Over Large Graphs (WZ, LZ, YF, LC, DZ), pp. 493–504.
- VLDB-2014-CaoR13 #clustering #query
- High Performance Stream Query Processing With Correlation-Aware Partitioning (LC, EAR), pp. 265–276.
- VLDB-2014-DasNLS13 #as a service #cpu #multitenancy #relational
- CPU Sharing Techniques for Performance Isolation in Multitenant Relational Database-as-a-Service (SD, VRN, FL, MS), pp. 37–48.
- VLDB-2014-WangDTZ13 #approximate #effectiveness #n-gram #sequence
- Efficient and Effective KNN Sequence Search with Approximate n-grams (XW, XD, AKHT, ZZ), pp. 1–12.
- ITiCSE-2013-Green
- The fastest man on earth (AG), p. 2.
- ITiCSE-2013-HerreroLOST13a #analysis #empirical
- An empirical analysis of the influence of classmates on the academic performance (CH, ML, JO, JS, ST), p. 328.
- ITiCSE-WGR-2013-UttingTMTBFPCKS #education #fresh look
- A fresh look at novice programmers’ performance and their teachers’ expectations (IU, AET, MM, LT, DJB, RF, JHP, MEC, YBDK, JS, TW), pp. 15–32.
- SIGITE-2013-GodaHM #correlation #predict #self
- Correlation of grade prediction performance and validity of self-evaluation comments (KG, SH, TM), pp. 35–42.
CSMR-2013-GhaithWPM #analysis #detection #independence #testing- Profile-Based, Load-Independent Anomaly Detection and Analysis in Performance Regression Testing of Software Systems (SG, MW, PP, JM), pp. 379–383.
- ICPC-2013-BeckMDR #comprehension #visual notation
- In situ understanding of performance bottlenecks through visually augmented code (FB, OM, SD, GDR), pp. 63–72.
- ICPC-2013-SharafiMSAG #comprehension #empirical #requirements #visual notation
- An empirical study on the efficiency of graphical vs. textual representations in requirements comprehension (ZS, AM, AS, GA, YGG), pp. 33–42.
- ICPC-2013-UddinRS #clone detection #detection #named #scalability
- SimCad: An extensible and faster clone detection tool for large scale software systems (MSU, CKR, KAS), pp. 236–238.
- ICSM-2013-QiML #automation #program repair #testing
- Efficient Automated Program Repair through Fault-Recorded Testing Prioritization (YQ, XM, YL), pp. 180–189.
- ICSM-2013-SyerJNHNF #execution
- Leveraging Performance Counters and Execution Logs to Diagnose Memory-Related Performance Issues (MDS, ZMJ, MN, AEH, MNN, PF), pp. 110–119.
- MSR-2013-JiangAG #case study #how #kernel #linux
- Will my patch make it? and how fast?: case study on the Linux kernel (YJ, BA, DMG), pp. 101–110.
- MSR-2013-NistorJT #debugging
- Discovering, reporting, and fixing performance bugs (AN, TJ, LT), pp. 237–246.
PASTE-2013-YasugiMU #evaluation- A proper performance evaluation system that summarizes code placement effects (MY, YM, TU), pp. 41–48.
WCRE-2013-RaoMK #debugging #framework #incremental #library #locality #retrieval- An incremental update framework for efficient retrieval from software libraries for bug localization (SR, HM, ACK), pp. 62–71.
- ICALP-v1-2013-BringmannF #generative #geometry #graph #random
- Exact and Efficient Generation of Geometric Random Variates and Random Graphs (KB, TF), pp. 267–278.
- ICALP-v1-2013-CyganP #algorithm #bound #graph
- Faster Exponential-Time Algorithms in Graphs of Bounded Average Degree (MC, MP), pp. 364–375.
- ICALP-v2-2013-BachrachP #big data #pseudo #recommendation #sketching #using
- Sketching for Big Data Recommender Systems Using Fast Pseudo-random Fingerprints (YB, EP), pp. 459–471.
- ICALP-v2-2013-CzerwinskiMM #regular expression #sequence
- Efficient Separability of Regular Languages by Subsequences and Suffixes (WC, WM, TM), pp. 150–161.
- ICALP-v2-2013-DereniowskiDKPU #collaboration #graph
- Fast Collaborative Graph Exploration (DD, YD, AK, DP, PU), pp. 520–532.
- ICALP-v2-2013-FuscoPP #learning
- Learning a Ring Cheaply and Fast (EGF, AP, RP), pp. 557–568.
- ICALP-v2-2013-HarrisMPRS
- Efficient Computation of Balanced Structures (DGH, EM, GP, PR, AS), pp. 581–593.
- ICALP-v2-2013-PettieS #algorithm #distributed #graph
- Fast Distributed Coloring Algorithms for Triangle-Free Graphs (SP, HHS), pp. 681–693.
- LATA-2013-HaberHMMR #regular expression
- Efficient Submatch Extraction for Practical Regular Expressions (SH, WH, PKM, MM, PR), pp. 323–334.
- Haskell-2013-AnknerS #approach #haskell #programming
- An EDSL approach to high performance Haskell programming (JA, JS), pp. 1–12.
- ICFP-2013-BernardyC #context-free grammar #divide and conquer #parsing
- Efficient divide-and-conquer parsing of practical context-free languages (JPB, KC), pp. 111–122.
- IFL-2013-GrelckW #adaptation #array #functional #generative
- Next Generation Asynchronous Adaptive Specialization for Data-Parallel Functional Array Processing in SAC: Accelerating the Availability of Specialized High Performance Code (CG, HW), p. 117.
- FDG-2013-CaplarSM #analysis #case study #rating
- Analysis of players' in-game performance vs rating: Case study of Heroes of Newerth (NC, MS, MM), pp. 237–244.
- FDG-2013-KoutsourasC
- User-generated content as cues for performance in LittleBigPlanet (PK, PAC), pp. 372–375.
- VS-Games-2013-DettmarSHBB #3d #game studies #persistent #simulation
- Efficient Mesoscopic Simulations for Persistent Agents in 3D-Applications and Games (TD, SS, RH, PB0, CB), pp. 1–8.
GCM-J-2012-SmolenovaKC #graph grammar #parallel- Parallel Graph Grammars with Instantiation Rules Allow Efficient Structural Factorization of Virtual Vegetation (KS, WK, PHC).
- CHI-2013-AndersonB #gesture #learning
- Learning and performance with gesture guides (FA, WFB), pp. 1109–1118.
- CHI-2013-FindlaterFFWD #difference
- Age-related differences in performance with touchscreens compared to traditional mouse input (LF, JF, KF, JOW, TD), pp. 343–346.
- CHI-2013-FuccellaIM #editing #gesture #mobile #multi
- Gestures and widgets: performance in text editing on multi-touch capable mobile devices (VF, PI, BM), pp. 2785–2794.
- CHI-2013-HogganWONKL #gesture #multi
- Multi-touch rotation gestures: performance and ergonomics (EH, JW, AO, MAN, POK, AL), pp. 3047–3050.
- CHI-2013-HookMWO #design #named
- Waves: exploring idiographic design for live performance (JH, JCM, PCW, PO), pp. 2969–2978.
- CHI-2013-JansenDF #physics #visualisation
- Evaluating the efficiency of physical visualizations (YJ, PD, JDF), pp. 2593–2602.
- CHI-2013-JotaNDW #case study #how #latency
- How fast is fast enough?: a study of the effects of latency in direct-touch pointing tasks (RJ, AN, PD, DW), pp. 2291–2300.
- CHI-2013-KaufmannA #interactive #memory management #navigation
- Studying spatial memory and map navigation performance on projector phones with peephole interaction (BK, DA), pp. 3173–3176.
- CHI-2013-KomarovRG #crowdsourcing #user interface
- Crowdsourcing performance evaluations of user interfaces (SK, KR, KZG), pp. 207–216.
- CHI-2013-LeitnerPLRH #gesture #named #scalability
- Kolibri: tiny and fast gestures for large pen-based surfaces (JL, FP, CL, CR, MH), pp. 1789–1798.
- CHI-2013-NicholsonCB #authentication
- Age-related performance issues for PIN and face-based authentication systems (JN, LMC, PB), pp. 323–332.
- CHI-2013-ScarrCGM #consistency #interface #robust #testing
- Testing the robustness and performance of spatially consistent interfaces (JS, AC, CG, SM), pp. 3139–3148.
- CHI-2013-SunLFK0 #architecture #interface #multi #sketching
- A multi-touch interface for fast architectural sketching and massing (QS, JL, CWF, SK, YH), pp. 247–256.
- CHI-2013-ZhaoSNAVC #facebook #social #social media
- The many faces of facebook: experiencing social media as performance, exhibition, and personal archive (XZ, NS, SN, SA, SV, DC), pp. 1–10.
- DHM-HB-2013-BurfordBCKME
- The Effect of Dynamic Workstations on the Performance of Various Computer and Office-Based Tasks (EMB, JB, DC, RK, SHvM, RPE), pp. 205–212.
- DHM-HB-2013-KimATBHJ #process #type system
- The Effects of Touch Screen Virtual Keyboard Key Sizes on Typing Performance, Typing Biomechanics and Muscle Activity (JHK, LSA, OT, MCB, CAH, PWJ), pp. 239–244.
- DHM-SET-2013-GoreM #approach #modelling #validation
- A Validation Approach for Complex NextGen Air Traffic Control Human Performance Models (BFG, PM), pp. 28–37.
- DHM-SET-2013-ZhangX #modelling
- Pilot Performance Models (XZ, HX), pp. 134–140.
- DUXU-CXC-2013-Abdelnour-NoceraAMM #education #evaluation #human-computer #student
- A Cross-Cultural Evaluation of HCI Student Performance — Reflections for the Curriculum (JLAN, AA, MM, SM), pp. 161–170.
- DUXU-CXC-2013-MakanawalaGGL #gamification
- Applying Gamification in Customer Service Application to Improve Agents’ Efficiency and Satisfaction (PM, JG, EG, HL), pp. 548–557.
- DUXU-CXC-2013-SturmSG #locality
- Localization beyond National Characteristics: The Impact of Language on Users’ Performance with Different Menu Structures (CS, GS, SG), pp. 105–114.
- DUXU-CXC-2013-WangTKS #evaluation #eye tracking #predict
- Banner Evaluation Predicted by Eye Tracking Performance and the Median Thinking Style (MYW, DLT, CTK, VCS), pp. 129–138.
- DUXU-NTE-2013-Gyoda #ad hoc #analysis #communication #evaluation #network
- Analysis and Evaluation of Wireless Ad Hoc Network Performance for a Disaster Communication Model and Scenarios (KG), pp. 65–74.
- DUXU-NTE-2013-ParkK #representation
- Efficient Information Representation Method for Driver-Centered AR-HUD System (HP, KhK), pp. 393–400.
- DUXU-WM-2013-BohmS #design #energy #mobile #smarttech
- Smart Metering with Smartphones: User-Centered Design of a Mobile Application in the Context of Energy Efficiency (SB, LS), pp. 631–640.
- DUXU-WM-2013-ShenP
- Re-thinking Bookmark Management — Less Choice Is More Efficient (STS, SDP), pp. 304–312.
- DUXU-WM-2013-WilliamsGMW #approach #enterprise
- A User Centred Approach to Determining the Impact of Faster Broadband on Small and Medium Sized Enterprises (DW, AG, JM, JW), pp. 140–149.
- DUXU-WM-2013-Yuan13a #information management #visualisation
- Investigating the Effect of Visualization on User Performance of Information Systems (XY), pp. 591–600.
- DUXU-WM-2013-YuanCZAX #visualisation
- Effects of Domain Knowledge on User Performance and Perception in a Knowledge Domain Visualization System (XJY, CC, XZ, JMA, TX), pp. 601–610.
- HCI-AS-2013-HelmbrechtBV #adaptation
- Adaptations in Driving Efficiency with Electric Vehicles (MH, KB, RV), pp. 578–585.
- HCI-AS-2013-NouriCZ #case study #collaboration #learning #mobile
- Mobile Inquiry-Based Learning — A Study of Collaborative Scaffolding and Performance (JN, TCP, KZ), pp. 464–473.
- HCI-III-2013-LiLL #algorithm
- Fast Dynamic Channel Allocation Algorithm for TD-HSPA System (HL, HLL, XL), pp. 82–91.
- HCI-III-2013-WangLLD #algorithm #realtime #visual notation
- A New Real-Time Visual SLAM Algorithm Based on the Improved FAST Features (LW, RL, CL, FD), pp. 206–215.
- HCI-IMT-2013-PinoTIK #2d #3d #artificial reality #evaluation #using
- Using Kinect for 2D and 3D Pointing Tasks: Performance Evaluation (AP, ET, NI, GK), pp. 358–367.
- HCI-UC-2013-KellenCF #diagrams #probability #problem
- Improving User Performance in Conditional Probability Problems with Computer-Generated Diagrams (VK, SSC, XF), pp. 183–192.
- HIMI-D-2013-ChangSCH #design #interface #layout #on the #topic
- On the Reading Performance of Text Layout, Switch Position, Topic of Text, and Luminance Contrast for Chinese E-books Interface Design (WTC, LHS, ZC, KCH), pp. 567–575.
- HIMI-D-2013-McCaryZ #comparison #user interface
- GUI Efficiency Comparison Between Windows and Mac (EM, JZ), pp. 97–106.
- HIMI-HSM-2013-ChiangWCH #analysis #smarttech
- An Analysis of Smartphone Size Regarding Operating Performance (ZHC, CCW, ACC, CyH), pp. 363–372.
- HIMI-HSM-2013-JonesJ #design #mobile #navigation
- Assessing the Effects of Mobile OS Design on Single-Step Navigation and Task Performance (BMJ, NJ), pp. 383–390.
- HIMI-HSM-2013-KimuraHTN #evaluation #using
- Determination of Alarm Setpoint for Alarm System Rationalization Using Performance Evaluation (NK, TH, KT, MN), pp. 507–514.
- HIMI-HSM-2013-LeaN #framework #quality #research #usability
- Usability of Performance Dashboards, Usefulness of Operational and Tactical Support, and Quality of Strategic Support: A Research Framework (BRL, FFHN), pp. 116–123.
- HIMI-HSM-2013-Noda #analysis #industrial #monitoring #statistics
- Performance Monitoring of Industrial Plant Alarm Systems by Statistical Analysis of Plant Operation Data (MN), pp. 131–135.
- HIMI-LCCB-2013-KangL #student
- The Display Medium, Academic Major and Sex Effect of High School Students on Visuospatial Abilities Test Performance (YYK, YHL), pp. 70–78.
- HIMI-LCCB-2013-LinL13b #assessment #comprehension #evaluation #mobile #usability
- Usability Evaluation of Comprehension Performance and Subjective Assessment on Mobile Text Advertising (YLL, CHL), pp. 501–510.
VISSOFT-2013-AlcocerBDD #comprehension #evolution- Performance evolution blueprint: Understanding the impact of software evolution on performance (JPSA, AB, SD, MD), pp. 1–9.
- CAiSE-2013-RiemerSS #design
- A Methodology for Designing Events and Patterns in Fast Data Processing (DR, NS, LS), pp. 133–148.
- EDOC-2013-MullerBHKP #database #enterprise #in memory #maintenance
- Efficient View Maintenance for Enterprise Applications in Columnar In-Memory Databases (SM, LB, KH, SK, HP), pp. 249–258.
- EDOC-2013-SuleimanV #modelling
- Modeling Performance of Elasticity Rules for Cloud-Based Applications (BS, SV), pp. 201–206.
- ICEIS-v1-2013-ChiuFW #analysis #collaboration #integration #social
- An Analysis of Supply Chain Collaboration and Its Impact on Firm Performance — An Integration of Social Capital, Justice, and Technology Use (MLC, CYF, ILW), pp. 5–12.
- ICEIS-v1-2013-DiabatAAAF #framework #optimisation
- A Framework for Optimizing the Supply Chain Performance of a Steel Producer (AHD, RAA, MHA, AJA, MNF), pp. 554–562.
- ICEIS-v1-2013-HayashiK #optimisation
- Data Location Optimization Method to Improve Tiered Storage Performance (SH, NK), pp. 112–119.
- ICEIS-v2-2013-Milosz #case study #enterprise #legacy #testing #using
- Performance Testing of New Enterprise Applications using Legacy Load Data — A HIS Case Study (MM), pp. 151–156.
- CIKM-2013-BastB #semantics
- An index for efficient semantic full-text search (HB, BB), pp. 369–378.
- CIKM-2013-DerakhshanSS #data type #streaming
- A new operator for efficient stream-relation join processing in data streaming engines (RD, AS, BS), pp. 793–798.
- CIKM-2013-FinisRABKF #detection #flexibility #named
- RWS-Diff: flexible and efficient change detection in hierarchical data (JPF, MR, NA, RB, AK, FF), pp. 339–348.
- CIKM-2013-GilpinQD #clustering #dataset #scalability
- Efficient hierarchical clustering of large high dimensional datasets (SG, BQ, ID), pp. 1371–1380.
- CIKM-2013-ManiuC #social
- Network-aware search in social tagging applications: instance optimality versus efficiency (SM, BC), pp. 939–948.
- CIKM-2013-MorishimaYTSK #dependence #ranking #web
- Efficient filtering and ranking schemes for finding inclusion dependencies on the web (AM, EY, MT, SS, HK), pp. 763–768.
- CIKM-2013-MullangiR #named #query #reachability #scalability
- SCISSOR: scalable and efficient reachability query processing in time-evolving hierarchies (PRM, LR), pp. 799–804.
- CIKM-2013-NguyenLT #code review #set #using
- Using micro-reviews to select an efficient set of reviews (TSN, HWL, PT), pp. 1067–1076.
- CIKM-2013-ParameswaranKA
- Efficient parsing-based search over structured data (AGP, RK, AA), pp. 49–58.
- CIKM-2013-ParkC #algorithm #graph #pipes and filters #scalability
- An efficient MapReduce algorithm for counting triangles in a very large graph (HMP, CWC), pp. 539–548.
- CIKM-2013-SchneiderV #clustering #random
- Fast parameterless density-based clustering via random projections (JS, MV), pp. 861–866.
- CIKM-2013-WangZS #scalability #similarity
- Weighted hashing for fast large scale similarity search (QW, DZ, LS), pp. 1185–1188.
- CIKM-2013-YuanWJL #clustering #graph #streaming
- Efficient processing of streaming graphs for evolution-aware clustering (MY, KLW, GJS, YL), pp. 319–328.
- CIKM-2013-ZhangLL #privacy #robust #streaming
- An efficient and robust privacy protection technique for massive streaming choice-based information (JZ, XL, YL), pp. 1169–1172.
- CIKM-2013-ZhongLTZ #named #network
- G-tree: an efficient index for KNN search on road networks (RZ, GL, KLT, LZ), pp. 39–48.
- ECIR-2013-AsadiL #documentation #modelling #ranking
- Training Efficient Tree-Based Models for Document Ranking (NA, JL), pp. 146–157.
- ECIR-2013-ChattopadhyayaSS #distance #edit distance #generative
- A Fast Generative Spell Corrector Based on Edit Distance (IC, KS, KS), pp. 404–410.
- ICML-c1-2013-AvronBTZ #analysis #canonical #correlation #reduction
- Efficient Dimensionality Reduction for Canonical Correlation Analysis (HA, CB, ST, AZ), pp. 347–355.
- ICML-c1-2013-BalcanBEL #learning
- Efficient Semi-supervised and Active Learning of Disjunctions (NB, CB, SE, YL), pp. 633–641.
- ICML-c1-2013-GonenSS #approach #learning
- Efficient Active Learning of Halfspaces: an Aggressive Approach (AG, SS, SSS), pp. 480–488.
- ICML-c1-2013-Hennig #optimisation #probability
- Fast Probabilistic Optimization from Noisy Gradients (PH), pp. 62–70.
- ICML-c1-2013-KumarSK #algorithm #matrix
- Fast Conical Hull Algorithms for Near-separable Non-negative Matrix Factorization (AK, VS, PK), pp. 231–239.
- ICML-c1-2013-PeleTGW #classification
- The Pairwise Piecewise-Linear Embedding for Efficient Non-Linear Classification (OP, BT, AG, MW), pp. 205–213.
- ICML-c1-2013-RuvoloE #algorithm #learning #named
- ELLA: An Efficient Lifelong Learning Algorithm (PR, EE), pp. 507–515.
- ICML-c1-2013-XiangTY #feature model #optimisation
- Efficient Sparse Group Feature Selection via Nonconvex Optimization (SX, XT, JY), pp. 284–292.
- ICML-c1-2013-ZhuCPZ #algorithm #modelling #topic
- Gibbs Max-Margin Topic Models with Fast Sampling Algorithms (JZ, NC, HP, BZ), pp. 124–132.
- ICML-c2-2013-WangM
- Fast dropout training (SIW, CDM), pp. 118–126.
- ICML-c3-2013-BiK #classification #multi
- Efficient Multi-label Classification with Many Labels (WB, JTYK), pp. 405–413.
- ICML-c3-2013-BrechtelGD #incremental #learning #representation
- Solving Continuous POMDPs: Value Iteration with Incremental Learning of an Efficient Space Representation (SB, TG, RD), pp. 370–378.
- ICML-c3-2013-BryanM #interactive
- An Efficient Posterior Regularized Latent Variable Model for Interactive Sound Source Separation (NJB, GJM), pp. 208–216.
- ICML-c3-2013-ChenZW #image
- Fast Image Tagging (MC, AXZ, KQW), pp. 1274–1282.
- ICML-c3-2013-CovielloMCL #exclamation
- That was fast! Speeding up NN search of high dimensional distributions (EC, AM, ABC, GRGL), pp. 468–476.
- ICML-c3-2013-IyerJB #optimisation
- Fast Semidifferential-based Submodular Function Optimization (RKI, SJ, JAB), pp. 855–863.
- ICML-c3-2013-Izbicki #algebra #approach #classification #online #parallel
- Algebraic classifiers: a generic approach to fast cross-validation, online training, and parallel training (MI), pp. 648–656.
- ICML-c3-2013-JoseGAV #kernel #learning #predict
- Local Deep Kernel Learning for Efficient Non-linear SVM Prediction (CJ, PG, PA, MV), pp. 486–494.
- ICML-c3-2013-KhanAFS #modelling
- Fast Dual Variational Inference for Non-Conjugate Latent Gaussian Models (MEK, AYA, MPF, MWS), pp. 951–959.
- ICML-c3-2013-Kuleshov #algorithm #analysis #component
- Fast algorithms for sparse principal component analysis based on Rayleigh quotient iteration (VK), pp. 1418–1425.
- ICML-c3-2013-VladymyrovC
- Entropic Affinities: Properties and Efficient Numerical Computation (MV, MÁCP), pp. 477–485.
- ICML-c3-2013-WangK #algorithm #energy
- A Fast and Exact Energy Minimization Algorithm for Cycle MRFs (HW, DK), pp. 190–198.
- ICML-c3-2013-WauthierJJ #ranking
- Efficient Ranking from Pairwise Comparisons (FLW, MIJ, NJ), pp. 109–117.
- ICML-c3-2013-XuZZ #matrix
- Fast Max-Margin Matrix Factorization with Data Augmentation (MX, JZ, BZ), pp. 978–986.
- KDD-2013-BahadoriLX #learning #probability #process
- Fast structure learning in generalized stochastic processes with latent factors (MTB, YL, EPX), pp. 284–292.
- KDD-2013-ChenTTY #analysis #kernel #modelling
- Model-based kernel for efficient time series analysis (HC, FT, PT, XY), pp. 392–400.
- KDD-2013-HanLPL0KY #graph #named #parallel
- TurboGraph: a fast parallel graph engine handling billion-scale graphs in a single PC (WSH, SL, KP, JHL, MSK, JK, HY), pp. 77–85.
- KDD-2013-JhaSP #algorithm #streaming #using
- A space efficient streaming algorithm for triangle counting using the birthday paradox (MJ, CS, AP), pp. 589–597.
- KDD-2013-KleinerTASJ
- A general bootstrap performance diagnostic (AK, AT, SA, IS, MIJ), pp. 419–427.
- KDD-2013-KuangP #clustering #documentation #matrix
- Fast rank-2 nonnegative matrix factorization for hierarchical document clustering (DK, HP), pp. 739–747.
- KDD-2013-LiuCZ #approach #probability
- Summarizing probabilistic frequent patterns: a fast approach (CL, LC, CZ), pp. 527–535.
- KDD-2013-PhamP #kernel #polynomial #scalability
- Fast and scalable polynomial kernels via explicit feature maps (NP, RP), pp. 239–247.
- KDD-2013-YangWFZWY #algorithm #multi #problem
- An efficient ADMM algorithm for multidimensional anisotropic total variation regularization problems (SY, JW, WF, XZ, PW, JY), pp. 641–649.
- KDD-2013-YiCLSY #online #predict
- Predictive model performance: offline and online evaluations (JY, YC, JL, SS, TWY), pp. 1294–1302.
- KDD-2013-ZengJZLLLSZLDLW #data mining #distributed #mining #named
- FIU-Miner: a fast, integrated, and user-friendly system for data mining in distributed environment (CZ, YJ, LZ, JL, LL, HL, CS, WZ, TL, BD, ML, PW), pp. 1506–1509.
- KDD-2013-ZhuXWL #distance #graph #query #scalability
- Efficient single-source shortest path and distance queries on large graphs (ADZ, XX, SW, WL), pp. 998–1006.
- KDD-2013-ZimekGCS #detection #effectiveness
- Subsampling for efficient and effective unsupervised outlier detection ensembles (AZ, MG, RJGBC, JS), pp. 428–436.
- KDIR-KMIS-2013-GonzagaLSO #case study
- Performance Indicators and their Relationship with Organizational Strategy — A Study in Brazilian Companies (RPG, ATMdL, FdAeS, MPVdO), pp. 559–566.
- KDIR-KMIS-2013-StroetmannLOE #difference #information management #quality
- When Measuring Performance Makes the Difference — Quality and Success of a Clinical Knowledge Management Project (BS, AL, AO, OE), pp. 419–425.
- KEOD-2013-LinnenbergMCSF #automation #energy #evaluation #lightweight #named #ontology
- OntoENERGY — A Lightweight Ontology for Supporting Energy-efficiency Tasks — Enabling Generic Evaluation of Energy Efficiency in the Engineering Phase of Automated Manufacturing Plants (TL, AWM, LC, CS, AF), pp. 337–344.
- KEOD-2013-NadarajanYC #framework #multi #ontology #scalability #workflow
- Multiple Ontologies Enhanced with Performance Capabilities to Define Interacting Domains within a Workflow Framework for Analysing Large Undersea Videos (GN, CLY, YHCB), pp. 419–426.
- MLDM-2013-AllahSG #algorithm #array #dataset #mining #scalability
- An Efficient and Scalable Algorithm for Mining Maximal — High Confidence Rules from Microarray Dataset (WZAA, YKES, FFMG), pp. 352–366.
- MLDM-2013-GaoD #data mining #distributed #mining #using
- Improving the Efficiency of Distributed Data Mining Using an Adjustment Work Flow (JG, JD), pp. 69–83.
- MLDM-2013-HuSAD #network #statistics
- Estimating and Forecasting Network Traffic Performance Based on Statistical Patterns Observed in SNMP Data (KH, AS, DA, CD), pp. 601–615.
- MLDM-2013-PrieditisL #bound #classification #problem #using
- When Classification becomes a Problem: Using Branch-and-Bound to Improve Classification Efficiency (AP, ML), pp. 466–480.
- RecSys-2013-Aiolli #dataset #recommendation #scalability
- Efficient top-n recommendation for very large scale binary rated datasets (FA), pp. 273–280.
- RecSys-2013-ZhuangCJL #matrix #memory management #parallel
- A fast parallel SGD for matrix factorization in shared memory systems (YZ, WSC, YCJ, CJL), pp. 249–256.
- SEKE-2013-Bouzar-BenlabiodBB #correlation #process
- An efficient QCL-based alert correlation process (LBB, SB, TBT), pp. 388–393.
- SEKE-2013-KarimM #classification
- Revisiting the Performance of Weighted k-Nearest Centroid Neighbor Classifiers (MRK, MM), pp. 332–337.
- SEKE-2013-LiuWL #analysis #detection #named #online #pointer
- ELCD: an efficient online cycle detection technique for pointer analysis (FL, LW, BL), pp. 606–611.
- SEKE-2013-WangWMX #analysis #how
- How Does Acquirer’s Participation Influence Performance of Software Projects: A Quantitative Analysis (YW, JW, JM, BX), pp. 537–541.
- SIGIR-2013-AlabduljalilTY #optimisation #similarity
- Cache-conscious performance optimization for similarity search (MA, XT, TY), pp. 713–722.
- SIGIR-2013-ArroyueloGOS #documentation #identifier
- Document identifier reassignment and run-length-compressed inverted indexes for improved search performance (DA, SG, MO, VS), pp. 173–182.
- SIGIR-2013-AsadiL #architecture #effectiveness #generative #multi #retrieval #trade-off
- Effectiveness/efficiency tradeoffs for candidate generation in multi-stage retrieval architectures (NA, JL), pp. 997–1000.
- SIGIR-2013-CambazogluB #challenge #scalability #web
- Scalability and efficiency challenges in commercial web search engines (BBC, RABY), p. 1124.
- SIGIR-2013-DemidovaZN #query #scalability
- Efficient query construction for large scale data (ED, XZ, WN), pp. 573–582.
- SIGIR-2013-DimopoulosNS #query
- A candidate filtering mechanism for fast top-k query processing on modern cpus (CD, SN, TS), pp. 723–732.
- SIGIR-2013-KonowNCL
- Faster and smaller inverted indices with treaps (RK, GN, CLAC, ALO), pp. 193–202.
- SIGIR-2013-RossiMCS #query #using
- Fast document-at-a-time query processing using two-tier indexes (CR, ESdM, ALC, ASdS), pp. 183–192.
- SIGIR-2013-TakumaY #bound
- Faster upper bounding of intersection sizes (DT, HY), pp. 703–712.
- SIGIR-2013-WilkieA
- Relating retrievability, performance and length (CW, LA), pp. 937–940.
- SIGIR-2013-WuF #approach #feedback #incremental #pseudo
- An incremental approach to efficient pseudo-relevance feedback (HW, HF), pp. 553–562.
AMT-2013-TichyKL #detection #model transformation #smell- Detecting Performance Bad Smells for Henshin Model Transformations (MT, CK, GL), pp. 82–91.
- ICMT-2013-LepperT #validation
- Fragmented Validation: A Simple and Efficient Contribution to XSLT Checking (ML, BTyW), pp. 54–55.
- ICMT-2013-RentschlerNHR #interactive #maintenance #model transformation #visual notation
- Interactive Visual Analytics for Efficient Maintenance of Model Transformations (AR, QN, LH, RHR), pp. 141–157.
- SPLC-2013-MyllarniemiSM #case study #product line #variability
- Performance variability in software product lines: a case study in the telecommunication domain (VM, JS, TM), pp. 32–41.
- OOPSLA-2013-Deng0L #detection
- Efficient concurrency-bug detection across inputs (DD, WZ, SL), pp. 785–802.
- OOPSLA-2013-HuangB #analysis #context-sensitive grammar #memory management
- Efficient context sensitivity for dynamic analyses via calling context uptrees and customized memory management (JH, MDB), pp. 53–72.
- OOPSLA-2013-KansalSBMMZ #abstraction #energy #latency #mobile
- The latency, accuracy, and battery (LAB) abstraction: programmer productivity and energy efficiency for continuous mobile context sensing (AK, TSS, AJBB, KSM, TM, RZ), pp. 661–676.
- OOPSLA-2013-MillerHBO #combinator #generative #object-oriented
- Instant pickles: generating object-oriented pickler combinators for fast and extensible serialization (HM, PH, EB, MO), pp. 183–202.
- PADL-2013-0004R #implementation #on the
- On the Efficient Implementation of Mode-Directed Tabling (JS, RR), pp. 141–156.
- PADL-2013-MachadoAD #declarative #parallel #programming #using
- Parallel Performance of Declarative Programming Using a PGAS Model (RM, SA, DD), pp. 244–260.
- PADL-2013-Moura #implementation #induction #logic programming
- A Portable and Efficient Implementation of Coinductive Logic Programming (PM), pp. 77–92.
- PEPM-2013-MartinezVP #compilation #exclamation #haskell
- Just do it while compiling!: fast extensible records in haskell (BM, MV, AP), pp. 77–86.
- PLDI-2013-JohnsonOZA #dependence #graph
- Fast condensation of the program dependence graph (NPJ, TO, AZ, DIA), pp. 39–50.
- PLDI-2013-RajaramNSE #implementation #semantics
- Fast RMWs for TSO: semantics and implementation (BR, VN, SS, ME), pp. 61–72.
- PLDI-2013-ZhangLYS #algorithm #alias #analysis
- Fast algorithms for Dyck-CFL-reachability with applications to alias analysis (QZ, MRL, HY, ZS), pp. 435–446.
- PPDP-2013-PinoBV #concurrent #confluence #constraints #equivalence #programming
- Efficient computation of program equivalence for confluent concurrent constraint programming (LFP, FB, FDV), pp. 263–274.
- SAS-2013-FouilheMP #abstract domain #correctness #generative
- Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra (AF, DM, MP), pp. 345–365.
- ASE-2013-Ganai #incremental #predict #reasoning
- Efficient data race prediction with incremental reasoning on time-stamped lock history (MKG), pp. 37–47.
- ASE-2013-GuoCASW #approach #learning #predict #statistics #variability
- Variability-aware performance prediction: A statistical learning approach (JG, KC, SA, NS, AW), pp. 301–311.
- ASE-2013-IzsoSBHR #graph #metric #precise #predict #query #towards
- Towards precise metrics for predicting graph query performance (BI, ZS, GB, ÁH, IR), pp. 421–431.
- ASE-2013-MeredithR #parametricity #runtime #string #verification
- Efficient parametric runtime verification with deterministic string rewriting (POM, GR), pp. 70–80.
- ASE-2013-PalepuXJ #dependence #dynamic analysis #summary
- Improving efficiency of dynamic analysis with dynamic dependence summaries (VKP, G(X, JAJ), pp. 59–69.
- ESEC-FSE-2013-BeyerLNSW #precise #reuse #verification
- Precision reuse for efficient regression verification (DB, SL, EN, AS, PW), pp. 389–399.
- ESEC-FSE-2013-PetkeYCH #combinator #detection #fault #interactive #testing
- Efficiency and early fault detection with lower and higher strength combinatorial interaction testing (JP, SY, MBC, MH), pp. 26–36.
- ICSE-2013-FeldthausSSDT #approximate #graph #ide #javascript
- Efficient construction of approximate call graphs for JavaScript IDE services (AF, MS, MS, JD, FT), pp. 752–761.
- ICSE-2013-HeymansLC #assurance #quality #variability
- Efficient quality assurance of variability-intensive systems (PH, AL, MC), pp. 1496–1498.
- ICSE-2013-Jonsson #machine learning #scalability #using
- Increasing anomaly handling efficiency in large organizations using applied machine learning (LJ), pp. 1361–1364.
- ICSE-2013-LeeCJ #program transformation #refactoring
- Drag-and-drop refactoring: intuitive and efficient program transformation (YYL, NC, REJ), pp. 23–32.
- ICSE-2013-MalikHH #automation #detection #scalability #testing
- Automatic detection of performance deviations in the load testing of large scale systems (HM, HH, AEH), pp. 1012–1021.
- ICSE-2013-NistorSML #data access #detection #named #problem
- Toddler: detecting performance problems via similar memory-access patterns (AN, LS, DM, SL), pp. 562–571.
- ICSE-2013-SnipesANM #developer #towards
- Towards recognizing and rewarding efficient developer work patterns (WS, VA, ARN, ERMH), pp. 1277–1280.
- ICSE-2013-SwearnginCJB #testing
- Human performance regression testing (AS, MBC, BEJ, RKEB), pp. 152–161.
- ICSE-2013-ThummalapentaDSCGNS #automation #case study #industrial #testing
- Efficient and change-resilient test automation: an industrial case study (ST, PD, SS, SC, SG, DDN, SS), pp. 1002–1011.
- ICSE-2013-WertHH #automation #problem
- Supporting swift reaction: automatically uncovering performance problems by systematic experiments (AW, JH, LH), pp. 552–561.
- SAC-2013-BifetPRH #adaptation #classification #data type #probability
- Efficient data stream classification via probabilistic adaptive windows (AB, BP, JR, GH), pp. 801–806.
- SAC-2013-CameronSNMM #analysis #component #realtime #rule-based
- Performance analysis of a rule-based SOA component for real-time applications (AC, MS, NN, WM, TM), pp. 1877–1884.
- SAC-2013-HapfelmeierSK #dataset #incremental #linear
- Incremental linear model trees on massive datasets: keep it simple, keep it fast (AH, JS, SK), pp. 129–135.
- SAC-2013-JangKRLSKPC #api #comparison #similarity
- An efficient similarity comparison based on core API calls (MJ, JK, SR, KL, SS, AK, YP, EHC), pp. 1634–1638.
- SAC-2013-KimPK #evaluation #grid #network #smarttech #towards
- Towards cosimulating network and electrical systems for performance evaluation in smart grid (HK, WP, HK), pp. 686–687.
- SAC-2013-LakhlefMB #algorithm #configuration management #distributed #self
- Distributed and efficient algorithm for self-reconfiguration of MEMS microrobots (HL, HM, JB), pp. 560–566.
- SAC-2013-LeitaoC #adaptation #detection #optimisation #using #xml
- Efficient XML duplicate detection using an adaptive two-level optimization (LL, PC), pp. 832–837.
- SAC-2013-MagalhaesS #adaptation #monitoring
- Adaptive monitoring of web-based applications: a performance study (JPM, LMS), pp. 471–478.
- SAC-2013-MaiaB #modelling #network #predict #query
- Sensor-field modeling based on in-network data prediction: an efficient strategy for answering complex queries in wireless sensor networks (JEBM, AB), pp. 554–559.
- SAC-2013-Pena-OrtizGSP #interactive #web
- The impact of user-browser interaction on web performance (RPO, JAG, JS, AP), pp. 695–702.
- SAC-2013-PippinCW #multi
- Performance based task assignment in multi-robot patrolling (CP, HIC, LW), pp. 70–76.
- SAC-2013-SaitoRFSG #approach #image #reduction
- A data reduction and organization approach for efficient image annotation (PTMS, PJdR, AXF, CTNS, JFG), pp. 53–57.
- SAC-2013-SolankiRBGB #embedded #parsing
- Improving the performance of message parsers for embedded systems (JS, LR, YDB, BLG, TFB), pp. 1505–1510.
- SAC-2013-SouzaRB #clustering #data access #metric
- Faster construction of ball-partitioning-based metric access methods (JAdS, HLR, MCNB), pp. 8–12.
- SAC-2013-TeodoroCF #energy #scheduling
- Energy efficiency management in computational grids through energy-aware scheduling (ST, ABdC, LGF), pp. 1163–1168.
- SAC-2013-WestermannHF #automation #empirical #specification
- An experiment specification language for goal-driven, automated performance evaluations (DW, JH, RF), pp. 1043–1048.
- SAC-2013-ZagareseCZAPB #data-driven #interactive
- Efficient data-intensive event-driven interaction in SOA (QZ, GC, EZ, IA, LP, FB), pp. 1907–1912.
- GPCE-2013-AnKGTS #automation #framework #generative #in the cloud #modelling #testing
- Model-driven generative framework for automated OMG DDS performance testing in the cloud (KA, TK, ASG, ST, AS), pp. 179–182.
- GPCE-2013-OfenbeckRSOP #generative #library #scala #towards
- Spiral in scala: towards the systematic construction of generators for performance libraries (GO, TR, AS, MO, MP), pp. 125–134.
- GPCE-2013-Richard-FoyBJ #abstraction #programming #web
- Efficient high-level abstractions for web programming (JRF, OB, JMJ), pp. 53–60.
- GPCE-2013-SiegmundRA #metric
- Family-based performance measurement (NS, AvR, SA), pp. 95–104.
- GPCE-2013-SujeethGBLROO #declarative #domain-specific language #generative #implementation #named #specification
- Forge: generating a high performance DSL implementation from a declarative specification (AKS, AG, KJB, HL, TR, MO, KO), pp. 145–154.
- ASPLOS-2013-ArulrajCJL #hardware
- Production-run software failure diagnosis via hardware performance counters (JA, PCC, GJ, SL), pp. 101–112.
- ASPLOS-2013-CurtsingerB #evaluation #named #statistics
- STABILIZER: statistically sound performance evaluation (CC, EDB), pp. 219–228.
- ASPLOS-2013-JafriVV #dependence #named
- Wait-n-GoTM: improving HTM performance by serializing cyclic dependencies (SARJ, GV, TNV), pp. 521–534.
- ASPLOS-2013-JogKNMKMID #array #concurrent #named #owl #scheduling #thread
- OWL: cooperative thread array aware scheduling techniques for improving GPGPU performance (AJ, OK, NCN, AKM, MTK, OM, RI, CRD), pp. 395–406.
- ASPLOS-2013-McFarlinTZ #question
- Discerning the dominant out-of-order performance advantage: is it speculation or dynamism? (DSM, CT, CBZ), pp. 241–252.
- ASPLOS-2013-MittalBBS #architecture #embedded #platform
- Efficient virtualization on embedded power architecture® platforms (AM, DB, SB, VS), pp. 445–458.
- ASPLOS-2013-PhothilimthanaARA #architecture
- Portable performance on heterogeneous architectures (PMP, JA, JRK, SPA), pp. 431–444.
- ASPLOS-2013-SungKA #hardware #named #nondeterminism
- DeNovoND: efficient hardware support for disciplined non-determinism (HS, RK, SVA), pp. 13–26.
- ASPLOS-2013-WangW #hardware #named #optimisation
- TSO_ATOMICITY: efficient hardware primitive for TSO-preserving region optimizations (CW, YW), pp. 509–520.
- CASE-2013-BjorkenstamGBCL #energy #industrial #using
- Energy efficient and collision free motion of industrial robots using optimal control (SB, DG, RB, JSC, BL), pp. 510–515.
- CASE-2013-BrundageCLXA #energy
- Energy efficiency management of an integrated serial production line and HVAC system (MB, QC, YL, GX, JA), pp. 634–639.
- CASE-2013-ChenCLZZF #assembly #automation #process
- Performance improvement for high accuracy assembly process in manufacturing automation (HC, HC, JL, BZ, GZ, TAF), pp. 540–545.
- CASE-2013-ChenZH #analysis #modelling
- Mathematical modeling and performance analysis of battery equalization systems (HC, LZ, YH), pp. 711–716.
- CASE-2013-FerreiraR #comparison #design #layout #simulation #using
- Performance comparison of the virtual cell layout with cellular and job shop configurations using simulation and design of experiments (JCEF, PAR), pp. 795–800.
- CASE-2013-HuZL #automation #petri net #synthesis #using
- Supervisor synthesis and performance improvement for automated manufacturing systems by using Petri nets (HH, MZ, YL), pp. 1139–1144.
- CASE-2013-IordacheWZA #design #petri net #specification
- Efficient design of Petri-net supervisors with disjunctive specifications (MVI, PW, FZ, PJA), pp. 936–941.
- CASE-2013-JuLXA #evaluation #identification #quality
- Integrated model of productivity and quality in serial production lines with repairs: Performance evaluation and bottleneck identification (FJ, JL, GX, JA), pp. 783–788.
- CASE-2013-KramerKBSPG #evaluation #knowledge-based #simulation
- Performance evaluation of knowledge-based kitting via simulation (TRK, ZK, SB, CS, AP, SG), pp. 356–361.
- CASE-2013-LiFZS #adaptation #named #smarttech
- DEPEND: Density adaptive power efficient neighbor discovery for wearable body sensors (BL, WF, LZ, CJS), pp. 581–586.
- CASE-2013-LiYY #energy #novel
- A novel parabolic trough solar lighting and thermal system for building energy efficiency (TL, FY, CY), pp. 657–662.
- CASE-2013-MarturiDP #image #using
- Fast image drift compensation in scanning electron microscope using image registration (NM, SD, NP), pp. 807–812.
- CASE-2013-PanahiASG #algorithm #proximity
- An efficient proximity probing algorithm for metrology (FP, AA, AFvdS, KG), pp. 342–349.
- CASE-2013-QianY #named #navigation #visual notation
- NCC-RANSAC: A fast plane extraction method for navigating a smart cane for the visually impaired (XQ, CY), pp. 261–267.
- CASE-2013-SehestedtPRL #3d #maintenance
- Prior-knowledge assisted fast 3D map building of structured environments for steel bridge maintenance (SS, GP, DRS, DL), pp. 1040–1046.
- CC-2013-BraunBHLMZ
- Simple and Efficient Construction of Static Single Assignment Form (MB, SB, SH, RL, CM, AZ), pp. 102–122.
- CC-2013-KastrinisS #analysis #effectiveness #exception #java #points-to
- Efficient and Effective Handling of Exceptions in Java Points-to Analysis (GK, YS), pp. 41–60.
- CGO-2013-BardizbanyanGWSLMS #data access #using
- Improving data access efficiency by using a tagless access buffer (TAB) (AB, PG, DBW, MS, PLE, SAM, PS), p. 11.
- CGO-2013-JeonGT #named #program analysis
- Skadu: Efficient vector shadow memories for poly-scopic program analysis (DJ, SG, MBT), p. 12.
- CGO-2013-LaiS #analysis #bound #optimisation
- Performance upper bound analysis and optimization of SGEMM on Fermi and Kepler GPUs (JL, AS), p. 10.
- CGO-2013-RodriguesCP #integer #source code
- A fast and low-overhead technique to secure programs against integer overflows (RER, VHSC, FMQP), p. 11.
- DAC-2013-AsenovART #predict
- Predicting future technology performance (AA, CA, CR, ET), p. 6.
- DAC-2013-BanerjeeDSC #adaptation #constraints #energy #realtime
- Real-time use-aware adaptive MIMO RF receiver systems for energy efficiency under BER constraints (DB, SKD, SS, AC), p. 7.
- DAC-2013-CalhounC #delivery #energy #flexibility #power management
- Flexible on-chip power delivery for energy efficient heterogeneous systems (BHC, KC), p. 6.
- DAC-2013-GuCL #estimation #validation
- Efficient moment estimation with extremely small sample size via bayesian inference for analog/mixed-signal validation (CG, EC, XL), p. 7.
- DAC-2013-JiangYXCE #3d #effectiveness #on the
- On effective and efficient in-field TSV repair for stacked 3D ICs (LJ, FY, QX, KC, BE), p. 6.
- DAC-2013-KarakostasTUNC #energy
- Improving the energy efficiency of hardware-assisted watchpoint systems (VK, ST, OSÜ, MN, AC), p. 6.
- DAC-2013-KleebergerGS #evaluation #modelling #predict #standard
- Predicting future product performance: modeling and evaluation of standard cells in FinFET technologies (VK, HEG, US), p. 6.
- DAC-2013-KuangY #approach #composition #layout
- An efficient layout decomposition approach for triple patterning lithography (JK, EFYY), p. 6.
- DAC-2013-LinBC #effectiveness
- An efficient and effective analytical placer for FPGAs (THL, PB, YWC), p. 6.
- DAC-2013-TsaoCY #design #garbage collection
- Performance enhancement of garbage collection for flash storage devices: an efficient victim block selection design (CWT, YHC, MCY), p. 6.
- DAC-2013-WangK #control flow #detection #hardware #kernel #named #using
- NumChecker: detecting kernel control-flow modifying rootkits by using hardware performance counters (XW, RK), p. 7.
- DAC-2013-WangZSLG #modelling #reuse #scalability
- Bayesian model fusion: large-scale performance modeling of analog and mixed-signal circuits by reusing early-stage data (FW, WZ, SS, XL, CG), p. 6.
- DAC-2013-WuergesOS #energy #realtime
- Reconciling real-time guarantees and energy efficiency through unlocked-cache prefetching (EW, RSdO, LCVdS), p. 9.
- DAC-2013-XuWHRT #estimation #on the #robust
- On robust task-accurate performance estimation (YX, BW, RH, RR, JT), p. 6.
- DAC-2013-YangCTH
- New ERA: new efficient reliability-aware wear leveling for endurance enhancement of flash storage devices (MCY, YHC, CWT, PCH), p. 6.
- DAC-2013-ZhangGQ #embedded #energy #scheduling
- Improving charging efficiency with workload scheduling in energy harvesting embedded systems (YZ, YG, QQ), p. 8.
- DATE-2013-AkhlaghiKAP #architecture #network
- An efficient network on-chip architecture based on isolating local and non-local communications (VA, MK, AAK, MP), pp. 350–353.
- DATE-2013-BaiS #architecture #automation #data transformation #manycore #memory management
- Automatic and efficient heap data management for limited local memory multicore architectures (KB, AS), pp. 593–598.
- DATE-2013-BoleyCAC #analysis #estimation
- Leveraging sensitivity analysis for fast, accurate estimation of SRAM dynamic write VMIN (JB, VC, RCA, BHC), pp. 1819–1824.
- DATE-2013-CevreroEAILBS #estimation
- Fast and accurate BER estimation methodology for I/O links based on extreme value theory (AC, NEE, CA, PI, YL, AB, GIS), pp. 503–508.
- DATE-2013-CilardoGMM #design #scalability
- Efficient and scalable OpenMP-based system-level design (AC, LG, AM, NM), pp. 988–991.
- DATE-2013-DaloukasMETS #approach #delivery #network #parallel #power management
- A parallel fast transform-based preconditioning approach for electrical-thermal co-simulation of power delivery networks (KD, AM, NEE, PT, GIS), pp. 1689–1694.
- DATE-2013-DiazSSR #analysis #network #security #simulation
- Wireless sensor network simulation for security and performance analysis (AD, PS, JS, JR), pp. 432–435.
- DATE-2013-FakihGFR #analysis #architecture #model checking #towards #using
- Towards performance analysis of SDFGs mapped to shared-bus architectures using model-checking (MF, KG, MF, AR), pp. 1167–1172.
- DATE-2013-GaoBW #paradigm
- A new paradigm for trading off yield, area and performance to enhance performance per wafer (YG, MAB, YW), pp. 1753–1758.
- DATE-2013-HelmstetterCGMV #simulation #using
- Fast and accurate TLM simulations using temporal decoupling for FIFO-based communications (CH, JC, BG, MM, PV), pp. 1185–1188.
- DATE-2013-HuangMSBP #effectiveness
- A fast and Effective DFT for test and diagnosis of power switches in SoCs (XH, JM, RAS, SB, DKP), pp. 1089–1092.
- DATE-2013-JoshiLBBG #estimation #statistics
- A gate level methodology for efficient statistical leakage estimation in complex 32nm circuits (SJ, AL, MB, EB, SG), pp. 1056–1057.
- DATE-2013-KazmierskiWAM #energy #optimisation
- DoE-based performance optimization of energy management in sensor nodes powered by tunable energy-harvesters (TJK, LW, BMAH, GVM), p. 484.
- DATE-2013-Kozyrakis
- Resource efficient computing for warehouse-scale datacenters (CK), pp. 1351–1356.
- DATE-2013-LeeJS #architecture #hybrid #memory management
- Fast shared on-chip memory architecture for efficient hybrid computing with CGRAs (JL, YJ, SS), pp. 1575–1578.
- DATE-2013-LeeVTS #design #energy
- Design of low energy, high performance synchronous and asynchronous 64-point FFT (WL, VSV, ART, KSS), pp. 242–247.
- DATE-2013-LiD #approach #debugging #hybrid
- A hybrid approach for fast and accurate trace signal selection for post-silicon debug (ML, AD), pp. 485–490.
- DATE-2013-LivramentoGGJ
- Fast and efficient lagrangian relaxation-based discrete gate sizing (VSL, CG, JLG, MOJ), pp. 1855–1860.
- DATE-2013-LoiaconoPPPQRVB #estimation #multi #problem
- Fast cone-of-influence computation and estimation in problems with multiple properties (CL, MP, PP, DP, SQ, SR, DV, JB), pp. 803–806.
- DATE-2013-LuMS #embedded #simulation
- Fast cache simulation for host-compiled simulation of embedded software (KL, DMG, US), pp. 637–642.
- DATE-2013-MaricAV #architecture #hybrid #reliability #using
- Efficient cache architectures for reliable hybrid voltage operation using EDC codes (BM, JA, MV), pp. 917–920.
- DATE-2013-Mitcheson #adaptation #delivery #energy #question
- Adaptable, high performance energy harvesters: can energy harvesting deliver enough power for automotive electronics? (PDM), p. 482.
- DATE-2013-MushtaqAB #approach #fault tolerance #manycore #platform
- Efficient software-based fault tolerance approach on multicore platforms (HM, ZAA, KB), pp. 921–926.
- DATE-2013-NoguchiNAFAKNMN #energy #hybrid #memory management
- D-MRAM cache: enhancing energy efficiency with 3T-1MTJ DRAM/MRAM hybrid memory (HN, KN, KA, SF, EA, KK, TN, SM, HN), pp. 1813–1818.
- DATE-2013-PanCL #agile #design #named #parallel #search-based #towards
- PAGE: parallel agile genetic exploration towards utmost performance for analog circuit design (PCP, HMC, CCL), pp. 1849–1854.
- DATE-2013-PiriouDRR #architecture #estimation #programmable #reduction
- A fast and accurate methodology for power estimation and reduction of programmable architectures (EP, RD, FR, SR), pp. 1054–1055.
- DATE-2013-QianJBTMM #analysis #named #using
- SVR-NoC: a performance analysis tool for network-on-chips using learning-based support vector regression model (ZQ, DCJ, PB, CYT, DM, RM), pp. 354–357.
- DATE-2013-RajovicRVGPR #case study #energy #experience #mobile
- Experiences with mobile processors for energy efficient HPC (NR, AR, JV, IG, NP, AR), pp. 464–468.
- DATE-2013-RayB
- An efficient wirelength model for analytical placement (BNBR, SB), pp. 1711–1714.
- DATE-2013-RenPRKWEK #synthesis
- Intuitive ECO synthesis for high performance circuits (HR, RP, LNR, SK, CW, JE, JK), pp. 1002–1007.
- DATE-2013-Rodriguez-RodriguezCCPT #memory management #policy #using
- Reducing writes in phase-change memory environments by using efficient cache replacement policies (RRR, FC, DC, LP, FT), pp. 93–96.
- DATE-2013-SarrazinENBG #concurrent #design #detection #fault
- Scan design with shadow flip-flops for low performance overhead and concurrent delay fault detection (SS, SE, LAdBN, YB, VG), pp. 1077–1082.
- DATE-2013-SauerRSPB #satisfiability
- Efficient SAT-based dynamic compaction and relaxation for longest sensitizable paths (MS, SR, TS, IP, BB), pp. 448–453.
- DATE-2013-ShenQ #energy #smarttech #streaming #video
- User-aware energy efficient streaming strategy for smartphone based video playback applications (HS, QQ), pp. 258–261.
- DATE-2013-StanisicVCDMLM #analysis #embedded #platform #power management
- Performance analysis of HPC applications on low-power embedded platforms (LS, BV, JC, AD, VMM, AL, JFM), pp. 475–480.
- DATE-2013-ThabetLAPD #architecture #flexibility #hardware #manycore
- An efficient and flexible hardware support for accelerating synchronization operations on the STHORM many-core architecture (FT, YL, CA, JMP, RD), pp. 531–534.
- DATE-2013-VenkatesanSRR #energy #named #using
- DWM-TAPESTRI — an energy efficient all-spin cache using domain wall shift based writes (RV, MS, KR, AR), pp. 1825–1830.
- DATE-2013-WagnerW #analysis #statistics
- Efficient variation-aware statistical dynamic timing analysis for delay test applications (MW, HJW), pp. 276–281.
- DATE-2013-WangH #embedded #modelling #simulation
- Fast and accurate cache modeling in source-level simulation of embedded software (ZW, JH), pp. 587–592.
- DATE-2013-WangSCC #design #embedded #estimation #reliability
- Accurate and efficient reliability estimation techniques during ADL-driven embedded processor design (ZW, KS, CC, AC), pp. 547–552.
- DATE-2013-WangW #named #ram
- TreeFTL: efficient RAM management for high performance of NAND flash-based storage systems (CW, WFW), pp. 374–379.
- DATE-2013-YaoYW #adaptation #analysis #modelling #online
- Efficient importance sampling for high-sigma yield analysis with adaptive online surrogate modeling (JY, ZY, YW), pp. 1291–1296.
- DATE-2013-YingHH #3d
- Fast and optimized task allocation method for low vertical link density 3-dimensional networks-on-chip based many core systems (HY, TH, KH), pp. 1777–1782.
- DATE-2013-YueZ #memory management
- Exploiting subarrays inside a bank to improve phase change memory performance (JY, YZ), pp. 386–391.
- DATE-2013-ZakharenkoAM #cpu #gpu #using
- Characterizing the performance benefits of fused CPU/GPU systems using FusionSim (VZ, TMA, AM), pp. 685–688.
- DATE-2013-ZapaterAMVGC #energy
- Leakage and temperature aware server control for improving energy efficiency in data centers (MZ, JLA, JMM, KV, KCG, AKC), pp. 266–269.
- DATE-2013-ZhangCBACL #3d #architecture #composition #manycore #named
- 3D-MMC: a modular 3D multi-core architecture with efficient resource pooling (TZ, AC, GB, PA, AKC, YL), pp. 1241–1246.
- HPCA-2013-Abdel-MajeedA
- Warped register file: A power efficient register file for GPGPUs (MAM, MA), pp. 412–423.
- HPCA-2013-ArdestaniR #manycore #named #using
- ESESC: A fast multicore simulator using Time-Based Sampling (EKA, JR), pp. 448–459.
- HPCA-2013-BeuPHC #verification
- High-speed formal verification of heterogeneous coherence hierarchies (JGB, JAP, ERH, TMC), pp. 566–577.
- HPCA-2013-KhanAWKJ #architecture #manycore #using
- Improving multi-core performance using mixed-cell cache architecture (SMK, ARA, CW, JK, DAJ), pp. 119–130.
- HPCA-2013-QianHSQ #dependence #memory management #named #parallel
- Rainbow: Efficient memory dependence recording with high replay parallelism for relaxed memory model (XQ, HH, BS, DQ), pp. 554–565.
- HPCA-2013-RhuE #control flow #execution #gpu
- The dual-path execution model for efficient GPU control flow (MR, ME), pp. 591–602.
- HPCA-2013-SandbergSHB #modelling
- Modeling performance variation due to cache sharing (AS, AS, EH, DBS), pp. 155–166.
- HPCA-2013-SubramanianSKJM #in memory #memory management #named #predict
- MISE: Providing performance predictability and improving fairness in shared main memory systems (LS, VS, YK, BJ, OM), pp. 639–650.
- HPDC-2013-CadambiCLPRSC #middleware #multi #named #reliability
- COSMIC: middleware for high performance and reliable multiprocessing on xeon phi coprocessors (SC, GC, CHL, RP, KR, MS, STC), pp. 215–226.
- HPDC-2013-CuiBLD #optimisation
- Virtual TCP offload: optimizing ethernet overlay performance on advanced interconnects (ZC, PGB, JRL, PAD), pp. 49–60.
- HPDC-2013-KassaN #architecture #named #retrieval
- SCDA: SLA-aware cloud datacenter architecture for efficient content storage and retrieval (DFK, KN), pp. 121–122.
- HPDC-2013-YinLBGN #dataset #order #pipes and filters #using
- Efficient analytics on ordered datasets using MapReduce (JY, YL, MB, LG, AN), pp. 125–126.
- LCTES-2013-ChattopadhyayCR
- Program performance spectrum (SC, LKC, AR), pp. 65–76.
- LCTES-2013-ChenY #comparison #detection #fault
- Boosting efficiency of fault detection and recovery throughapplication-specific comparison and checkpointing (HC, CY), pp. 13–20.
- LCTES-2013-FinlaysonDGUWST #pipes and filters
- Improving processor efficiency by statically pipelining instructions (IF, BD, PG, GRU, DBW, MS, GST), pp. 33–44.
- LCTES-2013-LiJZHX #compilation #power management
- Compiler directed write-mode selection for high performance low power volatile PCM (QL, LJ, YZ, YH, CJX), pp. 101–110.
- PDP-2013-BachCEEGKKLLPR #approach
- A Comprehensive Approach for a Power Efficient General Purpose Supercomputer (MB, JdC, HE, DE, JG, SK, MK, VL, HJL, MP, DR), pp. 336–342.
- PDP-2013-CabreraAPG #energy #modelling
- Analytical Modeling of the Energy Consumption for the High Performance Linpack (AC, FA, VBP, DG), pp. 343–350.
- PDP-2013-DrumlMSWGBH #behaviour #design #functional #verification
- Emulation-Based Test and Verification of a Design’s Functional, Performance, Power, and Supply Voltage Behavior (ND, MM, CS, RW, AG, HB, JH), pp. 328–335.
- PDP-2013-EbrahimiDP #algorithm #fault tolerance #manycore
- High Performance Fault-Tolerant Routing Algorithm for NoC-Based Many-Core Systems (ME, MD, JP), pp. 462–469.
- PDP-2013-FariaSS #data type #layout
- Impact of Data Structure Layout on Performance (NF, RCS, JLS), pp. 116–120.
- PDP-2013-FurnoZ #composition #network
- Efficient Cooperative Discovery of Service Compositions in Unstructured P2P Networks (AF, EZ), pp. 58–67.
- PDP-2013-GoliG #algorithm #architecture #coordination #hybrid
- Heterogeneous Algorithmic Skeletons for Fast Flow with Seamless Coordination over Hybrid Architectures (MG, HGV), pp. 148–156.
- PDP-2013-Gomez-CalzadoLALC #algorithm #evaluation
- An Evaluation of Efficient Leader Election Algorithms for Crash-Recovery Systems (CGC, ML, ISA, AL, RC), pp. 180–188.
- PDP-2013-HolmbackaALL #energy #manycore #operating system
- QoS Manager for Energy Efficient Many-Core Operating Systems (SH, DA, SL, JL), pp. 318–322.
- PDP-2013-HolmbackaLLL #distributed #manycore #migration #operating system
- Task Migration for Dynamic Power and Performance Characteristics on Many-Core Distributed Operating Systems (SH, WL, SL, JL), pp. 310–317.
- PDP-2013-MoosaviRLPT #3d #communication #multi #network #protocol #using
- Enhancing Performance of 3D Interconnection Networks using Efficient Multicast Communication Protocol (SRM, AMR, PL, JP, HT), pp. 294–301.
- PDP-2013-PetridesDCT #database #manycore #query #scalability
- Scalability and Efficiency of Database Queries on Future Many-Core Systems (PP, AD, CC, PT), pp. 24–28.
- PDP-2013-ShenFSV
- Performance Traps in OpenCL for CPUs (JS, JF, HJS, ALV), pp. 38–45.
- PDP-2013-TeimouriMS
- Power and Performance Efficient Partial Circuits in Packet-Switched Networks-on-Chip (NT, MM, HSA), pp. 509–513.
- PDP-2013-XavierNRFLR #evaluation
- Performance Evaluation of Container-Based Virtualization for High Performance Computing Environments (MGX, MVN, FDR, TCF, TL, CAFDR), pp. 233–240.
PLOS-2013-BurtsevMER #analysis #named #streaming- Weir: a streaming language for performance analysis (AB, NM, EE, RR), p. 6.
- PPoPP-2013-FriedleyHBLM #distributed #manycore #memory management #programming
- Ownership passing: efficient distributed memory programming on multi-core systems (AF, TH, GB, AL, CCM), pp. 177–186.
- PPoPP-2013-LePCN #memory management #modelling
- Correct and efficient work-stealing for weak memory models (NML, AP, AC, FZN), pp. 69–80.
- PPoPP-2013-LuZWZ0 #multi #named #thread
- RaceFree: an efficient multi-threading model for determinism (KL, XZ, XW, WZ, GL), pp. 297–298.
- PPoPP-2013-MorrisonA #concurrent
- Fast concurrent queues for x86 processors (AM, YA), pp. 103–112.
- PPoPP-2013-WamhoffFFRM #concurrent #memory management #named #thread #transaction
- FastLane: improving performance of software transactional memory for low thread counts (JTW, CF, PF, ER, GM), pp. 113–122.
- PPoPP-2013-XiangS #compilation #concurrent #data type
- Compiler aided manual speculation for high performance concurrent data structures (LX, MLS), pp. 47–56.
- PPoPP-2013-YanLZ #algorithm #named
- StreamScan: fast scan algorithms for GPUs without global barrier synchronization (SY, GL, YZ), pp. 229–238.
- PPoPP-2013-YuB #automaton #regular expression
- Exploring different automata representations for efficient regular expression matching on GPUs (XY, MB), pp. 287–288.
- SOSP-2013-KediaB #kernel
- Fast dynamic binary translation for the kernel (PK, SB), pp. 101–115.
- STOC-2013-Ben-SassonCGT #on the #proving
- On the concrete efficiency of probabilistically-checkable proofs (EBS, AC, DG, ET), pp. 585–594.
- STOC-2013-CyganKN
- Fast hamiltonicity checking via bases of perfect matchings (MC, SK, JN), pp. 301–310.
- STOC-2013-FeldmanFGL
- Simultaneous auctions are (almost) efficient (MF, HF, NG, BL), pp. 201–210.
- STOC-2013-LenzenP #using
- Fast routing table construction using small messages: extended abstract (CL, BPS), pp. 381–390.
- STOC-2013-NaorRV #commutative #difference
- Efficient rounding for the noncommutative grothendieck inequality (AN, OR, TV), pp. 71–80.
- STOC-2013-RodittyW #algorithm #approximate #graph
- Fast approximation algorithms for the diameter and radius of sparse graphs (LR, VVW), pp. 515–524.
- STOC-2013-SyrgkanisT #composition
- Composable and efficient mechanisms (VS, ÉT), pp. 211–220.
TACAS-2013-RenaultDKP #automaton #composition #model checking- Strength-Based Decomposition of the Property Büchi Automaton for Faster Model Checking (ER, ADL, FK, DP), pp. 580–593.
- TACAS-2013-WijsE
- Efficient Property Preservation Checking of Model Refinements (AW, LE), pp. 565–579.
- CADE-2013-Shankar #automation #reasoning
- Automated Reasoning, Fast and Slow (NS), pp. 145–161.
- CAV-2013-AlglaveKT #bound #concurrent #model checking #partial order
- Partial Orders for Efficient Bounded Model Checking of Concurrent Software (JA, DK, MT), pp. 141–157.
- CAV-2013-CernyHRRT #concurrent #semantics #synthesis
- Efficient Synthesis for Concurrency by Semantics-Preserving Transformations (PC, TAH, AR, LR, TT), pp. 951–967.
- CAV-2013-ChatterjeeL #algorithm #markov #process
- Faster Algorithms for Markov Decision Processes with Low Treewidth (KC, JL), pp. 543–558.
- CAV-2013-DonzeFM #monitoring #robust
- Efficient Robust Monitoring for STL (AD, TF, OM), pp. 264–279.
- CAV-2013-KroeningLW #approximate #c #detection #source code
- Under-Approximating Loops in C Programs for Fast Counterexample Detection (DK, ML, GW), pp. 381–396.
- CAV-2013-VizelRN #generative
- Efficient Generation of Small Interpolants in CNF (YV, VR, AN), pp. 330–346.
- ICST-2013-CanforaMVDFM #automation #case study #smarttech #testing #user interface
- A Case Study of Automating User Experience-Oriented Performance Testing on Smartphones (GC, FM, CAV, MD, AF, CM), pp. 66–69.
- ICST-2013-FarooqQA #effectiveness #empirical #testing
- A Controlled Experiment to Evaluate Effectiveness and Efficiency of Three Software Testing Methods (SUF, SMKQ, NA), pp. 493–494.
- ICST-2013-MirshokraieMP #javascript #mutation testing #testing
- Efficient JavaScript Mutation Testing (SM, AM, KP), pp. 74–83.
- ICST-2013-YuLBKK #algorithm #combinator #constraints #generative #testing
- An Efficient Algorithm for Constraint Handling in Combinatorial Test Generation (LY, YL, MNB, RK, DRK), pp. 242–251.
- ISSTA-2013-DevakiTSS #execution #flexibility #user interface
- Efficient and flexible GUI test execution via test merging (PD, ST, NS, SS), pp. 34–44.
- ISSTA-2013-Ghaith #analysis #testing #transaction
- Analysis of performance regression testing data by transaction profiles (SG), pp. 370–373.
- ISSTA-2013-XiaoHZX #identification
- Context-sensitive delta inference for identifying workload-dependent performance bottlenecks (XX, SH, DZ, TX), pp. 90–100.
- ISSTA-2013-ZhangMK #mutation testing #reduction #testing
- Faster mutation testing inspired by test prioritization and reduction (LZ, DM, SK), pp. 235–245.
- LICS-2013-BrazdilCFK #markov #process
- Trading Performance for Stability in Markov Decision Processes (TB, KC, VF, AK), pp. 331–340.
- SAT-2013-LonsingEG #learning #pseudo #quantifier
- Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation (FL, UE, AVG), pp. 100–115.
- VMCAI-2013-KhalimovJB #synthesis #towards
- Towards Efficient Parameterized Synthesis (AK, SJ, RB), pp. 108–127.
- CBSE-2012-BrosigHK #architecture #dependence #modelling #online #parametricity
- Modeling parameter and context dependencies in online architecture-level performance models (FB, NH, SK), pp. 3–12.
- QoSA-2012-ArcelliCT #refactoring
- Antipattern-based model refactoring for software performance improvement (DA, VC, CT), pp. 33–42.
- QoSA-2012-BeckerLB #adaptation #modelling #overview #self
- Model-driven performance engineering of self-adaptive systems: a survey (MB, ML, SB), pp. 117–122.
- QoSA-2012-Brebner #architecture #assessment #case study #experience #lifecycle #modelling
- Experiences with early life-cycle performance modeling for architecture assessment (PB), pp. 149–154.
- QoSA-2012-Groenda #modelling #predict
- Improving performance predictions by accounting for the accuracy of composed performance models (HG), pp. 111–116.
- QoSA-2012-KrebsMK #metric
- Metrics and techniques for quantifying performance isolation in cloud environments (RK, CM, SK), pp. 91–100.
WICSA-ECSA-2012-CortellessaSMT #architecture- Enabling Performance Antipatterns to Arise from an ADL-based Software Architecture (VC, MdS, ADM, CT), pp. 310–314.
- WICSA-ECSA-2012-RathfelderBKR #email #monitoring #predict #scalability #using
- Workload-aware System Monitoring Using Performance Predictions Applied to a Large-scale E-Mail System (CR, SB, KK, RHR), pp. 31–40.
- DRR-2012-ChazalonC #analysis #documentation #interactive
- Iterative analysis of document collections enables efficient human-initiated interaction (JC, BC).
- DRR-2012-CoetzerSS #collaboration #human-computer #verification
- Efficient cost-sensitive human-machine collaboration for offline signature verification (JC, JPS, RS).
- DRR-2012-NagyT #named #verification
- VeriClick: an efficient tool for table format verification (GN, MT).
- HT-2012-HelicKGST #folksonomy
- Navigational efficiency of broad vs. narrow folksonomies (DH, CK, MG, MS, CT), pp. 63–72.
- PODS-2012-BarceloLR #approximate #query
- Efficient approximations of conjunctive queries (PB, LL, MR), pp. 249–260.
- SIGMOD-2012-AlagiannisBBIA #execution #named #query
- NoDB: efficient query execution on raw data files (IA, RB, MB, SI, AA), pp. 241–252.
- SIGMOD-2012-BogSP #interactive #monitoring
- Interactive performance monitoring of a composite OLTP and OLAP workload (AB, KS, HP), pp. 645–648.
- SIGMOD-2012-ChengKCC #approach #distance #graph #query #scalability
- Efficient processing of distance queries in large graphs: a vertex cover approach (JC, YK, SC, CC), pp. 457–468.
- SIGMOD-2012-EngleLXZFSS #data analysis #distributed #memory management #named #using
- Shark: fast data analysis using coarse-grained distributed memory (CE, AL, RX, MZ, MJF, SS, IS), pp. 689–692.
- SIGMOD-2012-HellingsFH #bisimulation #graph
- Efficient external-memory bisimulation on DAGs (JH, GHLF, HJH), pp. 553–564.
- SIGMOD-2012-KimPSLDC #clustering #distributed #named #ram #scalability
- CloudRAMSort: fast and efficient large-scale distributed RAM sort on shared-nothing cluster (CK, JP, NS, HL, PD, JC), pp. 841–850.
- SIGMOD-2012-ManiuC #collaboration #named #network #personalisation
- Taagle: efficient, personalized search in collaborative tagging networks (SM, BC), pp. 661–664.
- SIGMOD-2012-RosnerHGPB #correlation #word
- Fast sampling word correlations of high dimensional text data (FR, AH, MG, MP, AB), p. 866.
- SIGMOD-2012-SarmaLGMH #scalability
- Efficient spatial sampling of large geographical tables (ADS, HL, HG, JM, AYH), pp. 193–204.
- SIGMOD-2012-SikkaFLCPB #database #transaction
- Efficient transaction processing in SAP HANA database: the end of a column store myth (VS, FF, WL, SKC, TP, CB), pp. 731–742.
- SIGMOD-2012-ThomsonDWRSA #database #distributed #named #transaction
- Calvin: fast distributed transactions for partitioned database systems (AT, TD, SCW, KR, PS, DJA), pp. 1–12.
- VLDB-2012-CaoCJNOPW #named #retrieval #web
- SWORS: A System for the Efficient Retrieval of Relevant Spatial Web Objects (XC, GC, CSJ, JJN, BCO, NTP, DW), pp. 1914–1917.
- VLDB-2012-ChubakR #query
- Efficient Indexing and Querying over Syntactically Annotated Trees (PC, DR), pp. 1316–1327.
- VLDB-2012-DittrichQ #big data #pipes and filters
- Efficient Big Data Processing in Hadoop MapReduce (JD, JAQR), pp. 2014–2015.
- VLDB-2012-DittrichQRSJS
- Only Aggressive Elephants are Fast Elephants (JD, JAQR, SR, SS, AJ, JS), pp. 1591–1602.
- VLDB-2012-EndrullisTR #named #web
- WETSUIT: An Efficient Mashup Tool for Searching and Fusing Web Entities (SE, AT, ER), pp. 1970–1973.
- VLDB-2012-EwenTKM #data flow
- Spinning Fast Iterative Data Flows (SE, KT, MK, VM), pp. 1268–1279.
- VLDB-2012-FanWW #distributed #query #reachability
- Performance Guarantees for Distributed Reachability Queries (WF, XW, YW), pp. 1304–1315.
- VLDB-2012-FujiwaraNOK #random
- Fast and Exact Top-k Search for Random Walk with Restart (YF, MN, MO, MK), pp. 442–453.
- VLDB-2012-GoodrichNOPTTL #authentication #crawling #verification #web
- Efficient Verification of Web-Content Searching Through Authenticated Web Crawlers (MTG, DN, OO, CP, RT, NT, CVL), pp. 920–931.
- VLDB-2012-KangLM #throughput
- Flash-based Extended Cache for Higher Throughput and Faster Recovery (WHK, SWL, BM), pp. 1615–1626.
- VLDB-2012-KhoussainovaBS #debugging #named #pipes and filters
- PerfXplain: Debugging MapReduce Job Performance (NK, MB, DS), pp. 598–609.
- VLDB-2012-KolbTR #named
- Dedoop: Efficient Deduplication with Hadoop (LK, AT, ER), pp. 1878–1881.
- VLDB-2012-LamLPRVD #named
- Muppet: MapReduce-Style Processing of Fast Data (WL, LL, SP, AR, ZV, AD), pp. 1814–1825.
- VLDB-2012-LuSCO #nearest neighbour #pipes and filters #using
- Efficient Processing of k Nearest Neighbor Joins using MapReduce (WL, YS, SC, BCO), pp. 1016–1027.
- VLDB-2012-RablSJGMM #big data #challenge #enterprise
- Solving Big Data Challenges for Enterprise Application Performance Management (TR, MS, HAJ, SGV, VMM, SM), pp. 1724–1735.
- VLDB-2012-SatuluriP #locality #similarity
- Bayesian Locality Sensitive Hashing for Fast Similarity Search (VS, SP), pp. 430–441.
- VLDB-2012-ShinnarCHS #in memory #named
- M3R: Increased performance for in-memory Hadoop jobs (AS, DC, BH, VAS), pp. 1736–1747.
- VLDB-2012-Shirani-MehrKS #dataset #evaluation #query #reachability #scalability
- Efficient Reachability Query Evaluation in Large Spatiotemporal Contact Datasets (HSM, FBK, CS), pp. 848–859.
- VLDB-2012-SunWWSL #graph
- Efficient Subgraph Matching on Billion Node Graphs (ZS, HW, HW, BS, JL), pp. 788–799.
- VLDB-2012-YuanWCW #database #graph #probability #scalability #similarity
- Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases (YY, GW, LC, HW), pp. 800–811.
- VLDB-2012-ZhangCW #multi #pipes and filters #using
- Efficient Multi-way Theta-Join Processing Using MapReduce (XZ, LC, MW), pp. 1184–1195.
- VLDB-2012-ZhuKA #effectiveness #framework #retrieval #sequence
- A Generic Framework for Efficient and Effective Subsequence Retrieval (HZ, GK, VA), pp. 1579–1590.
- ITiCSE-2012-DoranBFB #design #development #education #game studies #student
- Outreach for improved student performance: a game design and development curriculum (KD, AKB, SLF, TB), pp. 209–214.
- ITiCSE-2012-Oliveira #correlation #statistics #student
- Statistical evidence of the correlation between mental ability to compute and student performance in undergraduate courses (OLO), pp. 111–115.
- SIGITE-2012-SteinmetzPNWW #benchmark #in the cloud #metric #virtual machine
- Cloud computing performance benchmarking and virtual machine launch time (DS, BWP, RN, JW, XW), pp. 89–90.
- CSMR-2012-KaushikT #case study #comparative #debugging #detection #information retrieval #modelling
- A Comparative Study of the Performance of IR Models on Duplicate Bug Detection (NK, LT), pp. 159–168.
- ICSM-2012-BezemerZHGWW #as a service #industrial
- Locating performance improvement opportunities in an industrial software-as-a-service application (CPB, AZ, AvdH, AvdG, MW, RW), pp. 547–556.
- ICSM-2012-CorazzaMM #approach #identifier #named
- LINSEN: An efficient approach to split identifiers and expand abbreviations (AC, SDM, VM), pp. 233–242.
- ICSM-2012-QiML #automation #scalability #source code #using
- Making automatic repair for large-scale programs more efficient using weak recompilation (YQ, XM, YL), pp. 254–263.
- MSR-2012-IssabayevaNV
- Issue handling performance in proprietary software projects (AI, AN, JV), pp. 209–212.
- MSR-2012-KhomhDZA #case study #empirical #quality
- Do faster releases improve software quality? An empirical case study of Mozilla Firefox (FK, TD, YZ, BA), pp. 179–188.
- MSR-2012-ZamanAH #debugging
- A qualitative study on performance bugs (SZ, BA, AEH), pp. 199–208.
- WCRE-2012-AlomariCM #approach #scalability #slicing
- A Very Efficient and Scalable Forward Static Slicing Approach (HWA, MLC, JIM), pp. 425–434.
- WCRE-2012-GauthierM #data access #detection #php
- Fast Detection of Access Control Vulnerabilities in PHP Applications (FG, EM), pp. 247–256.
- WCRE-2012-GuerroujGGAP #algorithm #identifier #named
- TRIS: A Fast and Accurate Identifiers Splitting and Expansion Algorithm (LG, PG, YGG, GA, MDP), pp. 103–112.
- CIAA-2012-FaroL #algorithm #automaton #online #string
- A Fast Suffix Automata Based Algorithm for Exact Online String Matching (SF, TL), pp. 149–158.
- ICALP-v1-2012-AzarG #constraints #linear
- Efficient Submodular Function Maximization under Linear Packing Constraints (YA, IG), pp. 38–50.
- ICALP-v1-2012-BringmannP
- Efficient Sampling Methods for Discrete Distributions (KB, KP), pp. 133–144.
- ICALP-v1-2012-Jez #pattern matching
- Faster Fully Compressed Pattern Matching by Recompression (AJ), pp. 533–544.
- ICALP-v1-2012-RabinMMY #strict #transaction #validation
- Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial Transactions (MOR, YM, SM, MY), pp. 738–749.
- ICALP-v1-2012-ThalerUV #algorithm
- Faster Algorithms for Privately Releasing Marginals (JT, JU, SPV), pp. 810–821.
- LATA-2012-BilleS #dependence #programming
- Fast and Cache-Oblivious Dynamic Programming with Local Dependencies (PB, MS), pp. 131–142.
- LATA-2012-BolligP #algorithm
- An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings (BB, TP), pp. 143–154.
- LATA-2012-GagieGKNP #grammarware #self
- A Faster Grammar-Based Self-index (TG, PG, JK, YN, SJP), pp. 240–251.
- FM-2012-BarringerFHRR #automaton #monitoring #quantifier #runtime #towards
- Quantified Event Automata: Towards Expressive and Efficient Runtime Monitors (HB, YF, KH, GR, DER), pp. 68–84.
- FM-2012-NedunuriSC #algorithm
- Theory and Techniques for Synthesizing Efficient Breadth-First Search Algorithms (SN, DRS, WRC), pp. 308–325.
- FM-2012-SongT #detection #model checking #using
- Efficient Malware Detection Using Model-Checking (FS, TT), pp. 418–433.
- SEFM-2012-OuchaniMD #abstraction #diagrams #probability #process
- Efficient Probabilistic Abstraction for SysML Activity Diagrams (SO, OAM, MD), pp. 263–277.
SFM-2012-CortellessaMT #analysis #modelling- Software Performance Antipatterns: Modeling and Analysis (VC, ADM, CT), pp. 290–335.
- SFM-2012-PetriuAT #modelling
- Software Performance Modeling (DCP, MA, RT), pp. 219–262.
FLOPS-2012-CastineirasS #constraints #theorem proving- Improving the Performance of FD Constraint Solving in a CFLP System (IC, FSP), pp. 88–103.
- FLOPS-2012-Uustalu
- Explicit Binds: Effortless Efficiency with and without Trees (TU), pp. 317–331.
- Haskell-2012-AdamsD #haskell #programming #using
- Template your boilerplate: using template haskell for efficient generic programming (MDA0, TD), pp. 13–24.
- ICFP-2012-LaunchburyDDA #multi #protocol
- Efficient lookup-table protocol in secure multiparty computation (JL, ISD, TD, AAM), pp. 189–200.
- ICFP-2012-LippmeierCKLJ #higher-order
- Work efficient higher-order vectorisation (BL, MMTC, GK, RL, SLPJ), pp. 259–270.
- ICFP-2012-Olukotun #domain-specific language #embedded
- High performance embedded domain specific languages (KO), pp. 139–140.
- ICFP-2012-Siederdissen #combinator #programming
- Sneaking around concatMap: efficient combinators for dynamic programming (CHzS), pp. 215–226.
- AIIDE-2012-ChurchillSB #game studies #heuristic
- Fast Heuristic Search for RTS Game Combat Scenarios (DC, AS, MB).
- AIIDE-2012-HorswillF #constraints
- Fast Procedural Level Population with Playability Constraints (IDH, LF).
- CIG-2012-BasalduaM
- Win/loss States: An efficient model of success rates for simulation-based functions (JB, JMMV), pp. 41–46.
- FDG-2012-KulshreshthSL #3d #game studies #video
- Evaluating user performance in 3D stereo and motion enabled video games (AK, JS, JJLJ), pp. 33–40.
- FDG-2012-PowellBBC
- Table tilt: making friends fast (EP, RB, TB, VC), pp. 242–245.
GRAPHITE-2012-KantP #equation #game studies- Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games (GK, JvdP), pp. 50–65.
- ICGT-2012-BergmannRSTV #incremental #pattern matching #transitive
- Incremental Pattern Matching for the Efficient Computation of Transitive Closure (GB, IR, TS, PT, DV), pp. 386–400.
- ICGT-2012-BlumeBEK #automaton #graph #implementation #invariant
- Efficient Symbolic Implementation of Graph Automata with Applications to Invariant Checking (CB, HJSB, DE, BK), pp. 264–278.
- ICGT-2012-LauderAVS #graph grammar #precedence
- Efficient Model Synchronization with Precedence Triple Graph Grammars (ML, AA, GV, AS), pp. 401–415.
- CHI-2012-FisherPDs #dataset #incremental #scalability #trust #visualisation
- Trust me, I’m partially right: incremental visualization lets analysts explore large datasets faster (DF, IOP, SMD, MMCS), pp. 1673–1682.
- CHI-2012-GajosRH #metric
- Accurate measurements of pointing performance from in situ observations (KG, KR, CH), pp. 3157–3166.
- CHI-2012-GomezL #interactive #modelling
- Modeling task performance for a crowd of users from interaction histories (SRG, DHL), pp. 2465–2468.
- CHI-2012-JainB #learning
- User learning and performance with bezel menus (MJ, RB), pp. 2221–2230.
- CHI-2012-JungCL #interactive #programming
- Group hedonic balance and pair programming performance: affective interaction dynamics as indicators of performance (MJ, JC, LJL), pp. 829–838.
- CHI-2012-LeeLLLHP #evaluation
- Evaluation of human tangential force input performance (BL, HL, SCL, HL, SH, JP), pp. 3121–3130.
- CHI-2012-SwearnginCJB #generative #legacy #modelling #predict
- Easing the generation of predictive human performance models from legacy systems (AS, MBC, BEJ, RKEB), pp. 2489–2498.
- CSCW-2012-BoltonKV #comparison #using
- A comparison of competitive and cooperative task performance using spherical and flat displays (JB, KK, RV), pp. 529–538.
- CSCW-2012-EhrlichC #analysis #communication #development #distributed #multi
- All-for-one and one-for-all?: a multi-level analysis of communication patterns and individual performance in geographically distributed software development (KE, MC), pp. 945–954.
- CAiSE-2012-MaggiBA #declarative #modelling #process
- Efficient Discovery of Understandable Declarative Process Models from Event Logs (FMM, RPJCB, WMPvdA), pp. 270–285.
- EDOC-2012-MohebiDC #requirements
- Efficient QoS-based Service Selection with Consideration of User Requirements (AM, C(D, CHC), pp. 183–190.
- ICEIS-J-2012-PolasikGWKPT12a #empirical #mobile
- Time Efficiency of Point-of-Sale Payment Methods: Empirical Results for Cash, Cards and Mobile Payments (MP, JG, GW, JK, KP, NT), pp. 306–320.
- ICEIS-v1-2012-BrzostowskiK #multi #protocol
- Efficient Multi-alternative Protocol for Multi-attribute Agent Negotiation (JB, RK), pp. 247–252.
- ICEIS-v1-2012-RudraGA #approximate #query
- An Efficient Sampling Scheme for Approximate Processing of Decision Support Queries (AR, RPG, NA), pp. 16–26.
- ICEIS-v1-2012-TertiltBK #algorithm #enterprise #modelling #scalability #using
- Modeling the Performance and Scalability of a SAP ERP System using an Evolutionary Algorithm (DT, AB, HK), pp. 112–118.
- ICEIS-v2-2012-AbdallahR #embedded #testing
- Performance Impact of Fuzz Testing Windows Embedded Handheld Applications (NA, SR), pp. 371–376.
- ICEIS-v3-2012-CarvalhoRACJDM #energy #network #policy #towards
- Towards Sustainable Networks — Energy Efficiency Policy from Business to Device Instance Levels (TCMBC, ACR, MA, CHAC, GCJ, CKD, CM), pp. 238–243.
- ICEIS-v3-2012-Huang #design
- IT Committee Design and IT Performance (RH), pp. 244–248.
- ICEIS-v3-2012-KumarS #approach #architecture #enterprise #metric
- Enterprise Architecture Performance Management — A Context based Approach to EA Metrics Definition (AK, PS), pp. 249–254.
- CIKM-2012-AkogluTVF #category theory #detection #reliability
- Fast and reliable anomaly detection in categorical data (LA, HT, JV, CF), pp. 415–424.
- CIKM-2012-ArvanitisDV #query #research
- Efficient influence-based processing of market research queries (AA, AD, YV), pp. 1193–1202.
- CIKM-2012-AsadiL #documentation #generative #ranking
- Fast candidate generation for two-phase document ranking: postings list intersection with bloom filters (NA, JL), pp. 2419–2422.
- CIKM-2012-BahmaniGS #distributed #locality
- Efficient distributed locality sensitive hashing (BB, AG, RS), pp. 2174–2178.
- CIKM-2012-BaoKWZS #query #relational
- Efficient provenance storage for relational queries (ZB, HK, LW, XZ, SWS), pp. 1352–1361.
- CIKM-2012-ChaliHI #learning
- Improving the performance of the reinforcement learning model for answering complex questions (YC, SAH, KI), pp. 2499–2502.
- CIKM-2012-DengSZ #analysis #documentation #scalability
- Efficient jaccard-based diversity analysis of large document collections (FD, SS, SZ), pp. 1402–1411.
- CIKM-2012-GubichevN #approximate #graph #scalability
- Fast approximation of steiner trees in large graphs (AG, TN), pp. 1497–1501.
- CIKM-2012-HuangLTF #keyword #query
- Efficient safe-region construction for moving top-K spatial keyword queries (WH, GL, KLT, JF), pp. 932–941.
- CIKM-2012-HwangLKL #on the #recommendation #using
- On using category experts for improving the performance and accuracy in recommender systems (WSH, HJL, SWK, ML), pp. 2355–2358.
- CIKM-2012-KimC #approximate #composition #dependence #functional
- Decomposition-by-normalization (DBN): leveraging approximate functional dependencies for efficient tensor decomposition (MK, KSC), pp. 355–364.
- CIKM-2012-KoenigsteinRS #framework #matrix #recommendation #retrieval
- Efficient retrieval of recommendations in a matrix factorization framework (NK, PR, YS), pp. 535–544.
- CIKM-2012-KrikonCK #predict #retrieval
- Predicting the performance of passage retrieval for question answering (EK, DC, OK), pp. 2451–2454.
- CIKM-2012-KustarevUMS #predict #query
- Session-based query performance prediction (AK, YU, AM, PS), pp. 2563–2566.
- CIKM-2012-LiangZ #classification
- An efficient and simple under-sampling technique for imbalanced time series classification (GL, CZ), pp. 2339–2342.
- CIKM-2012-LiCLP #corpus #ontology
- Efficient extraction of ontologies from domain specific text corpora (TL, PC, LVSL, RP), pp. 1537–1541.
- CIKM-2012-LinTCXS #effectiveness #sentiment #using
- Effective and efficient?: bilingual sentiment lexicon extraction using collocation alignment (ZL, ST, XC, XX, WS), pp. 1542–1546.
- CIKM-2012-LinXCB #algorithm #query
- Efficient algorithms for generalized subgraph query processing (WL, XX, JC, SSB), pp. 325–334.
- CIKM-2012-LowZ #matrix #query #similarity
- Fast top-k similarity queries via matrix compression (YL, AXZ), pp. 2070–2074.
- CIKM-2012-MaRHMHZCL
- An efficient index for massive IOT data in cloud environment (YM, JR, WH, XM, XH, YZ, YC, CL), pp. 2129–2133.
- CIKM-2012-MarkovitsSKC #predict #query #retrieval
- Predicting query performance for fusion-based retrieval (GM, AS, OK, DC), pp. 813–822.
- CIKM-2012-NegahbanRG #learning #multi #scalability #statistics #using
- Scaling multiple-source entity resolution using statistically efficient transfer learning (SN, BIPR, JG), pp. 2224–2228.
- CIKM-2012-OrdonezMGTM
- Fast PCA computation in a DBMS with aggregate UDFs and LAPACK (CO, NM, CGA, PTT, EM), pp. 2219–2223.
- CIKM-2012-QahtanZW #detection #estimation
- Efficient estimation of dynamic density functions with an application to outlier detection (AAQ, XZ, SW), pp. 2159–2163.
- CIKM-2012-RenLZZ #collaboration
- The efficient imputation method for neighborhood-based collaborative filtering (YR, GL, JZ, WZ), pp. 684–693.
- CIKM-2012-SunSL #learning #multi #query
- Fast multi-task learning for query spelling correction (XS, AS, PL), pp. 285–294.
- CIKM-2012-TranC #named #sorting
- SliceSort: efficient sorting of hierarchical data (QTT, CYC), pp. 2109–2113.
- CIKM-2012-WelchSD #incremental #knowledge base
- Fast and accurate incremental entity resolution relative to an entity knowledge base (MJW, AS, CD), pp. 2667–2670.
- CIKM-2012-WustBRBKP #database #enterprise #in memory
- Efficient logging for enterprise workloads on column-oriented in-memory databases (JW, JHB, FR, SB, JK, HP), pp. 2085–2089.
- CIKM-2012-XieFTCMLL #approach #hybrid
- A hybrid approach for efficient provenance storage (YX, DF, ZT, LC, KKMR, YL, DDEL), pp. 1752–1756.
- CIKM-2012-XieZSzP #data type #linear #multi #representation
- Efficient buffer management for piecewise linear representation of multiple data streams (QX, JZ, MAS, XZ, CP), pp. 2114–2118.
- ECIR-2012-ToramanC #categorisation
- Squeezing the Ensemble Pruning: Faster and More Accurate Categorization for News Portals (CT, FC), pp. 508–511.
- ICML-2012-AvronKKS #probability
- Efficient and Practical Stochastic Subgradient Descent for Nuclear Norm Regularization (HA, SK, SPK, VS), p. 46.
- ICML-2012-BronsteinSS #learning #modelling
- Learning Efficient Structured Sparse Models (AMB, PS, GS), p. 33.
- ICML-2012-Busa-FeketeBK #classification #graph #using
- Fast classification using sparse decision DAGs (RBF, DB, BK), p. 99.
- ICML-2012-DefazioC #collaboration #visual notation
- A Graphical Model Formulation of Collaborative Filtering Neighbourhood Methods with Fast Maximum Entropy Training (AD, TSC), p. 75.
- ICML-2012-Gonen #kernel #learning #multi
- Bayesian Efficient Multiple Kernel Learning (MG), p. 17.
- ICML-2012-HoiWZJW #algorithm #bound #kernel #learning #online #scalability
- Fast Bounded Online Gradient Descent Algorithms for Scalable Kernel-Based Online Learning (SCHH, JW, PZ, RJ, PW), p. 141.
- ICML-2012-KimuraK #kernel
- Fast Computation of Subpath Kernel for Trees (DK, HK), p. 81.
- ICML-2012-KoepkeB #predict
- Fast Prediction of New Feature Utility (HAK, MB), p. 130.
- ICML-2012-KrishnamurthyBXS #algorithm #clustering
- Efficient Active Algorithms for Hierarchical Clustering (AK, SB, MX, AS), p. 39.
- ICML-2012-MahoneyDMW #approximate #matrix #statistics
- Fast approximation of matrix coherence and statistical leverage (MWM, PD, MMI, DPW), p. 137.
- ICML-2012-MerchanteGG #analysis #approach #linear
- An Efficient Approach to Sparse Linear Discriminant Analysis (LFSM, YG, GG), p. 168.
- ICML-2012-MnihT #algorithm #modelling #probability
- A fast and simple algorithm for training neural probabilistic language models (AM, YWT), p. 58.
- ICML-2012-MysoreS #markov #modelling
- Variational Inference in Non-negative Factorial Hidden Markov Models for Efficient Audio Source Separation (GJM, MS), p. 194.
- ICML-2012-SamdaniR #learning #predict
- Efficient Decomposed Learning for Structured Prediction (RS, DR), p. 200.
- ICML-2012-SchwingHPU #modelling #predict #visual notation
- Efficient Structured Prediction with Latent Variables for General Graphical Models (AGS, TH, MP, RU), p. 216.
- ICML-2012-VladymyrovC #algorithm
- Fast Training of Nonlinear Embedding Algorithms (MV, MÁCP), p. 129.
- ICML-2012-YuSL12a
- Efficient Euclidean Projections onto the Intersection of Norm Balls (AWY, HS, FFL), p. 203.
- ICPR-2012-Abdel-HakimE #analysis #component #named #online #robust
- FRPCA: Fast Robust Principal Component Analysis for online observations (AEAH, MES), pp. 413–416.
- ICPR-2012-AbouelenienY #analysis #fault #named
- SampleBoost: Improving boosting performance by destabilizing weak learners based on weighted error analysis (MA, XY), pp. 585–588.
- ICPR-2012-Al-KhaffafSCB #on the #re-engineering
- On the performance of Decapod’s digital font reconstruction (HSMAK, FS, MPC, TMB), pp. 649–652.
- ICPR-2012-AnhNKKL #automation #geometry #segmentation
- Fast automatic saliency map driven geometric active contour model for color object segmentation (NTLA, VQN, EK, SHK, GL), pp. 2557–2560.
- ICPR-2012-AskKA #equation #polynomial #symmetry
- Exploiting p-fold symmetries for faster polynomial equation solving (EA, YK, KÅ), pp. 3232–3235.
- ICPR-2012-BakrYI #clustering #documentation #incremental
- Efficient incremental phrase-based document clustering (AMB, NAY, MAI), pp. 517–520.
- ICPR-2012-DubrovinaKFSB #classification #image #robust #user interface
- Efficient and robust image descriptor for GUI object classification (AD, PK, DF, SS, RB), pp. 3594–3597.
- ICPR-2012-EdmundsonS #image #retrieval #using
- Fast JPEG image retrieval using optimised Huffman tables (DE, GS), pp. 3188–3191.
- ICPR-2012-FerrazB #3d #estimation #robust
- Fast and robust monocular 3D deformable shape estimation for inextensible and smooth surfaces (LF, XB), pp. 2104–2107.
- ICPR-2012-FreytagFRD #kernel #process #segmentation #semantics
- Efficient semantic segmentation with Gaussian processes and histogram intersection kernels (AF, BF, ER, JD), pp. 3313–3316.
- ICPR-2012-GautamSV
- An efficient, bolus-stage based method for motion correction in perfusion weighted MRI (RG, JS, RV), pp. 145–148.
- ICPR-2012-GerogiannisNL #detection #image
- Fast and efficient vanishing point detection in indoor images (DG, CN, AL), pp. 3244–3247.
- ICPR-2012-GuiLY #integer #novel
- A novel integer transform for efficient reversible watermarking (XG, XL, BY), pp. 947–950.
- ICPR-2012-GujraniyaM #classification #modelling #topic #using
- Efficient classification using phrases generated by topic models (DG, MNM), pp. 2331–2334.
- ICPR-2012-GuSM #image
- Fast image super resolution via local regression (SG, NS, FM), pp. 3128–3131.
- ICPR-2012-HoangT #orthogonal
- Fast computation of orthogonal polar harmonic transforms (TVH, ST), pp. 3160–3163.
- ICPR-2012-HsinSK #algorithm #synthesis
- A fast wavelet-packet-based algorithm for texture synthesis (HCH, TYS, LTK), pp. 3124–3127.
- ICPR-2012-Imajo #algorithm #using
- Fast Gaussian filtering algorithm using splines (KI), pp. 489–492.
- ICPR-2012-JiangES #detection #estimation #integration #robust
- Efficient and robust integration of face detection and head pose estimation (FJ, HKE, BES), pp. 1578–1581.
- ICPR-2012-LeiLL #analysis #feature model #linear #recognition
- Efficient feature selection for linear discriminant analysis and its application to face recognition (ZL, SL, SZL), pp. 1136–1139.
- ICPR-2012-LewinJC #algorithm #composition #evaluation #framework
- Framework for quantitative performance evaluation of shape decomposition algorithms (SL, XJ, AC), pp. 3696–3699.
- ICPR-2012-LiuCSTN #learning #multi #problem #recursion #scalability
- Recursive NMF: Efficient label tree learning for large multi-class problems (LL, PMC, SS, PNT, AN), pp. 2148–2151.
- ICPR-2012-LiuW12b #recognition #robust
- Accelerated robust sparse coding for fast face recognition (GL, YY, HW), pp. 3394–3397.
- ICPR-2012-LiuXL #recognition
- An efficient method for occluded face recognition (WL, XX, KML), pp. 2993–2996.
- ICPR-2012-LoLC #assessment
- Assessment of photo aesthetics with efficiency (KYL, KHL, CSC), pp. 2186–2189.
- ICPR-2012-MiksikM #detection #evaluation
- Evaluation of local detectors and descriptors for fast feature matching (OM, KM), pp. 2681–2684.
- ICPR-2012-MitraKGSMLOVM #clustering #multimodal
- Spectral clustering to model deformations for fast multimodal prostate registration (JM, ZK, SG, DS, RM, XL, AO, JCV, FM), pp. 2622–2625.
- ICPR-2012-NguyenFMO #image #retrieval
- Mapping high dimensional features onto Hilbert curve: Applying to fast image retrieval (GN, PF, RM, JMO), pp. 425–428.
- ICPR-2012-RingJKE #analysis #classification #complexity #design #embedded
- Software-based performance and complexity analysis for the design of embedded classification systems (MR, UJ, PK, BE), pp. 2266–2269.
- ICPR-2012-SchleifZGH #approximate #clustering #kernel #relational
- Fast approximated relational and kernel clustering (FMS, XZ, AG, BH), pp. 1229–1232.
- ICPR-2012-SharmaHN #classification #detection #incremental #learning
- Efficient incremental learning of boosted classifiers for object detection (PS, CH, RN), pp. 3248–3251.
- ICPR-2012-SouzaOT
- Fast global non-rigid registration for mosaic creation (RHCdS, MO, AT), pp. 2736–2739.
- ICPR-2012-SpampinatoP #detection
- Enhancing object detection performance by integrating motion objectness and perceptual organization (CS, SP), pp. 3640–3643.
- ICPR-2012-SunXAL #approach #online #video
- A tracking based fast online complete video synopsis approach (LS, JX, HA, SL), pp. 1956–1959.
- ICPR-2012-TangS #independence #learning #network #testing #using
- Efficient and accurate learning of Bayesian networks using chi-squared independence tests (YT, SNS), pp. 2723–2726.
- ICPR-2012-ThibaultA #classification #statistics
- Efficient statistical/morphological cell texture characterization and classification (GT, JA), pp. 2440–2443.
- ICPR-2012-TrinhLMMP #summary #video
- Efficient UAV video event summarization (HT, JL, SM, JM, SP), pp. 2226–2229.
- ICPR-2012-VacavantAMS
- Fast smoothed shock filtering (AV, AAK, PYM, JS), pp. 182–185.
- ICPR-2012-WakayamaDDIMT #detection #estimation #visual notation
- Estimation of the human performance for pedestrian detectability based on visual search and motion features (MW, DD, KD, II, HM, YT), pp. 1940–1943.
- ICPR-2012-WeberT #approach #documentation
- Symbol spotting for technical documents: An efficient template-matching approach (JW, ST), pp. 669–672.
- ICPR-2012-XuLCYTWCTW #classification #image #locality
- Efficient optic cup localization based on superpixel classification for glaucoma diagnosis in digital fundus images (YX, JL, JC, FY, NMT, DWKW, CYC, YCT, TYW), pp. 49–52.
- ICPR-2012-YaoZLL #algorithm #effectiveness #modelling
- A fast and effective appearance model-based particle filtering object tracking algorithm (ZY, YZ, JL, WL), pp. 1475–1478.
- ICPR-2012-ZarifFR #image #multi #similarity #using
- Fast and efficient multichannel image completion using local similarity (SZ, IF, DR), pp. 3116–3119.
- ICPR-2012-ZhuSX #segmentation
- An efficient r-KDE model for the segmentation of dynamic scenes (QZ, ZS, YX), pp. 198–201.
- KDD-2012-AgarwalSS #named
- SmartDispatch: enabling efficient ticket dispatch in an IT service environment (SA, RS, BS), pp. 1393–1401.
- KDD-2012-BharadwajCMNTVVY #algorithm #named
- SHALE: an efficient algorithm for allocation of guaranteed display advertising (VB, PC, WM, CN, JT, SV, EV, JY), pp. 1195–1203.
- KDD-2012-CadonnaGB #pattern matching
- Efficient event pattern matching with match windows (BC, JG, MHB), pp. 471–479.
- KDD-2012-ChengZKC #algorithm #clique #memory management
- Fast algorithms for maximal clique enumeration with limited memory (JC, LZ, YK, SC), pp. 1240–1248.
- KDD-2012-FujiwaraNYSO #assurance #personalisation #rank
- Efficient personalized pagerank with accuracy assurance (YF, MN, TY, HS, MO), pp. 15–23.
- KDD-2012-KuksaP #evaluation #kernel #scalability #sequence
- Efficient evaluation of large sequence kernels (PPK, VP), pp. 759–767.
- KDD-2012-LappasVG #invariant #mining
- Efficient and domain-invariant competitor mining (TL, GV, DG), pp. 408–416.
- KDD-2012-LiLP #coordination #using
- Fast bregman divergence NMF using taylor expansion and coordinate descent (LL, GL, HP), pp. 307–315.
- KDD-2012-MarchCG #algorithm #correlation
- Fast algorithms for comprehensive n-point correlation estimates (WBM, AJC, AGG), pp. 1478–1486.
- KDD-2012-MatsubaraSFIY #mining
- Fast mining and forecasting of complex time-stamped events (YM, YS, CF, TI, MY), pp. 271–279.
- KDD-2012-OuyangG #adaptation #named
- NASA: achieving lower regrets and faster rates via adaptive stepsizes (HO, AGG), pp. 159–167.
- KDD-2012-RoyTA #hardware #manycore
- Efficient frequent item counting in multi-core hardware (PR, JT, GA), pp. 1451–1459.
- KDD-2012-WangAB #modelling #named #online #social #social media #topic
- TM-LDA: efficient online modeling of latent topic transitions in social media (YW, EA, MB), pp. 123–131.
- KDD-2012-YinZC #algorithm #mining #named
- USpan: an efficient algorithm for mining high utility sequential patterns (JY, ZZ, LC), pp. 660–668.
- KDIR-2012-dAciernoLSV #retrieval
- An Efficient Strategy for Spatio-temporal Data Indexing and Retrieval (Ad, ML, AS, MV), pp. 227–232.
- KDIR-2012-FormosoFCC #recommendation #using
- Using Neighborhood Pre-computation to Increase Recommendation Efficiency (VF, DF, FC, VC), pp. 333–335.
- KDIR-2012-GarciaGG #information management #predict #validation
- Predicting the Efficiency with Knowledge Discovery of a Budgeted Company: A Cuban University — Validation through Three Semesters (LIG, IG, RG), pp. 315–318.
- KR-2012-CravenTCHW
- Efficient Argumentation for Medical Decision-Making (RC, FT, CC, AH, MW).
- KR-2012-Rodriguez-MuroC #ontology #query
- High Performance Query Answering over DL-Lite Ontologies (MRM, DC).
- MLDM-2012-BharambeDP #named
- BINER — BINary Search Based Efficient Regression (SB, HD, VP), pp. 76–85.
- MLDM-2012-SinghCS #approach #hybrid #recognition #using
- A Hybrid Approach to Increase the Performance of Protein Folding Recognition Using Support Vector Machines (LS, GC, DS), pp. 660–668.
- SEKE-2012-CostaCORSZ #generative #modelling #testing
- Generating Performance Test Scripts and Scenarios Based on Abstract Intermediate Models (LTC, RMC, FMdO, EdMR, MBdS, AFZ), pp. 112–117.
- SEKE-2012-MCRM #effectiveness #usability
- Measuring the Effect Of Usability Mechanisms On User Efficiency, Effectiveness and Satisfaction (MA, DMC, ADlR, AMM), pp. 599–604.
- SEKE-2012-RahmaniAS #modelling #petri net #web #web service
- Petri Net Modeling of Application Server Performance for Web Services (MR, AHA, HPS), pp. 305–310.
- SEKE-2012-SouzaR
- A proposal for the improvement of the technique of Earned Value Management utilizing the history of performance data (ADdS, ARCdR), pp. 753–758.
- SIGIR-2012-BonchiPSVV #query #recommendation
- Efficient query recommendations in the long tail via center-piece subgraphs (FB, RP, FS, HV, RV), pp. 345–354.
- SIGIR-2012-CarmelK #information retrieval #predict #query
- Query performance prediction for IR (DC, OK), pp. 1196–1197.
- SIGIR-2012-CulpepperPS #documentation #in memory #retrieval
- Efficient in-memory top-k document retrieval (JSC, MP, FS), pp. 225–234.
- SIGIR-2012-Cummins #modelling #monte carlo #predict #simulation #using
- Investigating performance predictors using monte carlo simulation and score distribution models (RC), pp. 1097–1098.
- SIGIR-2012-KovesiGA #categorisation #learning #multi #online
- Fast on-line learning for multilingual categorization (MK, CG, MRA), pp. 1071–1072.
- SIGIR-2012-LiWLF #query
- Supporting efficient top-k queries in type-ahead search (GL, JW, CL, JF), pp. 355–364.
- SIGIR-2012-MetrikovPA #ranking
- Impact of assessor disagreement on ranking performance (PM, VP, JAA), pp. 1091–1092.
- SIGIR-2012-ParkerYGY #estimation
- Efficient estimation of aspect weights (JP, AY, NG, WGY), pp. 1057–1058.
- SIGIR-2012-YuLZZL #estimation #network #scalability #towards
- SimFusion+: extending simfusion towards efficient estimation on large and dynamic networks (WY, XL, WZ, YZ, JL), pp. 365–374.
- SIGIR-2012-ZhangSCC #keyword #named #query
- See-to-retrieve: efficient processing of spatio-visual keyword queries (CZ, LS, KC, GC), pp. 681–690.
- SIGIR-2012-ZhangWDH #detection #learning #reuse
- Learning hash codes for efficient content reuse detection (QZ, YW, ZD, XH), pp. 405–414.
- ECMFA-2012-WinklerFGM
- BOB the Builder: A Fast and Friendly Model-to-PetriNet Transformer (UW, MF, WG, AM), pp. 416–427.
PLEASE-2012-BaumgartFP #approach #certification #component #functional #safety #towards #using- Towards efficient functional safety certification of construction machinery using a component-based approach (SB, JF, SP), pp. 1–4.
- SPLC-2012-AndersenCSW #feature model #modelling #synthesis
- Efficient synthesis of feature models (NA, KC, SS, AW), pp. 106–115.
TOOLS-EUROPE-J-2011-LavalFVD12 #ranking #retrieval #scalability- Efficient Retrieval and Ranking of Undesired Package Cycles in Large Software Systems (JL, JRF, PV, SD), pp. 1–24.
- OOPSLA-2012-HaydenSDHF #c #named
- Kitsune: efficient, general-purpose dynamic software updating for C (CMH, EKS, MD, MH, JSF), pp. 249–264.
- OOPSLA-2012-LiuSLG #algorithm #distributed
- From clarity to efficiency for distributed algorithms (YAL, SDS, BL, MG), pp. 395–410.
- OOPSLA-2012-SartorE #concurrent #hardware #java #manycore #thread
- Exploring multi-threaded Java application performance on multicore hardware (JBS, LE), pp. 281–296.
- OOPSLA-2012-SolodkyyRS #c++
- Open and efficient type switch for C++ (YS, GDR, BS), pp. 963–982.
- TOOLS-EUROPE-2012-BergmannHHRUV #emf #query #state of the art #tool support
- Integrating Efficient Model Queries in State-of-the-Art EMF Tools (GB, ÁH, ÁH, IR, ZU, DV), pp. 1–8.
- TOOLS-EUROPE-2012-VranyKG #smalltalk
- Efficient Method Lookup Customization for Smalltalk (JV, JK, CG), pp. 124–139.
- AdaEurope-2012-GregertsenS #execution #hardware #using
- Improving the Performance of Execution Time Control by Using a Hardware Time Management Unit (KNG, AS), pp. 177–192.
- AdaEurope-2012-PolzlbauerBB #constraints #design #realtime #reliability
- Efficient Constraint Handling during Designing Reliable Automotive Real-Time Systems (FP, IB, EB), pp. 207–220.
HILT-2012-Kirtchev #compilation #implementation #robust- A new robust and efficient implementation of controlled types in the GNAT compiler (HHK), pp. 43–50.
- PADL-2012-HaveC #program transformation #using
- Efficient Tabling of Structured Data Using Indexing and Program Transformation (CTH, HC), pp. 93–107.
- PEPM-2012-Puschel #compilation
- Compiling math to fast code (MP), pp. 1–2.
- PLDI-2012-HackettG #hybrid #javascript #precise #type inference
- Fast and precise hybrid type inference for JavaScript (BH, SyG), pp. 239–250.
- PLDI-2012-JinSSSL #comprehension #debugging #detection
- Understanding and detecting real-world performance bugs (GJ, LS, XS, JS, SL), pp. 77–88.
- PLDI-2012-KuznetsovKBC #execution #symbolic computation
- Efficient state merging in symbolic execution (VK, JK, SB, GC), pp. 193–204.
- PLDI-2012-MorrisettTTTG #named
- RockSalt: better, faster, stronger SFI for the x86 (GM, GT, JT, JBT, EG), pp. 395–404.
- POPL-2012-ZhuMKR #approximate #program transformation #random
- Randomized accuracy-aware program transformations for efficient approximate computations (ZAZ, SM, JAK, MCR), pp. 441–454.
- QAPL-2012-BortolussiGH #hybrid #modelling #network
- Hybrid performance modelling of opportunistic networks (LB, VG, JH), pp. 106–121.
- QAPL-2012-Giro #model checking
- Efficient computation of exact solutions for quantitative model checking (SG), pp. 17–32.
- SAS-2012-LeePMH #analysis #parallel
- Efficient May Happen in Parallel Analysis for Async-Finish Parallelism (JKL, JP, RM, HH), pp. 5–23.
- RE-2012-GreenyerSCH #consistency #product line #specification
- Efficient consistency checking of scenario-based product-line specifications (JG, AMS, MC, PH), pp. 161–170.
- RE-2012-MendizabalSS #approach #elicitation #requirements
- Log-based approach for performance requirements elicitation and prioritization (OMM, MS, RS), pp. 297–302.
- ASE-2012-ApelLL #precise
- Structured merge with auto-tuning: balancing precision and performance (SA, OL, CL), pp. 120–129.
- ASE-2012-HaiducBOLM #assessment #automation #query #retrieval
- Automatic query performance assessment during the retrieval of software artifacts (SH, GB, RO, ADL, AM), pp. 90–99.
- ASE-2012-Shang0X #analysis #experience #incremental #points-to #precise #summary
- Fast and precise points-to analysis with incremental CFL-reachability summarisation: preliminary experience (LS, YL, JX), pp. 270–273.
- ASE-2012-WestermannHKF #automation #predict
- Automated inference of goal-oriented performance prediction functions (DW, JH, RK, RF), pp. 190–199.
- FSE-2012-ParkHHCGTFX #named
- CarFast: achieving higher statement coverage faster (SP, BMMH, IH, CC, MG, KT, CF, QX), p. 35.
- FSE-2012-ShaikhW #diagrams #ocl #slicing #uml #verification
- UMLtoCSP (UOST): a tool for efficient verification of UML/OCL class diagrams through model slicing (AS, UKW), p. 37.
- ICSE-2012-BalasubramaniamJKMN #approach #automation #constraints #generative #theorem proving
- An automated approach to generating efficient constraint solvers (DB, CJ, LK, IM, PN), pp. 661–671.
- ICSE-2012-Blincoe #coordination #developer #process
- Timely and efficient facilitation of coordination of software developers’ activities (KB), pp. 1539–1542.
- ICSE-2012-DevosPDBMA #case study #industrial #reuse #smarttech #using
- Efficient reuse of domain-specific test knowledge: An industrial case in the smart card domain (ND, CP, JCD, RB, BM, GA), pp. 1123–1132.
- ICSE-2012-EsteveKNPY #analysis #correctness #dependence #safety
- Formal correctness, safety, dependability, and performance analysis of a satellite (MAE, JPK, VYN, BP, YY), pp. 1022–1031.
- ICSE-2012-GambiT #modelling
- Modeling Cloud performance with Kriging (AG, GT), pp. 1439–1440.
- ICSE-2012-GrechanikFX #automation #learning #problem #testing
- Automatically finding performance problems with feedback-directed learning software testing (MG, CF, QX), pp. 156–166.
- ICSE-2012-HanDGZX #debugging #in the large #mining #stack
- Performance debugging in the large via mining millions of stack traces (SH, YD, SG, DZ, TX), pp. 145–155.
- ICSE-2012-JinMLR #framework #monitoring #named #parametricity #runtime
- JavaMOP: Efficient parametric runtime monitoring framework (DJ, POM, CL, GR), pp. 1427–1430.
- ICSE-2012-NistorLPGM #automation #clustering #generative #named #parallel #random #testing #thread
- Ballerina: Automatic generation and clustering of efficient random unit tests for multithreaded code (AN, QL, MP, TRG, DM), pp. 727–737.
- ICSE-2012-SiegmundKKABRS #automation #detection #predict
- Predicting performance via automated feature-interaction detection (NS, SSK, CK, SA, DSB, MR, GS), pp. 167–177.
- ICSE-2012-Westermann #developer #feedback
- A generic methodology to derive domain-specific performance feedback for developers (DW), pp. 1527–1530.
- ICSE-2012-YanXR #java #problem #profiling
- Uncovering performance problems in Java applications with reference propagation profiling (DY, G(X, AR), pp. 134–144.
- SAC-2012-AbdullahRTN #using
- Efficient matching of SPARQL subscriptions using rete (HA, MR, ST, EN), pp. 372–377.
- SAC-2012-AbusubaihRAS
- Performance of MIMO 802.11n in heterogeneous deployments (MA, MR, MA, FS), pp. 600–604.
- SAC-2012-AhmadiJR #evaluation #game studies
- Performance evaluation of user-created open-web games (NA, MJ, AR), pp. 730–732.
- SAC-2012-BasuVDK #case study #collaboration #privacy
- Feasibility of a privacy preserving collaborative filtering scheme on the Google App Engine: a performance case study (AB, JV, TD, HK), pp. 447–452.
- SAC-2012-BlankH #information retrieval #metric #multi
- Inverted file-based indexing for efficient multimedia information retrieval in metric spaces (DB, AH), pp. 900–905.
- SAC-2012-DixitMC #adaptation
- Timeout-based adaptive consensus: improving performance through adaptation (MD, HM, AC), pp. 492–497.
- SAC-2012-JungJCHJCJK
- A fast mount mechanism for YAFFS2 (JJ, JJ, YC, HH, GJ, SC, MJ, JYK), pp. 1791–1795.
- SAC-2012-KimPJSCH #garbage collection #hybrid #named
- AAGC: an efficient associativity-aware garbage collection scheme for hybrid FTLs (BK, MP, CJ, COS, YC, JH), pp. 1785–1790.
- SAC-2012-KosinaG #multi #problem
- Very Fast Decision Rules for multi-class problems (PK, JG), pp. 795–800.
- SAC-2012-LiuHHYS #multi
- An application of circumscribed circle filter in the Multi-Stencils Fast Marching method (HL, CCH, HH, MY, ES), pp. 33–38.
- SAC-2012-MaggiorePBA #3d #compilation #safety
- A compilation technique to increase X3D performance and safety (GM, FP, MB, MA), pp. 969–974.
- SAC-2012-MatsubaraMYUIK #algorithm #named #re-engineering
- CCDR-PAID: more efficient cache-conscious PAID algorithm by data reconstruction (YM, JM, GY, YU, SI, HK), pp. 193–198.
- SAC-2012-OongI #classification #fuzzy #learning #multi #testing
- Multilayer Fuzzy ARTMAP: fast learning and fast testing for pattern classification (THO, NAMI), pp. 27–32.
- SAC-2012-RodoperBJT #framework #mobile #security
- An efficient security framework for mobile WiMAX (MR, AB, EJ, WT), pp. 1494–1501.
- SAC-2012-SwainCNB #analysis #markov #using
- Performance analysis of IEEE 802.11 IBSS power save mode using a discrete-time markov model (PS, SC, SN, PB), pp. 631–633.
- SAC-2012-TavaresAMOHAMDN #evaluation
- Performance evaluation of medical imaging service (ET, JA, PRMM, DO, EH, RA, LM, AD, MN), pp. 1349–1354.
- GPCE-2012-AxelsenK #java #semantics #text-to-text
- Package templates: a definition by semantics-preserving source-to-source transformations to efficient Java code (EWA, SK), pp. 50–59.
- GPCE-2012-BauerEFP #adaptation
- Faster program adaptation through reward attribution inference (TB, ME, AF, JP), pp. 103–111.
- ASPLOS-2012-CaulfieldMEDCS
- Providing safe, user space access to fast, solid state disks (AMC, TIM, LAE, AD, JC, SS), pp. 387–400.
- ASPLOS-2012-CheritonFSSA #architecture #data access #named
- HICAMP: architectural support for efficient concurrency-safe shared structured data access (DRC, AF, AS, JPS, OA), pp. 287–300.
- ASPLOS-2012-GordonAHBLST #eli #named
- ELI: bare-metal performance for I/O virtualization (AG, NA, NH, MBY, AL, AS, DT), pp. 411–422.
- ASPLOS-2012-HongCSO #analysis #domain-specific language #graph #named
- Green-Marl: a DSL for easy and efficient graph analysis (SH, HC, ES, KO), pp. 349–362.
- ASPLOS-2012-LinNGR #consistency
- Efficient sequential consistency via conflict ordering (CL, VN, RG, BR), pp. 273–286.
- ASPLOS-2012-ParkSPCM #architecture
- SIMD defragmenter: efficient ILP realization on data-parallel architectures (YP, SS, HP, HKC, SAM), pp. 363–374.
- CASE-2012-ChenZAB #analysis #approach #realtime
- Real-time performance analysis of production lines: A system-theoretic approach (GC, LZ, JA, SB), pp. 656–661.
- CASE-2012-CostantinoDEFS #analysis #evaluation #fuzzy #novel
- A novel fuzzy Data Envelopment Analysis methodology for performance evaluation in a two-stage supply chain (NC, MD, NE, MF, FS), pp. 974–979.
- CASE-2012-FantiIMU #case study #design #evaluation
- A three level strategy for the design and performance evaluation of Hospital Departments: A case study (MPF, GI, AMM, WU), pp. 323–328.
- CASE-2012-HamPL #empirical
- Experiment for attaching performance of a fan and vacuum pad on grooved vertical concrete walls (YBH, CDP, BJL), pp. 1010–1015.
- CASE-2012-Kalir #maintenance
- Segregating preventive maintenance work for factory performance improvement (AK), pp. 646–649.
- CASE-2012-MeikePBVR #energy #industrial #multi
- Increasing the energy efficiency of multi-robot production lines in the automotive industry (DM, MP, GB, AV, LR), pp. 700–705.
- CASE-2012-NazeemR #algorithm #resource management
- An efficient algorithm for the enumeration of the minimal unsafe states in complex resource allocation systems (AN, SAR), pp. 686–693.
- CASE-2012-NguyenOTMA #multi
- High-speed autofocusing of multisized microobjects (CNN, KO, TT, YM, TA), pp. 34–39.
- CASE-2012-NilakantanP #assembly #problem
- An efficient PSO for type II robotic assembly line balancing problem (JMN, SGP), pp. 600–605.
- CASE-2012-ParkM #behaviour #bound #clustering #hybrid #linear #tool support
- Performance bounds for hybrid flow lines: Fundamental behavior, practical features and application to linear cluster tools (KP, JRM), pp. 371–376.
- CASE-2012-ParulkarSK #automation #random
- Fast randomized planner for SLAM automation (AP, PS, KMK), pp. 765–770.
- CASE-2012-WangW #energy
- Occupancy pattern based intelligent control for improving energy efficiency in buildings (ZW, LW), pp. 804–809.
- CASE-2012-XieLSD #agile #delivery #evaluation #modelling
- Improving rapid response operations in acute care delivery — part I: System modeling and performance evaluation (XX, JL, CHS, PD), pp. 303–308.
- CC-2012-KarrenbergH
- Improving Performance of OpenCL on CPUs (RK, SH), pp. 1–20.
- CGO-2012-MatosevicA #analysis #bottom-up #data access #summary
- Efficient bottom-up heap analysis for symbolic path-based data access summaries (IM, TSA), pp. 252–263.
- CGO-2012-SembrantBH #modelling #profiling
- Phase guided profiling for fast cache modeling (AS, DBS, EH), pp. 175–185.
- CGO-2012-VankaT #data flow #dependence #profiling #using
- Efficient and accurate data dependence profiling using software signatures (RV, JT), pp. 186–195.
- DAC-2012-ChungJ #analysis #functional
- Functional timing analysis made fast and general (YTC, JHRJ), pp. 1055–1060.
- DAC-2012-Gester0NPSV #algorithm #data type
- Algorithms and data structures for fast and good VLSI routing (MG, DM, TN, CP, CS, JV), pp. 459–464.
- DAC-2012-JiangZZY #embedded #multi #scalability
- Constructing large and fast multi-level cell STT-MRAM based cache for embedded processors (LJ, BZ, YZ, JY), pp. 907–912.
- DAC-2012-JogMXXNID #architecture
- Cache revive: architecting volatile STT-RAM caches for enhanced performance in CMPs (AJ, AKM, CX, YX, VN, RI, CRD), pp. 243–252.
- DAC-2012-KimYL #latency #ram
- Write performance improvement by hiding R drift latency in phase-change RAM (YK, SY, SL), pp. 897–906.
- DAC-2012-KuoHCKC #design #monte carlo
- Efficient trimmed-sample Monte Carlo methodology and yield-aware design flow for analog circuits (CCK, WYH, YHC, JFK, YKC), pp. 1113–1118.
- DAC-2012-LiuARVG #component #multi #synthesis
- Efficient multi-objective synthesis for microwave components based on computational intelligence techniques (BL, HA, SR, GAEV, GGEG), pp. 542–548.
- DAC-2012-LiuCL #algorithm #multi
- An efficient algorithm for multi-layer obstacle-avoiding rectilinear Steiner tree construction (CHL, ICC, DTL), pp. 613–622.
- DAC-2012-MeirR #analysis #biology #named #network #using
- BLAST: efficient computation of nonlinear delay sensitivities in electronic and biological networks using barycentric Lagrange enabled transient adjoint analysis (AM, JSR), pp. 301–310.
- DAC-2012-MelpignanoBFJLHCD #embedded #evaluation #framework #manycore #platform #visual notation
- Platform 2012, a many-core computing accelerator for embedded SoCs: performance evaluation of visual analytics applications (DM, LB, EF, BJ, TL, GH, FC, DD), pp. 1137–1142.
- DAC-2012-MengKC #3d #constraints #energy #manycore #optimisation
- Optimizing energy efficiency of 3-D multicore systems with stacked DRAM under power and thermal constraints (JM, KK, AKC), pp. 648–655.
- DAC-2012-ParkGMRR #architecture #design #energy #using
- Future cache design using STT MRAMs for improved energy efficiency: devices, circuits and architecture (SPP, SKG, NNM, AR, KR), pp. 492–497.
- DAC-2012-PinckneySDFMSB
- Assessing the performance limits of parallelized near-threshold computing (NRP, KS, RGD, DF, TNM, DS, DB), pp. 1147–1152.
- DAC-2012-SartoriK #compilation #energy
- Compiling for energy efficiency on timing speculative processors (JS, RK), pp. 1301–1308.
- DAC-2012-SeversonYD #question #reduction
- Not so fast my friend: is near-threshold computing the answer for power reduction of wireless devices? (MS, KY, YD), pp. 1164–1166.
- DAC-2012-SironiBCCHSS #adaptation #named #operating system #self
- Metronome: operating system level performance management via self-adaptive computing (FS, DBB, SC, FC, HH, DS, MDS), pp. 856–865.
- DAC-2012-SuYZ #named #order #reduction
- AMOR: an efficient aggregating based model order reduction method for many-terminal interconnect circuits (YS, FY, XZ), pp. 295–300.
- DAC-2012-WangW #algorithm #memory management
- Observational wear leveling: an efficient algorithm for flash memory management (CW, WFW), pp. 235–242.
- DAC-2012-WenZCWX #analysis #named #reliability #scalability #statistics
- PS3-RAM: a fast portable and scalable statistical STT-RAM reliability analysis method (WW, YZ, YC, YW, YX), pp. 1191–1196.
- DAC-2012-ZhangLWFW #higher-order #reduction
- Fast nonlinear model order reduction via associated transforms of high-order volterra transfer functions (YZ, HL, QW, NF, NW), pp. 289–294.
- DAC-2012-ZhangWCHL #fine-grained #multi
- Heterogeneous multi-channel: fine-grained DRAM control for both system performance and power efficiency (GZ, HW, XC, SH, PL), pp. 876–881.
- DAC-2012-ZhaoF #on the fly #simulation #towards
- Towards efficient SPICE-accurate nonlinear circuit simulation with on-the-fly support-circuit preconditioners (XZ, ZF), pp. 1119–1124.
- DATE-2012-0002EGB #using
- Area efficient asynchronous SDM routers using 2-stage Clos switches (WS, DAE, JDG, WJB), pp. 1495–1500.
- DATE-2012-AkbariSFB #3d #low cost #named #reliability
- AFRA: A low cost high performance reliable routing for 3D mesh NoCs (SA, AS, MF, RB), pp. 332–337.
- DATE-2012-BartoliniSFCB #energy #scalability
- Quantifying the impact of frequency scaling on the energy efficiency of the single-chip cloud computer (AB, MS, JNF, AKC, LB), pp. 181–186.
- DATE-2012-CupaiuoloI #flexibility #framework #implementation #platform
- A flexible and fast software implementation of the FFT on the BPE platform (TC, DLI), pp. 1467–1470.
- DATE-2012-DangWTLYW #energy #named
- S/DC: A storage and energy efficient data prefetcher (XD, XW, DT, JL, JY, KW), pp. 461–466.
- DATE-2012-DonnoFSPB #energy
- Mechatronic system for energy efficiency in bus transport (MD, AF, AS, PP, AB), pp. 342–343.
- DATE-2012-DuVM #latency #reliability
- High performance reliable variable latency carry select addition (KD, PJV, KM), pp. 1257–1262.
- DATE-2012-FritzBAH #approach #evaluation #monitoring
- Evaluation of a new RFID system performance monitoring approach (GF, VB, OEKA, DH), pp. 1439–1442.
- DATE-2012-HankendiC #energy #parallel
- Reducing the energy cost of computing through efficient co-scheduling of parallel workloads (CH, AKC), pp. 994–999.
- DATE-2012-KesslerDTNRDBTP #aspect-oriented #manycore #programmable
- Programmability and performance portability aspects of heterogeneous multi-/manycore systems (CWK, UD, ST, RN, AR, UD, SB, JLT, SP), pp. 1403–1408.
- DATE-2012-KwongG #architecture #constant #geometry
- A high performance split-radix FFT with constant geometry architecture (JK, MG), pp. 1537–1542.
- DATE-2012-LiangCZRZJC #3d #implementation #locality #optimisation #realtime
- Real-time implementation and performance optimization of 3D sound localization on GPUs (YL, ZC, SZ, KR, YZ, DLJ, DC), pp. 832–835.
- DATE-2012-LiH #analysis #logic #named #reliability
- RAG: An efficient reliability analysis of logic circuits on graphics processing units (ML, MSH), pp. 316–319.
- DATE-2012-LiuMG #estimation #problem
- A fast analog circuit yield estimation method for medium and high dimensional problems (BL, JM, GGEG), pp. 751–756.
- DATE-2012-LvKE #multi #reduction #verification
- Efficient Gröbner basis reductions for formal verification of galois field multipliers (JL, PK, FE), pp. 899–904.
- DATE-2012-MahmoodSD #framework #linear #modelling #multi
- An efficient framework for passive compact dynamical modeling of multiport linear systems (ZM, RS, LD), pp. 1203–1208.
- DATE-2012-MandalKM #design
- A fast, source-synchronous ring-based network-on-chip design (AM, SPK, RNM), pp. 1489–1494.
- DATE-2012-MarongiuBB #clustering #embedded #lightweight #parallel
- Fast and lightweight support for nested parallelism on cluster-based embedded many-cores (AM, PB, LB), pp. 105–110.
- DATE-2012-MeissnerMLH #framework #graph #morphism #synthesis #testing
- Fast isomorphism testing for a graph-based analog circuit synthesis framework (MM, OM, LL, LH), pp. 757–762.
- DATE-2012-MengC #3d #analysis #energy #runtime
- Analysis and runtime management of 3D systems with stacked DRAM for boosting energy efficiency (JM, AKC), pp. 611–616.
- DATE-2012-NassarSGD #named
- RSM: A small and fast countermeasure for AES, secure against 1st and 2nd-order zero-offset SCAs (MN, YS, SG, JLD), pp. 1173–1178.
- DATE-2012-PattiAAOCJJM #energy #middleware #network
- Middleware services for network interoperability in smart energy efficient buildings (EP, AA, FA, AO, AC, MJ, MJ, EM), pp. 338–339.
- DATE-2012-PomataMTRL #design
- Exploiting binary translation for fast ASIP design space exploration on FPGAs (SP, PM, GT, LR, ML), pp. 566–569.
- DATE-2012-Shahid #estimation
- Cross entropy minimization for efficient estimation of SRAM failure rate (MAS), pp. 230–235.
- DATE-2012-SinkarWK #manycore #optimisation
- Workload-aware voltage regulator optimization for power efficient multi-core processors (AAS, HW, NSK), pp. 1134–1137.
- DATE-2012-StefanMAG #multi
- A TDM NoC supporting QoS, multicast, and fast connection set-up (RAS, AMM, JAA, KG), pp. 1283–1288.
- DATE-2012-StipicTZCUV #data access #hardware #metadata #named
- TagTM — accelerating STMs with hardware tags for fast meta-data access (SS, ST, FZ, AC, OSÜ, MV), pp. 39–44.
- DATE-2012-ThachTKI #estimation
- Fast cycle estimation methodology for instruction-level emulator (DT, YT, SK, AI), pp. 248–251.
- DATE-2012-ThieleE #analysis #data flow #graph #optimisation
- Optimizing performance analysis for synchronous dataflow graphs with shared resources (DT, RE), pp. 635–640.
- DATE-2012-VatajeluF #evaluation #parametricity #reliability
- Efficiency evaluation of parametric failure mitigation techniques for reliable SRAM operation (EIV, JF), pp. 1343–1348.
- DATE-2012-WeisLBW #3d #energy
- An energy efficient DRAM subsystem for 3D integrated SoCs (CW, IL, LB, NW), pp. 1138–1141.
- DATE-2012-XhakoniBG #3d #image
- Impact of TSV area on the dynamic range and frame rate performance of 3D-integrated image sensors (AX, DSSB, GGEG), pp. 836–839.
- DATE-2012-XuYCJW #3d
- Efficient variation-aware EM-semiconductor coupled solver for the TSV structures in 3D IC (YX, WY, QC, LJ, NW), pp. 1409–1412.
- HPCA-2012-AwasthiSSRBS
- Efficient scrub mechanisms for error-prone emerging memories (MA, MS, KS, BR, RB, VS), pp. 15–26.
- HPCA-2012-ChenCGTWH #statistics
- Statistical performance comparisons of computers (TC, YC, QG, OT, YW, WH), pp. 399–410.
- HPCA-2012-LinMHSC #named
- Parabix: Boosting the efficiency of text processing on commodity processors (DL, NM, KSH, AS, RDC), pp. 373–384.
- HPCA-2012-MaJW #communication
- Supporting efficient collective communication in NoCs (SM, NDEJ, ZW), pp. 165–176.
- HPCA-2012-MaJW12a #adaptation #algorithm #design
- Whole packet forwarding: Efficient design of fully adaptive routing algorithms for networks-on-chip (SM, NDEJ, ZW), pp. 467–478.
- HPCA-2012-PanDWZ #enterprise #memory management
- Quasi-nonvolatile SSD: Trading flash memory nonvolatility to improve storage system performance for enterprise applications (YP, GD, QW, TZ), pp. 179–188.
- HPCA-2012-YanLHLGL #architecture #hybrid #manycore #named
- AgileRegulator: A hybrid voltage regulator scheme redeeming dark silicon for power efficiency in a multicore architecture (GY, YL, YH, XL, MG, XL), pp. 287–298.
- HPDC-2012-BaeXDL #adaptation #energy #multi
- Dynamic adaptive virtual core mapping to improve power, energy, and performance in multi-socket multicores (CB, LX, PAD, JRL), pp. 247–258.
- HPDC-2012-ChenASYB #multi #question
- Achieving application-centric performance targets via consolidation on multicores: myth or reality? (LYC, DA, ES, AY, WB), pp. 37–48.
- HPDC-2012-GuptaKMFKMGSL #in the cloud #platform
- Exploring the performance and mapping of HPC applications to platforms in the cloud (AG, LVK, DSM, PF, RK, VM, FG, CHS, BSL), pp. 121–122.
- HPDC-2012-MooreK #encapsulation #framework #logic
- A resiliency model for high performance infrastructure based on logical encapsulation (JJM, CK), pp. 283–294.
- HPDC-2012-PasettoMFPX #architecture #communication #evaluation #manycore #parallel #thread
- Performance evaluation of interthread communication mechanisms on multicore/multithreaded architectures (DP, MM, HF, FP, JX), pp. 131–132.
- HPDC-2012-SkourtisKB #black box #named
- QBox: guaranteeing I/O performance on black box storage systems (DS, SK, SAB), pp. 73–84.
- HPDC-2012-TianKYAWPGW #data transformation
- A system-aware optimized data organization for efficient scientific analytics (YT, SK, WY, HA, BW, NP, RWG, MW), pp. 125–126.
- HPDC-2012-XiaCLTDB #named #network
- VNET/P: bridging the cloud and high performance computing through fast overlay networking (LX, ZC, JRL, YT, PAD, PGB), pp. 259–270.
- ISMM-2012-Nasre #analysis #constraints #graph #points-to
- Exploiting the structure of the constraint graph for efficient points-to analysis (RN), pp. 121–132.
- LCTES-2012-KhudiaWM #embedded #fault #using
- Efficient soft error protection for commodity embedded microprocessors using profile information (DSK, GW, SAM), pp. 99–108.
- OSDI-2012-AttariyanCF #automation #named
- X-ray: Automating Root-Cause Diagnosis of Performance Anomalies in Production Software (MA, MC, JF), pp. 307–320.
- OSDI-2012-KimCZ #web
- Efficient Patch-based Auditing for Web Application Vulnerabilities (TK, RC, NZ), pp. 193–206.
- OSDI-2012-LiPCGPR #consistency
- Making Geo-Replicated Systems Fast as Possible, Consistent when Necessary (CL, DP, AC, JG, NMP, RR), pp. 265–278.
- OSDI-2012-RavindranathPAMOS #mobile #monitoring #named
- AppInsight: Mobile App Performance Monitoring in the Wild (LR, JP, SA, RM, IO, SS), pp. 107–120.
- OSDI-2012-ShueFS #multitenancy
- Performance Isolation and Fairness for Multi-Tenant Cloud Storage (DS, MJF, AS), pp. 349–362.
- PDP-2012-AchourN #approach #clustering #multi #predict
- A Performance Prediction Approach for MPI Routines on Multi-clusters (SA, WN), pp. 125–129.
- PDP-2012-CelikB
- Effect of Application Mapping on Network-on-Chip Performance (CÇ, CFB), pp. 465–472.
- PDP-2012-DilchM #algorithm #analysis #architecture #gpu #novel #optimisation
- Optimization Techniques and Performance Analyses of Two Life Science Algorithms for Novel GPU Architectures (DD, EM), pp. 376–383.
- PDP-2012-GavaGP #algorithm #protocol #security
- Performance Evaluations of a BSP Algorithm for State Space Construction of Security Protocols (FG, MG, FP), pp. 170–174.
- PDP-2012-KuhnKL #evaluation #optimisation
- Simulation-Aided Performance Evaluation of Server-Side Input/Output Optimizations (MK, JMK, TL), pp. 562–566.
- PDP-2012-RahmaniLPT #3d #architecture
- An Efficient Hybridization Scheme for Stacked Mesh 3D NoC Architecture (AMR, PL, JP, HT), pp. 507–514.
- PDP-2012-RungsawangM #clustering #gpu #rank
- Fast PageRank Computation on a GPU Cluster (AR, BM), pp. 450–456.
- PDP-2012-SaenkoK #algorithm #design #evaluation #mining #problem #search-based
- Design and Performance Evaluation of Improved Genetic Algorithm for Role Mining Problem (IS, IVK), pp. 269–274.
- PDP-2012-TaoFWM #architecture #manycore #virtual machine
- A Performance Study of Virtual Machines on Multicore Architectures (JT, KF, LW, HM), pp. 89–96.
- PDP-2012-WangSYR #approach #hybrid
- A More Efficient Hybrid Approach for Single-Packet IP Traceback (YW, SS, YY, JR), pp. 275–282.
- PPoPP-2012-BaghsorkhiGDH #evaluation #memory management #parallel #thread
- Efficient performance evaluation of memory hierarchy for highly multithreaded graphics processors (SSB, IG, MD, WmWH), pp. 23–34.
- PPoPP-2012-BlellochFGS #algorithm #parallel
- Internally deterministic parallel algorithms can be fast (GEB, JTF, PBG, JS), pp. 181–192.
- PPoPP-2012-BuhlerALC #concurrent #streaming
- Efficient deadlock avoidance for streaming computation with filtering (JDB, KA, PL, RDC), pp. 235–246.
- PPoPP-2012-CaniouDRCA #analysis #constraints #parallel
- Performance analysis of parallel constraint-based local search (YC, DD, FR, PC, SA), pp. 337–338.
- PPoPP-2012-GongHZ #in the cloud #network #overview
- An overview of CMPI: network performance aware MPI in the cloud (YG, BH, JZ), pp. 297–298.
- PPoPP-2012-JimboreanCPML #adaptation #framework #parallel
- Adapting the polyhedral model as a framework for efficient speculative parallelization (AJ, PC, BP, LM, VL), pp. 295–296.
- PPoPP-2012-KamilCBCGHMF #domain-specific language #effectiveness #embedded #parallel
- Portable parallel performance from sequential, productive, embedded domain-specific languages (SK, DC, SB, HC, EG, JH, JM, AF), pp. 303–304.
- PPoPP-2012-KimH #code generation #kernel
- Efficient SIMD code generation for irregular kernels (SK, HH), pp. 55–64.
- PPoPP-2012-KoganP #data type
- A methodology for creating fast wait-free data structures (AK, EP), pp. 141–150.
- PPoPP-2012-NugterenC #adaptation #parallel #predict
- The boat hull model: adapting the roofline model to enable performance prediction for parallel computing (CN, HC), pp. 291–292.
- PPoPP-2012-ProkopecBBO #concurrent
- Concurrent tries with efficient non-blocking snapshots (AP, NGB, PB, MO), pp. 151–160.
- PPoPP-2012-SackG #algorithm #communication
- Faster topology-aware collective algorithms through non-minimal communication (PS, WG), pp. 45–54.
- PPoPP-2012-SimDKV #analysis #framework #identification
- A performance analysis framework for identifying potential benefits in GPGPU applications (JS, AD, HK, RWV), pp. 11–22.
- PPoPP-2012-ZuYXWTPD #automaton #implementation #memory management #nondeterminism #regular expression
- GPU-based NFA implementation for memory efficient high speed regular expression matching (YZ, MY, ZX, LW, XT, KP, QD), pp. 129–140.
- ESOP-2012-FajstrupGHMR #reduction
- Trace Spaces: An Efficient New Technique for State-Space Reduction (LF, EG, EH, SM, MR), pp. 274–294.
- STOC-2012-Censor-HillelHKM #dependence
- Global computation in a poorly connected world: fast rumor spreading with no dependence on conductance (KCH, BH, JAK, PM), pp. 961–970.
- STOC-2012-CheungKL #algorithm #matrix #rank
- Fast matrix rank algorithms and applications (HYC, TCK, LCL), pp. 549–562.
- STOC-2012-KelnerMP #approximate #multi #using
- Faster approximate multicommodity flow using quadratically coupled flows (JAK, GLM, RP), pp. 1–18.
- STOC-2012-Williams #matrix #multi
- Multiplying matrices faster than coppersmith-winograd (VVW), pp. 887–898.
- TACAS-2012-BabiakKRS #automaton #ltl
- LTL to Büchi Automata Translation: Fast and More Deterministic (TB, MK, VR, JS), pp. 95–109.
- TACAS-2012-JegourelLS #framework #model checking #platform #statistics
- A Platform for High Performance Statistical Model Checking — PLASMA (CJ, AL, SS), pp. 498–503.
- TACAS-2012-LengalSV #automaton #library #named #nondeterminism
- VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata (OL, JS, TV), pp. 79–94.
- CAV-2012-BrazdilCKN #game studies #multi #synthesis
- Efficient Controller Synthesis for Consumption Games with Multiple Resource Types (TB, KC, AK, PN), pp. 23–38.
- CAV-2012-FredriksonJJRPSY #abstraction #policy #refinement #runtime #using
- Efficient Runtime Policy Enforcement Using Counterexample-Guided Abstraction Refinement (MF, RJ, SJ, TWR, PAP, HS, VY), pp. 548–563.
- CSL-2012-ChatterjeeCK #algorithm #refinement
- Faster Algorithms for Alternating Refinement Relations (KC, SC, PK), pp. 167–182.
- ICLP-2012-CattafiHGNM #constraints #health #logic programming #quality
- Improving Quality and Efficiency in Home Health Care: an application of Constraint Logic Programming for the Ferrara NHS unit (MC, RH, MG, MN, FM), pp. 415–424.
- ICLP-2012-Tarau
- Deriving a Fast Inverse of the Generalized Cantor N-tupling Bijection (PT), pp. 312–322.
- ICLP-J-2012-ZhouH
- Efficient tabling of structured data with enhanced hash-consing (NFZ, CTH), pp. 547–563.
- ICST-2012-JustKS #analysis #effectiveness #mutation testing #question
- Do Redundant Mutants Affect the Effectiveness and Efficiency of Mutation Analysis? (RJ, GMK, FS), pp. 720–725.
- ICST-2012-MizanF #analysis #automation
- Automated Performance Model Construction through Event Log Analysis (AM, GF), pp. 636–641.
- ICST-2012-Nguyen #comprehension #detection #scalability #using
- Using Control Charts for Detecting and Understanding Performance Regressions in Large Software (THDN), pp. 491–494.
- ICST-2012-ZamanAH #analysis #empirical #scalability
- A Large Scale Empirical Study on User-Centric Performance Analysis (SZ, BA, AEH), pp. 410–419.
- ICTSS-2012-BrauerPS #modelling #testing #tool support
- Efficient and Trustworthy Tool Qualification for Model-Based Testing Tools (JB, JP, US), pp. 8–23.
- ICTSS-2012-HiromoriUYH #evaluation #protocol #testing
- Protocol Testing and Performance Evaluation for MANETs with Non-uniform Node Density Distribution (AH, TU, HY, TH), pp. 231–246.
- ICTSS-2012-MayerSWM #framework #named #testing
- CaPTIF: Comprehensive Performance TestIng Framework (DAM, OS, SW, UM), pp. 55–70.
- ISSTA-2012-KimCHKOSPMN #testing
- Efficient regression testing of ontology-driven systems (MK, JC, MJH, TMK, AO, JHS, ARP, KM, SBN), pp. 320–330.
- SAT-2012-BelovIMM #on the
- On Efficient Computation of Variable MUSes (AB, AI, AM, JMS), pp. 298–311.
- SAT-2012-JarvisaloKKK
- Finding Efficient Circuits for Ensemble Computation (MJ, PK, MK, JHK), pp. 369–382.
- SAT-2012-NadelR #satisfiability
- Efficient SAT Solving under Assumptions (AN, VR), pp. 242–255.
- VMCAI-2012-EssenJ
- Synthesizing Efficient Controllers (CvE, BJ), pp. 428–444.
- VMCAI-2012-GhorbalIBMG #abstract interpretation
- Donut Domains: Efficient Non-convex Domains for Abstract Interpretation (KG, FI, GB, NM, AG), pp. 235–250.
- ECSA-2011-MassowHH #architecture #component #configuration management #runtime #simulation
- Performance Simulation of Runtime Reconfigurable Component-Based Software Architectures (RvM, AvH, WH), pp. 43–58.
- ECSA-2011-PurhonenS #adaptation #runtime
- Runtime Performance Management of Information Broker-Based Adaptive Applications (AP, SS), pp. 203–206.
- QoSA-ISARCS-2011-FranksLH #metric #modelling #protocol
- Performance measurements and modeling of a java-based session initiation protocol (SIP) application server (GF, DHL, CEH), pp. 63–72.
- WICSA-2011-BalasubramaniamSJKMN #approach #architecture #constraints #generative #named #theorem proving
- Dominion: An Architecture-Driven Approach to Generating Efficient Constraint Solvers (DB, LdS, CJ, LK, IM, PN), pp. 228–231.
- WICSA-2011-ChampagneG #architecture #automation #towards
- Towards Automation of Performance Architectural Tactics Application (RC, SG), pp. 157–160.
- DocEng-2011-BohneRB #documentation #keyword
- Efficient keyword extraction for meaningful document perception (TB, SR, UMB), pp. 185–194.
- DocEng-2011-CardosoJLRC #independence
- An efficient language-independent method to extract content from news webpages (ETC, IVJ, ESL, RR, PC), pp. 121–128.
- HT-2011-NemotoGL #collaboration #editing #social #wiki
- Social capital increases efficiency of collaboration among Wikipedia editors (KN, PAG, RL), pp. 231–240.
- ICDAR-2011-BerettaL #algorithm #evaluation #identification
- Performance Evaluation of Algorithms for Newspaper Article Identification (RB, LL), pp. 394–398.
- ICDAR-2011-BukhariSB11a #analysis #documentation #image #layout
- High Performance Layout Analysis of Arabic and Urdu Document Images (SSB, FS, TMB), pp. 1275–1279.
- ICDAR-2011-ChazalonCL #analysis #documentation #interactive
- Iterative Analysis of Pages in Document Collections for Efficient User Interaction (JC, BC, AL), pp. 503–507.
- ICDAR-2011-ClausnerPA11a #analysis #documentation #evaluation #layout
- Scenario Driven In-depth Performance Evaluation of Document Layout Analysis Methods (CC, SP, AA), pp. 1404–1408.
- ICDAR-2011-ColuttoG #difference #recognition #using #word
- Efficient Word Recognition Using a Pixel-Based Dissimilarity Measure (SC, BG), pp. 1110–1114.
- ICDAR-2011-DuAL #detection
- Dot Text Detection Based on FAST Points (YD, HA, SL), pp. 435–439.
- ICDAR-2011-GatosLS #reduction
- Greek Polytonic OCR Based on Efficient Character Class Number Reduction (BG, GL, NS), pp. 1155–1159.
- ICDAR-2011-KesidisG #estimation #word
- Efficient Cut-Off Threshold Estimation for Word Spotting Applications (ALK, BG), pp. 279–283.
- ICDAR-2011-KumarD #image #using
- Fast Rule-Line Removal Using Integral Images and Support Vector Machines (JK, DSD), pp. 584–588.
- ICDAR-2011-LouradourK #categorisation #documentation #feature model #image
- Sample-Dependent Feature Selection for Faster Document Image Categorization (JL, CK), pp. 309–313.
- ICDAR-2011-SaabniB
- Fast Key-Word Searching via Embedding and Active-DTW (RS, AB), pp. 68–72.
- ICDAR-2011-TakedaKI #database #documentation #image #memory management #realtime #retrieval
- Real-Time Document Image Retrieval for a 10 Million Pages Database with a Memory Efficient and Stability Improved LLAH (KT, KK, MI), pp. 1054–1058.
- ICDAR-2011-TerasawaSK #image
- A Fast Appearance-Based Full-Text Search Method for Historical Newspaper Images (KT, TS, TK), pp. 1379–1383.
- ICDAR-2011-YalnizM #automation #evaluation
- A Fast Alignment Scheme for Automatic OCR Evaluation of Books (IZY, RM), pp. 754–758.
- ICDAR-2011-ZanibbiPMVB #metric
- Stroke-Based Performance Metrics for Handwritten Mathematical Expressions (RZ, AP, HM, CVG, DB), pp. 334–338.
- PODS-2011-BojanczykF #documentation #evaluation #logic #xml
- Efficient evaluation for a temporal logic on changing XML documents (MB, DF), pp. 259–270.
- SIGMOD-2011-AngelK
- Efficient diversity-aware search (AA, NK), pp. 781–792.
- SIGMOD-2011-AthanassoulisCAGS #named #online
- MaSM: efficient online updates in data warehouses (MA, SC, AA, PBG, RS), pp. 865–876.
- SIGMOD-2011-BahmaniCX #personalisation #pipes and filters #rank
- Fast personalized PageRank on MapReduce (BB, KC, DX), pp. 973–984.
- SIGMOD-2011-Bajda-PawlikowskiASP #execution #query
- Efficient processing of data warehousing queries in a split execution environment (KBP, DJA, AS, EP), pp. 1165–1176.
- SIGMOD-2011-CaoSSYDGW #algorithm #consistency
- Fast checkpoint recovery algorithms for frequently consistent applications (TC, MAVS, BS, YY, AJD, JG, WMW), pp. 265–276.
- SIGMOD-2011-ChenLOW #named #realtime #twitter
- TI: an efficient indexing mechanism for real-time search on tweets (CC, FL, BCO, SW), pp. 649–660.
- SIGMOD-2011-DugganCPU #concurrent #database #predict
- Performance prediction for concurrent database workloads (JD, UÇ, OP, EU), pp. 337–348.
- SIGMOD-2011-HanPLKY #analysis #graph
- iGraph in action: performance analysis of disk-based graph indexing techniques (WSH, MDP, JL, RK, JXY), pp. 1241–1242.
- SIGMOD-2011-JinP #evaluation #query
- Efficient and generic evaluation of ranked queries (WJ, JMP), pp. 601–612.
- SIGMOD-2011-KaushikR #query #sql
- Efficient auditing for complex SQL queries (RK, RR), pp. 697–708.
- SIGMOD-2011-KennedyN #enterprise #named #nondeterminism #optimisation
- Jigsaw: efficient optimization over uncertain enterprise data (OK, SN), pp. 829–840.
- SIGMOD-2011-KhanLYGCT #graph #network #scalability
- Neighborhood based fast graph search in large networks (AK, NL, XY, ZG, SC, ST), pp. 901–912.
- SIGMOD-2011-KohlerYZ #parallel #using
- Efficient parallel skyline processing using hyperplane projections (HK, JY, XZ), pp. 85–96.
- SIGMOD-2011-LianC #graph #probability #query #rdf
- Efficient query answering in probabilistic RDF graphs (XL, LC), pp. 157–168.
- SIGMOD-2011-LiDF #algorithm #approximate #named
- Faerie: efficient filtering algorithms for approximate dictionary-based entity extraction (GL, DD, JF), pp. 529–540.
- SIGMOD-2011-QinWLXL #query #similarity #symmetry
- Efficient exact edit similarity query processing with the asymmetric signature scheme (JQ, WW, YL, CX, XL), pp. 1033–1044.
- SIGMOD-2011-RoyC #database #semantics
- Location-aware type ahead search on spatial databases: semantics and efficiency (SBR, KC), pp. 361–372.
- SIGMOD-2011-SchaikM #data type #memory management #reachability
- A memory efficient reachability data structure through bit vector compression (SJvS, OdM), pp. 913–924.
- SIGMOD-2011-TekleL #datalog #query #set
- More efficient datalog queries: subsumptive tabling beats magic sets (KTT, YAL), pp. 661–672.
- SIGMOD-2011-ZhangZD #corpus #estimation #mining
- Mining a search engine’s corpus: efficient yet unbiased sampling and aggregate estimation (MZ, NZ, GD), pp. 793–804.
- VLDB-2011-AoZWSWLLL #algorithm #parallel #using
- Efficient Parallel Lists Intersection and Index Compression Algorithms using Graphics Processing Units (NA, FZ, DW, DSS, GW, XL, JL, SL), pp. 470–481.
- VLDB-2011-BerneckerEKRZZ #nearest neighbour #nondeterminism #probability #query
- Efficient Probabilistic Reverse Nearest Neighbor Query Processing on Uncertain Data (TB, TE, HPK, MR, SZ, AZ), pp. 669–680.
- VLDB-2011-CapanniniNPS #web
- Efficient Diversification of Web Search Results (GC, FMN, RP, FS), pp. 451–459.
- VLDB-2011-DingK #in memory #memory management #set
- Fast Set Intersection in Memory (BD, ACK), pp. 255–266.
- VLDB-2011-JoshiCNDH #email
- Auto-Grouping Emails For Faster E-Discovery (SJ, DC, KN, PMD, TH), pp. 1284–1294.
- VLDB-2011-LevandoskiELEMR #architecture #benchmark #metric #named #recommendation
- RecBench: Benchmarks for Evaluating Performance of Recommender System Architectures (JJL, MDE, ML, AE, MFM, JR), pp. 911–920.
- VLDB-2011-LometTZ #implementation #logic
- Implementing Performance Competitive Logical Recovery (DBL, KT, MJZ), pp. 430–439.
- VLDB-2011-Neumann #compilation #hardware #query
- Efficiently Compiling Efficient Query Plans for Modern Hardware (TN0), pp. 539–550.
- VLDB-2011-XieLW #constraints #rank
- Efficient Rank Join with Aggregation Constraints (MX, LVSL, PTW), pp. 1201–1212.
- VLDB-2011-YangPS #graph #mining #multi
- Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining (XY, SP, PS), pp. 231–242.
- VLDB-2011-YanZN #algorithm #network
- Efficient Algorithms for Finding Optimal Meeting Point on Road Networks (DY, ZZ, WN), pp. 968–979.
- VLDB-2011-YuanWWC #graph #nondeterminism #scalability
- Efficient Subgraph Search over Large Uncertain Graphs (YY, GW, HW, LC), pp. 876–886.
- VLDB-2012-HoobinPZ11 #retrieval #web
- Relative Lempel-Ziv Factorization for Efficient Storage and Retrieval of Web Collections (CH, SJP, JZ), pp. 265–273.
- VLDB-2012-KruegerKGSSCPDZ11 #database #manycore #using
- Fast Updates on Read-Optimized Databases Using Multi-Core CPUs (JK, CK, MG, NS, DS, JC, HP, PD, AZ), pp. 61–72.
- VLDB-2012-LinJZXL11 #privacy #query
- A MovingObject Index for Efficient Query Processing with Peer-Wise Location Privacy (DL, CSJ, RZ, LX, JL), pp. 37–48.
- VLDB-2012-MansourASK11 #named #parallel #string
- ERA: Efficient Serial and Parallel Suffix Tree Construction for Very Long Strings (EM, AA, SS, PK), pp. 49–60.
- CSEET-2011-HaleJG #predict #student
- Predicting individual performance in student project teams (MLH, NJ, RFG), pp. 11–20.
- ITiCSE-2011-Ernst #architecture #manycore #student
- Preparing students for future architectures with an exploration of multi- and many-core performance (DJE), pp. 57–62.
- ITiCSE-2011-Moy #education #student #tool support
- Efficient and playful tools to teach Unix to new students (MM), pp. 93–97.
- ITiCSE-2011-ShafferE #scheduling #student
- Scheduling and student performance (CAS, SHE), p. 331.
- SIGITE-2011-NeupaneKEVJ
- Measuring the performance of VoIP over Wireless LAN (KN, VK, AE, SHV, HJ), pp. 269–274.
- SIGITE-2011-ZhangW #case study #communication
- Effects of communication, leadership, and team performance on successful IT capstone projects: a case study (CZ, AJAW), pp. 281–286.
- ICPC-2011-AlawnehH #named #scalability
- MTF: A Scalable Exchange Format for Traces of High Performance Computing Systems (LA, AHL), pp. 181–184.
- ICPC-2011-CordyR #named #open source #source code
- DebCheck: Efficient Checking for Open Source Code Clones in Software Systems (JRC, CKR), pp. 217–218.
- ICSM-2011-SyerAH #concurrent #identification #thread
- Identifying performance deviations in thread pools (MDS, BA, AEH), pp. 83–92.
- MSR-2011-ZamanAH #case study #debugging #security
- Security versus performance bugs: a case study on Firefox (SZ, BA, AEH), pp. 93–102.
- MSR-2011-ZeltynTCDKKKW #maintenance
- Improving efficiency in software maintenance (SZ, PT, MC, RD, SK, MK, APK, SW), pp. 215–218.
- CIAA-J-2010-AllauzenRS11 #algorithm #composition #finite #transducer
- A Filter-Based Algorithm for Efficient Composition of Finite-State Transducers (CA, MR, JS), pp. 1781–1795.
AFL-2011-Egri-NagyMN #algorithm #composition- Algorithms for the Efficient Calculation of the Holonomy Decomposition (AEN, JDM, CLN), pp. 389–390.
- CIAA-2011-JezM #automaton
- Computing All ℓ-Cover Automata Fast (AJ, AM), pp. 203–214.
- ICALP-v1-2011-ChakrabortyGM
- Efficient Sample Extractors for Juntas with Applications (SC, DGS, AM), pp. 545–556.
- ICALP-v2-2011-ChanN #convergence #network
- Fast Convergence for Consensus in Dynamic Networks (THHC, LN), pp. 514–525.
- ICALP-v2-2011-ChlebusKPR #ad hoc #communication #distributed #network
- Efficient Distributed Communication in Ad-Hoc Radio Networks (BSC, DRK, AP, MAR), pp. 613–624.
- LATA-2011-AxelsenG #turing machine
- A Simple and Efficient Universal Reversible Turing Machine (HBA, RG), pp. 117–128.
- RTA-2011-ConchinhaBC #deduction #equivalence #named
- FAST: An Efficient Decision Procedure for Deduction and Static Equivalence (BC, DAB, CC), pp. 11–20.
- SEFM-2011-Boender #component
- Efficient Computation of Dominance in Component Systems (JB), pp. 399–406.
- SFM-2011-BertolinoCGN #assessment #dependence
- Dependability and Performance Assessment of Dynamic CONNECTed Systems (AB, AC, FDG, NN), pp. 350–392.
CEFP-2011-Grelck #c- Single Assignment C (SAC) High Productivity Meets High Performance (CG), pp. 207–278.
- Haskell-2011-LippmeierK #haskell #parallel
- Efficient parallel stencil convolution in Haskell (BL, GK), pp. 59–70.
- ICFP-2011-GillF #fault #implementation
- Deriving an efficient FPGA implementation of a low density parity check forward error corrector (AG, AF), pp. 209–220.
- ICFP-2011-UenoOO #functional #garbage collection
- An efficient non-moving garbage collector for functional languages (KU, AO, TO), pp. 196–208.
- ICFP-2011-WangGW #bidirectional #incremental
- Incremental updates for efficient bidirectional transformations (MW, JG, NW), pp. 392–403.
- DiGRA-2011-NiesenhausMH0 #crowdsourcing #energy #navigation
- Playful Crowdsourcing for Energy- Efficient Automotive Navigation (JN, DM, TH, JZ0).
- FDG-2011-AmarasingheP #game studies #realtime #towards #video
- Towards fast, believable real-time rendering of burning objects in video games (DA, IP), pp. 256–258.
- CHI-2011-AmershiLKMC #named #network
- CueT: human-guided fast and accurate network alarm triage (SA, BL, AK, RM, BC), pp. 157–166.
- CHI-2011-AndersonDB
- Diminishing returns?: revisiting perception of computing performance (GJA, RD, EB), pp. 2703–2706.
- CHI-2011-BrumbyDJG #how
- Fast or safe?: how performance objectives determine modality output choices while interacting on the move (DPB, SCED, CPJ, JJG), pp. 473–482.
- CHI-2011-DijkstraPV #flexibility
- Evaluating effects of structural holds on pointing and dragging performance with flexible displays (RD, CP, RV), pp. 1293–1302.
- CHI-2011-DongHK #interface
- Entity-linking interfaces in user-contributed content: preference and performance (XD, FMH, JAK), pp. 2187–2196.
- CHI-2011-John #design #modelling #predict #recommendation #user interface #using
- Using predictive human performance models to inspire and support UI design recommendations (BEJ), pp. 983–986.
- CHI-2011-KaneWL #comprehension #gesture #people
- Usable gestures for blind people: understanding preference and performance (SKK, JOW, REL), pp. 413–422.
- CHI-2011-KaserAP #interactive #multi #named
- FingerGlass: efficient multiscale interaction on multitouch screens (DPK, MA, MP), pp. 1601–1610.
- CHI-2011-KimK #design #feedback #multimodal
- Designing of multimodal feedback for enhanced multitasking performance (GK, HCK), pp. 3113–3122.
- CHI-2011-Light #design #using
- Democratising technology: making transformation using designing, performance and props (AL), pp. 2239–2242.
- CHI-2011-MamykinaMMHH #design #lessons learnt
- Design lessons from the fastest q&a site in the west (LM, BM, MM, GH, BH), pp. 2857–2866.
- CHI-2011-MarshallB #case study #experience #interactive #using
- Using fast interaction to create intense experiences (JM, SB), pp. 1255–1264.
- CSCW-2011-AlvesF #adaptation #chat #consistency #multi #named #requirements #scalability
- ReConMUC: adaptable consistency requirements for efficient large-scale multi-user chat (PA, PF), pp. 553–562.
- CSCW-2011-GutwinLG #network #realtime #testing
- Real-time groupware in the browser: testing the performance of web-based networking (CG, ML, TCNG), pp. 167–176.
- DHM-2011-FritzscheJLBJP #editing #process #simulation
- Introducing ema (Editor for Manual Work Activities) — A New Tool for Enhancing Accuracy and Efficiency of Human Simulations in Digital Production Planning (LF, RJ, WL, SB, TJ, AP), pp. 272–281.
- DHM-2011-JiangWTXW #case study #evaluation
- Study on Synthetic Evaluation of Human Performance in Manually Controlled Spacecraft Rendezvous and Docking Tasks (TJ, CW, ZT, YX, ZW), pp. 387–393.
- DUXU-v1-2011-ChampneyKS #design #process
- Making the Design Process More Usable: Aligning Design with User Performance (RKC, CK, KMS), pp. 33–42.
- DUXU-v1-2011-TomskyM #experience #perspective #user interface
- Managing a Green Giant: Sustainability Performance Management, a User Experience Perspective (BT, AM), pp. 500–508.
- DUXU-v2-2011-ChangH
- Effects of Menu Types and Item Lengths on Operation Efficiency (YHC, TKPH), pp. 376–383.
- HCD-2011-GoreHHBM #approach #modelling
- A Methodical Approach for Developing Valid Human Performance Models of Flight Deck Operations (BFG, BLH, NH, DLB, EM), pp. 379–388.
- HCI-DDA-2011-GaoZRMS #overview #perspective #scalability #visualisation
- Performance Visualization for Large-Scale Computing Systems: A Literature Review (QG, XZ, PLPR, AAM, HJS), pp. 450–460.
- HCI-DDA-2011-SeoCH #comparison #mobile
- Imaged Based Codes Performance Comparison for Mobile Environments (JS, JHC, TDH), pp. 653–659.
- HCI-DDA-2011-XuZC #algorithm #image
- High-Quality Fast Image Upsampling Algorithm Based on CUDA (QX, XZ, JC), pp. 677–683.
- HCI-DDA-2011-Yamamoto
- Synchronization and Fluctuation of Rhythm in Musical Cooperative Performance (TY), pp. 517–526.
- HCI-DDA-2011-ZimmermanKPBLJ #how #quote
- “How Do I Line Up?”: Reducing Mental Transformations to Improve Performance (GWZ, DSK, GMP, JB, LML, SDJ), pp. 432–440.
- HCI-ITE-2011-JiangCL #interface
- Musical Skin: A Dynamic Interface for Musical Performance (HJ, TWC, CLL), pp. 53–61.
- HCI-MIIE-2011-LinH #adaptation #predict
- Predicting the Effects of Time-Gaps for Adaptive Cruise Control (ACC) on Bus Driver Performance (BTWL, SLH), pp. 435–443.
- HCI-MIIE-2011-LinW #evaluation #interface
- Evaluation of Wayfinding Performance and Workload on Electronic Map Interface (YLL, CHW), pp. 311–320.
- HCI-MIIE-2011-ShibuyaNM #diagrams #documentation #float #mobile
- An Efficient Document Browsing Method with Floating Diagram Window on Mobile Device (YS, KN, KM), pp. 101–106.
- HCI-MIIE-2011-XuS #smarttech #web
- Enabling Efficient Browsing and Manipulation of Web Tables on Smartphone (WX, YS), pp. 117–126.
- HCI-UA-2011-LiuS #scalability
- uMeeting, an Efficient Co-located Meeting System on the Large-Scale Tabletop (JL, YS), pp. 368–374.
- HIMI-v1-2011-KasamatsuPT
- Effect of Menstrual Distress on Task Performance (KK, MKP, ST), pp. 597–602.
- HIMI-v1-2011-YanoAFJ #modelling #predict #process
- Feasibility Study of Predictive Human Performance Modeling Technique in Field Activities (NY, TA, SF, BEJ), pp. 180–189.
- HIMI-v2-2011-KikenRBBKSVB #online #tool support
- Effect of ATC Training with NextGen Tools and Online Situation Awareness and Workload Probes on Operator Performance (AK, RCR, LPB, SB, JMK, TZS, KPLV, VB), pp. 483–492.
- HIMI-v2-2011-StegmanLS #comparison #monitoring
- A Comparison between Single and Dual Monitor Productivity and the Effects of Window Management Styles on Performance (AS, CL, RLS), pp. 84–93.
- HIMI-v2-2011-TanerYNB #generative #scalability
- An Efficient and Scalable Meeting Minutes Generation and Presentation Technique (BT, CY, AON, SB), pp. 345–352.
- IDGD-2011-DingR #network
- An Investigation on the Relationship between Informal Networks and Organizational Performance (HD, JR), pp. 490–493.
- IDGD-2011-LiuL #complexity #comprehension #towards
- Toward Understanding the Relationship between Task Complexity and Task Performance (PL, ZL), pp. 192–200.
- OCSC-2011-Torrent-MorenoGEGP #ecosystem #energy #social
- Social Computing for Home Energy Efficiency: Technological and Stakeholder Ecosystems (MTM, RG, RE, JJG, MP), pp. 229–238.
- ICEIS-v1-2011-GongG #evaluation #internet #research
- Research on the Evaluation Index System and Method for Intelligent Performance of Smart Space based on Internet of Things Technology (XG, TG), pp. 301–307.
- ICEIS-v1-2011-MakkiAGJ #evaluation #query #semantics
- Performance Evaluation of Query Trimming Strategies in Semantic Caching Environment (SKM, SA, YG, MSJ), pp. 169–176.
- ICEIS-v1-2011-MoreauO
- Efficient Indexing of Lines with the Mqr-tree (MM, WO), pp. 314–319.
- ICEIS-v1-2011-PotoleaL #classification
- A Comprehensive Study of the Effect of Class Imbalance on the Performance of Classifiers (RP, CL), pp. 14–21.
- ICEIS-v2-2011-FanLL #set
- Influencing Factors of High-speed Railway Passengers’ Travel Choice based on Rough Set (YF, JL, CL), pp. 213–217.
- ICEIS-v2-2011-LongLG #algorithm #predict #search-based
- High-speed Railway based on Genetic Algorithm for Prediction of Travel Choice (CL, JL, YG), pp. 26–31.
- ICEIS-v3-2011-Li11c #identification
- An Efficient Method to Identify Customer Value in Tourist Hotel Management (CL), pp. 165–169.
- ICEIS-v3-2011-ZhangF #algorithm #evaluation
- Performance Evaluation of Emergency Logistics based on DEA-AHP Algorithm (JZ, SF), pp. 527–532.
- ICEIS-v4-2011-NguyenD #approach #information management #mobile
- An Efficient Cooperative Cache Approach in Mobile Information System (TTMN, TTBD), pp. 153–159.
- ICEIS-v4-2011-SivasankariMKVP #energy #mobile #multi #network
- Multiple Mobile Synchronised Sinks (MMSS) for Energy Efficiency and Lifetime Maximization in Wireless Sensor Networks (HS, VM, KS, KRV, LMP), pp. 76–85.
- ICEIS-v4-2011-WangX #empirical #multi
- Is Internal Capital Market of China Listed Companies Efficient? — Empirical Evidences from Listed Companies Which Have Multiple Divisions in H-stock (FW, ZX), pp. 600–605.
- ICEIS-v4-2011-YangLH #multi #network #scheduling
- QPF Scheduling Scheme for Performance Improvements of Integrated Multimedia Applications over 3.5G Network (SJY, LCL, YMH), pp. 5–12.
- ICEIS-v4-2011-ZhangCZh #collaboration #optimisation
- A Collaborative Optimization Model for Strategic Performance (HZ, LC, YZ, MH), pp. 645–649.
- ICEIS-v4-2011-ZhangFZ #behaviour #industrial
- An Empericial Study about Franchise Relationship Behaviors’s Impacts on Franchisees’ Performance in Fastfood Industry (YZ, JF, YZ), pp. 695–701.
- ICEIS-v4-2011-ZhangZ11a #algorithm #contest #game studies
- Model and Algorithm of Competition Between High-speed Railway and Air Transport — Game Theory Based (JZ, PZ), pp. 563–568.
- CIKM-2011-BrodtSM #rdf #retrieval
- Efficient resource attribute retrieval in RDF triple stores (AB, OS, BM), pp. 1445–1454.
- CIKM-2011-CartrightA #optimisation
- Efficiency optimizations for interpolating subqueries (MAC, JA), pp. 297–306.
- CIKM-2011-ChenloL #effectiveness #estimation
- Effective and efficient polarity estimation in blogs based on sentence-level evidence (JMC, DEL), pp. 365–374.
- CIKM-2011-ChristoforakiHDMS #query
- Text vs. space: efficient geo-search query processing (MC, JH, CD, AM, TS), pp. 423–432.
- CIKM-2011-DongZCZZLWO #database #mining #named
- e-NSP: efficient negative sequential pattern mining based on identified positive patterns without database rescanning (XD, ZZ, LC, YZ, CZ, JL, WW, YO), pp. 825–830.
- CIKM-2011-ElsayedLM #approximate #retrieval
- When close enough is good enough: approximate positional indexes for efficient ranked retrieval (TE, JJL, DM), pp. 1993–1996.
- CIKM-2011-Garcia-Alvarado0O #named #ontology #using
- ONTOCUBE: efficient ontology extraction using OLAP cubes (CGA, ZC, CO), pp. 2429–2432.
- CIKM-2011-GollapudiINP #query #web
- Efficient query rewrite for structured web queries (SG, SI, AN, SP), pp. 2417–2420.
- CIKM-2011-LangeN11a #composition #metric #similarity
- Efficient similarity search: arbitrary similarity measures, arbitrary composition (DL, FN), pp. 1679–1688.
- CIKM-2011-LiaoLCW #named
- KLEAP: an efficient cleaning method to remove cross-reads in RFID streams (GL, JL, LC, CW), pp. 2209–2212.
- CIKM-2011-LiLSG #community #named #online #privacy #recommendation #social
- YANA: an efficient privacy-preserving recommender system for online social communities (DL, QL, LS, NG), pp. 2269–2272.
- CIKM-2011-MagdyJ #using
- An efficient method for using machine translation technologies in cross-language patent search (WM, GJFJ), pp. 1925–1928.
- CIKM-2011-PuWLW #incremental #named #query #rdf
- AWETO: efficient incremental update and querying in rdf storage system (XP, JW, PL, MW), pp. 2445–2448.
- CIKM-2011-SchifanellaCS #composition #multi
- Fast metadata-driven multiresolution tensor decomposition (CS, KSC, MLS), pp. 1275–1284.
- CIKM-2011-ShanZHYYL #query
- Efficient phrase querying with flat position index (DS, WXZ, JH, RY, HY, XL), pp. 2001–2004.
- CIKM-2011-TariqK #feature model
- Fast supervised feature extraction by term discrimination information pooling (AT, AK), pp. 2233–2236.
- CIKM-2011-TretyakovAGVD #estimation #graph #scalability
- Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs (KT, AAC, LGB, JV, MD), pp. 1785–1794.
- CIKM-2011-WachsmuthSE #information management #pipes and filters
- Constructing efficient information extraction pipelines (HW, BS, GE), pp. 2237–2240.
- CIKM-2011-WahabzadaKPB #scheduling
- More influence means less work: fast latent dirichlet allocation by influence scheduling (MW, KK, AP, CB), pp. 2273–2276.
- CIKM-2011-WangHJT #categorisation #image #learning #metric #multi
- Efficient lp-norm multiple feature metric learning for image categorization (SW, QH, SJ, QT), pp. 2077–2080.
- CIKM-2011-WesselOVBK #3d #modelling #retrieval #using
- Efficient retrieval of 3D building models using embeddings of attributed subgraphs (RW, SO, RV, IB, RK), pp. 2097–2100.
- CIKM-2011-XieY #graph #named #scalability
- CP-index: on the efficient indexing of large graphs (YX, PSY), pp. 1795–1804.
- CIKM-2011-XuSPZ #kernel #named
- TAKES: a fast method to select features in the kernel space (YX, FS, WP, JZ), pp. 683–692.
- CIKM-2011-YanWN #adaptation
- Efficient methods for finding influential locations with adaptive grids (DY, RCWW, WN), pp. 1475–1484.
- CIKM-2011-ZhouPW #constraints #graph #keyword #scalability
- Efficient association discovery with keyword-based constraints on large graph data (MZ, YP, YW), pp. 2441–2444.
- CIKM-2011-ZhuQYKL #graph #quality #scalability
- High efficiency and quality: large graphs matching (YZ, LQ, JXY, YK, XL), pp. 1755–1764.
- ECIR-2011-JonassenB
- Efficient Compressed Inverted Index Skipping for Disjunctive Text-Queries (SJ, SEB), pp. 530–542.
- ICML-2011-Cuturi #kernel
- Fast Global Alignment Kernels (MC), pp. 929–936.
- ICML-2011-FlachHR #classification
- A Coherent Interpretation of AUC as a Measure of Aggregated Classification Performance (PAF, JHO, CFR), pp. 657–664.
- ICML-2011-Hernandez-OralloFR #classification #cost analysis #visualisation
- Brier Curves: a New Cost-Based Visualisation of Classifier Performance (JHO, PAF, CFR), pp. 585–592.
- ICML-2011-JawanpuriaNR #kernel #learning #using
- Efficient Rule Ensemble Learning using Hierarchical Kernels (PJ, JSN, GR), pp. 161–168.
- ICML-2011-JimenezS
- Fast Newton-type Methods for Total Variation Regularization (ÁBJ, SS), pp. 313–320.
- ICML-2011-ZhongK #automation #modelling
- Efficient Sparse Modeling with Automatic Feature Grouping (WZ, JTK), pp. 9–16.
- KDD-2011-AoyamaSSU #approximate #graph #similarity
- Fast approximate similarity search based on degree-reduced neighborhood graphs (KA, KS, HS, NU), pp. 1055–1063.
- KDD-2011-BoleyLPG #random
- Direct local pattern sampling by efficient two-step random procedures (MB, CL, DP, TG), pp. 582–590.
- KDD-2011-ChangR #convergence #linear #memory management #modelling #scalability
- Selective block minimization for faster convergence of limited memory large-scale linear models (KWC, DR), pp. 699–707.
- KDD-2011-DasguptaKS
- Fast locality-sensitive hashing (AD, RK, TS), pp. 1073–1081.
- KDD-2011-EneIM #clustering #pipes and filters #using
- Fast clustering using MapReduce (AE, SI, BM), pp. 681–689.
- KDD-2011-GilpinD #algorithm #approach #clustering #flexibility #satisfiability
- Incorporating SAT solvers into hierarchical clustering algorithms: an efficient and flexible approach (SG, IND), pp. 1136–1144.
- KDD-2011-HsiehD #coordination #matrix
- Fast coordinate descent methods with variable selection for non-negative matrix factorization (CJH, ISD), pp. 1064–1072.
- KDD-2011-SinkovitsCSTRWB #analysis #data-driven
- Data intensive analysis on the gordon high performance data and compute system (RSS, PC, SS, MT, PR, NW, NB), pp. 747–748.
- KDD-2011-ZhangLWGZG #data type #modelling #predict
- Enabling fast prediction for ensemble models on data streams (PZ, JL, PW, BJG, XZ, LG), pp. 177–185.
- KDD-2011-ZhuLCX #topic
- Conditional topical coding: an efficient topic model conditioned on rich features (JZ, NL, NC, EPX), pp. 475–483.
- KDIR-2011-Vanetik #algorithm #graph #mining
- A Fast Algorithm for Mining Graphs of Prescribed Connectivity (NV), pp. 5–13.
- KMIS-2011-AlaviJY #using
- An Investigation of the Use of KMS on Clinical Performance (MA, SLJ, YY), pp. 236–240.
- KMIS-2011-JoshiC #framework #implementation #information management
- Knowledge Management and Organizational Performance — A KM Implementation Framework in Indian Context (HJ, DC), pp. 136–145.
- MLDM-2011-LiHO #clique #correlation
- Contrasting Correlations by an Efficient Double-Clique Condition (AL, MH, YO), pp. 469–483.
- MLDM-2011-LiTM #classification #hybrid #named
- ACE-Cost: Acquisition Cost Efficient Classifier by Hybrid Decision Tree with Local SVM Leaves (LL, UT, NDM), pp. 60–74.
- RecSys-2011-Bellogin #predict #recommendation
- Predicting performance in recommender systems (AB), pp. 371–374.
- SEKE-2011-Amasaki #case study #consistency #estimation #linear #nondeterminism
- A Study on Performance Inconsistency between Estimation by Analogy and Linear Regression (SA), pp. 485–488.
- SEKE-2011-BaillieAAMCB #architecture #component
- A Model-View-DynamicViewModel and its Performance in a Web-based Component Architecture (GB, BA, DA, RM, TMC, RBB), pp. 786–791.
- SEKE-2011-ChiuchiSSV #guidelines
- Efficiency and portability: guidelines to develop websites (CAC, RCGdS, ABS, CRV), pp. 37–41.
- SEKE-2011-FarahatE #fault
- Exploiting Computational Redundancy for Efficient Recovery from Soft Errors in Sensor Nodes (AF, AE), pp. 619–624.
- SEKE-2011-SantosSN #functional #order #reuse #testing
- Reusing Functional Testing in order to Decrease Performance and Stress Testing Costs (IdSS, ARS, PdAdSN), pp. 470–474.
- SEKE-2011-SilveiraRZCVO #generative #modelling #testing #uml
- Generation of Scripts for Performance Testing Based on UML Models (MBdS, EdMR, AFZ, LTC, HVV, FMdO), pp. 258–263.
- SIGIR-2011-AnandBBS
- Temporal index sharding for space-time efficiency in archive search (AA, SJB, KB, RS), pp. 545–554.
- SIGIR-2011-BroschartS #hybrid #novel #retrieval
- A novel hybrid index structure for efficient text retrieval (AB, RS), pp. 1175–1176.
- SIGIR-2011-ChenBSCG #named #personalisation #privacy #web
- UPS: efficient privacy protection in personalized web search (GC, HB, LS, KC, YG), pp. 615–624.
- SIGIR-2011-CumminsJO #predict #query #standard #using
- Improved query performance prediction using standard deviation (RC, JMJ, CO), pp. 1089–1090.
- SIGIR-2011-DingS #documentation #retrieval #using
- Faster top-k document retrieval using block-max indexes (SD, TS), pp. 993–1002.
- SIGIR-2011-HeS #query #version control
- Faster temporal range queries over versioned text (JH, TS), pp. 565–574.
- SIGIR-2011-Jia #effectiveness
- Efficient and effective solutions for search engines (XFJ), pp. 1319–1320.
- SIGIR-2011-KanhabuaN #predict #query
- Time-based query performance predictors (NK, KN), pp. 1181–1182.
- SIGIR-2011-MoravejiRBM
- Measuring improvement in user search performance resulting from optimal search tips (NM, DMR, JB, DM), pp. 355–364.
- SIGIR-2011-RendleGFS #recommendation
- Fast context-aware recommendations with factorization machines (SR, ZG, CF, LST), pp. 635–644.
- SIGIR-2011-WangLM #ranking #retrieval
- A cascade ranking model for efficient ranked retrieval (LW, JJL, DM), pp. 105–114.
- SIGIR-2011-XuBCCHLL #image #ranking #retrieval
- Efficient manifold ranking for image retrieval (BX, JB, CC, DC, XH, WL, JL), pp. 525–534.
- SIGIR-2011-ZhouCZ #algorithm #approximate #named #string #towards
- SEJoin: an optimized algorithm towards efficient approximate string searches (JZ, ZC, JZ), pp. 1249–1250.
BX-2011-Voigtlaender1 #bidirectional- Efficiency of Bidirectional Transformations (JV), p. 64.
- ICMT-2011-AmstelBKP #atl #model transformation #qvt
- Performance in Model Transformations: Experiments with ATL and QVT (MvA, SB, IK, LFP), pp. 198–212.
- ICMT-2011-LepperT #analysis #optimisation #visitor
- Optimization of Visitor Performance by Reflection-Based Analysis (ML, BTyW), pp. 15–30.
- SPLC-2011-GhezziS #approach #model checking #non-functional #parametricity #product line #towards #using #verification
- Verifying Non-functional Properties of Software Product Lines: Towards an Efficient Approach Using Parametric Model Checking (CG, AMS), pp. 170–174.
- SPLC-2011-SinhaDR #development #multi #product line #reduction #scalability #testing
- Governance and Cost Reduction through Multi-tier Preventive Performance Tests in a Large-Scale Product Line Development (SS, TD, RR), pp. 295–302.
- SPLC-2011-TawhidP #automation #product line
- Automatic Derivation of a Product Performance Model from a Software Product Line Model (RT, DCP), pp. 80–89.
- Onward-2011-Puschel #automation #programming
- Automatic performance programming (MP), pp. 1–2.
- OOPSLA-2011-JovicAH #debugging #detection
- Catch me if you can: performance bug detection in the wild (MJ, AA, MH), pp. 155–170.
- OOPSLA-2011-WuHIN #java #scalability
- Reducing trace selection footprint for large-scale Java applications without performance loss (PW, HH, HI, TN), pp. 789–804.
- TOOLS-EUROPE-2011-CianconeFDMG #analysis #component #modelling #named #reliability
- KlaperSuite: An Integrated Model-Driven Environment for Reliability and Performance Analysis of Component-Based Systems (AC, AF, MLD, RM, VG), pp. 99–114.
- TOOLS-EUROPE-2011-FalleriDLVD #ranking #retrieval #scalability
- Efficient Retrieval and Ranking of Undesired Package Cycles in Large Software Systems (JRF, SD, JL, PV, SD), pp. 260–275.
- PADL-2011-MeraTLH #debugging #logic programming #profiling #runtime #source code
- Profiling for Run-Time Checking of Computational Properties and Performance Debugging in Logic Programs (EM, TT, PLG, MVH), pp. 38–53.
- POPL-2011-LhotakC #analysis #points-to
- Points-to analysis with efficient strong updates (OL, KCAC), pp. 3–16.
- SAS-2011-HuangZ #concurrent #debugging #source code
- An Efficient Static Trace Simplification Technique for Debugging Concurrent Programs (JH, CZ), pp. 163–179.
- SAS-2011-MadhusudanQ #using
- Efficient Decision Procedures for Heaps Using STRAND (PM, XQ), pp. 43–59.
SIGAda-2011-GaudelSPRDL #ada #analysis #design pattern #pattern matching #pattern recognition #recognition- An Ada design pattern recognition tool for AADL performance analysis (VG, FS, AP, SR, PD, JL), pp. 61–68.
- RE-2011-DekhtyarDHHCK #analysis #on the #requirements #statistics
- On human analyst performance in assisted requirements tracing: Statistical analysis (AD, OD, JH, JHH, DC, WKK), pp. 111–120.
- ASE-2011-BergmannHHRUV #emf #implementation #tool support #validation
- Implementing efficient model validation in EMF tools (GB, ÁH, ÁH, IR, ZU, DV), pp. 580–583.
- ASE-2011-BrosigHK #architecture #automation #component #distributed #modelling
- Automated extraction of architecture-level performance models of distributed component-based systems (FB, NH, SK), pp. 183–192.
- ASE-2011-GanovKP #alloy #analysis #incremental
- A case for alloy annotations for efficient incremental analysis via domain specific solvers (SRG, SK, DEP), pp. 464–467.
- ASE-2011-JustSK #analysis #compilation #java #mutation testing #named
- MAJOR: An efficient and extensible tool for mutation analysis in a Java compiler (RJ, FS, GMK), pp. 612–615.
- ASE-2011-PohlLP #algorithm #analysis #automation #comparison #feature model #modelling
- A performance comparison of contemporary algorithmic approaches for automated analysis operations on feature models (RP, KL, KP), pp. 313–322.
- ASE-2011-RathfelderKE #automation #capacity #predict #using
- Capacity planning for event-based systems using automated performance predictions (CR, SK, DE), pp. 352–361.
- ASE-2011-SurapaneniNMW
- Exploring caching for efficient collection operations (SS, VKSN, SKM, TW), pp. 468–471.
- ESEC-FSE-2011-LiCK #analysis #points-to #using
- Boosting the performance of flow-sensitive points-to analysis using value flow (LL, CC, NK), pp. 343–353.
- ESEC-FSE-2011-Sidiroglou-DouskosMHR #trade-off
- Managing performance vs. accuracy trade-offs with loop perforation (SSD, SM, HH, MCR), pp. 124–134.
- ICSE-2011-BarnaLG #modelling #testing
- Model-based performance testing (CB, ML, HG), pp. 872–875.
- ICSE-2011-FilieriGT #model checking #probability #runtime
- Run-time efficient probabilistic model checking (AF, CG, GT), pp. 341–350.
- ICSE-2011-SumnerBZP #analysis #nondeterminism
- Coalescing executions for fast uncertainty analysis (WNS, TB, XZ, SP), pp. 581–590.
- SAC-2011-BelcaidBHP #clustering #using
- Efficient clustering of populations using a minimal SNP panel (MB, KB, DH, GP), pp. 83–88.
- SAC-2011-BiancoGH #approach #manycore #parallel
- A fast approach for parallel deduplication on multicore processors (GDB, RdMG, CAH), pp. 1027–1032.
- SAC-2011-ChungPK #memory management #scalability
- LSTAFF*: an efficient flash translation layer for large block flash memory (TSC, DJP, JK), pp. 589–594.
- SAC-2011-ClevenWW #analysis #design #problem #process
- Process performance management: illuminating design issues through a systematic problem analysis (AC, RW, FW), pp. 280–286.
- SAC-2011-DabringerE #query #retrieval
- Efficient top-k retrieval for user preference queries (CD, JE), pp. 1045–1052.
- SAC-2011-GohLC #game studies #image
- Performance and perceptions of human computation games for image tagging (DHLG, CSL, AYKC), pp. 1124–1129.
- SAC-2011-HuangK #ad hoc #analysis
- Performance analysis of IEEE 802.11 ad hoc based broadcast (YHH, CYK), pp. 72–73.
- SAC-2011-JinL
- Efficient traitor tracing for clone attack in content protection (HJ, JBL), pp. 1544–1549.
- SAC-2011-KimKKK #energy #memory management #named
- FMCM: a efficient flash memory cache management scheme for energy-efficient disks (YK, TK, YK, ARK), pp. 625–626.
- SAC-2011-LiuSGF #classification
- Improving matching performance of DPI traffic classifier (TL, YS, LG, BF), pp. 514–519.
- SAC-2011-LiuZ11a #analysis #distance #stack #worst-case
- Stack distance based worst-case instruction cache performance analysis (YL, WZ), pp. 723–728.
- SAC-2011-MagalhaesS #analysis
- Root-cause analysis of performance anomalies in web-based applications (JPM, LMS), pp. 209–216.
- SAC-2011-MajchrzakJK #evaluation #open source #tool support
- Efficiency evaluation of open source ETL tools (TAM, TJ, HK), pp. 287–294.
- SAC-2011-RangasamyS #effectiveness #modelling #parallel #petri net #source code #thread
- Petri net based performance modeling for effective DVFS for multithreaded programs (AR, YNS), pp. 647–648.
- SAC-2011-SteigerHS #constraints #network
- An efficient generic network flow constraint (RS, WJvH, RS), pp. 893–900.
- SAC-2011-WangZ #detection #web
- High-speed web attack detection through extracting exemplars from HTTP traffic (WW, XZ), pp. 1538–1543.
- SAC-2011-ZhangWAWLL #using
- Fast lists intersection with Bloom filter using graphics processing units (FZ, DW, NA, GW, XL, JL), pp. 825–826.
- ASPLOS-2011-CoburnCAGGJS #named #persistent
- NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories (JC, AMC, AA, LMG, RKG, RJ, SS), pp. 105–118.
- ASPLOS-2011-EsmaeilzadehCXBM #hardware #roadmap #scalability
- Looking back on the language and hardware revolutions: measured power, performance, and scaling (HE, TC, XY, SMB, KSM), pp. 319–332.
- ASPLOS-2011-HayashizakiWISN
- Improving the performance of trace-based systems by false loop filtering (HH, PW, HI, MJS, TN), pp. 405–418.
- ASPLOS-2011-SinghMNMM #exception #memory management
- Efficient processor support for DRFx, a memory model with exceptions (AS, DM, SN, TDM, MM), pp. 53–66.
- CASE-2011-ColP #detection #recursion
- Fast and accurate object detection by means of recursive monomial feature elimination and cascade of SVM (LDC, FAP), pp. 304–309.
- CASE-2011-FengZL #evaluation #multi
- Multi-product manufacturing systems with sequence-dependent setups: Performance evaluation and system properties (WF, LZ, JL), pp. 363–368.
- CASE-2011-JasperF #detection
- Fast focus-based depth detection for manipulation in scanning electron microscopes (DJ, SF), pp. 375–380.
- CASE-2011-MaiHHH #adaptation #algorithm #speech
- A fast adaptive Kalman filtering algorithm for speech enhancement (QM, DH, YH, ZH), pp. 327–332.
- CASE-2011-PerboliCT #metaheuristic #multi
- An efficient metaheuristic for multi-dimensional multi-container packing (GP, TGC, RT), pp. 563–568.
- CASE-2011-YonezawaKZIHSIYF #approach #experience
- Long-term operational experience with a robot cell production system controlled by low carbon-footprint Senju (thousand-handed) Kannon Model robots and an approach to improving operating efficiency (HY, HK, MZ, KI, NH, YS, MY, TF), pp. 291–298.
- CC-2011-NaeemL #alias #analysis #set #summary #using
- Faster Alias Set Analysis Using Summaries (NAN, OL), pp. 82–103.
- CGO-2011-JonesBMC #optimisation
- Link-time optimization for power efficiency in a tagless instruction cache (TMJ, SB, JM, DC), pp. 32–41.
- CGO-2011-NasreG #analysis #constraints #evaluation #points-to
- Prioritizing constraint evaluation for efficient points-to analysis (RN, RG), pp. 267–276.
- CGO-2011-XieX #detection #named
- Acculock: Accurate and efficient detection of data races (XX, JX), pp. 201–212.
- DAC-2011-BardhanH
- A fast solver for nonlocal electrostatic theory in biomolecular science and engineering (JPB, AH), pp. 801–805.
- DAC-2011-Borkar #3d #design #energy #integration
- 3D integration for energy efficient system design (SB), pp. 214–219.
- DAC-2011-ChangC #3d #array #image #metric #quality #specification
- Image quality aware metrics for performance specification of ADC array in 3D CMOS imagers (HMC, KT(C), pp. 759–764.
- DAC-2011-ChoiYLA #behaviour #fault
- Matching cache access behavior and bit error pattern for high performance low Vcc L1 cache (YGC, SY, SL, JHA), pp. 978–983.
- DAC-2011-CoptyKN #analysis #architecture #statistics #transaction
- Transaction level statistical analysis for efficient micro-architectural power and performance studies (EC, GK, SN), pp. 351–356.
- DAC-2011-DongL #predict
- Efficient SRAM failure rate prediction via Gibbs sampling (CD, XL), pp. 200–205.
- DAC-2011-GongYH #analysis #monte carlo #orthogonal #probability
- Fast non-monte-carlo transient noise analysis for high-precision analog/RF circuits by stochastic orthogonal polynomials (FG, HY, LH), pp. 298–303.
- DAC-2011-HaoTSS #analysis #bound #process
- Performance bound analysis of analog circuits considering process variations (ZH, SXDT, RS, GS), pp. 310–315.
- DAC-2011-HolcombBS #verification
- Abstraction-based performance verification of NoCs (DEH, BAB, SAS), pp. 492–497.
- DAC-2011-HongSK #case study #estimation #throughput
- Emulation based high-accuracy throughput estimation for high-speed connectivities: case study of USB2.0 (BH, CS, DK), pp. 609–614.
- DAC-2011-KoseF #algorithm #analysis #information retrieval #locality
- Fast algorithms for IR voltage drop analysis exploiting locality (SK, EGF), pp. 996–1001.
- DAC-2011-KuoSR #analysis #reachability #source code #using
- Efficient WCRT analysis of synchronous programs using reachability (MMYK, RS, PSR), pp. 480–485.
- DAC-2011-LifaEP #configuration management #detection #fault #optimisation
- Performance optimization of error detection based on speculative reconfiguration (AAL, PE, ZP), pp. 369–374.
- DAC-2011-LiMCMS #modelling #network #reliability #simulation
- Device modeling and system simulation of nanophotonic on-chip networks for reliability, power and performance (ZL, MM, XC, ARM, LS), pp. 735–740.
- DAC-2011-OnaissiTLN #analysis #approach
- A fast approach for static timing analysis covering all PVT corners (SO, FT, JL, FNN), pp. 777–782.
- DAC-2011-QinWLSG #memory management #named
- MNFTL: an efficient flash translation layer for MLC NAND flash memory storage systems (ZQ, YW, DL, ZS, YG), pp. 17–22.
- DAC-2011-SchmitzLEPA #evaluation #framework #named #platform
- TPM-SIM: a framework for performance evaluation of trusted platform modules (JS, JL, JE, DP, NBAG), pp. 236–241.
- DAC-2011-SeokJCBS #design #energy #pipes and filters
- Pipeline strategy for improving optimal energy efficiency in ultra-low voltage design (MS, DJ, CC, DB, DS), pp. 990–995.
- DAC-2011-StattelmannBR #optimisation #simulation
- Fast and accurate source-level simulation of software timing considering complex code optimizations (SS, OB, WR), pp. 486–491.
- DAC-2011-SunLT #analysis #approximate #grid #incremental #power management
- Efficient incremental analysis of on-chip power grid via sparse approximation (PS, XL, MYT), pp. 676–681.
- DAC-2011-ZhaoF #3d #gpu #parallel #platform
- Fast multipole method on GPU: tackling 3-D capacitance extraction on massively parallel SIMD platforms (XZ, ZF), pp. 558–563.
- DATE-2011-BaiDCD #automation #modelling #network
- Automated construction of fast and accurate system-level models for wireless sensor networks (LSB, RPD, PHC, PAD), pp. 1083–1088.
- DATE-2011-BarceloGBS #estimation #scalability
- An efficient and scalable STA tool with direct path estimation and exhaustive sensitization vector exploration for optimal delay computation (SB, XG, SAB, JS), pp. 1602–1607.
- DATE-2011-BiKVSM #analysis #statistics
- Fast statistical analysis of RC nets subject to manufacturing variabilities (YB, KJvdK, JFV, LMS, NvdM), pp. 31–37.
- DATE-2011-BoghratiS #analysis #grid #power management #random
- A scaled random walk solver for fast power grid analysis (BB, SSS), pp. 38–43.
- DATE-2011-BruschiPRS #automaton
- An efficient Quantum-Dot Cellular Automata adder (FB, FP, VR, DS), pp. 1220–1223.
- DATE-2011-ChenGSS #analysis
- Data-oriented performance analysis of SHA-3 candidates on FPGA accelerated computers (ZC, XG, AS, PS), pp. 1650–1655.
- DATE-2011-ErbP #analysis
- A method for fast jitter tolerance analysis of high-speed PLLs (SE, WP), pp. 1107–1112.
- DATE-2011-FalkZHT #algorithm #clustering #data flow #embedded #rule-based #synthesis
- A rule-based static dataflow clustering algorithm for efficient embedded software synthesis (JF, CZ, CH, JT), pp. 521–526.
- DATE-2011-FuWT #approach #manycore #simulation
- A shared-variable-based synchronization approach to efficient cache coherence simulation for multi-core systems (CYF, MHW, RST), pp. 347–352.
- DATE-2011-GoyalN #grid #power management #using #verification
- Efficient RC power grid verification using node elimination (AG, FNN), pp. 257–260.
- DATE-2011-HuXZTS #energy #hybrid #memory management #towards
- Towards energy efficient hybrid on-chip Scratch Pad Memory with non-volatile memory (JH, CJX, QZ, WCT, EHMS), pp. 746–751.
- DATE-2011-IndrusiakS #transaction
- Fast and accurate transaction-level model of a wormhole network-on-chip with priority preemptive virtual channel arbitration (LSI, OMdS), pp. 1089–1094.
- DATE-2011-KimCSY #modelling #parallel #simulation #using
- Temporal parallel simulation: A fast gate-level HDL simulation using higher level models (DK, MJC, KS, SY), pp. 1584–1589.
- DATE-2011-KimYLAJ #3d #analysis #embedded #mobile
- A quantitative analysis of performance benefits of 3D die stacking on mobile and embedded SoC (DK, SY, SL, JHA, HJ), pp. 1333–1338.
- DATE-2011-KozhikkottuVRD #analysis #named #variability
- VESPA: Variability emulation for System-on-Chip performance analysis (VJK, RV, AR, SD), pp. 2–7.
- DATE-2011-KunzGW #hardware #memory management #transaction
- Improving the efficiency of a hardware transactional memory on an NoC-based MPSoC (LK, GG, FRW), pp. 1168–1171.
- DATE-2011-LiuS #continuation #optimisation
- An efficient mask optimization method based on homotopy continuation technique (FL, XS), pp. 1053–1058.
- DATE-2011-LiuV #analysis #generative #source code #validation
- Efficient validation input generation in RTL by hybridized source code analysis (LL, SV), pp. 1596–1601.
- DATE-2011-LoCWT #modelling #simulation
- Cycle-count-accurate processor modeling for fast and accurate system-level simulation (CKL, LCC, MHW, RST), pp. 341–346.
- DATE-2011-LuJTL #architecture #parametricity #simulation
- Efficient parameter variation sampling for architecture simulations (FL, RJ, GT, SL), pp. 1578–1583.
- DATE-2011-MerrettAWZRMRLFA #analysis #modelling #monte carlo #statistics #variability
- Modelling circuit performance variations due to statistical variability: Monte Carlo static timing analysis (MM, PA, YW, MZ, DR, CM, SR, ZL, SBF, AA), pp. 1537–1540.
- DATE-2011-MeyerNHBSGSB #configuration management #using
- Fast Start-up for Spartan-6 FPGAs using Dynamic Partial Reconfiguration (JM, JN, MH, LB, OS, RMG, RS, JB), pp. 1542–1547.
- DATE-2011-MirhoseiniK #energy #hybrid #optimisation
- HypoEnergy. Hybrid supercapacitor-battery power-supply optimization for Energy efficiency (AM, FK), pp. 887–890.
- DATE-2011-MuWLLZCXD #embedded
- Evaluating the potential of graphics processors for high performance embedded computing (SM, CW, ML, DL, MZ, XC, XX, YD), pp. 709–714.
- DATE-2011-PandeCPMBMG #energy #platform #question
- Sustainability through massively integrated computing: Are we ready to break the energy efficiency wall for single-chip platforms? (PPP, FC, DP, IM, PB, RM, AG), pp. 1656–1661.
- DATE-2011-PaternaACPDB #algorithm #energy #manycore #online #platform
- An efficient on-line task allocation algorithm for QoS and energy efficiency in multicore multimedia platforms (FP, AA, AC, FP, GD, LB), pp. 100–105.
- DATE-2011-PenolazziSH #energy #multi #predict
- Predicting bus contention effects on energy and performance in multi-processor SoCs (SP, IS, AH), pp. 1196–1199.
- DATE-2011-PerathonerLT #analysis #component
- Composing heterogeneous components for system-wide performance analysis (SP, KL, LT), pp. 842–847.
- DATE-2011-RinaudoGCMP #approach #design #energy #power management
- Moving to Green ICT: From stand-alone power-aware IC design to an integrated approach to energy efficient design for heterogeneous electronic systems (SR, GG, AC, AM, MP), pp. 1127–1128.
- DATE-2011-RossiTSM #analysis #fault #memory management #reliability
- Error correcting code analysis for cache memory high reliability and performance (DR, NT, MS, CM), pp. 1620–1625.
- DATE-2011-RoyRM #algorithm #modelling
- Theoretical modeling of the Itoh-Tsujii Inversion algorithm for enhanced performance on k-LUT based FPGAs (SSR, CR, DM), pp. 1231–1236.
- DATE-2011-ShahRK #bound #latency
- Priority division: A high-speed shared-memory bus arbitration with bounded latency (HS, AR, AK), pp. 1497–1500.
- DATE-2011-SinghSG #generative #testing #using
- Testing of high-speed DACs using PRBS generation with “Alternate-Bit-Tapping” (MS, MS, SG), pp. 377–382.
- DATE-2011-StattelmannBR #analysis #manycore #simulation
- Fast and accurate resource conflict simulation for performance analysis of multi-core systems (SS, OB, WR), pp. 210–215.
- DATE-2011-WangWT #approach #modelling #named #scheduling #simulation
- DOM: A Data-dependency-Oriented Modeling approach for efficient simulation of OS preemptive scheduling (PCW, MHW, RST), pp. 335–340.
- DATE-2011-XueJZZ #evaluation
- Floorplanning exploration and performance evaluation of a new Network-on-Chip (LX, WJ, QZ, YZ), pp. 625–630.
- DATE-2011-ZhiLZYZZ #algorithm #multi #scheduling
- An efficient algorithm for multi-domain clock skew scheduling (YZ, WSL, HZ, CY, HZ, XZ), pp. 1364–1369.
- HPCA-2011-BobbaLHW #memory management
- Safe and efficient supervised memory systems (JB, ML, MDH, DAW), pp. 369–380.
- HPCA-2011-BrownPT #concurrent #migration #predict #set #thread
- Fast thread migration via cache working set prediction (JAB, LP, DMT), pp. 193–204.
- HPCA-2011-ChenLZ #memory management #parallel
- Essential roles of exploiting internal parallelism of flash memory based solid state drives in high-speed data processing (FC, RL, XZ), pp. 266–277.
- HPCA-2011-FungA #concurrent #control flow #thread
- Thread block compaction for efficient SIMT control flow (WWLF, TMA), pp. 25–36.
- HPCA-2011-GovindarajuHS #energy
- Dynamically Specialized Datapaths for energy efficient computing (VG, CHH, KS), pp. 503–514.
- HPCA-2011-HouZHWFGC #challenge #data type #streaming
- Efficient data streaming with on-chip accelerators: Opportunities and challenges (RH, LZ, MCH, KW, HF, YG, XC), pp. 312–320.
- HPCA-2011-JoshiZL #energy #memory management #multi #named
- Mercury: A fast and energy-efficient multi-level cell based Phase Change Memory system (MJ, WZ, TL), pp. 345–356.
- HPCA-2011-ManikantanRG #distance #manycore #named
- NUcache: An efficient multicore cache organization based on Next-Use distance (RM, KR, RG), pp. 243–253.
- HPCA-2011-RanganPWB #throughput
- Achieving uniform performance and maximizing throughput in the presence of heterogeneity (KKR, MDP, GYW, DMB), pp. 3–14.
- HPCA-2011-SampsonVGGST
- Efficient complex operators for irregular codes (JS, GV, NGH, SG, SS, MBT), pp. 491–502.
- HPCA-2011-SmullenMNGS #energy
- Relaxing non-volatility for fast and energy-efficient STT-RAM caches (CWSI, VM, AN, SG, MRS), pp. 50–61.
- HPCA-2011-ZhangO #analysis #architecture #gpu
- A quantitative performance analysis model for GPU architectures (YZ, JDO), pp. 382–393.
- HPDC-2011-AbbasiEWSK #pipes and filters
- Just in time: adding value to the IO pipelines of high performance applications with JITStaging (HA, GE, MW, KS, SK), pp. 27–36.
- HPDC-2011-LiuXJGL #energy #migration #modelling #virtual machine
- Performance and energy modeling for live migration of virtual machines (HL, CZX, HJ, JG, XL), pp. 171–182.
- HPDC-2011-MinhW #analysis #parallel #towards
- Towards a profound analysis of bags-of-tasks in parallel systems and their performance impact (TNM, LW), pp. 111–122.
- HPDC-2011-NicolaeBKA #multi
- Going back and forth: efficient multideployment and multisnapshotting on clouds (BN, JB, KK, GA), pp. 147–158.
- HPDC-2011-SaadR #distributed #framework #memory management #named #transaction
- HyFlow: a high performance distributed software transactional memory framework (MMS, BR), pp. 265–266.
- ISMM-2011-KaliberaJ #memory management #optimisation #realtime
- Handles revisited: optimising performance and memory costs in a real-time collector (TK, REJ), pp. 89–98.
- LCTES-2011-AlthausAN #analysis #parametricity #precise
- Precise and efficient parametric path analysis (EA, SA, RN), pp. 141–150.
- LCTES-2011-GamatieG #design #embedded #multi #source code #static analysis
- Static analysis of synchronous programs in signal for efficient design of multi-clocked embedded systems (AG, LG), pp. 71–80.
- PDP-2011-AchourAKN #automation #clustering #named #predict #source code #towards
- MPI-PERF-SIM: Towards an Automatic Performance Prediction Tool of MPI Programs on Hierarchical Clusters (SA, MA, BK, WN), pp. 207–211.
- PDP-2011-CorneaB #benchmark #distributed #metric #predict #using
- Performance Prediction of Distributed Applications Using Block Benchmarking Methods (BFC, JB), pp. 183–190.
- PDP-2011-EschweilerBW #behaviour #gpu
- Patterns of Inefficient Performance Behavior in GPU Applications (DE, DB, FW), pp. 262–266.
- PDP-2011-EstradaCG #adaptation #algorithm #architecture #manycore #optimisation #parallel
- Adaptive Parallel Interval Global Optimization Algorithms Based on their Performance for Non-dedicated Multicore Architectures (JFSE, LGC, IG), pp. 252–256.
- PDP-2011-EzzattiQR #framework #manycore #matrix #platform
- High Performance Matrix Inversion on a Multi-core Platform with Several GPUs (PE, ESQO, AR), pp. 87–93.
- PDP-2011-GaltierMV #distributed #fault tolerance #framework
- A Javaspace-Based Framework for Efficient Fault-Tolerant Master-Worker Distributed Applications (VG, CM, SV), pp. 272–276.
- PDP-2011-HaselhorstSSFF #migration
- Efficient Storage Synchronization for Live Migration in Cloud Infrastructures (KH, MS, RS, NF, BF), pp. 511–518.
- PDP-2011-HifiSH #2d #distributed #peer-to-peer #problem
- High Performance Peer-to-Peer Distributed Computing with Application to Constrained Two-Dimensional Guillotine Cutting Problem (MH, TS, NH), pp. 552–559.
- PDP-2011-JacksonRHSS
- High Performance I/O (AJ, FR, JH, AS, XS), pp. 349–356.
- PDP-2011-PascualRMBCL #case study #monte carlo
- More Efficient Executions of Monte Carlo Fusion Codes by Means of Montera: The ISDEP Use Case (MARP, AJRM, RM, AB, FC, IML), pp. 380–384.
- PDP-2011-Schuele #execution #manycore #parallel #streaming
- Efficient Parallel Execution of Streaming Applications on Multi-core Processors (TS), pp. 231–238.
- PDP-2011-VerbeekS #algorithm #concurrent #network #proving
- A Fast and Verified Algorithm for Proving Store-and-Forward Networks Deadlock-Free (FV, JS), pp. 3–10.
- PPoPP-2011-DingWZ #multi #named #optimisation
- ULCC: a user-level facility for optimizing shared cache performance on multicores (XD, KW, XZ), pp. 103–112.
- PPoPP-2011-DotsenkoBLG #fourier
- Auto-tuning of fast fourier transform on graphics processors (YD, SSB, BL, NKG), pp. 257–266.
- PPoPP-2011-NegaraKA #message passing
- Inferring ownership transfer for efficient message passing (SN, RKK, GAA), pp. 81–90.
- SOSP-2011-CuiWGGY #multi #thread
- Efficient deterministic multithreading through schedule relaxation (HC, JW, JG, HG, JY), pp. 337–351.
- SOSP-2011-LiuCB #multi #named #thread
- Dthreads: efficient deterministic multithreading (TL, CC, EDB), pp. 327–336.
- SOSP-2011-OngaroRSOR
- Fast crash recovery in RAMCloud (DO, SMR, RS, JKO, MR), pp. 29–41.
- STOC-2011-ChristianoKMST #approximate #graph
- Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs (PC, JAK, AM, DAS, SHT), pp. 273–282.
- STOC-2011-FawziHS #nondeterminism
- From low-distortion norm embeddings to explicit uncertainty relations and efficient information locking (OF, PH, PS), pp. 773–782.
- STOC-2011-KaneNPW #data type #estimation
- Fast moment estimation in data streams in optimal space (DMK, JN, EP, DPW), pp. 745–754.
- TACAS-2011-BarbotCHKM #linear #model checking #realtime
- Efficient CTMC Model Checking of Linear Real-Time Objectives (BB, TC, TH, JPK, AM), pp. 128–142.
- TACAS-2011-GriggioLS #generative #integer #linear #satisfiability
- Efficient Interpolant Generation in Satisfiability Modulo Linear Integer Arithmetic (AG, TTHL, RS), pp. 143–157.
- CADE-2011-LiuL #morphism #unification
- Efficient General Unification for XOR with Homomorphism (ZL, CL), pp. 407–421.
- CADE-2011-WiesMK #data type #imperative
- An Efficient Decision Procedure for Imperative Tree Data Structures (TW, MM, VK), pp. 476–491.
- CAV-2011-BrazdilKK #analysis #bound #probability #source code
- Efficient Analysis of Probabilistic Programs with an Unbounded Counter (TB, SK, AK), pp. 208–224.
- CAV-2011-CimattiMT #automaton #hybrid #verification
- Efficient Scenario Verification for Hybrid Automata (AC, SM, ST), pp. 317–332.
- CAV-2011-HoderBM #constraints #fixpoint #named
- μZ — An Efficient Engine for Fixed Points with Constraints (KH, NB, LMdM), pp. 457–462.
- ICLP-2011-Zombori #information retrieval #logic #reasoning
- Two Phase Description Logic Reasoning for Efficient Information Retrieval (ZZ), pp. 296–300.
- ICLP-J-2011-CruzR #evaluation #logic programming #retrieval #source code
- Efficient instance retrieval of subgoals for subsumptive tabled evaluation of logic programs (FC, RR), pp. 697–712.
- ICST-2011-AichernigBJK
- Efficient Mutation Killers in Action (BKA, HB, EJ, WK), pp. 120–129.
- ICST-2011-EngstromRL #case study #industrial #testing
- Improving Regression Testing Transparency and Efficiency with History-Based Prioritization — An Industrial Case Study (EE, PR, AL), pp. 367–376.
- ICST-2011-LuoDQ #concurrent #detection #manycore
- Multicore SDK: A Practical and Efficient Deadlock Detector for Real-World Applications (ZDL, RD, YQ), pp. 309–318.
- ISSTA-2011-BernatRM
- Efficient, sensitivity resistant binary instrumentation (ARB, KAR, BPM), pp. 89–99.
- ISSTA-2011-GligoricMK #code generation #named
- CoDeSe: fast deserialization via code generation (MG, DM, SK), pp. 298–308.
- ISSTA-2011-TanejaXTH #generative #named #testing
- eXpress: guided path exploration for efficient regression test generation (KT, TX, NT, JdH), pp. 1–11.
- ISSTA-2011-XiaoZ #analysis #encoding #geometry #java #points-to
- Geometric encoding: forging the high performance context sensitive points-to analysis for Java (XX, CZ), pp. 188–198.
- SAT-2011-HeuleJB #graph
- Efficient CNF Simplification Based on Binary Implication Graphs (MH, MJ, AB), pp. 201–215.
- SAT-2011-Minato #diagrams #named #permutation #problem
- πDD: A New Decision Diagram for Efficient Problem Solving in Permutation Space (SiM), pp. 90–104.
- SAT-2011-RyvchinS #satisfiability
- Faster Extraction of High-Level Minimal Unsatisfiable Cores (VR, OS), pp. 174–187.
- SAT-2011-TanjoTB #csp #encoding #finite
- A Compact and Efficient SAT-Encoding of Finite Domain CSP (TT, NT, MB), pp. 375–376.
- QoSA-2010-BabkaTB #modelling #predict #random #validation
- Validating Model-Driven Performance Predictions on Random Software Systems (VB, PT, LB), pp. 3–19.
- QoSA-2010-HappeWSK #modelling #parametricity #statistics
- Statistical Inference of Software Performance Models for Parametric Performance Completions (JH, DW, KS, LK), pp. 20–35.
- DocEng-2010-BilaucaH10a #authoring #documentation #layout #tool support
- Table layout performance of document authoring tools (MB, PH), pp. 199–202.
- DocEng-2010-GiannettiDLSC #estimation #on-demand #profiling
- PDF profiling for B&W versus color pages cost estimation for efficient on-demand book printing (FG, GD, RDL, GPeS, AC), pp. 177–180.
- DRR-2010-ChenMT #automation #using #validation #word
- Efficient automatic OCR word validation using word partial format derivation and language model (SC, DM, GRT), pp. 1–10.
- JCDL-2010-SautterBKM #automation #documentation #generative #named
- ProcessTron: efficient semi-automated markup generation for scientific documents (GS, KB, CK, TM), pp. 21–28.
- PODS-2010-BenderHK
- Performance guarantees for B-trees with different-sized atomic keys (MAB, HH, BCK), pp. 305–316.
- PODS-2010-NelsonW #data type #sketching
- Fast Manhattan sketches in data streams (JN, DPW), pp. 99–110.
- SIGMOD-2010-ArmbrustTFFPLTT #named #query
- PIQL: a performance insightful query language (MA, ST, AF, MJF, DAP, NL, BT, JT), pp. 1207–1210.
- SIGMOD-2010-ChenSZZX
- Searching trajectories by locations: an efficiency study (ZC, HTS, XZ, YZ, XX), pp. 255–266.
- SIGMOD-2010-KimCSSNKLBD #architecture #named
- FAST: fast architecture sensitive tree search on modern CPUs and GPUs (CK, JC, NS, ES, ADN, TK, VWL, SAB, PD), pp. 339–350.
- SIGMOD-2010-KimWS #approach #independence #memory management
- Page-differential logging: an efficient and DBMS-independent approach for storing data into flash memory (YRK, KYW, IYS), pp. 363–374.
- SIGMOD-2010-MueenNL #approximate #correlation
- Fast approximate correlation for massive time-series data (AM, SN, JL), pp. 171–182.
- SIGMOD-2010-SatishKCNLKD
- Fast sort on CPUs and GPUs: a case for bandwidth oblivious SIMD sort (NS, CK, JC, ADN, VWL, DK, PD), pp. 351–362.
- SIGMOD-2010-TsirogiannisHS #database #energy
- Analyzing the energy efficiency of a database server (DT, SH, MAS), pp. 231–242.
- SIGMOD-2010-VernicaCL #parallel #pipes and filters #using
- Efficient parallel set-similarity joins using MapReduce (RV, MJC, CL), pp. 495–506.
- SIGMOD-2010-Wei #graph #named #query
- TEDI: efficient shortest path query answering on graphs (FW0), pp. 99–110.
- SIGMOD-2010-ZhouSTLLM #maintenance #network #query
- Efficient querying and maintenance of network provenance at internet-scale (WZ, MS, TT, XL, BTL, YM), pp. 615–626.
- VLDB-2010-BuHBE #clustering #named #scalability
- HaLoop: Efficient Iterative Data Processing on Large Clusters (YB, BH, MB, MDE), pp. 285–296.
- VLDB-2010-Chen #named #pipes and filters
- Cheetah: A High Performance, Custom Data Warehouse on Top of MapReduce (SC), pp. 1459–1468.
- VLDB-2010-GrimsmoBH
- Fast Optimal Twig Joins (NG, TAB, MLH), pp. 894–905.
- VLDB-2010-JiangOSW #pipes and filters
- The Performance of MapReduce: An In-depth Study (DJ, BCO, LS, SW), pp. 472–483.
- VLDB-2010-KandhanTP #multi #named #pattern matching #scalability
- SigMatch: Fast and Scalable Multi-Pattern Matching (RK, NT, JMP), pp. 1173–1184.
- VLDB-2010-LobozSN #named
- DataGarage: Warehousing Massive Performance Data on Commodity Servers (CL, SS, SN), pp. 1447–1458.
- VLDB-2010-McConnellPH #approach #named #reliability #replication
- iFlow: An Approach for Fast and Reliable Internet-Scale Stream Processing Utilizing Detouring and Replication (CM, FP, JHH), pp. 1557–1560.
- VLDB-2010-NeumannW #consistency #database #named #query #rdf
- x-RDF-3X: Fast Querying, High Update Rates, and Consistency for RDF Databases (TN, GW), pp. 256–263.
- VLDB-2010-PD #metric #retrieval #similarity
- Efficient RkNN Retrieval with Arbitrary Non-Metric Similarity Measures (DP, PD), pp. 1243–1254.
- VLDB-2010-SadoghiJLSS #algorithm #configuration management #hardware
- Efficient Event Processing through Reconfigurable Hardware for Algorithmic Trading (MS, HAJ, ML, WS, HS), pp. 1525–1528.
- VLDB-2010-SharifzadehS #diagrams #named #nearest neighbour #query
- VoR-Tree: R-trees with Voronoi Diagrams for Efficient Processing of Spatial Nearest Neighbor Queries (MS, CS), pp. 1231–1242.
- VLDB-2010-WangLF #constraints #named #similarity #string
- Trie-Join: Efficient Trie-based String Similarity Joins with Edit-Distance Constraints (JW, GL, JF), pp. 1219–1230.
- VLDB-2010-WuJOW
- Efficient B-tree Based Indexing for Cloud Data Processing (SW, DJ, BCO, KLW), pp. 1207–1218.
- VLDB-2010-XuZTY #data-driven #database #distance #effectiveness #probability #similarity
- Efficient and Effective Similarity Search over Probabilistic Data based on Earth Mover’s Distance (JX, ZZ, AKHT, GY), pp. 758–769.
- VLDB-2010-YiuUST #detection #mobile #policy #proximity #self
- Efficient Proximity Detection among Mobile Users via Self-Tuning Policies (MLY, LHU, SS, KT), pp. 985–996.
- VLDB-2010-ZhangMKC #evaluation #order
- Efficient Skyline Evaluation over Partially Ordered Domains (SZ, NM, BK, DWLC), pp. 1255–1266.
- VLDB-2011-BahmaniCG10 #incremental #personalisation #rank
- Fast Incremental and Personalized PageRank (BB, AC, AG), pp. 173–184.
- VLDB-2011-KlingOD #database #execution #generative #xml
- Generating Efficient Execution Plans for Vertically Partitioned XML Databases (PK, MTÖ, KD), pp. 1–11.
- VLDB-2011-LeeH10 #clustering #named #using
- QSkycube: Efficient Skycube Computation using Point-Based Space Partitioning (JL, SwH), pp. 185–196.
- VLDB-2011-LiuC10 #named
- ZINC: Efficient Indexing for Skyline Computation (BL, CYC), pp. 197–207.
- VLDB-2011-Rocha-JuniorVDN10 #query
- Efficient Processing of Top-k Spatial Preference Queries (JBRJ, AV, CD, KN), pp. 93–104.
- EDM-2010-DesmaraisP #on the #student
- On the Faithfulness of Simulated Student Performance Data (MCD, IP), pp. 21–30.
- EDM-2010-WangHB #representation #student
- Representing Student Performance with Partial Credit (YW, NTH, JEB), pp. 335–336.
- EDM-2010-XiongLS #locality #mining #problem
- Assessing Reviewer’s Performance Based on Mining Problem Localization in Peer-Review Data (WX, DJL, CDS), pp. 211–220.
- ITiCSE-2010-DennyLHDP #predict #programming #self
- Self-predicted and actual performance in an introductory programming course (PD, ALR, JH, DBD, HCP), pp. 118–122.
- ITiCSE-2010-GomesM #case study #student
- A study on student performance in first year CS courses (AJG, AJM), pp. 113–117.
- SIGITE-2010-KulgachevJ #evaluation #network #using
- 802.11 networks performance evaluation using OPNET (VK, HJ), pp. 149–152.
- CSMR-2010-MalikJAHFH #analysis #automation #comparison #enterprise #scalability #testing
- Automatic Comparison of Load Tests to Support the Performance Analysis of Large Enterprise Systems (HM, ZMJ, BA, AEH, PF, GH), pp. 222–231.
- ICSM-2010-FerreiraMSBCP #approach
- An approach to improving software inspections performance (ALF, RJM, JGS, RFB, LC, MCP), pp. 1–8.
- ICSM-2010-Letarte #interprocedural #model checking #static analysis
- Conversion of fast inter-procedural static analysis to model checking (DL), pp. 1–2.
- MSR-2010-LuijtenVZ #assessment
- Assessment of issue handling efficiency (BL, JV, AZ), pp. 94–97.
- CIAA-2010-AllauzenRS #composition #finite #transducer
- Filters for Efficient Composition of Weighted Finite-State Transducers (CA, MR, JS), pp. 28–38.
- CIAA-2010-Maletti #fault
- Better Hyper-minimization — Not as Fast, But Fewer Errors (AM), pp. 201–210.
DLT-2010-Okhotin #algorithm #boolean grammar #parsing- Fast Parsing for Boolean Grammars: A Generalization of Valiant’s Algorithm (AO), pp. 340–351.
- ICALP-v1-2010-ApplebaumIK #verification
- From Secrecy to Soundness: Efficient Verification via Secure Computation (BA, YI, EK), pp. 152–163.
- ICALP-v1-2010-BojanczykP #automaton #evaluation #nondeterminism #using
- Efficient Evaluation of Nondeterministic Automata Using Factorization Forests (MB, PP), pp. 515–526.
- ICALP-v1-2010-FakcharoenpholLN #algorithm #problem
- Faster Algorithms for Semi-matching Problems (JF, BL, DN), pp. 176–187.
- ICALP-v1-2010-LibertY #encryption
- Efficient Completely Non-malleable Public Key Encryption (BL, MY), pp. 127–139.
- ICALP-v2-2010-AlistarhGGZ #cost analysis #how
- How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange) (DA, SG, RG, MZ), pp. 115–126.
- ICALP-v2-2010-BerenbrinkCEG #random
- Efficient Information Exchange in the Random Phone-Call Model (PB, JC, RE, LG), pp. 127–138.
- LATA-2010-Arslan #algorithm #sequence #string
- A Fast Longest Common Subsequence Algorithm for Similar Strings (ANA), pp. 82–93.
- RTA-2010-LevyV #algorithm #unification
- An Efficient Nominal Unification Algorithm (JL, MV), pp. 209–226.
- SFM-2010-WolterR #security #trade-off
- Performance and Security Tradeoff (KW, PR), pp. 135–167.
- Haskell-2010-Straka #haskell
- The performance of the Haskell containers package (MS), pp. 13–24.
- AIIDE-2010-KringCS #game studies
- DHPA* and SHPA*: Efficient Hierarchical Pathfinding in Dynamic and Static Game Worlds (AWK, AJC, NS).
- CIG-2010-GuervosMRC #game studies
- Assessing efficiency of different evolutionary strategies playing MasterMind (JJMG, AMM, TPR, CC), pp. 38–45.
GT-VMT-2010-HermannCEK #analysis #equivalence #graph #permutation #petri net- Efficient Analysis of Permutation Equivalence of Graph Derivations Based on Petri Nets (FH, AC, HE, BK).
- CHI-2010-CaoVI #hybrid
- Comparing user performance with single-finger, whole-hand, and hybrid pointing devices (XC, NV, SI), pp. 1643–1646.
- CHI-2010-ChinF #difference #interactive #interface
- Interactive effects of age and interface differences on search strategies and performance (JC, WTF), pp. 403–412.
- CHI-2010-DiakopoulosS #sentiment #twitter
- Characterizing debate performance via aggregated twitter sentiment (ND, DAS), pp. 1195–1198.
- CHI-2010-HarrisonYH #visual notation
- Faster progress bars: manipulating perceived duration with visual augmentations (CH, ZY, SEH), pp. 1545–1548.
- CHI-2010-Li #gesture #named
- Protractor: a fast and accurate gesture recognizer (YL), pp. 2169–2172.
- CHI-2010-QuinnT #effectiveness #independence #usability
- Attractive phones don’t have to work better: independent effects of attractiveness, effectiveness, and efficiency on perceived usability (JMQ, TQT), pp. 353–362.
- CHI-2010-VertanenM #speech #using
- Speech dasher: fast writing using speech and gaze (KV, DJCM), pp. 595–598.
SOFTVIS-2010-AdamoliH #analysis #framework #named #visualisation- Trevis: a context tree visualization & analysis framework and its use for classifying performance failure reports (AA, MH), pp. 73–82.
- ICEIS-AIDSS-2010-AdamLDB #clustering #parallel #using
- Performance Gain for Clustering with Growing Neural Gas using Parallelization Methods (AA, SL, SD, WB), pp. 264–269.
- ICEIS-AIDSS-2010-AhdabG #learning #network
- Efficient Learning of Dynamic Bayesian Networks from Timed Data (AA, MLG), pp. 226–231.
- ICEIS-AIDSS-2010-GilS #implementation #process #using
- Using Key Performance Indicators to Facilitate the Strategy Implementation and Business Process Improvement in SME’s (MMG, DNS), pp. 193–197.
- ICEIS-AIDSS-2010-PortelaAROG #automation #detection #framework #game studies
- An Intelligent Framework for Automatic Event Detection in Robotic Soccer Games — An Auxiliar Tool to Help Coaches Improve their Teams’ Performance (JP, PA, LPR, ECO, JG), pp. 244–249.
- ICEIS-DISI-2010-KetataMMH #automation #maintenance #ontology
- Efficient Semi-automatic Maintenance of Mapping between Ontologies in a Biomedical Environment (IK, RM, FM, AH), pp. 257–262.
- ICEIS-HCI-2010-DelceaDC #collaboration #enterprise
- A Model for Improving Enterprise’s Performance based on Collaborative e-Learning (CD, MD, CC), pp. 5–12.
- ICEIS-ISAS-2010-KokkinakiV #case study
- Performance Management and Control — A Case Study in Mercedes Benz Cyprus (AIK, AV), pp. 321–325.
- ICEIS-SAIC-2010-DascaluDPV #assessment #project management
- The Impact of Competences Assessment Systems to Firm Performance — Study on Project Management e-Assessment (MID, CD, DP, BV), pp. 59–64.
- CIKM-2010-AlmeidaTL #metric #named #similarity
- BP-tree: an efficient index for similarity search in high-dimensional metric spaces (JA, RdST, NJL), pp. 1365–1368.
- CIKM-2010-AnandBBS #keyword #version control
- Efficient temporal keyword search over versioned text (AA, SJB, KB, RS), pp. 699–708.
- CIKM-2010-BonacicGMPT #concurrent #multi #thread
- Building efficient multi-threaded search nodes (CB, CG, MM, MPM, FT), pp. 1249–1258.
- CIKM-2010-CartrightALM #approximate #modelling #query #using
- Fast query expansion using approximations of relevance models (MAC, JA, VL, AM), pp. 1573–1576.
- CIKM-2010-ChenJPL #algorithm #database #mining #scalability
- An efficient algorithm for mining time interval-based patterns in large database (YCC, JCJ, WCP, SYL), pp. 49–58.
- CIKM-2010-DasguptaBL #clustering #taxonomy #web #web service
- Taxonomic clustering of web service for efficient discovery (SD, SB, YL), pp. 1617–1620.
- CIKM-2010-FanWW #clustering #normalisation #visual notation
- Maximum normalized spacing for efficient visual clustering (ZGF, YW, BW), pp. 409–418.
- CIKM-2010-GaoQJWY #graph
- Fast top-k simple shortest paths discovery in graphs (JG, HQ, XJ, TW, DY), pp. 509–518.
- CIKM-2010-GargNB #algorithm #memory management #realtime
- Real-time memory efficient data redundancy removal algorithm (VKG, AN, SB), pp. 1259–1268.
- CIKM-2010-GuanXZGY #analysis #classification #documentation #reduction
- Fast dimension reduction for document classification based on imprecise spectrum analysis (HG, BX, JZ, MG, TY), pp. 1753–1756.
- CIKM-2010-GubichevBSW #estimation #graph #scalability
- Fast and accurate estimation of shortest paths in large graphs (AG, SJB, SS, GW), pp. 499–508.
- CIKM-2010-HarpaleYGHY #dataset #multi #named #personalisation
- CiteData: a new multi-faceted dataset for evaluating personalized search performance (AH, YY, SG, DH, ZY), pp. 549–558.
- CIKM-2010-HauffKA #comparison #predict #query
- A comparison of user and system query performance predictions (CH, DK, LA), pp. 979–988.
- CIKM-2010-KimKLB #interpreter #semantics
- Efficient wikipedia-based semantic interpreter by exploiting top-k processing (JWK, AK, DL, SB), pp. 1813–1816.
- CIKM-2010-LiXCH #named #optimisation
- StableBuffer: optimizing write performance for DBMS applications on flash devices (YL, JX, BC, HH), pp. 339–348.
- CIKM-2010-ParkSYRY #network #query
- An efficient data-centric storage scheme considering storage and query hot-spots in sensor networks (YP, DS, JY, CTR, JY), pp. 1325–1328.
- CIKM-2010-SilvestriV #encoding #integer #named #programming
- VSEncoding: efficient coding and fast decoding of integer lists via dynamic programming (FS, RV), pp. 1219–1228.
- CIKM-2010-SongC #database
- Efficient set-correlation operator inside databases (SS, LC), pp. 139–148.
- CIKM-2010-YanSZSW #proximity
- Efficient term proximity search with term-pair indexes (HY, SS, FZ, TS, JRW), pp. 1229–1238.
- ECIR-2010-BelloginC #approach #collaboration #predict
- A Performance Prediction Approach to Enhance Collaborative Filtering Performance (AB, PC), pp. 382–393.
- ECIR-2010-Collins-ThompsonB #classification #predict #query
- Predicting Query Performance via Classification (KCT, PNB), pp. 140–152.
- ECIR-2010-HauffAHJ #effectiveness #evaluation #predict #query
- Query Performance Prediction: Evaluation Contrasted with Effectiveness (CH, LA, DH, FdJ), pp. 204–216.
- ICML-2010-Busa-FeketeK #using
- Fast boosting using adversarial bandits (RBF, BK), pp. 143–150.
- ICML-2010-Cesa-BianchiSS #learning
- Efficient Learning with Partially Observed Attributes (NCB, SSS, OS), pp. 183–190.
- ICML-2010-CostaG #distance #kernel
- Fast Neighborhood Subgraph Pairwise Distance Kernel (FC, KDG), pp. 255–262.
- ICML-2010-GregorL #approximate #learning
- Learning Fast Approximations of Sparse Coding (KG, YL), pp. 399–406.
- ICML-2010-KalyanakrishnanS #multi #theory and practice
- Efficient Selection of Multiple Bandit Arms: Theory and Practice (SK, PS), pp. 511–518.
- ICML-2010-LizotteBM #analysis #learning #multi #random
- Efficient Reinforcement Learning with Multiple Reward Functions for Randomized Controlled Trial Analysis (DJL, MHB, SAM), pp. 695–702.
- ICML-2010-McAuleyC
- Exploiting Data-Independence for Fast Belief-Propagation (JJM, TSC), pp. 767–774.
- ICML-2010-RouxF
- A fast natural Newton method (NLR, AWF), pp. 623–630.
- ICML-2010-TomiokaSSK #algorithm #learning #matrix #rank
- A Fast Augmented Lagrangian Algorithm for Learning Low-Rank Matrices (RT, TS, MS, HK), pp. 1087–1094.
- ICML-2010-XuJYKL #kernel #learning #multi
- Simple and Efficient Multiple Kernel Learning by Group Lasso (ZX, RJ, HY, IK, MRL), pp. 1175–1182.
- ICPR-2010-AroraS #algorithm #learning
- An Efficient and Stable Algorithm for Learning Rotations (RA, WAS), pp. 2993–2996.
- ICPR-2010-BaghshahS #constraints #kernel #learning
- Efficient Kernel Learning from Constraints and Unlabeled Data (MSB, SBS), pp. 3364–3367.
- ICPR-2010-BalujaC #learning #retrieval
- Beyond “Near Duplicates”: Learning Hash Codes for Efficient Similar-Image Retrieval (SB, MC), pp. 543–547.
- ICPR-2010-BauerEOBKFHN #approach #bound #estimation #graph #robust
- A Fast and Robust Graph-Based Approach for Boundary Estimation of Fiber Bundles Relying on Fractional Anisotropy Maps (MHAB, JE, TO, SB, JK, BF, HKH, CN), pp. 4016–4019.
- ICPR-2010-BeecksWS #multi
- Improving the Efficiency of Content-Based Multimedia Exploration (CB, SW, TS), pp. 3163–3166.
- ICPR-2010-BrezovanBGSS #adaptation #detection #image #visual notation
- An Adaptive Method for Efficient Detection of Salient Visual Object from Color Images (MB, DDB, EG, LS, CSS), pp. 2346–2349.
- ICPR-2010-ChenJ #3d #self
- Efficient 3D Upper Body Tracking with Self-Occlusions (JC, QJ), pp. 3636–3639.
- ICPR-2010-Coeurjolly #approximate
- Fast and Accurate Approximation of the Euclidean Opening Function in Arbitrary Dimension (DC), pp. 229–232.
- ICPR-2010-CohenP #learning #robust
- Reinforcement Learning for Robust and Efficient Real-World Tracking (AC, VP), pp. 2989–2992.
- ICPR-2010-CordellaSFMF #classification
- Combining Single Class Features for Improving Performance of a Two Stage Classifier (LPC, CDS, FF, CM, ASdF), pp. 4352–4355.
- ICPR-2010-Demirci #retrieval
- Efficient Shape Retrieval Under Partial Matching (MFD), pp. 3057–3060.
- ICPR-2010-DornaikaC #classification #detection #using
- Efficient Object Detection and Matching Using Feature Classification (FD, FC), pp. 3073–3076.
- ICPR-2010-DurrantK #bound
- A Bound on the Performance of LDA in Randomly Projected Data Spaces (RJD, AK), pp. 4044–4047.
- ICPR-2010-DuttaPFL #approach #documentation
- An Efficient Staff Removal Approach from Printed Musical Documents (AD, UP, AF, JL), pp. 1965–1968.
- ICPR-2010-EudesLND #integration #visual notation
- Fast Odometry Integration in Local Bundle Adjustment-Based Visual SLAM (AE, ML, SNC, MD), pp. 290–293.
- ICPR-2010-FefilatyevGL #image
- Tracking Ships from Fast Moving Camera through Image Registration (SF, DBG, CL), pp. 3500–3503.
- ICPR-2010-FoureyB #combinator #encoding
- Efficient Encoding of n-D Combinatorial Pyramids (SF, LB), pp. 1036–1039.
- ICPR-2010-FrohlichRD #approach #image
- A Fast Approach for Pixelwise Labeling of Facade Images (BF, ER, JD), pp. 3029–3032.
- ICPR-2010-GarciaMS #analysis
- Theoretical Analysis of a Performance Measure for Imbalanced Data (VG, RAM, JSS), pp. 617–620.
- ICPR-2010-GargiuloS #classification #network
- Improving Performance of Network Traffic Classification Systems by Cleaning Training Data (FG, CS), pp. 2768–2771.
- ICPR-2010-GhiasiS #identification #independence
- An Efficient Method for Offline Text Independent Writer Identification (GG, RS), pp. 1245–1248.
- ICPR-2010-GranaBC #algorithm
- Decision Trees for Fast Thinning Algorithms (CG, DB, RC), pp. 2836–2839.
- ICPR-2010-GuoMR #database #recognition #scalability #using
- Cross-Age Face Recognition on a Very Large Database: The Performance versus Age Intervals and Improvement Using Soft Biometric Traits (GG, GM, KR), pp. 3392–3395.
- ICPR-2010-HiraiUK #realtime
- Real-Time Pose Regression with Fast Volume Descriptor Computation (MH, NU, MK), pp. 1852–1855.
- ICPR-2010-IjiriLHM #recognition
- Efficient Facial Attribute Recognition with a Spatial Codebook (YI, SL, TXH, HM), pp. 1461–1464.
- ICPR-2010-IwahoriIWKFK
- Extending Fast Marching Method under Point Light Source Illumination and Perspective Projection (YI, KI, RJW, HK, SF, KK), pp. 1650–1653.
- ICPR-2010-JakkojuKJ #classification #using
- Fast and Spatially-Smooth Terrain Classification Using Monocular Camera (CJ, KMK, CVJ), pp. 4060–4063.
- ICPR-2010-JiaCLW #image #learning
- Efficient Learning to Label Images (KJ, LC, NL, LW), pp. 942–945.
- ICPR-2010-KimuraKSNMSI #canonical #correlation #learning #named
- SemiCCA: Efficient Semi-supervised Learning of Canonical Correlations (AK, HK, MS, TN, EM, HS, KI), pp. 2933–2936.
- ICPR-2010-KonyaES #detection #documentation #image
- Fast Seamless Skew and Orientation Detection in Document Images (IVK, SE, CS), pp. 1924–1928.
- ICPR-2010-KopenkovM #algorithm #recursion #research
- Research the Performance of a Recursive Algorithm of the Local Discrete Wavelet Transform (VNK, VVM), pp. 4452–4455.
- ICPR-2010-KuksaP #classification #representation #sequence
- Spatial Representation for Efficient Sequence Classification (PPK, VP), pp. 3320–3323.
- ICPR-2010-Lian #detection #retrieval
- Fast Fingerprint Retrieval with Line Detection (HCL), pp. 3151–3154.
- ICPR-2010-LiBN #network #on the
- On the Performance of Handoff and Tracking in a Camera Network (YL, BB, VN), pp. 3645–3648.
- ICPR-2010-LiSN #detection #documentation #image #recognition
- Fast Logo Detection and Recognition in Document Images (ZL, MSA, MN), pp. 2716–2719.
- ICPR-2010-LiuZYL #hybrid #image
- A Fast Image Inpainting Method Based on Hybrid Similarity-Distance (JL, SZ, WY, HL), pp. 4432–4435.
- ICPR-2010-MangalampalliCS #classification #fuzzy #image #named
- I-FAC: Efficient Fuzzy Associative Classifier for Object Classes in Images (AM, VC, SS), pp. 4388–4391.
- ICPR-2010-MaramisD #image #information management
- Efficient Quantitative Information Extraction from PCR-RFLP Gel Electrophoresis Images (CM, AD), pp. 2560–2563.
- ICPR-2010-MicoO #algorithm #constant #nearest neighbour
- A Constant Average Time Algorithm to Allow Insertions in the LAESA Fast Nearest Neighbour Search Index (LM, JO), pp. 3911–3914.
- ICPR-2010-NasonovK #using
- Fast Super-Resolution Using Weighted Median Filtering (AVN, ASK), pp. 2230–2233.
- ICPR-2010-NguyenAC #approach #locality
- Unifying Approach for Fast License Plate Localization and Super-Resolution (CDN, MA, LC), pp. 376–379.
- ICPR-2010-PuertasRFOE #comprehension #forensics #recognition #towards
- Towards a Better Understanding of the Performance of Latent Fingerprint Recognition in Realistic Forensic Conditions (MP, DR, JF, JOG, NE), pp. 1638–1641.
- ICPR-2010-PullaKJ #image #retrieval #semantics
- Efficient Semantic Indexing for Image Retrieval (CP, PSK, CVJ), pp. 3276–3279.
- ICPR-2010-QiuPVLL #recognition #representation #robust
- A Fast Extension for Sparse Representation on Robust Face Recognition (HQ, DSP, SV, WL, JHL), pp. 1023–1027.
- ICPR-2010-RathgebU #recognition
- Attacking Iris Recognition: An Efficient Hill-Climbing Technique (CR, AU), pp. 1217–1220.
- ICPR-2010-ReinbacherRB #estimation
- Pose Estimation of Known Objects by Efficient Silhouette Matching (CR, MR, HB), pp. 1080–1083.
- ICPR-2010-RevaudLAB #graph #learning #recognition #robust
- Learning an Efficient and Robust Graph Matching Procedure for Specific Object Recognition (JR, GL, YA, AB), pp. 754–757.
- ICPR-2010-SemenovichS #higher-order
- Tensor Power Method for Efficient MAP Inference in Higher-order MRFs (DS, AS), pp. 734–737.
- ICPR-2010-SeoAD #classification #evaluation #segmentation #tool support
- Performance Evaluation Tools for Zone Segmentation and Classification (PETS) (WS, MA, DSD), pp. 503–506.
- ICPR-2010-SeppkeDHW #equation #multi #parametricity #using
- Fast Derivation of Soil Surface Roughness Parameters Using Multi-band SAR Imagery and the Integral Equation Model (BS, LSDF, JAH, FW), pp. 3931–3934.
- ICPR-2010-ShahrokniGF #novel #recognition
- A Novel Shape Feature for Fast Region-Based Pedestrian Recognition (AS, DG, JMF), pp. 444–447.
- ICPR-2010-ShibataKI #classification #nearest neighbour #scalability
- Large Margin Discriminant Hashing for Fast k-Nearest Neighbor Classification (TS, SK, SI), pp. 1015–1018.
- ICPR-2010-Tabassi #fault #image #metric
- Image Specific Error Rate: A Biometric Performance Metric (ET), pp. 1124–1127.
- ICPR-2010-TresadernC #constraints
- Gradient Constraints Can Improve Displacement Expert Performance (PAT, TFC), pp. 157–160.
- ICPR-2010-VajdaF #network
- Exploring Pattern Selection Strategies for Fast Neural Network Training (SV, GAF), pp. 2913–2916.
- ICPR-2010-VillamizarMAS #category theory #detection #multi #random
- Shared Random Ferns for Efficient Detection of Multiple Categories (MV, FMN, JAC, AS), pp. 388–391.
- ICPR-2010-VuLB #algorithm #clustering #constraints
- An Efficient Active Constraint Selection Algorithm for Clustering (VVV, NL, BBM), pp. 2969–2972.
- ICPR-2010-WangB #automation #clustering #evaluation #fault
- Performance Evaluation of Automatic Feature Discovery Focused within Error Clusters (SYW, HSB), pp. 718–721.
- ICPR-2010-WijnhovenW #detection #probability #using
- Fast Training of Object Detection Using Stochastic Gradient Descent (RGJW, PHNdW), pp. 424–427.
- ICPR-2010-YangK #feature model #fourier
- Fast Polar and Spherical Fourier Descriptors for Feature Extraction (ZY, SiK), pp. 975–978.
- ICPR-2010-YangL #locality #recognition
- Efficient Finger Vein Localization and Recognition (JY, XL), pp. 1148–1151.
- ICPR-2010-ZhaoGZ #evaluation #micropattern #recognition #representation
- Performance Evaluation of Micropattern Representation on Gabor Features for Face Recognition (SZ, YG, BZ), pp. 1273–1276.
- ICPR-2010-ZhouL #approximate #monte carlo #optimisation
- Efficient Polygonal Approximation of Digital Curves via Monte Carlo Optimization (XZ, YL), pp. 3513–3516.
- ICPR-2010-ZouH #3d #using
- Recovering 3D Shape Using an Improved Fast Marching Method (CZ, ERH), pp. 1678–1681.
- KDD-2010-AgarwalCE #learning #online #recommendation
- Fast online learning through offline initialization for time-sensitive recommendation (DA, BCC, PE), pp. 703–712.
- KDD-2010-GaoLFWSH #community #detection #network #on the
- On community outliers and their efficient detection in information networks (JG, FL, WF, CW, YS, JH), pp. 813–822.
- KDD-2010-KarguptaSG #data mining #distributed #mining #overview
- MineFleet®: an overview of a widely adopted distributed vehicle performance data mining system (HK, KS, MG), pp. 37–46.
- KDD-2010-LaoC #execution #modelling #query #random #retrieval
- Fast query execution for retrieval models based on path-constrained random walks (NL, WWC), pp. 881–888.
- KDD-2010-LiuYY #algorithm #problem
- An efficient algorithm for a class of fused lasso problems (JL, LY, JY), pp. 323–332.
- KDD-2010-LiWZCMJ
- Exploitation and exploration in a performance based contextual advertising system (WL, XW, RZ, YC, JM, RJ), pp. 27–36.
- KDD-2010-MarchRG #algorithm #analysis
- Fast euclidean minimum spanning tree: algorithm, analysis, and applications (WBM, PR, AGG), pp. 603–612.
- KDD-2010-RaykarKY #classification #design #trade-off
- Designing efficient cascaded classifiers: tradeoff between accuracy and cost (VCR, BK, SY), pp. 853–860.
- KDD-2010-SarkarM #graph #nearest neighbour
- Fast nearest-neighbor search in disk-resident graphs (PS, AWM), pp. 513–522.
- KDD-2010-TangAOM #empirical #framework
- Overlapping experiment infrastructure: more, better, faster experimentation (DT, AA, DO, MM), pp. 17–26.
- KDD-2010-TsengWSY #algorithm #mining #named
- UP-Growth: an efficient algorithm for high utility itemset mining (VST, CWW, BES, PSY), pp. 253–262.
- KDD-2010-WangC #algorithm #linear #modelling
- An efficient causal discovery algorithm for linear models (ZW, LC), pp. 1109–1118.
- KDD-2010-ZhuLX #feature model #incremental #learning #markov #named #random
- Grafting-light: fast, incremental feature selection and structure learning of Markov random fields (JZ, NL, EPX), pp. 303–312.
- KDIR-2010-DesaiSP #named #robust #scalability
- SEAR — Scalable, Efficient, Accurate, Robust kNN-based Regression (AD, HS, VP), pp. 392–395.
- KDIR-2010-OlsonL #clustering
- Simple and Efficient Projective Clustering (CFO, HJL), pp. 45–55.
- KDIR-2010-TsaiHYC #algorithm #clustering
- An Efficient PSO-based Clustering Algorithm (CWT, KWH, CSY, MCC), pp. 150–155.
- KDIR-2010-ViswanathBK #classification #nearest neighbour #set
- A Method to Generate a Reduced Training Set for Faster and Better Nearest Neighbor Classification (PV, VSB, TNK), pp. 232–236.
- KMIS-2010-KadhemAK #database #encryption #order #relational
- A Secure and Efficient Order Preserving Encryption Scheme for Relational Databases (HK, TA, HK), pp. 25–35.
- KR-2010-LiVK #approach
- An Efficient Majority-Rule-Based Approach for Collective Decision Making with CP-Nets (ML, QBV, RK).
- KR-2010-SanthanamBH #testing
- Efficient Dominance Testing for Unconditional Preferences (GRS, SB, VH).
- RecSys-2010-CremonesiKT #algorithm #recommendation
- Performance of recommender algorithms on top-n recommendation tasks (PC, YK, RT), pp. 39–46.
- RecSys-2010-LipczakM #learning #recommendation
- Learning in efficient tag recommendation (ML, EEM), pp. 167–174.
- RecSys-2010-PilaszyZT #dataset #feedback #matrix
- Fast als-based matrix factorization for explicit and implicit feedback datasets (IP, DZ, DT), pp. 71–78.
- SEKE-2010-AbuzeidHT #algorithm #reduction #testing
- FLAT A Fast Lattice-Based Algorithm for Test Suite Reduction (ARA, HSH, IAHT), p. 67.
- SEKE-2010-LuG #analysis #architecture #concurrent #thread #web
- Performance Analysis of a Web Server with Dynamic Thread Pool Architecture (JL, SSG), pp. 99–105.
- SEKE-2010-SrinivasaraghavanMC #re-engineering
- Smarter Software Engineering: Knowledge factors contributing to improved Individual Performance (NS, CM, JAC), pp. 309–314.
- SIGIR-2010-AmatiACGG #on the #retrieval #topic
- On performance of topical opinion retrieval (GA, GA, VC, CG, GG), pp. 777–778.
- SIGIR-2010-BalasubramanianKC10a #predict #query #web
- Predicting query performance on the web (NB, GK, VRC), pp. 785–786.
- SIGIR-2010-KeM #effectiveness #information retrieval #network #scalability
- Scalability of findability: effective and efficient IR operations in large information networks (WK, JM), pp. 74–81.
- SIGIR-2010-LiuYHA #adaptation #analysis #predict #sentiment
- S-PLASA+: adaptive sentiment analysis with application to sales performance prediction (YL, XY, XH, AA), pp. 873–874.
- SIGIR-2010-SmuckerJ #precise #retrieval #revisited
- Human performance and retrieval precision revisited (MDS, CPJ), pp. 595–602.
- SIGIR-2010-ZhangWCL #self #similarity
- Self-taught hashing for fast similarity search (DZ, JW, DC, JL), pp. 18–25.
- SIGIR-2010-ZhangZYH #detection #sequence
- Efficient partial-duplicate detection based on sequence matching (QZ, YZ, HY, XH), pp. 675–682.
- ECMFA-2010-OnoTKSNF #abstraction #embedded #execution #modelling
- A Model-Based Method for Evaluating Embedded System Performance by Abstraction of Execution Traces (KO, MT, RK, YS, TN, NF), pp. 233–244.
- SPLC-2010-LinYT #approach #product line
- An Approach to Efficient Product Configuration in Software Product Lines (YL, HY, JT), pp. 435–439.
- OOPSLA-2010-AltmanAFM #analysis #source code
- Performance analysis of idle programs (ERA, MA, SF, NM), pp. 739–753.
- OOPSLA-2010-RobersonB #composition #model checking
- Efficient modular glass box software model checking (MR, CB), pp. 4–21.
- AdaEurope-2010-Andersen #implementation #persistent
- An Efficient Implementation of Persistent Objects (JSA), pp. 265–275.
- PADL-2010-AreiasR #implementation #linear #order
- An Efficient Implementation of Linear Tabling Based on Dynamic Reordering of Alternatives (MA, RR), pp. 279–293.
- PADL-2010-LeoneRRT #integration #programming #set
- Efficient Application of Answer Set Programming for Advanced Data Integration (NL, FR, LAR, GT), pp. 10–24.
- PADL-2010-MarquesSC #concurrent #implementation
- A Simple and Efficient Implementation of Concurrent Local Tabling (RM, TS, JCC), pp. 264–278.
- PEPM-2010-MossP #implementation
- Bridging the gap between symbolic and efficient AES implementations (AM, DP), pp. 101–110.
- PLDI-2010-BondBG #analysis #context-sensitive grammar #debugging #detection #named
- Breadcrumbs: efficient context sensitivity for dynamic bug detection analyses (MDB, GZB, SZG), pp. 13–24.
- PLDI-2010-ChambersRPAHBW #named #pipes and filters
- FlumeJava: easy, efficient data-parallel pipelines (CC, AR, FP, SA, RRH, RB, NW), pp. 363–375.
- PLDI-2010-KamruzzamanST #concurrent #distributed #thread
- Software data spreading: leveraging distributed caches to improve single thread performance (MK, SS, DMT), pp. 460–470.
- PLDI-2010-MarinoSMMN #concurrent #memory management #named #programming language
- DRFX: a simple and efficient memory model for concurrent programming languages (DM, AS, TDM, MM, SN), pp. 351–362.
- PPDP-2010-TekleL #analysis #complexity #datalog #precise #query
- Precise complexity analysis for efficient datalog queries (KTT, YAL), pp. 35–44.
- QAPL-2010-AltisenLM #automaton #calculus #component #evaluation #interface #realtime #using
- Performance Evaluation of Components Using a Granularity-based Interface Between Real-Time Calculus and Timed Automata (KA, YL, MM), pp. 16–33.
- QAPL-2010-StefanekHB #analysis #parallel
- A new tool for the performance analysis of massively parallel computer systems (AS, RAH, JTB), pp. 159–181.
- SAC-OOPS-J-2008-LogozzoF10 #abstract domain #array #named #relational #validation
- Pentagons: A weakly relational abstract domain for the efficient validation of array accesses (FL, MF), pp. 796–807.
- FSE-2010-BirdBRB #named
- LINKSTER: enabling efficient manual inspection and annotation of mined data (CB, AB, FR, AB), pp. 369–370.
- FSE-2010-KillianNPBAJ #debugging #implementation
- Finding latent performance bugs in systems implementations (CEK, KN, SP, RB, JWA, RJ), pp. 17–26.
- ICSE-2010-BianculliBD #evaluation #middleware #named
- SOABench: performance evaluation of service-oriented middleware made easy (DB, WB, MLD), pp. 301–302.
- ICSE-2010-Bodden #analysis #hybrid #type system
- Efficient hybrid typestate analysis by determining continuation-equivalent states (EB), pp. 5–14.
- ICSE-2010-ClassenHSLR #model checking #product line #verification
- Model checking lots of systems: efficient verification of temporal properties in software product lines (AC, PH, PYS, AL, JFR), pp. 335–344.
- ICSE-2010-HuberBRSR #case study #industrial #modelling
- Performance modeling in industry: a case study on storage virtualization (NH, SB, CR, JS, RHR), pp. 1–10.
- ICSE-2010-Padua #complexity #effectiveness
- Measuring complexity, effectiveness and efficiency in software course projects (WP), pp. 545–554.
- SAC-2010-AhmedLSH #identification
- Fast file-type identification (IA, KsL, HS, MH), pp. 1601–1602.
- SAC-2010-AminBJ #framework #interactive
- A cytoscape based framework for efficient sub-graph isomorphic protein-protein interaction motif lookup (MSA, AB, HMJ), pp. 1572–1576.
- SAC-2010-AnastasiadisSP #detection #multi
- A fast multiplier-less edge detection accelerator for FPGAs (NA, IS, KZP), pp. 510–515.
- SAC-2010-ArnaudB #adaptation #internet
- Adaptive internet services through performance and availability control (JA, SB), pp. 444–451.
- SAC-2010-BaeAVNB #algorithm #search-based
- Convex onion peeling genetic algorithm: an efficient solution to map labeling of point-feature (WDB, SA, PV, SN, KYB), pp. 892–899.
- SAC-2010-BallanceC #monitoring #source code
- Monitoring MPI programs for performance characterization and management control (RAB, JC), pp. 2305–2310.
- SAC-2010-BayerKK #analysis
- Improving the efficiency of dynamic malware analysis (UB, EK, CK), pp. 1871–1878.
- SAC-2010-Brunthaler
- Efficient inline caching without dynamic translation (SB), pp. 2155–2156.
- SAC-2010-ChokshiB #analysis #calculus #realtime #revisited #using
- Performance analysis of FlexRay-based systems using real-time calculus, revisited (DBC, PB), pp. 351–356.
- SAC-2010-GhoshS #constraints #design #energy
- Efficient mapping and voltage islanding technique for energy minimization in NoC under design constraints (PG, AS), pp. 535–541.
- SAC-2010-HeoGEKJ #energy #memory management
- Energy efficient program updating for sensor nodes with flash memory (JH, BG, SIE, PK, GJ), pp. 194–200.
- SAC-2010-JungCKK #adaptation #named #reliability
- ASTRAL: an adaptive, efficient, and reliable flooding mechanism for MANET (JJ, YC, YK, IK), pp. 731–732.
- SAC-2010-LeeKM #named #random
- ReSSD: a software layer for resuscitating SSDs from poor small random write performance (YL, JSK, SM), pp. 242–243.
- SAC-2010-LeeST #algorithm #database #incremental
- An incremental algorithm for efficient unique signature discoveries on DNA databases (HPL, TFS, CYT), pp. 1506–1510.
- SAC-2010-LiuCGT #energy #mobile
- Energy efficient management scheme for heterogeneous secondary storage system in mobile computers (SL, XC, XG, DT), pp. 251–257.
- SAC-2010-LoTLC #named
- Swap-before-hibernate: a time efficient method to suspend an OS to a flash drive (SWL, WsT, JgL, GsC), pp. 201–205.
- SAC-2010-MarascuML #approximate #set #streaming
- A fast approximation strategy for summarizing a set of streaming time series (AM, FM, YL), pp. 1617–1621.
- SAC-2010-ParkKCKH #named #peer-to-peer #replication
- Chordet: an efficient and transparent replication for improving availability of peer-to-peer networked systems (GP, SK, YC, JK, JH), pp. 221–225.
- SAC-2010-PetrucciLM #clustering #optimisation
- Dynamic optimization of power and performance for virtualized server clusters (VP, OL, DM), pp. 263–264.
- SAC-2010-RajgarhiaG #file system
- Performance and extension of user space file systems (AR, AG), pp. 206–213.
- SAC-2010-RibeiroS #data type #named #network
- g-tries: an efficient data structure for discovering network motifs (PMPR, FMAS), pp. 1559–1566.
- SAC-2010-SchiperP #algorithm #flexibility #multi
- Fast, flexible, and highly resilient genuine fifo and causal multicast algorithms (NS, FP), pp. 418–422.
- SAC-2010-ShinLKLI #database #nearest neighbour #network
- Efficient shortest path finding of k-nearest neighbor objects in road network databases (SHS, SCL, SWK, JL, EGI), pp. 1661–1665.
- SAC-2010-VogelsJP #generative #proving #verification
- A machine-checked soundness proof for an efficient verification condition generator (FV, BJ, FP), pp. 2517–2522.
- SAC-2010-Youssef #metric #parallel #using
- Using surface effect measures to model parallel performance (BBY), pp. 2400–2401.
- SAC-2010-ZhouS #ad hoc #energy #network #throughput #towards
- Towards higher throughput and energy efficiency in dense wireless ad hoc and sensor networks (WZ, RS), pp. 749–755.
LDTA-2009-JimM10 #earley #parsing- Efficient Earley Parsing with Regular Right-hand Sides (TJ, YM), pp. 135–148.
- GPCE-2010-KriegerKW #automation #contract #simulation
- Automatic and efficient simulation of operation contracts (MPK, AK, BW), pp. 53–62.
- GPCE-2010-SinceroTLS #analysis #variability
- Efficient extraction and analysis of preprocessor-based variability (JS, RT, DL, WSP), pp. 33–42.
- LDTA-2010-BastenV #ambiguity #detection
- Faster ambiguity detection by grammar filtering (BB, JJV), p. 5.
- ASPLOS-2010-HuangDS #multi #named
- Orthrus: efficient software integrity protection on multi-cores (RCH, DYD, GES), pp. 371–384.
- ASPLOS-2010-LeeWVNCF #multi #named #online
- Respec: efficient online multiprocessor replayvia speculation and external determinism (DL, BW, KV, SN, PMC, JF), pp. 77–90.
- ASPLOS-2010-SudanCNABD #named
- Micro-pages: increasing DRAM efficiency with locality-aware data placement (KS, NC, DWN, MA, RB, AD), pp. 219–230.
- CASE-2010-ChenPWBC #modelling
- Modeling and control of a fast steering mirror in imaging applications (NC, BP, JTW, SB, AC), pp. 27–32.
- CASE-2010-ChenWZZF #analysis #process #towards
- Towards performance analysis of wheel loading process in automotive manufacturing (HC, JW, BZ, GZ, TAF), pp. 234–239.
- CASE-2010-DriesselHMS #architecture #assessment #heuristic #parallel #scheduling
- A parallel shifting bottleneck heuristic for scheduling complex job shops: Architecture and performance assessment (RD, UH, LM, WS), pp. 81–86.
- CASE-2010-FengZL #evaluation #multi #policy #scheduling
- Performance evaluation of a multi-product system with setups and dynamic scheduling policies (WF, LZ, NL), pp. 960–965.
- CASE-2010-HametnerZS #architecture #automation #component #development #industrial
- Automation component architecture for the efficient development of industrial automation systems (RH, AZ, MS), pp. 156–161.
- CASE-2010-JasperF #automation
- Automated high-speed nanopositioning inside scanning electron microscopes (DJ, SF), pp. 704–709.
- CASE-2010-ParkM #evaluation
- Performance evaluation of deterministic flow lines: Redundant modules and application to semiconductor manufacturing equipment (KP, JRM), pp. 45–50.
- CGO-2010-GottschlichVS #memory management #transaction #using
- An efficient software transactional memory using commit-time invalidation (JEG, MV, JGS), pp. 101–110.
- CGO-2010-StrattonGMAMHH #compilation #fine-grained #manycore #source code #thread
- Efficient compilation of fine-grained SPMD-threaded programs for multicore CPUs (JAS, VG, JM, BA, MM, ZH, WmWH), pp. 111–119.
- CGO-2010-ZhaoBA #memory management #named #scalability
- Umbra: efficient and scalable memory shadowing (QZ, DB, SPA), pp. 22–31.
- CGO-2010-Zorn #exclamation
- Performance is dead, long live performance! (BGZ), p. 1.
- DAC-2010-ChenXDM #manycore #modelling
- Performance and power modeling in a multi-programmed multi-core environment (XC, CX, RPD, ZMM), pp. 813–818.
- DAC-2010-ChippaMRRC #algorithm #design #energy #hardware #scalability
- Scalable effort hardware design: exploiting algorithmic resilience for energy efficiency (VKC, DM, AR, KR, STC), pp. 555–560.
- DAC-2010-Coudert #algorithm #verification
- An efficient algorithm to verify generalized false paths (OC), pp. 188–193.
- DAC-2010-FayyaziK #simulation
- Efficient simulation of oscillatory combinational loops (MF, LK), pp. 777–780.
- DAC-2010-GaoYWY #analysis #correlation #estimation #statistics
- Efficient tail estimation for massive correlated log-normal sums: with applications in statistical leakage analysis (MG, ZY, YW, ZY), pp. 475–480.
- DAC-2010-GongYSKRH #constraints #estimation #named #parametricity
- QuickYield: an efficient global-search based parametric yield estimation with performance constraints (FG, HY, YS, DK, JR, LH), pp. 392–397.
- DAC-2010-HaquePJP #approach #embedded #named #policy #simulation
- SCUD: a fast single-pass L1 cache simulation approach for embedded processors with round-robin replacement policy (MSH, JP, AJ, SP), pp. 356–361.
- DAC-2010-HuangX #process #scheduling
- Performance yield-driven task allocation and scheduling for MPSoCs under process variation (LH, QX), pp. 326–331.
- DAC-2010-JangP #design
- Application-aware NoC design for efficient SDRAM access (WJ, DZP), pp. 453–456.
- DAC-2010-KaoCTC #detection
- An efficient phase detector connection structure for the skew synchronization system (YCK, HMC, KTT, SCC), pp. 729–734.
- DAC-2010-KochteSWZ #fault #manycore #simulation
- Efficient fault simulation on many-core processors (MAK, MS, HJW, CGZ), pp. 380–385.
- DAC-2010-LiaoYB
- A new IP lookup cache for high performance IP routers (GL, HY, LNB), pp. 338–343.
- DAC-2010-LimKH #functional #generative #modelling
- An efficient test vector generation for checking analog/mixed-signal functional models (BL, JK, MAH), pp. 767–772.
- DAC-2010-LiuYT #algorithm #analysis #robust #scalability
- A robust periodic arnoldi shooting algorithm for efficient analysis of large-scale RF/MM ICs (XL, HY, SXDT), pp. 573–578.
- DAC-2010-ModarressiST #architecture #configuration management #network
- An efficient dynamically reconfigurable on-chip network architecture (MM, HSA, AT), pp. 166–169.
- DAC-2010-ShihC #independence #synthesis
- Fast timing-model independent buffered clock-tree synthesis (XWS, YWC), pp. 80–85.
- DAC-2010-VeetilCSB #monte carlo #resource management
- Efficient smart monte carlo based SSTA on graphics processing units with improved resource utilization (VV, YHC, DS, DB), pp. 793–798.
- DAC-2010-WangCW #identification
- Fast identification of operating current for toggle MRAM by spiral search (SHW, CYC, CWW), pp. 923–928.
- DAC-2010-XiongW #algorithm #constraints #grid #linear #power management #verification
- An efficient dual algorithm for vectorless power grid verification under linear current constraints (XX, JW), pp. 837–842.
- DAC-2010-YeL #modelling #optimisation #parallel #runtime #simulation
- Parallel program performance modeling for runtime optimization of multi-algorithm circuit simulation (XY, PL), pp. 561–566.
- DAC-2010-ZhangCTL #modelling #multi #scalability #towards
- Toward efficient large-scale performance modeling of integrated circuits via multi-mode/multi-corner sparse regression (WZ, THC, MYT, XL), pp. 897–902.
- DAC-2010-ZhangS #adaptation
- Adaptive and autonomous thermal tracking for high performance computing systems (YZ, AS), pp. 68–73.
- DATE-2010-AbbasCFKA #adaptation #automation #framework #generative #testing
- An automatic test generation framework for digitally-assisted adaptive equalizers in high-speed serial links (MA, KTC, YF, SK, KA), pp. 1755–1760.
- DATE-2010-AgheraKFCR #energy #named
- DynAHeal: Dynamic energy efficient task assignment for wireless healthcare systems (PA, DK, DF, AKC, TR), pp. 1661–1664.
- DATE-2010-BonfiettiBLM #approach #manycore #scheduling
- An efficient and complete approach for throughput-maximal SDF allocation and scheduling on multi-core platforms (AB, LB, ML, MM), pp. 897–902.
- DATE-2010-ChenQM #generative #satisfiability #testing
- Efficient decision ordering techniques for SAT-based test generation (MC, XQ, PM), pp. 490–495.
- DATE-2010-ChineaGDDK #megamodelling #on the
- On the construction of guaranteed passive macromodels for high-speed channels (AC, SGT, DD, TD, LK), pp. 1142–1147.
- DATE-2010-ChoudhuryCMA #logic
- Analytical model for TDDB-based performance degradation in combinational logic (MRC, VC, KM, RCA), pp. 423–428.
- DATE-2010-Flautner
- Optimize your power and performance yields and regain those sleepless nights (KF), p. 1006.
- DATE-2010-ForoutanTHJ
- An analytical method for evaluating Network-on-Chip performance (SF, YT, RH, AJ), pp. 1629–1632.
- DATE-2010-GhoshS #perspective
- Power efficient voltage islanding for Systems-on-chip from a floorplanning perspective (PG, AS), pp. 654–657.
- DATE-2010-HallerB #low cost
- High-speed clock recovery for low-cost FPGAs (IH, ZFB), pp. 610–613.
- DATE-2010-HaquePJP #approach #embedded #named #policy #simulation
- DEW: A fast level 1 cache simulation approach for embedded processors with FIFO replacement policy (MSH, JP, AJ, SP), pp. 496–501.
- DATE-2010-HatamiP #analysis #component #library #representation #robust #using
- Efficient representation, stratification, and compression of variational CSM library waveforms using Robust Principle Component Analysis (SH, MP), pp. 1285–1290.
- DATE-2010-JaffariA10a #analysis #correlation #variability
- Correlation controlled sampling for efficient variability analysis of analog circuits (JJ, MA), pp. 1305–1308.
- DATE-2010-LiuFG #optimisation
- An accurate and efficient yield optimization method for analog circuits based on computing budget allocation and memetic search technique (BL, FVF, GGEG), pp. 1106–1111.
- DATE-2010-LiuLW #energy #fault tolerance #realtime #scheduling
- Scheduling for energy efficiency and fault tolerance in hard real-time systems (YL, HL, KW), pp. 1444–1449.
- DATE-2010-LiuTQ #algorithm #constraints #power management
- Enhanced Q-learning algorithm for dynamic power management with performance constraint (WL, YT, QQ), pp. 602–605.
- DATE-2010-LoiB #3d #distributed #framework #interface #manycore #memory management
- An efficient distributed memory interface for many-core platform with 3D stacked DRAM (IL, LB), pp. 99–104.
- DATE-2010-LuPRR #energy #transducer
- Efficient power conversion for ultra low voltage micro scale energy transducers (CL, SPP, VR, KR), pp. 1602–1607.
- DATE-2010-MajidK
- Stretching the limits of FPGA SerDes for enhanced ATE performance (AMM, DCK), pp. 202–207.
- DATE-2010-MarongiuRB #manycore #memory management
- Efficient OpenMP data mapping for multicore platforms with vertically stacked memory (AM, MR, LB), pp. 105–110.
- DATE-2010-NeishaburiZ #clustering #debugging
- Enabling efficient post-silicon debug by clustering of hardware-assertions (MHN, ZZ), pp. 985–988.
- DATE-2010-OnoTKSNF #evaluation #execution #modelling
- A modeling method by eliminating execution traces for performance evaluation (KO, MT, RK, YS, TN, NF), pp. 1337–1340.
- DATE-2010-PanYZS #approach #megamodelling #order #reduction
- An efficient transistor-level piecewise-linear macromodeling approach for model order reduction of nonlinear circuits (XP, FY, XZ, YS), pp. 1673–1676.
- DATE-2010-PenolazziSH #energy #operating system #predict #realtime
- Predicting energy and performance overhead of Real-Time Operating Systems (SP, IS, AH), pp. 15–20.
- DATE-2010-QaziTDSC #analysis #reduction
- Loop flattening & spherical sampling: Highly efficient model reduction techniques for SRAM yield analysis (MQ, MT, LD, DS, AC), pp. 801–806.
- DATE-2010-Schlager #hardware #interactive
- Increasing the power efficiency of PCs by improving the hardware/OS interaction (CS), p. 1005.
- DATE-2010-SchlieckerNE #analysis #bound #multi
- Bounding the shared resource load for the performance analysis of multiprocessor systems (SS, MN, RE), pp. 759–764.
- DATE-2010-Scholzel #detection #fault
- HW/SW co-detection of transient and permanent faults with fast recovery in statically scheduled data paths (MS), pp. 723–728.
- DATE-2010-SheaSC #identifier
- Scoped identifiers for efficient bit aligned logging (RS, MBS, YC), pp. 1450–1455.
- DATE-2010-SrinivasJ #clustering #graph
- Clock gating approaches by IOEX graphs and cluster efficiency plots (JS, SJ), pp. 638–641.
- DATE-2010-SrivastavaSB #3d
- Efficient 3D high-frequency impedance extraction for general interconnects and inductors above a layered substrate (NS, RS, KB), pp. 459–464.
- DATE-2010-SubramanyanSSL #execution #fault tolerance #multi
- Multiplexed redundant execution: A technique for efficient fault tolerance in chip multiprocessors (PS, VS, KKS, EL), pp. 1572–1577.
- DATE-2010-TieDWC #reduction #scheduling
- Dual-Vth leakage reduction with Fast Clock Skew Scheduling Enhancement (MT, HD, TW, XC), pp. 520–525.
- DATE-2010-WatanabeA #modelling #multi #simulation
- Equivalent circuit modeling of multilayered power/ground planes for fast transient simulation (TW, HA), pp. 1153–1158.
- DATE-2010-WhittySHEP #architecture #configuration management #memory management
- Application-specific memory performance of a heterogeneous reconfigurable architecture (SW, HS, BH, RE, WPR), pp. 387–392.
- DATE-2010-WuLCT #abstraction #automation #generative #multi
- Automatic generation of software TLM in multiple abstraction layers for efficient HW/SW co-simulation (MHW, WCL, CYC, RST), pp. 1177–1182.
- DATE-2010-ZebeleinFHTD #modelling #network
- Efficient High-Level modeling in the networking domain (CZ, JF, CH, JT, RD), pp. 1189–1194.
- DATE-2010-ZhuSJ #configuration management #cpu #design #streaming
- Pareto efficient design for reconfigurable streaming applications on CPU/FPGAs (JZ, IS, AJ), pp. 1035–1040.
- HPCA-2010-BiCG #interactive #named #on-demand
- IADVS: On-demand performance for interactive applications (MB, IC, CG), pp. 1–10.
- HPCA-2010-DongYLLTG #network
- High performance network virtualization with SR-IOV (YD, XY, XL, JL, KT, HG), pp. 1–10.
- HPCA-2010-GreskampKT #configuration management #multi #named #thread
- LeadOut: Composing low-overhead frequency-enhancing techniques for single-thread performance in configurable multicores (BG, URK, JT), pp. 1–12.
- HPCA-2010-KunduRDZ #modelling
- Application performance modeling in a virtualized environment (SK, RR, KD, MZ), pp. 1–10.
- HPCA-2010-LeeCC #multi #named
- StimulusCache: Boosting performance of chip multiprocessors with excess cache (HL, SC, BRC), pp. 1–12.
- HPCA-2010-LiuJS #clustering #comprehension #how #memory management #multi
- Understanding how off-chip memory bandwidth partitioning in Chip Multiprocessors affects system performance (FL, XJ, YS), pp. 1–12.
- HPCA-2010-QureshiFL
- Improving read performance of Phase Change Memories via Write Cancellation and Write Pausing (MKQ, MF, LALM), pp. 1–11.
- HPCA-2010-SunJCNXCL #architecture #energy #hybrid
- A Hybrid solid-state storage architecture for the performance, energy consumption, and lifetime improvement (GS, YJ, YC, DN, YX, YC, HL), pp. 1–12.
- HPCA-2010-TangBHC #architecture #cpu #using
- DMA cache: Using on-chip storage to architecturally separate I/O data from CPU data for improving I/O performance (DT, YB, WH, MC), pp. 1–12.
- HPDC-2010-DonassoloCLV #scalability #simulation #using #volunteer
- Fast and scalable simulation of volunteer computing systems using SimGrid (BD, HC, AL, PV), pp. 605–612.
- HPDC-2010-GehaniKM #distributed #query
- Efficient querying of distributed provenance stores (AG, MK, TM), pp. 613–621.
- HPDC-2010-HillLMRH
- Early observations on the performance of Windows Azure (ZH, JL, MM, ARA, MH), pp. 367–376.
- HPDC-2010-JacksonRRT #in the cloud
- Seeking supernovae in the clouds: a performance study (KRJ, LR, KJR, RCT), pp. 421–429.
- HPDC-2010-JonesDD #clustering
- Impact of sub-optimal checkpoint intervals on application efficiency in computational clusters (WMJ, JTD, ND), pp. 276–279.
- HPDC-2010-LimPF #named #using
- SoftPower: fine-grain power estimations using performance counters (MYL, AP, RJF), pp. 308–311.
- HPDC-2010-McConnellPH #reliability #replication
- Detouring and replication for fast and reliable internet-scale stream processing (CM, FP, JHH), pp. 737–745.
- HPDC-2010-MooreKMKG #volunteer
- Simultaneous performance exploration and optimized search with volunteer computing (LRM, MK, TM, MK, KAG), pp. 312–315.
- HPDC-2010-PhamJJS #composition #framework
- A service composition framework for market-oriented high performance computing cloud (TVP, HJ, KEJ, ZYS), pp. 284–287.
- HPDC-2010-PlossMMGG #evaluation #multi #named
- Netlag: a performance evaluation tool for massively multi-user networked applications (AP, DM, PM, FG, SG), pp. 573–580.
- HPDC-2010-PovznerSB #distributed #named
- Horizon: efficient deadline-driven disk I/O management for distributed storage systems (AP, DS, SAB), pp. 1–12.
- HPDC-2010-RoodGLS #towards
- Toward high performance computing in unconventional computing environments (BR, NG, MJL, NS), pp. 627–635.
- HPDC-2010-SonmezYAIE #analysis #clustering #multi #scheduling #workflow
- Performance analysis of dynamic workflow scheduling in multicluster grids (OOS, NY, SA, AI, DHJE), pp. 49–60.
- HPDC-2010-TurcuFN
- Reshaping text data for efficient processing on Amazon EC2 (GT, ITF, SN), pp. 435–444.
- ISMM-2010-ZhaoBA #architecture #memory management
- Efficient memory shadowing for 64-bit architectures (QZ, DB, SPA), pp. 93–102.
- LCTES-2010-KulkarniJW #optimisation #sequence
- Improving both the performance benefits and speed of optimization phase sequence searches (PAK, MRJ, DBW), pp. 95–104.
- LCTES-2010-LiZ #embedded #mobile
- An efficient code update scheme for DSP applications in mobile embedded systems (WL, YZ), pp. 105–114.
- LCTES-2010-PerathonerRTLR #analysis #modelling
- Modeling structured event streams in system level performance analysis (SP, TR, LT, KL, JR), pp. 37–46.
- OSDI-2010-AviramWHF #parallel
- Efficient System-Enforced Deterministic Parallelism (AA, SCW, SH, BF), pp. 193–206.
- OSDI-2010-PowerL #distributed #named #source code
- Piccolo: Building Fast, Distributed Programs with Partitioned Tables (RP, JL), pp. 293–306.
- PDP-2010-AldinucciMT #manycore
- Efficient Smith-Waterman on Multi-core with FastFlow (MA, MM, MT), pp. 195–199.
- PDP-2010-BazN #adaptation #communication #distributed #protocol #self
- A Self-adaptive Communication Protocol with Application to High Performance Peer to Peer Distributed Computing (DEB, TTN), pp. 327–333.
- PDP-2010-CuencaGGQ #analysis #compilation #manycore
- Analysis of the Influence of the Compiler on Multicore Performance (JC, LPG, DG, MQ), pp. 170–174.
- PDP-2010-GuevaraCSMML #parallel
- A Performance Tuning Strategy for Complex Parallel Application (JAG, EC, JS, AM, TM, EL), pp. 103–110.
- PDP-2010-MadrugaFN #architecture #manycore #parallel #symmetry
- Parallel Shared-Memory Workloads Performance on Asymmetric Multi-core Architectures (FLM, HCdF, POAN), pp. 163–169.
- PDP-2010-MartinezCPRP #modelling #using
- Performance Modeling of MPI Applications Using Model Selection Techniques (DRM, JCC, TFP, FFR, VBP), pp. 95–102.
- PDP-2010-SchmidtFSF #in the cloud #virtual machine
- Efficient Distribution of Virtual Machines for Cloud Computing (MS, NF, MS, BF), pp. 567–574.
- PDP-2010-Strey #implementation #on the #reduction
- On the Efficient Implementation of Reductions on the Cell Broadband Engine (AS), pp. 223–228.
- PDP-2010-StriglKP #network #scalability
- Performance and Scalability of GPU-Based Convolutional Neural Networks (DS, KK, SP), pp. 317–324.
- PDP-2010-ZarzaLFL #fault #named #network
- FT-DRB: A Method for Tolerating Dynamic Faults in High-Speed Interconnection Networks (GZ, DL, DF, EL), pp. 77–84.
- PPoPP-2010-BaghsorkhiDPGH #adaptation #architecture #gpu #modelling
- An adaptive performance modeling tool for GPU architectures (SSB, MD, SJP, WDG, WmWH), pp. 105–114.
- PPoPP-2010-Chakrabarti #abstraction #analysis #effectiveness #source code
- New abstractions for effective performance analysis of STM programs (DRC), pp. 333–334.
- PPoPP-2010-HoffmannESMA #health
- Application heartbeats for software performance and health (HH, JE, MDS, JEM, AA), pp. 347–348.
- PPoPP-2010-MannarswamyCRS #compilation #memory management #transaction
- Compiler aided selective lock assignment for improving the performance of software transactional memory (SM, DRC, KR, SS), pp. 37–46.
- PPoPP-2010-PorterW #memory management #modelling #transaction
- Modeling transactional memory workload performance (DEP, EW), pp. 349–350.
- PPoPP-2010-RomeinBMN #analysis #implementation
- The LOFAR correlator: implementation and performance analysis (JWR, PCB, JDM, RvN), pp. 169–178.
- PPoPP-2010-UpadhyayaMP #data type #generative #using
- Using data structure knowledge for efficient lock generation and strong atomicity (GU, SPM, VSP), pp. 281–292.
- PPoPP-2010-ZhaiCZ #named #parallel #predict #scalability #using
- PHANTOM: predicting performance of parallel applications on large-scale parallel machines using a single node (JZ, WC, WZ), pp. 305–314.
- PPoPP-2010-ZhangCO #gpu
- Fast tridiagonal solvers on the GPU (YZ, JC, JDO), pp. 127–136.
- PPoPP-2010-ZhangJS #matter #parallel #question #source code #thread
- Does cache sharing on modern CMP matter to the performance of contemporary multithreaded programs? (EZZ, YJ, XS), pp. 203–212.
- FASE-2010-BerardinelliCM #analysis #mobile #modelling
- Performance Modeling and Analysis of Context-Aware Mobile Software Systems (LB, VC, ADM), pp. 353–367.
- FASE-2010-CortellessaMRT #effectiveness #identification #process
- A Process to Effectively Identify “Guilty” Performance Antipatterns (VC, AM, RHR, CT), pp. 368–382.
- FASE-2010-LehnerM #runtime
- Efficient Runtime Assertion Checking of Assignable Clauses with Datagroups (HL, PM), pp. 338–352.
- STOC-2010-HaitnerRV #generative #pseudo
- Efficiency improvements in constructing pseudorandom generators from one-way functions (IH, OR, SPV), pp. 437–446.
- STOC-2010-Madry #algorithm #approximate #graph #multi #problem
- Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms (AM), pp. 121–130.
- TACAS-2010-BallBCMQ #concurrent #testing
- Preemption Sealing for Efficient Concurrency Testing (TB, SB, KEC, MM, SQ), pp. 420–434.
- TACAS-2010-FogartyV #automaton
- Efficient Büchi Universality Checking (SF, MYV), pp. 205–220.
- TACAS-2010-ParizekK #component #detection #fault #java #random #using
- Efficient Detection of Errors in Java Components Using Random Environment and Restarts (PP, TK), pp. 451–465.
- CAV-2010-BozgaIK
- Fast Acceleration of Ultimately Periodic Relations (MB, RI, FK), pp. 227–242.
- CAV-2010-HerbreteauSW #automaton
- Efficient Emptiness Check for Timed Büchi Automata (FH, BS, IW), pp. 148–161.
- CAV-2010-LiXBL #analysis #automaton #hardware #reachability
- Efficient Reachability Analysis of Büchi Pushdown Systems for Hardware/Software Co-verification (JL, FX, TB, VL), pp. 339–353.
- CSL-2010-BaganDFG #query
- Efficient Enumeration for Conjunctive Queries over X-underbar Structures (GB, AD, EF, OG), pp. 80–94.
- ICLP-2010-FayruzovJVCC10 #set #source code
- Efficient Solving of Time-dependent Answer Set Programs (TF, JJ, DV, CC, MDC), pp. 64–73.
- ICLP-2010-Fierens10 #logic #modelling #probability
- Improving the Efficiency of Gibbs Sampling for Probabilistic Logical Models by Means of Program Specialization (DF), pp. 74–83.
- ICST-2010-GligoricJM #mutation testing #named #parallel #testing #thread
- MuTMuT: Efficient Exploration for Mutation Testing of Multithreaded Code (MG, VJ, DM), pp. 55–64.
- ICTSS-2010-AlmeidaMSTV #architecture #distributed #scalability
- Efficient Distributed Test Architectures for Large-Scale Systems (ECdA, JEM, GS, YLT, PV), pp. 174–187.
- ICTSS-2010-ShinboTAHS #network #testing
- Practical End-to-End Performance Testing Tool for High Speed 3G-Based Networks (HS, AT, SA, TH, KS), pp. 205–220.
- ISSTA-2010-GaleottiRPF #analysis #bound #invariant #verification
- Analysis of invariants for efficient bounded verification (JPG, NR, CLP, MFF), pp. 25–36.
- CBSE-2009-HauckKKR #component #execution #modelling #predict
- Modelling Layered Component Execution Environments for Performance Prediction (MH, MK, KK, RHR), pp. 191–208.
- QoSA-2009-AnselmiCA #constraints #on the
- On the Consolidation of Data-Centers with Performance Constraints (JA, PC, EA), pp. 163–176.
- QoSA-2009-GhezziT #predict
- Predicting Performance Properties for Open Systems with KAMI (CG, GT), pp. 70–85.
- QoSA-2009-KrogmannSBKMM #architecture #feedback #predict #using #visualisation
- Improved Feedback for Architectural Performance Prediction Using Software Cartography Visualizations (KK, CMS, SB, MK, AM, FM), pp. 52–69.
- WICSA-ECSA-2009-BrebnerOG #architecture #enterprise #evolution #modelling
- Performance modeling evolving Enterprise Service Oriented Architectures (PB, LO, JG), pp. 71–80.
- WICSA-ECSA-2009-KuhnMKSBT #aspect-oriented
- Introducing Aspect-oriented Space Containers for efficient publish/subscribe scenarios in Intelligent Transportation Systems (EK, RM, LK, CS, SB, ST), pp. 313–316.
- DocEng-2009-KuttyNL #approach #clustering #documentation #hybrid #named #xml
- HCX: an efficient hybrid clustering approach for XML documents (SK, RN, YL), pp. 94–97.
- DocEng-2009-NunesGKNCF #profiling
- Job profiling in high performance printing (TN, FG, MLK, RN, AC, LGF), pp. 109–118.
- DocEng-2009-RonnauPB #documentation #xml
- Efficient change control of XML documents (SR, GP, UMB), pp. 3–12.
- DRR-2009-Obafemi-AjayiAF #classification #documentation #image
- Efficient shape-LUT classification for document image restoration (TOA, GA, OF), pp. 1–10.
- ECDL-2009-Ferro
- Annotation Search: The FAST Way (NF), pp. 15–26.
- HT-2009-DenoueACG #named #web
- WebNC: efficient sharing of web applications (LD, JA, SC, GG), pp. 365–366.
- HT-2009-KleinHN #web
- Comparing the performance of us college football teams in the web and on the field (MK, OH, MLN), pp. 63–72.
- ICDAR-2009-AlmaksourA #incremental #learning #online #recognition
- Fast Incremental Learning Strategy Driven by Confusion Reject for Online Handwriting Recognition (AA, ÉA), pp. 81–85.
- ICDAR-2009-AntonacopoulosBPP #analysis #dataset #documentation #evaluation #layout
- A Realistic Dataset for Performance Evaluation of Document Layout Analysis (AA, DB, CP, SP), pp. 296–300.
- ICDAR-2009-LapointeB #case study #evaluation #recognition
- Issues in Performance Evaluation: A Case Study of Math Recognition (AL, DB), pp. 1355–1359.
- ICDAR-2009-SaabniE09a #database #generative #online #recognition
- Efficient Generation of Comprehensive Database for Online Arabic Script Recognition (RS, JES), pp. 1231–1235.
- ICDAR-2009-StamatopoulosGP #documentation #evaluation #image
- A Methodology for Document Image Dewarping Techniques Performance Evaluation (NS, BG, IP), pp. 956–960.
- ICDAR-2009-WangJW #identification
- High Performance Chinese/English Mixed OCR with Character Level Language Identification (KW, JJ, QW), pp. 406–410.
- JCDL-2009-LundR #multi #recognition
- Improving optical character recognition through efficient multiple system alignment (WBL, EKR), pp. 231–240.
- PODS-2009-Arge #tutorial #worst-case
- Worst-case efficient range search indexing: invited tutorial (LA), pp. 175–176.
- PODS-2009-KirschMPPUV #approach #identification #statistics
- An efficient rigorous approach for identifying statistically significant frequent itemsets (AK, MM, AP, GP, EU, FV), pp. 117–126.
- SIGMOD-2009-Chen #named
- FlashLogging: exploiting flash devices for synchronous logging performance (SC), pp. 73–86.
- SIGMOD-2009-ChenOG #using
- Fast and dynamic OLAP exploration using UDFs (ZC, CO, CGA), pp. 1087–1090.
- SIGMOD-2009-FingerP #algorithm #evaluation #rank #robust
- Robust and efficient algorithms for rank join evaluation (JF, NP), pp. 415–428.
- SIGMOD-2009-GhotingM #parallel
- Serial and parallel methods for i/o efficient suffix tree construction (AG, KM), pp. 827–840.
- SIGMOD-2009-KimC #documentation #named #query #retrieval
- Skip-and-prune: cosine-based top-k query processing for efficient context-sensitive document retrieval (JWK, KSC), pp. 115–126.
- SIGMOD-2009-LiJLF #approach #relational
- Efficient type-ahead search on relational data: a TASTIER approach (GL, SJ, CL, JF), pp. 695–706.
- SIGMOD-2009-TaoYSK #nearest neighbour #quality
- Quality and efficiency in high dimensional nearest neighbor search (YT, KY, CS, PK), pp. 563–576.
- SIGMOD-2009-WangXLZ #approximate #constraints #distance #edit distance
- Efficient approximate entity extraction with edit distance constraints (WW, CX, XL, CZ), pp. 759–770.
- VLDB-2009-Amer-YahiaRCDY #recommendation #semantics
- Group Recommendation: Semantics and Efficiency (SAY, SBR, AC, GD, CY), pp. 754–765.
- VLDB-2009-AssentWKKS #database #similarity
- Anticipatory DTW for Efficient Similarity Search in Time Series Databases (IA, MW, RK, HK, TS), pp. 826–837.
- VLDB-2009-BhattacharjeeLMMRLMTS
- Efficient Index Compression in DB2 LUW (BB, LL, TM, GAM, KAR, SL, CM, ZT, RS), pp. 1462–1473.
- VLDB-2009-CautisDOV #query #set #specification #using #xpath
- Efficient Rewriting of XPath Queries Using Query Set Specifications (BC, AD, NO, VV), pp. 301–312.
- VLDB-2009-CheemaLZWZ #lazy evaluation #monitoring
- Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN (MAC, XL, YZ, WW, WZ), pp. 1138–1149.
- VLDB-2009-ChenBN #evolution #maintenance #mining #named #web
- NEAR-Miner: Mining Evolution Associations of Web Site Directories for Efficient Maintenance of Web Archives (LC, SSB, WN), pp. 1150–1161.
- VLDB-2009-CongJW #retrieval #web
- Efficient Retrieval of the Top-k Most Relevant Spatial Web Objects (GC, CSJ, DW), pp. 337–348.
- VLDB-2009-CruzAS #named #ontology #scalability
- AgreementMaker: Efficient Matching for Large Real-World Schemas and Ontologies (IFC, FPA, CS), pp. 1586–1589.
- VLDB-2009-HadjieleftheriouL #approximate #string
- Efficient Approximate Search on String Collections (MH, CL), pp. 1660–1661.
- VLDB-2009-KimSCKNBLSD #implementation #manycore
- Sort vs. Hash Revisited: Fast Join Implementation on Modern Multi-Core CPUs (CK, ES, JC, TK, ADN, ADB, VWL, NS, PD), pp. 1378–1389.
- VLDB-2009-SternBB #quality
- A Wavelet Transform for Efficient Consolidation of Sensor Relations with Quality Guarantees (MS, EB, KB), pp. 157–168.
- VLDB-2009-TsirogiannisGK
- Improving the Performance of List Intersection (DT, SG, NK), pp. 838–849.
- VLDB-2009-UnterbrunnerGAFK #predict
- Predictable Performance for Unpredictable Workloads (PU, GG, GA, DF, DK), pp. 706–717.
- VLDB-2009-WillhalmPBPZS #in memory #named #using
- SIMD-Scan: Ultra Fast in-Memory Table Scan using on-Chip Vector Processing Units (TW, NP, YB, HP, AZ, JS), pp. 385–394.
- VLDB-2009-WongOYFL #nearest neighbour
- Efficient Method for Maximizing Bichromatic Reverse Nearest Neighbor (RCWW, MTÖ, PSY, AWCF, LL), pp. 1126–1137.
- VLDB-2009-XuK #parallel
- Efficient Outer Join Data Skew Handling in Parallel DBMS (YX, PK), pp. 1390–1396.
- CSEET-2009-MansharamaniBGGKNR #certification #enterprise #scalability
- DCPE Rollout: Scaling Performance Engineering Training and Certification across a Very Large Enterprise (RKM, AB, KG, KG, AK, MKN, MR), pp. 263–270.
- EDM-2009-AgapitoO #detection #using
- Detecting Symptoms of Low Performance Using Production Rules (JBA, AO), pp. 31–40.
- ITiCSE-2009-Al-BarakatiA #programming #student #visualisation
- The effect of visualizing roles of variables on student performance in an introductory programming course (NMAB, AYAA), pp. 228–232.
- ITiCSE-2009-Impagliazzo #metric #source code
- Graduate attributes and performance measures: refinements in assessing programs (JI), p. 370.
- ITiCSE-2009-RosslingK09a #analysis
- A system for integral efficiency analysis of sustainable technologies (GR, YK), p. 395.
- ICSM-2009-JeffreyGG #effectiveness #fault #locality #multi #using
- Effective and efficient localization of multiple faults using value replacement (DJ, NG, RG), pp. 221–230.
- ICSM-2009-JiangHHF #analysis #automation #testing
- Automated performance analysis of load tests (ZMJ, AEH, GH, PF), pp. 125–134.
- ICSM-2009-Yoo #impact analysis #metric #using
- Performance impact analysis with KPP using application response measurement in E-government systems (NY), pp. 503–506.
- CIAA-J-2008-ChamparnaudDJ09 #algorithm #geometry #regular expression
- An Efficient Algorithm to Test Whether a Binary and Prolongeable Regular Language is Geometrical (JMC, JPD, HJ), pp. 763–774.
- CIAA-J-2008-MatsumotoHT09 #automaton #implementation #pattern matching #runtime
- A Run-Time Efficient Implementation of Compressed Pattern Matching Automata (TM, KH, MT), pp. 717–733.
- CIAA-2009-Sastre-Martinez #network #parsing #recursion #using
- Efficient Parsing Using Filtered-Popping Recursive Transition Networks (JMSM), pp. 241–244.
- ICALP-v1-2009-AlonLS
- Fast FAST (NA, DL, SS), pp. 49–58.
- ICALP-v1-2009-ArbitmanNS #worst-case
- De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results (YA, MN, GS), pp. 107–118.
- ICALP-v1-2009-BilleT #regular expression
- Faster Regular Expression Matching (PB, MT), pp. 171–182.
- ICALP-v1-2009-BorosM #algorithm #parallel #problem
- A Fast and Simple Parallel Algorithm for the Monotone Duality Problem (EB, KM), pp. 183–194.
- ICALP-v1-2009-LamLTTW #energy
- Sleep with Guilt and Work Faster to Minimize Flow Plus Energy (TWL, LKL, HFT, IKKT, PWHW), pp. 665–676.
- ICALP-v1-2009-Nederlof #algorithm #problem #using
- Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems (JN), pp. 713–725.
- ICALP-v2-2009-FotakisKS #design #network
- Efficient Methods for Selfish Network Design (DF, ACK, PGS), pp. 459–471.
- ICALP-v2-2009-Mosk-AoyamaR #analysis #worst-case
- Worst-Case Efficiency Analysis of Queueing Disciplines (DMA, TR), pp. 546–557.
- LATA-2009-MatobaNT #bias #symmetry
- Efficiency of the Symmetry Bias in Grammar Acquisition (RM, MN, ST), pp. 566–577.
- Haskell-2009-BrownS #alloy #haskell #named
- Alloy: fast generic transformations for Haskell (NCCB, ATS), pp. 105–116.
- Haskell-2009-JonesMS #haskell #parallel
- Parallel performance tuning for Haskell (DJJ, SM, SS), pp. 81–92.
- ICFP-2009-GazagnaireH #database #functional #named #programming #transaction #using
- OXenstored: an efficient hierarchical and transactional database using functional programming with reference cell comparisons (TG, VH), pp. 203–214.
- AIIDE-2009-LaviersSAM #modelling
- Improving Offensive Performance Through Opponent Modeling (KRL, GS, DWA, MM).
- DiGRA-2009-CameronC #encoding #liveness #realtime
- Encoding liveness: Performance and real-time rendering in machinima (DC, JC).
- DiGRA-2009-DixonB #game studies #social #women
- Girls' Play: Context, performance & social videogame play [Abstract] (SD, KB).
- DiGRA-2009-Fernandez-Vara #framework #game studies
- Play's the Thing: A Framework to Study Videogames as Performance (CFV).
- DiGRA-2009-SeyaSKOYKHYIW #game studies #video #visual notation
- Effects of Peripheral Visual Information on Performance of Video Game with Hemi-Spherical Immersive Projection Screen (YS, KS, YK, AO, HY, KK, FH, YY, HI, KW).
- DiGRA-2009-Sjoblom #game studies
- Placing the blame: Negotiation of gaming performance [Abstract] (BS).
- FDG-2009-Horswill #behaviour
- Very fast action selection for parameterized behaviors (IH), pp. 91–98.
- VS-Games-2009-ChangZZ #game studies #modelling
- Fast Vehicle Crash Modelling for Games (JC, JJZ0, RZ), pp. 141–147.
- CHI-2009-BlanchO #concurrent
- Rake cursor: improving pointing performance with concurrent input channels (RB, MO), pp. 1415–1418.
- CHI-2009-FindlaterMMD #adaptation #using
- Ephemeral adaptation: the use of gradual onset to improve menu selection performance (LF, KM, JM, JQD), pp. 1655–1664.
- CHI-2009-HarrisonLSH #smarttech #visual notation
- Where to locate wearable displays?: reaction time performance of visual alerts from tip to toe (CH, BYL, AS, SEH), pp. 941–944.
- CHI-2009-KristenssonD #case study #recognition #state of the art #user study
- Text entry performance of state of the art unconstrained handwriting recognition: a longitudinal user study (POK, LCD), pp. 567–570.
- CHI-2009-LeeZ
- The performance of touch screen soft buttons (SL, SZ), pp. 309–318.
- CHI-2009-MajarantaAS #type system
- Fast gaze typing with an adjustable dwell time (PM, UKA, OS), pp. 357–360.
- CHI-2009-MoravejiICB
- A mischief of mice: examining children’s performance in single display groupware systems with 1 to 32 mice (NM, KI, EC, RB), pp. 2157–2166.
- CHI-2009-SalvucciTB #concurrent #formal method #multi #towards
- Toward a unified theory of the multitasking continuum: from concurrent performance to task switching, interruption, and resumption (DDS, NT, JPB), pp. 1819–1828.
- CHI-2009-SauvanLLC #human-computer #interface
- A performance model of selection techniques for p300-based brain-computer interfaces (JBS, AL, FL, GC), pp. 2205–2208.
- DHM-2009-ChouvardaM #simulation
- Hyperkalemia vs. Ischemia Effects in Fast or Unstable Pacing: A Cardiac Simulation Study (IC, NM), pp. 492–501.
- DHM-2009-DzaackU #analysis #modelling #multi #safety
- Multilevel Analysis of Human Performance Models in Safety-Critical Systems (JD, LU), pp. 375–383.
- DHM-2009-TianDBAH #implementation
- The Performance of BCMA-Aided Healthcare Service: Implementation Factors and Results (RT, VGD, CB, SRA, KH), pp. 560–568.
- HCD-2009-LewisB
- Animated Demonstrations: Evidence of Improved Performance Efficiency and the Worked Example Effect (DL, AB), pp. 247–255.
- HCI-AUII-2009-DuvalHC #interactive #smarttech
- Considering Personal Profiles for Comfortable and Efficient Interactions with Smart Clothes (SD, CH, GC), pp. 731–740.
- HCI-AUII-2009-YangC #novel
- Novel Stretchable Textile-Based Transmission Bands: Electrical Performance and Appearance after Abrasion/Laundering, and Wearability (YY, GC), pp. 806–813.
- HCI-NIMT-2009-OztemelKUCKRS #assessment
- Performance Assessment of Swarm Robots (EÖ, CK, ÖU, TC, TK, VR, AS), pp. 361–367.
- HCI-NIMT-2009-TanJKG
- Effect of Mental Training on BCI Performance (LFT, AJ, SLK, SYG), pp. 632–635.
- HCI-NIMT-2009-VerdurandCPG #evaluation #interactive #modelling #multimodal
- Modeling Multimodal Interaction for Performance Evaluation (EV, GC, FP, OG), pp. 103–112.
- HCI-NT-2009-AkasakaO
- Providing an Efficient Way to Make Desktop Icons Visible (TA, YO), pp. 569–578.
- HCI-NT-2009-BeeldersBMD #interface #prototype #using #word
- Measuring User Performance for Different Interfaces Using a Word Processor Prototype (TRB, PJB, TM, ED), pp. 395–404.
- HCI-NT-2009-MaeshiroMSN #similarity
- Hypernetwork Model to Represent Similarity Details Applied to Musical Instrument Performance (TM, MM, KS, SiN), pp. 866–873.
- HCI-NT-2009-SuzukiMSANYF #estimation #on the #using
- On the Possibility about Performance Estimation Just before Beginning a Voluntary Motion Using Movement Related Cortical Potential (SS, TM, YS, KA, NN, TY, SF), pp. 184–191.
- HCI-VAD-2009-LiangLHWPL #maintenance
- Web-Based Training System for Improving Aviation Maintenance Performance (GFL, JTL, SLH, EMYW, PP, JFL), pp. 731–740.
- HCI-VAD-2009-Peters #experience
- Influence of Real-World Ten-Pin Bowling Experience on Performance during First-Time Nintendo Wii Bowling Practice (KAP), pp. 396–405.
- HIMI-DIE-2009-GarciaV
- Effects of Practice with Foot- and Hand-Operated Secondary Input Devices on Performance of a Word-Processing Task (FPG, KPLV), pp. 505–514.
- HIMI-DIE-2009-KimP #metric #mobile #user interface
- A Business Performance Measurement Model for Mobile User Interface (MJK, JP), pp. 87–93.
- HIMI-DIE-2009-LimAC #case study #grid
- A Study on Computing Resource Partition for Increasing Efficiency of Grid System (CL, SJA, JC), pp. 563–569.
- HIMI-DIE-2009-SrinivasSPK #classification #feature model #using
- Efficient Text Classification Using Best Feature Selection and Combination of Methods (MS, KPS, EVP, SAK), pp. 437–446.
- HIMI-II-2009-FujiokaAO #evaluation #user interface
- Evaluation of Pointing Efficiency on Small Screen Touch User Interfaces (RF, TA, HO), pp. 375–384.
- HIMI-II-2009-KimMPH #using #visualisation
- Efficient Annotation Visualization Using Distinctive Features (SKK, SHM, JP, SYH), pp. 295–303.
- HIMI-II-2009-KukulaP #interactive
- Human-Biometric Sensor Interaction: Impact of Training on Biometric System and User Performance (EPK, RWP), pp. 168–177.
- HIMI-II-2009-LevaKCLKSM #safety
- Unique Reporting Form: Flight Crew Auditing of Everyday Performance in an Airline Safety Management System (MCL, AMK, JC, GL, SK, DS, NM), pp. 806–815.
- HIMI-II-2009-MarcoMFG #effectiveness #image
- Evaluating the Effectiveness and the Efficiency of a Vector Image Search Tool (PDM, TDM, DF, MG), pp. 259–268.
- HIMI-II-2009-ParkLKC #network
- Freeze TCPv2: An Enhancement of Freeze TCP for Efficient Handoff in Heterogeneous Networks (MP, JL, JK, HC), pp. 448–457.
- HIMI-II-2009-VuMNKRBS #student
- Situation Awareness and Performance of Student versus Experienced Air Traffic Controllers (KPLV, KM, JHN, JMK, HR, VB, TZS), pp. 865–874.
- CAiSE-2009-HaoCZ #web #web service
- Efficient IR-Style Search over Web Services (YH, JC, YZ), pp. 305–318.
- EDOC-2009-WetzsteinLRBDL #monitoring #process
- Monitoring and Analyzing Influential Factors of Business Process Performance (BW, PL, FR, IB, SD, FL), pp. 141–150.
- ICEIS-DISI-2009-GorawskiD #algorithm #distributed #execution #query
- Algorithms for Efficient Top-K Spatial Preference Query Execution in a Heterogeneous Distributed Environment (MG, KD), pp. 43–48.
- ICEIS-DISI-2009-MoserMBM #approach #integration #modelling #requirements #semantics #using
- Efficient System Integration using Semantic Requirements and Capability Models — An Approach for Integrating Heterogeneous Business Services (TM, RM, SB, AM), pp. 56–63.
- ICEIS-DISI-2009-SantosB #optimisation #query
- A Bit-selector Technique for Performance Optimization of Decision-support Queries (RJS, JB), pp. 151–157.
- ICEIS-DISI-2009-VroomKJ #community #design #distributed #industrial #wiki
- Efficient Community Management in an Industrial Design Engineering Wiki — Distributed Leadership (RWV, AK, RJ), pp. 190–195.
- ICEIS-ISAS-2009-HidalgoGT #consistency #data type #detection #nondeterminism
- Efficient Data Structures for Local Inconsistency Detection in Firewall ACL Updates (SPH, RMG, FTdlR), pp. 176–181.
- ICEIS-J-2009-ChangS #analysis #classification
- Fast Unsupervised Classification for Handwritten Stroke Analysis (WDC, JS), pp. 918–927.
- ICEIS-J-2009-GadK #clustering #semantics #similarity #using
- Enhancing Text Clustering Performance Using Semantic Similarity (WKG, MSK), pp. 325–335.
- ICEIS-SAIC-2009-Bogelsack #enterprise
- Performance Overhead of ERP Systems in Paravirtualized Environments (AB), pp. 200–207.
- CIKM-2009-Azzopardi #effectiveness #information retrieval #metric #monitoring
- Usage based effectiveness measures: monitoring application performance in information retrieval (LA), pp. 631–640.
- CIKM-2009-ChenCSLZ #information retrieval #mobile #network #peer-to-peer
- Efficient information retrieval in mobile peer-to-peer networks (LC, BC, HTS, WL, XZ), pp. 967–976.
- CIKM-2009-ChengKN #graph #query #scalability
- Efficient processing of group-oriented connection queries in a large graph (JC, YK, WN), pp. 1481–1484.
- CIKM-2009-DoulkeridisVNKV #distributed #multi #query
- Multidimensional routing indices for efficient distributed query processing (CD, AV, KN, YK, MV), pp. 1489–1492.
- CIKM-2009-FletcherB #graph #rdf #scalability
- Scalable indexing of RDF graphs for efficient join processing (GHLF, PWB), pp. 1513–1516.
- CIKM-2009-GaoW #generative
- Efficient itemset generator discovery over a stream sliding window (CG, JW), pp. 355–364.
- CIKM-2009-HalimKY #effectiveness
- Fast and effective histogram construction (FH, PK, RHCY), pp. 1167–1176.
- CIKM-2009-LaberSJACRTV
- A fast and simple method for extracting relevant content from news webpages (ESL, CPdS, IVJ, ECFdA, ETC, RPR, LCT, CDV), pp. 1685–1688.
- CIKM-2009-LeeVRKMI #adaptation #topic #using
- Measuring system performance and topic discernment using generalized adaptive-weight mean (CTL, VV, EMR, GK, NMF, AI), pp. 2033–2036.
- CIKM-2009-LianC #data type #nondeterminism
- Efficient join processing on uncertain data streams (XL, LC), pp. 857–866.
- CIKM-2009-LiuMY #fuzzy #pattern matching #xml
- Efficient processing of twig pattern matching in fuzzy XML (JL, ZMM, LY), pp. 117–126.
- CIKM-2009-LuHM #algorithm #approximate #using
- Efficient algorithms for approximate member extraction using signature-based inverted lists (JL, JH, XM), pp. 315–324.
- CIKM-2009-MadduriW
- Efficient joins with compressed bitmap indexes (KM, KW), pp. 1017–1026.
- CIKM-2009-PotamiasBCG #distance #estimation #network #scalability
- Fast shortest path distance estimation in large networks (MP, FB, CC, AG), pp. 867–876.
- CIKM-2009-QianNZ #multi
- Efficient multi-class unlabeled constrained semi-supervised SVM (MQ, FN, CZ), pp. 1665–1668.
- CIKM-2009-RonnauPB #documentation #reliability #xml
- Efficient and reliable merging of XML documents (SR, GP, UMB), pp. 2105–2106.
- CIKM-2009-SunLL #case study #category theory #classification #predict #what
- What makes categories difficult to classify?: a study on predicting classification performance for categories (AS, EPL, YL), pp. 1891–1894.
- CIKM-2009-TongQJF #graph #interactive #named #proximity #query
- iPoG: fast interactive proximity querying on graphs (HT, HQ, HJ, CF), pp. 1673–1676.
- CIKM-2009-WangCH #algorithm #clustering #scalability #topic #web
- An efficient clustering algorithm for large-scale topical web pages (LW, PC, LH), pp. 1851–1854.
- CIKM-2009-YuOH #ranking
- Efficient feature weighting methods for ranking (HY, JO, WSH), pp. 1157–1166.
- CIKM-2009-ZhaoC #effectiveness #retrieval
- Effective and efficient structured retrieval (LZ, JC), pp. 1573–1576.
- CIKM-2009-ZhengSWG #induction
- Efficient record-level wrapper induction (SZ, RS, JRW, CLG), pp. 47–56.
- ECIR-2009-ChowdaryK #multi #named #summary
- ESUM: An Efficient System for Query-Specific Multi-document Summarization (CRC, PSK), pp. 724–728.
- ECIR-2009-HauffAH #evaluation #predict #query
- The Combination and Evaluation of Query Performance Prediction Methods (CH, LA, DH), pp. 301–312.
- ECIR-2009-TsegayPTZ #documentation #generative #query
- Document Compaction for Efficient Query Biased Snippet Generation (YT, SJP, AT, JZ), pp. 509–520.
- ICML-2009-Cortes #kernel #learning #question
- Invited talk: Can learning kernels help performance? (CC), p. 1.
- ICML-2009-GiesekePK #clustering
- Fast evolutionary maximum margin clustering (FG, TP, OK), pp. 361–368.
- ICML-2009-HazanS #algorithm #learning
- Efficient learning algorithms for changing environments (EH, CS), pp. 393–400.
- ICML-2009-LiuY #linear
- Efficient Euclidean projections in linear time (JL, JY), pp. 657–664.
- ICML-2009-MesmayRVP #graph #library #optimisation
- Bandit-based optimization on graphs with application to library performance tuning (FdM, AR, YV, MP), pp. 729–736.
- ICML-2009-QiTZCZ #learning #metric
- An efficient sparse metric learning in high-dimensional space via l1-penalized log-determinant regularization (GJQ, JT, ZJZ, TSC, HJZ), pp. 841–848.
- ICML-2009-QuattoniCCD #infinity
- An efficient projection for l1,infinity regularization (AQ, XC, MC, TD), pp. 857–864.
- ICML-2009-SuttonMPBSSW #approximate #learning #linear
- Fast gradient-descent methods for temporal-difference learning with linear function approximation (RSS, HRM, DP, SB, DS, CS, EW), pp. 993–1000.
- ICML-2009-TielemanH #persistent #using
- Using fast weights to improve persistent contrastive divergence (TT, GEH), pp. 1033–1040.
- ICML-2009-VarmaB #kernel #learning #multi
- More generality in efficient multiple kernel learning (MV, BRB), pp. 1065–1072.
- KDD-2009-BuCFL #monitoring
- Efficient anomaly monitoring over moving object trajectory streams (YB, LC, AWCF, DL), pp. 159–168.
- KDD-2009-ChenWY #network #social
- Efficient influence maximization in social networks (WC, YW, SY), pp. 199–208.
- KDD-2009-PoernomoG09a #fault tolerance #mining #towards
- Towards efficient mining of proportional fault-tolerant frequent itemsets (AKP, VG), pp. 697–706.
- KDD-2009-WuSJRG #detection #framework
- A LRT framework for fast spatial anomaly detection (MW, XS, CJ, SR, JG), pp. 887–896.
- KDD-2009-YanHJ #approximate #clustering
- Fast approximate spectral clustering (DY, LH, MIJ), pp. 907–916.
- KDD-2009-YaoMM #documentation #model inference #streaming #topic
- Efficient methods for topic model inference on streaming document collections (LY, DMM, AM), pp. 937–946.
- KDIR-2009-BalujaRS #classification #graph
- Text Classification through Time — Efficient Label Propagation in Time-Based Graphs (SB, DR, DS), pp. 174–182.
- KEOD-2009-DumitrescuK #reuse #self #towards #using
- Towards Social-software for the Efficient Reuse of Solution Patterns for Self-optimizing Systems (RD, BK), pp. 342–347.
- KMIS-2009-JangP #benchmark #metric
- Benchmarking based Performance Management for Construction Contractors (YJ, MP), pp. 147–152.
- MLDM-2009-MoedS #classification
- Efficient AdaBoost Region Classification (MM, ENS), pp. 123–136.
- MLDM-2009-SakaiI #clustering #random
- Fast Spectral Clustering with Random Projection and Sampling (TS, AI), pp. 372–384.
- MLDM-2009-SarmentoKOU #clustering #set
- Efficient Clustering of Web-Derived Data Sets (LS, AK, ECO, LHU), pp. 398–412.
- MLDM-2009-SegataB #dataset #scalability
- Fast Local Support Vector Machines for Large Datasets (NS, EB), pp. 295–310.
- RecSys-2009-SchclarTRMA #collaboration
- Ensemble methods for improving the performance of neighborhood-based collaborative filtering (AS, AT, LR, AM, LA), pp. 261–264.
- SEKE-2009-LudwigTA #analysis #concept #database #deduction #reasoning #semantics #web
- Performance Analysis of a Deductive Database with a Semantic Web Reasoning Engine: ConceptBase and Racer (SAL, CT, KA), pp. 688–693.
- SIGIR-2009-AslamKPSY #documentation #effectiveness #ranking
- Document selection methodologies for efficient and effective learning-to-rank (JAA, EK, VP, SS, EY), pp. 468–475.
- SIGIR-2009-AzzopardiVM #energy
- Developing energy efficient filtering systems (LA, WV, MM), pp. 664–665.
- SIGIR-2009-Baeza-YatesMH #trade-off #web
- Efficiency trade-offs in two-tier web search systems (RABY, VM, CH), pp. 163–170.
- SIGIR-2009-CambazogluPB #distributed #quality #web
- Quantifying performance and quality gains in distributed web search engines (BBC, VP, RABY), pp. 411–418.
- SIGIR-2009-Collins-ThompsonB #predict #query #using
- Estimating query performance using class predictions (KCT, PNB), pp. 672–673.
- SIGIR-2009-HauffA #effectiveness #predict #query #question
- When is query performance prediction effective? (CH, LA), pp. 829–830.
- SIGIR-2009-Hosseini #case study #information retrieval
- A study on performance volatility in information retrieval (MH), p. 853.
- SIGIR-2009-MamouMSS #image #retrieval
- A unified inverted index for an efficient image and text retrieval (JM, YM, MSS, BS), pp. 814–815.
- SIGIR-2009-TatikondaJCP #manycore #on the
- On efficient posting list intersection with multicore processors (ST, FJ, BBC, VP), pp. 738–739.
- SIGIR-2009-WangLFXY #query
- Efficient query expansion for advertisement search (HW, YL, LF, GRX, YY), pp. 51–58.
- SIGIR-2009-YuZLG #collaboration #matrix #parametricity #scalability
- Fast nonparametric matrix factorization for large-scale collaborative filtering (KY, SZ, JDL, YG), pp. 211–218.
- ICMT-2009-BergmannHRV #model transformation #pattern matching
- Efficient Model Transformations by Combining Pattern Matching Strategies (GB, ÁH, IR, DV), pp. 20–34.
- MoDELS-2009-BoskovicH #assessment #metric #modelling
- Model Driven Performance Measurement and Assessment with MoDePeMART (MB, WH), pp. 62–76.
- MoDELS-2009-BoskovicH #assessment #metric #modelling
- Model Driven Performance Measurement and Assessment with MoDePeMART (MB, WH), pp. 62–76.
- OOPSLA-2009-InoueN #hardware #how #java #monitoring #virtual machine
- How a Java VM can get more from a hardware performance monitor (HI, TN), pp. 137–154.
- OOPSLA-2009-PluquetLW #graph #in memory #version control
- Executing code in the past: efficient in-memory object graph versioning (FP, SL, RW), pp. 391–408.
- OOPSLA-2009-TsafrirWBS #dependence #source code
- Minimizing dependencies within generic classes for faster and smaller programs (DT, RWW, DFB, BS), pp. 425–444.
- TOOLS-EUROPE-2009-KnorreckAP #design #simulation
- Fast Simulation Techniques for Design Space Exploration (DK, LA, RP), pp. 308–327.
- PADL-2009-TranNPS #consistency #declarative #specification #static analysis
- Improving Performance of Conformant Planners: Static Analysis of Declarative Planning Domain Specifications (DVT, HKN, EP, TCS), pp. 239–253.
- PLDI-2009-FlanaganF #concurrent #detection #named #precise
- FastTrack: efficient and precise dynamic race detection (CF, SNF), pp. 121–133.
- PLDI-2009-TallentMF #analysis #metric
- Binary analysis for measurement and attribution of program performance (NRT, JMMC, MWF), pp. 441–452.
- POPL-2009-GulwaniMC #complexity #estimation #named #precise
- SPEED: precise and efficient static estimation of program computational complexity (SG, KKM, TMC), pp. 127–139.
- ASE-2009-AcharyaK #health #mining #modelling #monitoring
- Mining Health Models for Performance Monitoring of Services (MA, VK), pp. 409–420.
- ASE-2009-ChenMJR #independence #monitoring #parametricity
- Efficient Formalism-Independent Monitoring of Parametric Properties (FC, POM, DJ, GR), pp. 383–394.
- ASE-2009-SiddiquiMK #constraints #optimisation #theorem proving
- Optimizing a Structural Constraint Solver for Efficient Software Checking (JHS, DM, SK), pp. 615–619.
- ASE-2009-WongC #analysis #dependence #logic #modelling
- Improving the Efficiency of Dependency Analysis in Logical Decision Models (SW, YC), pp. 173–184.
- ESEC-FSE-2009-ArbabMMKQ #analysis #coordination #modelling #named
- Reo2MC: a tool chain for performance analysis of coordination models (FA, SM, YJM, MZK, HQ), pp. 287–288.
- ESEC-FSE-2009-BozzanoCRKNN #evaluation #modelling #verification
- Verification and performance evaluation of aadl models (MB, AC, MR, JPK, VYN, TN), pp. 285–286.
- ESEC-FSE-2009-SchulerZ #java #mutation testing #named #testing
- Javalanche: efficient mutation testing for Java (DS, AZ), pp. 297–298.
GTTSE-2009-FritzscheG #model management #model transformation- Model Transformation Chains and Model Management for End-to-End Performance Decision Support (MF, WG), pp. 345–363.
- ICSE-2009-ChilimbiLMNV #debugging #effectiveness #named #profiling #statistics
- HOLMES: Effective statistical debugging via efficient path profiling (TMC, BL, KKM, AVN, KV), pp. 34–44.
- SAC-2009-CamargoFK #distributed #maintenance
- Efficient maintenance of distributed data in highly dynamic opportunistic grids (RYdC, FCF, FK), pp. 1067–1071.
- SAC-2009-CelikikB #scalability
- Fast error-tolerant search on very large texts (MC, HB), pp. 1724–1731.
- SAC-2009-ChenJZY #adaptation
- Boosting the performance of computing systems through adaptive configuration tuning (HC, GJ, HZ, KY), pp. 1045–1049.
- SAC-2009-ChoB #query #xml
- Building an efficient preference XML query processor (SC, WTB), pp. 1585–1586.
- SAC-2009-DohLMKCLN #embedded #file system #metadata
- Impact of NVRAM write cache for file system metadata on I/O performance in embedded systems (IHD, HJL, YJM, EK, JC, DL, SHN), pp. 1658–1663.
- SAC-2009-EirakuSPKK #network #virtual machine
- Fast networking with socket-outsourcing in hosted virtual machine environments (HE, YS, CP, YK, KK), pp. 310–317.
- SAC-2009-GaoS #graph
- Characterizing 1-dof Henneberg-I graphs with efficient configuration spaces (HG, MS), pp. 1122–1126.
- SAC-2009-GohKCC #analysis #scalability #video
- Fast mode decision for scalable video coding based on neighboring macroblock analysis (GG, JK, MC, KC), pp. 1845–1846.
- SAC-2009-GroppeGEL #in memory #memory management #strict
- Efficient processing of SPARQL joins in memory by dynamically restricting triple patterns (JG, SG, SE, VL), pp. 1231–1238.
- SAC-2009-HendersonCL
- Exploiting join cardinality for faster hash joins (MH, BC, RL), pp. 1549–1554.
- SAC-2009-JeonPC #energy #grid
- Sink-oriented dynamic location service for shortest path relay with energy efficient global grid (HJ, KP, HC), pp. 2174–2179.
- SAC-2009-KiyoharaMMNK #embedded
- Method for fast compression of program codes for remote updates in embedded systems (RK, SM, MM, MN, SK), pp. 1683–1684.
- SAC-2009-KrajcaV #formal method #implementation #parallel
- Data parallel dialect of scheme: outline of the formal model, implementation, performance (PK, VV), pp. 1938–1939.
- SAC-2009-LandZEL #enterprise #integration #ontology #towards
- Towards a fast enterprise ontology based method for post merger integration (MOL, HZ, PE, QL), pp. 245–252.
- SAC-2009-LeS #concept #detection #visual notation
- Efficient concept detection by fusing simple visual features (DDL, SS), pp. 1839–1840.
- SAC-2009-LiuZ #distance #stack #worst-case
- Exploiting stack distance to estimate worst-case data cache performance (YL, WZ), pp. 1979–1983.
- SAC-2009-MahboubiD #query #xml
- Enhancing XML data warehouse query performance by fragmentation (HM, JD), pp. 1555–1562.
- SAC-2009-NamakiBM
- Exhaustion dominated performance: a first attempt (NN, AdB, SMC), pp. 1011–1012.
- SAC-2009-SharyginaTT #abstraction #precise #verification
- The synergy of precise and fast abstractions for program verification (NS, ST, AT), pp. 566–573.
- SAC-2009-StellerK #mobile #pervasive #reasoning
- Efficient mobile reasoning for pervasive discovery (LS, SK), pp. 1247–1251.
- SAC-2009-WangDLL #process
- An efficient and accurate lattice for pricing derivatives under a jump-diffusion process (CJW, TSD, YDL, YCL), pp. 966–970.
- LDTA-2008-Dolstra09 #domain-specific language #functional #lazy evaluation
- Maximal Laziness: An Efficient Interpretation Technique for Purely Functional DSLs (ED), pp. 81–99.
- GPCE-2009-NedunuriC #problem #source code #synthesis
- Synthesis of fast programs for maximum segment sum problems (SN, WRC), pp. 117–126.
- ASPLOS-2009-CaulfieldGS #clustering #data-driven #memory management #named #power management #using
- Gordon: using flash memory to build fast, power-efficient clusters for data-intensive applications (AMC, LMG, SS), pp. 217–228.
- ASPLOS-2009-MenonSZ #automation #named #network
- TwinDrivers: semi-automatic derivation of fast and safe hypervisor network drivers from guest OS drivers (AM, SS, WZ), pp. 301–312.
- ASPLOS-2009-OlszewskiAA #multi #named #thread
- Kendo: efficient deterministic multithreading in software (MO, JA, SPA), pp. 97–108.
- ASPLOS-2009-TucekXZ #execution #online #validation
- Efficient online validation with delta execution (JT, WX, YZ), pp. 193–204.
- CASE-2009-AnandMT #automation #evaluation #network
- Performance evaluation of wireless networks for factory automation applications (DMA, JRM, DMT), pp. 340–346.
- CASE-2009-MattosC #precise #visual notation
- A fast and precise micropipette positioning system based on continuous camera-robot recalibration and visual servoing (LSM, DGC), pp. 609–614.
- CASE-2009-MysoreNUMR #algorithm
- An efficient algorithm for RFID reader positioning for coverage of irregularly-shaped areas (NM, PN, RSU, RM, SR), pp. 233–240.
- CASE-2009-VazquezS #markov #modelling #petri net
- Performance control of Markovian Petri nets via fluid models: A stock-level control example (CRV, MS), pp. 30–36.
- CASE-2009-WangLCM #optimisation #social
- Efficient optimization of building emergency evacuation considering social bond of evacuees (PW, PBL, SCC, KLM), pp. 250–255.
- CC-2009-EconomopoulosKV #glr #parsing
- Faster Scannerless GLR Parsing (GRE, PK, JJV), pp. 126–141.
- CGO-2009-BoissinotDRDG #correctness #quality
- Revisiting Out-of-SSA Translation for Correctness, Code Quality and Efficiency (BB, AD, FR, BDdD, CG), pp. 114–125.
- CGO-2009-CordesFM #abstract interpretation #analysis #modelling #precise #slicing
- A Fast and Precise Static Loop Analysis Based on Abstract Interpretation, Program Slicing and Polytope Models (PL, DC, HF, PM), pp. 136–146.
- CGO-2009-CuthbertsonVBAS #approach #hardware #monitoring #optimisation #virtual machine
- A Practical Approach to Hardware Performance Monitoring Based Dynamic Optimizations in a Production JVM (JC, SV, KB, AA, EK, US), pp. 190–199.
- CGO-2009-KelseyBDZ #optimisation
- Fast Track: A Software System for Speculative Program Optimization (KK, TB, CD, CZ), pp. 157–168.
- CGO-2009-LiuR #c++ #named #source code
- Perflint: A Context Sensitive Performance Advisor for C++ Programs (LL, SR), pp. 265–274.
- CGO-2009-MoseleyGP #compilation #named #optimisation
- OptiScope: Performance Accountability for Optimizing Compilers (TM, DG, RP), pp. 254–264.
- DAC-2009-ArfaeeILFK #linear #multi #named
- Xquasher: a tool for efficient computation of multiple linear expressions (AA, AI, NL, FF, RK), pp. 254–257.
- DAC-2009-Bailey #parallel
- Misleading performance claims in parallel computations (DHB), pp. 528–533.
- DAC-2009-BonnyH #named
- LICT: left-uncompressed instructions compression technique to improve the decoding performance of VLIW processors (TB, JH), pp. 903–906.
- DAC-2009-ChangK #reliability
- A commitment-based management strategy for the performance and reliability enhancement of flash-memory storage systems (YHC, TWK), pp. 858–863.
- DAC-2009-ChenJ #manycore #scheduling
- Efficient program scheduling for heterogeneous multi-core processors (JC, LKJ), pp. 927–930.
- DAC-2009-DengCS #authentication #hardware #simulation
- Hardware authentication leveraging performance limits in detailed simulations and emulations (DYD, AHC, GES), pp. 682–687.
- DAC-2009-DongL #integration #simulation
- Parallelizable stable explicit numerical integration for efficient circuit simulation (WD, PL), pp. 382–385.
- DAC-2009-El-MoselhyED #algorithm
- An efficient resistance sensitivity extraction algorithm for conductors of arbitrary shapes (TAEM, IME, BD), pp. 770–775.
- DAC-2009-FengZYTZ #algorithm
- Provably good and practically efficient algorithms for CMP dummy fill (CF, HZ, CY, JT, XZ), pp. 539–544.
- DAC-2009-GhaniN #approximate #grid #power management #using #verification
- Fast vectorless power grid verification using an approximate inverse technique (NHAG, FNN), pp. 184–189.
- DAC-2009-JainC #graph #satisfiability #using
- Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts (HJ, EMC), pp. 563–568.
- DAC-2009-JungKS #architecture
- Hierarchical architecture of flash-based storage systems for high performance and durability (SJ, JHK, YHS), pp. 907–910.
- DAC-2009-KimM #array #configuration management #embedded
- Hierarchical reconfigurable computing arrays for efficient CGRA-based embedded systems (YK, RNM), pp. 826–831.
- DAC-2009-LaiYKH #realtime
- A trace-capable instruction cache for cost efficient real-time program trace compression in SoC (CHL, FCY, CFK, IJH), pp. 136–141.
- DAC-2009-Li #equation #modelling #scalability
- Finding deterministic solution from underdetermined equation: large-scale performance modeling by least angle regression (XL0), pp. 364–369.
- DAC-2009-LiuH #optimisation #parallel
- GPU-based parallelization for fast circuit optimization (YL, JH), pp. 943–946.
- DAC-2009-MehrotraS #robust #using
- A robust and efficient harmonic balance (HB) using direct solution of HB Jacobian (AM, AS), pp. 370–375.
- DAC-2009-ShiCHMTHW #analysis #gpu #grid #network #power management
- GPU friendly fast Poisson solver for structured power grid network analysis (JS, YC, WH, LM, SXDT, PHH, XW), pp. 178–183.
- DAC-2009-SiegelMP #debugging
- Untwist your brain: efficient debugging and diagnosis of complex assertions (MS, AM, CP), pp. 644–647.
- DAC-2009-VeetilSBSR #analysis #dependence
- Efficient smart sampling based full-chip leakage analysis for intra-die variation considering state dependence (VV, DS, DB, SS, SR), pp. 154–159.
- DAC-2009-WalravensVD #analysis #modelling #named
- ActivaSC: a highly efficient and non-intrusive extension for activity-based analysis of SystemC models (CW, YV, WD), pp. 172–177.
- DAC-2009-WangH #approach #embedded #simulation
- An efficient approach for system-level timing simulation of compiler-optimized embedded software (ZW, AH), pp. 220–225.
- DAC-2009-Wong #canonical
- An efficient passivity test for descriptor systems via canonical projector techniques (NW), pp. 957–962.
- DAC-2009-YooYC #design #memory management #multi
- Multiprocessor System-on-Chip designs with active memory processors for higher memory efficiency (JhY, SY, KC), pp. 806–811.
- DAC-2009-ZhangCTL #worst-case
- Efficient design-specific worst-case corner extraction for integrated circuits (HZ, THC, MYT, XL), pp. 386–389.
- DATE-2009-AhmedERCST #pipes and filters #programmable #reduction
- Exploration of power reduction and performance enhancement in LEON3 processor with ESL reprogrammable eFPGA in processor pipeline and as a co-processor (SZA, JE, LR, JBC, GS, LT), pp. 184–189.
- DATE-2009-AliKWW #modelling #optimisation
- Improved performance and variation modelling for hierarchical-based optimisation of analogue integrated circuits (SA, LK, RW, PRW), pp. 712–717.
- DATE-2009-BildBD #using
- Minimization of NBTI performance degradation using internal node control (DRB, GEB, RPD), pp. 148–153.
- DATE-2009-ChambersMV #generative #satisfiability
- Faster SAT solving with better CNF generation (BC, PM, DV), pp. 1590–1595.
- DATE-2009-CongG #energy #multi #scheduling
- Energy efficient multiprocessor task scheduling under input-dependent variation (JC, KG), pp. 411–416.
- DATE-2009-FacchiniCVPCDBM #3d #evaluation #mobile
- System-level power/performance evaluation of 3D stacked DRAMs for mobile applications (MF, TC, AV, MP, FC, WD, LB, PM), pp. 923–928.
- DATE-2009-GregertsenS #ada #multi #runtime
- An efficient and deterministic multi-tasking run-time environment for Ada and the Ravenscar profile on the Atmel AVR®32 UC3 microcontroller (KNG, AS), pp. 1572–1575.
- DATE-2009-HanumaiahVC #constraints #manycore
- Performance optimal speed control of multi-core processors under thermal constraints (VH, SBKV, KSC), pp. 1548–1551.
- DATE-2009-HatamiFAP #library
- Efficient compression and handling of current source model library waveforms (SH, PF, SA, MP), pp. 1178–1183.
- DATE-2009-HeH #algorithm #encoding #verification
- An efficient path-oriented bitvector encoding width computation algorithm for bit-precise verification (NH, MSH), pp. 1602–1607.
- DATE-2009-IqbalH
- Efficient constant-time entropy decoding for H.264 (NI, JH), pp. 1440–1445.
- DATE-2009-KahngLPS #design
- ORION 2.0: A fast and accurate NoC power and area model for early-stage design space exploration (ABK, BL, LSP, KS), pp. 423–428.
- DATE-2009-KonigBSMNW #behaviour #embedded #evaluation #realtime
- Application specific performance indicators for quantitative evaluation of the timing behavior for embedded real-time systems (FK, DB, FS, UM, MN, GW), pp. 519–523.
- DATE-2009-KwonYUJ #problem
- In-network reorder buffer to improve overall NoC performance while resolving the in-order requirement problem (WCK, SY, JU, SWJ), pp. 1058–1063.
- DATE-2009-LadharMB #fault
- Efficient and accurate method for intra-gate defect diagnoses in nanometer technology and volume data (AL, MM, LB), pp. 988–993.
- DATE-2009-MadlenerMH #named
- SC-DEVS: An efficient SystemC extension for the DEVS model of computation (FM, HGM, SAH), pp. 1518–1523.
- DATE-2009-MaricauG #reliability #simulation #variability
- Efficient reliability simulation of analog ICs including variability and time-varying stress (EM, GGEG), pp. 1238–1241.
- DATE-2009-MarongiuB #memory management
- Efficient OpenMP support and extensions for MPSoCs with explicitly managed memory hierarchy (AM, LB), pp. 809–814.
- DATE-2009-MollCRB #modelling #protocol #using
- Fast and accurate protocol specific bus modeling using TLM 2.0 (HWMvM, HC, VR, MB), pp. 316–319.
- DATE-2009-PaikSS #named #synthesis
- HLS-l: High-level synthesis of high performance latch-based circuits (SP, IS, YS), pp. 1112–1117.
- DATE-2009-SahuBP #concurrent #estimation #framework #multi #thread
- A generic platform for estimation of multi-threaded program performance on heterogeneous multiprocessors (AS, MB, PRP), pp. 1018–1023.
- DATE-2009-ShafiqueBH #approach #design #hardware #parallel #predict #video
- A parallel approach for high performance hardware design of intra prediction in H.264/AVC Video Codec (MS, LB, JH), pp. 1434–1439.
- DATE-2009-TasdizenKAH #architecture #configuration management #estimation #hardware
- A high performance reconfigurable Motion Estimation hardware architecture (OT, HK, AA, IH), pp. 882–885.
- DATE-2009-ViehlPBR #analysis #scheduling
- White box performance analysis considering static non-preemptive software scheduling (AV, MP, OB, WR), pp. 513–518.
- DATE-2009-VillenaCIS #modelling #on the #parametricity #reduction
- On the efficient reduction of complete EM based parametric models (JFV, GC, DI, LMS), pp. 1172–1177.
- DATE-2009-WangCTHR #modelling #optimisation #polynomial #using
- An efficient decoupling capacitance optimization using piecewise polynomial models (XW, YC, SXDT, XH, JR), pp. 1190–1195.
- DATE-2009-WuLZSX #hybrid
- Power and performance of read-write aware Hybrid Caches with non-volatile memories (XW, JL, LZ, ES, YX), pp. 737–742.
- DATE-2009-WuM #logic #order
- Joint logic restructuring and pin reordering against NBTI-induced performance degradation (KCW, DM), pp. 75–80.
- HPCA-2009-ChenLHCSWP #consistency #memory management #verification
- Fast complete memory consistency verification (YC, YL, WH, TC, HS, PW, HP), pp. 381–392.
- HPCA-2009-DuanLP #architecture #estimation #metric #predict
- Versatile prediction and fast estimation of Architectural Vulnerability Factor from processor performance metrics (LD, BL, LP), pp. 129–140.
- HPCA-2009-SubramaniamBWL #optimisation
- Criticality-based optimizations for efficient load processing (SS, AB, HW, GHL), pp. 419–430.
- HPDC-2009-AsikiTK #adaptation #online
- An adaptive online system for efficient processing of hierarchical data (AA, DT, NK), pp. 71–80.
- HPDC-2009-DickensL #file system #library #named
- Y-lib: a user level library to increase the performance of MPI-IO in a lustre file system environment (PMD, JL), pp. 31–38.
- HPDC-2009-HeadG #execution #parallel #scalability #xml
- Performance enhancement with speculative execution based parallelism for processing large-scale xml-based application data (MRH, MG), pp. 21–30.
- HPDC-2009-HironakaST #concurrent #using
- High performance wide-area overlay using deadlock-free routing (KH, HS, KT), pp. 81–90.
- HPDC-2009-LiSDZ #parallel #predict
- Performance prediction based on hierarchy parallel features captured in multi-processing system (JL, FS, ND, QZ), pp. 63–64.
- HPDC-2009-WangLL #memory management #transaction
- Investigating transactional memory performance on ccNUMA machines (RW, KL, XL), pp. 67–68.
- ISMM-2009-GuanSJ #policy #using
- Investigating the effects of using different nursery sizing policies on performance (XG, WSa, CJ), pp. 59–68.
- ISMM-2009-NaeemL #alias #analysis #set #using
- Efficient alias set analysis using SSA form (NAN, OL), pp. 79–88.
- LCTES-2009-BlazyR
- Live-range unsplitting for faster optimal coalescing (SB, BR), pp. 70–79.
- LCTES-2009-LeatherOW #compilation #optimisation
- Raced profiles: efficient selection of competing compiler optimizations (HL, MFPO, BW), pp. 50–59.
- PDP-2009-AchourNS #adaptation #algorithm #clustering #modelling #on the #using
- On the Use of Performance Models for Adaptive Algorithm Selection on Heterogeneous Clusters (SA, WN, LAS), pp. 85–89.
- PDP-2009-GoiriJG #data transformation
- Efficient Data Management Support for Virtualized Service Providers (IG, FJ, JG), pp. 409–413.
- PDP-2009-HermannsGWW #scalability #verification
- Verifying Causality between Distant Performance Phenomena in Large-Scale MPI Applications (MAH, MG, FW, BJNW), pp. 78–84.
- PDP-2009-KalewskiKK #detection #distributed #scalability
- FAST Failure Detection Service for Large Scale Distributed Systems (MK, AK, JK), pp. 229–236.
- PDP-2009-MortaraG #analysis #named #parallel
- ProTailor: A Parallel Operator for Extremely Fast Shape Analysis in Bioinformatics Applications (MM, AG), pp. 276–282.
- PDP-2009-NavaridasPM #parallel
- Effects of Job and Task Placement on Parallel Scientific Applications Performance (JN, JAP, JMA), pp. 55–61.
- PDP-2009-OrtizODP #communication #interface #network
- A New Offloaded/Onloaded Network Interface for High Performance Communication (AO, JO, AFD, AP), pp. 143–150.
- PDP-2009-PadronABD #architecture #manycore
- High Performance Global Illumination on Multi-core Architectures (EJP, MA, MB, RD), pp. 93–100.
- PDP-2009-PantJK #multi #named #runtime
- Phoenix: A Runtime Environment for High Performance Computing on Chip Multiprocessors (AP, HJ, VVK), pp. 119–126.
- PDP-2009-PatooghyM #algorithm #fault tolerance #named #network
- XYX: A Power & Performance Efficient Fault-Tolerant Routing Algorithm for Network on Chip (AP, SGM), pp. 245–251.
- PDP-2009-Payeras-CapellaPFR #email #protocol
- No Author Based Selective Receipt in an Efficient Certified E-mail Protocol (MPC, MMP, JLFG, LHiR), pp. 387–392.
- PDP-2009-SantosAPDRS #monitoring #scheduling #using #web #web service
- Using Web Services for Performance Monitoring and Scheduling (AS, FA, VBP, DD, JR, ES), pp. 361–368.
- PDP-2009-ThieboltOM #consistency #workflow
- VisageFS Translucent Directories: Efficient Posix Consistencies for Wide-Area Workflows (FT, AO, AM), pp. 36–43.
- PDP-2009-ValentiniBBPPE
- High Performance Computing with Harness over InfiniBand (AV, CDB, FB, GP, FP, CE), pp. 151–154.
- PPoPP-2009-BikshandiCKNPSSVW #implementation #multi #source code
- Efficient, portable implementation of asynchronous multi-place programs (GB, JGC, SBK, VKN, IP, VAS, SS, PV, TW), pp. 271–282.
- PPoPP-2009-KangB #algorithm #graph #memory management #transaction
- An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs (SK, DAB), pp. 15–24.
- PPoPP-2009-LiBH #distributed #multi #scalability #scheduling #using
- Efficient and scalable multiprocessor fair scheduling using distributed weighted round-robin (TL, DPB, SH), pp. 65–74.
- PPoPP-2009-NicolauLK
- Techniques for efficient placement of synchronization primitives (AN, GL, AK), pp. 199–208.
- PPoPP-2009-TallentM #analysis #effectiveness #metric #parallel #thread
- Effective performance measurement and analysis of multithreaded applications (NRT, JMMC), pp. 229–240.
- SOSP-2009-AndersenFKPTV #array #named
- FAWN: a fast array of wimpy nodes (DGA, JF, MK, AP, LT, VV), pp. 1–14.
- SOSP-2009-CastroCMPADBB #fault
- Fast byte-granularity software fault isolation (MC, MC, JPM, MP, PA, AD, PB, RB), pp. 45–58.
- ESOP-2009-YuanE #algorithm #problem #reachability
- An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees (HY, PTE), pp. 175–189.
- FASE-2009-NguyenNPAN #clone detection #detection #feature model
- Accurate and Efficient Structural Characteristic Feature Extraction for Clone Detection (HAN, TTN, NHP, JMAK, TNN), pp. 440–455.
- STOC-2009-CardinalFJJM #algorithm #partial order
- An efficient algorithm for partial order production (JC, SF, GJ, RMJ, JIM), pp. 93–100.
- STOC-2009-CleveGMSY #algorithm #quantum #query #simulation
- Efficient discrete-time simulations of continuous-time quantum query algorithms (RC, DG, MM, RDS, DLYM), pp. 409–416.
- STOC-2009-DworkNRRV #algorithm #complexity #on the
- On the complexity of differentially private data release: efficient algorithms and hardness results (CD, MN, OR, GNR, SPV), pp. 381–390.
- STOC-2009-NguyenDT #algorithm #approximate #matrix #rank
- A fast and efficient algorithm for low-rank approximation of a matrix (NHN, TTD, TDT), pp. 215–224.
- TACAS-2009-BrummayerB #array #named #smt
- Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays (RB, AB), pp. 174–177.
- TACAS-2009-NaumovichBG #bound #named #petri net
- ITPN-PerfBound: A Performance Bound Tool for Interval Time Petri Nets (EPN, SB, MG), pp. 50–53.
- CADE-2009-BoutonODF #named
- veriT: An Open, Trustable and Efficient SMT-Solver (TB, DCBdO, DD, PF), pp. 151–156.
- CADE-2009-McLaughlinP #proving #theorem proving
- Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method (SM, FP), pp. 230–244.
- CAV-2009-Benini #manycore #predict #question
- Predictability vs. Efficiency in the Multicore Era: Fight of Titans or Happy Ever after? (LB), p. 50.
- CAV-2009-CosteHLS #composition #design #industrial #modelling #predict #towards
- Towards Performance Prediction of Compositional Models in Industrial GALS Designs (NC, HH, EL, WS), pp. 204–218.
- CAV-2009-GuptaR #generative #invariant #named
- InvGen: An Efficient Invariant Generator (AG, AR), pp. 634–640.
- CAV-2009-JhaLS #named #smt
- Beaver: Engineering an Efficient SMT Solver for Bit-Vector Arithmetic (SJ, RL, SAS), pp. 668–674.
- CAV-2009-Kim #verification
- Mixed-Signal System Verification: A High-Speed Link Example (JK), p. 16.
- CSL-2009-HofmannR #analysis
- Efficient Type-Checking for Amortised Heap-Space Analysis (MH, DR), pp. 317–331.
- ICST-2009-KaminskiA09a #fault #logic #mutation testing #testing #using
- Using a Fault Hierarchy to Improve the Efficiency of DNF Logic Mutation Testing (GKK, PA), pp. 386–395.
- ICST-2009-RogozF #multi
- A Test Based Multidimensional Performance Model for a Mission Critical System Server (KR, KF), pp. 269–278.
- ISSTA-2009-SchulerDZ #invariant #mutation testing #testing
- Efficient mutation testing by checking invariant violations (DS, VD, AZ), pp. 69–80.
- SAT-2009-KimSJ #modulo theories #satisfiability
- Efficient Term-ITE Conversion for Satisfiability Modulo Theories (HK, FS, HJ), pp. 195–208.
- SAT-2009-KojevnikovKY #using
- Finding Efficient Circuits Using SAT-Solvers (AK, ASK, GY), pp. 32–44.
- TAP-2009-FazlalizadehKAP #constraints #testing
- Incorporating Historical Test Case Performance Data and Resource Constraints into Test Case Prioritization (YF, AK, MAA, SP), pp. 43–57.
- CBSE-2008-KuperbergKR #behaviour #black box #component #modelling #parametricity #predict #using
- Performance Prediction for Black-Box Components Using Reengineered Parametric Behaviour Models (MK, KK, RHR), pp. 48–63.
- CBSE-2008-MartensBKR #component #empirical #modelling #predict #reuse
- An Empirical Investigation of the Effort of Creating Reusable, Component-Based Models for Performance Prediction (AM, SB, HK, RHR), pp. 16–31.
- CBSE-2008-SharmaJ #component
- Deploying Software Components for Performance (VSS, PJ), pp. 32–47.
- CBSE-2008-Tolosana-CalasanzRB #analysis #automation #workflow
- Automating Performance Analysis from Taverna Workflows (RTC, OFR, JAB), pp. 1–15.
- QoSA-2008-CortellessaPSV #analysis #architecture #framework #modelling #named #platform #uml
- MOSES: MOdeling Software and platform architEcture in UML 2 for Simulation-based performance analysis (VC, PP, RS, AV), pp. 86–102.
- QoSA-2008-MorenoM #analysis #modelling
- Model-Driven Performance Analysis (GAM, PM), pp. 135–151.
- WICSA-2008-GortonWAC #data type #framework #integration #platform #streaming
- The MeDICi Integration Framework: A Platform for High Performance Data Streaming Applications (IG, AW, JA, JC), pp. 95–104.
- WICSA-2008-KeulerMU #analysis #architecture #quality
- Efficient Quality Impact Analyses for Iterative Architecture Construction (TK, DM, TU), pp. 19–28.
- DocEng-2008-SchroederM #approach #design #documentation #query #xml
- Improving query performance on XML documents: a workload-driven design approach (RS, RdSM), pp. 177–186.
- DocEng-2008-ValleCP #documentation #identification #using #visual notation
- Fast identification of visual documents using local descriptors (EV, MC, SPF), pp. 173–176.
- DRR-2008-ShafaitKB #adaptation #image #implementation #using
- Efficient implementation of local adaptive thresholding techniques using integral images (FS, DK, TMB), p. 681510.
- HT-2008-ChiM #comprehension #social #using
- Understanding the efficiency of social tagging systems using information theory (EHC, TM), pp. 81–88.
- HT-2008-MarkinesRM #assembly #network #semantics #social
- Efficient assembly of social semantic networks (BM, HR, FM), pp. 149–156.
- SIGMOD-2008-AgrawalDGI #pattern matching
- Efficient pattern matching over event streams (JA, YD, DG, NI), pp. 147–160.
- SIGMOD-2008-AndoniFKPS #classification #rank #similarity
- Corrigendum to “efficient similarity search and classification via rank aggregation” by Ronald Fagin, Ravi Kumar and D. Sivakumar (proc. SIGMOD’03) (AA, RF, RK, MP, DS), pp. 1375–1376.
- SIGMOD-2008-ChakkappenCDJSSZ #database #scalability #statistics
- Efficient and scalable statistics gathering for large databases in Oracle 11g (SC, TC, BD, LJ, US, HS, MZ), pp. 1053–1064.
- SIGMOD-2008-ChakrabartiCGX #approximate
- An efficient filter for approximate membership checking (KC, SC, VG, DX), pp. 805–818.
- SIGMOD-2008-ChapmanJR
- Efficient provenance storage (AC, HVJ, PR), pp. 993–1006.
- SIGMOD-2008-GouC #algorithm #graph #pattern matching
- Efficient algorithms for exact ranked twig-pattern matching over graphs (GG, RC), pp. 581–594.
- SIGMOD-2008-HeinisA #workflow
- Efficient lineage tracking for scientific workflows (TH, GA), pp. 1007–1018.
- SIGMOD-2008-KimelfeldKS #modelling #probability #query #xml
- Query efficiency in probabilistic XML models (BK, YK, YS), pp. 701–714.
- SIGMOD-2008-LeeC #query #using
- Efficient storage scheme and query processing for supply chain management using RFID (CHL, CWC), pp. 291–302.
- SIGMOD-2008-MaWLCPY #data transformation #effectiveness #semantics #web
- Effective and efficient semantic web data management over DB2 (LM, CW, JL, FC, YP, YY), pp. 1183–1194.
- SIGMOD-2008-PanZW #clustering #composition #dataset #matrix #named #scalability
- CRD: fast co-clustering on large datasets utilizing sampling-based matrix decomposition (FP, XZ, WW), pp. 173–184.
- SIGMOD-2008-SilbersteinCSVYR #distributed #order
- Efficient bulk insertion into a distributed ordered table (AS, BFC, US, EV, RY, RR), pp. 765–778.
- SIGMOD-2008-SinhaPMT #array #locality #pattern matching
- Improving suffix array locality for fast pattern matching on disk (RS, SJP, AM, AT), pp. 661–672.
- SIGMOD-2008-TianHP #graph #summary
- Efficient aggregation for graph summarization (YT, RAH, JMP), pp. 567–580.
- SIGMOD-2008-VlachouDK #clustering #parallel
- Angle-based space partitioning for efficient parallel skyline computation (AV, CD, YK), pp. 227–238.
- SIGMOD-2008-VlachouDNV #distributed #on the #query
- On efficient top-k query processing in highly distributed environments (AV, CD, KN, MV), pp. 753–764.
- SIGMOD-2008-WichterichAKS #database #flexibility #multi #reduction #similarity
- Efficient EMD-based similarity search in multimedia databases via flexible dimensionality reduction (MW, IA, PK, TS), pp. 199–212.
- VLDB-2008-AbiteboulACGGGMNOSTVZ #named #web
- WebContent: efficient P2P Warehousing of web data (SA, TA, PC, GG, AG, FG, IM, BN, MO, AS, NT, GV, SZ), pp. 1428–1431.
- VLDB-2008-Amer-YahiaBLS #collaboration #network
- Efficient network aware search in collaborative tagging sites (SAY, MB, LVSL, JS), pp. 710–721.
- VLDB-2008-BeskalesSI #database #nearest neighbour #nondeterminism
- Efficient search for the top-k probable nearest neighbors in uncertain databases (GB, MAS, IFI), pp. 326–339.
- VLDB-2008-BiveinisS #in memory #towards
- Towards efficient main-memory use for optimum tree index update (LB, SS), pp. 1617–1622.
- VLDB-2008-ChaikenJLRSWZ #named #parallel #set
- SCOPE: easy and efficient parallel processing of massive data sets (RC, BJ, PÅL, BR, DS, SW, JZ), pp. 1265–1276.
- VLDB-2008-CheungM #framework #monitoring #profiling
- Performance profiling with EndoScope, an acquisitional software monitoring framework (AC, SM), pp. 42–53.
- VLDB-2008-ChhuganiNLMHCBKD #architecture #cpu #implementation #manycore #sorting
- Efficient implementation of sorting on multi-core SIMD CPU architecture (JC, ADN, VWL, WM, MH, YKC, AB, SK, PD), pp. 1313–1324.
- VLDB-2008-GuoARSSV
- Efficient top-k processing over query-dependent functions (LG, SAY, RR, JS, US, EV), pp. 1044–1055.
- VLDB-2008-ShahabiTX #query
- Indexing land surface for efficient kNN query (CS, LAT, SX), pp. 1020–1031.
- VLDB-2008-ShangZLY #algorithm #morphism #testing #verification
- Taming verification hardness: an efficient algorithm for testing subgraph isomorphism (HS, YZ, XL, JXY), pp. 364–375.
- VLDB-2008-ShaoSZ #challenge #database #effectiveness #scalability #similarity #video
- Challenges and techniques for effective and efficient similarity search in large video databases (JS, HTS, XZ), pp. 1598–1603.
- VLDB-2008-WongFPHWL #query
- Efficient skyline querying with variable user preferences on nominal attributes (RCWW, AWCF, JP, YSH, TW, YL), pp. 1032–1043.
- VLDB-2008-XiaoWL #algorithm #constraints #distance #edit distance #named #similarity
- Ed-Join: an efficient algorithm for similarity joins with edit distance constraints (CX, WW, XL), pp. 933–944.
- VLDB-2008-ZiauddinDSZY
- Optimizer plan change management: improved stability and performance in Oracle 11g (MZ, DD, HS, YZ, KY), pp. 1346–1355.
- EDM-2008-BakerC #behaviour #student
- Labeling Student Behavior Faster and More Precisely with Text Replays (RSJdB, AMJBdC), pp. 38–47.
- EDM-2008-PavlikCWK #using
- Using Item-type Performance Covariance to Improve the Skill Model of an Existing Tutor (PIP, HC, LW, KRK), pp. 77–86.
- ITiCSE-2008-CharltonMD #learning #social
- Evaluating the extent to which sociability and social presence affects learning performance (TC, LM, MD), p. 342.
- ITiCSE-2008-Kurmas #automation #logic #student #testing #using
- Improving student performance using automated testing of simulated digital logic circuits (ZK), pp. 265–270.
- CSMR-2008-TeleaV08a #optimisation #scalability
- A Tool for Optimizing the Build Performance of Large Software Code Bases (ACT, LV), pp. 323–325.
- ICSM-2008-KothariBMS #algebra #development #on the #using
- On evaluating the efficiency of software feature development using algebraic manifolds (JK, DB, SM, AS), pp. 7–16.
- PASTE-2008-JashkiZB #impact analysis #towards
- Towards a more efficient static software change impact analysis method (MAJ, RZ, EB), pp. 84–90.
- SCAM-2008-GorbovitskiTRSL #analysis #debugging
- Analysis and Transformations for Efficient Query-Based Debugging (MG, KTT, TR, SDS, YAL), pp. 174–183.
- SCAM-2008-LundbergGL #analysis #points-to #precise
- Fast and Precise Points-to Analysis (JL, TG, WL), pp. 133–142.
- CIAA-2008-MatsumotoHT #automaton #implementation #pattern matching #runtime
- A Run-Time Efficient Implementation of Compressed Pattern Matching Automata (TM, KH, MT), pp. 201–211.
- ICALP-A-2008-HaeuplerKMST #algorithm #incremental
- Faster Algorithms for Incremental Topological Ordering (BH, TK, RM, SS, RET), pp. 421–433.
- ICALP-A-2008-Koutis #algebra #algorithm #problem
- Faster Algebraic Algorithms for Path and Packing Problems (IK), pp. 575–586.
- ICALP-A-2008-Plaxton #scheduling
- Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines (CGP), pp. 222–233.
- ICALP-A-2008-Pritchard #distributed #random
- Fast Distributed Computation of Cuts Via Random Circulations (DP), pp. 145–160.
- ICALP-A-2008-Ruzic #sorting
- Constructing Efficient Dictionaries in Close to Sorting Time (MR), pp. 84–95.
- ICALP-B-2008-Canetti #analysis #composition #security
- Composable Formal Security Analysis: Juggling Soundness, Simplicity and Efficiency (RC), pp. 1–13.
- ICALP-C-2008-JareckiL #authentication #multi
- Affiliation-Hiding Envelope and Authentication Schemes with Efficient Support for Multiple Credentials (SJ, XL), pp. 715–726.
- LATA-2008-ChampavereGLN #automaton
- Efficient Inclusion Checking for Deterministic Tree Automata and DTDs (JC, RG, AL, JN), pp. 184–195.
- LATA-2008-Yoshinaka #algorithm #problem #subclass
- An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs (RY), pp. 487–498.
- FM-2008-ChalinR #fault #ml #runtime #using
- JML Runtime Assertion Checking: Improved Error Reporting and Efficiency Using Strong Validity (PC, FR), pp. 246–261.
- FM-2008-UzuncaovaK #analysis #constraints #declarative #modelling
- Constraint Prioritization for Efficient Analysis of Declarative Models (EU, SK), pp. 310–325.
- SEFM-2008-FranzleH #approximate #calculus #model checking
- Efficient Model Checking for Duration Calculus Based on Branching-Time Approximations (MF, MRH), pp. 63–72.
- SEFM-2008-PhamTTC #algorithm #bound #java #memory management
- A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets (THP, AHT, NTT, WNC), pp. 259–267.
- Haskell-2008-VieraSL #haskell #parsing #runtime #top-down
- Haskell, do you read me?: constructing and composing efficient top-down parsers at runtime (MV, SDS, EL), pp. 63–74.
- ICFP-2008-AdamsD #graph #similarity
- Efficient nondestructive equality checking for trees and graphs (MDA, RKD), pp. 179–188.
- ICFP-2008-RemyY #constraints #ml #type inference
- From ML to MLF: graphic type constraints with efficient type inference (DR, BY), pp. 63–74.
- IFL-2008-TellerSV #fault #lightweight #ml #polymorphism #type safety
- Catch Me If You Can — Looking for Type-Safe, Hierarchical, Lightweight, Polymorphic and Efficient Error Management in OCaml (DT, AS, TV), pp. 249–271.
- CIG-2008-Chetcuti-SperandioDLS #evaluation #game studies
- Determination and evaluation of efficient strategies for a stop or roll dice game: Heckmeck am Bratwurmeck (Pickomino) (NCS, FD, SL, DS), pp. 175–182.
- GT-VMT-2006-LambersEO08 #detection #graph transformation
- Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs (LL, HE, FO), pp. 17–26.
GT-VC-2007-BaresiRRS08 #graph transformation #model checking- An Efficient Solution for Model Checking Graph Transformation Systems (LB, VR, ATR, PS), pp. 3–21.
- CHI-2008-DixonGC #parametricity
- Optimal parameters for efficient crossing-based dialog boxes (MD, FG, NC), pp. 1623–1632.
- CHI-2008-EverettGBWDST
- Electronic voting machines versus traditional methods: improved preference, similar performance (SPE, KKG, MDB, DSW, KD, DS, TT), pp. 883–892.
- CHI-2008-FindlaterM #adaptation #user interface #user satisfaction #visual notation
- Impact of screen size on performance, awareness, and user satisfaction with adaptive graphical user interfaces (LF, JM), pp. 1247–1256.
- CHI-2008-GajosWW #interface
- Improving the performance of motor-impaired users with automatically-generated, ability-based interfaces (KZG, JOW, DSW), pp. 1257–1266.
- CHI-2008-LaukkanenIR #lazy evaluation
- The cone and the lazy bubble: two efficient alternatives between the point cursor and the bubble cursor (JL, PI, KJR), pp. 309–312.
- CSCW-2008-DiamantFL
- Where did we turn wrong?: unpacking the effect of culture and technology on attributions of team performance (EID, SRF, FlL), pp. 383–392.
- CAiSE-2008-SpiessNWMB #analysis #modelling #process #simulation #ubiquitous
- Modelling, Simulation, and Performance Analysis of Business Processes Involving Ubiquitous Systems (PS, DKN, IW, IM, MB), pp. 579–582.
- EDOC-2008-LutterothW #modelling #testing
- Modeling a Realistic Workload for Performance Testing (CL, GW), pp. 149–158.
- ICEIS-AIDSS-2008-LamKL #knowledge-based #metric #resource management
- A Knowledge-Based Performance Measurement System for Improving Resource Utilization (ACYL, SKK, WBL), pp. 187–192.
- ICEIS-AIDSS-2008-PanahiT #clustering #hybrid #problem
- An Efficient Hybrid Method for Clustering Problems (HP, RTM), pp. 288–294.
- ICEIS-ISAS2-2008-BohmLH #concept #evaluation #ontology
- A Supply Chain Ontology Conceptualization with Focus on Performance Evaluation (ACB, HPL, GPH), pp. 402–409.
- ICEIS-ISAS2-2008-FernandesAS #programming #release planning
- An Extreme Programming Release Plan that Maximizes Business Performance (MCF, AJA, EAS), pp. 12–22.
- ICEIS-J-2008-WengXLN08a #estimation #recommendation
- An Efficient Neighbourhood Estimation Technique for Making Recommendations (LTW, YX, YL, RN), pp. 253–264.
- ICEIS-SAIC-2008-RanW #adaptation #metric #using
- Develop Adaptive Workplace E-Learning Environments by Using Performance Measurement Systems (WR, MW), pp. 142–147.
- ICEIS-SAIC-2008-WengXLN #estimation #recommendation
- Efficient Neighbourhood Estimation for Recommendation Making (LTW, YX, YL, RN), pp. 12–19.
- CIKM-2008-Aguilar-SaboritJSM #memory management #pipes and filters
- Exploiting pipeline interruptions for efficient memory allocation (JAS, MJ, DS, VMM), pp. 639–648.
- CIKM-2008-AssentKMS #clustering #named
- EDSC: efficient density-based subspace clustering (IA, RK, EM, TS), pp. 1093–1102.
- CIKM-2008-ChakaravarthyGRM #documentation
- Efficient techniques for document sanitization (VTC, HG, PR, MKM), pp. 843–852.
- CIKM-2008-ChungLC #probability #query
- Efficient processing of probabilistic spatio-temporal range queries over moving objects (BSEC, WCL, ALPC), pp. 1399–1400.
- CIKM-2008-DongWJCL #modelling
- Modeling LSH for performance tuning (WD, ZW, WJ, MC, KL), pp. 669–678.
- CIKM-2008-FormanK #classification #feature model
- Extremely fast text feature extraction for classification and indexing (GF, EK), pp. 1221–1230.
- CIKM-2008-HauffHJ #overview #predict #query
- A survey of pre-retrieval query performance predictors (CH, DH, FdJ), pp. 1419–1420.
- CIKM-2008-HsuC08a #matrix #order #web
- Efficient web matrix processing based on dual reordering (CMH, MSC), pp. 1389–1390.
- CIKM-2008-LeeLZ #framework #named #network #query
- ROAD: an efficient framework for location dependent spatial queries on road networks (KCKL, WCL, BZ), pp. 1327–1328.
- CIKM-2008-LinL #clique #mining
- Fast spatial co-location mining without cliqueness checking (ZL, SL), pp. 1461–1462.
- CIKM-2008-LiuLNBMG #dataset #feature model #preprocessor #realtime #scalability
- Real-time data pre-processing technique for efficient feature extraction in large scale datasets (YL, LVL, RSN, KB, PM, CLG), pp. 981–990.
- CIKM-2008-Lu #data flow #estimation #web
- Efficient estimation of the size of text deep web data source (JL), pp. 1485–1486.
- CIKM-2008-LuoY #maintenance #online
- Content-based filtering for efficient online materialized view maintenance (GL, PSY), pp. 163–172.
- CIKM-2008-NajorkC #analysis #effectiveness
- Efficient and effective link analysis with precomputed salsa maps (MN, NC), pp. 53–62.
- CIKM-2008-NguyenS #analysis #correlation #dataset
- Fast correlation analysis on time series datasets (PN, NS), pp. 787–796.
- CIKM-2008-SongZG #classification #framework #process
- A sparse gaussian processes classification framework for fast tag suggestions (YS, LZ, CLG), pp. 93–102.
- CIKM-2008-TanbeerAJL #data type #mining
- Efficient frequent pattern mining over data streams (SKT, CFA, BSJ, YKL), pp. 1447–1448.
- CIKM-2008-TongSEF #mining
- Fast mining of complex time-stamped events (HT, YS, TER, CF), pp. 759–768.
- ECIR-2008-AltingovdeCU #query #strict #web
- Efficient Processing of Category-Restricted Queries for Web Directories (ISA, FC, ÖU), pp. 695–699.
- ECIR-2008-BlancoS #information retrieval
- Efficiency Issues in Information Retrieval Workshop (RB, FS), p. 711.
- ECIR-2008-EuachongprasitR #multi #normalisation #retrieval #scalability
- Efficient Multimedia Time Series Data Retrieval Under Uniform Scaling and Normalisation (WE, CAR), pp. 506–513.
- ECIR-2008-McSherryN #information retrieval #metric
- Computing Information Retrieval Performance Measures Efficiently in the Presence of Tied Scores (FM, MN), pp. 414–421.
- ECIR-2008-ZhaoST #effectiveness #predict #query #similarity #using #variability
- Effective Pre-retrieval Query Performance Prediction Using Similarity and Variability Evidence (YZ, FS, YT), pp. 52–64.
- ICML-2008-CatanzaroSK #classification
- Fast support vector machine training and classification on graphics processors (BCC, NS, KK), pp. 104–111.
- ICML-2008-Cayton #nearest neighbour #retrieval
- Fast nearest neighbor retrieval for bregman divergences (LC), pp. 112–119.
- ICML-2008-CunninghamSS #estimation #process
- Fast Gaussian process methods for point process intensity estimation (JPC, KVS, MS), pp. 192–199.
- ICML-2008-DiukCL #learning #object-oriented #representation
- An object-oriented representation for efficient reinforcement learning (CD, AC, MLL), pp. 240–247.
- ICML-2008-DuchiSSC #learning
- Efficient projections onto the l1-ball for learning in high dimensions (JCD, SSS, YS, TC), pp. 272–279.
- ICML-2008-KakadeST #algorithm #multi #online #predict
- Efficient bandit algorithms for online multiclass prediction (SMK, SSS, AT), pp. 440–447.
- ICML-2008-KuzelkaZ #estimation #first-order
- Fast estimation of first-order clause coverage through randomization and maximum likelihood (OK, FZ), pp. 504–511.
- ICML-2008-RothF #algorithm #linear #modelling
- The Group-Lasso for generalized linear models: uniqueness of solutions and efficient algorithms (VR, BF), pp. 848–855.
- ICML-2008-SarkarMP #graph #incremental #proximity #scalability
- Fast incremental proximity search in large graphs (PS, AWM, AP), pp. 896–903.
- ICML-2008-WeinbergerS #distance #implementation #learning #metric
- Fast solvers and efficient implementations for distance metric learning (KQW, LKS), pp. 1160–1167.
- ICML-2008-ZhaoWZ #clustering #multi
- Efficient multiclass maximum margin clustering (BZ, FW, CZ), pp. 1248–1255.
- ICPR-2008-Brandt #consistency #geometry
- Consistent and efficient sampler for geometric computation (SSB), pp. 1–4.
- ICPR-2008-BrasnettB #identification #image #robust
- Fast and robust image identification (PB, MB), pp. 1–5.
- ICPR-2008-BridsonA #analysis #approach #evaluation #geometry #layout
- A geometric approach for accurate and efficient performance evaluation of layout analysis methods (DB, AA), pp. 1–4.
- ICPR-2008-ChaeCY #detection
- Color filtering-based efficient face detection (YNC, JC, HSY), pp. 1–4.
- ICPR-2008-Chen #metric #pattern matching #pattern recognition #recognition
- Stability as performance metric for subjective pattern recognition — application of Electoral College in face recognition (LC), pp. 1–5.
- ICPR-2008-ChenCC
- A performance controllable octree construction method (ZC, HLC, WCC), pp. 1–4.
- ICPR-2008-ChenCW #higher-order #named #using
- HOPS: Efficient region labeling using Higher Order Proxy Neighborhoods (AYCC, JJC, LW), pp. 1–4.
- ICPR-2008-DonateWLC
- Efficient and accurate subpixel path based stereo matching (AD, YW, XL, EGCJ), pp. 1–4.
- ICPR-2008-FilipH #segmentation #sequence #video
- Fast and reliablePCA-based temporal segmentation of video sequences (JF, MH), pp. 1–4.
- ICPR-2008-FuR #learning #multi
- Fast multiple instance learning via L1, 2 logistic regression (ZF, ARK), pp. 1–4.
- ICPR-2008-FuR08a #approach #image #segmentation
- A fast hierarchical approach to image segmentation (ZF, ARK), pp. 1–4.
- ICPR-2008-GorisseCPP #approximate #image #kernel #retrieval #similarity
- Fast approximate kernel-based similarity search for image retrieval task (DG, MC, FP, SPF), pp. 1–4.
- ICPR-2008-IlayarajaNJ #implementation #problem #scalability
- Efficient implementation of SVM for large class problems (PI, NVN, CVJ), pp. 1–4.
- ICPR-2008-IwahoriNWFK #self
- Shape from self-calibration and Fast Marching Method (YI, TN, RJW, SF, HK), pp. 1–4.
- ICPR-2008-JradGB #constraints #learning #multi
- Supervised learning rule selection for multiclass decision with performance constraints (NJ, EGM, PB), pp. 1–4.
- ICPR-2008-KawaiTFK #3d #representation #web
- Efficient meta-information annotation and view-dependent representation system for 3D objects on the Web (YK, ST, RF, HK), pp. 1–4.
- ICPR-2008-KuksaHP #detection #kernel
- Fast protein homology and fold detection with sparse spatial sample kernels (PPK, PHH, VP), pp. 1–4.
- ICPR-2008-LeeWN #detection #using
- Very fast ellipse detection using GPU-based RHT (JKL, BAW, TSN), pp. 1–4.
- ICPR-2008-LiZ #algorithm #fixpoint #matrix #named
- FastNMF: A fast monotonic fixed-point non-negative Matrix Factorization algorithm with high ease of use (LL, YJZ), pp. 1–4.
- ICPR-2008-Lu
- Markerless human motion capture: An application of simulated annealing and Fast Marching Method (YL), pp. 1–4.
- ICPR-2008-MaL08a #approach #concept #detection #optimisation #semantics
- An efficient gradient computation approach to discriminative fusion optimization in semantic concept detection (CM, CHL), pp. 1–4.
- ICPR-2008-MollerPF #multi #reliability
- Calibration-free camera hand-over for fast and reliable person tracking in multi-camera setups (BM, TP, GAF), pp. 1–4.
- ICPR-2008-NetzellS #image #modelling
- Efficient image inner products applied to active appearance models (KN, JES), pp. 1–4.
- ICPR-2008-Nordberg #3d #optimisation
- Efficient triangulation based on 3D Euclidean optimization (KN), pp. 1–4.
- ICPR-2008-Obafemi-AjayiAF #approach #documentation #image
- Efficient MRF approach to document image enhancement (TOA, GA, OF), pp. 1–4.
- ICPR-2008-ParamanandR #geometry #higher-order
- Efficient geometric matching with higher-order features (CP, ANR), pp. 1–4.
- ICPR-2008-PorroHTNDB #evaluation
- Performance evaluation of relevance vector machines as a nonlinear regression method in real-world chemical spectroscopic data (DP, NHG, ITB, ON, AD, RJB), pp. 1–4.
- ICPR-2008-SaitohMK #analysis
- Analysis of efficient lip reading method for various languages (TS, KM, RK), pp. 1–4.
- ICPR-2008-SeiffertKHN #classification #named
- RUSBoost: Improving classification performance when training data is skewed (CS, TMK, JVH, AN), pp. 1–4.
- ICPR-2008-ShivakumaraHT #detection #using #video
- Efficient video text detection using edge features (PS, WH, CLT), pp. 1–4.
- ICPR-2008-ShoemakerBHBK #detection
- Detecting and ordering salient regions for efficient browsing (LS, REB, LOH, KWB, WPK), pp. 1–4.
- ICPR-2008-TauberRLCDO #automation #image #multi #re-engineering
- Fast and automatic reconstruction of structured illumination microscopy images with multiscale products (CT, PFGR, VL, NC, BD, JCOM), pp. 1–4.
- ICPR-2008-TavakkoliNBN #incremental #modelling
- Efficient background modeling through incremental Support Vector Data Description (AT, MN, GB, MNN), pp. 1–4.
- ICPR-2008-TiernyVD #3d #precise
- Fast and precise kinematic skeleton extraction of 3D dynamic meshes (JT, JPV, MD), pp. 1–4.
- ICPR-2008-TsolakisFD #framework #using
- A framework for efficient correspondence using feature interrelations (AGT, MF, AD), pp. 1–4.
- ICPR-2008-WangQ #3d #correlation #recognition
- 3D object recognition by fast spherical correlation between combined view EGIs and PFT (DW, HQ), pp. 1–4.
- ICPR-2008-WatanabeIHY #algorithm #reduction #using #video
- A fast algorithm of video super-resolution using dimensionality reduction by DCT and example selection (KW, YI, TH, MY), pp. 1–5.
- ICPR-2008-YingZ #detection #using
- Efficient detection of projected concentric circles using four intersection points on a secant line (XY, HZ), pp. 1–4.
- ICPR-2008-YuanDZ #image #re-engineering
- Fast super-resolution for license plate image reconstruction (JY, SD, XZ), pp. 1–4.
- ICPR-2008-ZhangN #image #retrieval #visual notation
- Tile-based image visual codeword extraction for efficient indexing and retrieval (ZZ, ON), pp. 1–4.
- KDD-2008-BecchettiBCG #algorithm #graph
- Efficient semi-streaming algorithms for local triangle counting in massive graphs (LB, PB, CC, AG), pp. 16–24.
- KDD-2008-ChenW #classification #feature model #metric #named #problem
- FAST: a roc-based feature selection metric for small samples and imbalanced data classification problems (XwC, MW), pp. 124–132.
- KDD-2008-FujiwaraSY #identification #markov #modelling #named
- SPIRAL: efficient and exact model identification for hidden Markov models (YF, YS, MY), pp. 247–255.
- KDD-2008-GrossmanG #data mining #mining #using
- Data mining using high performance data clouds: experimental studies using sector and sphere (RLG, YG), pp. 920–927.
- KDD-2008-IfrimBW #categorisation #n-gram
- Fast logistic regression for text categorization with variable-length n-grams (GI, GHB, GW), pp. 354–362.
- KDD-2008-JinAXR #effectiveness #summary
- Effective and efficient itemset pattern summarization: regression-based approaches (RJ, MAA, YX, NR), pp. 399–407.
- KDD-2008-LiFGMF #learning #linear #named #parallel
- Cut-and-stitch: efficient parallel learning of linear dynamical systems on smps (LL, WF, FG, TCM, CF), pp. 471–479.
- KDD-2008-PorteousNIASW
- Fast collapsed gibbs sampling for latent dirichlet allocation (IP, DN, ATI, AUA, PS, MW), pp. 569–577.
- KDD-2008-ShaoCTYA #mining #sequence
- Efficient ticket routing by resolution sequence mining (QS, YC, ST, XY, NA), pp. 605–613.
- KDD-2008-SiaCCT #query
- Efficient computation of personal aggregate queries on blogs (KCS, JC, YC, BLT), pp. 632–640.
- KDD-2008-TongPSYF #graph #mining #named #scalability
- Colibri: fast mining of large static and dynamic graphs (HT, SP, JS, PSY, CF), pp. 686–694.
- KDD-2008-ZhangZW #algorithm #named
- Fastanova: an efficient algorithm for genome-wide association study (XZ, FZ, WW), pp. 821–829.
- KDD-2008-ZhaoWZ #algorithm #named #virtual machine
- Cuts3vm: a fast semi-supervised svm algorithm (BZ, FW, CZ), pp. 830–838.
- KR-2008-Cortes-CalabuigDAB #approximate #database #fixpoint #query
- Accuracy and Efficiency of Fixpoint Methods for Approximate Query Answering in Locally Complete Databases (ACC, MD, OA, MB), pp. 81–91.
- RecSys-2008-Sampaio #internet #network #process #recommendation
- A network performance recommendation process for advanced internet applications users (LNS), pp. 315–318.
- RecSys-2008-Umyarov #predict #recommendation
- Leveraging aggregate ratings for improving predictive performance of recommender systems (AU), pp. 327–330.
- SEKE-2008-CheonCLC #constraints #random testing #testing
- Integrating Random Testing with Constraints for Improved Efficiency and Diversity (YC, AC, GTL, MC), pp. 861–866.
- SEKE-2008-DingH #algorithm #mining #named
- VP: an Efficient Algorithm for Frequent Itemset Mining (QD, WSH), pp. 381–386.
- SEKE-2008-GaidhaniJ #challenge #migration
- Performance Challenges in Migrating to SOA Based Healthcare Systems (SG, VJ), pp. 555–560.
- SEKE-2008-HewettKS #generative #integration #object-oriented #order #testing
- Test Order Generation for Efficient Object-oriented Class Integration Testing (RH, PK, DS), pp. 703–708.
- SEKE-2008-Stankovic #named
- Performance: a Longitudinal Study (NS), pp. 434–439.
- SEKE-2008-YangDZ #predict #reliability
- Reliability Oriented QoS Driven Composite Service Selection Based on Performance Prediction (LY, YD, BZ), pp. 215–218.
- SIGIR-2008-KeskustaloJPK #higher-order #visualisation
- Intuition-supporting visualization of user’s performance based on explicit negative higher-order relevance (HK, KJ, AP, JK), pp. 675–682.
- SIGIR-2008-KumaranA #effectiveness #interactive #query
- Effective and efficient user interaction for long queries (GK, JA), pp. 11–18.
- SIGIR-2008-SchenkelCKMNPW #network #query
- Efficient top-k querying over social-tagging networks (RS, TC, MK, SM, TN, JXP, GW), pp. 523–530.
- SIGIR-2008-TheobaldSP #detection #named #robust #scalability #web
- SpotSigs: robust and efficient near duplicate detection in large web collections (MT, JS, AP), pp. 563–570.
- SIGIR-2008-YilmazKA
- A simple and efficient sampling method for estimating AP and NDCG (EY, EK, JAA), pp. 603–610.
- ECMDA-FA-2008-FritzscheGFSKB #analysis #modelling #towards
- Towards Utilizing Model-Driven Engineering of Composite Applications for Business Performance Analysis (MF, WG, CF, ITAS, PK, TJB), pp. 369–380.
- ECMDA-FA-2008-MarzulloPLSB #approach #assessment #profiling
- A Practical MDA Approach for Autonomic Profiling and Performance Assessment (FPM, RNP, DGL, JMdS, JRB), pp. 110–120.
- MoDELS-2008-GogollaKB #benchmark #metric #ocl
- A Benchmark for OCL Engine Accuracy, Determinateness, and Efficiency (MG, MK, FB), pp. 446–459.
- MoDELS-2008-TawhidP #analysis #development #modelling #product line
- Integrating Performance Analysis in the Model Driven Development of Software Product Lines (RT, DCP), pp. 490–504.
- MoDELS-2008-GogollaKB #benchmark #metric #ocl
- A Benchmark for OCL Engine Accuracy, Determinateness, and Efficiency (MG, MK, FB), pp. 446–459.
- MoDELS-2008-TawhidP #analysis #development #modelling #product line
- Integrating Performance Analysis in the Model Driven Development of Software Product Lines (RT, DCP), pp. 490–504.
- OOPSLA-2008-ArnoldVY #detection #fault #named #runtime
- QVM: an efficient runtime for detecting defects in deployed systems (MA, MTV, EY), pp. 143–162.
- OOPSLA-2008-BellamyAMS #type inference
- Efficient local type inference (BB, PA, OdM, DS), pp. 475–492.
- OOPSLA-2008-GeorgesEB #compilation #evaluation #java
- Java performance evaluation through rigorous replay compilation (AG, LE, DB), pp. 367–384.
- OOPSLA-2008-ProkopskiV #virtual machine
- Analyzing the performance of code-copying virtual machines (GBP, CV), pp. 403–422.
- OOPSLA-2008-RobersonHDB #model checking #type system
- Efficient software model checking of soundness of type systems (MR, MH, PTD, CB), pp. 493–504.
- OOPSLA-2008-SchneiderMSA #optimisation
- Dynamic optimization for efficient strong atomicity (FTS, VM, TS, ARAT), pp. 181–194.
- TOOLS-EUROPE-2008-ArthoLHT #model checking
- Efficient Model Checking of Networked Applications (CA, WL, MH, YT), pp. 22–40.
- TOOLS-EUROPE-2008-BishopH #c# #design pattern #on the
- On the Efficiency of Design Patterns Implemented in C# 3.0 (JB, RNH), pp. 356–371.
- AdaEurope-2008-Evequoz #concurrent #using #word
- Practical, Fast and Simple Concurrent FIFO Queues Using Single Word Synchronization Primitives (CE), pp. 59–72.
- AdaEurope-2008-FahmyRJ #realtime #scheduling #thread
- Fast Scheduling of Distributable Real-Time Threads with Assured End-to-End Timeliness (SFF, BR, EDJ), pp. 211–225.
- LOPSTR-2008-LeuschelV #logic programming #partial evaluation #scalability #source code
- Fast Offline Partial Evaluation of Large Logic Programs (ML, GV), pp. 119–134.
- PADL-2008-Subbarayan #constraints #reasoning #theorem proving
- Efficient Reasoning for Nogoods in Constraint Solvers with BDDs (SS), pp. 53–67.
- PLDI-2008-BlackburnM #garbage collection #named
- Immix: a mark-region garbage collector with space efficiency, fast collection, and mutator performance (SMB, KSM), pp. 22–32.
- PLDI-2008-XinSZ #execution
- Efficient program execution indexing (BX, WNS, XZ), pp. 238–248.
- RE-2008-HoWR #fault #problem #requirements
- Examining the Relationships between Performance Requirements and “Not a Problem” Defect Reports (CWH, LW, BR), pp. 135–144.
- ASE-2008-BertolinoAS #named #testing
- VCR: Virtual Capture and Replay for Performance Testing (AB, GDA, AS), pp. 399–402.
- ASE-2008-MeredithJCR #monitoring #parametricity
- Efficient Monitoring of Parametric Context-Free Patterns (POM, DJ, FC, GR), pp. 148–157.
- ASE-2008-Pinzger #analysis #automation #web
- Automated Web Performance Analysis (MP), pp. 513–516.
- FSE-2008-RaimondiSE #monitoring #online
- Efficient online monitoring of web-service SLAs (FR, JS, WE), pp. 170–180.
- FSE-2008-YuWGB #composition #encoding #summary #using #verification #web #web service
- Modular verification of web services using efficient symbolic encoding and summarization (FY, CW, AG, TB), pp. 192–202.
- ICSE-2008-GoldschmidtRW #case study #evaluation #maintenance
- A case study evaluation of maintainability and performance of persistency techniques (TG, RR, JW), pp. 401–410.
- ICSE-2008-MoserPS #analysis #comparative #fault #metric #predict
- A comparative analysis of the efficiency of change metrics and static code attributes for defect prediction (RM, WP, GS), pp. 181–190.
- SAC-2008-BealBVT #self
- Fast self-healing gradients (JB, JB, DV, MT), pp. 1969–1975.
- SAC-2008-CardenasG #architecture #comparison #network
- Performance comparison of Flow Aware Networking (FAN) architectures under GridFTP traffic (CC, MG), pp. 2079–2084.
- SAC-2008-Ercan #comparison #hybrid #multi #scheduling
- A performance comparison of PSO and GA in scheduling hybrid flow-shops with multiprocessor tasks (MFE), pp. 1767–1771.
- SAC-2008-GiorgiB
- Filtering drowsy instruction cache to achieve better efficiency (RG, PB), pp. 1554–1555.
- SAC-2008-GoldsztejnMR #algorithm #approximate #quantifier
- An efficient algorithm for a sharp approximation of universally quantified inequalities (AG, CM, MR), pp. 134–139.
- SAC-2008-HojjatMS #algebra #evaluation #framework #functional #probability #process #verification
- A framework for performance evaluation and functional verification in stochastic process algebras (HH, MRM, MS), pp. 339–346.
- SAC-2008-LeePSK
- A group management scheme for an efficient location-based service (JL, GLP, COS, SWK), pp. 1705–1709.
- SAC-2008-LinWZW #on the #persistent #web
- On the performance of persistent connection in modern web servers (XzL, HyW, JjZ, YxW), pp. 2403–2408.
- SAC-2008-LogozzoF #abstract domain #array #named #relational #validation
- Pentagons: a weakly relational abstract domain for the efficient validation of array accesses (FL, MF), pp. 184–188.
- SAC-2008-MascarenhasI #compilation #lua
- Efficient compilation of Lua for the CLR (FM, RI), pp. 217–221.
- SAC-2008-SalesAP #network #on the
- On the performance of TCP, UDP and DCCP over 802.11 g networks (LMdS, HOdA, AP), pp. 2074–2078.
- SAC-2008-SantosCGAT #network #on the
- On the performance of employing presence services in P2P-based network management systems (CRPdS, SLC, LZG, MJBA, LMRT), pp. 2090–2094.
- SAC-2008-SantosSMCSGAT #design #evaluation #network #on the
- On the design and performance evaluation of notification support for P2P-based network management (CRPdS, LFDS, CCM, SLC, EMS, LZG, MJBA, LMRT), pp. 2057–2062.
- SAC-2008-SungCM #clustering #concept #learning #lifecycle #ontology #using #web
- Efficient concept clustering for ontology learning using an event life cycle on the web (SS, SC, DM), pp. 2310–2314.
- SAC-2008-TanWC #categorisation #ranking
- An efficient feature ranking measure for text categorization (ST, YW, XC), pp. 407–413.
- SAC-2008-YuB #detection #effectiveness #multi
- A fast and effective method to detect multiple least significant bits steganography (XY, NB), pp. 1443–1447.
- GPCE-2008-GottschlingL #c++ #compilation #concept #library #reuse #robust #semantics #using
- Integrating semantics and compilation: using c++ concepts to develop robust and efficient reusable libraries (PG, AL), pp. 67–76.
- GPCE-2008-MendoncaWCC #compilation #feature model #modelling #scalability
- Efficient compilation techniques for large scale feature models (MM, AW, KC, DDC), pp. 13–22.
- ASPLOS-2008-JoaoMKAP #object-oriented
- Improving the performance of object-oriented languages with dynamic predication of indirect jumps (JAJ, OM, HK, RA, YNP), pp. 80–90.
- ASPLOS-2008-LeeB #adaptation #architecture #roadmap
- Efficiency trends and limits from comprehensive microarchitectural adaptivity (BCL, DMB), pp. 36–47.
- ASPLOS-2008-MallikCDMD #named #scalability
- PICSEL: measuring user-perceived performance to control dynamic frequency scaling (AM, JC, RPD, GM, PAD), pp. 70–79.
- CASE-2008-BandaruN #algorithm #combinator #composition #web #web service
- Efficient algorithms for combinatorial auctions with volume discounts arising in web service composition (PB, YN), pp. 995–1000.
- CASE-2008-JungL #clustering #scheduling #tool support
- Efficient scheduling method based on an assignment model for robotized cluster tools (CJ, TEL), pp. 79–84.
- CASE-2008-LiQ08a #requirements #scheduling
- The impact of the qual-run requirements of APC on the scheduling performance in semiconductor manufacturing (LL, FQ), pp. 242–246.
- CASE-2008-MittalYBB #difference #equation #modelling #multi #probability #using
- Dynamics and performance modeling of multi-stage manufacturing systems using nonlinear stochastic differential equations (UM, HY, STSB, LGB), pp. 498–503.
- CASE-2008-NieIYTOM #analysis #behaviour #video
- High-speed video analysis of laboratory rats behaviors in forced swim test (YN, II, KY, TT, KO, HM), pp. 206–211.
- CASE-2008-NixonCBM #network
- Meeting control performance over a wireless mesh network (MN, DC, TB, AKM), pp. 540–547.
- CASE-2008-ParkDB #collaboration #energy #network #reduction
- Collaborative data reduction for energy efficient sensor networks (CP, YD, EB), pp. 442–447.
- CASE-2008-QianK #component #product line
- Supply chain performance with various price-dependent demand functions and component commonality in one product family (LQ, Z(K), pp. 760–765.
- CASE-2008-ScheitererNOSG #precise #protocol
- Synchronization performance of the Precision Time Protocol in the face of slave clock frequency drift (RLS, CN, DO, GS, DG), pp. 554–559.
- CASE-2008-SolisT #detection
- Enabling autonomous systems to perceptually detect human performance improvements and their applications (JS, AT), pp. 259–264.
- CASE-2008-TanakaF #algorithm #scheduling
- An efficient exact algorithm for general single-machine scheduling with machine idle time (ST, SF), pp. 371–376.
- CASE-2008-ZhaoYZHLG #simulation
- Efficient simulation for serial production lines based on aggregated event-scheduling (YZ, CBY, QZ, NH, JL, XG), pp. 406–411.
- CC-2008-KhedkerK #analysis #data flow #interprocedural #precise #string
- Efficiency, Precision, Simplicity, and Generality in Interprocedural Data Flow Analysis: Resurrecting the Classical Call Strings Method (UPK, BK), pp. 213–228.
- CC-2008-MarronHKS #analysis #graph #modelling
- Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models (MM, MVH, DK, DS), pp. 245–259.
- CC-2008-ZhaoRARW #debugging #how #using
- How to Do a Million Watchpoints: Efficient Debugging Using Dynamic Instrumentation (QZ, RMR, SPA, LR, WFW), pp. 147–162.
- CGO-2008-BoissinotHGDR #liveness #source code
- Fast liveness checking for ssa-form programs (BB, SH, DG, BDdD, FR), pp. 35–44.
- CGO-2008-SaxenaSP #fine-grained
- Efficient fine-grained binary instrumentationwith applications to taint-tracking (PS, RS, VP), pp. 74–83.
- CGO-2008-ZhuangKSC #analysis #difference #framework #named #virtual machine
- Perfdiff: a framework for performance difference analysis in a virtual machine environment (XZ, SK, MJS, JDC), pp. 4–13.
- DAC-2008-ChoYBP #named #predict
- ELIAD: efficient lithography aware detailed router with compact post-OPC printability prediction (MC, KY, YB, DZP), pp. 504–509.
- DAC-2008-DargaSM #symmetry #using
- Faster symmetry discovery using sparsity of symmetries (PTD, KAS, ILM), pp. 149–154.
- DAC-2008-El-MoselhyEW #algorithm #parametricity #scalability #set
- Efficient algorithm for the computation of on-chip capacitance sensitivities with respect to a large set of parameters (TAEM, IME, DW), pp. 906–911.
- DAC-2008-GaoKKLAM #estimation #hybrid #multi #simulation #using
- Multiprocessor performance estimation using hybrid simulation (LG, KK, SK, RL, GA, HM), pp. 325–330.
- DAC-2008-GargNK #design
- A fast, analytical estimator for the SEU-induced pulse width in combinational designs (RG, CN, SPK), pp. 918–923.
- DAC-2008-HomayounPMV #embedded #energy #scalability
- Dynamic register file resizing and frequency scaling to improve embedded processor performance and energy-delay efficiency (HH, SP, MAM, AVV), pp. 68–71.
- DAC-2008-JinC #benchmark #case study #metric #simulation #statistics #using
- Improve simulation efficiency using statistical benchmark subsetting: an ImplantBench case study (ZJ, ACC), pp. 970–973.
- DAC-2008-KshirsagarEB #analysis
- Analysis and implications of parasitic and screening effects on the high-frequency/RF performance of tunneling-carbon nanotube FETs (CK, MNEZ, KB), pp. 250–255.
- DAC-2008-LiL #modelling #statistics
- Statistical regression for efficient high-dimensional modeling of analog and mixed-signal performance variations (XL, HL), pp. 38–43.
- DAC-2008-MoselhyD #equation #probability
- Stochastic integral equation solver for efficient variation-aware interconnect extraction (TM, LD), pp. 415–420.
- DAC-2008-OzisikyilmazMC #design #machine learning #using
- Efficient system design space exploration using machine learning techniques (BÖ, GM, ANC), pp. 966–969.
- DAC-2008-PaulB #configuration management #memory management #resource management #using
- Reconfigurable computing using content addressable memory for improved performance and resource usage (SP, SB), pp. 786–791.
- DAC-2008-PiyachonL #automaton #design #finite #pattern matching
- Design of high performance pattern matching engine through compact deterministic finite automata (PP, YL), pp. 852–857.
- DAC-2008-RajaVBG #analysis #modelling
- Transistor level gate modeling for accurate and fast timing, noise, and power analysis (SR, FV, MRB, JG), pp. 456–461.
- DAC-2008-SauerGL #framework #functional #modelling #named #using
- SystemClick: a domain-specific framework for early exploration using functional performance models (CS, MG, HPL), pp. 480–485.
- DAC-2008-SavolainenR #design #interface #mobile #standard
- Standard interfaces in mobile terminals: increasing the efficiency of device design and accelerating innovation (RS, TR), p. 592.
- DAC-2008-VeetilSB #analysis #incremental #monte carlo #statistics
- Efficient Monte Carlo based incremental statistical timing analysis (VV, DS, DB), pp. 676–681.
- DAC-2008-WangZ #algorithm #incremental
- An efficient incremental algorithm for min-area retiming (JW, HZ), pp. 528–533.
- DAC-2008-YuP #communication #embedded #latency #multi
- Latency and bandwidth efficient communication through system customization for embedded multiprocessors (CY, PP), pp. 766–771.
- DATE-2008-AliWWB #approach #behaviour #modelling
- A New Approach for Combining Yield and Performance in Behavioural Models for Analogue Integrated Circuits (SA, RW, PRW, ADB), pp. 152–157.
- DATE-2008-AronsEOSS #low level #simulation
- Efficient Symbolic Simulation of Low Level Software (TA, EE, SO, JS, ES), pp. 825–830.
- DATE-2008-BrunelliBMT #energy
- An Efficient Solar Energy Harvester for Wireless Sensor Nodes (DB, LB, CM, LT), pp. 104–109.
- DATE-2008-CalimeraBM #constraints #power management
- Optimal MTCMOS Reactivation Under Power Supply Noise and Performance Constraints (AC, LB, EM), pp. 973–978.
- DATE-2008-CertnerLPTAD #approach #parallel #predict #source code
- A Practical Approach for Reconciling High and Predictable Performance in Non-Regular Parallel Programs (OC, ZL, PP, OT, FA, ND), pp. 740–745.
- DATE-2008-CornetMM #development #modelling #transaction
- A Method for the Efficient Development of Timed and Untimed Transaction-Level Models of Systems-on-Chip (JC, FM, LMC), pp. 9–14.
- DATE-2008-DasMJZMC #analysis #component #detection #implementation #network
- An Efficient FPGA Implementation of Principle Component Analysis based Network Intrusion Detection System (AD, SM, SJ, JZ, GM, ANC), pp. 1160–1165.
- DATE-2008-DuanK #energy
- Energy Efficient and High Speed On-Chip Ternary Bus (CD, SPK), pp. 515–518.
- DATE-2008-ErnstJSBC #analysis #formal method #optimisation
- Formal Methods in System and MpSoC Performance Analysis and Optimisation (RE, MJ, HS, MB, SC).
- DATE-2008-FangH #algorithm #approximate #satisfiability
- A Fast Approximation Algorithm for MIN-ONE SAT (LF, MSH), pp. 1087–1090.
- DATE-2008-GerinGP #implementation #simulation
- Efficient Implementation of Native Software Simulation for MPSoC (PG, XG, FP), pp. 676–681.
- DATE-2008-HosseinabadyKMP #architecture #energy #graph #latency #scalability
- De Bruijn Graph as a Low Latency Scalable Architecture for Energy Efficient Massive NoCs (MH, MRK, JM, DKP), pp. 1370–1373.
- DATE-2008-HwangAG #approximate #estimation #transaction
- Cycle-approximate Retargetable Performance Estimation at the Transaction Level (YH, SA, DG), pp. 3–8.
- DATE-2008-KangK #design #framework #machine learning #manycore #named #optimisation
- Magellan: A Search and Machine Learning-based Framework for Fast Multi-core Design Space Exploration and Optimization (SK, RK), pp. 1432–1437.
- DATE-2008-KazmierskiZA #approximate #mobile #modelling #using
- Efficient circuit-level modelling of ballistic CNT using piecewise non-linear approximation of mobile charge density (TJK, DZ, BMAH), pp. 146–151.
- DATE-2008-LinF #parallel #source code
- Harnessing Horizontal Parallelism and Vertical Instruction Packing of Programs to Improve System Overall Efficiency (HL, YF), pp. 758–763.
- DATE-2008-Liu08a #correlation #random #simulation
- Spatial Correlation Extraction via Random Field Simulation and Production Chip Performance Regression (BL), pp. 527–532.
- DATE-2008-LuMGB #algorithm #for free
- An efficient algorithm for free resources management on the FPGA (YL, TM, GG, KB), pp. 1095–1098.
- DATE-2008-MayerH #architecture #optimisation
- System Performance Optimization Methodology for Infineon’s 32-Bit Automotive Microcontroller Architecture (AM, FH), pp. 962–966.
- DATE-2008-PradhanV #synthesis #using
- Fast Analog Circuit Synthesis Using Sensitivity Based Near Neighbor Searches (AP, RV), pp. 523–526.
- DATE-2008-QuSN #configuration management #runtime
- Improving the Efficiency of Run Time Reconfigurable Devices by Configuration Locking (YQ, JPS, JN), pp. 264–267.
- DATE-2008-SilvaPS #analysis #power management #representation
- Efficient Representation and Analysis of Power Grids (JMSS, JRP, LMS), pp. 420–425.
- DATE-2008-SingheeSR #correlation #kernel #statistics
- Exploiting Correlation Kernels for Efficient Handling of Intra-Die Spatial Correlation, with Application to Statistical Timing (AS, SS, RAR), pp. 856–861.
- DATE-2008-ThoguluvaRC #architecture #programmable #security #using
- Efficient Software Architecture for IPSec Acceleration Using a Programmable Security Processor (JT, AR, STC), pp. 1148–1153.
- DATE-2008-VinkBW #analysis #architecture
- Performance Analysis of SoC Architectures Based on Latency-Rate Servers (JPV, KvB, PvdW), pp. 200–205.
- DATE-2008-WangKABT #approach #energy #modelling #optimisation
- Integrated approach to energy harvester mixed technology modelling and performance optimisation (LW, TJK, BMAH, SPB, RNT), pp. 704–709.
- DATE-2008-WuH #algorithm #design #validation
- Efficient Design Validation Based on Cultural Algorithms (WW, MSH), pp. 402–407.
- DATE-2008-ZhangYWYJX #correlation #process #statistics
- An Efficient Method for Chip-Level Statistical Capacitance Extraction Considering Process Variations with Spatial Correlation (WZ, WY, ZW, ZY, RJ, JX), pp. 580–585.
- HPCA-2008-DasMNPNIYD #architecture #optimisation
- Performance and power optimization through data compression in Network-on-Chip architectures (RD, AKM, CN, DP, VN, RRI, MSY, CRD), pp. 215–225.
- HPCA-2008-KimGWB #analysis #using
- System level analysis of fast, per-core DVFS using on-chip switching regulators (WK, MSG, GYW, DMB), pp. 123–134.
- HPCA-2008-RamirezPSV #smt #thread
- Runahead Threads to improve SMT performance (TR, AP, OJS, MV), pp. 149–158.
- HPCA-2008-SalverdaZ #constraints
- Fundamental performance constraints in horizontal fusion of in-order cores (PS, CBZ), pp. 252–263.
- HPCA-2008-WangC #clustering #feedback #optimisation
- Cluster-level feedback power control for performance optimization (XW, MC), pp. 101–110.
- HPDC-2008-HeSWF #approximate #automation #recognition #test coverage
- Code coverage, performance approximation and automatic recognition of idioms in scientific applications (JH, AS, RFVdW, MAF), pp. 223–224.
- HPDC-2008-IosupSAE #distributed #scalability
- The performance of bags-of-tasks in large-scale distributed systems (AI, OOS, SA, DHJE), pp. 97–108.
- HPDC-2008-ManosMKCKT #distributed #using
- Distributed mpi cross-site run performance using mpig (SM, MDM, OK, PVC, NTK, BRT), pp. 229–230.
- HPDC-2008-WangWG #named #network
- XenLoop: a transparent high performance inter-vm network loopback (JW, KLW, KG), pp. 109–118.
- HPDC-2008-XiaFJTW #approach #correlation #evaluation #file system #mining #named #novel #optimisation
- FARMER: a novel approach to file access correlation mining and evaluation reference model for optimizing peta-scale file system performance (PX, DF, HJ, LT, FW), pp. 185–196.
- ISMM-2008-McIlroyDS #memory management
- Efficient dynamic heap allocation of scratch-pad memory (RM, PD, JS), pp. 31–40.
- LCTES-2008-HomayounPMV #adaptation #embedded #energy
- Improving performance and reducing energy-delay with adaptive resource resizing for out-of-order embedded processors (HH, SP, MAM, AVV), pp. 71–78.
- LCTES-2008-LeeKJKEKH #architecture #embedded #named
- FaCSim: a fast and cycle-accurate architecture simulator for embedded systems (JL, JK, CJ, SK, BE, KK, SH), pp. 89–100.
- OSDI-2008-MaoJM #named #state machine
- Mencius: Building Efficient Replicated State Machine for WANs (YM, FPJ, KM), pp. 369–384.
- OSDI-2008-ZahariaKJKS #pipes and filters
- Improving MapReduce Performance in Heterogeneous Environments (MZ, AK, ADJ, RHK, IS), pp. 29–42.
- PDP-2008-AgulleiroGGF #re-engineering
- Fast Tomographic Reconstruction with Vectorized Backprojection (JIAB, EMG, IG, JJF), pp. 387–390.
- PDP-2008-AlbrechtRKPM #analysis #configuration management #framework #platform #runtime
- Performance Analysis of Bus-Based Interconnects for a Run-Time Reconfigurable Co-Processor Platform (CA, PR, RK, TP, EM), pp. 200–205.
- PDP-2008-AyusoGL #clustering #named
- FT-FW: Efficient Connection Failover in Cluster-based Stateful Firewalls (PNA, RMG, LL), pp. 573–580.
- PDP-2008-BeckerFW #evaluation #grid #optimisation #parallel
- Performance Evaluation and Optimization of Parallel Grid Computing Applications (DB, WF, FW), pp. 193–199.
- PDP-2008-BerbecaruA #using
- An Optimized Double Cache Technique for Efficient Use of Forward-secure Signature Schemes (DB, LA), pp. 581–589.
- PDP-2008-BorkowskiT #adaptation #integration #parallel
- Tuning the Efficiency of Parallel Adaptive Integration with Synchronizers (JB, MT), pp. 351–357.
- PDP-2008-CasaleCT #estimation #modelling #network #robust
- Robust Workload Estimation in Queueing Network Performance Models (GC, PC, RT), pp. 183–187.
- PDP-2008-CeccatoNT #trust #verification
- Distributing Trust Verification to Increase Application Performance (MC, JN, PT), pp. 604–610.
- PDP-2008-GoumasKAKK #comprehension #multi
- Understanding the Performance of Sparse Matrix-Vector Multiplication (GIG, KK, NA, VK, NK), pp. 283–292.
- PDP-2008-KiasariRSH #markov
- A Markovian Performance Model for Networks-on-Chip (AEK, DR, HSA, SH), pp. 157–164.
- PDP-2008-KonningESG
- Virtualized Environments for the Harness High Performance Computing Workbench (BK, CE, SLS, AG), pp. 133–140.
- PDP-2008-LiuWLLL #execution
- Improving the Performance of Service-based Applications by Dynamic Service Execution (HL, XW, TL, XL, WL), pp. 174–182.
- PDP-2008-Martinez-YelmoCGM #network
- Routing Performance in a Hierarchical DHT-based Overlay Network (IMY, RCR, CG, AM), pp. 508–515.
- PDP-2008-NoguchiDB #migration #pointer #process
- Efficient Global Pointers With Spontaneous Process Migration (KN, MBD, LB), pp. 87–94.
- PDP-2008-TaillardGD #approach #framework #using #visual notation
- A Graphical Framework for High Performance Computing Using An MDE Approach (JT, FG, JLD), pp. 165–173.
- PDP-2008-ValleeNEOS
- System-Level Virtualization for High Performance Computing (GV, TN, CE, HO, SLS), pp. 636–643.
- PDP-2008-VazquezHML #grid
- A Performance Model for Federated Grid Infrastructures (CV, EH, RSM, IML), pp. 188–192.
- PPoPP-2008-DiamondRKGGB #algebra #distributed #linear
- High performance dense linear algebra on a spatially distributed processor (JRD, BR, SWK, RAvdG, KG, DB), pp. 63–72.
- PPoPP-2008-FelberFR #memory management #transaction
- Dynamic performance tuning of word-based software transactional memory (PF, CF, TR), pp. 237–246.
- PPoPP-2008-GiacomoniMV #concurrent #parallel #pipes and filters #queue
- FastForward for efficient pipeline parallelism: a cache-optimized concurrent lock-free queue (JG, TM, MV), pp. 43–52.
- PPoPP-2008-MaratheM #memory management #towards #transaction
- Toward high performance nonblocking software transactional memory (VJM, MM), pp. 227–236.
- PPoPP-2008-NishtalaAC #communication #layout
- Performance without pain = productivity: data layout and collective communication in UPC (RN, GA, CC), pp. 99–110.
- PPoPP-2008-PatrickSK #communication
- Enhancing the performance of MPI-IO applications by overlapping I/O, computation and communication (CMP, SWS, MTK), pp. 277–278.
- PPoPP-2008-RyooRBSKH #evaluation #gpu #optimisation #parallel #thread #using
- Optimization principles and application performance evaluation of a multithreaded GPU using CUDA (SR, CIR, SSB, SSS, DBK, WmWH), pp. 73–82.
- ESOP-2008-Muller-OlmS #interprocedural
- Upper Adjoints for Fast Inter-procedural Variable Equalities (MMO, HS), pp. 178–192.
- STOC-2008-DaitchS #algorithm #approximate
- Faster approximate lossy generalized flow via interior point algorithms (SID, DAS), pp. 451–460.
- STOC-2008-DeKSS #composition #integer #multi #using
- Fast integer multiplication using modular arithmetic (AD, PPK, CS, RS), pp. 499–506.
- STOC-2008-Umans #composition #polynomial
- Fast polynomial factorization and modular composition in small characteristic (CU), pp. 481–490.
- TACAS-2008-ChocklerGY #automation #refinement #using
- Efficient Automatic STE Refinement Using Responsibility (HC, OG, AY), pp. 233–248.
- TACAS-2008-CimattiGS #generative #modulo theories #satisfiability
- Efficient Interpolant Generation in Satisfiability Modulo Theories (AC, AG, RS), pp. 397–412.
- TACAS-2008-KupferschmidHL #abstraction #model checking
- Fast Directed Model Checking Via Russian Doll Abstraction (SK, JH, KGL), pp. 203–217.
- TACAS-2008-MouraB #named #smt
- Z3: An Efficient SMT Solver (LMdM, NB), pp. 337–340.
- CAV-2008-JainCG #composition #equation #linear
- Efficient Craig Interpolation for Linear Diophantine (Dis)Equations and Linear Modular Equations (HJ, EMC, OG), pp. 254–267.
- CAV-2008-KupferschmidWNP #question
- Faster Than Uppaal? (SK, MW, BN, AP), pp. 552–555.
- ICLP-2008-KimmigCRDR #execution #on the #source code
- On the Efficient Execution of ProbLog Programs (AK, VSC, RR, BD, LDR), pp. 175–189.
- ICLP-2008-ZhangYLM #algorithm #constraints #functional
- Efficient Algorithms for Functional Constraints (YZ, RHCY, CL, SM), pp. 606–620.
- ICST-2008-BeerM #dependence #generative #testing
- Efficient Test Data Generation for Variables with Complex Dependencies (AB, SM), pp. 3–11.
- IJCAR-2008-DarvasMR
- Efficient Well-Definedness Checking (ÁD, FM, AR), pp. 100–115.
- IJCAR-2008-Otten #agile #logic #proving #theorem proving
- leanCoP 2.0and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (JO), pp. 283–291.
- ISSTA-2008-ElkarabliehMK #constraints
- Efficient solving of structural constraints (BE, DM, SK), pp. 39–50.
- SAT-2008-DavisTYZ #design #hardware #satisfiability
- Designing an Efficient Hardware Implication Accelerator for SAT Solving (JDD, ZT, FY, LZ), pp. 48–62.
- SAT-2008-MaarenW
- Finding Guaranteed MUSes Fast (HvM, SW), pp. 291–304.
TestCom-FATES-2008-DinSP #design #implementation #multi #process- Performance Test Design Process and Its Implementation Patterns for Multi-services Systems (GD, IS, RP), pp. 135–152.
- CBSE-2007-LiuZG #assessment #case study #experience
- Performance Assessment for e-Government Services: An Experience Report (YL, LZ, IG), pp. 74–89.
- QoSA-2007-KoziolekBH #architecture #component #predict
- Predicting the Performance of Component-Based Software Architectures with Different Usage Profiles (HK, SB, JH), pp. 145–163.
- QoSA-2007-MarzollaM #predict #web #web service #workflow
- Performance Prediction of Web Service Workflows (MM, RM), pp. 127–144.
- QoSA-2007-Woodside #architecture
- Resource Architecture and Continuous Performance Engineering (CMW), pp. 1–14.
- WICSA-2007-Apte #analysis #distributed
- Performance Analysis of Distributed Software Systems: Approaches Based on Queueing Theory (VA), p. 39.
- WICSA-2007-Bondi #reliability #requirements
- Best Practices for Writing and Managing Performance, Reliability, and Availability Requirements (ABB), p. 42.
- DocEng-2007-BultermanJCC #multi
- An efficient, streamable text format for multimedia captions and subtitles (DCAB, AJJ, PC, SCL), pp. 101–110.
- ECDL-2007-VuongLSCCGTZ #approach #maintenance #metadata #web
- Key Element-Context Model: An Approach to Efficient Web Metadata Maintenance (BQV, EPL, AS, CHC, KC, DHLG, YLT, JZ), pp. 63–74.
- ICDAR-2007-AntonacopoulosB #analysis #framework #layout
- Performance Analysis Framework for Layout Analysis Methods (AA, DB), pp. 1258–1262.
- ICDAR-2007-FerrerV #evaluation #segmentation
- Combination of OCR Engines for Page Segmentation Based on Performance Evaluation (MF, EV), pp. 784–788.
- ICDAR-2007-LiLT #keyword
- A Fast Keyword-Spotting Technique (LL, SJL, CLT), pp. 68–72.
- ICDAR-2007-LuWT #detection #documentation
- Fast and Accurate Detection of Document Skew and Orientation (SJL, JW, CLT), pp. 684–688.
- ICDAR-2007-MakridisNG #documentation #segmentation #word
- An Efficient Word Segmentation Technique for Historical and Degraded Machine-Printed Documents (MM, NAN, BG), pp. 178–182.
- ICDAR-2007-MaWXD #algorithm #evaluation #locality
- Usage-Oriented Performance Evaluation for Text Localization Algorithms (YM, CW, BX, RD), pp. 1033–1037.
- ICDAR-2007-MelloBZM #algorithm
- An Efficient Thresholding Algorithm for Brazilian Bank Checks (CABM, BLDB, CZ, VM), pp. 193–197.
- ICDAR-2007-SchulzMM #precise #set
- Fast Selection of Small and Precise Candidate Sets from Dictionaries for Text Correction Tasks (KUS, SM, PM), pp. 471–475.
- ICDAR-2007-Silva #analysis #documentation #metric
- New Metrics for Evaluating Performance in Document Analysis Tasks_Application to the Table Case (ACeS), pp. 481–485.
- ICDAR-2007-SilvaN #classification #markov #modelling #visualisation
- A Visualization Tool to Improve the Performance of a Classifier Based on Hidden Markov Models (GdS, MN), pp. 1083–1087.
- ICDAR-2007-VamvakasGPS #feature model #recognition #reduction
- An Efficient Feature Extraction and Dimensionality Reduction Scheme for Isolated Greek Handwritten Character Recognition (GV, BG, SP, NS), pp. 1073–1077.
- ICDAR-2007-VargasFTA07a #image #verification
- Off-line Signature Verification System Performance against Image Acquisition Resolution (JFVB, MAFB, CMTG, JBA), pp. 834–838.
- ICDAR-2007-WangW
- A High Performance European OCR System (KW, QW), pp. 232–236.
- ICDAR-2007-WeinmanLH #recognition
- Fast Lexicon-Based Scene Text Recognition with Sparse Belief Propagation (JJW, EGLM, ARH), pp. 979–983.
- JCDL-2007-DakkaG #online
- Efficient summarization-aware search for online news articles (WD, LG), pp. 63–72.
- JCDL-2007-FallenN #distributed #web
- Distributed web search efficiency by truncating results (CTF, GBN), pp. 195–203.
- JCDL-2007-SongHCLG #ambiguity #topic
- Efficient topic-based unsupervised name disambiguation (YS, JH, IGC, JL, CLG), pp. 342–351.
- JCDL-2007-TakedaT #clustering #named #summary #using
- UpdateNews: a news clustering and summarization system using efficient text processing (TT, AT), pp. 438–439.
- JCDL-2007-Winget #collaboration #library
- Annotation functionality for digital libraries supporting collaborative performance: an example of musical scores (MAW), pp. 305–306.
- JCDL-2007-YanLKG #adaptation
- Adaptive sorted neighborhood methods for efficient record linkage (SY, DL, MYK, CLG), pp. 185–194.
- SIGMOD-2007-BandiMAA #algorithm #data type #using
- Fast data stream algorithms using associative memories (NB, AM, DA, AEA), pp. 247–256.
- SIGMOD-2007-ChanN #xml
- Efficient xml data dissemination with piggybacking (CYC, YN), pp. 737–748.
- SIGMOD-2007-CongFK #distributed #evaluation #query
- Distributed query evaluation with performance guarantees (GC, WF, AK), pp. 509–520.
- SIGMOD-2007-CrainiceanuLMGS #named #robust
- P-ring: an efficient and robust P2P range index structure (AC, PL, AM, JG, JS), pp. 223–234.
- SIGMOD-2007-GeorgiadisV #relational #xpath
- Xpath on steroids: exploiting relational engines for xpath performance (HG, VV), pp. 317–328.
- SIGMOD-2007-GouC #algorithm #xpath
- Efficient algorithms for evaluating xpath over streams (GG, RC), pp. 269–280.
- SIGMOD-2007-LiuKWAA #effectiveness #xml
- Effective and efficient update of xml in RDBMS (ZHL, MK, JWW, RA, VA), pp. 925–936.
- SIGMOD-2007-MorseP #similarity
- An efficient and accurate method for evaluating time series similarity (MDM, JMP), pp. 569–580.
- SIGMOD-2007-MurthyS #data access #flexibility
- Flexible and efficient access control in oracle (RM, ES), pp. 973–980.
- SIGMOD-2007-SolimanIC #database #evaluation #named #nondeterminism #query
- URank: formulation and efficient evaluation of top-k queries in uncertain databases (MAS, IFI, KCCC), pp. 1082–1084.
- SIGMOD-2007-TrisslL #graph #query #scalability
- Fast and practical indexing and querying of very large graphs (ST, UL), pp. 845–856.
- SIGMOD-2007-ZhouLFL #query
- Efficient exploitation of similar subexpressions for query processing (JZ, PÅL, JCF, WL), pp. 533–544.
- SIGMOD-2007-ZhouQGZ #distributed #named
- Sonnet: an efficient distributed content-based dissemination broker (AZ, WQ, XG, MZ), pp. 1094–1096.
- VLDB-2007-BerberichBNW #named
- FluxCapacitor: Efficient Time-Travel Text Search (KB, SJB, TN, GW), pp. 1414–1417.
- VLDB-2007-BhattacharjeeMLMKBK #clustering #multi
- Efficient Bulk Deletes for Multi Dimensionally Clustered Tables in DB2 (BB, TM, SL, SM, JAK, RVB, JK), pp. 1197–1206.
- VLDB-2007-BiveinisSJ #in memory
- Main-Memory Operation Buffering for Efficient R-Tree Update (LB, SS, CSJ), pp. 591–602.
- VLDB-2007-ChaudhuriCGK #design #query
- Example-driven design of efficient record matching queries (SC, BCC, VG, RK), pp. 327–338.
- VLDB-2007-Chen0LLY #similarity
- Indexable PLA for Efficient Similarity Search (QC, LC, XL, YL, JXY), pp. 435–446.
- VLDB-2007-ChenCB #estimation
- A Simple and Efficient Estimation Method for Stream Expression Cardinalities (AC, JC, TB), pp. 171–182.
- VLDB-2007-DellisS #query
- Efficient Computation of Reverse Skyline Queries (ED, BS), pp. 291–302.
- VLDB-2007-GedikBY #named #sorting
- CellSort: High Performance Sorting on the Cell Processor (BG, RB, PSY), pp. 1286–1207.
- VLDB-2007-GhinitaKKM
- Fast Data Anonymization with Low Information Loss (GG, PK, PK, NM), pp. 758–769.
- VLDB-2007-GonzalezHLMS #adaptation #approach #mining #network
- Adaptive Fastest Path Computation on a Road Network: A Traffic Mining Approach (HG, JH, XL, MM, JPS), pp. 794–805.
- VLDB-2007-LitwinMRS #algebra #string #using
- Fast nGram-Based String Search Over Data Encoded Using Algebraic Signatures (WL, RM, PR, TJES), pp. 207–218.
- VLDB-2007-LiWY #approximate #named #query #string #using
- VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams (CL, BW, XY), pp. 303–314.
- VLDB-2007-LvJWCL #multi #similarity
- Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search (QL, WJ, ZW, MC, KL), pp. 950–961.
- VLDB-2007-ManolescuM #assessment #database #evaluation #question #research
- Performance Evaluation and Experimental Assessment — Conscience or Curse of Database Research? (IM, SM), pp. 1441–1442.
- VLDB-2007-MorsePJ
- Efficient Skyline Computation over Low-Cardinality Domains (MDM, JMP, HVJ), pp. 267–278.
- VLDB-2007-PapadomanolakisDA #automation #database #design #query #using
- Efficient Use of the Query Optimizer for Automated Database Design (SP, DD, AA), pp. 1093–1104.
- VLDB-2007-ShaoGBBCYS #keyword #xml
- Efficient Keyword Search over Virtual XML Views (FS, LG, CB, AB, MC, FY, JS), pp. 1057–1068.
- VLDB-2007-TatbulCZ #distributed
- Staying FIT: Efficient Load Shedding Techniques for Distributed Stream Processing (NT, UÇ, SBZ), pp. 159–170.
- VLDB-2007-WongTFX #on the
- On Efficient Spatial Matching (RCWW, YT, AWCF, XX), pp. 579–590.
- VLDB-2007-YiuM #multi #query
- Efficient Processing of Top-k Dominating Queries on Multi-Dimensional Data (MLY, NM), pp. 483–494.
- VLDB-2007-ZhangB #distributed #named #xquery
- XRPC: Interoperable and Efficient Distributed XQuery (YZ, PAB), pp. 99–110.
- ITiCSE-2007-AdelmannBL #animation #framework #idea #interactive #named #sketching
- IDEA: a framework for the fast creation of interactive animations by pen sketching (RA, TB, TL), pp. 291–295.
- ITiCSE-2007-ChinnSM #algorithm #data type #problem #student
- Problem solving and student performance in data structures and algorithms (DDC, CS, KM), pp. 241–245.
- ITiCSE-2007-Govender #assessment #comprehension #programming #student
- Understanding students’ performance in programming assessment questions (IG), p. 326.
- ITiCSE-2007-RosslingKS #algorithm #animation #flexibility #generative
- Easy, fast, and flexible algorithm animation generation (GR, SK, SS), p. 357.
- SIGITE-2007-Courte #online #process #student
- Comparing student acceptance and performance of online activities to classroom activities (JEC), pp. 185–190.
- SIGITE-2007-DarrahSP #collaboration
- Enabling collaboration in high performance computing (MD, FLVS, PP), pp. 37–40.
- SIGITE-2007-KaneS #data transformation #distributed
- Integrating bioinformatics, distributed data management, and distributed computing for applied training in high performance computing (MDK, JAS), pp. 33–36.
- ICSM-2007-ArchuletaTF #architecture #composition #sequence
- A Maintainable Software Architecture for Fast and Modular Bioinformatics Sequence Search (JSA, ET, WcF), pp. 144–153.
- ICSM-2007-NagarajanJGG #debugging #named #online
- ONTRAC: A system for efficient ONline TRACing for debugging (VN, DJ, RG, NG), pp. 445–454.
- SCAM-2007-MolinaS #approximate #open source #source code #using
- Fast Approximate Matching of Programs for Protecting Libre/Open Source Software by Using Spatial Indexes (AJMM, TS), pp. 111–122.
- WCRE-2007-Mobley #reverse engineering
- Reverse Engineering for Software Performance Engineering (KM), pp. 302–304.
- CIAA-J-2006-BallaRM07 #algorithm
- Efficient Algorithms for degenerate Primer Search (SB, SR, IIM), pp. 899–910.
- CIAA-2007-AckermanS #regular expression
- Efficient Enumeration of Regular Languages (MA, JS), pp. 226–242.
- CIAA-2007-AllauzenRSSM #finite #library #named #transducer
- OpenFst: A General and Efficient Weighted Finite-State Transducer Library (CA, MR, JS, WS, MM), pp. 11–23.
- CIAA-2007-CaucalCFR #context-free grammar #throughput
- Efficient Computation of Throughput Values of Context-Free Languages (DC, JC, WF, WR), pp. 203–213.
- DLT-2007-ChamparnaudOZ #equation
- An Efficient Computation of the Equation K-Automaton of a Regular K-Expression (JMC, FO, DZ), pp. 145–156.
- ICALP-2007-KontogiannisS #algorithm #approximate #constant #game studies
- Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games (SCK, PGS), pp. 595–606.
- LATA-2007-KutribM #automaton #recognition #using
- Fast Reversible Language Recognition Using Cellular Automata (MK, AM), pp. 331–342.
- LATA-2007-OgasawaraK #approximate #product line
- Stochastically Approximating Tree Grammars by Regular Grammars and Its Application to Faster ncRNA Family Annotation (KO, SK), pp. 461–472.
- RTA-2007-BoichutGJR #approximate #prototype
- Rewriting Approximations for Fast Prototyping of Static Analyzers (YB, TG, TPJ, LLR), pp. 48–62.
- SFM-2007-Ciardo #approach #data transformation #diagrams #representation
- Data Representation and Efficient Solution: A Decision Diagram Approach (GC), pp. 371–394.
- SFM-2007-GribaudoT #analysis #modelling
- Fluid Models in Performance Analysis (MG, MT), pp. 271–317.
- SFM-2007-KnottenbeltB #modelling #scalability
- Tackling Large State Spaces in Performance Modelling (WJK, JTB), pp. 318–370.
- SFM-2007-Smith #problem
- Introduction to Software Performance Engineering: Origins and Outstanding Problems (CUS), pp. 395–428.
- SFM-2007-Stewart #markov #modelling
- Performance Modelling and Markov Chains (WJS), pp. 1–33.
- ICFP-2007-MarlowYJ #lazy evaluation #pointer #using
- Faster laziness using dynamic pointer tagging (SM, ARY, SLPJ), pp. 277–288.
- ILC-2007-Latendresse #compilation #comprehension #lisp
- Simple and efficient compilation of list comprehension in common Lisp (ML), p. 12.
- DiGRA-2007-Jockel #experience #game studies #online #overview #video
- The Impact of Experience: The Influences of User and Online Review Ratings on the Performance of Video Games in the US Market (SJ).
AGTIVE-2007-GeissK #graph grammar- GrGen.NET: A Fast, Expressive, and General Purpose Graph Rewrite Tool (RG, MK), pp. 568–569.
- AGTIVE-2007-MatznerMS #automation #graph
- Efficient Graph Matching with Application to Cognitive Automation (AM, MM, AS), pp. 297–312.
- CHI-2007-Aoki
- Back stage on the front lines: perspectives and performance in the combat information center (PMA), pp. 717–726.
- CHI-2007-BallNB #navigation #physics #scalability
- Move to improve: promoting physical navigation to increase user performance with large displays (RB, CN, DAB), pp. 191–200.
- CHI-2007-CaoZ #gesture #modelling
- Modeling human performance of pen stroke gestures (XC, SZ), pp. 1495–1504.
- CHI-2007-CockburnGG #predict
- A predictive model of menu performance (AC, CG, SG), pp. 627–636.
- CHI-2007-SalvucciMZB
- iPod distraction: effects of portable music-player use on driver performance (DDS, DM, MZ, DPB), pp. 243–250.
- CHI-2007-XiaoSC #interactive
- The role of choice and customization on users’ interaction with embodied conversational agents: effects on perception and performance (JX, JTS, RC), pp. 1293–1302.
- DHM-2007-EstevesKZW #case study #industrial #modelling
- Applied User Performance Modeling in Industry — A Case Study from Medical Imaging (ME, TK, SZ, AW), pp. 576–585.
- DHM-2007-KukulaED #interactive
- The Effects of Human Interaction on Biometric System Performance (EPK, SJE, VGD), pp. 904–914.
- DHM-2007-ShuF #modelling #multi
- Modeling of Multi-organization Performance for Emergency Response (YS, KF), pp. 511–520.
- DHM-2007-SongLM #algorithm #estimation
- A Fast Motion Estimation Algorithm for H.264 (JS, BL, QlM), pp. 189–196.
- DHM-2007-Su #detection #precise
- Enhancing Sense of Reality by Efficient and Precise Collision Detection in Virtual Environments (CJS), pp. 969–978.
- DHM-2007-XiangZ07a #database #retrieval #scalability
- Motion Retrieval Based on an Efficient Index Method for Large-Scale Mocap Database (JX, HZ), pp. 234–242.
- HCI-AS-2007-AlTaboliA #consistency #design #interface #physics #web
- Effect of Physical Consistency of Web Interface Design on Users’ Performance and Satisfaction (AA, MRAZ), pp. 849–858.
- HCI-AS-2007-Hsu #visual notation
- The Effects of Visual Versus Verbal Metaphors on Novice and Expert Learners’ Performance (YcH), pp. 264–269.
- HCI-AS-2007-WeiXL #multi #named
- Stripe-Cache: An Efficient Cache Scheme for Building Multimedia Oriented RAID System (QW, CX, XL), pp. 1130–1139.
- HCI-AS-2007-ZhangOD #automation #communication #evaluation
- Performance Evaluation for Automatic Protection Switching in a CDMA-TDD Wireless Communication System (LZ, HO, TD), pp. 1200–1209.
- HCI-IDU-2007-KangY #difference
- Age Differences in Performance, Operation Methods, and Workload While Interacting with an MP3 Player (NEK, WCY), pp. 854–861.
- HCI-IDU-2007-SatoFWJAWR #web
- The Impact of Moving Around and Zooming of Objects on Users’ Performance in Web Pages: A Cross-Generation Study (HS, KF, LW, LJ, YA, MW, PLPR), pp. 921–928.
- HCI-IDU-2007-UranoM #evaluation
- Human Performance Model and Evaluation of PBUI (NU, KM), pp. 652–661.
- HCI-IPT-2007-HsiehLCHC #automation
- Reading Performance of Chinese Text with Automatic Scrolling (YHH, CJL, HCC, TTH, JCC), pp. 311–319.
- HCI-MIE-2007-Behringer #gesture #interactive #music
- Gesture Interaction for Electronic Music Performance (RB), pp. 564–572.
- HCI-MIE-2007-KimLRHH #analysis #design #network #quality #speech
- Performance Analysis of Perceptual Speech Quality and Modules Design for Management over IP Network (JK, HWL, WR, SHH, MH), pp. 84–93.
- HCI-MIE-2007-PeterSVUNJKG #detection #monitoring #usability
- EREC-II in Use — Studies on Usability and Suitability of a Sensor System for Affect Detection and Human Performance Monitoring (CP, RS, JV, BU, NN, HJ, KK, RG), pp. 465–474.
- HIMI-IIE-2007-HoriguchiASTNHK #interface #multi
- Ecological Interface to Enhance User Performance in Adjusting Computer-Controlled Multihead Weigher (YH, RA, TS, YT, KN, NH, HK), pp. 883–892.
- HIMI-IIE-2007-PohlTM #multi
- Efficient Creation of Multi Media eLearning Modules (HMP, PT, JTM), pp. 457–465.
- HIMI-IIE-2007-RheeCB #approach #process
- A More Comprehensive Approach to Enhancing Business Process Efficiency (SHR, NWC, HB), pp. 955–964.
- HIMI-IIE-2007-ShinPCC #ad hoc #energy #human-computer #mobile #network
- Energy Efficient Route Discovery for Mobile HCI in Ad-Hoc Networks (KS, KP, MYC, HC), pp. 635–644.
- HIMI-MTT-2007-KimK #ad hoc #mobile #network
- Distance-Based Bloom Filter for an Efficient Search in Mobile Ad Hoc Networks (BK, KK), pp. 471–479.
- HIMI-MTT-2007-MorganWKP #information management
- Harder to Access, Better Performance? The Effects of Information Access Cost on Strategy and Performance (PLM, SMW, SLK, JP), pp. 115–125.
- HIMI-MTT-2007-NakayasuNH #analysis #communication #metric
- Measurement and Analysis of Performance of Human Perception for Information Communication Technology (HN, MN, HH), pp. 126–135.
- HIMI-MTT-2007-OehlSZ #how #interface
- Considerations on Efficient Touch Interfaces — How Display Size Influences the Performance in an Applied Pointing Task (MO, CS, MZ), pp. 136–143.
- HIMI-MTT-2007-SeoKKJ #ubiquitous
- Performance Improvement of SCTP for Heterogeneous Ubiquitous Environment (DWS, HK, JK, JJ), pp. 747–754.
- EDOC-2007-TakaseT #framework #web #web service
- Efficient Web Services Message Exchange by SOAP Bundling Framework (TT, KT), pp. 63–74.
- ICEIS-AIDSS-2007-DanielsC #benchmark #case study #contest #generative #metric #modelling
- Explanation Generation in Business Performance Models — With a Case Study in Competition Benchmarking (HD, EC), pp. 119–128.
- ICEIS-AIDSS-2007-Dignum #approach
- Knowledge Sharing and Organizational Performance — An Agent-mediated Approach (VD), pp. 504–509.
- ICEIS-AIDSS-2007-HouariF #approach #collaboration
- An Agent-Based Approach to Support Performance Management for Dynamic and Collaborative Work (NH, BHF), pp. 178–184.
- ICEIS-AIDSS-2007-SohniusJME #analysis #approach #assessment #design #simulation
- An Approach for Assessing Design Systems: Design System Simulation and Analysis for Performance Assessment (RS, EJ, WEM, VE), pp. 231–236.
- ICEIS-EIS-2007-KorherrL #metric #process
- Extending the EPC and the BPMN with Business Process Goals and Performance Measures (BK, BL), pp. 287–294.
- ICEIS-HCI-2007-AkoumianakisVVMK #collaboration #framework #social
- Experience-Based Social and Collaborative Performance in an “Electronic Village” of Local Interest: The EKONES Framework (DA, NV, GV, GM, DK), pp. 117–122.
- ICEIS-HCI-2007-ChungH #network #social
- The Effect of ICT Enabled Social Networks on Performance (KSKC, LH), pp. 105–110.
- ICEIS-SAIC-2007-RaymondB #development
- Strategic Alignment of E-Business Development — Performance Outcomes for Manufacturing SMEs (LR, FB), pp. 78–83.
- ICEIS-SAIC-2007-ZhangJLF
- An Efficient System for EJB Mobilization (LZ, BJ, LL, YF), pp. 173–178.
- CIKM-2007-AngiulliF #mining
- Very efficient mining of distance-based outliers (FA, FF), pp. 791–800.
- CIKM-2007-BastMW #interactive #query
- Efficient interactive query expansion with complete search (HB, DM, IW), pp. 857–860.
- CIKM-2007-BhowmickLS #evaluation #xml
- Efficient evaluation of high-selective xml twig patterns with parent child edges in tree-unaware rdbms (SSB, EL, HS), pp. 673–682.
- CIKM-2007-ChanZ #algorithm #evaluation #query
- A fast unified optimal route query evaluation algorithm (EPFC, JZ), pp. 371–380.
- CIKM-2007-Chu-CarrollP #case study #information management #semantics
- An experimental study of the impact of information extraction accuracy on semantic search performance (JCC, JMP), pp. 505–514.
- CIKM-2007-EavisT #named
- Mapgraph: efficient methods for complex olap hierarchies (TE, AT), pp. 465–474.
- CIKM-2007-GuoCXW #maintenance #online #using
- Efficient on-line index maintenance for dynamic text collections by using dynamic balancing tree (RG, XC, HX, BW), pp. 751–760.
- CIKM-2007-RaghuveerJMDD #approach #semistructured data #towards
- Towards efficient search on unstructured data: an intelligent-storage approach (AR, MJ, MFM, BKD, DHCD), pp. 951–954.
- CIKM-2007-VieiraFDGRR #network #ranking #social
- Efficient search ranking in social networks (MVV, BMF, RD, PBG, DdCR, BARN), pp. 563–572.
- CIKM-2007-XuP #keyword #xml
- Efficient LCA based keyword search in xml data (YX, YP), pp. 1007–1010.
- CIKM-2007-ZhangW #algorithm #approximate #data type
- An efficient algorithm for approximate biased quantile computation in data streams (QZ, WW), pp. 1023–1026.
- ECIR-2007-CachedaCPO #clustering #comparison #information retrieval
- Performance Comparison of Clustered and Replicated Information Retrieval Systems (FC, VC, VP, IO), pp. 124–135.
- ECIR-2007-HerscoviciLY #documentation #sequence #version control
- Efficient Indexing of Versioned Document Sequences (MH, RL, SY), pp. 76–87.
- ECIR-2007-LiuYZQM #clustering #optimisation #scalability
- Fast Large-Scale Spectral Clustering by Sequential Shrinkage Optimization (TYL, HYY, XZ, TQ, WYM), pp. 319–330.
- ECIR-2007-WeiC #ad hoc #framework #modelling #retrieval
- Modeling Term Associations for Ad-Hoc Retrieval Performance Within Language Modeling Framework (XW, WBC), pp. 52–63.
- ECIR-2007-ZhangZC #scalability #using
- Efficient Construction of FM-index Using Overlapping Block Processing for Large Scale Texts (DZ, YZ, JC), pp. 113–123.
- ICML-2007-DelageM #markov #nondeterminism #optimisation #process
- Percentile optimization in uncertain Markov decision processes with application to efficient exploration (ED, SM), pp. 225–232.
- ICML-2007-EspositoR #algorithm #classification #evaluation #named
- CarpeDiem: an algorithm for the fast evaluation of SSL classifiers (RE, DPR), pp. 257–264.
- ICML-2007-GuptaDS #clique
- Efficient inference with cardinality-based clique potentials (RG, AAD, SS), pp. 329–336.
- ICML-2007-KramerB #kernel
- Kernelizing PLS, degrees of freedom, and efficient model selection (NK, MLB), pp. 441–448.
- ICML-2007-MoschittiZ #effectiveness #kernel #learning #relational
- Fast and effective kernels for relational learning from texts (AM, FMZ), pp. 649–656.
- ICML-2007-ParkerFT #learning #query #retrieval
- Learning for efficient retrieval of structured data with noisy queries (CP, AF, PT), pp. 729–736.
- ICML-2007-RakotomamonjyBCG #kernel #learning #multi
- More efficiency in multiple kernel learning (AR, FRB, SC, YG), pp. 775–782.
- ICML-2007-SuttonM #pseudo #random
- Piecewise pseudolikelihood for efficient training of conditional random fields (CAS, AM), pp. 863–870.
- ICML-2007-YoganandaMG #linear
- A fast linear separability test by projection of positive points on subspaces (APY, MNM, LG), pp. 713–720.
- KDD-2007-AgarwalBGYKS #effectiveness #summary
- Efficient and effective explanation of change in hierarchical summaries (DA, DB, DG, NEY, FK, DS), pp. 6–15.
- KDD-2007-DavidsonRE #clustering #incremental
- Efficient incremental constrained clustering (ID, SSR, ME), pp. 240–249.
- KDD-2007-LaxmanSU #algorithm
- A fast algorithm for finding frequent episodes in event streams (SL, PSS, KPU), pp. 410–419.
- KDD-2007-LoKL #mining #specification
- Efficient mining of iterative patterns for software specification discovery (DL, SCK, CL), pp. 460–469.
- KDD-2007-TongFGE #graph #pattern matching #scalability
- Fast best-effort pattern matching in large attributed graphs (HT, CF, BG, TER), pp. 737–746.
- KDD-2007-TongFK #graph #mining #proximity
- Fast direction-aware proximity for graph mining (HT, CF, YK), pp. 747–756.
- MLDM-2007-HanKK #sequence #using
- Efficient Subsequence Matching Using the Longest Common Subsequence with a Dual Match Index (TSH, SKK, JK), pp. 585–600.
- MLDM-2007-MendezCGRD
- Analyzing the Performance of Spam Filtering Methods When Dimensionality of Input Vector Changes (JRM, BC, DGP, FFR, FD), pp. 364–378.
- MLDM-2007-TrundleNC #modelling #multi
- Multi-source Data Modelling: Integrating Related Data to Improve Model Performance (PRT, DN, QC), pp. 32–46.
- SEKE-2007-CangussuCW #component #evaluation #testing
- Reducing the Number of Test Cases for Performance Evaluation of Components (JWC, KMLC, WEW), pp. 145–150.
- SEKE-2007-HummelJA #component #repository #retrieval
- Evaluating the Efficiency of Retrieval Methods for Component Repositories (OH, WJ, CA), pp. 404–409.
- SEKE-2007-VandalGG #analysis #middleware
- Performance Analysis of the Active Object Pattern in Middleware (PJV, SSG, ASG), pp. 730–735.
- SIGIR-2007-BastCSW #named
- ESTER: efficient search on text, entities, and relations (HB, AC, FMS, IW), pp. 671–678.
- SIGIR-2007-Broschart #graph #integration #proximity #retrieval
- Efficient integration of proximity for text, semi-structured and graph retrieval (AB), p. 917.
- SIGIR-2007-CetintasS #effectiveness #trade-off
- Exploration of the tradeoff between effectiveness and efficiency for results merging in federated search (SC, LS), pp. 707–708.
- SIGIR-2007-Diaz #predict #using
- Performance prediction using spatial autocorrelation (FD), pp. 583–590.
- SIGIR-2007-LiuHAY #named #predict #sentiment #using
- ARSA: a sentiment-aware model for predicting sales performance using blogs (YL, XH, AA, XY), pp. 607–614.
- SIGIR-2007-StrohmanC #documentation #in memory #memory management #retrieval
- Efficient document retrieval in main memory (TS, WBC), pp. 175–182.
- SIGIR-2007-TurpinTHW #generative #web
- Fast generation of result snippets in web search (AT, YT, DH, HEW), pp. 127–134.
- SIGIR-2007-WicksG #parallel #rank
- More efficient parallel computation of pagerank (JRW, AG), pp. 861–862.
- SIGIR-2007-ZhangK #modelling #recommendation
- Efficient bayesian hierarchical user modeling for recommendation system (YZ, JK), pp. 47–54.
- SIGIR-2007-ZhangX #estimation #modelling
- Fast exact maximum likelihood estimation for mixture of language models (YZ, WX), pp. 865–866.
- SIGIR-2007-ZhouC #predict #query #web
- Query performance prediction in web search environments (YZ, WBC), pp. 543–550.
- ECMDA-FA-2007-MaraeeB #diagrams #finite #reasoning #satisfiability #set #uml
- Efficient Reasoning About Finite Satisfiability of UML Class Diagrams with Constrained Generalization Sets (AM, MB), pp. 17–31.
- ECOOP-2007-BoddenHL #monitoring #program analysis #runtime #staged
- A Staged Static Program Analysis to Improve the Performance of Runtime Monitoring (EB, LJH, OL), pp. 525–549.
- ECOOP-2007-XianSJJ #garbage collection #java #named
- AS-GC: An Efficient Generational Garbage Collector for Java Application Servers (FX, WSa, CJ, HJ), pp. 126–150.
- OOPSLA-2007-ChenR #framework #named #runtime #verification
- Mop: an efficient and generic runtime verification framework (FC, GR), pp. 569–588.
- OOPSLA-2007-ElkarabliehKVM #named #static analysis
- Starc: static analysis for efficient repair of complex data (BE, SK, DV, KSM), pp. 387–404.
- OOPSLA-2007-GeorgesBE #evaluation #java #statistics
- Statistically rigorous java performance evaluation (AG, DB, LE), pp. 57–76.
- OOPSLA-2007-XianSJ #approach #garbage collection #named
- Microphase: an approach to proactively invoking garbage collection for improved performance (FX, WSa, HJ), pp. 77–96.
- AdaEurope-2007-BarbariaHP #component #design #distributed
- Design and Performance of a Generic Consensus Component for Critical Distributed Applications (KB, JH, LP), pp. 208–220.
- PADL-2007-Costa #dataset #prolog
- Prolog Performance on Larger Datasets (VSC), pp. 185–199.
- PADL-2007-GustafssonS #erlang #evaluation #implementation #programming
- Applications, Implementation and Performance Evaluation of Bit Stream Programming in Erlang (PG, KFS), pp. 94–108.
- PADL-2007-MorimotoTI
- Instantly Turning a Naive Exhaustive Search into Three Efficient Searches with Pruning (TM, YT, HI), pp. 65–79.
- PADL-2007-Rocha #evaluation #on the #robust
- On Improving the Efficiency and Robustness of Table Storage Mechanisms for Tabled Evaluation (RR), pp. 155–169.
- PADL-2007-Sarna-StarostaR #compilation #constraints #evaluation
- Compiling Constraint Handling Rules for Efficient Tabled Evaluation (BSS, CRR), pp. 170–184.
- PEPM-2007-RothamelL #implementation #retrieval #tuple
- Efficient implementation of tuple pattern based retrieval (TR, YAL), pp. 81–90.
- PLDI-2007-GenevesLS #static analysis #xml
- Efficient static analysis of XML paths and types (PG, NL, AS), pp. 342–351.
- PLDI-2007-HardekopfL #analysis #pointer
- The ant and the grasshopper: fast and accurate pointer analysis for millions of lines of code (BH, CL), pp. 290–299.
- PLDI-2007-KothariGMG #abstraction #network #programming #reliability
- Reliable and efficient programming abstractions for wireless sensor networks (NK, RG, TDM, RG), pp. 200–210.
- PLDI-2007-LiZYZ #compilation #energy #named #network
- UCC: update-conscious compilation for energy efficiency in wireless sensor networks (WL, YZ, JY, JZ), pp. 383–393.
- PLDI-2007-SchneiderPG #hardware #monitoring #online #optimisation
- Online optimizations driven by hardware performance monitoring (FTS, MP, TRG), pp. 373–382.
- PPDP-2007-HristovaTL #analysis #policy #trust
- Efficient trust management policy analysis from rules (KH, KTT, YAL), pp. 211–220.
- QAPL-2007-YaikhomCGH #approach #modelling #using
- A Structural Approach for Modelling Performance of Systems Using Skeletons (GY, MC, SG, JH), pp. 167–183.
- SAS-2007-BanterleG #abstract domain #hardware #implementation
- A Fast Implementation of the Octagon Abstract Domain on Graphics Hardware (FB, RG), pp. 315–332.
- RE-2007-HoWA #requirements #specification
- Improving Performance Requirements Specifications from Field Failure Reports (CWH, LW, AIA), pp. 79–88.
- REFSQ-2007-RegnellHB #analysis #mobile #non-functional #quality #requirements
- A Quality Performance Model for Cost-Benefit Analysis of Non-functional Requirements Applied to the Mobile Handset Domain (BR, MH, RBS), pp. 277–291.
- REFSQ-2007-Schneider #elicitation #feedback #generative #requirements
- Generating Fast Feedback in Requirements Elicitation (KS), pp. 160–174.
- ASE-2007-CaiGH #crawling #modelling #web
- Synthesizing client load models for performance engineering via web crawling (YC, JCG, JGH), pp. 353–362.
- ASE-2007-LeitnerOZCM #testing
- Efficient unit test case minimization (AL, MO, AZ, IC, BM), pp. 417–420.
- ESEC-FSE-2007-BasitJ #clone detection #detection #flexibility
- Efficient token based clone detection with flexible tokenization (HAB, SJ), pp. 513–516.
- ESEC-FSE-2007-CalegariMRM #generative #mobile #named #testing
- CTG: a connectivity trace generator for testing the performance of opportunistic mobile systems (RC, MM, FR, CM), pp. 415–424.
- ESEC-FSE-2007-ChilimbiNV #effectiveness #profiling #testing
- Quantifying the effectiveness of testing via efficient residual path profiling (TMC, AVN, KV), pp. 545–548.
- ESEC-FSE-2007-RamasubbuB #analysis #development #distributed #empirical
- Globally distributed software development project performance: an empirical analysis (NR, RKB), pp. 125–134.
- ESEC-FSE-2007-XuRTQ #java #using
- Efficient checkpointing of java software using context-sensitive capture and replay (G(X, AR, YT, FQ), pp. 85–94.
- GTTSE-2007-ChellappaFP #how
- How to Write Fast Numerical Code: A Small Introduction (SC, FF, MP), pp. 196–259.
- ICSE-2007-JinTHL #evaluation #information management #legacy #predict
- Performance Evaluation and Prediction for Legacy Information Systems (YJ, AT, JH, YL), pp. 540–549.
- SAC-2007-AdjerohKZMBB
- BWT-based efficient shape matching (DAA, UK, NZ, AM, MTB, TB), pp. 1079–1085.
- SAC-2007-Chang #on the #scalability
- On efficient wear leveling for large-scale flash-memory storage systems (LPC), pp. 1126–1130.
- SAC-2007-CheliusFF #development #framework #named #network
- Worldsens: a fast and accurate development framework for sensor network applications (GC, AF, EF), pp. 222–226.
- SAC-2007-ChiangH #adaptation #file system
- Improving the performance of log-structured file systems with adaptive block rearrangement (MLC, JSH), pp. 1136–1140.
- SAC-2007-CiferriCFTS #query
- Horizontal fragmentation as a technique to improve the performance of drill-down and roll-up queries (CDdAC, RRC, DTF, AJMT, FdFdS), pp. 494–499.
- SAC-2007-GustafssonTDH #approach #aspect-oriented #behaviour #embedded #evolution
- Engineering active behavior of embedded software to improve performance and evolution: an aspect-oriented approach (TG, AT, YD, JH), pp. 673–679.
- SAC-2007-HiserDW #design #embedded #memory management
- Fast, accurate design space exploration of embedded systems memory configurations (JH, JWD, DBW), pp. 699–706.
- SAC-2007-HwangPJ #analysis #implementation
- An implementation and performance analysis of slave-side arbitration schemes for the ML-AHB BusMatrix (SYH, HJP, KSJ), pp. 1545–1551.
- SAC-2007-KanzakiHN #ad hoc #mobile #network #protocol
- An efficient TDMA slot assignment protocol in mobile ad hoc networks (AK, TH, SN), pp. 891–895.
- SAC-2007-KimHC #implementation #mobile #multi
- An efficient implementation of RC4 cipher for encrypting multimedia files on mobile devices (HK, JH, SC), pp. 1171–1175.
- SAC-2007-KorherrL #metric
- Extending the EPC with performance measures (BK, BL), pp. 1265–1266.
- SAC-2007-KyungPKJKP #design #framework #manycore #monitoring #platform
- Performance monitor unit design for an AXI-based multi-core SoC platform (HmK, GHP, JWK, WJ, TJK, SBP), pp. 1565–1572.
- SAC-2007-LebbahMR #constraints #implementation #reduction #using
- Using constraint techniques for a safe and fast implementation of optimality-based reduction (YL, CM, MR), pp. 326–331.
- SAC-2007-LeeHPLJK #regular expression #using
- A high performance NIDS using FPGA-based regular expression matching (JL, SHH, NP, SWL, SJ, YSK), pp. 1187–1191.
- SAC-2007-LiuD #web #web service
- An efficient dual caching strategy for web service-enabled PDAs (XL, RD), pp. 788–794.
- SAC-2007-MinYCH #memory management #operating system
- An efficient dynamic memory allocator for sensor operating systems (HM, SY, YC, JH), pp. 1159–1164.
- SAC-2007-NangP #feedback #multi #retrieval
- An efficient indexing structure for content based multimedia retrieval with relevance feedback (JN, JP), pp. 517–524.
- SAC-2007-NeubauerS #process
- Extending business process management to determine efficient IT investments (TN, CS), pp. 1250–1256.
- SAC-2007-PigeauNG #approximate #image
- Fast tracking of hierarchical partitions with approximate kl-divergence for geo-temporal organization of personal images (AP, AN, MG), pp. 1088–1089.
- SAC-2007-SilvaL #algorithm #documentation
- A fast algorithm to binarize and filter documents with back-to-front interference (JMMdS, RDL), pp. 639–640.
- SAC-2007-StanchinaM #algorithm #garbage collection #realtime
- Exploiting the efficiency of generational algorithms for hardware-supported real-time garbage collection (SS, MM), pp. 713–718.
- SAC-2007-XianhuaJX #reduction
- Efficient code size reduction without performance loss (LX, ZJ, CX), pp. 666–672.
- SAC-2007-YiKOJKD #detection #hardware
- Memory-efficient content filtering hardware for high-speed intrusion detection systems (SY, BKK, JO, JJ, GK, CRD), pp. 264–269.
- SAC-2007-ZhangMMB #locality #network #problem #self #using
- Performance problem localization in self-healing, service-oriented systems using Bayesian networks (RZ, SM, SM, AB), pp. 104–109.
ATEM-2007-FritzscheJ #modelling- Putting Performance Engineering into Model-Driven Engineering: Model-Driven Performance Engineering (MF, JJ), pp. 164–175.
- GPCE-2007-Puschel #education #library #question
- Can we teach computers to write fast libraries? (MP), pp. 1–2.
- CASE-2007-FontanelliRS #algorithm #locality #metric #using
- A Fast RANSAC-Based Registration Algorithm for Accurate Localization in Unknown Environments using LIDAR Measurements (DF, LR, SS), pp. 597–602.
- CASE-2007-HoshinoO #design
- Performance Design of Operating Robots in a Seaport Container-Handling System (SH, JO), pp. 692–697.
- CASE-2007-KimLSSZ #approach #biology #metric #using
- Iterative Control Approach to High-Speed Force-Distance Curve Measurement Using AFM for Biological Applications (KSK, ZL, PS, SS, QZ), pp. 219–224.
- CASE-2007-KimLSSZ07a #approach #biology #metric #using
- Iterative Control Approach to High-Speed Force-Distance Curve Measurement Using AFM for Biological Applications (KSK, ZL, PS, SS, QZ), p. 91–?.
- CASE-2007-MartinWS #algorithm #online
- Offline and Online Evolutionary Bi-Directional RRT Algorithms for Efficient Re-Planning in Dynamic Environments (SRM, SEW, JWS), pp. 1131–1136.
- CASE-2007-YamamotoFI #3d #metric #multi #using
- A High-Speed 3D Shape Measurement System Using a Multi-Sided Mirror (KY, HF, II), pp. 823–828.
- CASE-2007-YangZL #identification #modelling
- Modeling and Identification for High-Speed Milling Machines (JY, DZ, ZL), pp. 346–351.
- CASE-2007-YoonHMSR #algorithm #image #navigation #using
- Efficient Navigation Algorithm Using 1D Panoramic Images (SY, WH, SKM, YS, KSR), pp. 536–541.
- CC-2007-GrundH #algorithm
- A Fast Cutting-Plane Algorithm for Optimal Coalescing (DG, SH), pp. 111–125.
- CGO-2007-CavazosFABOT #compilation #optimisation #using
- Rapidly Selecting Good Compiler Optimizations using Performance Counters (JC, GF, FVA, EVB, MFPO, OT), pp. 185–197.
- CGO-2007-WallaceH #named #realtime
- SuperPin: Parallelizing Dynamic Instrumentation for Real-Time Performance (SW, KMH), pp. 209–220.
- DAC-2007-BharathESUY #simulation
- Computationally Efficient Power Integrity Simulation for System-on-Package Applications (KB, EE, MS, KU, TY), pp. 612–617.
- DAC-2007-BhatiaGTMM #equivalence #multi #validation
- Leveraging Semi-Formal and Sequential Equivalence Techniques for Multimedia SOC Performance Validation (LB, JG, PT, RSM, SHM), pp. 69–74.
- DAC-2007-BonnyH
- Instruction Splitting for Efficient Code Compression (TB, JH), pp. 646–651.
- DAC-2007-BriskVIP
- Enhancing FPGA Performance for Arithmetic Circuits (PB, AKV, PI, HPA), pp. 334–337.
- DAC-2007-ChangHK #design
- Endurance Enhancement of Flash-Memory Storage, Systems: An Efficient Static Wear Leveling Design (YHC, JWH, TWK), pp. 212–217.
- DAC-2007-ChenZ #process
- Fast Min-Cost Buffer Insertion under Process Variations (RC, HZ), pp. 338–343.
- DAC-2007-DengBWYZ #named #satisfiability #using
- EHSAT: An Efficient RTL Satisfiability Solver Using an Extended DPLL Procedure (SD, JB, WW, XY, YZ), pp. 588–593.
- DAC-2007-DongL #simulation #using
- Accelerating Harmonic Balance Simulation Using Efficient Parallelizable Hierarchical Preconditioning (WD, PL), pp. 436–439.
- DAC-2007-FengLZ #analysis #higher-order #parametricity #reduction #statistics #using
- Fast Second-Order Statistical Static Timing Analysis Using Parameter Dimension Reduction (ZF, PL, YZ), pp. 244–249.
- DAC-2007-HagiescuBCSGR #analysis #network
- Performance Analysis of FlexRay-based ECU Networks (AH, UDB, SC, PS, PVVG, SR), pp. 284–289.
- DAC-2007-HanS #algorithm #named #preprocessor
- Alembic: An Efficient Algorithm for CNF Preprocessing (HH, FS), pp. 582–587.
- DAC-2007-HariziHOB #analysis #modelling
- Efficient Modeling Techniques for Dynamic Voltage Drop Analysis (HH, RH, MO, EB), pp. 706–711.
- DAC-2007-KimJH #estimation #monte carlo
- Fast, Non-Monte-Carlo Estimation of Transient Performance Variation Due to Device Mismatch (JK, KDJ, MAH), pp. 440–443.
- DAC-2007-KumarMCTH #approach #estimation #multi #probability
- A Probabilistic Approach to Model Resource Contention for Performance Estimation of Multi-featured Media Devices (AK, BM, HC, BDT, YH), pp. 726–731.
- DAC-2007-LiKBR #flexibility #power management
- High Performance and Low Power Electronics on Flexible Substrate (JL, KK, AB, KR), pp. 274–275.
- DAC-2007-LiP #correlation #multi #parametricity
- Efficient Parametric Yield Extraction for Multiple Correlated Non-Normal Performance Distributions of Analog/RF Circuits (XL, LTP), pp. 928–933.
- DAC-2007-NaeemiSM #modelling #multi #optimisation
- Performance Modeling and Optimization for Single- and Multi-Wall Carbon Nanotube Interconnects (AN, RS, JDM), pp. 568–573.
- DAC-2007-PiyachonL #pattern matching #state machine
- Compact State Machines for High Performance Pattern Matching (PP, YL), pp. 493–496.
- DAC-2007-SingheeR #statistics
- Beyond Low-Order Statistical Response Surfaces: Latent Variable Regression for Efficient, Highly Nonlinear Fitting (AS, RAR), pp. 256–261.
- DAC-2007-SuWCM #design #optimisation
- An Efficient Mechanism for Performance Optimization of Variable-Latency Designs (YSS, DCW, SCC, MMS), pp. 976–981.
- DAC-2007-WangYBVVLC
- The Impact of NBTI on the Performance of Combinational and Sequential Circuits (WW, SY, SB, RV, SBKV, FL, YC), pp. 364–369.
- DAC-2007-WiggersBS #data flow #graph
- Efficient Computation of Buffer Capacities for Cyclo-Static Dataflow Graphs (MW, MB, GJMS), pp. 658–663.
- DAC-2007-YeZL #optimisation #power management #statistics #using
- Statistical Leakage Power Minimization Using Fast Equi-Slack Shell Based Optimization (XY, YZ, PL), pp. 853–858.
- DAC-2007-ZhouLS #bound #embedded #hybrid #multi #using
- Fast Capacitance Extraction in Multilayer, Conformal and Embedded Dielectric using Hybrid Boundary Element Method (NYZ, ZL, WS), pp. 835–840.
- DATE-2007-BondarevCW #analysis #component #design #embedded #named #tool support
- CARAT: a toolkit for design and performance analysis of component-based embedded systems (ERVB, MRVC, PHNdW), pp. 1024–1029.
- DATE-2007-BonnyH
- Efficient code density through look-up table compression (TB, JH), pp. 809–814.
- DATE-2007-ChangLR #using
- Improve CAM power efficiency using decoupled match line scheme (YJC, YHL, SJR), pp. 165–170.
- DATE-2007-ChenZLC #analysis #statistics
- Fast statistical circuit analysis with finite-point based transistor model (MC, WZ, FL, YC), pp. 1391–1396.
- DATE-2007-CuiDHG #2d #algorithm #configuration management #online
- An efficient algorithm for online management of 2D area of partially reconfigurable FPGAs (JC, QD, XH, ZG), pp. 129–134.
- DATE-2007-DAscoliIMMTFGRM #prototype
- Low-g accelerometer fast prototyping for automotive applications (FD, FI, CM, MM, MT, LF, AG, AR, MDM), pp. 486–491.
- DATE-2007-EckerESSVH #abstraction #interactive #representation #simulation
- Interactive presentation: Impact of description language, abstraction layer, and value representation on simulation performance (WE, VE, LS, TS, MV, MH), pp. 767–772.
- DATE-2007-EeckelaertSGSS #synthesis
- An efficient methodology for hierarchical synthesis of mixed-signal systems with fully integrated building block topology selection (TE, RS, GGEG, MS, WMCS), pp. 81–86.
- DATE-2007-EjlaliARM #energy #fault tolerance #network
- Joint consideration of fault-tolerance, energy-efficiency and performance in on-chip networks (AE, BMAH, PMR, SGM), pp. 1647–1652.
- DATE-2007-FangH #hybrid #satisfiability
- A new hybrid solution to boost SAT solver performance (LF, MSH), pp. 1307–1313.
- DATE-2007-GburzynskiKO #ad hoc #low cost #network #protocol
- A tiny and efficient wireless ad-hoc protocol for low-cost sensor networks (PG, BK, WO), pp. 1557–1562.
- DATE-2007-Gordon-RossVVNB #configuration management #energy
- A one-shot configurable-cache tuner for improved energy and performance (AGR, PV, FV, WAN, EB), pp. 755–760.
- DATE-2007-HaastregtK #interactive #optimisation #random #using
- Interactive presentation: Feasibility of combined area and performance optimization for superscalar processors using random search (SvH, PMWK), pp. 606–611.
- DATE-2007-HuangG #energy #optimisation #realtime #scalability
- Efficient and scalable compiler-directed energy optimization for realtime applications (PKH, SG), pp. 785–790.
- DATE-2007-HuangT #analysis #correlation #multi #using
- Performance analysis of multimedia applications using correlated streams (KH, LT), pp. 912–917.
- DATE-2007-HumenayTS #manycore #process #symmetry
- Impact of process variations on multicore performance symmetry (EH, DT, KS), pp. 1653–1658.
- DATE-2007-HuMWD
- Optimization-based wideband basis functions for efficient interconnect extraction (XH, TM, JKW, LD), pp. 1200–1205.
- DATE-2007-HuVKCP #dependence #estimation #memory management
- Fast memory footprint estimation based on maximal dependency vector calculation (QH, AV, PGK, FC, MP), pp. 379–384.
- DATE-2007-Lysecky #embedded #power management
- Low-power warp processor for power efficient high-performance embedded systems (RLL), pp. 141–146.
- DATE-2007-MatarreseMCDB #algorithm #validation
- Experimental validation of a tuning algorithm for high-speed filters (GM, CM, FC, SD, AB), pp. 421–426.
- DATE-2007-MavroidisP #hardware #synthesis
- Efficient testbench code synthesis for a hardware emulator system (IM, IP), pp. 888–893.
- DATE-2007-MoselhyHD #3d
- pFFT in FastMaxwell: a fast impedance extraction solver for 3D conductor structures over substrate (TM, XH, LD), pp. 1194–1199.
- DATE-2007-MossNFFBA #hardware #simulation
- Seamless hardware/software performance co-monitoring in a codesign simulation environment with RTOS support (LM, MdN, LF, SF, GB, EMA), pp. 876–881.
- DATE-2007-NarayananKB #clustering
- Performance aware secure code partitioning (SHKN, MTK, RRB), pp. 1122–1127.
- DATE-2007-OgrasM #analysis #modelling
- Analytical router modeling for networks-on-chip performance analysis (ÜYO, RM), pp. 1096–1101.
- DATE-2007-PapadonikolakisPK #implementation
- Efficient high-performance ASIC implementation of JPEG-LS encoder (MEP, VP, AK), pp. 159–164.
- DATE-2007-ParkPBBKD #architecture #embedded #pointer
- Register pointer architecture for efficient embedded processors (JP, SBP, JDB, DBS, CK, WJD), pp. 600–605.
- DATE-2007-RhodLC #architecture
- A low-SER efficient core processor architecture for future technologies (ELR, CALL, LC), pp. 1448–1453.
- DATE-2007-SahinH #algorithm #architecture #hardware #interactive #predict
- Interactive presentation: An efficient hardware architecture for H.264 intra prediction algorithm (ES, IH), pp. 183–188.
- DATE-2007-SathanurCBMMP #bound #clustering #interactive
- Interactive presentation: Efficient computation of discharge current upper bounds for clustered sleep transistor sizing (AVS, AC, LB, AM, EM, MP), pp. 1544–1549.
- DATE-2007-SavojAAGH
- A new technique for characterization of digital-to-analog converters in high-speed systems (JS, AAA, AA, BWG, MAH), pp. 433–438.
- DATE-2007-SchlieckerSE #analysis #composition #data flow #graph #integration
- Performance analysis of complex systems by integration of dataflow graphs and compositional performance analysis (SS, SS, RE), pp. 273–278.
- DATE-2007-SeongM #taxonomy #using
- An efficient code compression technique using application-aware bitmask and dictionary selection methods (SWS, PM), pp. 582–587.
- DATE-2007-SilvaSP
- Efficient computation of the worst-delay corner (LGeS, LMS, JRP), pp. 1617–1622.
- DATE-2007-SingheeR #monte carlo #novel #simulation #statistics
- Statistical blockade: a novel method for very fast Monte Carlo simulation of rare circuit events, and its application (AS, RAR), pp. 1379–1384.
- DATE-2007-SpindlerJ #estimation
- Fast and accurate routing demand estimation for efficient routability-driven placement (PS, FMJ), pp. 1226–1231.
- DATE-2007-TannirK #analysis
- Efficient nonlinear distortion analysis of RF circuits (DT, RK), pp. 255–260.
- DATE-2007-WangLHLYX #modelling
- Temperature-aware NBTI modeling and the impact of input vector control on performance degradation (YW, HL, KH, RL, HY, YX), pp. 546–551.
- DATE-2007-WatanabeKINN #constraints #energy #interactive #multi #scheduling
- Interactive presentation: Task scheduling under performance constraints for reducing the energy consumption of the GALS multi-processor SoC (RW, MK, MI, HN, TN), pp. 797–802.
- DATE-2007-WielageMAW #design #embedded
- Design and DfT of a high-speed area-efficient embedded asynchronous FIFO (PW, EJM, MA, CW), pp. 853–858.
- DATE-2007-Wong #equation #symmetry #using
- Fast positive-real balanced truncation of symmetric systems using cross Riccati equations (NW), pp. 1496–1501.
- HPCA-2007-SrinathMKP #feedback #hardware
- Feedback Directed Prefetching: Improving the Performance and Bandwidth-Efficiency of Hardware Prefetchers (SS, OM, HK, YNP), pp. 63–74.
- HPCA-2007-VenkataramaniRSP #debugging #memory management #monitoring #named #programmable
- MemTracker: Efficient and Programmable Support for Memory Access Monitoring and Debugging (GV, BR, YS, MP), pp. 273–284.
- HPDC-2007-BudatiSCW #grid #named #platform #reliability
- Ridge: combining reliability and performance in open grid platforms (KB, JDS, AC, JBW), pp. 55–64.
- HPDC-2007-GuptaV
- An efficient MPI_allgather for grids (RG, SSV), pp. 169–178.
- HPDC-2007-LeeS #analysis #precise
- Precise and realistic utility functions for user-centric performance analysis of schedulers (CBL, AS), pp. 107–116.
- HPDC-2007-RajS #scalability #self
- High performance and scalable I/O virtualization via self-virtualized devices (HR, KS), pp. 179–188.
- HPDC-2007-ShiraiST #parallel
- A fast topology inference: a building block for network-aware parallel processing (TS, HS, KT), pp. 11–22.
- HPDC-2007-WeigleC #network
- Partial content distribution on high performance networks (EW, AAC), pp. 137–146.
- ISMM-2007-Joisha #framework #garbage collection
- Overlooking roots: a framework for making nondeferred reference-counting garbage collection fast (PGJ), pp. 141–158.
- ISMM-2007-XianSJ #concurrent #garbage collection #policy #scheduling #thread
- Allocation-phase aware thread scheduling policies to improve garbage collection performance (FX, WSa, HJ), pp. 79–90.
- LCTES-2007-WangCZYZ #optimisation
- Optimizing software cache performance of packet processing applications (QW, JC, WZ, MY, BZ), pp. 227–236.
- PDP-2007-AlmeidaGB #analysis #clustering #multi #symmetry
- Performance analysis for clusters of symmetric multiprocessors (FA, JAG, JMB), pp. 121–128.
- PDP-2007-BinzenhoferHKE #data type #network #scalability #simulation
- Efficient Simulation of Large-Scale P2P Networks: Compact Data Structures (AB, TH, GK, KE), pp. 467–474.
- PDP-2007-CilardoCMR07a #approach #evaluation #security
- Performance Evaluation of Security Services: An Experimental Approach (AC, LC, AM, LR), pp. 387–394.
- PDP-2007-DaneluttoVZ
- A Performance Model for Stream-based Computations (MD, MV, CZ, DL, NT), pp. 91–96.
- PDP-2007-KangPK #effectiveness #framework
- Performance Evaluations of the FTOG Framework for Effective Object Management and Load Distribution (MK, JHP, HK), pp. 424–432.
- PDP-2007-Kunkel0 #architecture #evaluation
- Performance Evaluation of the PVFS2 Architecture (JMK, TL), pp. 509–516.
- PDP-2007-KunzmannNHBE #modelling #network #scalability #simulation
- Efficient Simulation of Large-Scale P2P Networks: Modeling Network Transmission Times (GK, RN, TH, AB, KE), pp. 475–481.
- PDP-2007-MejiaFDRS
- Boosting Ethernet Performance by Segment-Based Routing (AM, JF, JD, SAR, TS), pp. 55–62.
- PPoPP-2007-BarrettAV #evaluation
- Performance evaluation of the cray XT3 configured with dual core opteron processors (RFB, SRA, JSV), pp. 148–149.
- PPoPP-2007-GontmakherMS #energy #multi #thread #using
- Using fine grain multithreading for energy efficient computing (AG, AM, AS), pp. 259–269.
- PPoPP-2007-IancuS #communication #network #optimisation
- Optimizing communication overlap for high-speed networks (CI, ES), pp. 35–45.
- PPoPP-2007-KejariwalTGLKBNVP #analysis #concurrent #cpu #specification #thread #using
- Tight analysis of the performance potential of thread speculation using spec CPU 2006 (AK, XT, MG, WL, SK, UB, AN, AVV, CDP), pp. 215–225.
- PPoPP-2007-LeeBSSSM #learning #modelling #parallel
- Methods of inference and learning for performance modeling of parallel applications (BCL, DMB, BRdS, MS, KS, SAM), pp. 249–258.
- PPoPP-2007-MamidalaNVSP #on the #scalability #trade-off #using
- On using connection-oriented vs. connection-less transport for performance and scalability of collective and one-sided operations: trade-offs and impact (ARM, SN, AV, GS, DKP), pp. 46–54.
- PPoPP-2007-MaratheM #memory management #transaction
- Efficient nonblocking software transactional memory (VJM, MM), pp. 136–137.
- PPoPP-2007-TapusH #fault tolerance #named #parallel
- Speculations: providing fault-tolerance and improving performance of parallel applications (CT, JH), pp. 152–153.
WRLA-2006-HillsSR07 #framework #generative- A Rewrite Framework for Language Definitions and for Generation of Efficient Interpreters (MH, TS, GR), pp. 215–231.
- FASE-2007-CortellessaMI #analysis #framework #non-functional #reliability
- Integrating Performance and Reliability Analysis in a Non-Functional MDA Framework (VC, ADM, PI), pp. 57–71.
- STOC-2007-BjorklundHKK #fourier #set
- Fourier meets möbius: fast subset convolution (AB, TH, PK, MK), pp. 67–74.
- STOC-2007-Furer #integer #multi
- Faster integer multiplication (MF), pp. 57–66.
- STOC-2007-GilbertSTV #algorithm #sketching
- One sketch for all: fast algorithms for compressed sensing (ACG, MJS, JAT, RV), pp. 237–246.
- STOC-2007-PassV #game studies #parallel #theorem
- An efficient parallel repetition theorem for Arthur-Merlin games (RP, MV), pp. 420–429.
- TACAS-2007-AbdullaDHR #model checking #transducer #verification
- Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems) (PAA, GD, NBH, AR), pp. 721–736.
- TACAS-2007-Horn #algorithm #game studies
- Faster Algorithms for Finitary Games (FH), pp. 472–484.
- TACAS-2007-ZhangHEJ #algorithm #probability #simulation
- Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations (LZ, HH, FE, DNJ), pp. 155–169.
A-MOST-2007-FraserW #generative #ltl #model checking #testing #using- Using LTL rewriting to improve the performance of model-checker based test-case generation (GF, FW), pp. 64–74.
- CADE-2007-KuncakR #algebra #satisfiability #towards
- Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic (VK, MCR), pp. 215–230.
- CADE-2007-MouraB #smt
- Efficient E-Matching for SMT Solvers (LMdM, NB), pp. 183–198.
- CAV-2007-BarnatBS #detection
- I/O Efficient Accepting Cycle Detection (JB, LB, PS), pp. 281–293.
- CAV-2007-KahlonYSG #concurrent #detection #source code
- Fast and Accurate Static Data-Race Detection for Concurrent Programs (VK, YY, SS, AG), pp. 226–239.
- ISSTA-2007-dAmorimLM #execution #object-oriented #source code
- Delta execution for efficient state-space exploration of object-oriented programs (Md, SL, DM), pp. 50–60.
- ISSTA-2007-DufourRS #analysis #comprehension
- Blended analysis for performance understanding of framework-based applications (BD, BGR, GS), pp. 118–128.
- ISSTA-2007-XinZ #dependence #detection #online
- Efficient online detection of dynamic control dependence (BX, XZ), pp. 185–195.
- ISSTA-2007-YooH #multi #testing
- Pareto efficient multi-objective test case selection (SY, MH), pp. 140–150.
- LICS-2007-Escardo #infinity #set
- Infinite sets that admit fast exhaustive search (MHE), pp. 443–452.
- LICS-2007-RabinST #correctness #proving
- Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications (MOR, RAS, CT), pp. 63–76.
- LICS-2007-RanzatoT #algorithm #equivalence #simulation
- A New Efficient Simulation Equivalence Algorithm (FR, FT), pp. 171–180.
- SAT-2007-ManoliosV
- Efficient Circuit to CNF Conversion (PM, DV), pp. 4–9.
- CBSE-2006-BondarevCW #architecture #component #process #trade-off
- A Process for Resolving Performance Trade-Offs in Component-Based Architectures (EB, MRVC, PHNdW), pp. 254–269.
- CBSE-2006-GrassiMS #analysis #approach #component #model transformation #reliability
- A Model Transformation Approach for the Early Performance and Reliability Analysis of Component-Based Systems (VG, RM, AS), pp. 270–284.
- CBSE-2006-UfimtsevKM #memory management
- Impact of Virtual Memory Managers on Performance of J2EE Applications (AU, AK, LM), pp. 285–293.
- QoSA-2006-KoziolekHB #component #parametricity #specification
- Parameter Dependent Performance Specifications of Software Components (HK, JH, SB), pp. 163–179.
- QoSA-2006-MarcoM #model transformation
- Model Transformation in Software Performance Engineering (ADM, RM), pp. 95–110.
- DocEng-2006-LindholmKT #difference #sequence #xml
- Fast and simple XML tree differencing by sequence alignment (TL, JK, ST), pp. 75–84.
- PODS-2006-KashyapDNRS
- Efficient gossip-based aggregate computation (SRK, SD, KVMN, RR, AS), pp. 308–317.
- PODS-2006-LeeT
- A simpler and more efficient deterministic scheme for finding frequent items over sliding windows (LKL, HFT), pp. 290–297.
- PODS-2006-MachanavajjhalaG #on the #privacy
- On the efficiency of checking perfect privacy (AM, JG), pp. 163–172.
- SIGMOD-2006-AchtertBKKPR #metric #nearest neighbour
- Efficient reverse k-nearest neighbor search in arbitrary metric spaces (EA, CB, PK, PK, AP, MR), pp. 515–526.
- SIGMOD-2006-Amer-YahiaCD #flexibility #xml
- Flexible and efficient XML search with complex full-text predicates (SAY, EC, AD), pp. 575–586.
- SIGMOD-2006-BhaskarBCGSSY #implementation #named #xquery
- Quark: an efficient XQuery full-text implementation (AB, CB, MC, LG, JS, FS, FY), pp. 781–783.
- SIGMOD-2006-BonczGKMRT #named #relational #xquery
- MonetDB/XQuery: a fast XQuery processor powered by a relational engine (PAB, TG, MvK, SM, JR, JT), pp. 479–490.
- SIGMOD-2006-ChenSM #query #web
- Efficient query processing in geographic web search engines (YYC, TS, AM), pp. 277–288.
- SIGMOD-2006-ChidlovskiiRB #analysis #self
- Documentum ECI self-repairing wrappers: performance analysis (BC, BR, MB), pp. 708–717.
- SIGMOD-2006-DuanB #identification #problem
- Proactive identification of performance problems (SD, SB), pp. 766–768.
- SIGMOD-2006-GouKC #evaluation #query #using
- Query evaluation using overlapping views: completeness and efficiency (GG, MK, RC), pp. 37–48.
- SIGMOD-2006-GovindarajuGKM #database #named #scalability #sorting
- GPUTeraSort: high performance graphics co-processor sorting for large database management (NKG, JG, RK, DM), pp. 325–336.
- SIGMOD-2006-Matias #roadmap
- Trends in high performance analytics (YM), p. 720.
- SIGMOD-2006-PapadomanolakisALTOH #query
- Efficient query processing on unstructured tetrahedral meshes (SP, AA, JCL, TT, DRO, GH), pp. 551–562.
- SIGMOD-2006-RusuD #estimation #random
- Fast range-summable random variables for efficient aggregate estimation (FR, AD), pp. 193–204.
- SIGMOD-2006-VuHCL #database #scalability #similarity
- A non-linear dimensionality-reduction technique for fast similarity search in large databases (KV, KAH, HC, SDL), pp. 527–538.
- SIGMOD-2006-XiaZ
- Refreshing the sky: the compressed skycube with efficient support for frequent updates (TX, DZ), pp. 491–502.
- SIGMOD-2006-ZuzarteY #approximate #statistics
- Fast approximate computation of statistics on views (CZ, XY), p. 724.
- VLDB-2006-AbererHS #deployment #flexibility #middleware #network
- A Middleware for Fast and Flexible Sensor Network Deployment (KA, MH, AS), pp. 1199–1202.
- VLDB-2006-ArasuGK
- Efficient Exact Set-Similarity Joins (AA, VG, RK), pp. 918–929.
- VLDB-2006-BalminBON #on the #query #xml
- On the Path to Efficient XML Queries (AB, KSB, FÖ, MN), pp. 1117–1128.
- VLDB-2006-BurdickDJRV #algorithm
- Efficient Allocation Algorithms for OLAP Over Imprecise Data (DB, PMD, TSJ, RR, SV), pp. 391–402.
- VLDB-2006-HarizopoulosLAM #database #trade-off
- Performance Tradeoffs in Read-Optimized Databases (SH, VL, DJA, SM), pp. 487–498.
- VLDB-2006-LeeK #incremental #maintenance
- Efficient Incremental Maintenance of Data Cubes (KYL, MHK), pp. 823–833.
- VLDB-2006-LiuN #database #relational
- Efficient XSLT Processing in Relational Database System (ZHL, AN), pp. 1106–1116.
- VLDB-2006-Luo #detection #query
- Efficient Detection of Empty-Result Queries (GL), pp. 1015–1025.
- VLDB-2006-ParreiraDMW #approximate #distributed #network #peer-to-peer #rank #web
- Efficient and Decentralized PageRank Approximation in a Peer-to-Peer Web Search Network (JXP, DD, SM, GW), pp. 415–426.
- VLDB-2006-Pradhan #algebra #effectiveness #query #retrieval #xml
- An Algebraic Query Model for Effective and Efficient Retrieval of XML Fragments (SP), pp. 295–306.
- VLDB-2006-SharafCLP #query #scheduling
- Efficient Scheduling of Heterogeneous Continuous Queries (MAS, PKC, AL, KP), pp. 511–522.
- VLDB-2006-SismanisBHR #named #scalability
- GORDIAN: Efficient and Scalable Discovery of Composite Keys (YS, PB, PJH, BR), pp. 691–702.
- VLDB-2006-WangL #database #evaluation #query #xml
- Efficient Secure Query Evaluation over Encrypted XML Databases (WHW, LVSL), pp. 127–138.
- VLDB-2006-WangPZQWYD #database #keyword #named #novel #user interface
- NUITS: A Novel User Interface for Efficient Keyword Search over Databases (SW, ZP, JZ, LQ, SW, JXY, BD), pp. 1143–1146.
- VLDB-2006-YinHY #clustering #named #semantics
- LinkClus: Efficient Clustering via Heterogeneous Semantic Links (XY, JH, PSY), pp. 427–438.
- VLDB-2006-YuJ #xml
- Efficient Discovery of XML Data Redundancies (CY, HVJ), pp. 103–114.
- ITiCSE-2006-Chamillard #education #predict #student #using
- Using student performance predictions in a computer science curriculum (ATC), pp. 260–264.
- ITiCSE-2006-Gomez-MartinG #concept #development
- Fast application development to demonstrate computer graphics concepts (PPGM, MAGM), pp. 250–254.
- ITiCSE-2006-GriswoldS #learning #scalability #ubiquitous
- Ubiquitous presenter: fast, scalable active learning for the whole classroom (WGG, BS), p. 358.
- CSMR-2006-KaczorGH #algorithm #design pattern #identification
- Efficient Identification of Design Patterns with Bit-vector Algorithm (OK, YGG, SH), pp. 175–184.
- ICPC-2006-GrandfieldE #development #framework #named
- INFORM: A Framework for Performance Informed Software Development (AG, CE), pp. 245–247.
- ICSM-2006-JaffriK #delivery #using
- Efficient Delivery of Software Updates Using Advanced Compression Techniques (TJ, KK), pp. 267–268.
- DLT-J-2005-FukagawaA06 #algorithm #comparison
- Fast Algorithms for Comparison of Similar Unordered Trees (DF, TA), pp. 703–729.
- DLT-J-2005-Tsin06 #algorithm #distributed
- An Efficient Distributed Algorithm for 3-edge-connectivity (YHT), pp. 677–702.
- ICALP-v1-2006-ColeKL
- Suffix Trays and Suffix Trists: Structures for Faster Text Indexing (RC, TK, ML), pp. 358–369.
- ICALP-v1-2006-HariharanKM #algorithm #graph
- A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs (RH, TK, KM), pp. 250–261.
- ICALP-v1-2006-MehlhornOS #geometry #reliability
- Reliable and Efficient Computational Geometry Via Controlled Perturbation (KM, RO, MS), pp. 299–310.
- ICALP-v2-2006-DuboisGS
- An Efficient Provable Distinguisher for HFE (VD, LG, JS), pp. 156–167.
- ICALP-v2-2006-FurukawaKI #compilation
- An Efficient Compiler from Σ-Protocol to 2-Move Deniable Zero-Knowledge (JF, KK, HI), pp. 46–57.
- ICALP-v2-2006-HaitnerHR #generative #pseudo
- Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions (IH, DH, OR), pp. 228–239.
- ICALP-v2-2006-Visconti #internet
- Efficient Zero Knowledge on the Internet (IV), pp. 22–33.
- FM-2006-ArthoBH #injection #named
- Enforcer — Efficient Failure Injection (CA, AB, SH), pp. 412–427.
- FM-2006-GenonMM #algorithm #distributed #ltl #monitoring #sequence
- Monitoring Distributed Controllers: When an Efficient LTL Algorithm on Sequences Is Needed to Model-Check Traces (AG, TM, CM), pp. 557–572.
- FM-2006-JohnstonWBSR #model checking #modelling #order
- Model-Based Variable and Transition Orderings for Efficient Symbolic Model Checking (WJ, KW, LvdB, PAS, PJR), pp. 524–540.
- SEFM-2006-ZhangHW #component #declarative #modelling #scheduling #uml #using
- Declarative Performance Modeling for Component-Based System using UML Profile for Schedulability, Performance and Time (YZ, TH, JW), pp. 246–258.
- SFM-2006-CimattiS #satisfiability
- Building Efficient Decision Procedures on Top of SAT Solvers (AC, RS), pp. 144–175.
- AIIDE-2006-PatelBCHHJLSVZH #case study #experience #interactive #interface #social
- A Guided Performance Interface for Augmenting Social Experiences with an Interactive Animatronic Character (SP, WB, DC, SAH, AH, TJJ, SJML, PS, JV, SZ, BH), pp. 72–79.
- ICGT-2006-GeissBGHS #graph grammar #named
- GrGen: A Fast SPO-Based Graph Rewriting Tool (RG, GVB, DG, SH, AS), pp. 383–397.
- CHI-2006-CockburnGA #documentation #navigation
- Faster document navigation with space-filling thumbnails (AC, CG, JA), pp. 1–10.
- CHI-2006-CutrellRDS #flexibility
- Fast, flexible filtering with phlat (EC, DCR, STD, RS), pp. 261–270.
- CHI-2006-EngLTCHV #adaptation #automation #behaviour #generative #predict
- Generating automated predictions of behavior strategically adapted to specific performance objectives (KE, RLL, IT, AC, AH, AHV), pp. 621–630.
- CHI-2006-GergleKF #collaboration #feedback #visual notation
- The impact of delayed visual feedback on collaborative performance (DG, REK, SRF), pp. 1303–1312.
- CHI-2006-MatthewsCRT #design #multi
- Clipping lists and change borders: improving multitasking efficiency with peripheral information design (TM, MC, GGR, DST), pp. 989–998.
- CHI-2006-WigdorSFB
- Effects of display position and control space orientation on user preference and performance (DW, CS, CF, RB), pp. 309–318.
- CSCW-2006-Danis #collaboration #learning
- Forms of collaboration in high performance computing: exploring implications for learning (CD), pp. 501–504.
- CSCW-2006-GutwinFWDB #network #realtime
- Improving network efficiency in real-time groupware with general message compression (CG, CF, MW, JD, TB), pp. 119–128.
- CSCW-2006-HauberRBC #social #trade-off
- Spatiality in videoconferencing: trade-offs between efficiency and social presence (JH, HR, MB, AC), pp. 413–422.
- CAiSE-2006-YangNLC #approach #outsourcing #query #xml
- An Efficient Approach to Support Querying Secure Outsourced XML Information (YY, WN, HLL, JC), pp. 157–171.
- EDOC-2006-ChowdharyPPCW #modelling
- Model-Driven Dashboards for Business Performance Reporting (PC, TP, FP, SKC, FYW), pp. 374–386.
- EDOC-2006-Hashemzadeh #navigation #network
- A Fast and Efficient Route Finding Method for Car Navigation Systems with Neural Networks (MH), pp. 423–426.
- EDOC-2006-TangCLZY #evaluation #security #web #web service
- A Performance Evaluation of Web Services Security (KT, SC, DL, JZ, BY), pp. 67–74.
- ICEIS-AIDSS-2006-JacquenetLU #approach #scalability
- Efficient Management of Non Redundant Rules in Large Pattern Bases: A Bitmap Approach (FJ, CL, CU), pp. 208–215.
- ICEIS-DISI-2006-SeoCSRZKB #reliability #streaming
- Reliable Performance Data Collection for Streaming Media Services (BS, MC, MS, SR, RZ, LIK, NB), pp. 124–129.
- ICEIS-DISI-2006-ZhengLOA #xml
- Efficient Mechanism for Handling Materialized XML Views (JZ, ACWL, TÖ, RA), pp. 151–162.
- ICEIS-ISAS-2006-HaiderK #evaluation #framework
- Performance Evaluation Framework for IT/IS Based Asset Management (AH, AK), pp. 355–365.
- CIKM-2006-AnagnostopoulosBP #classification #effectiveness
- Effective and efficient classification on a search-engine model (AA, AZB, KP), pp. 208–217.
- CIKM-2006-BaileyHM #documentation #enterprise #implementation #security #trade-off
- Secure search in enterprise webs: tradeoffs in efficient implementation for document level security (PB, DH, BM), pp. 493–502.
- CIKM-2006-BerberichBW #graph #rank #web
- Rank synopses for efficient time travel on the web graph (KB, SJB, GW), pp. 864–865.
- CIKM-2006-ChengSPSVX #nondeterminism
- Efficient join processing over uncertain data (RC, SS, SP, RS, JSV, YX), pp. 738–747.
- CIKM-2006-EguchiC #dependence #query
- Boosting relevance model performance with query term dependence (KE, WBC), pp. 792–793.
- CIKM-2006-GrecoRT #effectiveness #similarity
- Effective and efficient similarity search in time series (SG, MR, AT), pp. 808–809.
- CIKM-2006-HungC #multi #similarity
- Efficient range-constrained similarity search on wavelet synopses over multiple streams (HPH, MSC), pp. 327–336.
- CIKM-2006-JiangLH #algorithm #xml
- An efficient one-phase holistic twig join algorithm for XML data (ZJ, CL, WCH), pp. 786–787.
- CIKM-2006-KunkleZC #mining
- Efficient mining of max frequent patterns in a generalized environment (DK, DZ, GC), pp. 810–811.
- CIKM-2006-SchutzeVP #classification
- Performance thresholding in practical text classification (HS, EV, JOP), pp. 662–671.
- CIKM-2006-TrainaTVAF #query #similarity
- Efficient processing of complex similarity queries in RDBMS through query rewriting (CTJ, AJMT, MRV, ASA, CF), pp. 4–13.
- CIKM-2006-VieiraSPMCF #detection #robust #web
- A fast and robust method for web page template detection and removal (KV, ASdS, NP, ESdM, JMBC, JF), pp. 258–267.
- CIKM-2006-WangC #permutation #query #sequence
- Improving query I/O performance by permuting and refining block request sequences (XW, MC), pp. 652–661.
- CIKM-2006-WhiteK #case study #feedback #personalisation
- A study on the effects of personalization and task information on implicit feedback performance (RWW, DK), pp. 297–306.
- CIKM-2006-YeXLJBCK #analysis #linear
- Efficient model selection for regularized linear discriminant analysis (JY, TX, QL, RJ, JB, VC, CK), pp. 532–539.
- CIKM-2006-ZhouC #framework #novel #predict #query #ranking #robust
- Ranking robustness: a novel framework to predict query performance (YZ, WBC), pp. 567–574.
- ECIR-2006-AzzopardiL #multi
- An Efficient Computation of the Multiple-Bernoulli Language Model (LA, DEL), pp. 480–483.
- ECIR-2006-BernsteinC #scalability #sequence
- Fast Discovery of Similar Sequences in Large Genomic Collections (YB, MC), pp. 432–443.
- ECIR-2006-ChangP #query
- Efficient Phrase Querying with Common Phrase Index (MC, CKP), pp. 61–71.
- ECIR-2006-KohlschutterCN #parallel #rank
- Efficient Parallel Computation of PageRank (CK, PAC, WN), pp. 241–252.
- ICML-2006-BrefeldGSW
- Efficient co-regularised least squares regression (UB, TG, TS, SW), pp. 137–144.
- ICML-2006-Carreira-Perpinan #clustering #parametricity
- Fast nonparametric clustering with Gaussian blurring mean-shift (MÁCP), pp. 153–160.
- ICML-2006-DenisMR #classification #learning #naive bayes
- Efficient learning of Naive Bayes classifiers under class-conditional classification noise (FD, CNM, LR), pp. 265–272.
- ICML-2006-Haffner #kernel #learning
- Fast transpose methods for kernel learning on sparse data (PH), pp. 385–392.
- ICML-2006-KlaasBFDML
- Fast particle smoothing: if I had a million particles (MK, MB, NdF, AD, SM, DL), pp. 481–488.
- ICML-2006-LeordeanuH #approximate #energy
- Efficient MAP approximation for dense energy functions (ML, MH), pp. 545–552.
- ICML-2006-MaggioniM #analysis #evaluation #markov #multi #policy #process #using
- Fast direct policy evaluation using multiscale analysis of Markov diffusion processes (MM, SM), pp. 601–608.
- ICML-2006-Sarawagi #modelling #segmentation #sequence
- Efficient inference on sequence segmentation models (SS), pp. 793–800.
- ICML-2006-SimsekB
- An intrinsic reward mechanism for efficient exploration (ÖS, AGB), pp. 833–840.
- ICML-2006-TeoV #array #kernel #string #using
- Fast and space efficient string kernels using suffix arrays (CHT, SVNV), pp. 929–936.
- ICML-2006-XiKSWR #classification #reduction #using
- Fast time series classification using numerosity reduction (XX, EJK, CRS, LW, CAR), pp. 1033–1040.
- ICML-2006-ZhangK #kernel #matrix
- Block-quantized kernel matrix for fast spectral embedding (KZ, JTK), pp. 1097–1104.
- ICML-2006-ZhengW #lazy evaluation
- Efficient lazy elimination for averaged one-dependence estimators (FZ, GIW), pp. 1113–1120.
- ICPR-v1-2006-BauckhageK #detection #multi
- Fast, Illumination Insensitive Face Detection Based on Multilinear Techniques and Curvature Features (CB, TK), pp. 507–510.
- ICPR-v1-2006-BuenaposadaM #animation #independence #using
- Performance driven facial animation using illumination independent appearance-based tracking (JMB, EM), pp. 303–306.
- ICPR-v1-2006-CaparG #concurrent #recognition #segmentation
- Concurrent Segmentation and Recognition with Shape-Driven Fast Marching Methods (AÇ, MG), pp. 155–158.
- ICPR-v1-2006-ChenC #multi #quality
- New Efficient Octree Construction from Multiple Object Silhouettes with Construction Quality Control (ZC, HLC), pp. 127–130.
- ICPR-v1-2006-KimH #3d #image #multi #sequence
- Variational Multigrid for Fast 3D Interpretation of Image Sequences (JSK, KSH), pp. 267–270.
- ICPR-v1-2006-Li #algorithm #clustering
- A clustering Based Color Model and Fast Algorithm for Object Tracking (PL), pp. 671–674.
- ICPR-v1-2006-LiuD #analysis #linear #recognition
- Improve Handwritten Character Recognition Performance by Heteroscedastic Linear Discriminant Analysis (HL, XD), pp. 880–883.
- ICPR-v1-2006-Lopez-de-TeruelRF #3d #navigation #re-engineering #visual notation
- Efficient Monocular 3D Reconstruction from Segments for Visual Navigation in Structured Environments (PELdT, AR, LF), pp. 143–146.
- ICPR-v1-2006-LourakisA #3d #reliability
- Chaining Planar Homographies for Fast and Reliable 3D Plane Tracking (MIAL, AAA), pp. 582–586.
- ICPR-v1-2006-ParkAB #detection #metric
- Efficient Measurement of Eye Blinking under Various Illumination Conditions for Drowsiness Detection Systems (IP, JHA, HB), pp. 383–386.
- ICPR-v1-2006-RiusVGV
- Action Spaces for Efficient Bayesian Tracking of Human Motion (IR, XV, JG, JJV), pp. 472–475.
- ICPR-v1-2006-RoeckCG #3d #constraints
- Augmenting fast stereo with silhouette constraints for dynamic 3D capture (SDR, NC, LJVG), pp. 131–134.
- ICPR-v1-2006-Ueshiba #bidirectional #implementation #realtime
- An Efficient Implementation Technique of Bidirectional Matching for Real-time Trinocular Stereo Vision (TU), pp. 1076–1079.
- ICPR-v1-2006-ViswanathP #clustering #hybrid
- l-DBSCAN : A Fast Hybrid Density Based Clustering Method (PV, RP), pp. 912–915.
- ICPR-v1-2006-WangGLR #algorithm
- An efficient algorithm for fingerprint matching (CW, MLG, YL, JGR), pp. 1034–1037.
- ICPR-v1-2006-ZehnderKG #detection #multi
- Efficient, Simultaneous Detection of Multiple Object Classes (PZ, EKM, LJVG), pp. 797–802.
- ICPR-v1-2006-ZhangLSC #classification #corpus
- An Efficient SVM Classifier for Lopsided Corpora (XZ, BCL, WS, LC), pp. 1144–1147.
- ICPR-v2-2006-CaiUS #algorithm #online #recognition
- An Efficient Radical-Based Algorithm for Stroke-Order-Free Online Kanji Character Recognition (WC, SU, HS), pp. 986–989.
- ICPR-v2-2006-GorceP #algorithm #multi
- Fast Dichotomic Multiple Search Algorithm for Shortest Cirular Path (MdLG, NP), pp. 403–406.
- ICPR-v2-2006-HuDG #analysis #retrieval
- Improving Retrieval Performance by Global Analysis (JH, WD, JG), pp. 703–706.
- ICPR-v2-2006-Kittipanya-ngamC
- The effect of texture representations on AAM performance (PKn, TFC), pp. 328–331.
- ICPR-v2-2006-LuB #image #nearest neighbour #retrieval
- Fast Image Retrieval Based on Equal-average Equal-variance K-Nearest Neighbour Search (ZML, HB), p. 853–?.
- ICPR-v2-2006-MahiniKDD #locality
- An Efficient Features — Based License Plate Localization Method (HM, SK, FD, FD), pp. 841–844.
- ICPR-v2-2006-MitaKH #approach #categorisation #probability #robust
- A Probabilistic Approach to Fast and Robust Template Matching and its Application to Object Categorization (TM, TK, OH), pp. 597–601.
- ICPR-v2-2006-PungprasertyingCK #analysis #approach #learning #migration
- Migration Analysis: An Alternative Approach for Analyzing Learning Performance (PP, RC, BK), pp. 837–840.
- ICPR-v2-2006-ShimshoniRS #classification #image #verification
- Efficient Search and Verification for Function Based Classification from Real Range Images (IS, ER, OS), pp. 1118–1121.
- ICPR-v2-2006-ShiratoriGK #using
- An Efficient Text Capture Method for Moving Robots Using DCT Feature and Text Tracking (HS, HG, HK), pp. 1050–1053.
- ICPR-v2-2006-SunV #detection #linear #multi #using
- Fast Linear Feature Detection Using Multiple Directional Non-Maximum Suppression (CS, PV), pp. 288–291.
- ICPR-v2-2006-TangT #analysis #linear #using
- Fast Linear Discriminant Analysis Using Binary Bases (FT, HT), pp. 52–55.
- ICPR-v2-2006-ViswanathJ #clustering
- A Fast and Efficient Ensemble Clustering Method (PV, KJ), pp. 720–723.
- ICPR-v2-2006-Wang #component #detection #recognition
- Efficient Facial Component Extraction for Detection and Recognition (JWW), pp. 1208–1211.
- ICPR-v2-2006-WangZC #locality #using
- Efficient Topological Localization Using Orientation Adjacency Coherence Histograms (JW, HZ, RC), pp. 271–274.
- ICPR-v2-2006-ZouL #learning #sequence
- The Generalization Performance of Learning Machine Based on Phi-mixing Sequence (BZ, LL), pp. 548–551.
- ICPR-v3-2006-AbdallahHB #composition #image #robust #using
- A robust block-based image watermarking scheme using fast Hadamard transform and singular value decomposition (EEA, ABH, PB), pp. 673–676.
- ICPR-v3-2006-AnLV #classification
- Efficient Cross-validation of the Complete Two Stages in KFD Classifier Formulation (SA, WL, SV), pp. 240–244.
- ICPR-v3-2006-ArreolaFB #classification #linear #using
- Fast Support Vector Machine Classification using linear SVMs (KZA, JF, HB), pp. 366–369.
- ICPR-v3-2006-BaudrierMNR #comparison #quantifier
- A fast binary-image comparison method with local-dissimilarity quantification (EB, GM, FN, SR), pp. 216–219.
- ICPR-v3-2006-BelbachirG #image
- Medical Image Compression: Study of the Influence of Noise on the JPEG 2000 Compression Performance (ANB, PMG), pp. 893–896.
- ICPR-v3-2006-ChanL #algorithm #approximate #fault #multi
- Multiplierless Fast DCT Algorithms with Minimal Approximation Errors (RKWC, MCL), pp. 921–925.
- ICPR-v3-2006-HalavatiSTCR #approach #novel #recognition #robust #speech #word
- A Novel Approach to Very Fast and Noise Robust, Isolated Word Speech Recognition (RH, SBS, HT, AC, MR), pp. 190–193.
- ICPR-v3-2006-KananFE #locality #recognition #using
- An Efficient Face Recognition System Using a New Optimized Localization Method (HRK, KF, ME), pp. 564–567.
- ICPR-v3-2006-LiuWL #estimation
- Winner Update on Walsh-Hadamard Domain for Fast Motion Estimation (SWL, SDW, SHL), pp. 794–797.
- ICPR-v3-2006-LiZSCG #analysis #kernel #recognition
- Bagging Based Efficient Kernel Fisher Discriminant Analysis for Face Recognition (YL, BZ, SS, XC, WG), pp. 523–526.
- ICPR-v3-2006-NeubeckG
- Efficient Non-Maximum Suppression (AN, LJVG), pp. 850–855.
- ICPR-v3-2006-NodaNK
- Simple and Efficient Colorization in YCbCr Color Space (HN, MN, JK), pp. 685–688.
- ICPR-v3-2006-PengWT #image
- A New Efficient SVM-based Image Registration Method (DP, DW, JWT), pp. 782–785.
- ICPR-v3-2006-QinSL #analysis #feature model
- Efficient Feature Extraction Based on Regularized Uncorrelated Chernoff Discriminant Analysis (AKQ, PNS, ML), pp. 125–128.
- ICPR-v3-2006-QiuXT #clustering #feedback #kernel #using
- Efficient Relevance Feedback Using Semi-supervised Kernel-specified K-means Clustering (BQ, CX, QT), pp. 316–319.
- ICPR-v3-2006-SagheerTTAM #approach #feature model #multi #problem
- Fast Feature Extraction Approach for Multi-Dimension Feature Space Problems (AES, NT, RiT, DA, SM), pp. 417–420.
- ICPR-v3-2006-Sepp #3d
- Efficient Tracking in 6-DoF based on the Image-Constancy Assumption in 3-D (WS), pp. 59–62.
- ICPR-v3-2006-TanHYT #recognition
- Efficient Night Gait Recognition Based on Template Matching (DT, KH, SY, TT), pp. 1000–1003.
- ICPR-v3-2006-TianK06a #algorithm #distance #using
- An Efficient Algorithm for Point Matching Using Hilbert Scanning Distance (LT, SiK), pp. 873–876.
- ICPR-v3-2006-VandeportaeleCM #detection #image
- A Fast Detector of Line Images Acquired by an Uncalibrated Paracatadioptric Camera (BV, MC, PM), pp. 1042–1045.
- ICPR-v3-2006-WangB06b #multimodal #predict
- Performance Prediction for Multimodal Biometrics (RW, BB), pp. 586–589.
- ICPR-v3-2006-WongLY #classification
- Improving Text Classifier Performance based on AUC (AKSW, JWTL, DSY), pp. 268–271.
- ICPR-v4-2006-FilipHC #synthesis
- Fast Synthesis of Dynamic Colour Textures (JF, MH, DC), pp. 25–28.
- ICPR-v4-2006-KarthikJ #image #retrieval
- Efficient Region Based Indexing and Retrieval for Images with Elastic Bucket Tries (PSK, CVJ), pp. 169–172.
- ICPR-v4-2006-KiseNIY #approach #physics #recognition #towards
- Efficient Recognition of Planar Objects Based on Hashing of Keypoints — An Approach Towards Making the Physical World Clickable (KK, TN, MI, SY), pp. 813–816.
- ICPR-v4-2006-LeilaC #recognition #speech
- Efficient Gaussian Mixture for Speech Recognition (LZ, GC), pp. 294–297.
- ICPR-v4-2006-LienY #predict #using
- A Fast Mode Decision Method for H.264/AVC Using the Spatial-Temporal Prediction Scheme (CCL, CPY), pp. 334–337.
- ICPR-v4-2006-PhamS #approximate #classification #clustering #metric
- Metric tree partitioning and Taylor approximation for fast support vector classification (TVP, AWMS), pp. 132–135.
- ICPR-v4-2006-PratiSC
- Fast Dynamic Mosaicing and Person Following (AP, FS, RC), pp. 920–923.
- ICPR-v4-2006-WangS06c #multi #probability #visual notation
- Efficient Visual Tracking by Probabilistic Fusion of Multiple Cues (HW, DS), pp. 892–895.
- KDD-2006-AgarwalMPVZ #approximate #statistics
- Spatial scan statistics: approximations and performance study (DA, AM, JMP, SV, ZZ), pp. 24–33.
- KDD-2006-BrickellS
- Efficient anonymity-preserving data collection (JB, VS), pp. 76–85.
- KDD-2006-CarvalhoC #feature model #learning #online
- Single-pass online learning: performance, voting schemes and online feature selection (VRC, WWC), pp. 548–553.
- KDD-2006-FanD #bias #classification #framework #testing
- Reverse testing: an efficient framework to select amongst classifiers under sample selection bias (WF, ID), pp. 147–156.
- KDD-2006-FanMY #framework #random #summary
- A general framework for accurate and fast regression by data summarization in random decision trees (WF, JM, PSY), pp. 136–146.
- KDD-2006-HashimotoAUKM #mining #order #probability
- A new efficient probabilistic model for mining labeled ordered trees (KH, KFAK, NU, MK, HM), pp. 177–186.
- KDD-2006-KnobbeH
- Maximally informative k-itemsets and their efficient discovery (AJK, EKYH), pp. 237–244.
- KDD-2006-LoekitoB #diagrams #mining #using
- Fast mining of high dimensional expressive contrast patterns using zero-suppressed binary decision diagrams (EL, JB), pp. 307–316.
- KDD-2006-MessaoudBR #analysis #data transformation #multi
- Efficient multidimensional data representations based on multiple correspondence analysis (RBM, OB, SLR), pp. 662–667.
- KDD-2006-RattiganMJ #approximate #network #using
- Using structure indices for efficient approximation of network properties (MJR, MEM, DJ), pp. 357–366.
- KDD-2006-TongF #problem
- Center-piece subgraphs: problem definition and fast solutions (HT, CF), pp. 404–413.
- KDD-2006-TsangKK #feature model #kernel #set
- Efficient kernel feature extraction for massive data sets (IWT, AK, JTK), pp. 724–729.
- KR-2006-BesnardH #compilation #knowledge base #logic
- Knowledgebase Compilation for Efficient Logical Argumentation (PB, AH), pp. 123–133.
- SEKE-2006-HungL #data mining #mining #using
- Using Data Mining Schemes for Improvement on System Performance in Virtual Environments (SSH, DSML), pp. 61–66.
- SEKE-2006-Mayer #clustering #effectiveness #random testing #testing
- Efficient and Effective Random Testing based on Partitioning and Neighborhood (JM), pp. 479–484.
- SEKE-2006-ZhangCWH #component #evaluation #middleware
- Performance Evaluation of Component System based on Container style Middleware (YZ, NC, JW, TH), pp. 730–736.
- SIGIR-2006-BastW
- Type less, find more: fast autocompletion search with a succinct index (HB, IW), pp. 364–371.
- SIGIR-2006-ChaiBZ #assessment #automation #interactive
- Automated performance assessment in interactive QA (JYC, TB, CZ), pp. 631–632.
- SIGIR-2006-JinFM #analysis #consistency #feedback #nondeterminism
- Quantative analysis of the impact of judging inconsistency on the performance of relevance feedback (XJ, JCF, JM), pp. 655–656.
- SIGIR-2006-ShenCST #automation #database #identification #music #scalability #towards
- Towards efficient automated singer identification in large music databases (JS, BC, JS, KLT), pp. 59–66.
- SIGIR-2006-TurpinS #metric #precise
- User performance versus precision measures for simple search tasks (AT, FS), pp. 11–18.
- MoDELS-2006-BertolinoBAS #estimation #modelling #network
- Modeling and Early Performance Estimation for Network Processor Applications (AB, AB, GDA, ALSV), pp. 753–767.
- MoDELS-2006-BertolinoBAS #estimation #modelling #network
- Modeling and Early Performance Estimation for Network Processor Applications (AB, AB, GDA, ALSV), pp. 753–767.
- ECOOP-2006-WillisPN #java #query
- Efficient Object Querying for Java (DW, DJP, JN), pp. 28–49.
- OOPSLA-2006-BockischKHAM #control flow #quantifier
- Efficient control flow quantification (CB, SK, MH, MA, MM), pp. 125–138.
- OOPSLA-2006-DargaB #data type #model checking
- Efficient software model checking of data structure properties (PTD, CB), pp. 363–382.
- QAPL-2005-NicolaKLM06 #logic #towards
- Towards a Logic for Performance and Mobility (RDN, JPK, DL, MM), pp. 161–175.
- PADL-2006-NavasBH #analysis #clique #top-down #using
- Efficient Top-Down Set-Sharing Analysis Using Cliques (JAN, FB, MVH), pp. 183–198.
- PEPM-2006-LiuWGRCZZ #data access #implementation
- Core role-based access control: efficient implementations by transformations (YAL, CW, MG, TR, YC, YZ, JZ), pp. 112–120.
- PLDI-2006-Adl-TabatabaiLMMSS #compilation #memory management #runtime #transaction
- Compiler and runtime support for efficient software transactional memory (ARAT, BTL, VM, BRM, BS, TS), pp. 26–37.
- PLDI-2006-ErtlCG #automaton #flexibility #on-demand
- Fast and flexible instruction selection with on-demand tree-parsing automata (MAE, KC, DG), pp. 52–60.
- PLDI-2006-LauAHC #online #optimisation #using
- Online performance auditing: using hot optimizations without getting burned (JL, MA, MH, BC), pp. 239–251.
- PLDI-2006-ZhuangSCC #adaptation #profiling
- Accurate, efficient, and adaptive calling context profiling (XZ, MJS, HWC, JDC), pp. 263–271.
- POPL-2006-DanielssonHJG #reasoning
- Fast and loose reasoning is morally correct (NAD, JH, PJ, JG), pp. 206–217.
- PPDP-2006-ColazzoS #algorithm #xml
- An efficient algorithm for XML type projection (DC, CS), pp. 51–60.
- QAPL-2006-AldiniB #component #metric #specification
- Component-Oriented Specification of Performance Measures (AA, MB), pp. 27–43.
- SIGAda-2006-ShindiC #benchmark #metric
- Evaluate the performance changes of processor simulator benchmarks When context switches are incorporated (RSS, SC), pp. 9–14.
- FSE-2006-ZhangTG #execution #slicing #source code
- Dynamic slicing long running programs through execution fast forwarding (XZ, ST, RG), pp. 81–91.
- ICSE-2006-BaudryFT #fault #locality #testing
- Improving test suites for efficient fault localization (BB, FF, YLT), pp. 82–91.
- ICSE-2006-CeballosG #analysis
- P2P file sharing analysis for a better performance (MRC, JLG), pp. 941–944.
- ICSE-2006-FurusawaCW #analysis #design #modelling #overview
- Efficiency analysis of model-based review in actual software design (HF, EHC, HW), pp. 604–607.
- ICSE-2006-KrugerMM #architecture #aspect-oriented #using
- Efficient exploration of service-oriented architectures using aspects (IHK, RM, MM), pp. 62–71.
- ICSE-2006-VerlekarA #analysis #distributed
- A methodology and tool for performance analysis of distributed server systems (RPV, VA), pp. 913–916.
- ICSE-2006-WangJGLLW #approach #named #process #statistics
- BSR: a statistic-based approach for establishing and refining software process performance baseline (QW, NJ, LG, XL, ML, YW), pp. 585–594.
- SAC-2006-AbidinP #classification #data mining #mining #named #nearest neighbour #scalability
- SMART-TV: a fast and scalable nearest neighbor based classifier for data mining (TA, WP), pp. 536–540.
- SAC-2006-AgostaCPS #analysis #bytecode #compilation
- Selective compilation via fast code analysis and bytecode tracing (GA, SCR, PP, MS), pp. 906–911.
- SAC-2006-CortellessaMI #architecture #modelling
- Software performance model-driven architecture (VC, ADM, PI), pp. 1218–1223.
- SAC-2006-FassettiGT #biology
- Efficient discovery of loosely structured motifs in biological data (FF, GG, GT), pp. 151–155.
- SAC-2006-GiannettiFTNRC
- High performance XSL-FO rendering for variable data printing (FG, LGF, RT, TN, MR, MBC), pp. 811–817.
- SAC-2006-JinNCY #information retrieval #query #semantics
- Efficient query routing for information retrieval in semantic overlays (HJ, XN, HC, ZY), pp. 1669–1673.
- SAC-2006-LastovetskyRH #functional
- Building the functional performance model of a processor (ALL, RR, RH), pp. 746–753.
- SAC-2006-LiuHVY #feedback #scalability
- Efficient target search with relevance feedback for large CBIR systems (DL, KAH, KV, NY), pp. 1393–1397.
- SAC-2006-MadhukarA #adaptation #database #energy #mobile
- An adaptive energy efficient cache invalidation scheme for mobile databases (AM, RA), pp. 1122–1126.
- SAC-2006-MeerWA #bound #composition #interactive
- Efficient interactive configuration of unbounded modular systems (ERvdM, AW, HRA), pp. 409–414.
- SAC-2006-MeyerAWMF #grid #workflow
- Planning spatial workflows to optimize grid performance (LAVCM, JA, MW, MM, ITF), pp. 786–790.
- SAC-2006-NooriM #adaptation #embedded #evaluation
- Preliminary performance evaluation of an adaptive dynamic extensible processor for embedded applications (HN, KM), pp. 937–938.
- SAC-2006-PhanTB #benchmark #metric #mobile #protocol
- A benchmark on soap’s transport protocols performance for mobile applications (TKAP, ZT, PB), pp. 1139–1144.
- SAC-2006-RaptopoulouVM #query
- Efficient processing of past-future spatiotemporal queries (KR, MV, YM), pp. 68–72.
- SAC-2006-SasitornC #java #virtual machine
- Efficient first-class generics on stock Java virtual machines (JS, RC), pp. 1621–1628.
- SAC-2006-WolfG #development #named
- Good/fast/cheap: contexts, relationships and professional responsibility during software development (MJW, FSG), pp. 261–266.
- SAC-2006-WuKC #file system #memory management
- Efficient initialization and crash recovery for log-based file systems over flash memory (CHW, TWK, LPC), pp. 896–900.
- SAC-2006-YangYCW #grid #implementation
- Implementation of a dynamic adjustment mechanism with efficient replica selection in data grid environments (CTY, IHY, CHC, SYW), pp. 797–804.
- GPCE-2006-BinderH #bytecode #flexibility #metric
- Flexible and efficient measurement of dynamic bytecode metrics (WB, JH), pp. 171–180.
- ASPLOS-2006-EyermanEKS #architecture #component
- A performance counter architecture for computing accurate CPI components (SE, LE, TK, JES), pp. 175–184.
- ASPLOS-2006-KgilDSBDMRF #3d #energy #multi #named #using
- PicoServer: using 3D stacking technology to enable a compact energy efficient chip multiprocessor (TK, SD, AGS, NLB, RGD, TNM, SKR, KF), pp. 117–128.
- ASPLOS-2006-LeeB #architecture #modelling #predict
- Accurate and efficient regression modeling for microarchitectural performance and power prediction (BCL, DMB), pp. 185–194.
- ASPLOS-2006-ParasharSG #locality #multi #named #thread
- SlicK: slice-based locality exploitation for efficient redundant multithreading (AP, AS, SG), pp. 95–105.
- CASE-2006-ChengSOYII #scheduling
- A fast rescheduling method in semiconductor manufacturing allowing for tardiness and scheduling stability (MC, MS, JO, MY, HI, KI), pp. 100–105.
- CASE-2006-DingYZA #clustering #evaluation #multi #nondeterminism #optimisation #process #tool support
- Performance Evaluation and Schedule Optimization of Multi-Cluster Tools with Process Times Uncertainty (SD, JY, MTZ, RAT), pp. 112–117.
- CASE-2006-LiuWL #algorithm #petri net #set
- A fast algorithm to find a set of elementary siphons for a class of petri nets (XL, AW, ZL), pp. 399–404.
- CASE-2006-Mishima #development #evaluation
- Development of a micro manufacturing system and its efficiency evaluation method (NM), pp. 478–483.
- CASE-2006-ReveliotisB #algorithm #learning
- Efficient learning algorithms for episodic tasks with acyclic state spaces (SR, TB), pp. 411–418.
- CASE-2006-SunXZ #adaptation #correlation #self
- Self-adaptive Surge Adjustment based on Fast Correlation Integral Method in Centrifugal Compressors (TS, GX, CZ), pp. 661–666.
- CASE-2006-WuD #analysis #multi #network
- Performance analysis of complex supply chain networks with multi-product (YW, MD), pp. 630–635.
- CC-2006-LiuW #architecture #compilation #optimisation #perspective
- Performance Characterization of the 64-bit x86 Architecture from Compiler Optimizations’ Perspective (JL, YW), pp. 155–169.
- CC-2006-TokGL #analysis #data flow #interprocedural #pointer
- Efficient Flow-Sensitive Interprocedural Data-Flow Analysis in the Presence of Pointers (TBT, SZG, CL), pp. 17–31.
- CGO-2006-PanE #automation #compilation #distributed #effectiveness #optimisation
- Fast and Effective Orchestration of Compiler Optimizations for Automatic Performance Tuning (ZP, RE), pp. 319–332.
- DAC-2006-AtienzaVPPBMM #framework #multi
- A fast HW/SW FPGA-based thermal emulation framework for multi-processor system-on-chip (DA, PGDV, GP, FP, LB, GDM, JMM), pp. 618–623.
- DAC-2006-ChengDCW #algorithm #generative #power management #reduction
- A fast simultaneous input vector generation and gate replacement algorithm for leakage power reduction (LC, LD, DC, MDFW), pp. 117–120.
- DAC-2006-CongZ #algorithm #scheduling
- An efficient and versatile scheduling algorithm based on SDC formulation (JC, ZZ), pp. 433–438.
- DAC-2006-HatamkhaniLSY #design
- Power-centric design of high-speed I/Os (HH, FL, VS, CKKY), pp. 867–872.
- DAC-2006-HsuRKPB #data flow #graph #simulation
- Efficient simulation of critical synchronous dataflow graphs (CJH, SR, MYK, JLP, SSB), pp. 893–898.
- DAC-2006-HuAHKLSS #algorithm
- Fast algorithms for slew constrained minimum cost buffering (SH, CJA, JH, SKK, ZL, WS, CCNS), pp. 308–313.
- DAC-2006-HuebbersDI #parametricity #process
- Computation of accurate interconnect process parameter values for performance corners under process variations (FH, AD, YII), pp. 797–800.
- DAC-2006-LaiR #megamodelling #multi #robust
- A multilevel technique for robust and efficient extraction of phase macromodels of digitally controlled oscillators (XL, JSR), pp. 1017–1022.
- DAC-2006-LeungT #scheduling
- Optimal link scheduling on improving best-effort and guaranteed services performance in network-on-chip systems (LFL, CYT), pp. 833–838.
- DAC-2006-LinZ #algorithm #constraints
- An efficient retiming algorithm under setup and hold constraints (CL, HZ), pp. 945–950.
- DAC-2006-LoiASLSB #3d #analysis
- A thermally-aware performance analysis of vertically integrated (3-D) processor-memory hierarchy (GLL, BA, NS, SCL, TS, KB), pp. 991–996.
- DAC-2006-LuoNP #design #incremental
- A new LP based incremental timing driven placement for high performance designs (TL, DN, DZP), pp. 1115–1120.
- DAC-2006-PaulFOL #analysis #modelling
- Modeling and analysis of circuit performance of ballistic CNFET (BCP, SF, MO, TL), pp. 717–722.
- DAC-2006-PeranandamNRWKR #bound
- Fast falsification based on symbolic bounded property checking (PMP, PKN, JR, RJW, TK, WR), pp. 1077–1082.
- DAC-2006-SafarpourVBY #satisfiability
- Efficient SAT-based Boolean matching for FPGA technology mapping (SS, AGV, GB, RY), pp. 466–471.
- DAC-2006-ShiC #array
- Efficient escape routing for hexagonal array of high density I/Os (RS, CKC), pp. 1003–1008.
- DAC-2006-SuhendraMRC #analysis #detection
- Efficient detection and exploitation of infeasible paths for software timing analysis (VS, TM, AR, TC), pp. 358–363.
- DAC-2006-VianaGKBV #configuration management
- Configurable cache subsetting for fast cache tuning (PV, AGR, EJK, EB, FV), pp. 695–700.
- DAC-2006-VimjamH #identification #induction #satisfiability
- Fast illegal state identification for improving SAT-based induction (VCV, MSH), pp. 241–246.
- DAC-2006-WongB #multi #polynomial
- Multi-shift quadratic alternating direction implicit iteration for high-speed positive-real balanced truncation (NW, VB), pp. 257–260.
- DAC-2006-WongC #matrix
- A fast passivity test for descriptor systems via structure-preserving transformations of Skew-Hamiltonian/Hamiltonian matrix pencils (NW, CKC), pp. 261–266.
- DAC-2006-YuSH #analysis #grid #order #power management #reduction
- Fast analysis of structured power grid by triangularization based structure preserving model order reduction (HY, YS, LH), pp. 205–210.
- DAC-2006-ZhaoPSYF #algorithm #linear #megamodelling #programming #using
- A fast on-chip decoupling capacitance budgeting algorithm using macromodeling and linear programming (MZ, RP, SS, SY, YF), pp. 217–222.
- DATE-2006-AhmedM #design #uml #using
- Faster exploration of high level design alternatives using UML for better partitions (WA, DM), pp. 579–580.
- DATE-2006-Albrecht #incremental #latency #scalability #scheduling
- Efficient incremental clock latency scheduling for large circuits (CA), pp. 1091–1096.
- DATE-2006-BernasconiCDV #network
- Efficient minimization of fully testable 2-SPP networks (AB, VC, RD, TV), pp. 1300–1305.
- DATE-2006-DensmoreDS #analysis #architecture
- FPGA architecture characterization for system level performance analysis (DD, AD, ALSV), pp. 734–739.
- DATE-2006-DuttA #incremental #locality #using
- Efficient timing-driven incremental routing for VLSI circuits using DFS and localized slack-satisfaction computations (SD, HA), pp. 768–773.
- DATE-2006-EyermanEB #design #embedded
- Efficient design space exploration of high performance embedded out-of-order processors (SE, LE, KDB), pp. 351–356.
- DATE-2006-GuillotBRCGA #diagrams #using
- Efficient factorization of DSP transforms using taylor expansion diagrams (JG, EB, QR, MJC, DGP, SA), pp. 754–755.
- DATE-2006-GuzWBCGK #capacity #design
- Efficient link capacity and QoS design for network-on-chip (ZG, IW, EB, IC, RG, AK), pp. 9–14.
- DATE-2006-HabibiTSLM #using #verification
- Efficient assertion based verification using TLM (AH, ST, AS, DL, OAM), pp. 106–111.
- DATE-2006-HealyVEBLLL #architecture #trade-off
- Microarchitectural floorplanning under performance and thermal tradeoff (MBH, MV, ME, CSB, SKL, HHSL, GHL), pp. 1288–1293.
- DATE-2006-IzosimovPEP #distributed #embedded #fault tolerance #synthesis #trade-off
- Synthesis of fault-tolerant schedules with transparency/performance trade-offs for distributed embedded systems (VI, PP, PE, ZP), pp. 706–711.
- DATE-2006-KavousianosKN #multi #testing #using
- Efficient test-data compression for IP cores using multilevel Huffman coding (XK, EK, DN), pp. 1033–1038.
- DATE-2006-KempfKWALM #estimation #fine-grained #framework #using
- A SW performance estimation framework for early system-level-design using fine-grained instrumentation (TK, KK, SW, GA, RL, HM), pp. 468–473.
- DATE-2006-KunzliPBT #analysis #formal method #simulation
- Combining simulation and formal methods for system-level performance analysis (SK, FP, LB, LT), pp. 236–241.
- DATE-2006-LiCY #adaptation #embedded #energy #optimisation #realtime
- Performance optimization for energy-aware adaptive checkpointing in embedded real-time systems (ZL, HC, SY), pp. 678–683.
- DATE-2006-LiuBCLM #architecture #hardware
- Hardware efficient architectures for Eigenvalue computation (YL, CSB, PYKC, PHWL, SJM), pp. 953–958.
- DATE-2006-MatulaM #algorithm #float #formal method #generative #standard #traversal #verification
- A formal model and efficient traversal algorithm for generating testbenches for verification of IEEE standard floating point division (DWM, LDM), pp. 1134–1138.
- DATE-2006-McConaghyG #canonical #modelling
- Double-strength CAFFEINE: fast template-free symbolic modeling of analog circuits via implicit canonical form functions and explicit introns (TM, GGEG), pp. 269–274.
- DATE-2006-MeiR #analysis #using
- Efficient AC analysis of oscillators using least-squares methods (TM, JSR), pp. 263–268.
- DATE-2006-MolnosHCE #composition #multi
- Compositional, efficient caches for a chip multi-processor (AMM, MJMH, SDC, JTJvE), pp. 345–350.
- DATE-2006-MonchieroPSV #hardware #optimisation
- Power/performance hardware optimization for synchronization intensive applications in MPSoCs (MM, GP, CS, OV), pp. 606–611.
- DATE-2006-NakamuraST #integration #simulation
- An efficient and portable scheduler for RTOS simulation and its certified integration to SystemC (HN, NS, NT), pp. 1157–1158.
- DATE-2006-ParkESNDP #automation #embedded #generative
- Automatic generation of operation tables for fast exploration of bypasses in embedded processors (SP, EE, AS, AN, ND, YP), pp. 1197–1202.
- DATE-2006-PaulKKAR #design #estimation #reliability
- Temporal performance degradation under NBTI: estimation and design for improved reliability of nanoscale circuits (BCP, KK, HK, MAA, KR), pp. 780–785.
- DATE-2006-RaoCBS #algorithm #fault
- An efficient static algorithm for computing the soft error rates of combinational circuits (RRR, KC, DB, DS), pp. 164–169.
- DATE-2006-RobellySCF #architecture #design #energy #programmable #trade-off
- Energy efficiency vs. programmability trade-off: architectures and design principles (PR, HS, KCC, GF), pp. 587–592.
- DATE-2006-Ruiz-SautuaMMH #multi #optimisation
- Pre-synthesis optimization of multiplications to improve circuit performance (RRS, MCM, JMM, RH), pp. 1306–1311.
- DATE-2006-StreubuhrFHTDS #architecture #modelling #multi #realtime
- Task-accurate performance modeling in SystemC for real-time multi-processor architectures (MS, JF, CH, JT, RD, TS), pp. 480–481.
- DATE-2006-SutharD #detection #fault #multi #online #testing
- Efficient on-line interconnect testing in FPGAs with provable detectability for multiple faults (VS, SD), pp. 1165–1170.
- DATE-2006-ViaudPG #modelling #parallel #simulation
- An efficient TLM/T modeling and simulation environment based on conservative parallel discrete event principles (EV, FP, AG), pp. 94–99.
- DATE-2006-ViehlSBR #analysis #design #modelling #simulation #uml
- Formal performance analysis and simulation of UML/SysML models for ESL design (AV, TS, OB, WR), pp. 242–247.
- DATE-2006-WandelerMT #analysis #realtime
- Performance analysis of greedy shapers in real-time systems (EW, AM, LT), pp. 444–449.
- DATE-2006-WangBC #using
- Efficient unknown blocking using LFSR reseeding (SW, KJB, STC), pp. 1051–1052.
- DATE-2006-WildHO #architecture #evaluation #simulation #transaction #using
- Performance evaluation for system-on-chip architectures using trace-based transaction level simulation (TW, AH, RO), pp. 248–253.
- DATE-2006-YangV #analysis #evaluation #synthesis
- Efficient temperature-dependent symbolic sensitivity analysis and symbolic performance evaluation in analog circuit synthesis (HY, RV), pp. 283–284.
- DATE-2006-ZmilyK #embedded #energy
- Simultaneously improving code size, performance, and energy in embedded processors (AZ, CK), pp. 224–229.
- DATE-DF-2006-AarajRRJ #architecture #authentication #embedded
- Architectures for efficient face authentication in embedded systems (NA, SR, AR, NKJ), pp. 1–6.
- DATE-DF-2006-BannowHR #automation #clustering #design #evaluation
- Automatic systemC design configuration for a faster evaluation of different partitioning alternatives (NB, KH, WR), pp. 217–218.
- DATE-DF-2006-DumitrascuBPBJ #flexibility #framework #platform
- Flexible MPSoC platform with fast interconnect exploration for optimal system performance for a specific application (FD, IB, LP, MB, AAJ), pp. 166–171.
- DATE-DF-2006-VeredasSP #automation
- Automated conversion from a LUT-based FPGA to a LUT-based MPGA with fast turnaround time (FJV, MS, HJP), pp. 36–41.
- HPCA-2006-HuKLS #approach #implementation
- An approach for implementing efficient superscalar CISC processors (SH, IK, MHL, JES), pp. 41–52.
- HPCA-2006-JaleelMJ #case study #data mining #mining #parallel
- Last level cache (LLC) performance of data mining workloads on a CMP — a case study of parallel bioinformatics workloads (AJ, MM, BLJ), pp. 88–98.
- HPCA-2006-JosephVT #analysis #linear #modelling #using
- Construction and use of linear regression models for processor performance analysis (PJJ, KV, MJT), pp. 99–108.
- HPCA-2006-KumarA #concurrent #detection #fault
- Reducing resource redundancy for concurrent error detection techniques in high performance microprocessors (SK, AA), pp. 212–221.
- HPCA-2006-NakanoMGT #named
- ReViveI/O: efficient handling of I/O in highly-available rollback-recovery servers (JN, PM, KG, JT), pp. 200–211.
- HPCA-2006-PujaraA
- Increasing the cache efficiency by eliminating noise (PP, AA), pp. 145–154.
- HPCA-2006-SharkeyP #smt
- Efficient instruction schedulers for SMT processors (JJS, DVP), pp. 288–298.
- HPCA-2006-YuSHACGMPERTLG
- High performance file I/O for the Blue Gene/L supercomputer (HY, RKS, CH, GA, JGC, MG, JEM, JJP, TE, RBR, RT, RL, WDG), pp. 187–196.
- HPDC-2006-AliL #using
- Improving the Performance of Remote I/O Using Asynchronous Primitives (NA, ML), pp. 218–228.
- HPDC-2006-BuissonAP #adaptation #parallel
- Performance and Practicability of Dynamic Adaptation for Parallel Computing (JB, FA, JLP), pp. 331–332.
- HPDC-2006-CaiKS #data type #named #network #predict
- IQ-Paths: Predictably High Performance Data Streams across Dynamic Network Overlays (ZC, VK, KS), pp. 18–29.
- HPDC-2006-ChungH #automation #case study #scalability #source code #using
- A Case Study Using Automatic Performance Tuning for Large-Scale Scientific Programs (IHC, JKH), pp. 45–56.
- HPDC-2006-GlatardMP #composition #data-driven
- Efficient services composition for grid-enabled data-intensive applications (TG, JM, XP), pp. 333–334.
- HPDC-2006-GoscinskiA #named #virtual machine
- Motor: A Virtual Machine for High Performance Computing (WG, DA), pp. 171–182.
- HPDC-2006-SandholmLOO #grid #predict #resource management #using
- Market-Based Resource Allocation using Price Prediction in a High Performance Computing Grid for Scientific Applications (TS, KL, JAO, JO), pp. 132–143.
- HPDC-2006-WuB #adaptation #clustering
- Improving I/O Performance of Clustered Storage Systems by Adaptive Request Distribution (CW, RCB), pp. 207–217.
- HPDC-2006-YehAWCT #using
- Using File Grouping to Improve the Disk Performance (TY, JA, JSW, IFC, KHT), pp. 365–366.
- ISMM-2006-AgaramKLM #data type #memory management
- Decomposing memory performance: data structures and phases (KKA, SWK, CL, KSM), pp. 95–103.
- ISMM-2006-HuangBGM #order
- Fast and efficient partial code reordering: taking advantage of dynamic recompilatior (XH, SMB, DG, KSM), pp. 184–192.
- LCTES-2006-EdwardsT #code generation #modelling
- Efficient code generation from SHIM models (SAE, OT), pp. 125–134.
- LCTES-2006-SandbergEGL #analysis #slicing
- Faster WCET flow analysis by program slicing (CS, AE, JG, BL), pp. 103–112.
- PDP-2006-BrinkmannEHV #adaptation
- Influence of Adaptive Data Layouts on Performance in Dynamically Changing Storage Environments (AB, SE, MH, MV), pp. 155–162.
- PDP-2006-DortaLR #analysis #bound
- Performance Analysis of Branch-and-Bound Skeletons (ID, CL, CR), pp. 75–82.
- PDP-2006-GrossBK #communication #development #named
- MatchBase: A Development Suite for Efficient Context-Aware Communication (TG, SB, SK), pp. 308–315.
- PDP-2006-janb
- Performance Features of Global States Based Application Control (jj), pp. 276–279.
- PDP-2006-MarzollaO #network #peer-to-peer #query
- Tree Vector Indexes: Efficient Range Queries for Dynamic Content on Peer-to-Peer Networks (MM, MM, SO), pp. 457–464.
- PDP-2006-NiksereshtG #distributed #learning #multi #retrieval #scalability
- Fast Decentralized Learning of a Gaussian Mixture Model for Large-Scale Multimedia Retrieval (AN, MG), pp. 373–379.
- PDP-2006-ParkD #pattern matching
- High Performance Pattern Matching with Dynamic Load Balancing on Heterogeneous Systems (JHP, BAD), pp. 285–290.
- PPoPP-2006-AlamVAG #simulation
- Performance characterization of molecular dynamics techniques for biomolecular simulations (SRA, JSV, PKA, AG), pp. 59–68.
- PPoPP-2006-ChristodoulopoulouMBA #clustering
- Fast and transparent recovery for continuous availability of cluster-based servers (RC, KM, AB, CA), pp. 221–229.
- PPoPP-2006-HuangZKK #adaptation #evaluation
- Performance evaluation of adaptive MPI (CH, GZ, LVK, SK), pp. 12–21.
- PPoPP-2006-RothM #automation #online #process
- On-line automated performance diagnosis on thousands of processes (PCR, BPM), pp. 69–80.
- PPoPP-2006-SahaAHMH #manycore #memory management #named #runtime #transaction
- McRT-STM: a high performance software transactional memory system for a multi-core runtime (BS, ARAT, RLH, CCM, BH), pp. 187–197.
- PPoPP-2006-SharapovKDCR #case study #estimation #parallel #scalability #top-down
- A case study in top-down performance estimation for a large-scale parallel application (IS, RK, GD, RC, MR), pp. 81–89.
- PPoPP-2006-WangS #concurrent #detection #fault #runtime #source code
- Accurate and efficient runtime detection of atomicity errors in concurrent programs (LW, SDS), pp. 137–146.
- STOC-2006-AilonC #approximate #nearest neighbour
- Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform (NA, BC), pp. 557–563.
- STOC-2006-Antonakopoulos #bound #protocol
- Fast leader-election protocols with bounded cheaters’ edge (SA), pp. 187–196.
- STOC-2006-DubrovI #complexity #on the
- On the randomness complexity of efficient sampling (BD, YI), pp. 711–720.
- STOC-2006-FischerRV #adaptation #convergence
- Fast convergence to Wardrop equilibria by adaptive sampling methods (SF, HR, BV), pp. 653–662.
- STOC-2006-NguyenV #proving
- Zero knowledge with efficient provers (MHN, SPV), pp. 287–295.
- STOC-2006-PanagiotouS #metric #on the
- On adequate performance measures for paging (KP, AS), pp. 487–496.
- STOC-2006-Plandowski #algorithm #equation #word
- An efficient algorithm for solving word equations (WP), pp. 467–476.
- TACAS-2006-LiS #abstraction #bound #model checking #refinement
- Efficient Abstraction Refinement in Interpolation-Based Unbounded Model Checking (BL, FS), pp. 227–241.
- TACAS-2006-NiebertP #ltl #model checking #partial order
- Efficient Model Checking for LTL with Partial Order Snapshots (PN, DP), pp. 272–286.
- TACAS-2006-ThomasCP #reachability #using
- Efficient Guided Symbolic Reachability Using Reachability Expressions (DT, SC, PKP), pp. 120–134.
- CAV-2006-BardinLP
- FAST Extended Release (SB, JL, GP), pp. 63–66.
- CAV-2006-DutertreM
- A Fast Linear-Arithmetic Solver for DPLL(T) (BD, LMdM), pp. 81–94.
- CAV-2006-KloseTWW #sequence chart #verification
- Check It Out: On the Efficient Formal Verification of Live Sequence Charts (JK, TT, BW, HW), pp. 219–233.
- CAV-2006-LahiriNO #abstraction #smt
- SMT Techniques for Fast Predicate Abstraction (SKL, RN, AO), pp. 424–437.
- CAV-2006-Lev-AmiIS #abstraction #analysis #precise
- Abstraction for Shape Analysis with Fast and Precise Transformers (TLA, NI, SS), pp. 547–561.
- CAV-2006-RoyZFH #consistency #memory management #polynomial #verification
- Fast and Generalized Polynomial Time Memory Consistency Verification (AR, SZ, CJF, JCH), pp. 503–516.
- ICLP-2006-Pientka #framework #logic #verification
- Overcoming Performance Barriers: Efficient Verification Techniques for Logical Frameworks (BP), pp. 3–10.
- ICLP-2006-Tu #reasoning
- Efficient Reasoning About Action and Change in the Presence of Incomplete Information and Its Application in Planning (PHT), pp. 469–470.
- IJCAR-2006-Mahboubi #algorithm #implementation #proving
- Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials (AM), pp. 438–452.
- ISSTA-2006-LenceviciusM #mobile
- Performance assertions for mobile devices (RL, EM), pp. 225–232.
- LICS-2006-PitermanP #game studies
- Faster Solutions of Rabin and Streett Games (NP, AP), pp. 275–284.
- SAT-2006-BulatovS
- Efficiency of Local Search (AAB, ESS), pp. 297–310.
- SAT-2006-CottonM #constraints #difference #flexibility
- Fast and Flexible Difference Constraint Propagation for DPLL(T) (SC, OM), pp. 170–183.
- SAT-2006-DantsinW #constant #satisfiability
- MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s2) Time (ED, AW), pp. 266–276.
- SAT-2006-SabharwalAGHS #modelling #symmetry
- QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency (AS, CA, CPG, JWH, BS), pp. 382–395.
- TestCom-2006-CsorbaPDC #analysis #concurrent
- Performance Analysis of Concurrent PCOs in TTCN-3 (MJC, SP, SD, GC), pp. 149–160.
- VMCAI-2006-SankaranarayananCSM #analysis #relational
- Efficient Strongly Relational Polyhedral Analysis (SS, MC, HBS, ZM), pp. 111–125.
- CBSE-2005-Dolstra #component #deployment #functional
- Efficient Upgrading in a Purely Functional Component Deployment Model (ED), pp. 219–234.
- CBSE-2005-LiuG #predict #protocol #using
- Performance Prediction of J2EE Applications Using Messaging Protocols (YL, IG), pp. 1–16.
- CBSE-2005-SharmaJT #architecture
- Evaluating Performance Attributes of Layered Software Architecture (VSS, PJ, KST), pp. 66–81.
- WICSA-2005-JooliaBCG #component #configuration management #framework #platform #runtime #specification
- Mapping ADL Specifications to an Efficient and Reconfigurable Runtime Component Platform (AJ, TVB, GC, ATAG), pp. 131–140.
- DocEng-2005-AvilaL #algorithm #detection #documentation #image
- A fast orientation and skew detection algorithm for monochromatic document images (BTÁ, RDL), pp. 118–126.
- DocEng-2005-HuangCL #documentation #xml
- Prefiltering techniques for efficient XML document processing (CHH, TRC, HML), pp. 149–158.
- ECDL-2005-SalampasisT #distributed #hypermedia #library
- The Effect of Collection Fusion Strategies on Information Seeking Performance in Distributed Hypermedia Digital Libraries (MS, JT), pp. 57–68.
- ICDAR-2005-AradhyeMH #analysis #categorisation #email #image
- Image Analysis for Efficient Categorization of Image-based Spam E-mail (HBA, GKM, JAH), pp. 914–918.
- ICDAR-2005-ChellapillaSN #documentation #recognition
- Fast Optical Character Recognition through Glyph Hashing for Document Conversion (KC, PYS, RN), pp. 829–834.
- ICDAR-2005-ChuZZT #approach #documentation #image
- A Fast and Stable Approach for Restoration of Warped Document Images (KBC, LZ, YZ, CLT), pp. 384–388.
- ICDAR-2005-DecerboNPM
- Performance Improvements to the BBN Byblos OCR System (MD, PN, RP, EM), pp. 411–415.
- ICDAR-2005-LamH #data type #using
- A Data Structure Using Hashing and Tries For Efficient Chinese Lexical Access (YKL, QH), pp. 506–510.
- ICDAR-2005-LeeH #recognition
- Performance Improvement Techniques for Chinese Character Recognition (HJL, JTH), pp. 710–715.
- ICDAR-2005-LeeI #recognition #word
- A Simple and Efficient Method for Global Handwritten Word Recognition Applied to Brazilian Bankchecks (LLL, SI), pp. 950–955.
- ICDAR-2005-LiangNSV #2d #algorithm #geometry #parsing
- Efficient Geometric Algorithms for Parsing in Two Dimensions (PL, MN, MS, PAV), pp. 1172–1177.
- ICDAR-2005-LiuLCL #recognition
- Fast Vector Matching Methods and Their Applications to Handwriting Recognition (YHL, WHL, FC, CCL), pp. 871–877.
- ICDAR-2005-LucasC #grid
- Fast Convolutional OCR with the Scanning N-Tuple Grid (SML, KTC), pp. 799–805.
- ICDAR-2005-Schambach #recognition #scalability #word
- Fast Script Word Recognition with Very Large Vocabulary (MPS), pp. 9–13.
- PODS-2005-CormodeM #mining #multi
- Space efficient mining of multigraph streams (GC, SM), pp. 271–282.
- PODS-2005-SakuraiYF #distance #named #similarity
- FTW: fast similarity search under the time warping distance (YS, MY, CF), pp. 326–337.
- SIGMOD-2005-CataniaWOW #lazy evaluation #xml
- Lazy XML Updates: Laziness as a Virtue of Update and Structural Join Efficiency (BC, WQW, BCO, XW), pp. 515–526.
- SIGMOD-2005-ChenN #multi #query
- Efficient Computation of Multiple Group By Queries (ZC, VRN), pp. 263–274.
- SIGMOD-2005-ChenOO #robust #similarity
- Robust and Fast Similarity Search for Moving Object Trajectories (LC, MTÖ, VO), pp. 491–502.
- SIGMOD-2005-FuxmanFM #consistency #database #named
- ConQuer: Efficient Management of Inconsistent Databases (AF, EF, RJM), pp. 155–166.
- SIGMOD-2005-GovindarajuRM #approximate #mining #using
- Fast and Approximate Stream Mining of Quantiles and Frequencies Using Graphics Processors (NKG, NR, DM), pp. 611–622.
- SIGMOD-2005-JahangiriSS #maintenance #multi #named
- SHIFT-SPLIT: I/O Efficient Maintenance of Wavelet-Transformed Multidimensional Data (MJ, DS, CS), pp. 275–286.
- SIGMOD-2005-LeFevreDR #named
- Incognito: Efficient Full-Domain K-Anonymity (KL, DJD, RR), pp. 49–60.
- SIGMOD-2005-ManjhiNG #network #robust
- Tributaries and Deltas: Efficient and Robust Aggregation in Sensor Network Streams (AM, SN, PBG), pp. 287–298.
- SIGMOD-2005-PapadiasMH #clustering #concept #monitoring #nearest neighbour
- Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring (KM, MH, DP), pp. 634–645.
- SIGMOD-2005-TaoYPMH #named #optimisation
- RPJ: Producing Fast Join Results on Streams through Rate-based Optimization (YT, MLY, DP, MH, NM), pp. 371–382.
- SIGMOD-2005-XuP #database #keyword #xml
- Efficient Keyword Search for Smallest LCAs in XML Databases (YX, YP), pp. 537–538.
- VLDB-2005-AbadiML #detection #named #network #robust
- REED: Robust, Efficient Filtering and Event Detection in Sensor Networks (DJA, SM, WL), pp. 769–780.
- VLDB-2005-ChoC #approach #network #query #scalability
- An Efficient and Scalable Approach to CNN Queries in a Road Network (HJC, CWC), pp. 865–876.
- VLDB-2005-ChongDES #query #rdf
- An Efficient SQL-based RDF Querying Scheme (EIC, SD, GE, JS), pp. 1216–1227.
- VLDB-2005-ErcegovacDR #benchmark #metric #query #relational
- The TEXTURE Benchmark: Measuring Performance of Text Queries on a Relational DBMS (VE, DJD, RR), pp. 313–324.
- VLDB-2005-FaginKKNST #database #implementation #multi #scalability
- Efficient Implementation of Large-Scale Multi-Structural Databases (RF, PGK, RK, JN, DS, AT), pp. 958–969.
- VLDB-2005-FuxmanFM #consistency #database #named #query
- ConQuer: A System for Efficient Querying Over Inconsistent Databases (AF, DF, RJM), pp. 1354–1357.
- VLDB-2005-Galindo-LegariaGKW #database #query
- Database Change Notifications: Primitives for Efficient Database Query Result Caching (CAGL, TG, CK, FW), pp. 1275–1278.
- VLDB-2005-Guha #algorithm
- Space Efficiency in Synopsis Construction Algorithms (SG), pp. 409–420.
- VLDB-2005-GuhaS #algorithm #data type
- Offline and Data Stream Algorithms for Efficient Computation of Synopsis Structures (SG, KS), p. 1364.
- VLDB-2005-KimWLL #n-gram #named
- n-Gram/2L: A Space and Time Efficient Two-Level n-Gram Inverted Index Structure (MSK, KYW, JGL, MJL), pp. 325–336.
- VLDB-2005-Lawrence #algorithm #configuration management
- Early Hash Join: A Configurable Algorithm for the Efficient and Early Production of Join Results (RL), pp. 841–852.
- VLDB-2005-LiA #evaluation #streaming #xquery
- Efficient Evaluation of XQuery over Streaming Data (XL, GA), pp. 265–276.
- VLDB-2005-LuLCC #encoding #pattern matching #xml
- From Region Encoding To Extended Dewey: On Efficient Processing of XML Twig Pattern Matching (JL, TWL, CYC, TC), pp. 193–204.
- VLDB-2005-PetrovicLJ #documentation #named
- CMS-ToPSS: Efficient Dissemination of RSS Documents (MP, HL, HAJ), pp. 1279–1282.
- VLDB-2005-RaseticSEN
- A Trajectory Splitting Model for Efficient Spatio-Temporal Indexing (SR, JS, JE, MAN), pp. 934–945.
- VLDB-2005-TheobaldSW #query
- An Efficient and Versatile Query Engine for TopX Search (MT, RS, GW), pp. 625–636.
- VLDB-2005-WangWLJLL #query #using #xml
- Efficient Processing of XML Path Queries Using the Disk-based F&B Index (WW, HW, HL, HJ, XL, JL), pp. 145–156.
- VLDB-2005-YuanLLWYZ
- Efficient Computation of the Skyline Cube (YY, XL, QL, WW, JXY, QZ), pp. 241–252.
- VLDB-2005-ZhouCRS #database #multi #thread
- Improving Database Performance on Simultaneous Multithreading Processors (JZ, JC, KAR, MS), pp. 49–60.
- ITiCSE-2005-Hanks #distributed #programming #student
- Student performance in CS1 with distributed pair programming (BH), pp. 316–320.
- ITiCSE-2005-Hause #development #distributed
- Distributed team performance in software development (MLH), p. 357.
- CSMR-2005-HostJ #predict
- Performance Prediction Based on Knowledge of Prior Product Versions (MH, EJ), pp. 12–20.
- ICSM-2005-Demeyer #morphism #polymorphism #question #what
- Refactor Conditionals into Polymorphism: What’s the Performance Cost of Introducing Virtual Calls? (SD), pp. 627–630.
- ICSM-2005-JansenBBN #case study #development #enterprise #maintenance
- Integrated Development and Maintenance of Software Products to Support Efficient Updating of Customer Configurations: A Case Study in Mass Market ERP Software (SJ, SB, GB, AvN), pp. 253–262.
IWPC-2005-Reiss05a #concurrent #java #monitoring #thread- Efficient Monitoring and Display of Thread State in Java (SPR), pp. 247–256.
- MSR-2005-MierleLRW #cvs #mining #repository #student
- Mining student CVS repositories for performance indicators (KM, KL, STR, GW), pp. 105–109.
- PASTE-2005-PrivatD #compilation #object-oriented #static analysis
- Link-time static analysis for efficient separate compilation of object-oriented languages (JP, RD), pp. 20–27.
- SCAM-2005-Anderson #xml
- The Performance Penalty of XML for Program Intermediate Representations (PA), pp. 193–202.
- SCAM-2005-JonesK #analysis #garbage collection #thread
- A Fast Analysis for Thread-Local Garbage Collection with Dynamic Class Loading (REJ, ACK), pp. 129–138.
- ICALP-2005-Ambuhl #algorithm #bound #energy #network
- An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks (CA), pp. 1139–1150.
- ICALP-2005-BilleG #problem
- The Tree Inclusion Problem: In Optimal Space and Faster (PB, ILG), pp. 66–77.
- ICALP-2005-EliasL
- Fast Neighbor Joining (IE, JL), pp. 1263–1274.
- ICALP-2005-Farach-ColtonLST #approximate #string
- Optimal Spaced Seeds for Faster Approximate String Matching (MFC, GML, SCS, DT), pp. 1251–1262.
- ICALP-2005-GairingMW #algorithm #approximate #combinator #parallel #scheduling
- A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines (MG, BM, AW), pp. 828–839.
- ICALP-2005-HorvitzK #black box #bound
- Bounds on the Efficiency of “Black-Box” Commitment Schemes (OH, JK), pp. 128–139.
- ICALP-2005-KaoSS #design #random #word
- Randomized Fast Design of Short DNA Words (MYK, MS, RTS), pp. 1275–1286.
- ICALP-2005-Zhang #game studies #resource management
- The Efficiency and Fairness of a Fixed Budget Resource Allocation Game (LZ0), pp. 485–496.
- FM-2005-BuchholtzGHM #analysis #framework #platform #security
- End-to-End Integrated Security and Performance Analysis on the DEGAS Choreographer Platform (MB, SG, VH, CM), pp. 286–301.
- RTA-2005-LynchM #equation
- Faster Basic Syntactic Mutation with Sorts for Some Separable Equational Theories (CL, BM), pp. 90–104.
- SFM-2005-Grassi #analysis #mobile
- Performance Analysis of Mobile Systems (VG), pp. 107–154.
- ICFP-2005-RamosSV #partial evaluation #source code
- Fast narrowing-driven partial evaluation for inductively sequential programs (JGR, JS, GV), pp. 228–239.
- DiGRA-2005-CarrollC #named
- Machinima: digital performance and emergent authorship (JC, DC).
- DiGRA-2005-CassidyMS #evaluation #game studies #music
- The Effects of Aggressive and Relaxing Popular Music on Driving Game Performance and Evaluation (GC, RM, JS).
- CHI-2005-TollingerLMTVHP #constraints #development #modelling #multi
- Supporting efficient development of cognitive models at multiple skill levels: exploring recent advances in constraint-based modeling (IT, RLL, MM, PT, AHV, AH, LP), pp. 411–420.
- CHI-2005-WangN
- Less visible and wireless: two experiments on the effects of microphone type on users’ performance and perception (QW, CN), pp. 809–818.
- CAiSE-2005-MammarRGSG #named #tool support #transaction
- Efficient: A Toolset for Building Trusted B2B Transactions (AM, SR, BG, MSI, NG), pp. 430–445.
- ICEIS-v1-2005-JaniMJ #adaptation #approach
- An Efficient Approach for Web-Site Adaptation (SJ, SAMM, XJ), pp. 108–114.
- ICEIS-v2-2005-KrauthMPS #metric
- Performance Measurement and Control in Logistics Service Providing (EK, HM, VP, MCS), pp. 239–247.
- ICEIS-v3-2005-Ronaghi
- Integrated Performance Management (FR), pp. 174–178.
- ICEIS-v3-2005-YangLZ #analysis #process
- A Theoretical Performance Analysis Method for Business Process Model (LY, YL, XZ), pp. 73–80.
- ICEIS-v4-2005-RusselB #data transfer #grid #predict
- Predicting the Performance of Data Transfer in a Grid Environment (ABMR, SB), pp. 176–181.
- ICEIS-v5-2005-KriegelKPR
- Efficient Join Processing for Complex Rasterized Objects (HPK, PK, MP, MR), pp. 20–30.
- CIKM-2005-ComanNS #energy #network #query
- Exploiting redundancy in sensor networks for energy efficient processing of spatiotemporal region queries (AC, MAN, JS), pp. 187–194.
- CIKM-2005-GuptaNR #using
- Efficient data dissemination using locale covers (SG, JN, CVR), pp. 243–244.
- CIKM-2005-KanT #classification #using
- Fast webpage classification using URL features (MYK, HONT), pp. 325–326.
- CIKM-2005-KriegelP #clustering #distributed #effectiveness
- Efficient and effective server-sided distributed clustering (HPK, MP), pp. 339–340.
- CIKM-2005-LesterMZ #clustering #geometry #online
- Fast on-line index construction by geometric partitioning (NL, AM, JZ), pp. 776–783.
- CIKM-2005-LiLLY #on the #xml
- On reducing redundancy and improving efficiency of XML labeling schemes (CL, TWL, JL, TY), pp. 225–226.
- CIKM-2005-MouzaRS #evaluation #query
- Efficient evaluation of parameterized pattern queries (CdM, PR, MS), pp. 728–735.
- CIKM-2005-OrlandicLY #clustering #effectiveness #reduction #using
- Clustering high-dimensional data using an efficient and effective data space reduction (RO, YL, WGY), pp. 201–208.
- CIKM-2005-PrasadK #query #sequence #using #xml
- Efficient indexing and querying of XML data using modified Prüfer sequences (KHP, PSK), pp. 397–404.
- CIKM-2005-TanLZLL
- Balancing performance and confidentiality in air index (QT, WCL, BZ, PL, DLL), pp. 800–807.
- CIKM-2005-XiaHL #estimation #named #nearest neighbour #retrieval
- ERkNN: efficient reverse k-nearest neighbors retrieval with local kNN-distance estimation (CX, WH, MLL), pp. 533–540.
- CIKM-2005-ZhaoLTX #framework #identification #visualisation
- Opportunity map: a visualization framework for fast identification of actionable knowledge (KZ, BL, TMT, WX), pp. 60–67.
- ECIR-2005-SkopalM #data access #metric
- Modified LSI Model for Efficient Search by Metric Access Methods (TS, PM), pp. 245–259.
- ICML-2005-Angiulli #nearest neighbour
- Fast condensed nearest neighbor rule (FA), pp. 25–32.
- ICML-2005-JingPR #classification #learning #naive bayes #network
- Efficient discriminative learning of Bayesian network classifier via boosted augmented naive Bayes (YJ, VP, JMR), pp. 369–376.
- ICML-2005-Joachims #metric #multi
- A support vector method for multivariate performance measures (TJ), pp. 377–384.
- ICML-2005-LangfordZ #classification #learning
- Relating reinforcement learning performance to classification performance (JL, BZ), pp. 473–480.
- ICML-2005-LeiteB #classification #predict
- Predicting relative performance of classifiers from samples (RL, PB), pp. 497–503.
- ICML-2005-McMahanLG #bound #programming #realtime
- Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees (HBM, ML, GJG), pp. 569–576.
- ICML-2005-NguyenH
- An efficient method for simplifying support vector machines (DN, TBH), pp. 617–624.
- ICML-2005-RennieS #collaboration #matrix #predict
- Fast maximum margin matrix factorization for collaborative prediction (JDMR, NS), pp. 713–719.
- ICML-2005-SiddiqiM #learning
- Fast inference and learning in large-state-space HMMs (SMS, AWM), pp. 800–807.
- KDD-2005-ColeSZ #correlation
- Fast window correlations over uncooperative time series (RC, DS, XZ), pp. 743–749.
- KDD-2005-DhillonGK #algorithm #clustering #graph #kernel #multi
- A fast kernel-based multilevel algorithm for graph clustering (ISD, YG, BK), pp. 629–634.
- KDD-2005-JaroszewiczS #network
- Fast discovery of unexpected patterns in data, relative to a Bayesian network (SJ, TS), pp. 118–127.
- KDD-2005-KubicaMCJ #algorithm #multi
- A multiple tree algorithm for the efficient association of asteroid observations (JK, AWM, AJC, RJ), pp. 138–146.
- KDD-2005-Momma #kernel #scalability
- Efficient computations via scalable sparse kernel partial least squares and boosted latent features (MM), pp. 654–659.
- KDD-2005-PowersGC #enterprise
- Short term performance forecasting in enterprise systems (RP, MG, IC), pp. 801–807.
- KDD-2005-SanghaiSDK #architecture #clustering #design #multi #simulation
- A multinomial clustering model for fast simulation of computer architecture designs (KS, TS, JGD, DRK), pp. 808–813.
- SEKE-2005-ChiangTK #classification #multi #using
- Fast Class Rendering Using Multiresolution Classification in Discrete Cosine Transform Domain (TWC, TT, LJK), pp. 689–694.
- SEKE-2005-HongCC #fuzzy #learning
- Learning Efficiency Improvement of Fuzzy CMAC by Aitken Acceleration Method (CMH, CMC, HYC), pp. 556–595.
- SEKE-2005-IzadiM #algorithm #calculus #model checking #μ-calculus
- An Efficient Model Checking Algorithm for a Fragment of μ-Calculus (MI, AMR), pp. 392–395.
- SIGIR-2005-SharmaJ #automation #evaluation #feedback
- Automated evaluation of search engine performance via implicit user feedback (HS, BJJ), pp. 649–650.
- SIGIR-2005-TheobaldSW #incremental #query #self
- Efficient and self-tuning incremental query expansion for top-k query processing (MT, RS, GW), pp. 242–249.
- ECMDA-FA-2005-TabuchiSN #algebra #analysis #design #modelling #probability #process #uml
- Model-Driven Performance Analysis of UML Design Models Based on Stochastic Process Algebra (NT, NS, HN), pp. 41–58.
- MoDELS-2005-ShenP #analysis #aspect-oriented #modelling #uml #using
- Performance Analysis of UML Models Using Aspect-Oriented Modeling Techniques (HS, DCP), pp. 156–170.
- SPLC-2005-ZhangJ #experience #industrial #mobile #product line #reuse
- Reuse without Compromising Performance: Industrial Experience from RPG Software Product Line for Mobile Devices (WZ, SJ), pp. 57–69.
- MoDELS-2005-ShenP #analysis #aspect-oriented #modelling #uml #using
- Performance Analysis of UML Models Using Aspect-Oriented Modeling Techniques (HS, DCP), pp. 156–170.
- ECOOP-2005-FooteJN #multi
- Efficient Multimethods in a Single Dispatch Language (BF, REJ, JN), pp. 337–361.
- OOPSLA-2005-ArnoldWR #repository #using #virtual machine
- Improving virtual machine performance using a cross-run profile repository (MA, AW, VTR), pp. 297–311.
- OOPSLA-2005-HertzB #garbage collection #memory management
- Quantifying the performance of garbage collection vs. explicit memory management (MH, EDB), pp. 313–326.
- QAPL-2004-BodeiCDBNNP05 #evaluation #protocol #security
- Performance Evaluation of Security Protocols Specified in LySa (CB, MC, PD, MB, FN, HRN, CP), pp. 167–189.
- AdaEurope-2005-SaezLTC #implementation
- Efficient Alternatives for Implementing Fixed-Priority Schedulers (SS, VLG, ST, AC), pp. 39–50.
- PADL-2005-YangDRS #compilation #mobile #model checking #process
- A Provably Correct Compiler for Efficient Model Checking of Mobile Processes (PY, YD, CRR, SAS), pp. 113–127.
- PLDI-2005-ChenLLLLLJ #named #network #programming
- Shangri-La: achieving high performance from compiled network applications while enabling ease of programming (MKC, XFL, RL, JHL, LL, TL, RJ), pp. 224–236.
- PLDI-2005-LattnerA #automation #data type #layout
- Automatic pool allocation: improving performance by controlling data structure layout in the heap (CL, VSA), pp. 129–142.
- SIGAda-2005-AlexandrID #ada #analysis #clustering #source code
- Experimental performance analysis of ada programs in cluster system (KA, SI, KD), pp. 31–36.
- ASE-2005-CassO #design #process
- Process support to help novices design software faster and better (AGC, LJO), pp. 295–299.
- ASE-2005-DiaconescuM #automation #component #enterprise #using
- Automating the performance management of component-based enterprise systems through the use of redundancy (AD, JM), pp. 44–53.
- ASE-2005-FriasGSB #analysis #relational #specification #verification
- A strategy for efficient verification of relational specifications, based on monotonicity analysis (MFF, RG, GS, LB), pp. 305–308.
- ASE-2005-KashyapG #detection #reachability
- Exploiting predicate structure for efficient reachability detection (SK, VKG), pp. 4–13.
- ASE-2005-ZhangC #query
- Efficient temporal-logic query checking for presburger systems (DZ, RC), pp. 24–33.
- ESEC-FSE-2005-MetzLG #approach #hybrid #using
- Performance data collection using a hybrid approach (EM, RL, TFG), pp. 126–135.
- ESEC-FSE-2005-SrinivasS #component #perspective
- Summarizing application performance from a components perspective (KS, HS), pp. 136–145.
- ICSE-2005-ApiwattanapongOH #impact analysis #precise #sequence #using
- Efficient and precise dynamic impact analysis using execute-after sequences (TA, AO, MJH), pp. 432–441.
- ICSE-2005-CortellessaMI #modelling
- Transformations of software models into performance models (VC, ADM, PI), pp. 728–729.
- ICSE-2005-YilmazKMPSGN #assurance #distributed #evolution #monitoring #process #quality
- Main effects screening: a distributed continuous quality assurance process for monitoring performance degradation in evolving software systems (CY, ASK, AMM, AAP, DCS, ASG, BN), pp. 293–302.
- SAC-2005-BellaachiaR #database #string
- Efficiency of prefix and non-prefix codes in string matching over compressed databases on handheld devices (AB, IAR), pp. 993–997.
- SAC-2005-BockerL #composition
- Efficient mass decomposition (SB, ZL), pp. 151–157.
- SAC-2005-CarvalhoL #abstraction #composition #distributed #parallel #programming
- The # model: separation of concerns for reconciling modularity, abstraction and efficiency in distributed parallel programming (FHdCJ, RDL), pp. 1357–1364.
- SAC-2005-Casale #analysis #mining #network #web
- Combining queueing networks and web usage mining techniques for web performance analysis (GC), pp. 1699–1703.
- SAC-2005-HsiehCK #identification #online
- Efficient on-line identification of hot data for flash-memory management (JWH, LPC, TWK), pp. 838–842.
- SAC-2005-JafariDCS #network
- Efficient placement and routing in grid-based networks (RJ, FD, BKC, MS), pp. 899–900.
- SAC-2005-KimJ #sequence
- Performance bottleneck in time-series subsequence matching (SWK, BSJ), pp. 469–473.
- SAC-2005-LeeST #database
- Efficient discovery of unique signatures on whole-genome EST databases (HPL, TFS, YTT), pp. 100–104.
- SAC-2005-LeeWC #clustering
- Rearranging data objects for efficient and stable clustering (GL, XW, JC), pp. 519–523.
- SAC-2005-LinZLY #query #xml
- Supporting efficient query processing on compressed XML files (YL, YZ, QL, JY), pp. 660–665.
- SAC-2005-Lopresti #evaluation
- Performance evaluation for text processing of noisy inputs (DPL), pp. 759–763.
- SAC-2005-OgelTF #aspect-oriented #compilation
- Supporting efficient dynamic aspects through reflection and dynamic compilation (FO, GT, BF), pp. 1351–1356.
- SAC-2005-Rosso #analysis #framework #message passing #paradigm #scalability
- Performance analysis framework for large software-intensive systems with a message passing paradigm (CDR), pp. 885–889.
- SAC-2005-Strangio #protocol
- Efficient Diffie-Hellmann two-party key agreement protocols based on elliptic curves (MAS), pp. 324–331.
- SAC-2005-Ungureanu #enterprise #policy
- Efficient support for enterprise delegation policies (VU), pp. 340–345.
- SAC-2005-WaerdtSIV #estimation
- Motion estimation performance of the TM3270 processor (JWvdW, GAS, JPvI, SV), pp. 850–856.
- SAC-2005-YimKK #memory management
- A fast start-up technique for flash memory based computing systems (KSY, JK, KK), pp. 843–849.
- ATEM-2004-KnodelAFM05 #development #migration #modelling
- An Efficient Migration to Model-driven Development (MDD) (JK, MA, TF, DM), pp. 17–27.
- GPCE-2005-MossM #code generation #domain-specific language
- Efficient Code Generation for a Domain Specific Language (AM, HLM), pp. 47–62.
- CASE-2005-PeddiZCC #automation #effectiveness
- Efficient and effective path for automated dispensing of bio-precipitant solutions (AP, YFZ, VC, MC), pp. 61–66.
- CC-2005-JiangMHLZZZ #multi #using
- Boosting the Performance of Multimedia Applications Using SIMD Instructions (WJ, CM, BH, JL, JZ, BZ, CZ), pp. 59–75.
- CC-2005-PazPBKR #on the fly
- An Efficient On-the-Fly Cycle Collection (HP, EP, DFB, EKK, VTR), pp. 156–171.
- CGO-2005-BerndlVZB #flexibility #thread #virtual machine
- Context Threading: A Flexible and Efficient Dispatch Technique for Virtual Machine Interpreters (MB, BV, MZ, ADB), pp. 15–26.
- CGO-2005-DasLCKYHC #optimisation #runtime
- Performance of Runtime Optimization on BLAST (AD, JL, HC, JK, PCY, WCH, DyC), pp. 86–96.
- CGO-2005-WuEW #code generation #runtime
- Efficient SIMD Code Generation for Runtime Alignment and Length Conversion (PW, AEE, AW), pp. 153–164.
- DAC-2005-AbdollahiP #canonical #logic #synthesis #verification
- A new canonical form for fast boolean matching in logic synthesis and verification (AA, MP), pp. 379–384.
- DAC-2005-BabicBH #satisfiability
- Efficient SAT solving: beyond supercubes (DB, JDB, AJH), pp. 744–749.
- DAC-2005-Balderas-ContrerasC #encryption #network
- High performance encryption cores for 3G networks (TBC, RC), pp. 240–243.
- DAC-2005-BrennerS #algorithm
- Faster and better global placement by a new transportation algorithm (UB, MS), pp. 591–596.
- DAC-2005-CaoC #approach #modelling #process #statistics #towards #variability
- Mapping statistical process variations toward circuit performance variability: an analytical modeling approach (YC, LTC), pp. 658–663.
- DAC-2005-DingV #megamodelling
- A combined feasibility and performance macromodel for analog circuits (MD, RV), pp. 63–68.
- DAC-2005-DongR #automation #megamodelling
- Automated nonlinear Macromodelling of output buffers for high-speed digital applications (ND, JSR), pp. 51–56.
- DAC-2005-GielenME #modelling #synthesis
- Performance space modeling for hierarchical synthesis of analog integrated circuits (GGEG, TM, TE), pp. 881–886.
- DAC-2005-GopeCJ #3d #multi #named
- DiMES: multilevel fast direct solver based on multipole expansions for parasitic extraction of massively coupled 3D microelectronic structures (DG, IC, VJ), pp. 159–162.
- DAC-2005-GuptaRRJ #authentication #embedded
- Efficient fingerprint-based user authentication for embedded systems (PG, SR, AR, NKJ), pp. 244–247.
- DAC-2005-JinS
- Prime clauses for fast enumeration of satisfying assignments to boolean circuits (HJ, FS), pp. 750–753.
- DAC-2005-KimK05a #evaluation #modelling #pipes and filters #reuse #simulation
- Performance simulation modeling for fast evaluation of pipelined scalar processor by evaluation reuse (HYK, TGK), pp. 341–344.
- DAC-2005-Li #analysis #grid #power management #simulation
- Power grid simulation via efficient sampling-based sensitivity analysis and hierarchical symbolic relaxation (PL), pp. 664–669.
- DAC-2005-LinH #reduction
- Leakage efficient chip-level dual-Vdd assignment with time slack allocation for FPGA power reduction (YL, LH), pp. 720–725.
- DAC-2005-LiQTWCH #approach #clustering
- Partitioning-based approach to fast on-chip decap budgeting and minimization (HL, ZQ, SXDT, LW, YC, XH), pp. 170–175.
- DAC-2005-ManiDO #algorithm #constraints #statistics
- An efficient algorithm for statistical minimization of total power under timing yield constraints (MM, AD, MO), pp. 309–314.
- DAC-2005-MengBISLK #algorithm #design #estimation
- MP core: algorithm and design techniques for efficient channel estimation in wireless applications (YM, APB, RAI, TS, HL, RK), pp. 297–302.
- DAC-2005-MitraYP #named #simulation #using
- RADAR: RET-aware detailed routing using fast lithography simulations (JM, PY, DZP), pp. 369–372.
- DAC-2005-MuellerSGS
- Deterministic approaches to analog performance space exploration (PSE) (DM, GS, HEG, US), pp. 869–874.
- DAC-2005-PengL #named #power management #using
- Freeze: engineering a fast repeater insertion solver for power minimization using the ellipsoid method (YP, XL), pp. 813–818.
- DAC-2005-SrivastavaSASBD #correlation #estimation #parametricity #power management
- Accurate and efficient gate-level parametric yield estimation considering correlated variations in leakage power and performance (AS, SS, KA, DS, DB, SWD), pp. 535–540.
- DAC-2005-SuWKLK #analysis #effectiveness #embedded #functional
- A noise-driven effective capacitance method with fast embedded noise rule calculation for functional noise analysis (HS, DW, CVK, FL, BK), pp. 186–189.
- DAC-2005-TennakoonS #modelling
- Efficient and accurate gate sizing with piecewise convex delay models (HT, CS), pp. 807–812.
- DAC-2005-ZykovMJVS #architecture #novel #trade-off
- High performance computing on fault-prone nanotechnologies: novel microarchitecture techniques exploiting reliability-delay trade-offs (AVZ, EM, MFJ, GdV, AS), pp. 270–273.
- DATE-2005-AhmedM #design #embedded #refinement
- Design Refinement for Efficient Cluste ing of Objects in Embedded Systems (WA, DM), pp. 718–719.
- DATE-2005-AlbersS #analysis #realtime #scheduling
- Efficient Feasibility Analysis for Real-Time Systems with EDF Scheduling (KA, FS), pp. 492–497.
- DATE-2005-BadaouiV #multi #synthesis
- Multi-Placement Structures for Fast and Optimized Placement in Analog Circuit Synthesis (RFB, RV), pp. 138–143.
- DATE-2005-BougardCDCD #energy #modelling #network #standard
- Energy Efficiency of the IEEE 802.15.4 Standard in Dense Wireless Microsensor Networks: Modeling and Improvement Perspectives (BB, FC, DCD, AC, WD), pp. 196–201.
- DATE-2005-ChandrasekarH #fault #generative #incremental #integration #learning #satisfiability #testing
- Integration of Learning Techniques into Incremental Satisfiability for Efficient Path-Delay Fault Test Generation (KC, MSH), pp. 1002–1007.
- DATE-2005-ChandyC #interactive
- Performance Driven Decoupling Capacitor Allocation Considering Data and Clock Interactions (AC, TC), pp. 984–985.
- DATE-2005-DasygenisBDCST #energy #memory management
- A Memory Hierarchical Layer Assigning and Prefetching Technique to Overcome the Memory Performance/Energy Bottleneck (MD, EB, BD, FC, DS, AT), pp. 946–947.
- DATE-2005-DingV #approach #megamodelling #modelling
- A Two-Level Modeling Approach to Analog Circuit Performance Macromodeling (MD, RV), pp. 1088–1089.
- DATE-2005-DykaL #encryption #hardware #implementation
- Area Efficient Hardware Implementation of Elliptic Curve Cryptography by Iteratively Applying Karatsuba’s Method (ZD, PL), pp. 70–75.
- DATE-2005-EeckelaertMG #multi #synthesis #using
- Efficient Multiobjective Synthesis of Analog Circuits using Hierarchical Pareto-Optimal Performance Hypersurfaces (TE, TM, GGEG), pp. 1070–1075.
- DATE-2005-GanaiGA #embedded #memory management #modelling #using #verification
- Verification of Embedded Memory Systems using Efficient Memory Modeling (MKG, AG, PA), pp. 1096–1101.
- DATE-2005-GillNWPG #design #detection
- An Efficient BICS Design for SEUs Detection and Correction in Semiconductor Memories (BSG, MN, FGW, CAP, SLG), pp. 592–597.
- DATE-2005-GoossensDGPRR #design #network #verification
- A Design Flow for Application-Specific Networks on Chip with Guaranteed Performance to Accelerate SOC Design and Verification (KG, JD, OPG, SGP, AR, ER), pp. 1182–1187.
- DATE-2005-HanlaiMJ #control flow #graph #memory management #optimisation #using
- Extended Control Flow Graph Based Performance Optimization Using Scratch-Pad Memory (PH, LM, JJ), pp. 828–829.
- DATE-2005-IyerPC #constraints #learning #theorem proving
- Efficient Conflict-Based Learning in an RTL Circuit Constraint Solver (MKI, GP, KTC), pp. 666–671.
- DATE-2005-KimKKSCCKE #architecture #modelling #transaction
- Fast and Accurate Transaction Level Modeling of an Extended AMBA2.0 Bus Architecture (YTK, TK, YK, CS, EYC, KMC, JTK, SKE), pp. 138–139.
- DATE-2005-LiLLPN #modelling #order #parametricity #reduction #using #variability
- Modeling Interconnect Variability Using Efficient Parametric Model Order Reduction (PL, FL, XL, LTP, SRN), pp. 958–963.
- DATE-2005-LiS #simulation
- An Efficiently Preconditioned GMRES Method for Fast Parasitic-Sensitive Deep-Submicron VLSI Circuit Simulation (ZL, CJRS), pp. 752–757.
- DATE-2005-LiTW #embedded
- An Efficient Transparent Test Scheme for Embedded Word-Oriented Memories (JFL, TWT, CLW), pp. 574–579.
- DATE-2005-LiuPP #hybrid #named #power management
- RIP: An Efficient Hybrid Repeater Insertion Scheme for Low Power (XL, YP, MCP), pp. 1330–1335.
- DATE-2005-LiWYY #named #power management
- Q-DPM: An Efficient Model-Free Dynamic Power Management Technique (ML, XW, RY, XY), pp. 526–527.
- DATE-2005-LoghiP #energy #memory management #trade-off
- Exploring Energy/Performance Tradeoffs in Shared Memory MPSoCs: Snoop-Based Cache Coherence vs. Software Solutions (ML, MP), pp. 508–513.
- DATE-2005-Lopez-OngilGPE #fault
- Techniques for Fast Transient Fault Grading Based on Autonomous Emulation (CLO, MGV, MPG, LEA), pp. 308–309.
- DATE-2005-LuIPWCC #satisfiability
- An Efficient Sequential SAT Solver With Improved Search Strategies (FL, MKI, GP, LCW, KTC, KCC), pp. 1102–1107.
- DATE-2005-MahadevanASOSM #generative #network #simulation
- A Network Traffic Generator Model for Fast Network-on-Chip Simulation (SM, FA, MS, RGO, JS, JM), pp. 780–785.
- DATE-2005-ManoliosS #modelling #refinement #verification
- Refinement Maps for Efficient Verification of Processor Models (PM, SKS), pp. 1304–1309.
- DATE-2005-MishchenkoBJVY #equation #using
- Efficient Solution of Language Equations Using Partitioned Representations (AM, RKB, JHRJ, TV, NY), pp. 418–423.
- DATE-2005-ReshadiD #generative #modelling #pipes and filters
- Generic Pipelined Processor Modeling and High Performance Cycle-Accurate Simulator Generation (MR, NDD), pp. 786–791.
- DATE-2005-RosselloCBKS #concurrent
- A Fast Concurrent Power-Thermal Model for Sub-100nm Digital ICs (JLR, VC, SAB, AK, JS), pp. 206–211.
- DATE-2005-Ruiz-SautuaMMH #behaviour #synthesis
- Behavioural Transformation to Improve Circuit Performance in High-Level Synthesis (RRS, MCM, JMM, RH), pp. 1252–1257.
- DATE-2005-ShenQL #algorithm #analysis
- A Faster Counterexample Minimization Algorithm Based on Refutation Analysis (SS, YQ, SL), pp. 672–677.
- DATE-2005-StaschulatESW #analysis
- Context Sensitive Performance Analysis of Automotive Applications (JS, RE, AS, FW), pp. 165–170.
- DATE-2005-TeslenkoD #algorithm #graph
- An Efficient Algorithm for Finding Double-Vertex Dominators in Circuit Graphs (MT, ED), pp. 406–411.
- DATE-2005-ThullS #embedded #implementation
- Performance Considerations for an Embedded Implementation of OMA DRM 2 (DT, RS), pp. 46–51.
- DATE-2005-VillaSVMP #framework #integration #memory management #multi
- Fast Dynamic Memory Integration in Co-Simulation Frameworks for Multiprocessor System on-Chip (OV, PS, IV, MM, GP), pp. 804–805.
- DATE-2005-WangWI #distributed #embedded
- A Fast Diagnosis Scheme for Distributed Small Embedded SRAMs (BW, YW, AI), pp. 852–857.
- HPCA-2005-BalasubramonianMRV #architecture
- Microarchitectural Wire Management for Performance and Power in Partitioned Architectures (RB, NM, KR, VV), pp. 28–39.
- HPCA-2005-Hofstee #architecture
- Power Efficient Processor Architecture and The Cell Processor (HPH), pp. 258–262.
- HPCA-2005-JacobsonBHBZEEGLST
- Stretching the Limits of Clock-Gating Efficiency in Server-Class Processors (HMJ, PB, ZH, AB, VVZ, RJE, LE, JG, DL, BS, JMT), pp. 238–242.
- HPCA-2005-KondoN #clustering #power management
- A Small, Fast and Low-Power Register File by Bit-Partitioning (MK, HN), pp. 40–49.
- HPCA-2005-LiBHS #architecture #energy #smt
- Performance, Energy, and Thermal Considerations for SMT and CMP Architectures (YL, DMB, ZH, KS), pp. 71–82.
- HPCA-2005-WillmannKRP #interface #network #programmable
- An Efficient Programmable 10 Gigabit Ethernet Network Interface Card (PW, HyK, SR, VSP), pp. 96–107.
- HPCA-2005-ZhuZ #comparison #memory management #optimisation #smt
- A Performance Comparison of DRAM Memory System Optimizations for SMT Processors (ZZ, ZZ), pp. 213–224.
- HPDC-2005-BaudCLN #analysis #grid
- Performance analysis of a file catalog for the LHC computing grid (JPB, JC, SL, CN), pp. 91–99.
- HPDC-2005-KarmonLS #distributed #named #protocol
- GWiQ-P: an efficient decentralized grid-wide quota enforcement protocol (KK, LL, AS), pp. 222–232.
- HPDC-2005-LuJ05a #consistency #detection #distributed #framework #grid #nondeterminism
- A framework for efficient inconsistency detection in a grid and Internet-scale distributed environment (YL, HJ), pp. 318–319.
- HPDC-2005-SundararajGD #adaptation #runtime
- Increasing application performance in virtual environments through run-time inference and adaptation (AIS, AG, PAD), pp. 47–58.
- HPDC-2005-TaianiHS #grid #integration #web #web service
- The impact of Web service integration on grid performance (FT, MAH, RDS), pp. 14–23.
- LCTES-2005-CooperGHRSTW #adaptation #compilation #named
- ACME: adaptive compilation made efficient (KDC, AG, TJH, SWR, DS, LT, TW), pp. 69–77.
- LCTES-2005-GriffinSC #embedded #energy #garbage collection #java
- An energy efficient garbage collector for java embedded devices (PAG, WSa, JMC), pp. 230–238.
- LCTES-2005-SassoneWL #dependence #embedded
- Static strands: safely collapsing dependence chains for increasing embedded power efficiency (PGS, DSW, GHL), pp. 127–136.
- LCTES-2005-ZhangP #compilation #migration
- Efficient application migration under compiler guidance (KZ, SP), pp. 10–20.
- PDP-2005-Castro-CompanyPRIDM #communication #database #named
- CLOB: Communication Support for Efficient Replicated Database Recovery (FCC, JEP, MIRF, LIB, HD, FDME), pp. 314–321.
- PDP-2005-FaberoBC #clustering #equation #parallel #simulation
- Efficiency on Clusters of Parallel Simulation of Sine-Gordon Equation over Hexagonal Tessellation (JCF, AB, LC), pp. 68–75.
- PDP-2005-FritzscheRLFG #predict #re-engineering
- A Performance Prediction for Iterative Reconstruction Techniques on Tomography (PCF, AR, EL, JJF, IG), pp. 92–99.
- PDP-2005-KnupferBN #visualisation
- High Performance Event Trace Visualization (AK, HB, WEN), pp. 258–263.
- PDP-2005-MartinezSACF #design #network #parametricity
- Studying the Effect of the Design Parameters on the Interconnection Network Performance in NOWs (RM, JLS, FJA, VC, JF), pp. 102–109.
- PDP-2005-VilladangosCFP #network
- Efficient Leader Election in Complete Networks (JEV, AC, FF, MP), pp. 136–143.
- PPoPP-2005-ChenFGLABD #approach #fault tolerance
- Fault tolerant high performance computing by a coding approach (ZC, GEF, EG, JL, TA, GB, JD), pp. 213–223.
- PPoPP-2005-CollardJY #memory management #monitoring #optimisation
- System-wide performance monitors and their application to the optimization of coherent memory accesses (JFC, NPJ, SY), pp. 247–254.
- PPoPP-2005-GaoSLRLBS #modelling #optimisation #parallel
- Performance modeling and optimization of parallel out-of-core tensor contractions (XG, SKS, CCL, JR, QL, GB, PS), pp. 266–276.
- PPoPP-2005-Hanrahan #hardware #question #why
- Why is graphics hardware so fast? (PH), p. 1.
- PPoPP-2005-SuraFWMLP #compilation #consistency #java #source code
- Compiler techniques for high performance sequentially consistent java programs (ZS, XF, CLW, SPM, JL, DAP), pp. 2–13.
- SOSP-2005-HuangHS #energy #named #replication
- FS2: dynamic data replication in free disk space for improving disk performance and energy consumption (HH, WH, KGS), pp. 263–276.
- SOSP-2005-YuRC #adaptation #detection #named
- RaceTrack: efficient detection of data race conditions via adaptive tracking (YY, TR, WC), pp. 221–234.
- FASE-2005-Berry #design #industrial #specification
- Esterel v7: From Verified Formal Specification to Efficient Industrial Designs (GB), p. 1.
- STOC-2005-Ben-OrH #quantum
- Fast quantum byzantine agreement (MBO, AH), pp. 481–485.
- STOC-2005-FlaxmanFV #algorithm #approximate #on the #problem
- On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem (AF, AMF, JCV), pp. 441–449.
- STOC-2005-FriedlIS #testing
- Efficient testing of groups (KF, GI, MS), pp. 157–166.
- STOC-2005-Hallgren #algorithm #quantum
- Fast quantum algorithms for computing the unit group and class group of a number field (SH), pp. 468–474.
- TACAS-2005-BinghamH #empirical #infinity #verification
- Empirically Efficient Verification for a Class of Infinite-State Systems (JDB, AJH), pp. 77–92.
- TACAS-2005-JinHS #analysis
- Efficient Conflict Analysis for Finding All Satisfying Assignments of a Boolean Circuit (HJ, HH, FS), pp. 287–300.
- SAT-J-2004-HeuleDZM05 #implementation #named #reasoning #satisfiability
- March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver (MH, MD, JvZ, HvM), pp. 345–359.
- SAT-J-2004-HuangD05 #using
- Using DPLL for Efficient OBDD Construction (JH, AD), pp. 157–172.
- SAT-J-2004-MahajanFM05 #named #satisfiability
- Zchaff2004: An Efficient SAT Solver (YSM, ZF, SM), pp. 360–375.
- A-MOST-2005-KarrP #distributed #modelling #statistics #testing #using
- Distributed performance testing using statistical modeling (AFK, AAP), pp. 77–83.
- CAV-2005-BozzanoBCJRRS #modulo theories #satisfiability
- Efficient Satisfiability Modulo Theories via Delayed Theory Combination (MB, RB, AC, TAJ, SR, PvR, RS), pp. 335–349.
- CAV-2005-dAmorimR #monitoring
- Efficient Monitoring of ω-Languages (Md, GR), pp. 364–378.
- CAV-2005-GeeraertsRB
- Expand, Enlarge and Check... Made Efficient (GG, JFR, LVB), pp. 394–407.
- ICLP-2005-MoralesCPH #automaton #generative #implementation
- A Generator of Efficient Abstract Machine Implementations and Its Application to Emulator Minimization (JFM, MC, GP, MVH), pp. 21–36.
- ICLP-2005-SahaR #data type #evaluation #graph #incremental
- Symbolic Support Graph: A Space Efficient Data Structure for Incremental Tabled Evaluation (DS, CRR), pp. 235–249.
- ICLP-2005-StuckeyBMMSSWW #independence #modelling
- The G12 Project: Mapping Solver Independent Models to Efficient Solutions (PJS, MJGdlB, MJM, KM, JKS, ZS, MW, TW), pp. 9–13.
- SAT-2005-DurairajK #constraints #dependence #satisfiability
- Variable Ordering for Efficient SAT Search by Analyzing Constraint-Variable Dependencies (VD, PK), pp. 415–422.
- SAT-2005-KourilF #satisfiability
- Resolution Tunnels for Improved SAT Solver Performance (MK, JVF), pp. 143–157.
- SAT-2005-SangBK #heuristic
- Heuristics for Fast Exact Model Counting (TS, PB, HAK), pp. 226–240.
- SAT-2005-Wahlstrom #satisfiability
- Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable (MW), pp. 309–323.
- VMCAI-2005-JabbarE #model checking
- I/O Efficient Directed Model Checking (SJ, SE), pp. 313–329.
- VMCAI-2005-LatvalaBHJ #bound #ltl #model checking
- Simple Is Better: Efficient Bounded Model Checking for Past LTL (TL, AB, KH, TAJ), pp. 380–395.
- VMCAI-2005-Siegel #source code #verification
- Efficient Verification of Halting Properties for MPI Programs with Wildcard Receives (SFS), pp. 413–429.
- CBSE-2004-BertolinoM #component
- CB-SPE Tool: Putting Component-Based Performance Engineering into Practice (AB, RM), pp. 233–248.
- CBSE-2004-EskenaziFH #component #composition #predict
- Performance Prediction for Component Compositions (EME, AVF, DKH), pp. 280–293.
- WICSA-2004-MarcoI #architecture #composition #generative #modelling
- Compositional Generation of Software Architecture Performance QN Models (ADM, PI), pp. 37–46.
- WICSA-2004-Purhonen #architecture #case study #embedded #optimisation
- Performance Optimization of Embedded Software Architecture — A Case Study (AP), pp. 112–121.
- DocEng-2004-HuangCL #query #retrieval
- Fast structural query with application to chinese treebank sentence retrieval (CHH, TRC, HML), pp. 11–20.
- DocEng-2004-KilpelainenT #implementation #modelling #towards #xml
- Towards efficient implementation of XML schema content models (PK, RT), pp. 239–241.
- DRR-2004-MaoKT #design #documentation #evaluation #independence
- Style-independent document labeling: design and performance evaluation (SM, JK, GRT), pp. 14–22.
- ECDL-2004-MalyNZAKWL #usability
- Enhancing Kepler Usability and Performance (KM, MLN, MZ, AA, SK, LW, RL), pp. 317–328.
- JCDL-2004-Parker #retrieval
- A tree-based method for fast melodic retrieval (CLP), pp. 254–255.
- SIGMOD-2004-ArgeBHY #worst-case
- The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree (LA, MdB, HJH, KY), pp. 347–358.
- SIGMOD-2004-CarreiraG #development #migration
- Efficient Development of Data Migration Transformations (PJFC, HG), pp. 915–916.
- SIGMOD-2004-ChenDZ #named #xpath
- BLAS: An Efficient XPath Processing System (YC, SBD, YZ), pp. 47–58.
- SIGMOD-2004-GovindarajuLWLM #database #using
- Fast Computation of Database Operations using Graphics Processors (NKG, BL, WW, MCL, DM), pp. 215–226.
- SIGMOD-2004-JiangLW #query
- Efficient Processing of Twig Queries with OR-Predicates (HJ, HL, WW), pp. 59–70.
- SIGMOD-2004-LernerSWZZ #algorithm #biology #music #physics
- Fast Algorithms for Time Series with applications to Finance, Physics, Music, Biology, and other Suspects (AL, DS, ZW, XZ, YZ), pp. 965–968.
- SIGMOD-2004-PaparizosWLJ #evaluation #logic #xquery
- Tree Logical Classes for Efficient Evaluation of XQuery (SP, YW, LVSL, HVJ), pp. 71–82.
- SIGMOD-2004-PatelCC #named #predict
- STRIPES: An Efficient Index for Predicted Trajectories (JMP, YC, VPC), pp. 637–646.
- SIGMOD-2004-QianZZ #approach #clustering #effectiveness #named
- FAÇADE: A Fast and Effective Approach to the Discovery of Dense Clusters in Noisy Spatial Data (YQ, GZ, KZ), pp. 921–922.
- SIGMOD-2004-Sarawagi #set #similarity
- Efficient set joins on similarity predicates (SS, AK), pp. 743–754.
- SIGMOD-2004-TatarinovH #data transformation #query
- Efficient Query Reformulation in Peer-Data Management Systems (IT, AYH), pp. 539–550.
- SIGMOD-2004-ZhouR #database
- Buffering Database Operations for Enhanced Instruction Cache Performance (JZ, KAR), pp. 191–202.
- VLDB-2004-ChengXPSV #nondeterminism #probability #query
- Efficient Indexing Methods for Probabilistic Threshold Queries over Uncertain Data (RC, YX, SP, RS, JSV), pp. 876–887.
- VLDB-2004-DalviS #database #evaluation #probability #query
- Efficient Query Evaluation on Probabilistic Databases (NND, DS), pp. 864–875.
- VLDB-2004-EsterKS #crawling
- Accurate and Efficient Crawling for Relevant Websites (ME, HPK, MS), pp. 396–407.
- VLDB-2004-FontouraSZRN #algorithm #intranet
- High Performance Index Build Algorithms for Intranet Search Engines (MF, EJS, JYZ, SR, AN), pp. 1158–1169.
- VLDB-2004-JensenLO #query
- Query and Update Efficient B+-Tree Based Indexing of Moving Objects (CSJ, DL, BCO), pp. 768–779.
- VLDB-2004-KoudasOT0 #approximate #bound #fault #query
- Approximate NN queries on Streams with Guaranteed Error/performance Bounds (NK, BCO, KLT, RZ), pp. 804–815.
- VLDB-2004-KrishnamurthyKN #query #question
- Efficient XML-to-SQL Query Translation: Where to Add the Intelligence? (RK, RK, JFN), pp. 144–155.
- VLDB-2004-WuOS #on the
- On the performance of bitmap indices for high cardinality attributes (KW, EJO, AS), pp. 24–35.
- VLDB-2004-XiaLOH #named
- Gorder: An Efficient Method for KNN Join Processing (CX, HL, BCO, JH), pp. 756–767.
- VLDB-2004-XuJ #constraints #personalisation
- Efficient Constraint Processing for Highly Personalized Location Based Services (ZX, HAJ), pp. 1285–1288.
- ITiCSE-2004-WangC #assessment #learning #online
- Extending e-books with annotation, online support and assessment mechanisms to increase efficiency of learning (CYW, GDC), pp. 132–136.
- ITiCSE-WGR-2004-HazzanL #education
- The practicum in computer science education: bridging gaps between theoretical knowledge and actual performance (OH, TL), pp. 47–51.
- SIGITE-2004-Dark #assessment #learning #risk management #security #student
- Assessing student performance outcomes in an information security risk assessment, service learning course (MJD), pp. 73–78.
- CSMR-2004-Rosso #architecture #lessons learnt #mobile #process #product line
- The Process of and the Lessons Learned from Performance Tuning of a Product Family Software Architecture for Mobile Phones (CDR), pp. 270–278.
- ICSM-2004-LauTMKILZZH #maintenance
- Model Synchronization for Efficient Software Application Maintenance (TCL, TT, RM, KK, II, PL, YZ, QZ, MH), p. 499.
- PASTE-2004-PearceKH #analysis #c #pointer
- Efficient field-sensitive pointer analysis for C (DJP, PHJK, CH), pp. 37–42.
- WCRE-2004-Bollin #specification
- The Efficiency of Specification Fragments (AB), pp. 266–275.
- CIAA-2004-PengT #algorithm #sequence
- Time and Space Efficient Algorithms for Constrained Sequence Alignment (ZSP, HFT), pp. 237–246.
- DLT-2004-InenagaST #algorithm #context-free grammar #pattern matching #subclass
- An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars (SI, AS, MT), pp. 225–236.
- ICALP-2004-CodenottiV #equilibrium
- Efficient Computation of Equilibrium Prices for Markets with Leontief Utilities (BC, KRV), pp. 371–382.
- ICALP-2004-FominT #algorithm #exponential #graph #kernel #linear
- Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up (FVF, DMT), pp. 581–592.
- ICALP-2004-KavithaMMP #algorithm #graph
- A Faster Algorithm for Minimum Cycle Basis of Graphs (TK, KM, DM, KEP), pp. 846–857.
- ICALP-2004-NikoletseasRS #graph #independence #random #scalability #set
- The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs (SEN, CR, PGS), pp. 1029–1040.
- ICALP-2004-OstrovskyRS #commit #consistency #database #proving #query
- Efficient Consistency Proofs for Generalized Queries on a Committed Database (RO, CR, AS), pp. 1041–1053.
IFM-2004-FariasMS #abstraction- Efficient CSPZ Data Abstraction (AF, AM, AS), pp. 108–127.
- RTA-2004-Mackie #interactive
- Efficient λ-Evaluation with Interaction Nets (IM), pp. 155–169.
- SEFM-2004-HamonMR #generative #model checking #testing
- Generating Efficient Test Sets with a Model Checker (GH, LMdM, JMR), pp. 261–270.
- SFM-2004-BihlerV #petri net
- Timed Petri Nets: Efficiency of Asynchronous Systems (EB, WV), pp. 25–58.
- ICFP-2004-MarlowJ #higher-order
- Making a fast curry: push/enter vs. eval/apply for higher-order languages (SM, SLPJ), pp. 4–15.
- CHI-2004-Isokoski
- Performance of menu-augmented soft keyboards (PI), pp. 423–430.
- CHI-2004-JohnPSK #modelling #predict
- Predictive human performance modeling made easy (BEJ, KCP, DDS, KRK), pp. 455–462.
- CSCW-2004-AvrahamiH #latency #named
- QnA: augmenting an instant messaging client to balance user responsiveness and performance (DA, SEH), pp. 515–518.
- CAiSE-2004-Laucins #development #integration
- Aligning Organizational Performance to IT Development and Integration (AL), p. 2.
- EDOC-2004-BalasubramanianSDO #middleware
- Evaluating the Performance of Middleware Load Balancing Strategies (JB, DCS, LWD, OO), pp. 135–146.
- EDOC-2004-GorpJG #case study
- Write Once, Deploy N: A Performance Oriented MDA Case Study (PVG, DJ, TG), pp. 123–134.
- EDOC-2004-YoshiokaHF #coordination #security
- Security Patterns: A Method for Constructing Secure and Efficient Inter-Company Coordination Systems (NY, SH, AF), pp. 84–97.
- ICEIS-v1-2004-El-SonbatyK #algorithm #incremental #mining
- New Fast Algorithm for Incremental Mining of Association Rules (YES, RK), pp. 275–281.
- ICEIS-v1-2004-FengMR #multi #query #using
- Improving Query Performance on OLAP-Data Using Enhanced Multidimensional Indices (YF, AM, HR), pp. 282–289.
- ICEIS-v1-2004-Frank #database #design #transaction
- Transaction Design for Databases with High Performance and Availability (LF), pp. 222–226.
- ICEIS-v1-2004-Gilb #metric #multi #project management #quality
- Evolutionary Project Management: Multiple Performance, Quality and Cost Metrics for Early and Continuous Stakeholder Value Delivery (TG), p. VII.
- ICEIS-v1-2004-GroppeBB #documentation #query #xml
- Efficient Querying of Transformed XML Documents (SG, SB, GB), pp. 241–250.
- ICEIS-v1-2004-ZhouNB #c++ #implementation #using
- An Efficient B+-Tree Implementation in C++ Using the STL Style (JZ, BN, GB), pp. 163–168.
- ICEIS-v2-2004-UdechukwuBA #framework #mining
- An Efficient Framework for Iterative Time-Series Trend Mining (AU, KB, RA), pp. 130–137.
- ICEIS-v2-2004-WallaceK #clustering #robust
- Robust, Generalized, Quick and Efficient Agglomerative Clustering (MW, SDK), pp. 409–416.
- ICEIS-v3-2004-Douglas #analysis #enterprise
- Founding Enterprise Systems on Enterprise Performance Analysis (ID), pp. 588–591.
- ICEIS-v3-2004-Reijers #empirical #workflow
- Performance Improvement by Workflow Management Systems: Preliminary Results from an Empirical Study (HAR), pp. 359–366.
- ICEIS-v4-2004-RodriguezDGI #architecture #monitoring #online
- A Wireless Application That Monitors ECG Signals On-Line: Architecture and Performance (JR, LD, AG, AI), pp. 138–145.
- CIKM-2004-JingYKT #locality #similarity #transaction
- Localized signature table: fast similarity search on transaction data (QJ, RY, PK, AKHT), pp. 314–323.
- CIKM-2004-LuCL #approach #xml
- Efficient processing of XML twig patterns with parent child edges: a look-ahead approach (JL, TC, TWL), pp. 533–542.
- CIKM-2004-MegalooikonomouLW #analysis #database #reduction #similarity
- A dimensionality reduction technique for efficient similarity analysis of time series databases (VM, GL, QW), pp. 160–161.
- CIKM-2004-ShenSN #music #retrieval
- Integrating heterogeneous reatures for efficient content based music retrieval (JS, JS, AHHN), pp. 154–155.
- CIKM-2004-SongB #algorithm #detection #effectiveness #named
- BioDIFF: an effective fast change detection algorithm for genomic and proteomic data (YS, SSB), pp. 146–147.
- CIKM-2004-WuCY #query
- Interval query indexing for efficient stream processing (KLW, SKC, PSY), pp. 88–97.
- ECIR-2004-CachedaPO #analysis #architecture #distributed
- Performance Analysis of Distributed Architectures to Index One Terabyte of Text (FC, VP, IO), pp. 394–408.
- ECIR-2004-WeigelMBS #information retrieval #xml
- Content-Aware DataGuides: Interleaving IR and DB Indexing Techniques for Efficient Retrieval of Textual XML Data (FW, HM, FB, KUS), pp. 378–393.
- ICML-2004-FungDBR #algorithm #kernel #using
- A fast iterative algorithm for fisher discriminant using heterogeneous kernels (GF, MD, JB, RBR).
- ICML-2004-Strens #policy
- Efficient hierarchical MCMC for policy search (MJAS).
- ICPR-v1-2004-ArcaCL #detection #recognition
- An Efficient Method to Detect Facial Fiducial Points for Face Recognition (SA, PC, RL), pp. 532–535.
- ICPR-v1-2004-Debled-RennessonTW #approximate
- Fast Polygonal Approximation of Digital Curves (IDR, ST, LW), pp. 465–468.
- ICPR-v1-2004-JohnstonFD #clustering #execution #grid #image
- An Event-Based Execution Model for Efficient Image Processing on Workstation Clusters and the Grid (DJJ, MF, ACD), pp. 732–735.
- ICPR-v1-2004-PopoviciTRM #algorithm #detection #evaluation #locality #on the
- On Performance Evaluation of Face Detection and Localization Algorithms (VP, JPT, YR, SM), pp. 313–317.
- ICPR-v1-2004-SirisathitkulAU #distance #image #using
- Fast Color Image Quantization using Squared Euclidean Distance of Adjacent Color Points along the Highest Color Variance Axis (YS, SA, BU), pp. 656–659.
- ICPR-v1-2004-YaoC
- An Efficient Image-Based Rendering Method (JY, WkC), pp. 88–91.
- ICPR-v1-2004-YoshimotoDAT #architecture #realtime
- Confidence-Driven Architecture for Real-time Vision Processing and Its Application to Efficient Vision-Based Human Motion Sensing (HY, ND, DA, RiT), pp. 736–740.
- ICPR-v1-2004-ZouariHLA #classification #simulation
- Simulating Classifier Ensembles of Fixed Diversity for Studying Plurality Voting Performance (HZ, LH, YL, AMA), pp. 232–235.
- ICPR-v2-2004-BandoSDI #realtime #visual notation
- Switching Particle Filters for Efficient Real-time Visual Tracking (TB, TS, KD, SI), pp. 720–723.
- ICPR-v2-2004-BlicherRP #2d #3d #image #named
- LightSphere: Fast Lighting Compensation for Matching a 2D Image to a 3D Model (APB, SR, PSP), pp. 157–162.
- ICPR-v2-2004-BrownCA #classification #set
- Efficient Calculation of the Complete Optimal Classification Set (MB, NC, SA), pp. 307–310.
- ICPR-v2-2004-CawleyT #kernel
- Efficient Model Selection for Kernel Logistic Regression (GCC, NLCT), pp. 439–442.
- ICPR-v2-2004-DuanQ #image
- Fast Tone Mapping for High Dynamic Range Images (JD, GQ), pp. 847–850.
- ICPR-v2-2004-KovacsS
- Efficient Coding of Stroke-Rendered Paintings (LK, TS), pp. 835–838.
- ICPR-v2-2004-LiZYH #image #robust #segmentation #sequence
- FFT Snake: A Robust and Efficient Method for the Segmentation of Arbitrarily Shaped Objects in Image Sequences (TL, YZ, DY, DH), pp. 116–119.
- ICPR-v2-2004-LuoYT #algorithm #automation #detection
- An Efficient Automatic Redeye Detection and Correction Algorithm (HL, JY, DT), pp. 883–886.
- ICPR-v2-2004-TremblaisA #algorithm #detection #multi
- A Fast Multiscale Edge Detection Algorithm Based on a New Edge Preserving PDE Resolution Scheme (BT, BA), pp. 811–814.
- ICPR-v2-2004-VijayaMS #classification #clustering #sequence
- An Efficient Technique for Protein Sequence Clustering and Classification (PAV, MNM, DKS), pp. 447–450.
- ICPR-v2-2004-YaoKG #detection #robust
- Fast Robust GA-Based Ellipse Detection (JY, NNK, PG), pp. 859–862.
- ICPR-v2-2004-YuWC #3d #algorithm #multi #re-engineering #recursion
- A Fast Recursive 3D Model Reconstruction Algorithm for Multimedia Applications (YKY, KhW, MMYC), pp. 241–244.
- ICPR-v3-2004-KatoW #algorithm #classification #nearest neighbour
- Direct Condensing: An Efficient Voronoi Condensing Algorithm for Nearest Neighbor Classifiers (TK, TW), pp. 474–477.
- ICPR-v3-2004-KawanishiKKT #adaptation #algorithm #using
- A Fast Template Matching Algorithm with Adaptive Skipping Using Inner-Subtemplates’ Distances (TK, TK, KK, ST), pp. 654–657.
- ICPR-v3-2004-LaporteBA #approach #estimation #recognition
- A Fast Discriminant Approach to Active Object Recognition and Pose Estimation (CL, RB, TA), pp. 91–94.
- ICPR-v3-2004-PalenichkaMZ #image #locality #multi #using
- Fast Object Localization using Multi-Scale Image Relevance Function (RMP, RM, MBZ), pp. 227–230.
- ICPR-v3-2004-SchoutenB #distance
- Fast Exact Euclidean Distance (FEED) Transformation (TES, ELvdB), pp. 594–597.
- ICPR-v3-2004-WanX #automation #generative #multimodal
- Efficient Multimodal Features for Automatic Soccer Highlight Generation (KW, CX), pp. 973–976.
- ICPR-v3-2004-WestphalW #recognition
- Fast Object and Pose Recognition Through Minimum Entropy Coding (GW, RPW), pp. 53–56.
- ICPR-v3-2004-YingK #evaluation
- Fast Leave-One-Out Evaluation and Improvement on Inference for LS-SVMs (ZY, KCK), pp. 494–497.
- ICPR-v3-2004-YuanTR #robust #scalability #video
- Fast and Robust Search Method for Short Video Clips from Large Video Collection (JY, QT, SR), pp. 866–869.
- ICPR-v4-2004-AnJWZL
- An Efficient Rectification Method for Trinocular Stereovision (LA, YJ, JW, XZ, ML), pp. 56–59.
- ICPR-v4-2004-BruniVK
- Fast Removal of Line Scratches in Old Movies (VB, DV, ACK), pp. 827–830.
- ICPR-v4-2004-GorgevikC #classification #recognition
- An Efficient Three-Stage Classifier for Handwritten Digit Recognition (DG, DC), pp. 507–510.
- ICPR-v4-2004-IshiyamaS #3d #estimation
- Fast and Accurate Facial Pose Estimation by Aligning a 3D Appearance Model (RI, SS), pp. 388–391.
- ICPR-v4-2004-KamberovK #evaluation #formal method
- Conformal Method for Quantitative Shape Extraction: Performance Evaluation (GK, GK), pp. 31–35.
- ICPR-v4-2004-OliveiraNM #parametricity #recognition
- Improving RBF-DDA Performance on Optical Character Recognition through Parameter Selection (ALIO, FBdLN, SRdLM), pp. 625–628.
- ICPR-v4-2004-SchloglBWB #detection #evaluation #metric
- Performance Evaluation Metrics for Motion Detection and Tracking (TS, CB, MW, HB), pp. 519–522.
- ICPR-v4-2004-TaguchiOA #using #visual notation
- Fast Visual Search Using Simplified Pruning Rules — Streamlined Active Search (ST, SO, HA), pp. 937–940.
- ICPR-v4-2004-TongLL #detection #effectiveness
- An Effective and Fast Soccer Ball Detection and Tracking Method (XFT, HQL, QSL), pp. 795–798.
- ICPR-v4-2004-ViswanathMB #classification #nearest neighbour #pattern matching #pattern recognition #recognition #synthesis
- A Pattern Synthesis Technique with an Efficient Nearest Neighbor Classifier for Binary Pattern Recognition (PV, MNM, SB), pp. 416–419.
- KDD-2004-AndersonMCN
- Fast nonlinear regression via eigenimages applied to galactic morphology (BA, AWM, AJC, RN), pp. 40–48.
- KDD-2004-CaruanaN #analysis #data mining #empirical #learning #metric #mining
- Data mining in metric space: an empirical analysis of supervised learning performance criteria (RC, ANM), pp. 69–78.
- KDD-2004-FaloutsosMT
- Fast discovery of connection subgraphs (CF, KSM, AT), pp. 118–127.
- KDD-2004-GadeWK #constraints #mining
- Efficient closed pattern mining in the presence of tough block constraints (KG, JW, GK), pp. 138–147.
- KDD-2004-LiuYM #algorithm #classification #parametricity
- The IOC algorithm: efficient many-class non-parametric classification for high-dimensional data (TL, KY, AWM), pp. 629–634.
- KDD-2004-YangLHG #mining #named #query #xml
- 2PXMiner: an efficient two pass mining of frequent XML query patterns (LHY, MLL, WH, XG), pp. 731–736.
- KDD-2004-YeJL #image #named #reduction #retrieval
- GPCA: an efficient dimension reduction scheme for image compression and retrieval (JY, RJ, QL), pp. 354–363.
- KDD-2004-ZhangMCS #mining
- Fast mining of spatial collocations (XZ, NM, DWC, YS), pp. 384–393.
- SEKE-2004-CaiGHD #analysis #architecture #modelling
- Software Architecture Modelling and Performance Analysis with Argo/MTE (YC, JCG, JGH, XD), pp. 276–281.
- SEKE-2004-RyanO #development #information management #predict
- Team Tacit Knowledge as a Predictor of Performance in Software Development Teams (SR, RO), pp. 312–317.
- SIGIR-2004-Collins-ThompsonCTC #documentation #quality #retrieval
- The effect of document retrieval quality on factoid question answering performance (KCT, JC, ELT, CLAC), pp. 574–575.
UML-2004-BennettFW #evaluation #scheduling #uml- Experimental Evaluation of the UML Profile for Schedulability, Performance, and Time (AJB, AJF, CMW), pp. 143–157.
- UML-2004-PetriuW #design #generative #metamodelling #modelling #uml
- A Metamodel for Generating Performance Models from UML Designs (DBP, CMW), pp. 41–53.
- ECOOP-2004-AmmonsCGS #scalability
- Finding and Removing Performance Bottlenecks in Large Systems (GA, JDC, MG, NS), pp. 170–194.
- OOPSLA-2004-AbuaiadhOPS #algorithm #parallel
- An efficient parallel heap compaction algorithm (DA, YO, EP, US), pp. 224–236.
- LOPSTR-2004-PueblaAH #prolog
- Efficient Local Unfolding with Ancestor Stacks for Full Prolog (GP, EA, MVH), pp. 149–165.
- PEPM-2004-BarkerLV #data access #flexibility #logic programming
- Efficient and flexible access control via logic program specialisation (SB, ML, MV), pp. 190–199.
- PLDI-2004-KulkarniHHWDJ #effectiveness #optimisation #sequence
- Fast searches for effective optimization phase sequences (PAK, SH, JH, DBW, JWD, DLJ), pp. 171–182.
- PLDI-2004-VenetB #array #bound #c #embedded #precise #scalability #source code
- Precise and efficient static array bound checking for large embedded C programs (AV, GPB), pp. 231–242.
- SAC-J-2003-ShinjoKP04 #imperative #interface
- Efficient mediators with closures for handling dynamic interfaces in an imperative language (YS, TK, CP), pp. 351–357.
- ASE-2004-Alzamil #analysis #named
- RCAT: A Performance Analysis Tool (ZA), pp. 366–370.
- ASE-2004-CaiGH #automation #case study #experience #generative #open source #scalability
- Experiences Integrating and Scaling a Performance Test Bed Generator with an Open Source CASE Tool (YC, JCG, JGH), pp. 36–45.
- ASE-2004-CompareDMI #automation #design #experience #industrial #validation
- Automated Performance Validation of Software Design: An Industrial Experience (DC, AD, ADM, PI), pp. 298–301.
- FSE-2004-PerkinsE #algorithm #detection #incremental #invariant
- Efficient incremental algorithms for dynamic detection of likely invariants (JHP, MDE), pp. 23–32.
- FSE-2004-XuDS #c #memory management #safety #source code
- An efficient and backwards-compatible transformation to ensure memory safety of C programs (WX, DCD, RS), pp. 117–126.
- ICSE-2004-AkgulMP #assembly #execution #slicing
- A Fast Assembly Level Reverse Execution Method via Dynamic Slicing (TA, VJMI, SP), pp. 522–531.
- ICSE-2004-BlackburnCM #garbage collection #java
- Oil and Water? High Performance Garbage Collection in Java with MMTk (SMB, PC, KSM), pp. 137–146.
- ICSE-2004-Matinlassi #architecture #comparison #design #product line
- Comparison of Software Product Line Architecture Design Methods: COPA, FAST, FORM, KobrA and QADA (MM), pp. 127–136.
- ICSE-2004-SenVAR #distributed #monitoring #safety
- Efficient Decentralized Monitoring of Safety in Distributed Systems (KS, AV, GA, GR), pp. 418–427.
- ICSE-2004-ZhangGZ #diagrams #dynamic analysis #order #slicing #using
- Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams (XZ, RG, YZ), pp. 502–511.
- SAC-2004-Al-SadiA #algorithm #fault tolerance #using
- Efficient fault-tolerant routing algorithm for OTIS-cube using unsafety vectors (JAS, AMA), pp. 1426–1430.
- SAC-2004-AtasuBM #implementation #platform
- Efficient AES implementations for ARM based platforms (KA, LB, MM), pp. 841–845.
- SAC-2004-BackesKBS #comparison #enterprise #policy #privacy
- Efficient comparison of enterprise privacy policies (MB, GK, WB, MS), pp. 375–382.
- SAC-2004-Cazzola #named
- SmartMethod: an efficient replacement for method (WC), pp. 1305–1309.
- SAC-2004-ChangK #scalability
- An efficient management scheme for large-scale flash-memory storage systems (LPC, TWK), pp. 862–868.
- SAC-2004-ChangWL #web
- Enhanced object management for high performance web proxies (YJC, YCW, FL), pp. 1711–1716.
- SAC-2004-CherkasovaT #resource management
- Providing resource allocation and performance isolation in a shared streaming-media hosting service (LC, WT), pp. 1213–1218.
- SAC-2004-FoulirasXTM #lightweight #multi #named #protocol #video
- LEMP: Lightweight Efficient Multicast Protocol for video on demand (PEF, SX, NT, AM), pp. 1226–1231.
- SAC-2004-JuhaszC #clustering #multi #platform
- Exploiting fast ethernet performance in multiplatform cluster environment (SJ, HC), pp. 1407–1411.
- SAC-2004-ListM #metric #towards
- Towards a Corporate Performance Measurement System (BL, KM), pp. 1344–1350.
- SAC-2004-LuLFDB #algorithm #clustering #named #search-based
- FGKA: a Fast Genetic K-means Clustering Algorithm (YL, SL, FF, YD, SJB), pp. 622–623.
- SAC-2004-OlteanuFB #data type #query #xml
- An efficient single-pass query evaluator for XML data streams (DO, TF, FB), pp. 627–631.
- SAC-2004-ParkKLK #architecture #embedded #energy #memory management
- An energy efficient cache memory architecture for embedded systems (JWP, CGK, JHL, SDK), pp. 884–890.
- SAC-2004-QianZ #automation #clustering #named
- GraphZip: a fast and automatic compression method for spatial data clustering (YQ, KZ), pp. 571–575.
- SAC-2004-StamatakisLM #scalability
- A fast program for maximum likelihood-based inference of large phylogenetic trees (AS, TL, HM), pp. 197–201.
- SAC-2004-TangMC #embedded #fixpoint #implementation #mobile #using #verification
- Efficient implementation of fingerprint verification for mobile embedded systems using fixed-point arithmetic (TYT, YSM, KCC), pp. 821–825.
- SAC-2004-WongCL #xml
- Efficient management of XML contents over wireless environment by Xstream (EYCW, ATSC, HVL), pp. 1122–1127.
- SAC-2004-WuCY
- VCR indexing for fast event matching for highly-overlapping range predicates (KLW, SKC, PSY), pp. 740–747.
- SAC-PL-J-2004-Cazzola #java #named
- SmartReflection: Efficient Introspection in Java (WC), pp. 117–132.
- GPCE-2004-VizhanyoAS #generative #towards
- Towards Generation of Efficient Transformations (AV, AA, FS), pp. 298–316.
- ASPLOS-2004-LiLDZZAK #energy #in memory #memory management
- Performance directed energy management for main memory and disks (XL, ZL, FMD, PZ, YZ, SVA, SK), pp. 271–283.
- CC-2004-McPeakN #generative #glr #named #parsing
- Elkhound: A Fast, Practical GLR Parser Generator (SM, GCN), pp. 73–88.
- CGO-2004-Adl-TabatabaiBCEFLMS #java
- Improving 64-Bit Java IPF Performance by Compressing Heap References (ARAT, JB, MC, ME, JF, BTL, BRM, JMS), pp. 100–110.
- CGO-2004-Winkel #scheduling
- Exploring the Performance Potential of Itanium® Processors with ILP-based Scheduling (SW), pp. 189–200.
- DAC-2004-AgarwalSYV #modelling
- Fast and accurate parasitic capacitance models for layout-aware (AA, HS, VY, RV), pp. 145–150.
- DAC-2004-AlpertHHQ #flexibility #layout #physics
- Fast and flexible buffer trees that navigate the physical layout environment (CJA, MH, JH, STQ), pp. 24–29.
- DAC-2004-AnastasakisMP #equivalence
- Efficient equivalence checking with partitions and hierarchical cut-points (DA, LM, SP), pp. 539–542.
- DAC-2004-ContiCVOT #algorithm #analysis
- Performance analysis of different arbitration algorithms of the AMBA AHB bus (MC, MC, GBV, SO, CT), pp. 618–621.
- DAC-2004-DavareLKS #implementation #specification
- The best of both worlds: the efficient asynchronous implementation of synchronous specifications (AD, KL, AK, ALSV), pp. 588–591.
- DAC-2004-GopeCJ #matrix #modelling #multi #rank
- A fast parasitic extractor based on low-rank multilevel matrix compression for conductor and dielectric modeling in microelectronics and MEMS (DG, SC, VJ), pp. 794–799.
- DAC-2004-HanBBCJ #architecture #data transfer #distributed #flexibility #memory management #multi #scalability
- An efficient scalable and flexible data transfer architecture for multiprocessor SoC with massive distributed memory (SIH, AB, MB, SIC, AAJ), pp. 250–255.
- DAC-2004-HandaV #algorithm #online
- An efficient algorithm for finding empty space for online FPGA placement (MH, RV), pp. 960–965.
- DAC-2004-JeongN #detection
- Fast hazard detection in combinational circuits (CJ, SMN), pp. 592–595.
- DAC-2004-KimYKK #functional #hardware #simulation
- Communication-efficient hardware acceleration for fast functional simulation (YIK, WSY, YSK, CMK), pp. 293–298.
- DAC-2004-MeiRCHD #robust
- Robust, stable time-domain methods for solving MPDEs of fast/slow systems (TM, JSR, TSC, SAH, DMD), pp. 848–853.
- DAC-2004-MuttrejaRRJ #automation #embedded #energy #megamodelling
- Automated energy/performance macromodeling of embedded software (AM, AR, SR, NKJ), pp. 99–102.
- DAC-2004-NakamuraHKYY #c #c++ #communication #hardware #using
- A fast hardware/software co-verification method for system-on-a-chip by using a C/C++ simulator and FPGA emulator with shared register communication (YN, KH, IK, KY, TY), pp. 299–304.
- DAC-2004-OrshanskyB #analysis #correlation #statistics
- Fast statistical timing analysis handling arbitrary delay correlations (MO, AB), pp. 337–342.
- DAC-2004-ParthasarathyICW #constraints #theorem proving
- An efficient finite-domain constraint solver for circuits (GP, MKI, KTC, LCW), pp. 212–217.
- DAC-2004-PasrichaDB #approach #architecture #communication #modelling #transaction
- Extending the transaction level modeling approach for fast communication architecture exploration (SP, NDD, MBR), pp. 113–118.
- DAC-2004-TaylorS #array #energy
- Enabling energy efficiency in via-patterned gate array devices (RRT, HS), pp. 874–878.
- DAC-2004-VermaDS #online #testing
- Efficient on-line testing of FPGAs with provable diagnosabilities (VV, SD, VS), pp. 498–503.
- DAC-2004-VujkovicWSS
- Efficient timing closure without timing driven placement and routing (MV, DW, WS, CS), pp. 268–273.
- DAC-2004-WongBK #reduction
- Passivity-preserving model reduction via a computationally efficient project-and-balance scheme (NW, VB, CKK), pp. 369–374.
- DAC-2004-WuC #analysis #design #network
- Efficient power/ground network analysis for power integrity-driven design methodology (SWW, YWC), pp. 177–180.
- DAC-2004-ZhangDRRC #synthesis #towards
- A synthesis flow toward fast parasitic closure for radio-frequency integrated circuits (GZ, EAD, RAR, RAR, LRC), pp. 155–158.
- DATE-DF-2004-DaglioIRRS #component #simulation
- Building the Hierarchy from a Flat Netlist for a Fast and Accurate Post-Layout Simulation with Parasitic Components (PD, DI, DR, CR, SS), pp. 336–337.
- DATE-DF-2004-Dandia #design
- Package Design for High Performance ICs (SD), p. 5.
- DATE-DF-2004-FlautnerFRP #energy #named #scalability
- IEM926: An Energy Efficient SoC with Dynamic Voltage Scaling (KF, DF, DR, DIP), pp. 324–329.
- DATE-DF-2004-PapaefstathiouKZ #network
- Software Processing Performance in Network Processors (IP, GK, NZ), pp. 186–191.
- DATE-DF-2004-PaulinPBLL #framework #multi #platform
- Application of a Multi-Processor SoC Platform to High-Speed Packet Forwarding (PGP, CP, EB, ML, DL), pp. 58–63.
- DATE-DF-2004-Tissafi-DrissiOG #automation #design #framework #multi #named #platform
- RUNE: Platform for Automated Design of Integrated Multi-Domain Systems. Application to High-Speed CMOS Photoreceiver Front-Ends (FTD, IO, FG), pp. 16–21.
- DATE-DF-2004-WortmannSM #architecture
- A High-Speed Transceiver Architecture Implementable as Synthesizable IP Core (AW, SS, MM), pp. 46–51.
- DATE-v1-2004-AlakarhuN #estimation #locality #metric
- Scalar Metric for Temporal Locality and Estimation of Cache Performance (JA, JN), pp. 730–731.
- DATE-v1-2004-ChenG #adaptation #bias #low cost #power management #reduction
- A Low Cost Individual-Well Adaptive Body Bias (IWABB) Scheme for Leakage Power Reduction and Performance Enhancement in the Presence of Intra-Die Variations (TWC, JG), pp. 240–245.
- DATE-v1-2004-ChoiSP #energy #fine-grained #precise #scalability #trade-off
- Fine-Grained Dynamic Voltage and Frequency Scaling for Precise Energy and Performance Trade-Off Based on the Ratio of Off-Chip Access to On-Chip Computation Times (KC, RS, MP), pp. 4–9.
- DATE-v1-2004-DimopoulosL #sequence #set #testing
- Efficient Static Compaction of Test Sequence Sets through the Application of Set Covering Techniques (MGD, PL), pp. 194–201.
- DATE-v1-2004-HandaV #algorithm
- A Fast Algorithm for Finding Maximal Empty Rectangles for Dynamic FPGA Placement (MH, RV), pp. 744–745.
- DATE-v1-2004-KielyG #modelling #using
- Performance Modeling of Analog Integrated Circuits Using Least-Squares Support Vector Machines (TK, GGEG), pp. 448–453.
- DATE-v1-2004-LaurentJSM #analysis #approach #functional #modelling #power management
- Functional Level Power Analysis: An Efficient Approach for Modeling the Power Consumption of Complex Processors (JL, NJ, ES, EM), pp. 666–667.
- DATE-v1-2004-LiHS #novel #satisfiability
- A Novel SAT All-Solutions Solver for Efficient Preimage Computation (BL, MSH, SS), pp. 272–279.
- DATE-v1-2004-PadmanabanT #fault #identification #using
- Using BDDs and ZBDDs for Efficient Identification of Testable Path Delay Faults (SP, ST), pp. 50–55.
- DATE-v1-2004-PosadasHSVB #analysis
- System-Level Performance Analysis in SystemC (HP, FH, PS, EV, FB), pp. 378–383.
- DATE-v1-2004-RanjanVASVG #modelling #synthesis #using
- Fast, Layout-Inclusive Analog Circuit Synthesis using Pre-Compiled Parasitic-Aware Symbolic Performance Models (MR, WV, AA, HS, RV, GGEG), pp. 604–609.
- DATE-v1-2004-SehgalC #architecture #composition #testing #using
- Efficient Modular Testing of SOCs Using Dual-Speed TAM Architectures (AS, KC), pp. 422–427.
- DATE-v1-2004-ShinKCCKE #architecture #design
- Fast Exploration of Parameterized Bus Architecture for Communication-Centric SoC Design (CS, YTK, EYC, KMC, JTK, SKE), pp. 352–357.
- DATE-v1-2004-SrinivasanBCC #metric #using
- Efficient Test Strategy for TDMA Power Amplifiers Using Transient Current Measurements: Uses and Benefit (GS, SB, SC, AC), pp. 280–285.
- DATE-v1-2004-Velev #verification
- Exploiting Signal Unobservability for Efficient Translation to CNF in Formal Verification of Microprocessors (MNV), pp. 266–271.
- DATE-v1-2004-WilsonRBKB #behaviour #modelling
- Efficient Mixed-Domain Behavioural Modeling of Ferromagnetic Hysteresis Implemented in VHDL-AMS (PRW, JNR, ADB, TJK, JB), pp. 742–743.
- DATE-v2-2004-BanerjeeVC #architecture
- A Power and Performance Model for Network-on-Chip Architectures (NB, PV, KSC), pp. 1250–1255.
- DATE-v2-2004-ChandraXSP #design
- An Interconnect Channel Design Methodology for High Performance Integrated Circuits (VC, AX, HS, LTP), pp. 1138–1143.
- DATE-v2-2004-ElviraMAG #generative #megamodelling #simulation
- A Macromodelling Methodology for Efficient High-Level Simulation of Substrate Noise Generation (LE, FM, XA, JLG), pp. 1362–1363.
- DATE-v2-2004-GuptaK #statistics
- A Fast Word-Level Statistical Estimator of Intra-Bus Crosstalk (SG, SK), pp. 1110–1115.
- DATE-v2-2004-JersakHE #analysis #design #embedded
- Context-Aware Performance Analysis for Efficient Embedded System Design (MJ, RH, RE), pp. 1046–1051.
- DATE-v2-2004-KarandikarS #implementation
- Fast Comparisons of Circuit Implementations (SKK, SSS), pp. 910–915.
- DATE-v2-2004-KhawamBPAAAW #array #configuration management #implementation #mobile #video
- Efficient Implementations of Mobile Video Computations on Domain-Specific Reconfigurable Arrays (SK, SB, AP, IA, NA, TA, FW), pp. 1230–1235.
- DATE-v2-2004-MineKKWA #hybrid #linear #reduction #simulation
- Hybrid Reduction Technique for Efficient Simulation of Linear/Nonlinear Mixed Circuits (TM, HK, AK, TW, HA), pp. 1327–1333.
- DATE-v2-2004-RadulescuDGRW #abstraction #flexibility #interface #network
- An Efficient On-Chip Network Interface Offering Guaranteed Services, Shared-Memory Abstraction, and Flexible Network Configuration (AR, JD, KGWG, ER, PW), pp. 878–883.
- DATE-v2-2004-UedaSTI #architecture #embedded #estimation
- Architecture-Level Performance Estimation for IP-Based Embedded Systems (KU, KS, YT, MI), pp. 1002–1007.
- DATE-v2-2004-VerbauwhedeSPK #architecture #design #embedded #energy #multi
- Architectures and Design Techniques for Energy Efficient Embedded DSP and Multimedia Processing (IV, PS, CP, BK), pp. 988–995.
- HPCA-2004-PengPL
- Signature Buffer: Bridging Performance Gap between Registers and Caches (LP, JKP, KL), pp. 164–175.
- HPDC-2004-Abu-GhazalehLG #difference
- Differential Serialization for Optimized SOAP Performance (NAG, MJL, MG), pp. 55–64.
- HPDC-2004-ChervenakPBKS #scalability
- Performance and Scalability of a Replica Location Service (ALC, NP, SB, CK, RS), pp. 182–191.
- HPDC-2004-ChungH #automation #clustering #web #web service
- Automated Cluster-Based Web Service Performance Tuning (IHC, JKH), pp. 36–44.
- HPDC-2004-DenisAHVKB #communication #problem #security
- Wide-Area Communication for Grids: An Integrated Solution to Connectivity, Performance and Security Problems (AD, OA, RFHH, KV, TK, HEB), pp. 97–106.
- HPDC-2004-VijayakumarP #data type #evaluation
- Performance Evaluation of Rate-Based Join Window Sizing for Asynchronous Data Streams (NNV, BP), pp. 260–261.
- HPDC-2004-WuB #clustering #consistency
- Achieving Performance Consistency in Heterogeneous Clusters (CW, RCB), pp. 140–149.
- LCTES-2004-HiserD #algorithm #compilation #memory management #named
- EMBARC: an efficient memory bank assignment algorithm for retargetable compilers (JH, JWD), pp. 182–191.
- LCTES-2004-KumarSD #concurrent #integration #thread
- Asynchronous software thread integration for efficient software (NJK, SS, AGD), pp. 37–46.
- LCTES-2004-ZengSE #concurrent #dependence #generative #graph
- Generating fast code from concurrent program dependence graphs (JZ, CS, SAE), pp. 175–181.
- OSDI-2004-BosBCNP #named
- FFPF: Fairly Fast Packet Filters (HB, WdB, MLC, TN, GP), pp. 347–363.
- OSDI-2004-ParkPPW #named #reliability
- CoDNS: Improving DNS Performance and Reliability via Cooperative Lookups (KP, VSP, LLP, ZW), pp. 199–214.
- PDP-2004-AljundiD #multi #network
- The Effect of the Degree of Multistage Interconnection Networks on their Performance: The Case of Delta and Over-Sized Delta Networks (ACA, JLD), p. 72–?.
- PDP-2004-BorzemskiLN #analysis #data mining #internet #mining
- Application of Data Mining for the Analysis of Internet Path Performance (LB, LL, ZN), pp. 54–59.
- PDP-2004-BulicG #analysis #compilation #dependence #multi
- Fast Dependence Analysis in a Multimedia Vectorizing Compiler (PB, VG), pp. 176–183.
- PDP-2004-GuiradoRRL #predict #using
- Performance Prediction Using an Application-Oriented Mapping Tool (FG, AR, CR, EL), pp. 184–191.
- PDP-2004-MaciasSS #detection #monitoring #source code
- Efficient Monitoring to Detect Wireless Channel Failures for MPI Programs (EMM, ÁS, VSS), pp. 374–381.
- PDP-2004-NemethGB #evaluation #problem
- Performance Evaluation on Grids: Directions, Issues and Open Problems (ZN, GG, ZB), p. 290–?.
- PDP-2004-VilayannurRCTSK #interface #on the
- On the Performance of the POSIX I/O Interface to PVFS (MV, RBR, PHC, RT, AS, MTK), pp. 332–339.
- ESOP-2004-AbadiBF #π-calculus
- Just Fast Keying in the π Calculus (MA, BB, CF), pp. 340–354.
- FASE-2004-BardohlELT #aspect-oriented #graph transformation #metamodelling #visual notation
- Integrating Meta-modelling Aspects with Graph Transformation for Efficient Visual Language Definition and Model Manipulation (RB, HE, JdL, GT), pp. 214–228.
- STOC-2004-AlbersS #algorithm #on the
- On the performance of greedy algorithms in packet buffering (SA, MS), pp. 35–44.
- TACAS-2004-BaierHHK #bound #markov #process #reachability
- Efficient Computation of Time-Bounded Reachability Probabilities in Uniform Continuous-Time Markov Decision Processes (CB, BRH, HH, JPK), pp. 61–76.
- TACAS-2004-BardinFL #automaton
- FASTer Acceleration of Counter Automata in Practice (SB, AF, JL), pp. 576–590.
- TACAS-2004-GeldenhuysV #algorithm #ltl #on the fly #verification
- Tarjan’s Algorithm Makes On-the-Fly LTL Verification More Efficient (JG, AV), pp. 205–219.
- TACAS-2004-SenRA #analysis #online #parallel #predict #safety #source code #thread
- Online Efficient Predictive Safety Analysis of Multithreaded Programs (KS, GR, GA), pp. 123–138.
- CAV-2004-ArthoSBEBZ #dynamic analysis #java #named
- JNuke: Efficient Dynamic Analysis for Java (CA, VS, AB, PE, MB, BZ), pp. 462–465.
- CAV-2004-GanaiGA #bound #embedded #model checking #modelling
- Efficient Modeling of Embedded Memories in Bounded Model Checking (MKG, AG, PA), pp. 440–452.
- CAV-2004-GanzingerHNOT
- DPLL( T): Fast Decision Procedures (HG, GH, RN, AO, CT), pp. 175–188.
- CAV-2004-GopalakrishnanYS #execution #memory management #order #verification
- QB or Not QB: An Efficient Execution Verification Tool for Memory Orderings (GG, YY, HS), pp. 401–413.
- CSL-2004-AvelloneFFM #calculus #implementation #logic
- A Space Efficient Implementation of a Tableau Calculus for a Logic with a Constructive Negation (AA, CF, GF, UM), pp. 488–502.
- ICLP-2004-TronconJV #compilation #control flow #evaluation #lazy evaluation #query
- Fast Query Evaluation with (Lazy) Control Flow Compilation (RT, GJ, HV), pp. 240–253.
- IJCAR-2004-Avenhaus #algorithm #permutation
- Efficient Algorithms for Computing Modulo Permutation Theories (JA), pp. 415–429.
- IJCAR-2004-GilHSZ #algorithm #constraints #finite #order #problem
- Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract (ÀJG, MH, GS, BZ), pp. 244–258.
- IJCAR-2004-RiazanovV #constraints
- Efficient Checking of Term Ordering Constraints (AR, AV), pp. 60–74.
SAT-2004-HuangD #using- Using DPLL for Efficient OBDD Construction (JH, AD), pp. 127–136.
- SAT-2004-Velev #encoding #satisfiability
- Encoding Global Unobservability for Efficient Translation to SAT (MNV), pp. 197–204.
- TestCom-2004-DibuzST #mobile
- BCMP Performance Test with TTCN-3 Mobile Node Emulator (SD, TS, ZT), pp. 50–59.
- ICDAR-2003-GattaniMG #analysis #approach #documentation #image #multi
- A Fast Multifunctional Approach for Document Image Analysis (AG, MM, HG), pp. 1178–1182.
- ICDAR-2003-Hilaire #algorithm #evaluation
- A Matching Scheme to Enhance Performance Evaluation of Raster-to-Vector Conversion Algorithms (XH), pp. 629–633.
- ICDAR-2003-HoqueSF #approach #classification #multi #recognition
- A New Chain-code Quantization Approach Enabling High Performance Handwriting Recognition based on Multi-Classifier Schemes (SH, KS, MCF), pp. 834–838.
- ICDAR-2003-HuoF #modelling #using
- Improving Chinese/English OCR Performance by Using MCE-based Character-Pair Modeling and Negative Training (QH, ZDF), pp. 364–368.
- ICDAR-2003-LucasPD #image #recognition #word
- Fast Lexicon-Based Word Recognition in Noisy Index Card Images (SML, GP, ACD), pp. 462–466.
- ICDAR-2003-VelekN #classification #online #recognition #scalability #set
- Enhancing Efficiency and Speed of an Off-line Classifier Employed for On-line Handwriting Recognition of a Large Character Set (OV, MN), pp. 784–788.
- ICDAR-2003-ZhaiWDL
- A Line Drawings Degradation Model for Performance Characterization (JZ, LW, DD, QL), p. 1020–?.
- JCDL-2003-WildemuthMYGWHG #how #video
- How Fast Is Too Fast? Evaluating Fast Forward Surrogates for Digital Video (BMW, GM, MY, GG, TW, AH, RG), pp. 221–230.
- SIGMOD-2003-AgichteinG #database #information management #named
- QXtract: A Building Block for Efficient Information Extraction from Plain-Text Databases (EA, LG), p. 663.
- SIGMOD-2003-ChaudhuriGGM #fuzzy #online #robust
- Robust and Efficient Fuzzy Match for Online Data Cleaning (SC, KG, VG, RM), pp. 313–324.
- SIGMOD-2003-CuiOTS #in memory #memory management
- Contorting High Dimensional Data for Efficient Main Memory Processing (BC, BCO, JS, KLT), pp. 479–490.
- SIGMOD-2003-FaginKS #classification #rank #similarity
- Efficient similarity search and classification via rank aggregation (RF, RK, DS), pp. 301–312.
- SIGMOD-2003-LakshmananPZ #named #semantics #summary
- QC-Trees: An Efficient Summary Structure for Semantic OLAP (LVSL, JP, YZ), pp. 64–75.
- SIGMOD-2003-Mamoulis
- Efficient Processing of Joins on Set-valued Attributes (NM), pp. 157–168.
- SIGMOD-2003-Pruscino #architecture
- Oracle RAC: Architecture and Performance (AP), p. 635.
- SIGMOD-2003-ShenNSHS #database #image #named #novel #reduction #scalability
- CMVF: A Novel Dimension Reduction Scheme for Efficient Indexing in A Large Image Database (JS, AHHN, JS, DQH, QZS), p. 657.
- SIGMOD-2003-Ullman #education
- Improving the Efficiency of Database-System Teaching (JDU), pp. 1–3.
- VLDB-2003-AnKR
- Improving Performance with Bulk-Inserts in Oracle R-Trees (NA, KVRK, SR), pp. 948–951.
- VLDB-2003-BhattacharjeePMLCH #clustering #multi #query
- Efficient Query Processing for Multi-Dimensionally Clustered Tables in DB2 (BB, SP, TM, TL, LC, MH), pp. 963–974.
- VLDB-2003-ChenJLP #evaluation #xquery
- From Tree Patterns to Generalized Tree Patterns: On Efficient Evaluation of XQuery (ZC, HVJ, LVSL, SP), pp. 237–248.
- VLDB-2003-HristidisGP #database #keyword #relational
- Efficient IR-Style Keyword Search over Relational Databases (VH, LG, YP), pp. 850–861.
- VLDB-2003-Koch #approach #query #xml
- Efficient Processing of Expressive Node-Selecting Queries on XML Data in Secondary Storage: A Tree Automata-based Approach (CK), pp. 249–260.
- VLDB-2003-KoudasGGSV #approximate #constraints #optimisation #parametricity #query
- Efficient Approximation Of Optimization Queries Under Parametric Aggregation Constraints (SG, DG, NK, DS, MV), pp. 778–789.
- VLDB-2003-LabrinidisR #database #web
- Balancing Performance and Data Freshness in Web Database Servers (AL, NR), pp. 393–404.
- VLDB-2003-SchindlerAG #database #named #robust
- Lachesis: Robust Database Storage Management Based on Device-specific Performance Characteristics (JS, AA, GRG), pp. 706–717.
- VLDB-2003-ShahDR #approach #streaming
- An Efficient and Resilient Approach to Filtering and Disseminating Streaming Data (SS, SD, KR), pp. 57–68.
- VLDB-2003-YangLH #mining #query #xml
- Efficient Mining of XML Query Patterns for Caching (LHY, MLL, WH), pp. 69–80.
- CSEET-2003-Peters04 #re-engineering
- Managing the Performance of Software Engineering Professional (LJP), p. 338–?.
- CSEET-2003-ZuserG
- Reflecting Skills and Personality Internally as Means for Team Performance Improvement (WZ, TG), pp. 234–241.
- ITiCSE-2003-Fone #education #using
- Using semiotics to analyze the efficiency of a model in teaching (WF), p. 232.
- ITiCSE-2003-Gal-EzerVZ #algorithm #approach #education
- Teaching algorithm efficiency in a CS1 course SBTa different approach (JGE, TV, EZ), p. 256.
- CSMR-2003-Latendresse #c #c++ #evaluation #preprocessor #symbolic computation #using
- Fast Symbolic Evaluation of C/C++ Preprocessing Using Conditional Value (ML), p. 170–?.
- CSMR-2003-MerloAB #analysis #fuzzy
- Fast Flow Analysis to Compute Fuzzy Estimates of Risk Levels (EM, GA, PLB), p. 351–?.
- IWPC-2003-BeyerL #analysis #named #object-oriented #source code
- CrocoPat: Efficient Pattern Analysis in Object-Oriented Programs (DB, CL), pp. 294–295.
- IWPC-2003-Reiss #analysis
- Event-Based Performance Analysis (SPR), pp. 74–83.
- SCAM-2003-BinkleyH #algorithm #analysis #graph #optimisation #reachability #scalability #source code
- Results from a Large-Scale Study of Performance Optimization Techniques for Source Code Analyses Based on Graph Reachability Algorithms (DB, MH), p. 203–?.
- WCRE-2003-BeyerNL #query #relational
- Simple and Efficient Relational Querying of Software Structures (DB, AN, CL), pp. 216–225.
- CIAA-2003-AllauzenM #algorithm
- An Efficient Pre-determinization Algorithm (CA, MM), pp. 83–95.
- ICALP-2003-BansalAM #multi
- Stable Marriages with Multiple Partners: Efficient Search for an Optimal Solution (VB, AA, VSM), pp. 527–542.
- ICALP-2003-HallHS #algorithm #complexity #multi
- Multicommodity Flows over Time: Efficient Algorithms and Complexity (AH, SH, MS), pp. 397–409.
- ICALP-2003-MatiasP #traversal
- Efficient Pebbling for List Traversal Synopses (YM, EP), pp. 918–928.
- ICALP-2003-Schonhage #adaptation #optimisation
- Adaptive Raising Strategies Optimizing Relative Efficiency (AS), pp. 611–623.
- RTA-2003-SinotFM #reduction #string
- Efficient Reductions with Director Strings (FRS, MF, IM), pp. 46–60.
- SFM-2003-BalsamoBS #architecture #evaluation
- Performance Evaluation at the Software Architecture Level (SB, MB, MS), pp. 207–258.
- CHI-2003-JackoSSBEEKMZ #feedback #multimodal #question #visual notation #what
- Older adults and visual impairment: what do exposure times and accuracy tell us about performance gains associated with multimodal feedback? (JAJ, IUS, FS, LB, PJE, VKE, TK, KPM, BSZ), pp. 33–40.
- CHI-2003-TanGSP #visual notation
- With similar visual angles, larger displays improve spatial performance (DST, DG, PS, RP), pp. 217–224.
- EDOC-2003-DimitrakosDMJP #assessment #contract
- Contract Performance Assessment for Secure and Dynamic Virtual Collaborations (TD, ID, ZM, AJ, CIP), pp. 62–75.
- EDOC-2003-GortonACHH #scalability
- An Efficient, Scalable Content-Based Messaging System (IG, JA, NC, JH, MH), pp. 278–287.
- ICEIS-v1-2003-Carneiro #enterprise #modelling
- Modelling Data Warehousing Management in Enterprise Performance (AC), pp. 468–473.
- ICEIS-v1-2003-HoBE #approach #database #xml
- Efficient Storage for XML Databases: Vertical View Model with Signature-Based Approach (WH, LB, DE), pp. 55–62.
- ICEIS-v1-2003-MuixiC #database #distributed
- Performance Improvement of Distributed Database Management Systems (JMM, AC), pp. 533–540.
- ICEIS-v1-2003-WongL #multi #recursion #streaming #video
- Recursive Patching — An Efficient Technique for Multicast Video Streaming (YWW, JYBL), pp. 306–312.
- ICEIS-v2-2003-HassanienA #algorithm #classification #image #retrieval #set
- An Efficient Classification and Image Retrieval Algorithm Based on Rough Set Theory (AEH, JMHA), pp. 457–460.
- ICEIS-v2-2003-KeeniGS #learning #network #on the #using
- On Fast Learning of Neural Networks Using Back Propagation (KK, KG, HS), pp. 266–271.
- ICEIS-v2-2003-NastacM #network
- An Efficient Procedure for Artificial Neural Networks Retraining (DIN, RM), pp. 324–329.
- ICEIS-v2-2003-OuazzaneZME #database #monitoring #network #process
- The Use of Neural Network and Database Technology to Reengineer the Technical Process of Monitoring Coal Combustion Efficiency (KO, KZ, FM, KE), pp. 495–498.
- ICEIS-v4-2003-PhillipsH #mobile #simulation
- Simulation Study of TCP Performance Over Mobile IPV4 and Mobile IPV6 (DP, JH), pp. 224–231.
- CIKM-2003-BroderCHSZ #evaluation #process #query #retrieval #using
- Efficient query evaluation using a two-level retrieval process (AZB, DC, MH, AS, JYZ), pp. 426–434.
- CIKM-2003-FisherLSW #xml
- Efficient ordering for XML data (DKF, FL, WMS, RKW), pp. 350–357.
- CIKM-2003-LiZO #analysis #categorisation #multi
- Efficient multi-way text categorization via generalized discriminant analysis (TL, SZ, MO), pp. 317–324.
- CIKM-2003-NicolaJ #database #parsing #xml
- XML parsing: a threat to database performance (MN, JJ), pp. 175–178.
- CIKM-2003-RamaswamyILD #detection #web
- Techniques for efficient fragment detection in web pages (LR, AI, LL, FD), pp. 516–519.
- CIKM-2003-WeberM #image #retrieval
- Efficient region-based image retrieval (RW, MM), pp. 69–76.
- CIKM-2003-WuSC #web
- Finding more useful information faster from web search results (YfBW, LS, XC), pp. 568–571.
- CIKM-2003-YeeN #data access #multi #source code
- Efficient data access to multi-channel broadcast programs (WGY, SBN), pp. 153–160.
- ECIR-2003-BrisaboaINP #database
- An Efficient Compression Code for Text Databases (NRB, ELI, GN, JRP), pp. 468–481.
- ECIR-2003-LinKT #e-commerce
- Attaining Fast and Successful Searches in E-commerce Environments (RL, SK, JDT), pp. 120–134.
- ECIR-2003-ShinKKK #automation #database #music
- Automatic Construction of Theme Melody Index from Music Database for Fast Content-Based Retrievals (CHS, KIK, KCK, YSK), pp. 605–612.
- ICML-2003-DeCosteM #approximate #classification #incremental #kernel
- Fast Query-Optimized Kernel Machine Classification Via Incremental Approximate Nearest Support Vectors (DD, DM), pp. 115–122.
- ICML-2003-JinYZH #algorithm #exponential #scalability
- A Faster Iterative Scaling Algorithm for Conditional Exponential Model (RJ, RY, JZ, AGH), pp. 282–289.
- ICML-2003-KubicaMCS #analysis #collaboration #graph #query
- Finding Underlying Connections: A Fast Graph-Based Method for Link Analysis and Collaboration Queries (JK, AWM, DC, JGS), pp. 392–399.
- ICML-2003-MannorRG #policy
- The Cross Entropy Method for Fast Policy Search (SM, RYR, YG), pp. 512–519.
- ICML-2003-SchoknechtM #algorithm
- TD(0) Converges Provably Faster than the Residual Gradient Algorithm (RS, AM), pp. 680–687.
- ICML-2003-YanDMW #approximate #classification #optimisation #statistics
- Optimizing Classifier Performance via an Approximation to the Wilcoxon-Mann-Whitney Statistic (LY, RHD, MM, RHW), pp. 848–855.
- ICML-2003-YuL #feature model
- Feature Selection for High-Dimensional Data: A Fast Correlation-Based Filter Solution (LY, HL), pp. 856–863.
- KDD-2003-BronnimannCDHS #reduction
- Efficient data reduction with EASE (HB, BC, MD, PJH, PS), pp. 59–68.
- KDD-2003-El-HajjZ #dataset #interactive #matrix #mining #scalability
- Inverted matrix: efficient discovery of frequent items in large datasets in the context of interactive mining (MEH, ORZ), pp. 109–118.
- KDD-2003-GamaRM #data type #mining
- Accurate decision trees for mining high-speed data streams (JG, RR, PM), pp. 523–528.
- KDD-2003-JinA #streaming
- Efficient decision tree construction on streaming data (RJ, GA), pp. 571–576.
- KDD-2003-TsamardinosAS #markov
- Time and sample efficient discovery of Markov blankets and direct causal relations (IT, CFA, ARS), pp. 673–678.
- KDD-2003-ZakiG #mining #using
- Fast vertical mining using diffsets (MJZ, KG), pp. 326–335.
- KDD-2003-ZhuS #data type #detection
- Efficient elastic burst detection in data streams (YZ, DS), pp. 336–345.
- MLDM-2003-DongKS #optimisation #parallel
- A Fast Parallel Optimization for Training Support Vector Machine (JxD, AK, CYS), pp. 96–105.
- MLDM-2003-HadidP #linear
- Efficient Locally Linear Embeddings of Imperfect Manifolds (AH, MP), pp. 188–201.
- SEKE-2003-Agren #concept #database #named
- CHiC: A Fast Concept Hierarchy Constructor for Discrete or Mixed Mode Databases (OÅ), pp. 250–258.
- SEKE-2003-BarberHB #architecture #multi
- Early Multi-Level Software Architecture Performance Evaluations (KSB, JH, GB), pp. 561–569.
- SEKE-2003-LiWQ #algorithm #recognition
- A Fast Binary Tree Based Face Recognition Algorithm (HL, SW, FQ), pp. 594–598.
- SEKE-2003-RafiqueA #information management
- An Efficient Knowledge Management Technique for finding Association Rules (FR, AA), pp. 245–249.
- SIGIR-2003-AslamPS #algorithm #evaluation #retrieval
- A unified model for metasearch and the efficient evaluation of retrieval systems via the hedge algorithm (JAA, VP, RS), pp. 393–394.
- SIGIR-2003-EvansBH #optimisation #robust
- Optimizing term vectors for efficient and robust filtering (DAE, JB, DAH), pp. 451–452.
- SIGIR-2003-Sakai #evaluation #multi #retrieval
- Average gain ratio: a simple retrieval performance measure for evaluation with multiple relevance levels (TS), pp. 417–418.
- SIGIR-2003-SakaiK #question #retrieval #what
- Evaluating retrieval performance for Japanese question answering: what are best passages? (TS, TK), pp. 429–430.
- OOPSLA-2003-BlackburnM #garbage collection
- Ulterior reference counting: fast garbage collection without a long wait (SB, KSM), pp. 344–358.
- OOPSLA-2003-SachindranEM #garbage collection #named
- Mark-copy: fast copying GC with less space overhead (NS, JEBM), pp. 326–343.
- AdaEurope-2003-OrtizAPS #architecture #case study #evaluation #realtime #uml #using
- A Case Study in Performance Evaluation of Real-Time Teleoperation Software Architectures Using UML-MAST (FJO, BÁ, JAP, PS), pp. 417–428.
- LOPSTR-2003-MurakamiHKT #algorithm #analysis #staging
- An Efficient Staging Algorithm for Binding-Time Analysis (TM, ZH, KK, MT), pp. 106–107.
- LOPSTR-2003-Ruiz-ReinaJHM #case study #data type #reasoning
- Formal Reasoning about Efficient Data Structures: A Case Study in ACL2 (JLRR, JAAJ, MJH, FJMM), pp. 75–91.
- PADL-2003-HuetC #algorithm
- Zen and the Art of Symbolic Computing: Light and Fast Applicative Algorithms for Computational Linguistics (GPH), pp. 17–18.
- PEPM-2003-AgerDR #partial evaluation #pattern matching #string
- Fast partial evaluation of pattern matching in strings (MSA, OD, HKR), pp. 3–9.
- POPL-2003-ZibinGC #algorithm #morphism
- Efficient algorithms for isomorphisms of simple types (YZ, JYG, JC), pp. 160–171.
- PPDP-2003-GrecoZ #bound #datalog #on the #query
- On the rewriting and efficient computation of bound disjunctive datalog queries (SG, EZ), pp. 136–147.
- PPDP-2003-LiuS #datalog #source code
- From datalog rules to efficient programs with time and space guarantees (YAL, SDS), pp. 172–183.
- PPDP-2003-ZhouS #fixpoint #linear
- Efficient fixpoint computation in linear tabling (NFZ, TS), pp. 275–283.
- ESEC-FSE-2003-BalsamoM #approach #modelling
- A simulation-based approach to software performance modeling (SB, MM), pp. 363–366.
- ESEC-FSE-2003-EshuisBDGR #modelling #named #set #validation
- EFFICIENT: a tool set for supporting the modelling and validation of ebXML (RE, PB, ED, BG, SR), pp. 359–362.
- ICSE-2003-Kylmakoski #agile #authoring #documentation #using
- Efficient Authoring of Software Documentation Using RaPiD7 (RK), pp. 255–261.
- ICSE-2003-McDowellWBF #persistent #programming #student
- The Impact of Pair Programming on Student Performance, Perception and Persistence (CM, LLW, HEB, JF), pp. 602–607.
- ICSE-2003-RaghavachariRJ #configuration management #problem #reliability
- The Deployer’s Problem: Configuring Application Servers for Performance and Reliability (MR, DR, RDJ), pp. 484–489.
- ICSE-2003-RussellJ #architecture #embedded #evaluation
- Embedded Architect: A Tool for Early Performance Evaluation of Embedded Software (JTR, MFJ), pp. 824–825.
- SAC-2003-CanWWS #3d #java #named #using #visualisation
- FPV: Fast Protein Visualization Using Java 3D (TC, YW, YFW, JS), pp. 88–95.
- SAC-2003-CarliniB #embedded #realtime #representation
- An Efficient Time Representation for Real-Time Embedded Systems (AC, GCB), pp. 705–712.
- SAC-2003-CofflandP #embedded #evaluation #framework
- A Software Framework for Efficient System-level Performance Evaluation of Embedded Systems (JEC, ADP), pp. 666–671.
- SAC-2003-GiraldezAS #data type
- An Efficient Data Structure for Decision Rules Discovery (RG, JSAR, JCRS), pp. 475–479.
- SAC-2003-HuaJVT #algebra #analysis #approach #data mining #mining #named #using
- ADMiRe: An Algebraic Approach to System Performance Analysis Using Data Mining Techniques (KAH, NJ, RV, DAT), pp. 490–496.
- SAC-2003-KimCHKL #named
- CIGMA: aCtive inventory service in Global e-MArket Based on Efficient Catalog Management (SMK, KC, IH, SK, HKL), pp. 653–658.
- SAC-2003-LaiTB #mobile
- Cost Efficient Broadcast Based Cache Invalidation for Mobile Environments (KYL, ZT, PB), pp. 871–877.
- SAC-2003-LiBKLZ #3d #framework
- A Framework of Individually-Focused Teleconferencing (IFT) via an Efficient 3D Reprojection Technique (QL, CB, CK, TL, SZ), pp. 951–955.
- SAC-2003-MinOF #predict
- Performance Prediction of Wormhole Switching in Hypercubes with Bursty Traffic Pattern (GM, MOK, JDF), pp. 985–989.
- SAC-2003-Ortega-BinderbergeCM #evaluation #feedback #multi #retrieval
- Efficient Evaluation of Relevance Feedback for Multidimensional All-pairs Retrieval (MOB, KC, SM), pp. 847–852.
- SAC-2003-SalveminiSSSZZ #architecture #embedded #energy #trade-off
- A Methodology for the Efficient Architectural Exploration of Energy-Delay Trade-offs for Embedded Systems (LS, MS, DS, CS, VZ, RZ), pp. 672–678.
- SAC-2003-ShinjoKP #code generation #empirical
- Efficient Mediators through Dynamic Code Generation: a Method and an Experiment (YS, TK, CP), pp. 1147–1154.
- SAC-2003-TsengT #mining #mobile #web
- An Efficient Method for Mining Associated Service Patterns in Mobile Web Environments (SMT, CFT), pp. 455–459.
- SAC-2003-ZhangP #algorithm #effectiveness
- A Fast and Effective Steganalytic Technique Against JSteg-like Algorithms (TZ, XP), pp. 307–311.
- GPCE-2003-ChibaN #bytecode #java #tool support
- An Easy-to-Use Toolkit for Efficient Java Bytecode Translators (SC, MN), pp. 364–376.
- CGO-2003-CaiX
- Optimal and Efficient Speculation-Based Partial Redundancy Elimination (QC, JX), pp. 91–104.
- CGO-2003-ChenHC #hardware #monitoring #using
- Dynamic Trace Selection Using Performance Monitoring Hardware Sampling (HC, WCH, DyC), pp. 79–90.
- CGO-2003-Krintz #online
- Coupling On-Line and Off-Line Profile Information to Improve Program Performance (CK), pp. 69–78.
- DAC-2003-AloulMS #named #satisfiability #symmetry
- Shatter: efficient symmetry-breaking for boolean satisfiability (FAA, ILM, KAS), pp. 836–839.
- DAC-2003-BernardinisJS #representation
- Support vector machines for analog circuit performance representation (FDB, MIJ, ALSV), pp. 964–969.
- DAC-2003-ChaiK #constraints #pseudo #theorem proving
- A fast pseudo-boolean constraint solver (DC, AK), pp. 830–835.
- DAC-2003-ChanKLNR #physics #synthesis
- Physical synthesis methodology for high performance microprocessors (YHC, PK, LBL, GAN, TER), pp. 696–701.
- DAC-2003-ChoiK #design #embedded #layout #memory management
- Memory layout techniques for variables utilizing efficient DRAM access modes in embedded system design (YC, TK), pp. 881–886.
- DAC-2003-El-GamalBBHMOP #implementation
- Fast, cheap and under control: the next implementation fabric (AEG, IB, AB, CH, PM, ZOB, LTP), pp. 354–355.
- DAC-2003-FangRPC #modelling #static analysis #towards
- Toward efficient static analysis of finite-precision effects in DSP applications via affine arithmetic modeling (CFF, RAR, MP, TC), pp. 496–501.
- DAC-2003-Hershenson #design
- Efficient description of the design space of analog circuits (MdMH), pp. 970–973.
- DAC-2003-MaideeAB #clustering
- Fast timing-driven partitioning-based placement for island style FPGAs (PM, CA, KB), pp. 598–603.
- DAC-2003-Matsuzawa #collaboration #communication #how #optimisation
- How to make efficient communication, collaboration, and optimization from system to chip (AM), pp. 417–418.
- DAC-2003-MeiAI #order #reduction
- Efficient model order reduction including skin effect (SM, CSA, YII), pp. 232–237.
- DAC-2003-PuriSCKPSSK
- Pushing ASIC performance in a power envelope (RP, LS, JMC, DSK, DZP, DS, AS, SHK), pp. 788–793.
- DAC-2003-QinM #automation #synthesis
- Automated synthesis of efficient binary decoders for retargetable software toolkits (WQ, SM), pp. 764–769.
- DAC-2003-RaghunathanSG #communication #energy #overview
- A survey of techniques for energy efficient on-chip communication (VR, MBS, RKG), pp. 900–905.
- DAC-2003-RamachandranJ #embedded #energy #memory management #named
- Xtream-Fit: an energy-delay efficient data memory subsystem for embedded media processing (AR, MFJ), pp. 137–142.
- DAC-2003-RenG
- Synthesizing optimal filters for crosstalk-cancellation for high-speed buses (JR, MRG), pp. 592–597.
- DAC-2003-ReshadiMD #flexibility #set #simulation
- Instruction set compiled simulation: a technique for fast and flexible instruction set simulation (MR, PM, NDD), pp. 758–763.
- DAC-2003-RussellJ #architecture #component #embedded #evaluation
- Architecture-level performance evaluation of component-based embedded systems (JTR, MFJ), pp. 396–401.
- DAC-2003-ShiG #hybrid #power management
- Hybrid hierarchical timing closure methodology for a high performance and low power DSP (KS, GG), pp. 850–855.
- DAC-2003-StehrGA #analysis #bound #trade-off
- Performance trade-off analysis of analog circuits by normal-boundary intersection (GS, HEG, KA), pp. 958–963.
- DAC-2003-WohlWPA #architecture #logic
- Efficient compression and application of deterministic patterns in a logic BIST architecture (PW, JAW, SP, MBA), pp. 566–569.
- DAC-2003-ZhangCKK #embedded #interprocedural #optimisation
- Interprocedural optimizations for improving data cache performance of array-intensive embedded applications (WZ, GC, MTK, MK), pp. 887–892.
- DAC-2003-ZhongKBR #adaptation #implementation
- An adaptive window-based susceptance extraction and its efficient implementation (GZ, CKK, VB, KR), pp. 728–731.
- DAC-2003-ZhuSW #3d #algorithm #geometry
- Algorithms in FastImp: a fast and wideband impedance extraction program for complicated 3-D geometries (ZZ, BS, JW), pp. 712–717.
- DATE-2003-AlbiolGA #design
- Improved Design Methodology for High-Speed High-Accuracy Current Steering D/A Converters (MA, JLG, EA), pp. 10636–10641.
- DATE-2003-BertozziRBR #embedded #energy #optimisation #protocol
- Transport Protocol Optimization for Energy Efficient Wireless Embedded Systems (DB, AR, LB, SR), pp. 10706–10713.
- DATE-2003-CassidyPT #concurrent #design #multi #thread
- Layered, Multi-Threaded, High-Level Performance Design (ASC, JMP, DET), pp. 10954–10959.
- DATE-2003-DasguptaKM #architecture #metric #novel
- A Novel Metric for Interconnect Architecture Performance (PD, ABK, SM), pp. 10448–10455.
- DATE-2003-DragoFMPP #architecture #embedded #estimation #tuple
- Estimation of Bus Performance for a Tuplespace in an Embedded Architecture (ND, FF, MM, GP, MP), pp. 20188–20195.
- DATE-2003-EeckelaertDGS #modelling
- Generalized Posynomial Performance Modeling (TE, WD, GGEG, WMCS), pp. 10250–10255.
- DATE-2003-HettiaratchiC #approach #clustering #energy #layout
- Mesh Partitioning Approach to Energy Efficient Data Layout (SH, PYKC), pp. 11076–11081.
- DATE-2003-HuM #architecture #energy #flexibility
- Exploiting the Routing Flexibility for Energy/Performance Aware Mapping of Regular NoC Architectures (JH, RM), pp. 10688–10693.
- DATE-2003-LaiYC #evaluation
- A New and Efficient Congestion Evaluation Model in Floorplanning: Wire Density Control with Twin Binary Trees (STWL, EFYY, CCNC), pp. 10856–10861.
- DATE-2003-LiliusTV #architecture #evaluation #protocol
- Fast Evaluation of Protocol Processor Architectures for IPv6 Routing (JL, DT, SV), pp. 20158–20163.
- DATE-2003-LomenaLWK #approach #explosion #scheduling
- An Efficient Hash Table Based Approach to Avoid State Space Explosion in History Driven Quasi-Static Scheduling (AGL, MLLV, YW, AK), pp. 10428–10435.
- DATE-2003-LykakisMVNPSKPR #protocol
- Efficient Field Processing Cores in an Innovative Protocol Processor System-on-Chip (GL, NM, KV, NAN, SP, GS, GEK, DNP, DIR), pp. 20014–20019.
- DATE-2003-MaciiMP #clustering #memory management
- Improving the Efficiency of Memory Partitioning by Address Clustering (AM, EM, MP), pp. 10018–10023.
- DATE-2003-MounirMF #automation #behaviour #verification
- Automatic Behavioural Model Calibration for Efficient PLL System Verification (AM, AM, MF), pp. 20280–20285.
- DATE-2003-MoussaGN #modelling #transaction #using
- Exploring SW Performance Using SoC Transaction-Level Modeling (IM, TG, GN), pp. 20120–20125.
- DATE-2003-PetrovO #memory management
- Power Efficiency through Application-Specific Instruction Memory Transformations (PP, AO), pp. 10030–10035.
- DATE-2003-RapakaM #analysis #embedded
- Pre-Characterization Free, Efficient Power/Performance Analysis of Embedded and General Purpose Software Applications (VSPR, DM), pp. 10504–10509.
- DATE-2003-RenczSP #algorithm #layout #simulation
- A Fast Algorithm for the Layout Based Electro-Thermal Simulation (MR, VS, AP), pp. 11032–11037.
- DATE-2003-ShengH #novel #using
- Efficient Preimage Computation Using A Novel Success-Driven ATPG (SS, MSH), pp. 10822–10827.
- DATE-2003-SoniRHRV #named #network
- NPSE: A High Performance Network Packet Search Engine (NS, NR, LBH, SR, GV), pp. 20074–20081.
- DATE-2003-VelenisPF #network #nondeterminism
- Reduced Delay Uncertainty in High Performance Clock Distribution Networks (DV, MCP, EGF), pp. 10068–10075.
- DATE-2003-YooBBPJ #abstraction #hardware #modelling #simulation
- Building Fast and Accurate SW Simulation Models Based on Hardware Abstraction Layer and Simulation Environment Abstraction Layer (SY, IB, AB, YP, AAJ), pp. 10550–10555.
- DATE-2003-ZengZHC #correlation #using
- Fast Computation of Data Correlation Using BDDs (ZZ, QZ, IGH, MJC), pp. 10122–10129.
- DATE-2003-ZivkovicKWD #architecture #multi #source code
- Fast and Accurate Multiprocessor Architecture Exploration with Symbolic Programs (VDZ, EAdK, PvdW, EFD), pp. 10656–10661.
- HPCA-2003-El-MoursyA #policy #smt
- Front-End Policies for Improved Issue Efficiency in SMT Processors (AEM, DHA), pp. 31–40.
- HPCA-2003-GassendSCDD #memory management #verification
- Caches and Hash Trees for Efficient Memory Integrity Verification (BG, GES, DEC, MvD, SD), pp. 295–306.
- HPCA-2003-HoP #communication #design
- A Methodology for Designing Efficient On-Chip Interconnects on Well-Behaved Communication Patterns (WHH, TMP), pp. 377–388.
- HPCA-2003-JosephBM
- Control Techniques to Eliminate Voltage Emergencies in High Performance Processors (RJ, DMB, MM), pp. 79–90.
- HPCA-2003-KimYDYD #architecture
- Performance Enhancement Techniques for InfiniBand? Architecture (EJK, KHY, CRD, MSY, JD), pp. 253–262.
- HPCA-2003-Kronstadt #challenge #design
- Beyond Performance: Some (Other) Challenges for Systems Design (EK), p. 125.
- HPCA-2003-SakamotoKIAUMK #analysis #architecture #enterprise
- Microarchitecture and Performance Analysis of a SPARC-V9 Microprocessor for Enterprise Server Systems (MS, AK, AI, TA, HU, KM, YK), pp. 141–152.
- HPDC-2003-BalajiWKCPS #data-driven
- Impact of High Performance Sockets on Data Intensive Applications (PB, JW, TMK, ÜVÇ, DKP, JHS), pp. 24–33.
- HPDC-2003-KurmannS #communication #corba #distributed #middleware
- Zero-Copy for CORBA — Efficient Communication for Distributed Object Middleware (CK, TS), pp. 4–13.
- HPDC-2003-TakefusaTMM #algorithm #analysis #architecture #energy #grid #physics #replication #scheduling
- Performance Analysis of Scheduling and Replication Algorithms on Grid Datafarm Architecture for High-Energy Physics Applications (AT, OT, SM, YM), pp. 34–47.
- HPDC-2003-ZhangFS #distributed #information management #monitoring
- A Performance Study of Monitoring and Information Services for Distributed Systems (XZ, JLF, JMS), pp. 270–282.
- LCTES-2003-CorsaroC #java #realtime
- Efficient memory-reference checks for real-time java (AC, RC), pp. 51–58.
- LCTES-2003-Krishnaswamy #using
- Enhancing the performance of 16-bit code using augmenting instructions (AK, RG), pp. 254–264.
- LCTES-2003-Wasowski #on the #synthesis
- On efficient program synthesis from statecharts (AW), pp. 163–170.
- PDP-2003-Danelutto #deployment
- HPC the easy way: new technologies for high performance application deployment (MD), p. 180–?.
- PDP-2003-FahringerMRPVM #analysis #modelling #scalability
- Performance Modeling of Scientific Applications: Scalability Analysis of LAPW0 (TF, NM, MR, SP, UV, GM), pp. 5–12.
- PDP-2003-Marzolla #clustering #monitoring #scalability
- A Performance Monitoring System for Large Computing Clusters (MM), pp. 393–400.
- PDP-2003-ProdanFGMFM #architecture #clustering #grid #on the #parametricity #using
- On Using ZENTURIO for Performance and Parameter Studies on Cluster and Grid Architectures (RP, TF, MG, GM, FF, HM), pp. 185–192.
- PDP-2003-RenaudLBZW #algorithm #comparison #distributed #framework #named
- Algon: A Framework for Supporting Comparison of Distributed Algorithm Performance (KR, JLCL, JB, PvZ, BW), pp. 425–432.
- PDP-2003-SeragiottoFGMM #automation #distributed #on the #parallel #problem #source code #using
- On Using Aksum for Semi-Automatically Searching of Performance Problems in Parallel and Distributed Programs (CSJ, TF, MG, GM, HM), pp. 385–392.
- PDP-2003-Tessera #analysis #clustering
- Performance Analysis of an IBM supercluster (DT), pp. 417–424.
- PDP-2003-TsigasZ #enterprise #evaluation #implementation #parallel
- A Simple, Fast Parallel Implementation of Quicksort and its Performance Evaluation on SUN Enterprise 10000 (PT, YZ), p. 372–?.
- PDP-2003-VilladangosFCMG #algorithm #evaluation
- Knot Resolution Algorithm and its Performance Evaluation (JEV, FF, AC, JRGdM, JRG), pp. 227–234.
- PDP-2003-WolfM #analysis #automation #hybrid
- Automatic Performance Analysis of Hybrid MPI/OpenMP Applications (FW, BM), pp. 13–22.
- PPoPP-2003-CintraF #parallel #robust #towards
- Toward efficient and robust software speculative parallelization on multiprocessors (MHC, DRLF), pp. 13–24.
- PPoPP-2003-Kazar #data mining #mining #scalability
- High performance spatial data mining for very large data-sets (BMK), p. 1.
- PPoPP-2003-McCurdyF #memory management #multi
- User-controllable coherence for high performance shared memory multiprocessors (CM, CNF), pp. 73–82.
- PPoPP-2003-PoznianskyS #c++ #concurrent #detection #multi #on the fly #source code
- Efficient on-the-fly data race detection in multihreaded C++ programs (EP, AS), pp. 179–190.
- SOSP-2003-AguileraMWRM #black box #debugging #distributed
- Performance debugging for distributed systems of black boxes (MKA, JCM, JLW, PR, AM), pp. 74–89.
- STOC-2003-ColeH #algorithm
- A fast algorithm for computing steiner edge connectivity (RC, RH), pp. 167–176.
- STOC-2003-GennaroGK #bound #encryption
- Lower bounds on the efficiency of encryption and digital signature schemes (RG, YG, JK), pp. 417–425.
- STOC-2003-Thorup03a #query
- Space efficient dynamic stabbing with fast queries (MT), pp. 649–658.
- TACAS-2003-BartzisB #bound #constraints
- Construction of Efficient BDDs for Bounded Arithmetic Constraints (CB, TB), pp. 394–408.
- TACAS-2003-HermannsJ #analysis #component #dependence #set
- A Set of Performance and Dependability Analysis Components for CADP (HH, CJ), pp. 425–430.
- TACAS-2003-ZhangCS #analysis #concurrent #functional #verification
- The Integrated CWB-NC/PIOATool for Functional Verification and Performance Analysis of Concurrent Systems (DZ, RC, EWS), pp. 431–436.
- CADE-2003-RiazanovV #relational #retrieval #standard
- Efficient Instance Retrieval with Standard and Relational Path Indexing (AR, AV), pp. 380–396.
- CAV-2003-BardinFLP #named
- FAST: Fast Acceleration of Symbolikc Transition Systems (SB, AF, JL, LP), pp. 118–121.
- CAV-2003-BartzisB #image #infinity #model checking
- Efficient Image Computation in Infinite State Model Checking (CB, TB), pp. 249–261.
- CAV-2003-ClarkeGTW #abstraction #how
- Making Predicate Abstraction Efficient: How to Eliminate Redundant Predicates (EMC, OG, MT, DW), pp. 126–140.
- CAV-2003-Obdrzalek #bound #calculus #model checking #μ-calculus
- Fast μ-Calculus Model Checking when Tree-Width Is Bounded (JO), pp. 80–92.
- CSL-2003-RybinaV #infinity #model checking
- Fast Infinite-State Model Checking in Integer-Based Systems (TR, AV), pp. 546–573.
- ICLP-2003-EiterFGL #evaluation #integration #logic programming #query #source code
- Efficient Evaluation of Logic Programs for Querying Data Integration Systems (TE, MF, GG, DL), pp. 163–177.
- ICLP-2003-LangevineDD #implementation #prolog
- A Propagation Tracer for GNU-Prolog: From Formal Definition to Efficient Implementation (LL, MD, PD), pp. 269–283.
- LICS-2003-DanosD #approximate #markov #process
- Labelled Markov Processes: Stronger and Faster Approximations (VD, JD), pp. 341–350.
- SAT-2003-DequenD #named #random #satisfiability
- kcnfs: An Efficient Solver for Random k-SAT Formulae (GD, OD), pp. 486–501.
- SAT-2003-KhurshidMSJ
- A Case for Efficient Solution Enumeration (SK, DM, IS, DJ), pp. 272–286.
- SAT-2003-LiSB #effectiveness #satisfiability #using
- A Local Search SAT Solver Using an Effective Switching Strategy and an Efficient Unit Propagation (XYL, MFMS, FB), pp. 53–68.
- SAT-2003-SabharwalBK #learning #problem #using
- Using Problem Structure for Efficient Clause Learning (AS, PB, HAK), pp. 242–256.
- SAT-2003-ZhangM #algorithm #case study #implementation #satisfiability
- Cache Performance of SAT Solvers: a Case Study for Efficient Implementation of Algorithms (LZ, SM), pp. 287–298.
- TestCom-2003-ArnedoCN #testing
- Fast Testing of Critical Properties through Passive Testing (JAA, ARC, MN), pp. 295–310.
- VMCAI-2003-KroeningS
- Efficient Computation of Recurrence Diameters (DK, OS), pp. 298–309.
- VMCAI-2003-Wang #automaton #verification
- Efficient Verification of Timed Automata with BDD-Like Data-Structures (FW), pp. 189–205.
- CBSE-2002-ChenGLL #component #enterprise #off the shelf #predict
- Performance Prediction of COTS Component-based Enterprise Applications (SC, IG, AL, YL), p. 7.
- CBSE-2003-BertolinoM #component #towards
- Towards Component-Based Software Performance Engineering (AB, RM), p. 1.
- CBSE-2003-WeideOS #composition #reasoning
- Expressiveness Issues in Compositional Performance Reasoning (BWW, WFO, MS), p. 15.
- CBSE-2003-WuMW #component #predict
- Component Based Performance Prediction (XW, DM, MW), p. 3.
- PODS-2002-GuhaKS #algorithm
- Fast Algorithms For Hierarchical Range Histogram Construction (SG, NK, DS), pp. 180–187.
- PODS-2002-ZhangTG
- Efficient Aggregation over Objects with Extent (DZ, VJT, DG), pp. 121–132.
- SIGMOD-2002-ChenGMV #optimisation
- Fractal prefetching B±Trees: optimizing both cache and disk performance (SC, PBG, TCM, GV), pp. 157–168.
- SIGMOD-2002-CranorGJSS #interface #monitoring #named #network #sql
- Gigascope: high performance network monitoring with an SQL interface (CDC, YG, TJ, VS, OS), p. 623.
- SIGMOD-2002-ProcopiucJAM #algorithm #clustering #monte carlo
- A Monte Carlo algorithm for fast projective clustering (CMP, MJ, PKA, TMM), pp. 418–427.
- SIGMOD-2002-Ramanan #algorithm #query
- Efficient algorithms for minimizing tree pattern queries (PR), pp. 299–309.
- SIGMOD-2002-RiedewaldAA #integration
- Efficient integration and aggregation of historical information (MR, DA, AEA), pp. 13–24.
- SIGMOD-2002-VriesMNK
- Efficient k-NN search on vertically decomposed data (APdV, NM, NN, MLK), pp. 322–333.
- SIGMOD-2002-Weininger #execution
- Efficient execution of joins in a star schema (AW), pp. 542–545.
- SIGMOD-2002-ZadorozhnyRVUB #evaluation #query
- Efficient evaluation of queries in a mediator for WebSources (VZ, LR, MEV, TU, LB), pp. 85–96.
- VLDB-2002-ChakrabartiRS #classification #linear #multi
- Fast and Accurate Text Classification via Multiple Linear Discriminant Projections (SC, SR, MVS), pp. 658–669.
- VLDB-2002-ChanGR #named #regular expression
- RE-Tree: An Efficient Index Structure for Regular Expressions (CYC, MNG, RR), pp. 263–274.
- VLDB-2002-ChienVZTZ #documentation #xml
- Efficient Structural Joins on Indexed XML Documents (SYC, ZV, DZ, VJT, CZ), pp. 263–274.
- VLDB-2002-GottlobKP #algorithm #query #xpath
- Efficient Algorithms for Processing XPath Queries (GG, CK, RP), pp. 95–106.
- VLDB-2002-Mohan02a #using
- An Efficient Method for Performing Record Deletions and Updates Using Index Scans (CM), pp. 940–949.
- VLDB-2002-StolteA #database #scalability
- Efficient Exploration of Large Scientific Databases (ES, GA), pp. 622–633.
- VLDB-2002-YuSLJ #data access #xml
- Compressed Accessibility Map: Efficient Access Control for XML (TY, DS, LVSL, HVJ), pp. 478–489.
- CSEET-2002-RatcliffeWT #development #motivation #re-engineering #scalability
- Improving Motivation and Performance through Personal Development in Large Introductory Software Engineering Courses (MR, JW, LT), p. 108–?.
- ITiCSE-2002-Clear
- A diagnostic technique for addressing group performance in capstone projects (TC), p. 196.
- ITiCSE-2002-ParkinsonR #learning #question
- Do cognitive styles affect learning performance in different computer media? (AP, JAR), pp. 39–43.
- PASTE-2002-BrownDEHJVW #encoding #framework #named
- STEP: a framework for the efficient encoding of general trace data (RB, KD, DE, LJH, JJ, CV, QW), pp. 27–34.
- CIAA-J-2000-CampeanuPY02 #algorithm #automaton #finite
- An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages (CC, AP, SY), pp. 83–97.
- CIAA-2002-Okhotin #linear #recognition
- Efficient Automaton-Based Recognition for Linear Conjunctive Languages (AO), pp. 169–181.
- DLT-2002-Archangelsky #algorithm #equivalence #finite #multi
- Efficient Algorithm for Checking Multiplicity Equivalence for the Finite Z-Σ*-Automata (KA), pp. 283–289.
- DLT-2002-Seibert #automaton #finite #regular expression
- Efficient Transformations from Regular Expressions to Finite Automata (SS), pp. 28–42.
- ICALP-2002-AkcogluDK
- Fast Universalization of Investment Strategies with Provably Good Relative Returns (KA, PD, MYK), pp. 888–900.
- ICALP-2002-BenderCR #algorithm #exponential
- Exponential Structures for Efficient Cache-Oblivious Algorithms (MAB, RC, RR), pp. 195–207.
- ICALP-2002-DuchM #data type #multi #on the #orthogonal
- On the Average Performance of Orthogonal Range Search in Multidimensional Data Structures (AD, CM), pp. 514–524.
- ICALP-2002-GuhaIMS #data type
- Histogramming Data Streams with Fast Per-Item Processing (SG, PI, SM, MS), pp. 681–692.
- ICALP-2002-KohayakawaNR #testing
- Efficient Testing of Hypergraphs (YK, BN, VR), pp. 1017–1028.
- ICALP-2002-Pettie #algorithm #graph
- A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs (SP), pp. 85–97.
- FME-2002-GaravelH #evaluation #functional #on the #using #verification
- On Combining Functional Verification and Performance Evaluation Using CADP (HG, HH), pp. 410–429.
- RTA-2002-Voigtlander #composition #transducer
- Conditions for Efficiency Improvement by Tree Transducer Composition (JV), pp. 222–236.
AFP-2002-ChakravartyK02 #approach #array #haskell- An Approach to Fast Arrays in Haskell (MMTC, GK), pp. 27–58.
- FLOPS-2002-PetterssonSJ #compilation #erlang #evaluation
- The HiPE/x86 Erlang Compiler: System Description and Performance Evaluation (MP, KFS, EJ), pp. 228–244.
- ICFP-2002-SerpetteS #bytecode #compilation #virtual machine
- Compiling scheme to JVM bytecode: : a performance study (BPS, MS), pp. 259–270.
- IFL-2002-Bagwell #functional
- Fast Functional Lists (PB), pp. 34–50.
- CHI-2002-JettmarN #adaptation #testing
- Adaptive testing: effects on user performance (EJ, CN), pp. 129–134.
- CHI-2002-MyersBNPKML #distance #pointer
- Interacting at a distance: measuring the performance of laser pointers and other devices (BAM, RB, JN, CHP, DK, RCM, ACL), pp. 33–40.
- CAiSE-2002-CaiY #approach #requirements #using
- Addressing Performance Requirements Using a Goal and Scenario-Oriented Approach (ZC, ESKY), pp. 706–710.
- CAiSE-2002-LeeKL #data-driven #database #distance #similarity
- Efficient Similarity Search for Time Series Data Based on the Minimum Distance (SL, DK, SL), pp. 377–391.
- EDOC-2002-MosM #approach #architecture #component #modelling #using
- Performance Management in Component-Oriented Systems Using a Model Driven ArchitectureTM Approach (AM, JM), pp. 227–237.
- EDOC-2002-WangR #architecture #corba #lightweight
- An Architecture for Web-Enabled Engineering Applications Based on Lightweight High Performance CORBA (GW, RR), pp. 249–257.
- ICEIS-2002-SalimifardW #analysis #modelling #petri net #using #workflow
- Modelling and Performance Analysis of Workflow Management Systems Using Timed Hierarchical Coloured Petri Nets (KS, MW), pp. 843–846.
- ICEIS-2002-TanTS #data mining #mining #parallel #taxonomy
- A Taxonomy for Inter-Model Parallelism in High Performance Data Mining (LT, DT, KAS), pp. 534–539.
- CIKM-2002-ChenCA #biology #database #evaluation #on the #query
- On the efficient evaluation of relaxed queries in biological databases (YC, DC, KA), pp. 227–236.
- CIKM-2002-GrabsBS #documentation #named #transaction #xml
- XMLTM: efficient transaction management for XML documents (TG, KB, HJS), pp. 142–152.
- CIKM-2002-JensenBPGF #algorithm #clustering #documentation
- Parallelizing the buckshot algorithm for efficient document clustering (ECJ, SMB, AJP, NG, OF), pp. 684–686.
- CIKM-2002-LamLW #mobile #xml
- Efficient synchronization for mobile XML data (FL, NL, RKW), pp. 153–160.
- CIKM-2002-LeeCHT #evaluation #multi #query #streaming #xml
- Efficient evaluation of multiple queries on streaming XML data (MLL, BCC, WH, KLT), pp. 118–125.
- CIKM-2002-LouL #predict #web
- Efficient prediction of web accesses on a proxy server (WL, HL), pp. 169–176.
- CIKM-2002-NanopoulosMT #algorithm #effectiveness
- An efficient and effective algorithm for density biased sampling (AN, YM, YT), pp. 398–404.
- CIKM-2002-OrdonezO #clustering #named #robust #scalability #set
- FREM: fast and robust EM clustering for large data sets (CO, EO), pp. 590–599.
- CIKM-2002-StehlingNF #approach #classification #image #retrieval
- A compact and efficient image retrieval approach based on border/interior pixel classification (ROS, MAN, AXF), pp. 102–109.
- CIKM-2002-SungZP #database #scalability
- A fast filtering scheme for large database cleansing (SYS, ZL, SP), pp. 76–83.
- CIKM-2002-WuY #adaptation #monitoring #multi #query #using
- Efficient query monitoring using adaptive multiple key hashing (KLW, PSY), pp. 477–484.
- ECIR-2002-HeeschR #comparative #evaluation #retrieval #sketching
- Combining Features for Content-Based Sketch Retrieval — A Comparative Evaluation of Retrieval Performance (DH, SMR), pp. 41–52.
- ECIR-2002-Sormunen #evaluation #interactive #query
- A Retrospective Evaluation Method for Exact-Match and Best-Match Queries Applying an Interactive Query Performance Analyser (ES), pp. 334–352.
- ICML-2002-DeCoste #classification #distance #geometry #kernel
- Anytime Interval-Valued Outputs for Kernel Machines: Fast Support Vector Machine Classification via Distance Geometry (DD), pp. 99–106.
- ICML-2002-ElomaaR #fault
- Fast Minimum Training Error Discretization (TE, JR), pp. 131–138.
- ICML-2002-GoebelRB #composition #predict
- A Unified Decomposition of Ensemble Loss for Predicting Ensemble Performance (MG, PJR, MB), pp. 211–218.
- ICML-2002-KeerthiDSP #algorithm #kernel
- A Fast Dual Algorithm for Kernel Logistic Regression (SSK, KD, SKS, ANP), pp. 299–306.
- ICML-2002-Seewald #how
- How to Make Stacking Better and Faster While Also Taking Care of an Unknown Weakness (AKS), pp. 554–561.
- ICPR-v1-2002-CamusW #image #reliability
- Reliable and Fast Eye Finding in Close-up Images (TAC, RPW), pp. 389–394.
- ICPR-v1-2002-DeschampsC #3d
- Fast Extraction of Tubular and Tree 3D Surfaces with Front Propagation Methods (TD, LDC), pp. 731–734.
- ICPR-v1-2002-FleuretG #detection #estimation #precise
- Fast Face Detection with Precise Pose Estimation (FF, DG), p. 235–?.
- ICPR-v1-2002-HarnsomburanaS #approach #database #feedback #hybrid #image #retrieval
- A Hybrid Tree Approach for Efficient Image Database Retrieval with Dynamic Feedback (JH, CRS), pp. 263–266.
- ICPR-v1-2002-SongCL #detection #image
- Edge Color Distribution Transform: An Efficient Tool for ObjectDetection in Images (JS, MC, MRL), pp. 608–612.
- ICPR-v1-2002-VelekLJN #approach #generative #image #online #recognition
- An Improved Approach to Generating Realistic Kanji Character Images from On-Line Characters and its Benefit to Off-Line Recognition Performance (OV, CLL, SJ, MN), p. 588–?.
- ICPR-v2-2002-Al-ShaherH #learning #modelling #online
- Fast On-Line learning of Point Distribution Models (AAAS, ERH), pp. 208–211.
- ICPR-v2-2002-BalthasarP #classification
- Fast Projection Plane Classifier (DB, LP), pp. 200–203.
- ICPR-v2-2002-GarciaD #architecture #detection #robust
- A Neural Architecture for Fast and Robust Face Detection (CG, MD), pp. 44–47.
- ICPR-v2-2002-GiugnoS #graph #named #query
- GraphGrep: A Fast and Universal Method for Querying Graphs (RG, DS), pp. 112–115.
- ICPR-v2-2002-Guskov #geometry
- Efficient Tracking of Regular Patterns on Non-Rigid Geometry (IG), pp. 1057–1060.
- ICPR-v2-2002-IqbalA #evaluation #image #retrieval
- Combining Structure, Color and Texture for Image Retrieval: A Performance Evaluation (QI, JKA), pp. 438–443.
- ICPR-v2-2002-MoghaddamZ #analysis #linear #online #pattern matching #pattern recognition #recognition
- Fast Linear Discriminant Analysis for On-Line Pattern Recognition Applications (HAM, KAZ), pp. 64–67.
- ICPR-v2-2002-RendonB #clustering
- Fast Hierarchical Clustering Based on Compressed Data (ER, RB), pp. 216–219.
- ICPR-v2-2002-Robles-KellySH #approximate #segmentation
- A Fast Leading Eigenvector Approximation for Segmentation and Grouping (ARK, SS, ERH), pp. 639–642.
- ICPR-v2-2002-VishwanathanM #algorithm #geometry
- Geometric SVM: A Fast and Intuitive SVM Algorithm (SVNV, MNM), pp. 56–59.
- ICPR-v2-2002-XieJ #detection
- A New Efficient Ellipse Detection Method (YX, QJ), pp. 957–960.
- ICPR-v2-2002-ZengM #multi
- An Efficient Vision System for Multiple Car Tracking (ZZ, SM), pp. 609–612.
- ICPR-v3-2002-AhmadyfardK #recognition
- Colour-Based Model Pruning for Efficient ARG Object Recognition (AA, JK), pp. 20–24.
- ICPR-v3-2002-Al-OhaliCS02a #estimation #word
- Efficient Estimation of Pen Trajectory from Off-Line Handwritten Words (YAO, MC, CYS), pp. 323–326.
- ICPR-v3-2002-ChenHF #database #sequence
- Fast Semi-Local Alignment for DN Sequence Database Search (YSC, YPH, CSF), pp. 1019–1022.
- ICPR-v3-2002-CorreiaCS #on the #recognition
- On the Performance of Wavelets for Handwritten Numerals Recognition (SENC, JMdC, RS), pp. 127–130.
- ICPR-v3-2002-FengH
- Confidence Guided Progressive Search and Fast Match Techniques for High Performance Chinese/English OCR (ZDF, QH), pp. 89–92.
- ICPR-v3-2002-FitchKCK #robust
- Fast Exhaustive Robust Matching (AJF, AK, WJC, JK), pp. 903–906.
- ICPR-v3-2002-GarciaFRF #image #predict
- Performance of the Kullback-Leibler Information Gain for Predicting Image Fidelity (JAG, JFV, RRS, XRFV), pp. 843–848.
- ICPR-v3-2002-HaindlF
- Fast Restoration of Colour Movie Scratches (MH, JF), pp. 269–272.
- ICPR-v3-2002-HoqueFG #classification #learning
- The Effect of the Inhibition-Compensation Learning Scheme on n-tuple Based Classifier Performance (SH, MCF, RMG), pp. 452–455.
- ICPR-v3-2002-KimCS #recognition #string
- Post-Processing Scheme for Improving Recognition Performance of Touching Handwritten Numeral Strings (KKK, YC, CYS), pp. 327–330.
- ICPR-v3-2002-MaragoudakisKF #independence #segmentation
- Incorporating Conditional Independence Assumption with Support Vector Machines to Enhance Handwritten Character Segmentation Performance (MM, EK, NF), pp. 911–914.
- ICPR-v3-2002-MarianoMPKMLDD #algorithm #detection #evaluation
- Performance Evaluation of Object Detection Algorithms (VYM, JM, JHP, RK, DM, HL, DSD, TD), pp. 965–969.
- ICPR-v3-2002-MarugameSYMFYKKTT #metric #precise
- A Fast and Precise System for Taking High-Density Human Head Measurements with Surrounding Range Finders (AM, SS, TY, KM, OF, YY, YK, HK, WT, JT), pp. 978–982.
- ICPR-v3-2002-PekalskaD #difference #prototype
- Prototype Selection for Finding Efficient Representations of Dissimilarity Data (EP, RPWD), pp. 37–40.
- ICPR-v3-2002-RamoserWB #image
- Efficient Alignment of Fingerprint Images (HR, BW, HB), pp. 748–751.
- ICPR-v3-2002-SmolkaSPV #on the
- On the Fast Modification of the Vector Median Filter (BS, MS, KNP, ANV), pp. 931–934.
- ICPR-v3-2002-XueG #classification #predict #word
- Performance Prediction for Handwritten Word Recognizers and Its Application to Classifier Combination (HX, VG), pp. 241–244.
- ICPR-v3-2002-YinBCD #retrieval
- Improving Retrieval Performance by Long-term Relevance Information (PYY, BB, KCC, AD), p. 533–?.
- ICPR-v4-2002-IbrahimovSD #analysis #clustering #similarity #topic
- The Performance Analysis of a Chi-square Similarity Measure for Topic Related Clustering of Noisy Transcripts (OI, IKS, ND), pp. 285–288.
- ICPR-v4-2002-KolesnikovF #algorithm #approximate
- A Fast Near-Optimal Algorithm for Approximation of Polygonal Curves (AK, PF), pp. 335–338.
- ICPR-v4-2002-PerisM #classification #distance #edit distance
- Fast Cyclic Edit Distance Computation with Weighted Edit Costs in Classification (GP, AM), pp. 184–187.
- ICPR-v4-2002-SerranoSL #approach #classification
- A Computationally Efficient Approach to Indoor/Outdoor Scene Classification (NS, AES, JL), p. 146–?.
- ICPR-v4-2002-SocolinskyS #analysis #comparative #recognition
- A Comparative Analysis of Face Recognition Performance with Visible and Thermal Infrared Imagery (DAS, AS), p. 217–?.
- ICPR-v4-2002-YuiHZH #3d #adaptation #modelling
- A Fast Narrow Band Method and Its Application in Topology-Adaptive 3-D Modeling (SY, KH, HZ, TH), pp. 122–125.
- KDD-2002-Frigui #approach #clustering #identification #named #scalability #set
- SyMP: an efficient clustering approach to identify clusters of arbitrary shapes in large data sets (HF), pp. 507–512.
- KDD-2002-KolczSK #classification #random
- Efficient handling of high-dimensional feature spaces by randomized classifier ensembles (AK, XS, JKK), pp. 307–313.
- KDD-2002-LinC #algorithm #clustering #robust #self
- A robust and efficient clustering algorithm based on cohesion self-merging (CRL, MSC), pp. 582–587.
- KDD-2002-Olecka #classification
- Evaluating classifiers’ performance in a constrained environment (AO), pp. 605–612.
- KDD-2002-PalmerGF #data mining #graph #mining #named #scalability
- ANF: a fast and scalable tool for data mining in massive graphs (CRP, PBG, CF), pp. 81–90.
- KDD-2002-WuF #scalability
- Making every bit count: fast nonlinear axis scaling (LW, CF), pp. 664–669.
- KDD-2002-YangGY #algorithm #clustering #effectiveness #named #transaction
- CLOPE: a fast and effective clustering algorithm for transactional data (YY, XG, JY), pp. 682–687.
- SEKE-2002-AbateEGN #evaluation #workflow
- Workflow performance evaluation through WPQL (AFA, AE, NG, GN), pp. 489–495.
- SEKE-2002-BarberHB #architecture #evaluation
- Performance evaluation of domain reference architectures (KSB, JH, GB), pp. 225–232.
- SIGIR-2002-AnhM #effectiveness #retrieval #web
- Impact transformation: effective and efficient web retrieval (VNA, AM), pp. 3–10.
- SIGIR-2002-BahleWZ #query
- Efficient phrase querying with an auxiliary index (DB, HEW, JZ), pp. 215–221.
- SIGIR-2002-ClarkeCLLT #corpus
- The impact of corpus size on question answering performance (CLAC, GVC, ML, TRL, ELT), pp. 369–370.
- SIGIR-2002-ConradYC #effectiveness #locality #retrieval
- Effective collection metasearch in a hierarchical environment: global vs. localized retrieval performance (JGC, CY, JSC), pp. 371–372.
- SIGIR-2002-Cronen-TownsendZC #predict #query
- Predicting query performance (SCT, YZ, WBC), pp. 299–306.
- SIGIR-2002-ScholerWYZ #evaluation #query
- Compression of inverted indexes for fast query evaluation (FS, HEW, JY, JZ), pp. 222–229.
- SIGIR-2002-SormunenHKPS #information retrieval #query #research
- Query performance analyser: a web-based tool for IR research and instruction (ES, SH, PK, PP, BS), p. 450.
- SIGIR-2002-VermaB #named #query
- K-tree/forest: efficient indexes for boolean queries (RMV, SB), pp. 433–434.
- SPLC-2002-Yacoub #analysis #component
- Performance Analysis of Component-Based Applications (SMY), pp. 299–315.
- OOPSLA-2002-CecchetMZ #scalability
- Performance and scalability of EJB applications (EC, JM, WZ), pp. 246–261.
- OOPSLA-2002-PalaczVCD #communication #named
- Incommunicado: efficient communication for isolates (KP, JV, GC, LD), pp. 262–274.
- OOPSLA-2002-ZibinG #algorithm #multi
- Fast algorithm for creating space efficient dispatching tables with application to multi-dispatching (YZ, JYG), pp. 142–160.
- AdaEurope-2002-ChatzigeorgiouS #embedded #object-oriented #power of #programming
- Evaluating Performance and Power of Object-Oriented Vs. Procedural Programming in Embedded Processors (AC, GS), pp. 65–75.
- ASIA-PEPM-2002-FutamuraKG #algorithm #automation #generative #string
- Automatic generation of efficient string matching algorithms by generalized partial computation (YF, ZK, RG), pp. 1–8.
- PADL-2002-YangG #data type #logic programming #source code
- Exploiting Efficient Control and Data Structures in Logic Programs (RY, SG), pp. 318–331.
- PLDI-2002-BudimlicCHKOR #identification
- Fast Copy Coalescing and Live-Range Identification (ZB, KDC, TJH, KK, TSO, SWR), pp. 25–32.
- PLDI-2002-ChoiLLOSS #concurrent #detection #object-oriented #parallel #precise #source code #thread
- Efficient and Precise Datarace Detection for Multithreaded Object-Oriented Programs (JDC, KL, AL, RO, VS, MS), pp. 258–269.
- PLDI-2002-SoHD #approach #compilation #design #hardware
- A Compiler Approach to Fast Hardware Design Space Exploration in FPGA-based Systems (BS, MWH, PCD), pp. 165–176.
- PLDI-2002-Wu #source code
- Efficient Discovery of Regular Stride Patterns in Irregular Programs (YW), pp. 210–221.
- POPL-2002-RubinBC #framework #optimisation
- An efficient profile-analysis framework for data-layout optimizations (SR, RB, TMC), pp. 140–153.
- SAS-2002-VaucheretB #logic programming #precise #source code #type inference
- More Precise Yet Efficient Type Inference for Logic Programs (CV, FB), pp. 102–116.
- SAS-2002-WhaleyL #analysis #points-to #strict
- An Efficient Inclusion-Based Points-To Analysis for Strictly-Typed Languages (JW, MSL), pp. 180–195.
- SIGAda-2002-KorochkinK #ada #analysis #java #parallel
- Experimental performance analysis of the Ada95 and Java parallel program on SMP systems (DK, SK), pp. 53–56.
- RE-2002-JohnMST #analysis #evolution
- Efficient and Systematic Software Evolution through Domain Analysis (IJ, DM, PS, ET), pp. 237–246.
- ICSE-2002-RobschinkS #dependence #graph
- Efficient path conditions in dependence graphs (TR, GS), pp. 478–488.
- SAC-2002-Abu-GhazalehP #execution #mobile #towards #verification
- Verification caching: towards efficient and secure mobile code execution environments (NBAG, DSP), pp. 964–968.
- SAC-2002-AghbariKM #reduction #video
- Topological mapping: a dimensionality reduction method for efficient video search (ZA, KK, AM), pp. 470–475.
- SAC-2002-BuckerR #interface
- Efficient derivative computations in neutron scattering via interface contraction (HMB, AR), pp. 184–188.
- SAC-2002-Eubank #scalability #simulation
- Scalable, efficient epidemiological simulation (SE), pp. 139–145.
- SAC-2002-JeeP #evaluation
- Performance evaluation for a compressed-VLIW processor (SJ, KP), pp. 913–917.
- SAC-2002-LuSP #generative #implementation #smarttech
- Implementation of fast RSA key generation on smart cards (CL, ALMdS, FRP), pp. 214–220.
- SAC-2002-Thissen #approach
- Load balancing for the management of service performance in open service markets: a customer-oriented approach (DT), pp. 902–906.
- SAC-2002-TourinoBDG #analysis #clustering
- Performance analysis of MPI-I/O primitives on a PC cluster (JT, JB, RD, VMG), pp. 907–912.
- SAC-2002-ZhangS #algorithm #implementation #parametricity
- An efficient implementation of parametric line and polygon clipping algorithm (MZ, CLS), pp. 796–800.
- ASPLOS-2002-AshokCM #energy #memory management #named
- Cool-Mem: combining statically speculative memory accessing with selective address translation for energy efficiency (RA, SC, CAM), pp. 133–143.
- DAC-2002-AnastasakisDMS
- A practical and efficient method for compare-point matching (DA, RFD, HKTM, TS), pp. 305–310.
- DAC-2002-AnisMEA #automation #clustering #power management #reduction #using
- Dynamic and leakage power reduction in MTCMOS circuits using an automated efficient gate clustering technique (MA, MM, MIE, SA), pp. 480–485.
- DAC-2002-BernasconiCLP #logic #symmetry
- Fast three-level logic minimization based on autosymmetry (AB, VC, FL, LP), pp. 425–430.
- DAC-2002-BertaccoO #representation #simulation
- Efficient state representation for symbolic simulation (VB, KO), pp. 99–104.
- DAC-2002-CadambiMA #functional #hardware #scalability #simulation
- A fast, inexpensive and scalable hardware acceleration technique for functional simulation (SC, CM, PA), pp. 570–575.
- DAC-2002-DaemsGS #modelling
- An efficient optimization--based technique to generate posynomial performance models for analog integrated circuits (WD, GGEG, WMCS), pp. 431–436.
- DAC-2002-EderB #logic #pipes and filters #verification
- Achieving maximum performance: a method for the verification of interlocked pipeline control logic (KE, GB), pp. 135–140.
- DAC-2002-FoltinFT #abstraction #concept #independence #modelling
- Efficient stimulus independent timing abstraction model based on a new concept of circuit block transparency (MF, BF, ST), pp. 158–163.
- DAC-2002-GuptaSDGNKKR #coordination #synthesis
- Coordinated transformations for high-level synthesis of high performance microprocessor blocks (SG, NS, NDD, RKG, AN, TK, MK, SR), pp. 898–903.
- DAC-2002-KarnikYTWBGDB #optimisation
- Total power optimization by simultaneous dual-Vt allocation and device sizing in high performance microprocessors (TK, YY, JT, LW, SMB, VG, VD, SB), pp. 486–491.
- DAC-2002-KoukabDD #analysis #named
- HSpeedEx: a high-speed extractor for substrate noise analysis in complex mixed signal SOC (AK, CD, MJD), pp. 767–770.
- DAC-2002-KurzwegLMKC #modelling
- A fast optical propagation technique for modeling micro-optical systems (TPK, SPL, JAM, MK, DMC), pp. 236–241.
- DAC-2002-LahiriDR #architecture #communication #design #power management
- Communication architecture based power management for battery efficient system design (KL, SD, AR), pp. 691–696.
- DAC-2002-LeeP #analysis #design #embedded #simulation
- Timed compiled-code simulation of embedded software for performance analysis of SOC design (JYL, ICP), pp. 293–298.
- DAC-2002-LekatsasHJ #design #embedded #hardware
- Design of an one-cycle decompression hardware for performance increase in embedded systems (HL, JH, VJ), pp. 34–39.
- DAC-2002-LiouKWC #analysis #statistics #testing #validation
- False-path-aware statistical timing analysis and efficient path selection for delay testing and timing validation (JJL, AK, LCW, KTC), pp. 566–569.
- DAC-2002-LiouWCDMKW #fault #multi #testing #using
- Enhancing test efficiency for delay fault testing using multiple-clocked schemes (JJL, LCW, KTC, JD, MRM, RK, TWW), pp. 371–374.
- DAC-2002-LyseckyCV #memory management #profiling
- A fast on-chip profiler memory (RLL, SC, FV), pp. 28–33.
- DAC-2002-MahawarSS
- A solenoidal basis method for efficient inductance extraction (HM, VS, WS), pp. 751–756.
- DAC-2002-NohlBSLMH #architecture #flexibility #simulation
- A universal technique for fast and flexible instruction-set architecture simulation (AN, GB, OS, RL, HM, AH), pp. 22–27.
- DAC-2002-OhH #data flow #graph #multi #synthesis
- Efficient code synthesis from extended dataflow graphs for multimedia applications (HO, SH), pp. 275–280.
- DAC-2002-Perrott #behaviour #simulation
- Fast and accurate behavioral simulation of fractional-N frequency synthesizers and other PLL/DLL circuits (MHP), pp. 498–503.
- DAC-2002-ShenoyN #database
- An efficient routing database (NVS, WN), pp. 590–595.
- DAC-2002-TangW #constraints
- Floorplanning with alignment and performance constraints (XT, DFW), pp. 848–853.
- DAC-2002-Ykman-CouvreurLVCNK #memory management #network #optimisation
- System-level performance optimization of the data queueing memory management in high-speed network processors (CYC, JL, DV, FC, AN, GEK), pp. 518–523.
- DATE-2002-BerkelaarE #effectiveness
- Efficient and Effective Redundancy Removal for Million-Gate Circuits (MRCMB, KvE), p. 1088.
- DATE-2002-BontempiK #data analysis #predict
- A Data Analysis Method for Software Performance Prediction (GB, WK), pp. 971–976.
- DATE-2002-DaemsGS #approach #linear
- A Fitting Approach to Generate Symbolic Expressions for Linear and Nonlinear Analog Circuit Performance Characteristics (WD, GGEG, WMCS), pp. 268–273.
- DATE-2002-DingM
- Optimal Transistor Tapering for High-Speed CMOS Circuits (LD, PM), pp. 708–713.
- DATE-2002-DoucetSGO #co-evolution #component #composition #design
- An Environment for Dynamic Component Composition for Efficient Co-Design (FD, SKS, RKG, MO), pp. 736–743.
- DATE-2002-DrozdLD #array #float #online #testing
- Efficient On-Line Testing Method for a Floating-Point Iterative Array Divider (AVD, MVL, JVD), p. 1127.
- DATE-2002-GadN #linear #reduction
- Efficient Model Reduction of Linear Time-Varying Systems via Compressed Transient System Function (EG, MSN), pp. 916–922.
- DATE-2002-GoldbergN #named #robust
- BerkMin: A Fast and Robust Sat-Solver (EIG, YN), pp. 142–149.
- DATE-2002-HalambiSBDN #compilation #reduction #using
- An Efficient Compiler Technique for Code Size Reduction Using Reduced Bit-Width ISAs (AH, AS, PB, NDD, AN), pp. 402–408.
- DATE-2002-IyengarCM #scalability
- Efficient Wrapper/TAM Co-Optimization for Large SOCs (VI, KC, EJM), pp. 491–498.
- DATE-2002-JungKK #logic #synthesis
- Dual Threshold Voltage Domino Logic Synthesis for High Performance with Noise and Power Constrain (SOJ, KWK, SMK), pp. 260–265.
- DATE-2002-LinLC #feedback
- An Efficient Test and Diagnosis Scheme for the Feedback Type of Analog Circuits with Minimal Added Circuits (JWL, CLL, JEC), p. 1119.
- DATE-2002-LiverisZSG #program transformation
- A Code Transformation-Based Methodology for Improving I-Cache Performance of DSP Applications (NDL, NDZ, DS, CEG), pp. 977–983.
- DATE-2002-OzdagBSN #pipes and filters
- High-Speed Non-Linear Asynchronous Pipelines (ROO, PAB, MS, SMN), pp. 1000–1007.
- DATE-2002-PetrovO #embedded
- Power Efficient Embedded Processor Ip’s through Application-Specific Tag Compression in Data Caches (PP, AO), pp. 1065–1071.
- DATE-2002-SavoiuSG #automation #concurrent #modelling #simulation
- Automated Concurrency Re-Assignment in High Level System Models for Efficient System-Level Simulation (NS, SKS, RKG), pp. 875–881.
- DATE-2002-ThielenV #simulation
- Fast Method to Include Parasitic Coupling in Circuit Simulations (BLAVT, GAEV), pp. 1033–1037.
- DATE-2002-VandersteenWDV #evaluation
- High-Frequency Nonlinear Amplifier Model for the Efficient Evaluation of Inband Distortion Under Nonlinear Load-Pull Conditions (GV, PW, SD, FV), pp. 586–590.
- DATE-2002-YmeriNMRSV #approach #parametricity
- Simple and Efficient Approach for Shunt Admittance Parameters Calculations of VLSI On-Chip Interconnects on Semiconducting Substrate (HY, BN, KM, DDR, MS, SV), p. 1113.
- DATE-2002-YooNGJ #automation #design #generative #modelling #operating system #simulation
- Automatic Generation of Fast Timed Simulation Models for Operating Systems in SoC Design (SY, GN, LG, AAJ), pp. 620–627.
- HPCA-2002-SakamotoBKIK #generative #source code
- Reverse Tracer: A Software Tool for Generating Realistic Performance Test Programs (MS, LB, AK, AI, YK), pp. 81–91.
- HPDC-2002-BentVLRSAAL #flexibility #grid
- Flexibility, Manageability, and Performance in a Grid Storage Appliance (JB, VV, NL, AR, JS, ACAD, RHAD, ML), pp. 3–12.
- HPDC-2002-BucurE #clustering #multi
- The Performance of Processor Co-Allocation in Multicluster Systems (AIDB, DHJE), p. 414.
- HPDC-2002-ChiuGB
- Investigating the Limits of SOAP Performance for Scientific Computing (KC, MG, RB), pp. 246–254.
- HPDC-2002-DeBardelebenLPS #framework #named #problem
- Coven — A Framework for High Performance Problem Solving Environments (ND, WBLI, SP, DCSJ), p. 291–?.
- HPDC-2002-DickensG #data transfer #evaluation #network
- An Evaluation of Object-Based Data Transfers on High Performance Networks (PMD, WG), pp. 255–264.
- HPDC-2002-GardnerFF #grid
- Dynamic Right-Sizing in FTP (drsFTP): Enhancing Grid Performance in User-Space (MKG, WcF, MF), pp. 42–49.
- HPDC-2002-KurzyniecSM #case study #component #distributed #framework #on the
- On the Viability of Component Frameworks for High Performance Distributed Computing: A Case Study (DK, VSS, MM), pp. 275–283.
- HPDC-2002-Schulz #clustering #parallel #semantics #using
- Using Semantic Information to Guide Efficient Parallel I/O on Clusters (MS), pp. 135–142.
- HPDC-2002-TaylorWGS #kernel #parallel #predict #using
- Using Kernel Couplings to Predict Parallel Application Performance (VET, XW, JG, RLS), pp. 125–134.
- LCTES-SCOPES-2002-ChoPW #algorithm #architecture #graph #memory management
- Efficient register and memory assignment for non-orthogonal architectures via graph coloring and MST algorithms (JC, YP, DBW), pp. 130–138.
- LCTES-SCOPES-2002-MilnerD #pipes and filters
- Quick piping: a fast, high-level model for describing processor pipelines (CWM, JWD), pp. 175–184.
- LCTES-SCOPES-2002-OhH #data flow #multi #synthesis
- Fractional rate dataflow model and efficient code synthesis for multimedia applications (HO, SH), pp. 12–17.
- OSDI-2002-WhitakerSG #kernel
- Scale and Performance in the Denali Isolation Kernel (AW, MS, SDG), pp. 195–209.
- PDP-2002-BernaschiIL #implementation
- Efficient Implementation of Reduce-Scatter in MPI (MB, GI, ML), pp. 301–308.
- PDP-2002-CorsonelloSST #algorithm #configuration management #hardware #implementation
- Efficient Implementation of Cellular Algorithms on Reconfigurable Hardware (PC, GS, GS, DT), pp. 211–218.
- PDP-2002-GarciaMPLT #multi
- Beowulf Performance in CFD Multigrid Applications (CG, RSM, MP, IML, FT), pp. 7–14.
- PDP-2002-GerndtSSW #analysis #approach #automation #distributed
- Performance Analysis for Teraflop Computers: A Distributed Automatic Approach (MG, AS, MS, RW), pp. 23–30.
- PDP-2002-GoncalvesN #process #scheduling #smt
- Improving SMT Performance Scheduling Processes (RG, POAN), pp. 327–334.
- PDP-2002-GutierrezPZ #clustering #on the #parallel #reduction
- On Improving the Performance of Data Partitioning Oriented Parallel Irregular Reductions (EG, OGP, ELZ), p. 445–?.
- PDP-2002-Le #concurrent #detection #distributed
- Fast Detection and Resolution of Generalized Distributed Deadlock (SL), pp. 429–436.
- PDP-2002-PuenteGB #framework #multi #named #network
- SICOSYS: An Integrated Framework for studying Interconnection Network Performance in Multiprocessor Systems (VP, JAG, RB), pp. 15–22.
- PDP-2002-SanchoRD #algorithm #network
- Performance Sensitivity of Routing Algorithms to Failures in Networks of Workstations with Regular and Irregular Topologies (JCS, AR, JD), pp. 81–90.
- PDP-2002-TripathiG #heuristic
- An Implementational Study of Certain Heuristics for the Performance Enhancements of AODV (SMT, RKG), pp. 395–402.
FoSSaCS-2002-JhaPZ - Efficient Type Matching (SJ, JP, TZ), pp. 187–204.
- STOC-2002-GilbertGIKMS #algorithm #approximate #maintenance
- Fast, small-space algorithms for approximate histogram maintenance (ACG, SG, PI, YK, SM, MS), pp. 389–398.
- CADE-2002-StumpD #framework #logic #proving
- Faster Proof Checking in the Edinburgh Logical Framework (AS, DLD), pp. 392–407.
- CADE-2002-ZhangM #satisfiability
- The Quest for Efficient Boolean Satisfiability Solvers (LZ, SM), pp. 295–313.
- CAV-2002-AlurMY #behaviour #model checking
- Exploiting Behavioral Hierarchy for Efficient Model Checking (RA, MM, ZY), pp. 338–342.
- CAV-2002-ZhangM #satisfiability
- The Quest for Efficient Boolean Satisfiability Solvers (LZ, SM), pp. 17–36.
- ICLP-2002-LoncT #modelling #worst-case
- Computing Stable Models: Worst-Case Performance Estimates (ZL, MT), pp. 347–362.
- ICLP-2002-PemmasaniRR #constraints #logic programming #model checking #realtime #using
- Efficient Real-Time Model Checking Using Tabled Logic Programming and Constraints (GP, CRR, IVR), pp. 100–114.
- ISSTA-2002-TikirH #test coverage #testing
- Efficient instrumentation for code coverage testing (MMT, JKH), pp. 86–96.
- LICS-2002-PalsbergZ #type inference #type system
- Efficient Type Inference for Record Concatenation and Subtyping (JP, TZ), pp. 125–136.
- SAT-2002-LynceM #backtracking #data type #satisfiability
- Efficient data structures for backtrack search SAT solvers (IL, JMS), p. 20.
- SAT-2002-MotterM #on the #proving #satisfiability
- On proof systems behind efficient SAT solvers (DM, IM), p. 31.
- TestCom-2002-RosslerS #flexibility #generative #testing
- A Flexible Traffic Generator for Testing PABX and Call Center Performance (GR, TS), p. 139–?.
- CBSE-2001-Sitaraman #composition #reasoning
- Compositional Performance Reasoning (MS), p. 19.
- ICDAR-2001-BlumensteinV #analysis #benchmark #database #metric #segmentation
- Analysis of Segmentation Performance on the CEDAR Benchmark Database (MB, BV), pp. 1142–1146.
- ICDAR-2001-BogushMAUK #correlation #image #matrix
- An Efficient Correlation Computation Method for Binary Images Based on Matrix Factorisation (RB, SM, SA, SU, SiK), pp. 312–316.
- ICDAR-2001-BottouHL #documentation #multi
- Efficient Conversion of Digital Documents to Multilayer Raster Formats (LB, PH, YL), pp. 444–449.
- ICDAR-2001-GatosP #image #segmentation #set
- Applying Fast Segmentation Techniques at a Binary Image Represented by a Set of Non-Overlapping Blocks (BG, NP), pp. 1147–1153.
- ICDAR-2001-HuaWZ #automation #detection #evaluation #video
- Automatic Performance Evaluation for Video Text Detection (XSH, LW, HZ), pp. 545–550.
- ICDAR-2001-Hullender #parametricity
- An Efficient Method for Tuning Handwriting Parameters (GNH), pp. 251–254.
- ICDAR-2001-KimLSN #analysis #encoding
- Analysis of Postal Address Fields for Efficient Encoding of Korean Mail Pieces (GK, SL, MS, YSN), pp. 675–679.
- ICDAR-2001-OkamotoIT #evaluation #recognition #robust
- Performance Evaluation of a Robust Method for Mathematical Expression Recognition (MO, HI, KT), pp. 121–128.
- ICDAR-2001-PengCLDZ #automation #documentation #evaluation #segmentation
- An Automatic Performance Evaluation Method for Document Page Segmentation (LP, MC, CL, XD, JZ), pp. 134–137.
- ICDAR-2001-Takasu #approximate #documentation #string
- Document Filtering for Fast Approximate String Matching of Errorneous Text (AT), pp. 916–920.
- ICDAR-2001-WangHP01a #classification #evaluation
- Zone Content Classification and its Performance Evaluation (YW, RMH, ITP), pp. 540–544.
- PODS-2001-ZhangMTGS
- Efficient Computation of Temporal Aggregates with Range Predicates (DZ, AM, VJT, DG, BS).
- VLDB-2001-AilamakiDHS #weaving
- Weaving Relations for Cache Performance (AA, DJD, MDH, MS), pp. 169–180.
- VLDB-2001-BohmMSW #evaluation #query #similarity
- Fast Evaluation Techniques for Complex Similarity Queries (KB, MM, HJS, RW), pp. 211–220.
- VLDB-2001-ChienTZ #documentation #multi
- Efficient Management of Multiversion Documents by Object Referencing (SYC, VJT, CZ), pp. 291–300.
- VLDB-2001-CooperSFHS #semistructured data
- A Fast Index for Semistructured Data (BFC, NS, MJF, GRH, MS), pp. 341–350.
- VLDB-2001-KahveciS #database #string
- Efficient Index Structures for String Databases (TK, AKS), pp. 351–360.
- VLDB-2001-MargaritisFT #data mining #mining #named #scalability
- NetCube: A Scalable Tool for Fast Data Mining and Compression (DM, CF, ST), pp. 311–320.
- VLDB-2001-OoiYTJ #distance
- Indexing the Distance: An Efficient Method to KNN Processing (CY, BCO, KLT, HVJ), pp. 421–430.
- VLDB-2001-SeegerBBKSDS #approach #database #implementation #library #named #query
- XXL — A Library Approach to Supporting Efficient Implementations of Advanced Database Queries (JVdB, BB, JPD, JK, TS, MS, BS), pp. 39–48.
- VLDB-2001-TanEO
- Efficient Progressive Skyline Computation (KLT, PKE, BCO), pp. 301–310.
- VLDB-2001-UrhanF #interactive #pipes and filters #query #scheduling
- Dynamic Pipeline Scheduling for Improving Interactive Query Performance (TU, MJF), pp. 501–510.
- CSEET-2001-DickPM #re-engineering #student
- Improving Student Performance in Software Engineering Practice (MD, MP, JM), pp. 143–152.
- ITiCSE-2001-HauseALW #development #distributed #interactive #student
- Interaction factors in software development performance in distributed student teams in computer science (MLH, VLA, MZL, MW), pp. 69–72.
- CSMR-2001-SilvaLG #evaluation #legacy #migration #simulation
- A Simulation Model for the Performance Evaluation When Migrating Legacy Systems (PPdS, AHFL, PBG), pp. 210–215.
- ICSM-2001-AtkinsonG #analysis #data flow #implementation #scalability #source code
- Implementation Techniques for Efficient Data-Flow Analysis of Large Programs (DCA, WGG), pp. 52–61.
- SCAM-2001-BartoliniP #embedded
- An Object Level Transformation Technique to Improve the Performance of Embedded Applications (SB, CAP), pp. 26–34.
- CIAA-2001-NedjahM #adaptation #automaton #pattern matching #term rewriting
- Minimal Adaptive Pattern-Matching Automata for Efficient Term Rewriting (NN, LdMM), pp. 221–233.
- ICALP-2001-CohenHK #aspect-oriented #consistency #distributed #using
- Performance Aspects of Distributed Caches Using TTL-Based Consistency (EC, EH, HK), pp. 744–756.
- ICALP-2001-LiN #generative
- Efficient Generation of Plane Triangulations without Repetitions (ZL, SIN), pp. 433–443.
- ICALP-2001-Sibeyn
- Faster Gossiping on Butterflies (JFS), pp. 785–796.
- IFL-2001-ScaifeMH #comparative #compilation #platform
- Comparative Cross-Platform Performance Results from a Parallelizing SML Compiler (NS, GM, SH), pp. 138–154.
- CHI-2001-DohertyCBB #interface
- Improving the performance of the cyberlink mental interface with “yes / no program” (EPD, GC, CB, DB), pp. 69–76.
- CHI-2001-GongL #speech
- Shall we mix synthetic speech and human speech?: impact on users’ performance, perception, and attitude (LG, JL), pp. 158–165.
- CHI-2001-JamesR #mobile #predict
- Text input for mobile devices: comparing model prediction to actual performance (CLJ, KMR), pp. 365–371.
- CHI-2001-KolevaTBFGSLHRA #artificial reality
- Orchestrating a mixed reality performance (BK, IT, SB, MF, CG, HS, DvL, CH, JRF, MA), pp. 38–45.
- ICEIS-v2-2001-Ash
- E-Business Change and Organisational Performance (CGA), pp. 1026–1033.
- CIKM-2001-FerhatosmanogluAA #query
- Efficient Processing of Conical Queries (HF, DA, AEA), pp. 1–8.
- CIKM-2001-LeeLC #algorithm #incremental #mining
- Sliding-Window Filtering: An Efficient Algorithm for Incremental Mining (CHL, CRL, MSC), pp. 263–270.
- CIKM-2001-LeeSK #incremental #maintenance
- Efficient Incremental View Maintenance in Data Warehouses (KYL, JHS, MHK), pp. 349–357.
- CIKM-2001-PollyW #feature model #pattern matching #robust
- Efficient and Robust Feature Extraction and Pattern Matching of Time Series by a Lattice Structure (WPMP, MHW), pp. 271–278.
- CIKM-2001-RelueWH #generative #runtime
- Efficient Runtime Generation of Association Rules (RR, XW, HH), pp. 466–473.
- CIKM-2001-WuOS #comparison
- A Performance Comparison of bitmap indexes (KW, EJO, AS), pp. 559–561.
- CIKM-2001-YuXEK #collaboration
- Selecting Relevant Instances for Efficient and Accurate Collaborative Filtering (KY, XX, ME, HPK), pp. 239–246.
- ICML-2001-BlockeelS #algorithm
- Efficient algorithms for decision tree cross-validation (HB, JS), pp. 11–18.
- ICML-2001-ChoiR #approximate #difference #fixpoint #learning
- A Generalized Kalman Filter for Fixed Point Approximation and Efficient Temporal Difference Learning (DC, BVR), pp. 43–50.
- ICML-2001-DomeniconiG #approach #approximate #classification #dataset #multi #nearest neighbour #query #scalability
- An Efficient Approach for Approximating Multi-dimensional Range Queries and Nearest Neighbor Classification in Large Datasets (CD, DG), pp. 98–105.
- ICML-2001-SingerV #implementation #learning
- Learning to Generate Fast Signal Processing Implementations (BS, MMV), pp. 529–536.
- KDD-2001-BeygelzimerPM #category theory #dataset #scalability #visualisation
- Fast ordering of large categorical datasets for better visualization (AB, CSP, SM), pp. 239–244.
- KDD-2001-YangFB
- Efficient discovery of error-tolerant frequent itemsets in high dimensions (CY, UMF, PSB), pp. 194–203.
- KDD-2001-ZhengKM #algorithm
- Real world performance of association rule algorithms (ZZ, RK, LM), pp. 401–406.
- SIGIR-2001-Hoenkamp #semantics
- Unitary Operators for Fast Latent Semantic Indexing (FLSI) (EH), pp. 400–401.
- SIGIR-2001-LongL #consistency #image #retrieval
- Perceptual Consistency Improves Image Retrieval Performance (HL, WKL), pp. 434–435.
- SIGIR-2001-PascaH
- High Performance Question/Answering (MP, SMH), pp. 366–374.
- SIGIR-2001-WilkinsonWF
- Searcher Performance in Question Answering (RW, MW, MF), pp. 375–383.
- UML-2001-GrassiM #analysis #architecture #mobile #modelling #uml
- UML Modelling and Performance Analysis of Mobile Software Architectures (VG, RM), pp. 209–224.
- ECOOP-2001-HanhATJ #comparison #integration #object-oriented #testing
- Selecting an Efficient OO Integration Testing Strategy: An Experimental Comparison of Actual Strategies (VLH, KA, YLT, JMJ), pp. 381–401.
- ECOOP-2001-RaynaudT #encoding #testing
- A Quasi Optimal Bit-Vector Encoding of Tree Hierarchies. Application to Efficient Type Inclusion Tests (OR, ET), pp. 165–180.
- OOPSLA-2001-AlpernCFGL #harmful #implementation #interface #java
- Efficient Implementation of Java Interfaces: Invokeinterface Considered Harmless (BA, AC, SJF, DG, DL), pp. 108–124.
- OOPSLA-2001-ZibinG #encoding #testing #type system
- Efficient Subtyping Tests with PQ-Encoding (YZ, JYG), pp. 96–107.
- TOOLS-EUROPE-2001-SevitskyPK #analysis #java #source code
- An Information Exploration Tool for Performance Analysis of Java Programs (GS, WDP, RK), pp. 85–101.
- PLDI-2001-Chilimbi #abstraction #locality
- Efficient Representations and Abstractions for Quantifying and Exploiting Data Reference Locality (TMC), pp. 191–202.
- POPL-2001-Ganzinger #deduction #program analysis
- Efficient deductive methods for program analysis (HG), pp. 102–103.
- SAIG-2001-SasanoHT #generative #multi #problem #source code
- Generation of Efficient Programs for Solving Maximum Multi-marking Problems (IS, ZH, MT), pp. 72–91.
- SAS-2001-LiangH #analysis #interprocedural #pointer
- Efficient Computation of Parameterized Pointer Information for Interprocedural Analyses (DL, MJH), pp. 279–298.
- ASE-2001-ZarrasI #analysis #automation #enterprise #information management #reliability
- Automating the Performance and Reliability Analysis of Enterprise Information Systems (AZ, VI), pp. 350–353.
- ICSE-2001-CampaillaCCJV #using
- Efficient Filtering in Publish-Subscribe Systems Using Binary Decision (AC, SC, EMC, SJ, HV), pp. 443–452.
- ICSE-2001-MenziesPH #analysis #diagrams #formal method #requirements
- Fast Formal Analysis of Requirements via “Topoi Diagrams” (TM, JDP, MEH), pp. 391–400.
- ICSE-2001-Shepard #set #source code
- An Efficient Set of Software Degree Programs for One Domain (TS), pp. 623–632.
- SAC-2001-AsciaCP #adaptation #fuzzy
- An adaptive fuzzy threshold scheme for high performance shared-memory switches (GA, VC, DP), pp. 456–461.
- SAC-2001-ChenLCC #multi #parametricity
- The sustainable-cell-rate usage parameter control with adjustable window for high-speed multimedia communications (SyC, LFL, CSC, CJC), pp. 467–471.
- SAC-2001-CiSN #network #using
- Improving performance of MAC layer by using congestion control/avoidance methods in wireless network (SC, HS, GN), pp. 420–424.
- SAC-2001-GuptaMP #clustering #data type #distributed #evaluation #scalability
- Performance evaluation of the LH*lh scalable, distributed data structure for a cluster of workstations (VG, MM, ADP), pp. 544–548.
- SAC-2001-JangCJJ #multi #network
- Efficient schemes to scale the interconnection network bandwidth in a ring-based multiprocessor system (BSJ, SWC, STJ, CSJ), pp. 510–516.
- SAC-2001-LeeYKP #algorithm #order #towards
- Processor reordering algorithms toward efficient GEN_BLOCK redistribution (SL, HGY, MSK, MSP), pp. 539–543.
- SAC-2001-MaddiD #algorithm
- An efficient algorithm for causal messages ordering (AM, FD), pp. 499–503.
- SAC-2001-Shimoura #communication #design #self #simulation
- Self-consistent simulation studying environment for the design of high-speed optical communication lines (KS), pp. 73–76.
- SAC-2001-SonahI #video
- Considering video characteristics for improved cache performance in VOD systems (BS, MRI), pp. 429–433.
- SAC-2001-Viroli #implementation #java #morphism #parametricity #polymorphism
- Parametric polymorphism in Java: an efficient implementation for parametric methods (MV), pp. 610–619.
- SAC-2001-VuHT #algorithm #detection #image #query
- An efficient core-area detection algorithm for fast noise-free image query processing (KV, KAH, DAT), pp. 258–263.
- CC-2001-Engelen #analysis #compilation #optimisation
- Efficient Symbolic Analysis for Optimizing Compilers (RvE), pp. 118–132.
- DAC-2001-AjamiBPG #analysis
- Analysis of Non-Uniform Temperature-Dependent Interconnect Performance in High Performance ICs (AHA, KB, MP, LPPPvG), pp. 567–572.
- DAC-2001-BanerjeeM #analysis #distributed #novel #optimisation #using
- Analysis of On-Chip Inductance Effects using a Novel Performance Optimization Methodology for Distributed RLC Interconnects (KB, AM), pp. 798–803.
- DAC-2001-ChenC #analysis #grid #power management #scalability
- Efficient Large-Scale Power Grid Analysis Based on Preconditioned Krylov-Subspace Iterative Methods (THC, CCPC), pp. 559–562.
- DAC-2001-DanielSW #analysis #using
- Using Conduction Modes Basis Functions for Efficient Electromagnetic Analysis of On-Chip and Off-Chip Interconnect (LD, ALSV, JW), pp. 563–566.
- DAC-2001-JaniszewskiHM #design #reuse
- VHDL-Based Design and Design Methodology for Reusable High Performance Direct Digital Frequency Synthesizers (IJ, BH, HM), pp. 573–578.
- DAC-2001-KedingCLM #simulation
- Fast Bit-True Simulation (HK, MC, OL, HM), pp. 708–713.
- DAC-2001-LiouCKK #analysis #probability #statistics
- Fast Statistical Timing Analysis By Probabilistic Event Propagation (JJL, KTC, SK, AK), pp. 661–666.
- DAC-2001-MoskewiczMZZM #named #satisfiability
- Chaff: Engineering an Efficient SAT Solver (MWM, CFM, YZ, LZ, SM), pp. 530–535.
- DAC-2001-NandiM #analysis #design #embedded
- System-Level Power/Performance Analysis for Embedded Systems Design (AN, RM), pp. 599–604.
- DAC-2001-QuanH #energy #realtime #scheduling
- Energy Efficient Fixed-Priority Scheduling for Real-Time Systems on Variable Voltage Processors (GQ, XH), pp. 828–833.
- DAC-2001-SylvesterK #challenge #design
- Future Performance Challenges in Nanometer Design (DS, HK), pp. 3–8.
- DAC-2001-TanS #modelling #network #optimisation
- Fast Power/Ground Network Optimization Based on Equivalent Circuit Modeling (SXDT, CJRS), pp. 550–554.
- DAC-2001-VerhaegenG #analysis #linear #scalability
- Efficient DDD-based Symbolic Analysis of Large Linear Analog Circuits (WV, GGEG), pp. 139–144.
- DAC-2001-WangC #generative #testing
- Generating Efficient Tests for Continuous Scan (SJW, SNC), pp. 162–165.
- DAC-2001-WangRLJ #adaptation #design #energy #optimisation
- Input Space Adaptive Design: A High-level Methodology for Energy and Performance Optimization (WW, AR, GL, NKJ), pp. 738–743.
- DATE-2001-BaghdadiLZJ #architecture #design #multi
- An efficient architecture model for systematic design of application-specific multiprocessor SoC (AB, DL, NEZ, AAJ), pp. 55–63.
- DATE-2001-BeattieP
- Efficient inductance extraction via windowing (MWB, LTP), pp. 430–436.
- DATE-2001-BertoniBF #architecture #encryption #finite #multi
- Efficient finite field digital-serial multiplier architecture for cryptography applications (GB, LB, PF), p. 812.
- DATE-2001-CappuccinoC
- CMOS sizing rule for high performance long interconnects (GC, GC), p. 817.
- DATE-2001-ChandraC #testing #using
- Efficient test data compression and decompression for system-on-a-chip using internal scan chains and Golomb coding (AC, KC), pp. 145–149.
- DATE-2001-DrozdL #float #online #testing
- Efficient on-line testing method for a floating-point adder (AVD, MVL), pp. 307–313.
- DATE-2001-GianiSHA
- Efficient spectral techniques for sequential ATPG (AG, SS, MSH, VDA), pp. 204–208.
- DATE-2001-HoffmanKM #framework
- A framework for fast hardware-software co-simulation (AH, TK, HM), pp. 760–765.
- DATE-2001-IrionKVW #clustering #logic #synthesis
- Circuit partitioning for efficient logic BIST synthesis (AI, GK, HPEV, HJW), pp. 86–91.
- DATE-2001-JungYC #analysis #multi
- Performance improvement of multi-processor systems cosimulation based on SW analysis (JJ, SY, KC), pp. 749–753.
- DATE-2001-NovikovG #learning #multi
- An efficient learning procedure for multiple implication checks (YN, EIG), pp. 127–135.
- DATE-2001-Parameswaran #hardware
- Code placement in hardware/software co-synthesis to improve performance and reduce cost (SP), pp. 626–632.
- DATE-2001-SaitohAT #clustering #scheduling
- Clustering based fast clock scheduling for light clock-tree (MS, MA, AT), pp. 240–245.
- DATE-2001-VanasscheGS #exponential #simulation #using
- Efficient time-domain simulation of telecom frontends using a complex damped exponential signal model (PV, GGEG, WMCS), pp. 169–175.
- DATE-2001-VandersteenWRSDEB #estimation #multi
- Efficient bit-error-rate estimation of multicarrier transceivers (GV, PW, YR, JS, SD, ME, IB), pp. 164–168.
- DATE-2001-WormLW #architecture #design #power management
- Design of low-power high-speed maximum a priori decoder architectures (AW, HL, NW), pp. 258–267.
- DATE-2001-XuM #difference #modelling #using
- Efficient and passive modeling of transmission lines by using differential quadrature method (QX, PM), pp. 437–444.
- DATE-2001-YuK #algorithm #distributed
- Explicit formulas and efficient algorithm for moment computation of coupled RC trees with lumped and distributed elements (QY, ESK), pp. 445–450.
- HPCA-2001-AbaliFSPS #hardware #in memory #memory management
- Performance of Hardware Compressed Main Memory (BA, HF, XS, DEP, TBS), pp. 73–81.
- HPCA-2001-GoemanVB #difference #predict
- Differential FCM: Increasing Value Prediction Accuracy by Improving Table Usage Efficiency (BG, HV, KDB), pp. 207–216.
- HPDC-2001-DramlitschAS #distributed
- Efficient Techniques for Distributed Computing (TD, GA, ES), pp. 435–436.
- HPDC-2001-WidenerES #communication #metadata #xml
- Open Metadata Formats: Efficient XML-Based Communication for High Performance Computing (PW, GE, KS), p. 371–?.
- LCTES-OM-2001-BrunschOS #corba #design #scalability
- Designing an Efficient and Scalable Server-side Asynchrony Model for CORBA (DB, CO, DCS), pp. 223–229.
- LCTES-OM-2001-LarusP #scheduling #using
- Using Cohort Scheduling to Enhance Server Performance (JRL, MP), pp. 182–187.
- LCTES-OM-2001-PalopoliLANAC #embedded #prototype #simulation
- A Tool for Simulation and Fast Prototyping of Embedded Control Systems (LP, GL, LA, MDN, PA, FC), pp. 73–81.
- PDP-2001-CourtraiMR #communication #java #network
- Java Objects Communication on a High Performance Network (LC, YM, FR), pp. 203–210.
- PDP-2001-EnblomL #adaptation #flexibility #framework #industrial #multi #platform #realtime
- Adding Flexibility and Real-Time Performance by Adapting a Single Processor Industrial Application to a Multiprocessor Platform (LE, LL), pp. 487–490.
- PDP-2001-GetovWLT #evaluation #java #message passing
- Message-Passing Computing with Java: Performance Evaluation and Comparisons (VG, MW, QL, MT), pp. 173–177.
- PDP-2001-GoncalvesPPSNS #architecture #branch #predict #smt
- Evaluating the Effects of Branch Prediction Accuracy on the Performance of SMT Architectures (RG, MLP, GDP, TGSdS, POAN, RS), pp. 355–362.
- PDP-2001-GrosspietschB #architecture #memory management
- A Smart Memory Architecture for the Efficient Support of Artificial Neural Nets (KEG, JB), p. 451–?.
- PDP-2001-SchulzHT #communication #predict
- Prediction of Communication Performance for Wide Area Computing Systems (JS, CH, DT), pp. 480–486.
- PDP-2001-SemeM #algorithm #geometry #parallel #problem
- Efficient BSR-Based Parallel Algorithms for Geometrical Problems (DS, JFM), pp. 265–272.
- PDP-2001-TesseraD #case study #communication #policy
- Communication Policies Performance: A Case Study (DT, AD), p. 491–?.
- PPoPP-2001-CarreraB #clustering #network
- Efficiency vs. portability in cluster-based network servers (EVC, RB), pp. 113–122.
- PPoPP-2001-NieuwpoortKB #divide and conquer
- Efficient load balancing for wide-area divide-and-conquer applications (RvN, TK, HEB), pp. 34–43.
- SOSP-2001-HeidemannSIGEG #low level #network
- Building Efficient Wireless Sensor Networks with Low-Level Naming (JSH, FS, CI, RG, DE, DG), pp. 146–159.
- STOC-2001-AchlioptasM #matrix #rank
- Fast computation of low rank matrix (DA, FM), pp. 611–618.
- STOC-2001-ErgunSSS
- Biased dictionaries with fast insert/deletes (FE, SCS, JS, RKS), pp. 483–491.
- STOC-2001-KlivansS #multi #testing
- Randomness efficient identity testing of multivariate polynomials (AK, DAS), pp. 216–223.
- TACAS-2001-BehrmannF #towards
- Efficient Guiding Towards Cost-Optimality in UPPAAL (GB, AF), pp. 174–188.
- TACAS-2001-CiardoLS #generative #named
- Saturation: An Efficient Iteration Strategy for Symbolic State-Space Generation (GC, GL, RS), pp. 328–342.
- CAV-2001-AmlaEKN #diagrams #model checking #named
- Rtdt: A Front-End for Efficient Model Checking of Synchronous Timing Diagrams (NA, EAE, RPK, KSN), pp. 387–390.
- CAV-2001-BhatCG #automaton #model checking
- Efficient Model Checking Via Büchi Tableau Automata (GB, RC, AG), pp. 38–52.
- CAV-2001-DovierPP #algorithm #bisimulation
- A Fast Bisimulation Algorithm (AD, CP, AP), pp. 79–90.
- CAV-2001-GastinO #automaton #ltl
- Fast LTL to Büchi Automata Translation (PG, DO), pp. 53–65.
- CAV-2001-LarsenBBFHPR #automaton #reachability
- As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata (KGL, GB, EB, AF, TH, PP, JR), pp. 493–505.
- CAV-2001-MoriokaKY #algorithm #towards #verification
- Towards Efficient Verification of Arithmetic Algorithms over Galois Fields GF(2m) (SM, YK, TY), pp. 465–477.
- IJCAR-2001-Larchey-WendlingMG #named
- STRIP: Structural Sharing for Efficient Proof-Search (DLW, DM, DG), pp. 696–700.
- IJCAR-2001-Voronkov #algorithm #automation #deduction
- Algorithms, Datastructures, and other Issues in Efficient Automated Deduction (AV), pp. 13–28.
- SAT-2001-GiunchigliaNTV #library #satisfiability #towards
- Towards an Efficient Library for SAT: a Manifesto (EG, MN, AT, MYV), pp. 290–310.
ADL-2000-BohmBKS #library #similarity- Efficient Similarity Search in Digital Libraries (CB, BB, HPK, MS), pp. 193–199.
- PODS-2000-NevenS #pattern matching
- Expressive and Efficient Pattern Languages for Tree-Structured Data (FN, TS), pp. 145–156.
- PODS-2000-YuOB #approach
- Indexing the Edges — A Simple and Yet Efficient Approach to High-Dimensional Indexing (BCO, KLT, CY, SB), pp. 166–174.
- SIGMOD-2000-ChristophidesCS #integration #on the #query #xml
- On Wrapping Query Languages and Efficient XML Integration (VC, SC, JS), pp. 141–152.
- SIGMOD-2000-LabioWGG
- Efficient Resumption of Interrupted Warehouse Loads (WL, JLW, HGM, VG), pp. 46–57.
- SIGMOD-2000-LiefkeS #named #xml
- XMILL: An Efficient Compressor for XML Data (HL, DS), pp. 153–164.
- SIGMOD-2000-OhHP #database #effectiveness #scalability #video
- Efficient and Cost-effective Techniques for Browsing and Indexing Large Video Databases (JHO, KAH), pp. 415–426.
- SIGMOD-2000-OrdonezC #algorithm #clustering #named #sql #using
- SQLEM: Fast Clustering in SQL using the EM Algorithm (CO, PC), pp. 559–570.
- SIGMOD-2000-PeiMHZ #benchmark #data mining #metric #mining #towards
- Towards Data Mining Benchmarking: A Testbed for Performance Study of Frequent Pattern Mining (JP, RM, KH, HZ), p. 592.
- SIGMOD-2000-RamaswamyRS #algorithm #mining #scalability #set
- Efficient Algorithms for Mining Outliers from Large Data Sets (SR, RR, KS), pp. 427–438.
- SIGMOD-2000-RoySSB #algorithm #multi #optimisation #query
- Efficient and Extensible Algorithms for Multi Query Optimization (PR, SS, SS, SB), pp. 249–260.
- VLDB-2000-AltinelF #documentation #xml
- Efficient Filtering of XML Documents for Selective Dissemination of Information (MA, MJF), pp. 53–64.
- VLDB-2000-LabioYCGW #incremental #maintenance
- Performance Issues in Incremental Warehouse Maintenance (WL, JY, YC, HGM, JW), pp. 461–472.
- VLDB-2000-YiF #sequence
- Fast Time Sequence Indexing for Arbitrary Lp Norms (BKY, CF), pp. 385–394.
- VLDB-2000-YuV #bound #fault #network
- Efficient Numerical Error Bounding for Replicated Network Services (HY, AV), pp. 123–133.
- CSMR-2000-SilvaLRG #evaluation #legacy #migration
- Characterizing a Synthetic Workload for Performance Evaluation during the Migration of a Legacy System (PPdS, AHFL, RFR, PBG), pp. 173–182.
- CIAA-2000-BergeronH #automaton #implementation
- Fast Implementations of Automata Computations (AB, SH), pp. 47–56.
- ICALP-2000-AielloBOR #proving #verification
- Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP (WA, SNB, RO, SR), pp. 463–474.
- ICALP-2000-CzumajL #approximate #multi #problem
- Fast Approximation Schemes for Euclidean Multi-connectivity Problems (AC, AL), pp. 856–868.
- ICALP-2000-Hastad #algorithm #approximate #np-hard #optimisation #problem #question
- Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms? (JH), p. 235.
- ICALP-2000-Kucera #algorithm #process #verification
- Efficient Verification Algorithms for One-Counter Processes (AK), pp. 317–328.
- CHI-2000-BuyukkoktenGPW #web
- Power browser: efficient Web browsing for PDAs (OB, HGM, AP, TW), pp. 430–437.
- CHI-2000-DennerleinMH
- Force-feedback improves performance for steering and combined steering-targeting tasks (JTD, DBM, CJH), pp. 423–429.
- CHI-2000-FrokjaerHH #correlation #effectiveness #question #usability
- Measuring usability: are effectiveness, efficiency, and satisfaction really correlated? (EF, MH, KH), pp. 345–352.
- CHI-2000-RickenbergR #user interface
- The effects of animated characters on anxiety, task performance, and evaluations of user interfaces (RR, BR), pp. 49–56.
- CAiSE-2000-BauerD #distributed #workflow
- Efficient Distributed Workflow Management Based on Variable Server Assignments (TB, PD), pp. 94–109.
- ICEIS-2000-BatesR #evaluation
- Creating Realistic Data for Performance Evaluation (CB, IR), pp. 15–20.
- ICEIS-2000-ZhuLL #database #web
- Web Databases and Related Performance Issues (YZ, KL, YL), pp. 90–96.
- CIKM-2000-BellatrecheKS #on the
- On Efficient Storage Space Distribution Among Materialized Views and Indices in Data Warehousing Environments (LB, KK, MS), pp. 397–404.
- CIKM-2000-BohmBBK #clustering #similarity
- High Performance Clustering Based on the Similarity Join (CB, BB, MMB, HPK), pp. 298–305.
- CIKM-2000-HanK #algorithm #categorisation #documentation #reduction #retrieval
- Fast Supervised Dimensionality Reduction Algorithm with Applications to Document Categorization & Retrieval (EHH, GK), pp. 12–19.
- CIKM-2000-Koudas
- Space Efficient Bitmap Indexing (NK), pp. 194–201.
- CIKM-2000-XuHLL #named #on-demand #policy
- SAIU: An Efficient Cache Replacement Policy for Wireless On-demand Broadcasts (JX, QH, DLL, WCL), pp. 46–53.
- ICML-2000-EvgeniouPPP #bound #kernel
- Bounds on the Generalization Performance of Kernel Machine Ensembles (TE, LPB, MP, TP), pp. 271–278.
- ICML-2000-Joachims
- Estimating the Generalization Performance of an SVM Efficiently (TJ), pp. 431–438.
- ICML-2000-KomarekM #adaptation #machine learning #scalability #set
- A Dynamic Adaptation of AD-trees for Efficient Machine Learning on Large Data Sets (PK, AWM), pp. 495–502.
- ICML-2000-MamitsukaA #database #learning #mining #query #scalability
- Efficient Mining from Large Databases by Query Learning (HM, NA), pp. 575–582.
- ICML-2000-PellegM #clustering #estimation #named
- X-means: Extending K-means with Efficient Estimation of the Number of Clusters (DP, AWM), pp. 727–734.
- ICML-2000-SannerALL #learning
- Achieving Efficient and Cognitively Plausible Learning in Backgammon (SS, JRA, CL, MCL), pp. 823–830.
- ICML-2000-Scheffer #predict
- Predicting the Generalization Performance of Cross Validatory Model Selection Criteria (TS), pp. 831–838.
- ICML-2000-SingerV #learning #modelling #predict
- Learning to Predict Performance from Formula Modeling and Training Data (BS, MMV), pp. 887–894.
- ICML-2000-TellerV #evolution #learning #programming
- Efficient Learning Through Evolution: Neural Programming and Internal Reinforcement (AT, MMV), pp. 959–966.
- ICPR-v1-2000-ChengDHT #detection
- Efficient Detection and Extraction of Color Objects from Complex Scenes (JC, SD, GH, JT), pp. 1668–1671.
- ICPR-v1-2000-Farneback #estimation #modelling #parametricity #using
- Fast and Accurate Motion Estimation Using Orientation Tensors and Parametric Motion Models (GF), pp. 1135–1139.
- ICPR-v1-2000-SongGH #geometry
- Single View Computer Vision in Polyhedral World: Geometric Inference and Performance Characterization (MS, AG, RMH), pp. 1766–1769.
- ICPR-v1-2000-XueLT #invariant #using
- Efficient Object Matching Using Affine-Invariant Deformable Contour (ZX, SZL, EKT), pp. 1672–1675.
- ICPR-v1-2000-ZometP
- Efficient Super-Resolution and Applications to Mosaics (AZ, SP), pp. 1579–1583.
- ICPR-v2-2000-AlkootK
- Improving the Performance of the Product Fusion Strategy (FMA, JK), pp. 2164–2167.
- ICPR-v2-2000-Caelli #feature model #image #learning #modelling #predict
- Learning Image Feature Extraction: Modeling, Tracking and Predicting Human Performance (TC), pp. 2215–2218.
- ICPR-v2-2000-CordellaFSV #component #detection #graph #image
- Fast Graph Matching for Detecting CAD Image Components (LPC, PF, CS, MV), pp. 6034–6037.
- ICPR-v2-2000-JuanV #classification #edit distance #normalisation #on the #string #using
- On the Use of Normalized Edit Distances and an Efficient k-NN Search Technique (k-AESA) for Fast and Accurate String Classification (AJ, EV), pp. 2676–2679.
- ICPR-v2-2000-KuritaTHSM #adaptation #detection #estimation #image
- Efficient Face Detection from News Images by Adaptive Estimation of Prior Probabilities and Ising Search (TK, MT, KH, HS, TM), pp. 2917–2920.
- ICPR-v2-2000-KwakCC #image #recognition #video
- Video Caption Image Enhancement for an Efficient Character Recognition (SK, KC, YC), pp. 2606–2609.
- ICPR-v2-2000-LingC #bound #feature model
- Fast and Efficient Feature Extraction Based on Bayesian Decision Boundaries (LLL, HMC), pp. 2390–2393.
- ICPR-v2-2000-MacLeanT #image #pattern matching #pattern recognition #recognition #using
- Fast Pattern Recognition Using Gradient-Descent Search in an Image Pyramid (WJM, JKT), pp. 2873–2877.
- ICPR-v2-2000-MesserK #algorithm #design #network
- Fast Unit Selection Algorithm for Neural Network Design (KM, JK), pp. 2981–2984.
- ICPR-v2-2000-SerratosaAS #algorithm #graph
- Efficient Algorithms for Matching Attributed Graphs and Function-Described Graphs (FS, RA, AS), pp. 2867–2872.
- ICPR-v2-2000-SuzukiHS #component
- Fast Connected-Component Labeling Based on Sequential Local Operations in the Course of Forward Raster Scan Followed by Backward Raster Scan (KS, IH, NS), pp. 2434–2437.
- ICPR-v2-2000-VarstaHMM #human-computer #interface #set
- Evaluating the Performance of Three Feature Sets for Brain-Computer Interfaces with an Early Stopping MLP Committee (MV, JH, JdRM, JM), pp. 2907–2910.
- ICPR-v2-2000-Zhao00a #analysis
- Performance Perturbation Analysis of Eigen-Systems (WYZ), pp. 2105–2108.
- ICPR-v3-2000-BoydM #implementation #multi
- Fast Implementation of Multiple Oriented Filters (JEB, JM), pp. 3458–3462.
- ICPR-v3-2000-ChoiLS #algorithm
- An Efficient and Accurate Algorithm for Extracting a Skeleton (WPC, KML, WCS), pp. 3750–3753.
- ICPR-v3-2000-ChoKN #image #interface #using
- An Efficient Walkthrough from Two Images Using View Morphing and Spidery Mesh Interface (HSC, CHK, SN), pp. 3143–3146.
- ICPR-v3-2000-ChuC #algorithm #generative
- A Fast Algorithm for Generating Fractals (HTC, CCC), pp. 3306–3309.
- ICPR-v3-2000-HongHT #finite #gesture #recognition #state machine
- Constructing Finite State Machines for Fast Gesture Recognition (PH, TSH, MT), pp. 3695–3698.
- ICPR-v3-2000-HufnaglU #classification #fault
- Resolving a Defect in Quadrant-Based Classification for Fast Block-Matching (CH, AU), pp. 3203–3206.
- ICPR-v3-2000-KimCL #detection #feature model #using
- Fast Scene Change Detection Using Direct Feature Extraction from MPEG Compressed Videos (YMK, SWC, SWL), pp. 3178–3181.
- ICPR-v3-2000-KoubaroulisMK #multimodal
- The Multimodal Signature Method: An Efficiency and Sensitivity Study (DK, JM, JK), pp. 3379–3382.
- ICPR-v3-2000-KozlovMSRK #segmentation
- Fast Redundant Dyadic Wavelet Transform in Application to Spatial Registration of the Expression Patterns of Drosophila Segmentation Genes (KK, EM, MS, JR, DK), pp. 3463–3466.
- ICPR-v3-2000-LiapisST #algorithm #segmentation #using
- Color and/or Texture Segmentation Using Deterministic Relaxation and Fast Marching Algorithms (SL, ES, GT), pp. 3621–3624.
- ICPR-v3-2000-LuceySC #linear #using
- Initialized Eigenlip Estimator for Fast Lip Tracking Using Linear Regression (SL, SS, VC), pp. 3182–3185.
- ICPR-v3-2000-PeceP #composition
- Fast Atomic Decomposition by the Inhibition Method (AECP, NP), pp. 3215–3218.
- ICPR-v3-2000-Rocha #composition #diagrams
- Efficient Polygonal Decomposition into Singular and Regular Regions via Voronoi Diagrams (JR), pp. 3770–3773.
- ICPR-v3-2000-RomeroRT
- Fast Skeletonization of Spatially Encoded Objects (FR, LR, FT), pp. 3514–3517.
- ICPR-v3-2000-SanchisVJ #recognition #speech #using #verification #word
- Efficient Use of the Grammar Scale Factor to Classify Incorrect Words in Speech Recognition Verification (AS, EV, VMJ), pp. 3278–3281.
- ICPR-v3-2000-TraverRI #algorithm #approximate #search-based
- Exploring the Performance of Genetic Algorithms as Polygonal Approximators (VJT, GR, JMIQ), pp. 3774–3777.
- ICPR-v3-2000-VassZ #analysis #component #fault #image
- Enhanced Significance-Linked Connected Component Analysis for High Performance Error Resilient Wavelet Image Coding (JV, XZ), pp. 3075–3078.
- ICPR-v4-2000-AksoyYSSWHPPRSF #algorithm #contest
- Algorithm Performance Contest (SA, MY, MLS, MS, YW, RMH, JRP, JP, DR, CS, GF), pp. 4870–4876.
- ICPR-v4-2000-ChhabraP #evaluation #recognition
- Performance Evaluation of Line Drawing Recognition Systems (AKC, ITP), pp. 4864–4869.
- ICPR-v4-2000-DoermannM #evaluation #tool support #video
- Tools and Techniques for Video Performance Evaluation (DSD, DM), pp. 4167–4170.
- ICPR-v4-2000-HaritaogluHD #maintenance #modelling
- A Fast Background Scene Modeling and Maintenance for Outdoor Surveillance (IH, DH, LSD), pp. 4179–4183.
- ICPR-v4-2000-HasegawaYM #algorithm #online #recognition
- Fast Discrete HMM Algorithm for On-line Handwriting Recognition (TH, HY, TM), pp. 4535–4538.
- ICPR-v4-2000-KoLB #feature model #image #retrieval #using
- Region-Based Image Retrieval System Using Efficient Feature Description (BK, HSL, HB), pp. 4283–4286.
- ICPR-v4-2000-Lucas #graph #taxonomy
- Efficient Best-First Dictionary Search Given Graph-Based Input (SML), pp. 4434–4437.
- ICPR-v4-2000-RahmanF #comparison #multi
- Comparison of Some Multiple Expert Strategies: An Investigation of Resource Prerequisites and Achievable Performance (AFRR, MCF), pp. 4841–4844.
- ICPR-v4-2000-RaoMP #retrieval
- Efficient Retrieval of Deformed and Occluded Shapes (ZR, EEM, EGMP), pp. 4067–4071.
- ICPR-v4-2000-SekiguchiE #generative
- Generating the Human Piano Performance in Virtual Space (HS, SE), pp. 4477–4481.
- ICPR-v4-2000-VinczeAZ #integration #using
- Fast Tracking of Ellipses Using Edge-Projected Integration of Cues (MV, MA, MZ), pp. 4072–4075.
- ICPR-v4-2000-XuGMC #analysis #retrieval
- Performance Analysis in Content-Based Retrieval with Textures (KX, BG, PM, DC), pp. 4275–4278.
- KDD-2000-BecherBF #automation #data analysis #data mining #mining
- Automating exploratory data analysis for efficient data mining (JDB, PB, EF), pp. 424–429.
- KDD-2000-Bhattacharyya #algorithm #data mining #mining #modelling #multi
- Evolutionary algorithms in data mining: multi-objective performance modeling for direct marketing (SB), pp. 465–473.
- KDD-2000-DomingosH #data type #mining
- Mining high-speed data streams (PMD, GH), pp. 71–80.
- KDD-2000-FlakeLG #community #identification #web
- Efficient identification of Web communities (GWF, SL, CLG), pp. 150–160.
- KDD-2000-GarofalakisHRS #algorithm #constraints
- Efficient algorithms for constructing decision trees with constraints (MNG, DH, RR, KS), pp. 335–339.
- KDD-2000-KittsFV #independence #named #recommendation
- Cross-sell: a fast promotion-tunable customer-item recommendation method based on conditionally independent probabilities (BK, DF, MV), pp. 437–446.
- KDD-2000-McCallumNU #clustering #set
- Efficient clustering of high-dimensional data sets with application to reference matching (AM, KN, LHU), pp. 169–178.
- KDD-2000-WangYY #mining
- Efficient mining of weighted association rules (WAR) (WW, JY, PSY), pp. 270–274.
- KDD-2000-Webb
- Efficient search for association rules (GIW), pp. 99–107.
- KR-2000-PeaseCLF #information management #knowledge base #representation
- Practical Knowledge Representation and the DARPA High Performance Knowledge Bases Project (AP, VKC, FL, AF), pp. 717–724.
- SIGIR-2000-Ogawa #documentation #n-gram #pseudo #ranking #retrieval
- Pseudo-frequency method: an efficient document ranking retrieval method for n-gram indexing (YO), pp. 321–323.
- SIGIR-2000-Vakkari #documentation
- Relevance and contributing information types of searched documents in task performance (PV), pp. 2–9.
- UML-2000-MirandolaC #distributed #modelling #uml
- UML Based Performance Modeling of Distributed Systems (RM, VC), pp. 178–193.
- OOPSLA-2000-Glew #encoding
- An efficient class and object encoding (NG), pp. 311–324.
- TOOLS-EUROPE-2000-HartwichT #distributed #execution #object-oriented
- Operation Execution Groups: Efficient Operation Processing in Widely Distributed Object Systems (CH, ST), pp. 157–168.
- PLDI-2000-Boothe #algorithm #bidirectional #debugging
- Efficient algorithms for bidirectional debugging (BB), pp. 299–310.
- POPL-2000-EsparzaP #algorithm #graph #interprocedural #parallel
- Efficient Algorithms for pre* and post* on Interprocedural Parallel Flow Graphs (JE, AP), pp. 1–11.
- PPDP-2000-JohanssonPS #erlang
- A high performance Erlang system (EJ, MP, KFS), pp. 32–43.
- PPDP-2000-KollerM #abstract interpretation #component #morphism #using
- Efficient abstract interpretation using component-wise homomorphisms (JK, MM), pp. 226–234.
- PPDP-2000-Li #memory management #prolog #stack
- Efficient memory management in a merged heap/stack prolog machine (XL), pp. 245–256.
- SAS-2000-GagnonHM #bytecode #java #static typing
- Efficient Inference of Static Types for Java Bytecode (EG, LJH, GM), pp. 199–219.
- ICRE-2000-DamianESG #communication #requirements
- The Effects of Communication Media on Group Performance in Requirements Engineering (DED, AE, MLGS, BRG), p. 191.
- ICRE-2000-HubbardSM #assessment #process #requirements
- An Assessment of the Relative Efficiency of a Facilitator-Driven Requirements Collection Process with Respect to the Conventional Interview Method (RH, CNS, NRM), pp. 178–188.
- ASE-2000-NoahW #automation #database #design #tool support #validation
- Exploring and Validating the Contributions of Real-World Knowledge to the Diagnostic Performance of Automated Database Design Tools (SAN, MDW), pp. 177–186.
- FoSE-2000-Pooley #re-engineering
- Software engineering and performance: a road-map (RP), pp. 189–199.
- ICSE-2000-LiangH #analysis
- Light-weight context recovery for efficient and accurate program analyses (DL, MJH), pp. 366–375.
- ICSE-2000-Murphy #how #industrial
- Grow fast, grow global: how the Irish software industry evolved to this business model (BM), pp. 606–607.
- SAC-2000-AmirbekyanZ #corba #transaction
- The Role of Transaction Management in CORBA/ODB Integrated Systems’ Performance (VA, KZ), pp. 733–740.
- SAC-2000-Debenham #architecture #multi #process
- A Multi-Agent Architecture for Process Management Accommodates Unexpected Performance (JKD), pp. 15–19.
- SAC-2000-Dowell #configuration management #constraints #network
- Optimal Configuration of a Command and Control Network: Balancing Performance and Reconfiguration Constraints (LJD), pp. 94–98.
- SAC-2000-Nezu #network
- Performance of Deflection Routing in Toroidal Networks (NN), pp. 682–684.
- SAC-2000-TousidouM #comparison #data access
- A Performance Comparison of Quadtree-Based Access Methods for Thematic Maps (ET, YM), pp. 381–388.
- SAC-2000-WagnerHK #flexibility #image #web
- Efficient and Flexible Web Access to Art-Historical Image Collections (MW, SH, WK), pp. 915–921.
- ASPLOS-2000-BhoedjangVRBH #communication #design #network #reliability
- Evaluating Design Alternatives for Reliable Communication on High-Speed Networks (RB, KV, TR, HEB, RFHH), pp. 71–81.
- ASPLOS-2000-BurkeMA #architecture #encryption #symmetry
- Architectural Support for Fast Symmetric-Key Cryptography (JB, JM, TMA), pp. 178–189.
- ASPLOS-2000-BurrowsELVWWW #flexibility
- Efficient and Flexible Value Sampling (MB, ÚE, STL, MTV, CAW, KW, WEW), pp. 160–167.
- ASPLOS-2000-FlautnerURM #concurrent #interactive #parallel #thread
- Thread Level Parallelism and Interactive Performance of Desktop Applications (KF, RU, SKR, TNM), pp. 129–138.
- ASPLOS-2000-SundaramoorthyPR #fault tolerance
- Slipstream Processors: Improving both Performance and Fault Tolerance (KS, ZP, ER), pp. 257–268.
- CC-2000-GayS #analysis #source code #stack
- Fast Escape Analysis and Stack Allocation for Object-Based Programs (DG, BS), pp. 82–93.
- DAC-2000-CarloniS #analysis #latency #optimisation
- Performance analysis and optimization of latency insensitive systems (LPC, ALSV), pp. 361–367.
- DAC-2000-ChangCSM #detection #functional #symmetry #using
- Fast post-placement rewiring using easily detectable functional symmetries (CWJC, CKC, PS, MMS), pp. 286–289.
- DAC-2000-CongLW #clustering #multi
- Performance driven multi-level and multiway partitioning with retiming (JC, SKL, CW), pp. 274–279.
- DAC-2000-GhazalNR #predict
- Predicting performance potential of modern DSPs (NG, ARN, JMR), pp. 332–335.
- DAC-2000-HorstmannshoffM #code generation #data flow #graph
- Efficient building block based RTL code generation from synchronous data flow graphs (JH, HM), pp. 552–555.
- DAC-2000-HsiehBLS #design #embedded
- Efficient methods for embedded system design space exploration (HH, FB, LL, ALSV), pp. 607–612.
- DAC-2000-JagannathanHL #algorithm
- A fast algorithm for context-aware buffer insertion (AJ, SWH, JL), pp. 368–373.
- DAC-2000-KanapkaPW
- Fast methods for extraction and sparsification of substrate coupling (JK, JRP, JW), pp. 738–743.
- DAC-2000-LachMP #debugging #detection #fault #locality
- Efficient error detection, localization, and correction for FPGA-based debugging (JL, WHMS, MP), pp. 207–212.
- DAC-2000-LevySMW #analysis
- A rank-one update method for efficient processing of interconnect parasitics in timing analysis (HL, WS, DM, JW), pp. 75–78.
- DAC-2000-LuJCF #using
- Efficient variable ordering using aBDD based sampling (YL, JJ, EMC, MF), pp. 687–692.
- DAC-2000-MehrotraSBCVN #modelling
- A methodology for modeling the effects of systematic within-die interconnect and device variation on circuit performance (VM, SLS, DSB, AC, RV, SRN), pp. 172–175.
- DAC-2000-NassifK #grid #power management #simulation
- Fast power grid simulation (SRN, JNK), pp. 156–161.
- DAC-2000-ShinKC #analysis #embedded #multi #realtime
- Schedulability-driven performance analysis of multiple mode embedded real-time systems (YS, DK, KC), pp. 495–500.
- DAC-2000-SouriBMS #analysis #design #motivation #multi
- Multiple Si layer ICs: motivation, performance analysis, and design implications (SJS, KB, AM, KS), pp. 213–220.
- DAC-2000-TsaiK #reduction #simulation
- Fast temperature calculation for transient electrothermal simulation by mixed frequency/time domain thermal model reduction (CHT, SMK), pp. 750–755.
- DAC-2000-VandersteenWRDDEB #data flow #simulation
- A methodology for efficient high-level dataflow simulation of mixed-signal front-ends of digital telecom transceivers (GV, PW, YR, PD, SD, ME, IB), pp. 440–445.
- DAC-2000-YangP #multi #simulation
- A multi-interval Chebyshev collocation method for efficient high-accuracy RF circuit simulation (BY, JRP), pp. 178–183.
- DATE-2000-BrennerV
- Faster Optimal Single-Row Placement with Fixed Ordering (UB, JV), pp. 117–121.
- DATE-2000-ChangLNXH #modelling
- Clocktree RLC Extraction with Efficient Inductance Modeling (NC, SL, OSN, WX, LH), pp. 522–526.
- DATE-2000-CordoneFSC #approach #heuristic #problem
- An Efficient Heuristic Approach to Solve the Unate Covering Problem (RC, FF, DS, RWC), pp. 364–371.
- DATE-2000-DemirF #evaluation #modelling #probability
- Stochastic Modeling and Performance Evaluation for Digital Clock and Data Recovery Circuits (AD, PF), pp. 340–344.
- DATE-2000-DessoukyLP #synthesis
- Layout-Oriented Synthesis of High Performance Analog Circuits (MD, MML, JP), pp. 53–57.
- DATE-2000-HenkeGV #design #estimation
- Fast Cache and Bus Power Estimation for Parameterized System-on-a-Chip Design (JH, TG, FV), pp. 333–338.
- DATE-2000-LajoloRDL #design
- Efficient Power Co-Estimation Techniques for System-on-Chip Design (ML, AR, SD, LL), pp. 27–34.
- DATE-2000-OuaissV #configuration management
- Efficient Resource Arbitration in Reconfigurable Computing Environments (IO, RV), pp. 560–566.
- DATE-2000-Saab #algorithm #clustering #effectiveness #multi
- A New Effective And Efficient Multi-Level Partitioning Algorithm (YS), pp. 112–116.
- DATE-2000-TangWT #evaluation #sequence
- Fast Evaluation of Sequence Pair in Block Placement by Longest Common Subsequence Computation (XT, DFW, RT), pp. 106–111.
- DATE-2000-YooLJRCC #execution
- Fast Hardware-Software Coverification by Optimistic Execution of Real Processor (SY, JeL, JJ, KR, YC, KC), pp. 663–668.
- HPCA-2000-BarrosoGNV #integration
- Impact of Chip-Level Integration on Performance of OLTP Workloads (LAB, KG, AN, BV), pp. 3–14.
- HPCA-2000-BoschSSRH #analysis #case study #parallel #using #visualisation
- Performance Analysis and Visualization of Parallel Systems Using SimOS and Rivet: A Case Study (RB, CS, GS, MR, PH), pp. 360–371.
- HPCA-2000-CappelloRE #clustering #modelling #programming
- Investigating the Performance of Two Programming Models for Clusters of SMP PCs (FC, OR, DE), pp. 349–359.
- HPCA-2000-CasadoBQSD #configuration management #evaluation #network
- Performance Evaluation of Dynamic Reconfiguration in High-Speed Local Area Networks (RC, AB, FJQ, JLS, JD), pp. 85–96.
- HPCA-2000-FigueiredoF
- Impact of Heterogeneity on DSM Performance (RJOF, JABF), pp. 26–35.
- HPCA-2000-JimenezLF #automation #on the
- On the Performance of Hand vs. Automatically Optimized Numerical Codes (MJ, JML, AF), pp. 183–194.
- HPDC-2000-EisenhauerBS
- Event Services for High Performance Computing (GE, FEB, KS), pp. 113–120.
- HPDC-2000-KurmannMRS #communication
- Speculative Defragmentation — A Technique to Improve the Communication Software Efficiency for Gigabit Ethernet (CK, MM, FR, TS), pp. 131–138.
- HPDC-2000-NishiTYKA #network #parallel
- A Local Area System Network RHinet-1: A Network for High Performance Parallel Computing (HN, KT, JY, TK, HA), pp. 296–297.
- HPDC-2000-ShenC #architecture #distributed #multi #predict
- A Distributed Multi-Storage Resource Architecture and I/O Performance Prediction for Scientific Computing (XS, ANC), pp. 21–30.
- HPDC-2000-SumimotoTHHTI #clustering #communication #network #using
- High Performance Communication using a Commodity Network for Cluster Systems (SS, HT, AH, HH, TT, YI), pp. 139–146.
- HPDC-2000-TanakaHSNS #clustering #evaluation
- Performance Evaluation of a Firewall-Compliant Globus-based Wide-Area Cluster System (YT, MH, MS, HN, SS), pp. 121–128.
- HPDC-2000-TurgeonSC #using
- Application Placement using Performance Surfaces (AT, QS, MJC), pp. 229–236.
- HPDC-2000-WuTGLLSHJ #distributed #framework #modelling #named #parallel
- Prophesy: An Infrastructure for Analyzing and Modeling the Performance of Parallel and Distributed Applications (XW, VET, JG, XL, ZL, RLS, MH, IRJ), pp. 302–303.
- ISMM-2000-AgesenG
- Efficient Object Sampling via Weak References (OA, AG), pp. 121–126.
- LCTES-2000-ParkLLHK #embedded
- A Power Efficient Cache Structure for Embedded Processors Based on the Dual Cache Structure (GHP, KWL, JHL, TDH, SDK), pp. 162–177.
- OSDI-2000-FuKM #distributed #file system
- Fast and Secure Distributed Read-Only File System (KF, MFK, DM), pp. 181–196.
- OSDI-2000-YuGCWLKA #array #capacity
- Trading Capacity for Performance in a Disk Array (XY, BG, YC, RYW, KL, AK, TEA), pp. 243–258.
- PDP-2000-AversaMMV #distributed #simulation #source code
- A performance simulation technique for distributed programs: application to an SOR iterative solver (RA, BDM, NM, UV), pp. 368–375.
- PDP-2000-Cerin #geometry #implementation #problem #source code #towards
- Towards efficient BSP implementations of BSR programs for some computational geometry problems (CC), pp. 357–364.
- PDP-2000-GoscinskiHS #message passing #operating system #overview #parallel
- Performance and transparency of message passing and DSM services within the GENESIS operating system for managing parallelism on COWs (AG, MH, JS), pp. 110–117.
- PDP-2000-KimHKSJILPPF #distributed #framework #network
- A QoS performance measure framework for distributed heterogeneous networks (JKK, DAH, TK, HJS, DSJ, CEI, TEL, NWP, VKP, RFF), pp. 18–27.
- PDP-2000-KozirisRTP #algorithm #architecture #clustering #graph #multi #physics
- An efficient algorithm for the physical mapping of clustered task graphs onto multiprocessor architectures (NK, MR, PT, GKP), pp. 406–413.
- PDP-2000-LefevreR #clustering #communication #multi #protocol #thread
- Combining low-latency communication protocols with multithreading for high performance DSM systems on clusters (LL, OR), pp. 333–340.
- PDP-2000-MukherjeeRG #named #prototype
- FINESSE: a prototype feedback-guided performance enhancement system (NM, GDR, JRG), pp. 101–109.
- PDP-2000-RivasI #3d #algorithm #image #parallel #re-engineering
- Fast parallel algorithms for 3D reconstruction of angiographic images (RR, MBI), pp. 43–47.
- FoSSaCS-2000-BerardLS #equivalence #parallel #process #verification
- Verifying Performance Equivalence for Timed Basic Parallel Processes (BB, AL, PS), pp. 35–47.
- STOC-2000-AdlerL #multi #using
- Compression using efficient multicasting (MA, FTL), pp. 153–162.
- STOC-2000-ColeH
- Faster suffix tree construction with missing suffix links (RC, RH), pp. 407–415.
- STOC-2000-KatzT #on the
- On the efficiency of local decoding procedures for error-correcting codes (JK, LT), pp. 80–86.
- TACAS-2000-Mateescu #equation #generative
- Efficient Diagnostic Generation for Boolean Equation Systems (RM), pp. 251–265.
- TACAS-2000-Wang #data type #realtime #verification
- Efficient Data Structure for Fully Symbolic Verification of Real-Time Software Systems (FW), pp. 157–171.
- CADE-2000-HasegawaFK #branch #generative #using
- Efficient Minimal Model Generation Using Branching Lemmas (RH, HF, MK), pp. 184–199.
- CAV-2000-AlurGM #analysis #reachability
- Efficient Reachability Analysis of Hierarchical Reactive Machines (RA, RG, MM), pp. 280–295.
- CAV-2000-EsparzaHRS #algorithm #automaton #model checking
- Efficient Algorithms for Model Checking Pushdown Systems (JE, DH, PR, SS), pp. 232–247.
- CAV-2000-FraerKZVF #analysis #reachability #traversal #verification
- Prioritized Traversal: Efficient Reachability Analysis for Verification and Falsification (RF, GK, BZ, MYV, LF), pp. 389–402.
- CAV-2000-SomenziB #automaton #ltl
- Efficient Büchi Automata from LTL Formulae (FS, RB), pp. 248–263.
- CAV-2000-StollerUL #detection #distributed #partial order #using
- Efficient Detection of Global Properties in Distributed Systems Using Partial-Order Methods (SDS, LU, YAL), pp. 264–279.
- CAV-2000-WilliamsBCG #diagrams #model checking #satisfiability
- Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking (PFW, AB, EMC, AG), pp. 124–138.
- CL-2000-JunttilaN #satisfiability #towards
- Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking (TAJ, IN), pp. 553–567.
- CL-2000-KameyaS #learning #logic programming #source code
- Efficient EM Learning with Tabulation for Parameterized Logic Programs (YK, TS), pp. 269–284.
- CL-2000-YangK #implementation #logic #named #using
- FLORA: Implementing an Efficient DOOD System Using a Tabling Logic Engine (GY, MK), pp. 1078–1093.
- LICS-2000-AbdullaN #infinity #verification
- Better is Better than Well: On Efficient Verification of Infinite-State Systems (PAA, AN), pp. 132–140.
- LICS-2000-MurawskiO #proving #verification
- Dominator Trees and Fast Verification of Proof Nets (ASM, CHLO), pp. 181–191.
- LICS-2000-PalsbergZ #flexibility #recursion
- Efficient and Flexible Matching of Recursive Types (JP, TZ), pp. 388–398.
- TestCom-2000-GecseKS #evaluation
- HTTP Performance Evaluation with TTCN (RG, PK, JZS), pp. 177–192.
- ADL-1999-HuJ #documentation #multi #named #process #retrieval
- MD2L: Content Description of Multimedia Documents for Efficient Process and Search/Retrieval (MJH, YJ), pp. 200–213.
- ECDL-1999-DushayFL #distributed #library #predict
- Predicting Indexer Performance in a Distributed Digital Library (ND, JCF, CL), pp. 142–166.
- HT-1999-AuffretCCDRB #authoring #documentation #hypermedia #using
- Audiovisual-Based Hypermedia Authoring: Using Structured Representations for Efficient Access to AV Documents (GA, JC, OC, TD, RR, BB), pp. 169–178.
- ICDAR-1999-AntonacopoulosB #algorithm #analysis #flexibility #segmentation
- Methodology for Flexible and Efficient Analysis of the Performance of Page Segmentation Algorithms (AA, AB), pp. 451–454.
- ICDAR-1999-BrakensiekKWWR #evaluation #hybrid #modelling #online #recognition #using
- Performance Evaluation of a New Hybrid Modeling Technique for Handwriting Recognition using On-Line and Off-Line Data (AB, AK, DW, WW, GR), pp. 446–449.
- ICDAR-1999-ChenMM #algorithm #graph #segmentation
- An Efficient Algorithm for Matching a Lexicon with a Segmentation Graph (DYC, JM, KMM), pp. 543–546.
- ICDAR-1999-Ho #identification #keyword #learning #word
- Fast Identification of Stop Words for Font Learning and Keyword Spotting (TKH), pp. 333–336.
- ICDAR-1999-KamadaF #image
- High-speed, High-accuracy Binarization Method for Recognizing Text in Images of Low Spatial Resolutions (HK, KF), pp. 139–142.
- ICDAR-1999-MisraAC #image #memory management
- A Memory Efficient Method for Fast Transposing Run-length Encoded Images (VM, JFA, AKC), pp. 161–164.
- ICDAR-1999-ParkGS #recognition #segmentation #word
- Efficient Word Segmentation Driven by Unconstrained Handwritten Phrase Recognition (JP, VG, SNS), pp. 605–608.
- ICDAR-1999-RibertLE #classification #design #distributed #recognition
- Designing Efficient Distributed Neural Classifiers: Application to Handwritten Digit Recognition (AR, YL, AE), pp. 265–268.
- PODS-1999-ChuW #scalability
- Fast Time-Series Searching with Scaling and Shifting (KKWC, MHW), pp. 237–248.
- PODS-1999-MoreMS
- Efficient Sequencing Tape-Resident Jobs (SM, SM, EAMS), pp. 33–43.
- SIGMOD-1999-AggarwalPWYP #algorithm #clustering
- Fast Algorithms for Projected Clustering (CCA, CMP, JLW, PSY, JSP), pp. 61–72.
- SIGMOD-1999-BaulierBGGHJKKMMNNRSSSWW #database #in memory #memory management
- DataBlitz Storage Manager: Main Memory Database Performance for Critical Applications (JB, PB, SG, CG, SH, SJ, AK, HFK, PM, JM, PPSN, MN, RR, SS, AS, SS, MW, CW), pp. 519–520.
- SIGMOD-1999-ChakrabartiM #concurrent #data access #multi
- Efficient Concurrency Control in Multidimensional Access Methods (KC, SM), pp. 25–36.
- SIGMOD-1999-ChanI #encoding #query
- An Efficient Bitmap Encoding Scheme for Selection Queries (CYC, YEI), pp. 215–226.
- SIGMOD-1999-Keim #3d #database #geometry #similarity
- Efficient Geometry-based Similarity Search of 3D Spatial Databases (DAK), pp. 419–430.
- SIGMOD-1999-MankuRL #dataset #online #order #random #scalability #statistics
- Random Sampling Techniques for Space Efficient Online Computation of Order Statistics of Large Datasets (GSM, SR, BGL), pp. 251–262.
- SIGMOD-1999-ShanmugasundaramNSR #concurrent
- Efficient Concurrency Control for Broadcast Environments (JS, AN, RMS, KR), pp. 85–96.
- VLDB-1999-AcharyaGP #approximate #named #query #using
- Aqua: A Fast Decision Support Systems Using Approximate Query Answers (SA, PBG, VP), pp. 754–757.
- VLDB-1999-DattaRT #named #novel
- Curio: A Novel Solution for Efficient Storage and Indexing in Data Warehouses (AD, KR, HMT), pp. 730–733.
- VLDB-1999-HoskingC #design #implementation #named #orthogonal #persistent #programming language
- PM3: An Orthogonal Persistent Systems Programming Language — Design, Implementation, Performance (ALH, JC), pp. 587–598.
- VLDB-1999-Johnson #metric
- Performance Measurements of Compressed Bitmap Indices (TJ), pp. 278–289.
- VLDB-1999-PacittMS #algorithm #consistency #database #lazy evaluation #maintenance
- Fast Algorithms for Maintaining Replica Consistency in Lazy Master Replicated Databases (EP, PM, ES), pp. 126–137.
- ITiCSE-1999-Heines #student #web
- Evaluating course Web sites and student performance (JMH), pp. 143–146.
- PASTE-1999-Agrawal #graph #testing #using
- Efficient Coverage Testing Using Global Dominator Graphs (HA), pp. 11–20.
- PASTE-1999-ChoiGHS #analysis #exception #java #modelling #precise #source code
- Efficient and Precise Modeling of Exceptions for the Analysis of Java Programs (JDC, DG, MH, VS), pp. 21–31.
- PASTE-1999-LiangH #analysis #data flow #equivalence #pointer
- Equivalence Analysis: A General Technique to Improve the Efficiency of Data-flow Analyses in the Presence of Pointers (DL, MJH), pp. 39–46.
- PASTE-1999-NaumovichCC #analysis #data flow #partial order #using #verification
- Using Partial Order Techniques to Improve Performance of Data Flow Analysis Based Verification (GN, LAC, JMC), pp. 57–65.
- ICALP-1999-GrossiI #data type #linked data #maintenance #multi #open data
- Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures (RG, GFI), pp. 372–381.
- ICALP-1999-LingasOO #maintenance
- Efficient Merging, Construction, and Maintenance of Evolutionary Trees (AL, HO, AÖ), pp. 544–553.
- RTA-1999-Gobel #symmetry
- Fast Rewriting of Symmetric Polynomials (MG), pp. 371–381.
- FLOPS-1999-Chakravarty #lazy evaluation
- Lazy Lexing is Fast (MMTC), pp. 68–84.
- FLOPS-1999-JohnsonRRR #evaluation #logic programming #source code
- A Space Efficient Engine for Subsumption-Based Tabled Evaluation of Logic Programs (EJ, CRR, IVR, PR), pp. 284–300.
- ICFP-1999-Okasaki #matrix
- From Fast Exponentiation to Square Matrices: An Adventure in Types (CO), pp. 28–35.
- AGTIVE-1999-PetriuW #architecture #modelling #uml
- From UML Descriptions of High-Level Software Architectures to LQN Performance Models (DCP, XW), pp. 47–62.
- CHI-1999-AccotZ #evaluation
- Performance Evaluation of Input Devices in Trajectory-Based Tasks: An Application of the Steering Law (JA, SZ), pp. 466–472.
- CHI-1999-DouglasKM #assessment #standard #testing
- Testing Pointing Device Performance and User Assessment with the ISO 9241, Part 9 Standard (SAD, AEK, ISM), pp. 215–222.
- CHI-1999-KurtenbachFOB #scalability
- The Hotbox: Efficient Access to a Large Number of Menu-Items (GK, GWF, RNO, TB), pp. 231–237.
- HCI-CCAD-1999-BoussoffaraE #interface #scalability
- Influence of interfaces on human performance in S&C of large technical systems (BB, PFE), pp. 1286–1290.
- HCI-CCAD-1999-Caldwell
- Team performance in complex systems (BSC), pp. 412–416.
- HCI-CCAD-1999-Callantine #analysis #visualisation
- Visualization and analysis of flight crew procedure performance (TJC), pp. 1281–1285.
- HCI-CCAD-1999-DickelmanB
- Performance Support for the Next Millenium: a model for rapidly changing technologies in a global. economy (GJD, AB), pp. 187–191.
- HCI-CCAD-1999-HollnagelN #approach #collaboration
- The collaboration between operators and procedures: a cognitive systems engineering approach to performance improvement (EH, YN), pp. 1211–1215.
- HCI-CCAD-1999-Jacko #predict
- The importance of clinical diagnoses in the prediction of performance on computer-based tasks for low vision users (JAJ), pp. 787–791.
- HCI-CCAD-1999-JackoRSPD #visual notation
- Linking visual capabilities of partially sighted computer users to psychomotor task performance (JAJ, RHRJ, IUS, CJP, MAD), pp. 975–979.
- HCI-CCAD-1999-McNeese #analysis #learning #metric #process #protocol #using
- Making sense of teamwork: the use of protocol analysis / performance measures to reveal cooperative work processes in a situated learning environment (MDM), pp. 502–506.
- HCI-CCAD-1999-Swezey #metric #problem #simulation
- Measurement of team problem solving performance via a computerized quasi-experimental simulation (RWS), pp. 482–486.
- HCI-EI-1999-FarencP #architecture
- An Extensible Architecture to Support the Structuring and the efficient Exploitation of Ergonomic Rules (CF, PAP), pp. 1038–1042.
- HCI-EI-1999-LaubliSWK #process
- Fatigue and Muscle Activity in Fast Repetitive Finger Movements (TL, MS, JW, HK), pp. 106–110.
- HCI-EI-1999-LaursenJR
- Performance and Muscle Load among Young and Elderly (BL, BRJ, AR), pp. 89–92.
- ICEIS-1999-DuKM #algorithm #mining #reuse
- Two Fast Algorithms for Repeated Mining of Association Rules Based on Ressource Reuse (XD, KK, AM), pp. 65–73.
- ICEIS-1999-JunHSKP #network #protocol
- An Efficient Protocol for Radio Packet Networks (ARJ, SJH, HSS, GHK, MSP), pp. 642–648.
- ICEIS-1999-Lu #database #modelling #parallel #predict #process
- Modelling Background Processes in Parallel Database Systems for Performance Prediction (KJL), pp. 101–108.
- ICEIS-1999-Orozco-Barbosa #implementation #network #video
- Video Communications Over IP/ATM Networks Implementation Issues and Performance (LOB), pp. 577–584.
- CIKM-1999-ChangS #distributed #semantics
- Performance and Implications of Semantic Indexing in a Distributed Environment (CTKC, BRS), pp. 391–398.
- CIKM-1999-FerhatosmanogluAA #clustering #retrieval
- Clustering Declustered Data for Efficient Retrieval (HF, DA, AEA), pp. 343–350.
- CIKM-1999-HoltC #database #mining
- Efficient Mining of Association Rules in Text Databases (JDH, SMC), pp. 234–242.
- CIKM-1999-WangOL #multi
- Efficient Refreshment of Materialized Views with Multiple Sources (HW, MEO, WL), pp. 375–382.
- CIKM-1999-YuMLWR #database #effectiveness #scalability
- Efficient and Effective Metasearch for a Large Number of Text Databases (CTY, WM, KLL, WW, NR), pp. 217–224.
- CIKM-1999-YuOE #scalability
- Simple QSF-Trees: An Efficient and Scalable Spatial Access Method (BY, RO, MWE), pp. 5–14.
- ICML-1999-KimuraK #linear
- Efficient Non-Linear Control by Combining Q-learning with Local Linear Controllers (HK, SK), pp. 210–219.
- ICML-1999-LentL #learning
- Learning Hierarchical Performance Knowledge by Observation (MvL, JEL), pp. 229–238.
- KDD-1999-AyanTA #algorithm #scalability
- An Efficient Algorithm to Update Large Itemsets with Early Pruning (NFA, AUT, MEA), pp. 287–291.
- KDD-1999-DongL #difference #mining #roadmap
- Efficient Mining of Emerging Patterns: Discovering Trends and Differences (GD, JL), pp. 43–52.
- KDD-1999-KellyHA #classification
- The Impact of Changing Populations on Classifier Performance (MGK, DJH, NMA), pp. 367–371.
- KDD-1999-LarsenA #clustering #documentation #effectiveness #linear #mining #using
- Fast and Effective Text Mining Using Linear-Time Document Clustering (BL, CA), pp. 16–22.
- KDD-1999-ProvostJO
- Efficient Progressive Sampling (FJP, DJ, TO), pp. 23–32.
- KDD-1999-ZhangRL #database #estimation #kernel #scalability #using
- Fast Density Estimation Using CF-Kernel for Very Large Databases (TZ, RR, ML), pp. 312–316.
- KDD-T-1999-ElderR
- Combining Estimators to Improve Performance (JFEI, GR), pp. 237–265.
- SIGIR-1999-FrenchPCVEPM #algorithm #database
- Comparing the Performance of Database Selection Algorithms (JCF, ALP, JPC, CLV, TE, KJP, YM), pp. 238–245.
- SIGIR-1999-Ribeiro-NetoMNZ #algorithm #distributed
- Efficient Distributed Algorithms to Build Inverted Files (BARN, ESdM, MSN, NZ), pp. 105–112.
- UML-1999-Kahkipuro #distributed #framework #modelling #object-oriented #uml
- UML Based Performance Modeling Framework for Object-Oriented Distributed Systems (PK), pp. 356–371.
- OOPSLA-1999-AgesenDGKRW #implementation #ubiquitous
- An Efficient Meta-Lock for Implementing Ubiquitous Synchronization (OA, DD, AG, RK, YSR, DW), pp. 207–222.
- OOPSLA-1999-ChambersC #multi
- Efficient Multiple and Predicated Dispatching (CC, WC), pp. 238–255.
- OOPSLA-1999-IsmailH #evaluation #mobile #paradigm
- A Performance Evaluation of the Mobile Agent Paradigm (LI, DH), pp. 306–313.
- TOOLS-EUROPE-1999-Lippman #c++
- Efficiency in C++ (SBL), p. 414.
- TOOLS-USA-1999-ColletR #constraints #ocl #towards
- Towards Efficient Support for Executing the Object Constraint Language (PC, RR), p. 399–?.
- TOOLS-USA-1999-FosterNMF #mobile #workflow
- Performance Tuning Mobile Agent Workflow Applications (SSF, BAN, DM, MJF), pp. 8–17.
- AdaEurope-1999-Jimenez-PerisPBA #parallel #thread
- Efficient and Extensible Multithreaded Remote Servers (RJP, MPM, FJB, SA), pp. 91–102.
- GCSE-1999-FriedrichPSSS #design pattern #object-oriented
- Efficient Object-Oriented Software with Design Patterns (MF, HP, WSP, OS, US), pp. 79–90.
- PADL-1999-SilvaDBC #architecture #logic programming #parallel #parametricity
- The Influence of Architectural Parameters on the Performance of Parallel Logic Programming Systems (MGS, IdCD, RB, VSC), pp. 122–136.
- PEPM-1999-HuTI #named #parallel #source code
- Diffusion: Calculating Efficient Parallel Programs (ZH, MT, HI), pp. 85–94.
- PLDI-1999-DingK #runtime
- Improving Cache Performance in Dynamic Applications through Data and Computation Reorganization at Run Time (CD, KK), pp. 229–241.
- PLDI-1999-Frigo #compilation #fourier
- A Fast Fourier Transform Compiler (MF), pp. 169–180.
- PLDI-1999-MarletCB #for free #incremental #runtime
- Efficient Incremental Run-Time Specialization for Free (RM, CC, PB), pp. 281–292.
- PLDI-1999-RaoP #embedded #optimisation
- Storage Assignment Optimizations to Generate Compact and Efficient Code on Embedded DSPs (AR, SP), pp. 128–138.
- SAS-1999-RuthingKS #detection #precise
- Detecting Equalities of Variables: Combining Efficiency with Precision (OR, JK, BS), pp. 232–247.
- Best-of-PLDI-1999-Frigo99a #compilation #fourier
- A fast Fourier transform compiler (with retrospective) (MF), pp. 642–655.
ESEC-FSE-1999-GyimothyBF #debugging #slicing- An Efficient Relevant Slicing Method for Debugging (TG, ÁB, IF), pp. 303–321.
- ESEC-FSE-1999-LiangH #points-to #program analysis
- Efficient Points-to Analysis for Whole-Program Analysis (DL, MJH), pp. 199–215.
- ESEC-FSE-1999-NaumovichAC #algorithm #concurrent #java #source code
- An Efficient Algorithm for Computing MHP Information for Concurrent Java Programs (GN, GSA, LAC), pp. 338–354.
- ICSE-1999-ChanABJNW #model checking
- Decoupling Synchronization from Local Control for Efficient Symbolic Model Checking of Statecharts (WC, RJA, PB, DHJ, DN, WEW), pp. 142–151.
- ICSE-1999-NishimatsuJKI #slicing
- Call-Mark Slicing: An Efficient and Economical Way of Reducing Slice (AN, MJ, SK, KI), pp. 422–431.
- SAC-1999-DumitrescuL #coordination #matrix #reliability
- Reliable and Efficient Matrix Processing with the Specification-Consistent Coordination Model (RAD, EFAL), pp. 191–193.
- SAC-1999-KocberberC #information retrieval #multi
- Compressed Multi-Framed Signature Files: An Index Structure for Fast Information Retrieval (SK, FC), pp. 221–226.
- SAC-1999-PatnaikMHHP
- Improving the Performance of Lineage Tracing in Data Warehouse (SP, MM, BH, JH, BP), pp. 210–215.
- SAC-1999-SonahI #adaptation #evaluation
- Performance Evaluation of New Adaptive Object Replacement Techniques for VOD Systems (BS, MRI), pp. 437–442.
- CC-1999-AycockH #glr #parsing
- Faster Generalized LR Parsing (JA, RNH), pp. 32–46.
- CC-1999-ZhangGRG #pipes and filters
- Efficient State-Diagram Construction Methods for Software Pipelining (CZ, RG, SR, GRG), pp. 153–167.
- DAC-1999-ClementHLRCP #design #multi #prototype
- Fast Prototyping: A System Design Flow Applied to a Complex System-on-Chip Multiprocessor Design (BC, RH, EL, BR, PC, FP), pp. 420–424.
- DAC-1999-CongHX
- Technology Mapping for FPGAs with Nonuniform Pin Delays and Fast Interconnections (JC, YYH, SX), pp. 373–378.
- DAC-1999-CongLW #clustering #optimisation
- Simultaneous Circuit Partitioning/Clustering with Retiming for Performance Optimization (JC, HL, CW), pp. 460–465.
- DAC-1999-DasdanIG #algorithm #problem
- Efficient Algorithms for Optimum Cycle Mean and Optimum Cost to Time Ratio Problems (AD, SI, RKG), pp. 37–42.
- DAC-1999-FengPNKW #approach
- Efficient Computation of Quasi-Periodic Circuit Operating Conditions via a Mixed Frequency/Time Approach (DF, JRP, KN, KSK, JW), pp. 635–640.
- DAC-1999-HadjiyiannisRD #architecture #evaluation
- A Methodology for Accurate Performance Evaluation in Architecture Exploration (GH, PR, SD), pp. 927–932.
- DAC-1999-JandhyalaSBC #adaptation
- Efficient Capacitance Computation for Structures with Non-Uniform Adaptive Surface Meshes (VJ, SS, JEB, ZJC), pp. 543–548.
- DAC-1999-JiangC #analysis #power management
- Analysis of Performance Impact Caused by Power Supply Noise in Deep Submicron Devices (YMJ, KTC), pp. 760–765.
- DAC-1999-JiangJC #optimisation
- Noise-Constrained Performance Optimization by Simultaneous Gate and Wire Sizing Based on Lagrangian Relaxation (IHRJ, JYJ, YWC), pp. 90–95.
- DAC-1999-JohnsonSR #using
- Leakage Control with Efficient Use of Transistor Stacks in Single Threshold CMOS (MCJ, DS, KR), pp. 442–445.
- DAC-1999-KinLMP #design
- Power Efficient Mediaprocessors: Design Space Exploration (JK, CL, WHMS, MP), pp. 321–326.
- DAC-1999-KrasnickiPRC #named #synthesis
- MAELSTROM: Efficient Simulation-Based Synthesis for Custom Analog Cells (MK, RP, RAR, LRC), pp. 945–950.
- DAC-1999-LakshminarayanaRKJD #optimisation
- Common-Case Computation: A High-Level Technique for Power and Performance Optimization (GL, AR, KSK, NKJ, SD), pp. 56–61.
- DAC-1999-LiuPF #scheduling
- Maximizing Performance by Retiming and Clock Skew Scheduling (XL, MCP, EGF), pp. 231–236.
- DAC-1999-LiWW #approach #equation #generative #modelling
- An Efficient Lyapunov Equation-Based Approach for Generating Reduced-Order Models of Interconnect (JRL, FW, JW), pp. 1–6.
- DAC-1999-PerkowskiMGBM #algorithm #evaluation #graph
- Graph Coloring Algorithms for Fast Evaluation of Curtis Decompositions (MAP, RM, SG, MB, AM), pp. 225–230.
- DAC-1999-RestleRW #design
- Dealing with Inductance in High-Speed Chip Design (PR, AER, SGW), pp. 904–909.
- DAC-1999-SantosJ #order
- A Reordering Technique for Efficient Code Motion (LCVdS, JAGJ), pp. 296–299.
- DAC-1999-Sheehan #equation #named #order #reduction #using
- ENOR: Model Order Reduction of RLC Circuits Using Nodal Equations for Efficient Factorization (BNS), pp. 17–21.
- DAC-1999-StevensRBCGKR
- CAD Directions for High Performance Asynchronous Circuits (KSS, SR, SMB, JC, RG, MK, MR), pp. 116–121.
- DAC-1999-TauschW #multi
- A Multiscale Method for Fast Capacitance Extraction (JT, JKW), pp. 537–542.
- DATE-1999-BuhlerPKB #approach #process #simulation #using
- Efficient Switching Activity Simulation under a Real Delay Model Using a Bitparallel Approach (MB, MP, KK, UGB), p. 459–?.
- DATE-1999-CostaSC #modelling
- Efficient Techniques for Accurate Extraction and Modeling of Substrate Coupling in Mixed-Signal IC’s (JPC, LMS, MC), pp. 396–400.
- DATE-1999-FeldmanKL #modelling
- Efficient Techniques for Modeling Chip-Level Interconnect, Substrate and Package Parasitics (PF, SK, DEL), pp. 418–417.
- DATE-1999-KallaC #equivalence
- Performance Driven Resynthesis by Exploiting Retiming-Induced State Register Equivalence (PK, MJC), pp. 638–642.
- DATE-1999-LauwersG #estimation
- A Power Estimation Model for High-Speed CMOS A/D Converters (EL, GGEG), pp. 401–405.
- DATE-1999-LechnerFRH #automation #self
- A Digital Partial Built-In Self-Test for a High Performance Automatic Gain Control Circuit (AL, JF, AR, BH), pp. 232–238.
- DATE-1999-MaurerS #simulation
- Software Bit-Slicing: A Technique for Improving Simulation Performance (PMM, WJS), pp. 786–787.
- DATE-1999-MeinelS #model checking #order
- Increasing Efficiency of Symbolic Model Checking by Accelerating Dynamic Variable Reordering (CM, CS), pp. 760–761.
- DATE-1999-MukherjeeJTFAF #approach #verification
- An Efficient Filter-Based Approach for Combinational Verification (RM, JJ, KT, MF, JAA, DSF), pp. 132–137.
- DATE-1999-NicoliciA #hardware
- Efficient BIST Hardware Insertion with Low Test Application Time for Synthesized Data Paths (NN, BMAH), p. 289–?.
- DATE-1999-Nunez-AldanaV #effectiveness #synthesis
- An Analog Performance Estimator for Improving the Effectiveness of CMOS Analog Systems Circuit Synthesis (ANA, RV), pp. 406–411.
- DATE-1999-OchiaiINEO #embedded #framework #platform #video
- High-speed Software-based Platform for Embedded Software of a Single-chip MPEG-2 Video Encoder LSI with HDTV Scalabilit (KO, HI, JN, ME, TO), pp. 303–308.
- DATE-1999-PaschalisKPGZ #architecture #effectiveness #multi
- An Effective BIST Architecture for Fast Multiplier Cores (AMP, NK, MP, DG, YZ), pp. 117–121.
- DATE-1999-ReutterR #design #reuse
- An Efficient Reuse System for Digital Circuit Design (AR, WR), pp. 38–43.
- DATE-1999-ScherberM #flexibility #modelling #simulation
- An Efficient and Flexible Methodology for Modelling and Simulation of Heterogeneous Mechatronic Systems (SS, CMS), pp. 784–785.
- DATE-1999-TabbaraSSFL #modelling #using
- Fast Hardware-Software Co-simulation Using VHDL Models (BT, MS, ALSV, EF, LL), p. 309–?.
- DATE-1999-ToulouseBLN #3d #modelling
- Efficient 3D Modelling for Extraction of Interconnect Capacitances in Deep Submicron Dense Layouts (AT, DB, CL, PN), pp. 576–580.
- DATE-1999-Troster #co-evolution #design
- Potentials of Chip-Package Co-Design for High-Speed Digital Applications (GT), pp. 423–422.
- DATE-1999-WeissSR #embedded #operating system #realtime #using
- Emulation of a Fast Reactive Embedded System using a Real Time Operating System (KW, TS, WR), pp. 764–765.
- DATE-1999-WuGR #approach #fault #reduction
- A Fault List Reduction Approach for Efficient Bridge Fault Diagnosis (JW, GSG, EMR), pp. 780–781.
- DATE-1999-YangZ #fault #robust #simulation
- Fast, Robust DC and Transient Fault Simulation for Nonlinear Analog Circuits (ZRY, MZ), pp. 244–248.
- HPCA-1999-BilasJZS #approach #memory management
- Limits to the Performance of Software Shared Memory: A Layered Approach (AB, DJ, YZ, JPS), pp. 193–202.
- HPCA-1999-BrooksM
- Dynamically Exploiting Narrow Width Operands to Improve Processor Power and Performance (DMB, MM), pp. 13–22.
- HPCA-1999-CoxLHZ #comparison #consistency #lazy evaluation #memory management #protocol
- A Performance Comparison of Homeless and Home-Based Lazy Release Consistency Protocols in Software Shared Memory (ALC, EdL, YCH, WZ), pp. 279–283.
- HPCA-1999-GatlinC #memory management
- Memory Hierarchy Considerations for Fast Transpose and Bit-Reversals (KSG, LC), pp. 33–42.
- HPCA-1999-KaxirasG #predict #using
- Improving CC-NUMA Performance Using Instruction-Based Prediction (SK, JRG), pp. 161–170.
- HPCA-1999-MartinezLD #concurrent #detection
- Impact of Buffer Size on the Efficiency of Deadlock Detection (JMM, PL, JD), pp. 315–318.
- HPCA-1999-MichaelN #design #memory management #multi #scalability
- Design and Performance of Directory Caches for Scalable Shared Memory Multiprocessors (MMM, AKN), pp. 142–151.
- HPCA-1999-PirvuBN
- The Impact of Link Arbitration on Switch Performance (MP, LNB, NN), pp. 228–235.
- HPCA-1999-VaidyaSD #adaptation #design #named
- LAPSES: A Recipe for High Performance Adaptive Router Design (ASV, AS, CRD), pp. 236–243.
- HPCA-1999-YangW #network
- Efficient All-to-All Broadcast in All-Port Mesh and Torus Networks (YY, JW), pp. 290–299.
- HPDC-1999-AkarsuFHKKSY #using
- Using Gateway System to Provide a Desktop Access to High Performance Computational Resources (EA, GF, TH, AK, KSK, PS, CHY), pp. 294–298.
- HPDC-1999-ButlerCS #corba
- A Performance Broker for CORBA (KB, MJC, QS), pp. 19–26.
- HPDC-1999-ChoudharyKNNSTMT #data transformation #distributed #scalability
- Data Management for Large-Scale Scientific Computations in High Performance Distributed Systems (ANC, MTK, HSN, JN, XS, VET, SM, RT), pp. 263–272.
- HPDC-1999-ClementSJW
- High Performance Phylogenetic Inference (MJC, QS, GJ, MW), pp. 335–336.
- HPDC-1999-ImaiSIK #corba #named #network
- CrispORB: High Performance CORBA for System Area Network (YI, TS, TI, MK), pp. 11–18.
- HPDC-1999-RosePASSWR #approach #distributed #parallel #visualisation
- An Approach to Immersive Performance Visualization of Parallel and Wide-Area Distributed Applications (LDR, MP, RAA, ES, BS, SW, DAR), pp. 247–254.
- HPDC-1999-SchnaidtHFKJ #adaptation #independence #message passing #monitoring
- Passive, Domain-Independent, End-to-End Message Passing Performance Monitoring to Support Adaptive Applications in MSHN (MCS, DAH, JF, TK, DSJ), pp. 337–338.
- HPDC-1999-TakefusaMNAN #algorithm #evaluation #overview #scheduling
- Overview of a Performance Evaluation System for Global Computing Scheduling Algorithms (AT, SM, HN, KA, UN), pp. 97–104.
- HPDC-1999-VillacisGSWBDTGB #architecture #component #distributed #grid #named #tool support
- CAT: A High Performance Distributed Component Architecture Toolkit for the Grid (JEV, MG, DS, AW, FB, PD, BT, DG, RB), pp. 125–132.
- HPDC-1999-ZotkinK #estimation
- Job-Length Estimation and Performance in Backfilling Schedulers (DNZ, PJK), pp. 236–243.
- LCTES-1999-RyuPKSH #embedded #re-engineering #realtime
- Performance Re-engineering of Embedded Real-Time Systems (MR, JP, KK, YS, SH), pp. 80–86.
- OSDI-1999-Cota-RoblesH #comparison #latency
- A Comparison of Windows Driver Model Latency Performance on Windows NT and Windows 98 (ECR, JPH), pp. 159–172.
- PDP-1999-AllisonBS #architecture #network
- A replicated resource architecture for high performance network service (CA, MB, JS), pp. 105–111.
- PDP-1999-CarrionBG #algorithm #evaluation
- Performance evaluation of the bubble algorithm: benefits for k-ary n-cubes (CC, RB, JÁG), pp. 349–356.
- PDP-1999-CortesRSPL #algorithm #nearest neighbour #on the #parallel
- On the performance of nearest-neighbors load balancing algorithms in parallel systems (AC, AR, MÀS, PP, EL), pp. 170–177.
- PDP-1999-DoalloFZ #matrix #modelling
- Direct mapped cache performance modeling for sparse matrix operations (RD, BBF, ELZ), pp. 331–338.
- PDP-1999-FraboulM #analysis #architecture #composition #modelling #realtime
- Modeling advanced modular avionics architectures for early real-time performance analysis (CF, FM), pp. 181–188.
- PDP-1999-Gennaro #bound #clustering #modelling
- Performance models for I/O bound SPMD applications on clusters of workstations (CG), pp. 263–270.
- PDP-1999-GerndtMPW #analysis
- Performance analysis on CRAY T3E (MG, BM, MP, FW), pp. 241–248.
- PDP-1999-GetovWCG #kernel #optimisation
- Performance optimisations of the NPB FT kernel by special-purpose unroller (VG, YW, LC, KSG), pp. 84–88.
- PPoPP-1999-BagrodiaDDP #parallel #predict #scalability #simulation #using
- Performance Prediction of Large Parallel Applications using Parallel Simulations (RB, ED, SD, TP), pp. 151–162.
- PPoPP-1999-MaassenNVBP #implementation #java
- An Efficient Implementation of Java’s Remote Method Invocation (JM, RvN, RV, HEB, AP), pp. 173–182.
- PPoPP-1999-MainwaringC #challenge #communication #design #network
- Design Challenges of Virtual Networks: Fast, General-Purpose Communication (AMM, DEC), pp. 119–130.
- PPoPP-1999-SubhlokLL #automation #network
- Automatic Node Selection for High Performance Applications on Networks (JS, PL, BL), pp. 163–172.
- SOSP-1999-AronD #network
- Soft timers: efficient microsecond software timer support for network processing (MA, PD), pp. 232–246.
- SOSP-1999-ChiuehVP #segmentation
- Integrating segmentation and paging protection for safe, efficient and transparent software extensions (TcC, GV, PP), pp. 140–153.
- SOSP-1999-SaitoBL #clustering #scalability
- Manageability, Availability and Performance in Porcupine: A Highly Scalable, Cluster-based Mail Service (YS, BNB, HML), pp. 1–15.
- SOSP-1999-SchmidtLN #architecture #interactive
- The interactive performance of SLIM: a stateless, thin-client architecture (BKS, MSL, JDN), pp. 32–47.
- SOSP-1999-ShapiroSF #named
- EROS: a fast capability system (JSS, JMS, DJF), pp. 170–185.
- SOSP-1999-WolmanVSCKL #on the #web
- On the scale and performance of cooperative Web proxy caching (AW, GMV, NS, NC, ARK, HML), pp. 16–31.
- FASE-1999-AttanasioCI #realtime #specification
- Yet Another Real-Time Specification for the Steam Boiler: Local Clocks to Statically Measure Systems Performance (CA, FC, PI), pp. 45–59.
- FASE-1999-NottegarPD #evaluation #semantics
- Semantic-Driven Performance Evaluation (CN, CP, PD), pp. 204–218.
- STOC-1999-ErgunKR #approximate
- Fast Approximate PCPs (FE, RK, RR), pp. 41–50.
- STOC-1999-GuhaMNS
- Efficient Recovery from Power Outage (SG, AM, JN, BS), pp. 574–582.
- STOC-1999-Kapoor
- Efficient Computation of Geodesic Shortest Paths (SK), pp. 770–779.
- STOC-1999-LovaszK
- Faster Mixing via Average Conductance (LL, RK), pp. 282–287.
- STOC-1999-OlshevskyS #algebra #approach #geometry
- A Displacement Approach to Efficient Decoding of Algebraic-Geometric Codes (VO, MAS), pp. 235–244.
- STOC-1999-ScheidelerV #protocol
- From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols (CS, BV), pp. 215–224.
- CADE-1999-HillenbrandJL
- System Description: Waldmeister — Improvements in Performance and Ease of Use (TH, AJ, BL), pp. 232–236.
- CAV-1999-BehrmannLPWY #analysis #diagrams #difference #reachability #using
- Efficient Timed Reachability Analysis Using Clock Difference Diagrams (GB, KGL, JP, CW, WY), pp. 341–353.
- CAV-1999-BloemRS #linear #logic #model checking
- Efficient Decision Procedures for Model Checking of Linear Time Logic Properties (RB, KR, FS), pp. 222–235.
- CAV-1999-HermannsMS #analysis #composition #markov #modelling #named #specification
- TIPPtool: Compositional Specification and Analysis of Markovian Performance Models (HH, VM, MS), pp. 487–490.
- CAV-1999-NamjoshiK #analysis
- Efficient Analysis of Cyclic Definitions (KSN, RPK), pp. 394–405.
- IWTCS-1999-CsurgayM #design #testing
- Performance Testing at Early Design Phases (PC, MM), pp. 317–330.
- IWTCS-1999-ProbertW #functional #generative #testing #using
- Fast Functional Test Generation Using an SDL Model (RLP, AWW), pp. 299–316.
- ADL-1998-GeffnerAASL #library
- Smart Indexes for Efficient Browsing of Library Collections (SG, DA, AEA, TRS, ML), pp. 107–116.
- DL-1998-FrenchC #distributed #library
- Efficient Searching in Distributed Digital Libraries (JCF, ALP, WRCI), pp. 283–284.
- DL-1998-Ribeiro-NetoB #distributed #library #query
- Query Performance for Tightly Coupled Distributed Digital Libraries (BARN, RAB), pp. 182–190.
- PODS-1998-AgarwalAEFV #constraints #linear
- Efficient Searching with Linear Constraints (PKA, LA, JE, PGF, JSV), pp. 169–178.
- SIGMOD-1998-GuhaRS #algorithm #clustering #database #named #scalability
- CURE: An Efficient Clustering Algorithm for Large Databases (SG, RR, KS), pp. 73–84.
- SIGMOD-1998-KabraD #execution #query
- Efficient Mid-Query Re-Optimization of Sub-Optimal Query Execution Plans (NK, DJD), pp. 106–117.
- SIGMOD-1998-LometW #information management
- Efficient and Transparent Application Recovery in Client-Server Information Systems (DBL, GW), pp. 460–471.
- VLDB-1998-BaulierBGJGKKMMNNRSS #in memory #named
- DataBlitz: A High Performance Main-Memory Storage Manager (JB, PB, SG, SJ, CG, AK, HFK, PM, JM, PPSN, MN, RR, AS, SS), p. 701.
- VLDB-1998-GehrkeRG #dataset #framework #named #scalability
- RainForest — A Framework for Fast Decision Tree Construction of Large Datasets (JG, RR, VG), pp. 416–427.
- VLDB-1998-JohnsonM #metric
- Performance Measurements of Tertiary Storage Devices (TJ, ELM), pp. 50–61.
- VLDB-1998-KornLKF #data mining #mining #paradigm
- Ratio Rules: A New Paradigm for Fast, Quantifiable Data Mining (FK, AL, YK, CF), pp. 582–593.
- VLDB-1998-MuthOPW #data access #design #implementation
- Design, Implementation, and Performance of the LHAM Log-Structured History Data Access Method (PM, PEO, AP, GW), pp. 452–463.
- VLDB-1998-OoiGT #database #semistructured data
- Fast High-Dimensional Data Search in Incomplete Databases (BCO, CHG, KLT), pp. 357–367.
- VLDB-1998-RezendeH #case study #database #experience #middleware #problem
- The Heterogeneity Problem and Middleware Technology: Experiences with and Performance of Database Gateways (FdFR, KH), pp. 146–157.
- VLDB-1998-WeberSB #analysis
- A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces (RW, HJS, SB), pp. 194–205.
- ITiCSE-1998-FarthingJM #multi
- Permutational multiple-choice questions: an objective and efficient alternative to essay-type examination questions (DWF, DMJ, DM), pp. 81–85.
- PASTE-1998-NaumovichCO #analysis #concurrent #data flow #source code
- Efficient Composite Data Flow Analysis Applied to Concurrent Programs (GN, LAC, LJO), pp. 51–58.
- PASTE-1998-WadellA #higher-order #source code #visualisation
- Visualizing the Performance of Higher-Order Programs (OW, JMA), pp. 75–82.
- ICALP-1998-BazganST #algorithm #approximate #problem #similarity
- Efficient Approximation Algorithms for the Subset-Sums Equality Problem (CB, MS, ZT), pp. 387–396.
- ICALP-1998-DamgardP #interactive
- Sequential Iteration of Interactive Arguments and an Efficient Zero-Knowledge Argument for NP (ID, BP), pp. 772–783.
- ICALP-1998-Hagerup #ram
- Simpler and Faster Dictionaries on the AC0 RAM (TH), pp. 79–90.
- ICALP-1998-KaoW #fault
- Efficient Minimization of Numerical Summation Errors (MYK, JW), pp. 375–386.
- ICALP-1998-PetersenR #queue #simulation
- Efficient Simulations by Queue Machines (HP, JMR), pp. 884–895.
- ICALP-1998-Zakharov #approach #decidability #equivalence #source code
- An Efficient and Unified Approach to the Decidability of Equivalence of Propositional Programs (VAZ), pp. 247–258.
- WIA-1998-Watson #algorithm
- A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs (BWW), pp. 121–132.
- IFL-1998-Assmann #coordination #implementation #process
- Performance Results for an Implementation of the Process Coordination Language K2 (CA), pp. 1–19.
- IFL-1998-KoopmanP #combinator #parsing
- Efficient Combinator Parsers (PWMK, MJP), pp. 120–136.
- TAGT-1998-PetriuW #design pattern #graph transformation #modelling
- Deriving Software Performance Models from Architectural Patterns by Graph Transformations (DCP, XW), pp. 475–488.
- TAGT-1998-Rudolf #constraints #graph #pattern matching
- Utilizing Constraint Satisfaction Techniques for Efficient Graph Pattern Matching (MR), pp. 238–251.
- CHI-1998-BhavnaniJ
- Delegation and Circumvention: Two Faces of Efficiency (SKB, BEJ), pp. 273–280.
- CHI-1998-Masui
- An Efficient Text Input Method for Pen-Based Computers (TM), pp. 328–335.
- CSCW-1998-FussellKLSMC #communication #coordination
- Coordination, Overload and Team Performance: Effects of Team Communication Strategies (SRF, REK, FJL, WLS, MMM, JJC), pp. 275–284.
- ACIR-1998-Lazarinis #information management #information retrieval
- Combining Information Retrieval with Information Extraction for Efficient Retrieval of Calls for Papers (FL).
- ACIR-1998-OunisP #concept #effectiveness #graph #query #relational #using
- Effective and Efficient Relational Query Processing Using Conceptual Graphs (IO, MP).
- ACIR-1998-SmeatonBCQ #architecture #clustering #documentation #retrieval
- An Architecture for Efficient Document Clustering and Retrieval on a Dynamic Collection of Newspaper Texts (AFS, MB, FC, GQ).
- CIKM-1998-HsuC #database #music
- Efficient Repeating Pattern Finding in Music Databases (JLH, ALPC), pp. 281–288.
- CIKM-1998-KimC #clustering #query
- Sibling Clustering of Tree-Based Spatial Indexes for Efficient Spatial Query Processing (KK, SKC), pp. 398–405.
- CIKM-1998-PitouraF #mobile
- An Efficient Hierarchical Scheme for Locating Highly Mobile Users (EP, IF), pp. 218–225.
- CIKM-1998-QuWW #multi
- Supporting Fast Search in Time Series for Movement Patterns in Multiple Scales (YQ, CW, XSW), pp. 251–258.
- CIKM-1998-Tang #incremental #using
- Using Incremental Pruning to Increase the Efficiency of Dynamic Itemset Counting for Association Rules (JT), pp. 273–280.
- CIKM-1998-Zaki #sequence
- Efficient Enumeration of Frequent Sequences (MJZ), pp. 68–75.
- ICML-1998-FreundISS #algorithm
- An Efficient Boosting Algorithm for Combining Preferences (YF, RDI, RES, YS), pp. 170–178.
- ICML-1998-FriessCC #algorithm #kernel #learning
- The Kernel-Adatron Algorithm: A Fast and Simple Learning Procedure for Support Vector Machines (TTF, NC, CC), pp. 188–196.
- ICML-1998-KearnsM #algorithm #bottom-up
- A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization (MJK, YM), pp. 269–277.
- ICML-1998-PiaterCZA #random
- A Randomized ANOVA Procedure for Comparing Performance Curves (JHP, PRC, XZ, MA), pp. 430–438.
- ICPR-1998-ChenC #network #recursion #representation
- Recursive representation and progressive display of binary objects for efficient network browsing (IPC, ZC), pp. 395–399.
- ICPR-1998-CordellaFSTV #algorithm #evaluation #graph
- Graph matching: a fast algorithm and its evaluation (LPC, PF, CS, FT, MV), pp. 1582–1584.
- ICPR-1998-HaindlZ #image #segmentation
- Fast segmentation of planar surfaces in range images (MH, PZ), pp. 985–987.
- ICPR-1998-HofmanJ #analysis #approach #clustering #robust #using
- Robust and efficient cluster analysis using a shared near neighbours approach (IH, RAJ), pp. 243–247.
- ICPR-1998-JuanVA #algorithm #approximate #nearest neighbour
- Fast k-nearest-neighbours searching through extended versions of the approximating and eliminating search algorithm (AESA) (AJ, EV, PA), pp. 828–830.
- ICPR-1998-LamIL #algorithm
- Approaches to decompose flat structuring element for fast overlapping search morphological algorithm (RWKL, HHSI, CKL), pp. 1461–1463.
- ICPR-1998-LashkiaA #classification
- Test feature classifiers: performance and application (VL, SA), pp. 341–343.
- ICPR-1998-LiuD #algorithm #evaluation #recognition
- Performance evaluation of graphics recognition algorithms: principles and applications (WL, DD), pp. 1180–1182.
- ICPR-1998-MatsuoNI #distributed #evaluation #image
- A distributed image processing environment VIOS III and it’s performance evaluation (HM, KN, AI), pp. 1538–1542.
- ICPR-1998-MoghaddamJP #ml #recognition #similarity #visual notation
- Efficient MAP/ML similarity matching for visual recognition (BM, TJ, AP), pp. 876–881.
- ICPR-1998-MyersWH #distance #edit distance #relational
- Efficient relational matching with local edit distance (RM, RCW, ERH), pp. 1711–1714.
- ICPR-1998-NieuwoudtB #classification #using
- Relative performance of correlation-based and feature-based classifiers of aircraft using radar range profiles (CN, ECB), pp. 1828–1832.
- ICPR-1998-PalauS #approximate #classification #nearest neighbour
- The labelled cell classifier: a fast approximation to k nearest neighbors (AMP, RRS), pp. 823–827.
- ICPR-1998-SegenK #3d #gesture #interface #recognition
- Fast and accurate 3D gesture recognition interface (JS, SK), pp. 86–91.
- ICPR-1998-ShahA #architecture #classification #hybrid #reasoning
- A hybrid architecture for performance reasoning in classification systems (SS, JKA), pp. 326–330.
- ICPR-1998-ShearerVB #algorithm #video
- An efficient least common subgraph algorithm for video indexing (KS, SV, HB), pp. 1241–1243.
- ICPR-1998-Szira #image #preprocessor
- Anisotropic diffusion as a preprocessing step for efficient image compression (TS, IK, BPT), pp. 1565–1567.
- ICPR-1998-TakacsW #image #library #metric #using
- Fast searching of digital face libraries using binary image metrics (BT, HW), pp. 1235–1237.
- ICPR-1998-TominagaKMK #detection #using
- Realization of an efficient line detection by askant glance camera vision system using extended Hough transform (MT, KK, KM, HK), pp. 225–228.
- ICPR-1998-WernerPH #visualisation
- Efficient rendering of projective model for image-based visualization (TW, TP, VH), pp. 1705–1707.
- ICPR-1998-ZhangB98a #adaptation #representation
- An efficient surface mesh representation adaptive to local smoothness (ZZ, MB), pp. 1555–1557.
- KDD-1998-AndersonM #learning
- ADtrees for Fast Counting and for Fast Learning of Association Rules (BSA, AWM), pp. 134–138.
- KDD-1998-DuMouchelS #algorithm #detection #testing
- A Fast Computer Intrusion Detection Algorithm Based on Hypothesis Testing of Command Transition Probabilities (WD, MS), pp. 189–193.
- KDD-1998-GraefeFC #classification #database #on the #scalability #sql #statistics
- On the Efficient Gathering of Sufficient Statistics for Classification from Large SQL Databases (GG, UMF, SC), pp. 204–208.
- KDD-1998-HinneburgK #approach #clustering #database #multi #scalability
- An Efficient Approach to Clustering in Large Multimedia Databases with Noise (AH, DAK), pp. 58–65.
- KDD-1998-JohnsonKN #2d
- Fast Computation of 2-Dimensional Depth Contours (TJ, IK, RTN), pp. 224–228.
- KDD-1998-KellyHA #data mining #mining
- Defining the Goals to Optimise Data Mining Performance (MGK, DJH, NMA), pp. 234–238.
- KDD-1998-KeoghP #classification #clustering #feedback #representation
- An Enhanced Representation of Time Series Which Allows Fast and Accurate Classification, Clustering and Relevance Feedback (EJK, MJP), pp. 239–243.
- KDD-1998-MacskassyBDH #case study #clustering #web
- Human Performance on Clustering Web Pages: A Preliminary Study (SAM, AB, BDD, HH), pp. 264–268.
- KDD-1998-Rosset #classification #comparison #evaluation #flexibility #named #ranking
- Ranking — Methods for Flexible Evaluation and Efficient Comparison of Classification Performance (SR), pp. 324–328.
- KDD-1998-SteegRW #correlation #detection #higher-order #multi
- Coincidence Detection: A Fast Method for Discovering Higher-Order Correlations in Multidimensional Data (EWS, DAR, EW), pp. 112–120.
- KR-1998-MuscettolaMT #execution
- Reformulating Temporal Plans for Efficient Execution (NM, PHM, IT), pp. 444–452.
- SIGIR-1998-BorlundI #information retrieval #interactive #metric
- Measures of Relative Relevance and Ranked Half-Life: Performance Indicators for Interactive IR (PB, PI), pp. 324–331.
- SIGIR-1998-ChiaramellaMMOP #image #retrieval #towards
- Towards a Fast Precision-Oriented Image Retrieval System (YC, PM, MM, IO, MP), pp. 383–384.
- SIGIR-1998-CormackPC #scalability
- Efficient Construction of Large Test Collections (GVC, CRP, CLAC), pp. 282–289.
- SIGIR-1998-KekalainenJ #query #retrieval
- The Impact of Query Structure and Query Expansion on Retrieval Performance (JK, KJ), pp. 130–137.
- SIGIR-1998-MouraNZB #fault
- Fast Searching on Compressed Text Allowing Errors (ESdM, GN, NZ, RABY), pp. 298–306.
- SIGIR-1998-TakakiK
- Efficient Search Server Assignment in a Disproportionate System Environment (TT, TK), pp. 375–376.
- SIGIR-1998-VogtC #information retrieval #predict
- Predicting the Performance of Linearly Combined IR Systems (CCV, GWC), pp. 190–196.
- SIGIR-1998-YamanaKKSY #parallel
- Fast Speculative Search Engine on the Highly Parallel Computer EM-X (HY, HK, YK, HS, YY), p. 390.
- TOOLS-PACIFIC-1998-MathewSH #bytecode #java
- Inter-Server Transport Performance of Java Bytecode in a Metacomputing Environment (JAM, AJS, KAH), p. 264–?.
- PLDI-1998-Adl-TabatabaiCLPS #code generation #compilation #effectiveness #java
- Fast, Effective Code Generation in a Just-In-Time Java Compiler (ARAT, MC, GYL, VMP, JMS), pp. 280–290.
- PLDI-1998-Clinger #recursion
- Proper Tail Recursion and Space Efficiency (WDC), pp. 174–185.
- PLDI-1998-YangUW #branch #order
- Improving Performance by Branch Reordering (MY, GRU, DBW), pp. 130–141.
- POPL-1998-DeFouwGC #analysis #interprocedural
- Fast Interprocedural Class Analysis (GD, DG, CC), pp. 222–236.
- ASE-1998-GoedickeMP #architecture #consistency #design #detection #evaluation #nondeterminism #on the
- On Detecting and Handling Inconsistencies in Integrating Software Architecture Design and Performance Evaluation (MG, TM, CP), pp. 188–191.
- ICSE-1998-BriandELF #benchmark #development #metric #simulation #using
- Using Simulation to Build Inspection Efficiency Benchmarks for Development Projects (LCB, KEE, OL, TF), pp. 340–349.
- SAC-1998-AhmedDR #fuzzy #graph #memory management #reuse #using
- Fast recall of reusable fuzzy plans using acyclic directed graph memory (MA, ED, DCR), pp. 272–276.
- SAC-1998-Li #evaluation #probability
- Performance evaluation of probabilistic tree embedding in cube-connected cycles (KL), pp. 584–592.
- SAC-1998-MerkleGL #algorithm #scalability #search-based
- Scalability of an MPI-based fast messy genetic algorithm (LDM, GHGJ, GBL), pp. 386–393.
- SAC-1998-RussellH #communication #kernel #reliability
- Efficient kernel support for reliable communication (RDR, PJH), pp. 541–550.
- SAC-1998-Sibai #multi
- Performance of the hyper-ring multicomputer (FNS), pp. 598–606.
- SAC-1998-WangW #adaptation #multi #optimisation
- Efficient and adaptive Lagrange-multiplier methods for continuous nonlinear optimization (TW, BWW), pp. 361–365.
- ASPLOS-1998-FuJLC #scheduling
- Value Speculation Scheduling for High Performance Processors (CyF, MDJ, SYL, TMC), pp. 262–271.
- ASPLOS-1998-RanganathanGAB #database
- Performance of Database Workloads on Shared-Memory Systems with Out-of-Order Processors (PR, KG, SVA, LAB), pp. 307–318.
- ASPLOS-1998-SchnarrL #simulation #using
- Fast Out-Of-Order Processor Simulation Using Memoization (ES, JRL), pp. 283–294.
- ASPLOS-1998-Temam #memory management
- Investigating Optimal Local Memory Performance (OT), pp. 218–227.
- ASPLOS-1998-VergheseGR #multi
- Performance Isolation: Sharing and Isolation in Shared-Memory Multiprocessors (BV, AG, MR), pp. 181–192.
- ASPLOS-1998-Weissman #approach #concurrent #locality #thread
- Performance Counters and State Sharing Annotations: a Unified Approach to Thread Locality (BW), pp. 127–138.
- CC-1998-BrouwerGP #analysis #automaton #finite #implementation
- Myths and Facts about the Efficient Implementation of Finite Automata and Lexical Analysis (KB, WG, EP), pp. 1–15.
- CC-1998-LelaitGE #algorithm
- A New Fast Algorithm for Optimal Register Allocation in Modulo Scheduled Loops (SL, GRG, CE), pp. 204–218.
- DAC-1998-AlbrechtNR #benchmark #design #embedded #estimation #metric
- HW/SW CoVerification Performance Estimation and Benchmark for a 24 Embedded RISC Core Design (TWA, JN, SR), pp. 808–811.
- DAC-1998-BauerBKV #configuration management #logic #simulation
- A Reconfigurable Logic Machine for Fast Event-Driven Simulation (JB, MB, IK, PV), pp. 668–671.
- DAC-1998-CarroN #adaptation #algorithm
- Efficient Analog Test Methodology Based on Adaptive Algorithms (LC, MN), pp. 32–37.
- DAC-1998-ChangC
- Efficient Boolean Division and Substitution (SCC, DIC), pp. 342–347.
- DAC-1998-CongM #design #multi
- Performance Driven Multi-Layer General Area Routing for PCB/MCM Designs (JC, PHM), pp. 356–361.
- DAC-1998-CongW
- Optimal FPGA Mapping and Retiming with Efficient Initial State Computation (JC, CW), pp. 330–335.
- DAC-1998-DrechslerDG
- Fast Exact Minimization of BDDs (RD, ND, WG), pp. 200–205.
- DAC-1998-El-MalehKR #learning
- A Fast Sequential Learning Technique for Real Circuits with Application to Enhancing ATPG Performance (AHEM, MK, JR), pp. 625–631.
- DAC-1998-FallahDK98a #functional #metric #named #test coverage #verification
- OCCOM: Efficient Computation of Observability-Based Code Coverage Metrics for Functional Verification (FF, SD, KK), pp. 152–157.
- DAC-1998-GhoshDJ #low cost #testing
- A Fast and Low Cost Testing Technique for Core-Based System-on-Chip (IG, SD, NKJ), pp. 542–547.
- DAC-1998-KalavadeM #embedded #estimation
- A Tool for Performance Estimation of Networked Embedded End-systems (AK, PM), pp. 257–262.
- DAC-1998-KirovskiP #graph #scalability
- Efficient Coloring of a Large Spectrum of Graphs (DK, MP), pp. 427–432.
- DAC-1998-Kung #algorithm #library #optimisation
- A Fast Fanout Optimization Algorithm for Near-Continuous Buffer Libraries (DSK), pp. 352–355.
- DAC-1998-LuoWA #functional #hybrid #simulation
- Hybrid Techniques for Fast Functional Simulation (YL, TW, AA), pp. 664–667.
- DAC-1998-Marantz #functional #re-engineering #verification
- Enhanced Visibility and Performance in Functional Verification by Reconstruction (JM), pp. 164–169.
- DAC-1998-MarquesKWS #3d #modelling
- A Mixed Nodal-Mesh Formulation for Efficient Extraction and Passive Reduced-Order Modeling of 3D Interconnects (NAM, MK, JW, LMS), pp. 297–302.
- DAC-1998-OrshanskyCH #simulation #statistics
- A Statistical Performance Simulation Methodology for VLSI Circuits (MO, JCC, CH), pp. 402–407.
- DAC-1998-OttenB
- Planning for Performance (RHJMO, RKB), pp. 122–127.
- DAC-1998-ShiLKY #3d #algorithm
- A Fast Hierarchical Algorithm for 3-D Capacitance Extraction (WS, JL, NK, TY), pp. 212–217.
- DAC-1998-SilvaYMCWJCVSM #data transfer #synthesis
- Efficient System Exploration and Synthesis of Applications with Dynamic Data Storage and Intensive Data Transfer (JLdSJ, CYC, MM, KC, SW, GGdJ, FC, DV, PS, HDM), pp. 76–81.
- DAC-1998-SunVJ #verification
- Fast State Verification (DS, BV, WJ), pp. 619–624.
- DAC-1998-VecianaJG #algorithm #constraints #probability
- Hierarchical Algorithms for Assessing Probabilistic Constraints on System Performance (GdV, MFJ, JHG), pp. 251–256.
- DAC-1998-WeiCJRD #design #optimisation
- Design and Optimization of Low Voltage High Performance Dual Threshold CMOS Circuits (LW, ZC, MJ, KR, VD), pp. 489–494.
- DAC-1998-WittenburgHKOBLKP #image #parallel #programmable
- Realization of a Programmable Parallel DSP for High Performance Image Processing Applications (JPW, WH, JK, MO, MB, HL, HK, PP), pp. 56–61.
- DAC-1998-XieB #classification #finite #markov
- Efficient State Classification of Finite State Markov Chains (AX, PAB), pp. 605–610.
- DAC-1998-ZhaoDKL #3d
- Efficient Three-Dimensional Extraction Based on Static and Full-Wave Layered Green’s Functions (JZ, WWMD, SK, DEL), pp. 224–229.
- DATE-1998-Catthoor #architecture #design #energy
- Energy-Delay Efficient Data Storage and Transfer Architectures: Circuit Technology versus Design Methodology Solutions (FC), pp. 709–714.
- DATE-1998-CostaCS #modelling #simulation
- Efficient Techniques for Accurate Modeling and Simulation of Substrate Coupling in Mixed-Signal IC’s (JPC, MC, LMS), pp. 892–898.
- DATE-1998-FlottesPRV #effectiveness
- Scanning Datapaths: A Fast and Effective Partial Scan Selection Technique (MLF, RP, BR, LV), pp. 921–922.
- DATE-1998-HeinekenM #design #named #trade-off
- Performance — Manufacturability Tradeoffs in IC Design (HTH, WM), pp. 563–567.
- DATE-1998-HsiaoC #sequence
- State Relaxation Based Subsequence Removal for Fast Static Compaction in Sequential Circuits (MSH, STC), pp. 577–582.
- DATE-1998-Lin #compilation #concurrent #runtime #scheduling #source code
- Efficient Compilation of Process-Based Concurrent Programs without Run-Time Scheduling (BL), pp. 211–217.
- DATE-1998-MaheshwariS #scalability
- Efficient Minarea Retiming of Large Level-Clocked Circuits (NM, SSS), pp. 840–845.
- DATE-1998-MarquesKWS #3d #algorithm #modelling #order #reduction
- An Efficient Algorithm for Fast Parasitic Extraction and Passive Order Reduction of 3D Interconnect Models (NAM, MK, JW, LMS), pp. 538–543.
- DATE-1998-PastorC #analysis #encoding #petri net
- Efficient Encoding Schemes for Symbolic Analysis of Petri Nets (EP, JC), pp. 790–795.
- DATE-1998-RabeJKNO #trade-off
- Power-Simulation of Cell Based ASICs: Accuracy- and Performance Trade-Offs (DR, GJ, LK, WN), pp. 356–361.
- DATE-1998-RudnickVECPR #generative #testing #using
- Fast Sequential Circuit Test Generation Using High-Level and Gate-Level Techniques (EMR, RV, AE, FC, PP, MSR), pp. 570–576.
- DATE-1998-RuttenBEK #algorithm #divide and conquer #logic
- An Efficient Divide and Conquer Algorithm for Exact Hazard Free Logic Minimization (JWJMR, MRCMB, CAJvE, MAJK), pp. 749–754.
- DATE-1998-SzekelyR #static analysis
- Fast Field Solvers for Thermal and Electrostatic Analysis (VS, MR), pp. 518–523.
- DATE-1998-TianS #fault #simulation
- Efficient DC Fault Simulation of Nonlinear Analog Circuits (MWT, CJRS), pp. 899–904.
- DATE-1998-VercauterenVJL #analysis #partial order #using #verification
- Efficient Verification using Generalized Partial Order Analysis (SV, DV, GGdJ, BL), pp. 782–789.
- DATE-1998-WahlV #validation
- A VHDL SGRAM Model for the Validation Environment of a High Performance Graphic Processor (MGW, HV), pp. 937–938.
- DATE-1998-YangP #algorithm #scheduling #synthesis
- An Efficient Algorithm to Integrate Scheduling and Allocation in High-Level Test Synthesis (LTY, ZP), pp. 74–81.
- DATE-1998-YarmolikHW #self
- Self-Adjusting Output Data Compression: An Efficient BIST Technique for RAMs (VNY, SH, HJW), pp. 173–179.
- HPCA-1998-JimenezLF #evaluation
- Performance Evaluation of Tiling for the Register Level (MJ, JML, AF), pp. 254–265.
- HPCA-1998-KalamatianosK #order
- Temporal-Based Procedure Reordering for Improved Instruction Cache Performance (JK, DRK), pp. 244–253.
- HPCA-1998-LangendoenHB #network
- Challenging Applications on Fast Networks (KL, RFHH, HEB), pp. 68–79.
- HPCA-1998-LopezMD #concurrent #detection #distributed #network
- A Very Efficient Distributed Deadlock Detection Mechanism for Wormhole Networks (PL, JMM, JD), pp. 57–66.
- HPCA-1998-MackenzieKFLLAK #delivery
- Exploiting Two-Case Delivery for Fast Protected Messaging (KM, JK, MF, WL, VL, AA, MFK), pp. 231–242.
- HPCA-1998-SamantaBIS #clustering #design #protocol
- Home-Based SVM Protocols for SMP Clusters: Design and Performance (RS, AB, LI, JPS), pp. 113–124.
- HPCA-1998-TsaiJNY #concurrent #parallel #thread
- Performance Study of a Concurrent Multithreaded Processor (JYT, ZJ, EN, PCY), pp. 24–35.
- HPCA-1998-VengroffG #branch #estimation #predict #re-engineering
- Partial Sampling with Reverse State Reconstruction: A New Technique for Branch Predictor Performance Estimation (DEV, GRG), pp. 342–351.
- HPDC-1998-AidaTNMN #effectiveness #evaluation #scheduling
- A Performance Evaluation Model for Effective Job Scheduling in Global Computing Systems (KA, AT, HN, SM, UN), pp. 352–353.
- HPDC-1998-BeckmanFHM #parallel #using
- Efficient Coupling of Parallel Applications Using PAWS (PHB, PKF, WFH, SMM), pp. 215–222.
- HPDC-1998-ChenWCK #algorithm #automation #optimisation #parallel #search-based #using
- Automatic Parallel I/O Performance Optimization Using Genetic Algorithms (YC, MW, YC, SWK), pp. 155–162.
- HPDC-1998-ChoWCK #fine-grained #parallel
- Parallel I/O Performance of Fine Grained Data Distributions (YC, MW, YC, SWK), pp. 163–170.
- HPDC-1998-GianniniC #architecture #clustering #communication
- A Software Architecture for Global Address Space Communication on Clusters: Put/Get on Fast Messages (LAG, AAC), pp. 330–337.
- HPDC-1998-Johnston #data-driven
- High-Speed, Wide Area, Data Intensive Computing: A Ten Year Retrospective (WEJ), pp. 280–291.
- HPDC-1998-LauriaPC #communication
- Efficient Layering for High Speed Communication: Fast Messages 2.x (ML, SP, AAC), pp. 10–20.
- HPDC-1998-McRobbieMAGPRWW #education #network #research
- Global High Performance Networking: Connecting the vNBS and the Asia-Pacific Advanced Network for Research and Education Applications (MAM, DFM, KHA, DG, DDP, RAR, SSW, JGW), pp. 252–259.
- HPDC-1998-TierneyJCHBG #analysis #distributed
- The NetLogger Methodology for High Performance Distributed Systems Performance Analysis (BT, WEJ, BC, GH, CXB, DG), pp. 260–267.
- ISMM-1998-LaroseF #compilation #incremental #quality
- A Compacting Incremental Collector and its Performance in a Production Quality Compiler (ML, MF), pp. 1–9.
- LCTES-1998-AnantharamanP #clustering #embedded #memory management
- An Efficient Data Partitioning Method for Limited Memory Embedded Systems (SA, SP), pp. 108–222.
- LCTES-1998-SeoPH #operating system #realtime
- Efficient User-Level I/O in the ARX Real-Time Operating System (YS, JP, SH), pp. 166–175.
- PDP-1998-AlonsoGEGGM #analysis #embedded #parallel #prototype #realtime #tool support #visualisation
- A toolset for visualization and analysis of parallel real-time embedded systems based on fast prototyping techniques (FJSA, JG, JE, DFG, SG, PDM), pp. 186–194.
- PDP-1998-CrookesBSMRM #framework #image #parallel #platform
- An efficient, portable software platform for parallel image processing (DC, JB, ITAS, PJM, DKR, GM), pp. 237–242.
- PDP-1998-EspinosaML #automation #evaluation #parallel #source code
- Automatic performance evaluation of parallel programs (AE, TM, EL), pp. 43–49.
- PDP-1998-HillJSV #architecture #independence #parallel #profiling #using
- Portable and architecture independent parallel performance tuning using a call-graph profiling tool (JMDH, SAJ, CJS, VPV), pp. 286–294.
- PDP-1998-HockneyG #benchmark #low level #metric
- Low-level benchmarking: performance profiles (RWH, VG), pp. 50–56.
- PDP-1998-IannelloLM
- LogP performance characterization of fast messages atop Myrinet (GI, ML, SM), pp. 395–401.
- PDP-1998-JungLK #clustering #multi
- Performance issues of message transmission on cluster-based multicomputer (SIJ, JKL, HJK), pp. 422–428.
- PDP-1998-Khan #algorithm #distributed #pipes and filters
- Performance of the pipelined hash-join algorithm in a heterogeneous distributed environment (ZSK), pp. 486–491.
- PDP-1998-McCannM #distributed
- Tool to evaluate performance in distributed heterogeneous processing (JAM, KJM), pp. 180–185.
- PDP-1998-RodriguezAM #algorithm #network #parallel #predict #using
- Prediction of parallel algorithms performance on bus-based networks using PVM (RJR, CA, DM), pp. 57–63.
- PDP-1998-Sergent #algorithm
- The performance of the consensus algorithm running on FDDI (NS), pp. 77–83.
- PDP-1998-YookKP #array #fortran
- A new distribution format for reshaped arrays in High Performance Fortran (HGY, MSK, MSP), pp. 204–210.
- ESOP-1998-FechtS #algorithm #constraints #difference #fixpoint
- Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems (CF, HS), pp. 90–104.
- STOC-1998-FrankelMY #distributed #generative #robust
- Robust Efficient Distributed RSA-Key Generation (YF, PDM, MY), pp. 663–672.
- STOC-1998-Grover #algorithm #framework #quantum
- A Framework for Fast Quantum Mechanical Algorithms (LKG), pp. 53–62.
- STOC-1998-KushilevitzOR #approximate #nearest neighbour
- Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces (EK, RO, YR), pp. 614–623.
- STOC-1998-LevcopoulosNS #algorithm #fault tolerance #geometry
- Efficient Algorithms for Constructing Fault-Tolerant Geometric Spanners (CL, GN, MHMS), pp. 186–195.
- TACAS-1998-LiuRS #evaluation #fixpoint
- Fully Local and Efficient Evaluation of Alternating Fixed Points (XL, CRR, SAS), pp. 5–19.
- TACAS-1998-VelevB #array #memory management #modelling #simulation
- Efficient Modeling of Memory Arrays in Symbolic Ternary Simulation (MNV, REB), pp. 136–150.
- CADE-1998-OliartS #algorithm
- A Fast Algorithm for Uniform Semi-Unification (AO, WS), pp. 239–253.
- CADE-1998-Tammet #towards
- Towards Efficient Subsumption (TT), pp. 427–441.
- CAV-1998-StollerL #detection #distributed
- Efficient Symbolic Detection of Global Properties in Distributed Systems (SDS, YAL), pp. 357–368.
- ISSTA-1998-ChanABN #model checking #requirements
- Improving Efficiency of Symbolic Model Checking for State-Based System Requirements (WC, RJA, PB, DN), pp. 102–112.
- JICSLP-1998-HodasWTK #implementation #linear #logic programming #programming language
- Efficient Implementation of a Linear Logic Programming Language (JSH, KMW, NT, KSK), pp. 145–159.
- LICS-1998-NeculaL #proving #representation #validation
- Efficient Representation and Validation of Proofs (GCN, PL), pp. 93–104.
- DL-1997-WitbrockH #documentation #information retrieval #string #using #word
- Using Words and Phonetic Strings for Efficient Information Retrieval from Imperfectly Transcribed Spoken Documents (MJW, AGH), pp. 30–35.
- ICDAR-1997-AbakBS #algorithm #evaluation #recognition
- The Performance Evaluation of Thresholding Algorithms for Optical character Recognition (ATA, UB, BS), pp. 697–700.
- ICDAR-1997-ChungY #comparison #feature model #recognition
- Performance comparison of several feature selection methods based on node pruning in handwritten character recognition (KC, JY), pp. 11–15.
- ICDAR-1997-Ha #database #detection #scalability
- Efficient Detection of Abnormalities in Large OCR Databases (TMH), p. 1006–?.
- ICDAR-1997-TakahashiYM #algorithm #online #recognition
- A Fast HMM Algorithm for On-line Handwritten Character Recognition (KT, HY, TM), pp. 369–375.
- ICDAR-1997-VossepoelSD #memory management
- Memory efficient skeletonization of utility maps (AMV, KS, CFPD), pp. 797–800.
- ICDAR-1997-WolfNS #image
- Fast Address Block Location on Handwritten and Machine Printed Mail--piece Images (MW, HN, WS), pp. 753–757.
- ICDAR-1997-ZhouGS #recognition #verification
- A High Performance Hand-printed Numeral Recognition System with Verification Module (JZ, QG, CYS), pp. 293–297.
- SIGMOD-1997-AgrawalASY #maintenance
- Efficient View Maintenance at Data Warehouses (DA, AEA, AKS, TY), pp. 417–427.
- SIGMOD-1997-BerchtoldBBKK #database #parallel #similarity
- Fast Parallel Similarity Search in Multimedia Databases (SB, CB, BB, DAK, HPK), pp. 1–12.
- SIGMOD-1997-DoppelhammerHKK #database
- Database Performance in the Real World — TPC-D and SAP R/3 (JD, TH, AK, DK), pp. 123–134.
- SIGMOD-1997-ONeilQ #query
- Improved Query Performance with Variant Indexes (PEO, DQ), pp. 38–49.
- VLDB-1997-ChaudhuriN #sql
- An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server (SC, VRN), pp. 146–155.
- VLDB-1997-CiacciaPZ #metric #named #similarity
- M-tree: An Efficient Access Method for Similarity Search in Metric Spaces (PC, MP, PZ), pp. 426–435.
- VLDB-1997-GibbonsMP #approximate #incremental #maintenance
- Fast Incremental Maintenance of Approximate Histograms (PBG, YM, VP), pp. 466–475.
- VLDB-1997-MorimotoIM
- Efficient Construction of Regression Trees with Range and Region Splitting (YM, HI, SM), pp. 166–175.
- VLDB-1997-RossS
- Fast Computation of Sparse Datacubes (KAR, DS), pp. 116–125.
- VLDB-1997-SeidlK #adaptation #database #multi #scalability #similarity
- Efficient User-Adaptable Similarity Search in Large Multimedia Databases (TS, HPK), pp. 506–515.
- VLDB-1997-WildfogelY #testing #transaction
- Efficient Testing of High Performance Transaction Processing Systems (DW, RY), pp. 595–598.
- ITiCSE-WGR-1997-Preston #consistency #evaluation #rating #reliability
- Evaluation software: improving consistency and reliability of performance rating (JAP), pp. 132–134.
- CSMR-1997-DumkeW #maintenance #tool support
- CAME Tools for an Efficient Software Maintenance (RRD, ASW), pp. 74–81.
- CSMR-1997-Sneed #maintenance
- Measuring the performance of a software maintenance department (HMS), pp. 119–127.
- ICALP-1997-BeigelF #bound #nondeterminism #recursion
- Molecular Computing, Bounded Nondeterminism, and Efficient Recursion (RB, BF), pp. 816–826.
- ICALP-1997-CaceresDFFRRSS #algorithm #graph #parallel
- Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP (EC, FKHAD, AF, PF, IR, AR, NS, SWS), pp. 390–400.
- ICALP-1997-GrossiI #algorithm #order #problem
- Efficient Splitting and Merging Algorithms for Order Decomposable Problems (RG, GFI), pp. 605–615.
- ICALP-1997-KhannaMS #array #clustering
- Efficient Array Partitioning (SK, SM, SS), pp. 616–626.
- ICALP-1997-Vogler #petri net
- Efficiency of Asynchronous Systems and Read Arcs in Petri Nets (WV), pp. 538–548.
- WIA-1997-AlonsoCF #glr #parsing
- Construction of Efficient Generalized LR Parsers (MAA, DC, MVF), pp. 7–24.
- WIA-1997-GlennG #automaton #finite #implementation
- Implementing WS1S via Finite Automata: Performance Issues (JG, WIG), pp. 75–86.
- WIA-1997-Ponty #regular expression
- An Efficient Null-Free Procedure for Deciding Regular Language Membership (JLP), pp. 159–170.
- WIA-1997-SalomaaWY #implementation #regular expression #using
- Efficient Implementation of Regular Languages Using R-AFA (KS, XW, SY), pp. 176–184.
- FME-1997-MartinJ #analysis #concurrent #network #process #scalability
- An Efficient Technique for Deadlock Analysis of Large Scale Process Networks (JMRM, SAJ), pp. 418–441.
- CHI-1997-BalakrishnanM #difference
- Performance Differences in the Fingers, Wrist, and Forearm in Computer Input Control (RB, ISM), pp. 303–310.
- CHI-1997-BhavnaniJ #analysis
- From Sufficient to Efficient Usage: An Analysis of Strategic Knowledge (SKB, BEJ), pp. 91–98.
- HCI-CC-1997-FunadaYIN #analysis #effectiveness #evaluation #how #human-computer
- How Efficient are Combined Tasks for Effective HCI?: An Objective Evaluation Through AR Analysis of EEG (MFF, YY, KI, SPN), pp. 579–582.
- HCI-CC-1997-KojimaYME #adaptation #human-computer #interface
- Task Adaptive Electronic Manual as Human-Computer Interface for Business Performance Improvement Support (HK, TY, YM, HE), pp. 789–792.
- HCI-CC-1997-Lickteig #interactive
- Soldier-Computer Interactions and Armor Battalion Performance (CWL), pp. 813–816.
- HCI-CC-1997-RadleBM #variability
- The Effects of Task Variability on Mouse Performance (KR, SB, IM), pp. 711–714.
- HCI-CC-1997-Venda #analysis #communication #predict
- Ergodynamics in Analysis and Prediction of Communication Efficiency (VFV), pp. 833–836.
- HCI-SEC-1997-Deutsch #modelling #multi
- Multi-Agent Performance Modeling in OMAR (SD), pp. 79–82.
- HCI-SEC-1997-LathanN #quantifier
- Quantification of Human Performance in Extreme Environments (CEL, DJN), pp. 1005–1008.
- HCI-SEC-1997-LaugheryP #case study #predict
- Predicting Human Performance in Complex Systems-A Method and Case Study (KRLJ, BMP), pp. 75–78.
- HCI-SEC-1997-MaidaAN
- Effects of Lighting on Human Performance in Training (JM, AA, JN), pp. 877–880.
- HCI-SEC-1997-NorrisW #question #video
- Supporting Task Performance: Is Text or Video Better? (BEN, WBLW), pp. 647–650.
- HCI-SEC-1997-Riedel #3d #aspect-oriented #parametricity
- 3D-Rendering and the Eye: Aspects for Efficient Rendering Through Physiological and Anatomical Parameters of the Eye (OR), pp. 981–984.
- CAiSE-1997-BrataasHS #workflow
- Performance Engineering of Human and Computerised Workflows (GB, PHH, AS), pp. 187–202.
- CIKM-1997-Lukasiewicz #deduction #knowledge base #probability #taxonomy
- Efficient Global Probabilistic Deduction from Taxonomic and Probabilistic Knowledge-Bases over Conjunctive Events (TL), pp. 75–82.
- ICML-1997-DevaneyR #clustering #concept #feature model
- Efficient Feature Selection in Conceptual Clustering (MD, AR), pp. 92–97.
- ICML-1997-MooreSD #polynomial #predict
- Efficient Locally Weighted Polynomial Regression Predictions (AWM, JGS, KD), pp. 236–244.
- ICML-1997-SchuurmansUF
- Characterizing the generalization performance of model selection strategies (DS, LHU, DPF), pp. 340–348.
- KDD-1997-AronisP #algorithm #data mining #mining
- Increasing the Efficiency of Data Mining Algorithms with Breadth-First Marker Propagation (JMA, FJP), pp. 119–122.
- KDD-1997-Drucker #classification
- Fast Committee Machines for Regression and Classification (HD), pp. 159–162.
- KDD-1997-KeoghS #approach #database #pattern matching #probability
- A Probabilistic Approach to Fast Pattern Matching in Time Series Databases (EJK, PS), pp. 24–30.
- KDD-1997-MihalisinT #data mining #mining #robust #visual notation
- Fast Robust Visual Data Mining (TM, JT), pp. 231–234.
- KDD-1997-ProvostF #analysis #classification #comparison #visualisation
- Analysis and Visualization of Classifier Performance: Comparison under Imprecise Class and Cost Distributions (FJP, TF), pp. 43–48.
- KDD-1997-ThomasBAR #algorithm #database #incremental #scalability
- An Efficient Algorithm for the Incremental Updation of Association Rules in Large Databases (ST, SB, KA, SR), pp. 263–266.
- KDD-1997-ZakiPOL #algorithm
- New Algorithms for Fast Discovery of Association Rules (MJZ, SP, MO, WL), pp. 283–286.
- KDD-1997-ZamirEMK #clustering #documentation #web
- Fast and Intuitive Clustering of Web Documents (OZ, OE, OM, RMK), pp. 287–290.
- SIGIR-1997-FidelC
- Users’ Perception of the Performance of a Filtering System (RF, MC), pp. 198–205.
- SIGIR-1997-SchuetzeS #clustering #documentation
- Projections for Efficient Document Clustering (HS, CS), pp. 74–81.
- SIGIR-1997-SheridanWS #retrieval #speech
- Cross Language Speech Retrieval: Establishing a Baseline Performance (PS, MW, PS), pp. 99–108.
- SIGIR-1997-VelezWSG #effectiveness #query #refinement
- Fast and Effective Query Refinement (BV, RW, MAS, DKG), pp. 6–15.
- OOPSLA-1997-HarrisonLS #design #realtime
- The Design and Performance of a Hard Real-Time Object Event Service (THH, DLL, DCS), pp. 184–200.
- OOPSLA-1997-VitekHK #testing
- Efficient Type Inclusion Tests (JV, RNH, AK), pp. 142–157.
- OOPSLA-1997-ZendraCC #compilation
- Efficient Dynamic Dispatch without Virtual Function Tables: The SmallEiffel Compiler (OZ, DC, SC), pp. 125–141.
- TOOLS-ASIA-1997-JiaDD #object-oriented #parallel
- The Parallel Object Model in HIPPOS: High Performance Parallel Object System (LJ, DW, DW), pp. 397–403.
- TOOLS-ASIA-1997-LamCW #evaluation
- Performance Evaluation of Objects with Roles (FL, HLC, RKW), pp. 2–11.
- TOOLS-ASIA-1997-PengCC #analysis #morphism #multi #polymorphism
- The Implement Mechanism and Efficiency Analysis of Multiinheritance and Polymorphism (RP, JC, SC), pp. 389–392.
- AdaEurope-1997-PierceAWSCG #realtime #requirements #verification
- Capturing and Verifying Performance Requirements for Hard Real Time Systems (RHP, SA, RW, JS, HC, JG), pp. 137–148.
- PEPM-1997-BeshersF #compilation #generative #partial evaluation #using #visualisation
- Generating Efficient Virtual Worlds for Visualization Using Partial Evaluation and Dynamic Compilation (CB, SF), pp. 107–115.
- PLDI-1997-AmmonsBL #hardware #profiling
- Exploiting Hardware Performance Counters with Flow and Context Sensitive Profiling (GA, TB, JRL), pp. 85–96.
- PLDI-1997-EichenbergerD
- Efficient Formulation for Optimal Modulo Schedulers (AEE, ESD), pp. 194–205.
- PLDI-1997-HashemiKC #using
- Efficient Procedure Mapping Using Cache Line Coloring (AHH, DRK, BC), pp. 171–182.
- PLDI-1997-PolettoEK #code generation #flexibility #named
- tcc: A System for Fast, Flexible, and High-level Dynamic Code Generation (MP, DRE, MFK), pp. 109–121.
- PLDI-1997-TauraY #approach #compilation #effectiveness #implementation #multi #thread
- Fine-grain Multithreading with Minimal Compiler Support — A Cost Effective Approach to Implementing Efficient Multithreading Languages (KT, AY), pp. 320–333.
- PLILP-1997-Lucas #functional #programming
- Transformations for Efficient Evaluations in Functional Programming (SL), pp. 127–141.
- POPL-1997-ShapiroH #analysis #points-to
- Fast and Accurate Flow-Insensitive Points-To Analysis (MS, SH), pp. 1–14.
- SAS-1997-UhW #branch
- Coalescing Conditional Branches into Efficient Indirect Jumps (GRU, DBW), pp. 315–329.
- SAS-1997-WaddellD #effectiveness
- Fast and Effective Procedure Inlining (OW, RKD), pp. 35–52.
- TRI-Ada-1997-White #ada #programming
- Performance Issues of Scientific Programming in Ada 95 (JBWI), pp. 279–294.
- RE-1997-GuptaJKW #generative #named
- Auditdraw: Generating Audits the FAST Way (NKG, LJJ, EK, DMW), pp. 188–197.
- ASE-1997-MarletTC #architecture #implementation #partial evaluation
- Mapping Software Architectures to Efficient Implementations via Partial Evaluation (RM, ST, CC), pp. 183–192.
- ESEC-FSE-1997-LandSJ #design #detection #empirical #fault #using #validation
- Validating the Defect Detection Performance Advantage of Group Designs for Software Reviews: Report of a Laboratory Experiment Using Program Code (LPWL, CS, DRJ), pp. 294–309.
- SAC-1997-Al-HoumailyCL #commit #protocol
- Enhancing the performance of presumed commit protocol (YJAH, PKC, SPL), pp. 131–133.
- SAC-1997-LewisSZ #network #retrieval #scalability
- Scaling of neural network inferencing by efficient storage and retrieval of outputs (BL, AS, JZ), pp. 10–14.
- SAC-1997-Li #effectiveness #evaluation #multi
- An efficient and effective performance evaluation method for multiprogrammed multiprocessor systems (KL), pp. 478–487.
- SAC-1997-LinXY #analysis #parallel #problem
- Performance analysis for parallel solutions to generic search problems (WML, WX, BY), pp. 422–430.
- SAC-1997-Liu #algorithm #evaluation #execution #parallel #query
- Performance evaluation of processor allocation algorithms for parallel query execution (KHL), pp. 393–402.
- SAC-1997-LiuLS #clustering #concurrent #multi #thread
- An efficient processor partitioning and thread mapping strategy for mesh-connected multiprocessor systems (HL, WML, YS), pp. 403–412.
- SAC-1997-SabharwalQ #algorithm
- An efficient algorithm for direct computation of adjacent block coefficients in the transformed domain (CLS, BQ), pp. 515–520.
- SAC-1997-SongL #predict #scheduling
- Performance prediction based loop scheduling for heterogeneous computing environment (YS, WML), pp. 413–421.
ASF+SDF-1997-Vigna #implementation #source code #towards- Towards an efficient implementation of distributive programs (SV), p. 13.
- DAC-1997-ChangC #approach #multi
- An Efficient Approach to Multi-Layer Layer Assignment with Application to Via Minimization (CCC, JC), pp. 600–603.
- DAC-1997-CroixW #logic #synthesis
- A Fast And Accurate Technique To Optimize Characterization Tables For Logic Synthesis (JFC, DFW), pp. 337–340.
- DAC-1997-ForzanFG #megamodelling #standard
- Accurate and Efficient Macromodel of Submicron Digital Standard Cells (CF, BF, CG), pp. 633–637.
- DAC-1997-GrundmannDAR #design #using
- Designing High Performance CMOS Microprocessors Using Full Custom Techniques (WJG, DD, RLA, NLR), pp. 722–727.
- DAC-1997-HasteerMB
- An Efficient Assertion Checker for Combinational Properties (GH, AM, PB), pp. 734–739.
- DAC-1997-JiangKCM #logic #optimisation
- Post-Layout Logic Restructuring for Performance Optimization (YMJ, AK, KTC, MMS), pp. 662–665.
- DAC-1997-KapurZ #parametricity
- A Fast Method of Moments Solver for Efficient Parameter Extraction of MCMs (SK, JZ), pp. 141–146.
- DAC-1997-KimK #algorithm #design #layout
- An Efficient Transistor Folding Algorithm for Row-Based CMOS Layout Design (JK, SMK), pp. 456–459.
- DAC-1997-KlenkeMAJRG #analysis #dependence #design
- An Integrated Design Environment for Performance and Dependability Analysis (RHK, MM, JHA, BWJ, RR, AG), pp. 184–189.
- DAC-1997-LiaoTG #design #hardware #implementation #modelling
- An Efficient Implementation of Reactivity for Modeling Hardware in the Scenic Design Environment (SYL, SWKT, RKG), pp. 70–75.
- DAC-1997-PasseroneLCS #analysis #hardware #prototype #trade-off
- Fast Hardware/Software Co-Simulation for Virtual Prototyping and Trade-Off Analysis (CP, LL, MC, ALSV), pp. 389–394.
- DAC-1997-RainaBNMB #design #testing
- Efficient Testing of Clock Regenerator Circuits in Scan Designs (RR, RB, CN, RFM, CB), pp. 95–100.
- DAC-1997-Roychowdhury #multi #simulation
- Efficient Methods for Simulating Highly Nonlinear Multi-Rate Circuits (JSR), pp. 269–274.
- DAC-1997-SentovichTB #optimisation #set #using
- Efficient Latch Optimization Using Exclusive Sets (ES, HT, GB), pp. 8–11.
- DAC-1997-WalrathV #evaluation #modelling #symbolic computation #trade-off #visualisation
- Symbolic Evaluation of Performance Models for Tradeoff Visualization (JW, RV), pp. 359–364.
- EDTC-1997-ArabiK #testing #using
- Efficient and accurate testing of analog-to-digital converters using oscillation-test method (KA, BK), pp. 348–352.
- EDTC-1997-GavrilovGRBJV
- Fast power loss calculation for digital static CMOS circuits (SG, AG, SR, DB, LGJ, GV), pp. 411–415.
- EDTC-1997-HertwigW
- Fast controllers for data dominated applications (AH, HJW), pp. 84–89.
- EDTC-1997-HettDB #order #synthesis
- Fast and efficient construction of BDDs by reordering based synthesis (AH, RD, BB), pp. 168–175.
- EDTC-1997-HuangW #array #design
- High-speed C-testable systolic array design for Galois-field inversion (CTH, CWW), pp. 342–346.
- EDTC-1997-LaquaiRW #metric #testing
- A production-oriented measurement method for fast and exhaustive Iddq tests (BL, HR, HW), pp. 279–286.
- EDTC-1997-LiuS #graph #heuristic #multi #using
- Multi-layer chip-level global routing using an efficient graph-based Steiner tree heuristic (LCEL, CS), pp. 311–318.
- EDTC-1997-OzimekVT #array #implementation #scheduling
- Optimal scheduling for fast systolic array implementations (IO, RV, JFT), p. 620.
- EDTC-1997-PandaDN #embedded #memory management
- Efficient utilization of scratch-pad memory in embedded processor applications (PRP, NDD, AN), pp. 7–11.
- EDTC-1997-WalrathVB #analysis #partial evaluation #using #verification
- Performance verification using partial evaluation and interval analysis (JW, RV, WB), p. 622.
- HPCA-1997-BhandarkarD
- Performance Characterization of the Pentium(r) Pro Processor (DB, JJD), pp. 288–299.
- HPCA-1997-LimHPS #clustering #communication
- Message Proxies for Efficient, Protected Communication on SMP Clusters (BHL, PH, PP, MS), pp. 116–127.
- HPCA-1997-NoonburgS #framework #modelling #statistics
- A Framework for Statistical Modeling of Superscalar Processor Performance (DBN, JPS), pp. 298–309.
- HPCA-1997-PaiRA #parallel #simulation
- The Impact of Instruction-Level Parallelism on Multiprocessor Performance and Simulation Methodology (VSP, PR, SVA), pp. 72–83.
- HPCA-1997-QinB #communication #multi #on the
- On the Use and Performance of Explicit Communication Primitives in Cache-Coherent Multiprocessor Systems (XQ, JLB), pp. 182–193.
- HPCA-1997-RavindranS #comparison #multi #network
- A Performance Comparison of Hierarchical Ring- and Mesh-Connected Multiprocessor Networks (GR, MS), pp. 58–69.
- HPCA-1997-StrickerG #memory management #parallel
- Global Address Space, Non-Uniform Bandwidth: A Memory System Performance Characterization of Parallel Systems (TS, TRG), pp. 168–179.
- HPCA-1997-TrancosoLZT #memory management #multi
- The Memory Performance of DSS Commercial Workloads in Shared-Memory Multiprocessors (PT, JLLP, ZZ, JT), pp. 250–260.
- HPCA-1997-WelshBE #communication #interface #network
- ATM and Fast Ethernet Network Interfaces for User-Level Communication (MW, AB, TvE), pp. 332–342.
- HPDC-1997-FriedmanR #protocol
- Packing Messages as a Tool for Boosting the Performance of Total Ordering Protocols (RF, RvR), pp. 233–242.
- HPDC-1997-Liebhart #aspect-oriented
- Performance Aspects of Switched SCI Systems (ML), pp. 223–231.
- HPDC-1997-NitzbergL #parallel
- Collective Buffering: Improving Parallel I/O Performance (BN, VML), pp. 148–157.
- HPDC-1997-Wolski #network #scheduling #using
- Forecasting Network Performance to Support Dynamic Scheduling using the Network Weather Service (RW), pp. 316–325.
- PDP-1997-Anglano #automation #evaluation #generative #modelling
- Automatic generation of GSPN models for the performance evaluation of heterogeneous applications (CA), pp. 493–500.
- PDP-1997-Brandes #compilation #fortran #memory management
- Compiling high performance fortran for shared memory and shared virtual memory systems (TB), pp. 289–296.
- PDP-1997-DelaitreJSW #design #evaluation #named #parallel
- EDPEPPS: An environment for the design and performance evaluation of portable parallel software (TD, GRJ, FS, SCW), pp. 401–406.
- PDP-1997-JanikK #fault tolerance #multi #optimisation #process
- Process performance optimization in fault-tolerant multiprocessor systems after a fault occurrence (PJ, MK), pp. 100–107.
- PDP-1997-MazzeoMV #distributed #evaluation #on the
- On the evaluation of efficiency in heterogeneous distributed systems (AM, NM, UV), pp. 54–59.
- PDP-1997-MurphyV #on the
- On the relative performance of diffusion and dimension exchange load balancing in hypercubes (TAM, JGV), pp. 29–34.
- PDP-1997-SenarRCL #approach #clustering #parallel #source code
- An efficient clustering-based approach for mapping parallel programs (MAS, AR, AC, EL), pp. 407–412.
- PPoPP-1997-FrensW #multi #source code
- Auto-blocking Matrix-Multiplication or Tracking BLAS3 Performance with Source Code (JDF, DSW), pp. 206–216.
- PPoPP-1997-FuY #execution #parallel
- Space and Time Efficient Execution of Parallel Irregular Computation (CF, TY), pp. 57–68.
- PPoPP-1997-GuLL #analysis #array #data flow #experience
- Experience with Efficient Array Data-Flow Analysis for Array Privatization (JG, ZL, GL), pp. 157–167.
- PPoPP-1997-HuJT #fortran #problem
- High Performance FORTRAN for Highly Unstructured Problems (YCH, SLJ, SHT), pp. 13–24.
- PPoPP-1997-JiangSS #memory management #multi
- Application Restructuring and Performance Portability on Shared Virtual Memory and Hardware-Coherent Multiprocessors (DJ, HS, JPS), pp. 217–229.
- PPoPP-1997-LimCCE #communication
- Performance Implications of Communication Mechanisms in All-Software Global Address Space Systems (BHL, CCC, GC, TvE), pp. 230–239.
- PPoPP-1997-XuLM #memory management #profiling
- Shared Memory Performance Profiling (ZX, JRL, BPM), pp. 240–251.
- PPoPP-1997-ZhouISLTSHW #consistency #evaluation
- Relaxed Consistency and Coherence Granularity in DSM Systems: A Performance Evaluation (YZ, LI, JPS, KL, BRT, IS, MDH, DAW), pp. 193–205.
- SOSP-1997-HartigHLSW #kernel
- The Performance of µKernel-Based Systems (HH, MH, JL, SS, JW), pp. 66–77.
- SOSP-1997-JonesRR #constraints #cpu #independence #predict #process #scheduling
- CPU Reservations and Time Constraints: Efficient, Predictable Scheduling of Independent Activities (MBJ, DR, MCR), pp. 198–211.
- SOSP-1997-KaashoekEGBHMPGM #flexibility #kernel
- Application Performance and Flexibility on Exokernel Systems (MFK, DRE, GRG, HMB, RH, DM, TP, RG, JJ, KM), pp. 52–65.
- SOSP-1997-NeefeWRCA #adaptation #file system
- Improving the Performance of Log-Structured File Systems with Adaptive Methods (JMN, DSR, AMC, RYW, TEA), pp. 238–251.
- SOSP-1997-ScalesG #distributed #memory management #towards
- Towards Transparent and Efficient Software Distributed Shared Memory (DJS, KG), pp. 157–169.
- STOC-1997-BuhlerSS #fourier #integer #precise #using
- Fast and Precise Computations of Discrete Fourier Transforms Using Cyclotomic Integers (JB, MAS, VS), pp. 40–47.
- STOC-1997-CramerD #linear #proving
- Linear Zero-Knowledge — A Note on Efficient Zero-Knowledge Proofs and Arguments (RC, ID), pp. 436–445.
- STOC-1997-Pan #equation
- Faster Solution of the Key Equation for Decoding BCH Error-Correcting Codes (VYP), pp. 168–175.
- TACAS-1997-ParashkevovY #analysis #pseudo #reachability #using
- Space Efficient Reachability Analysis Through Use of Pseudo-Root States (ANP, JY), pp. 50–64.
- TACAS-1997-Tofts #analysis #composition
- Compositional Performance Analysis (CMNT), pp. 290–305.
TAPSOFT-1997-MartinK #generative #logic programming #source code- Generating Efficient, Terminating Logic Programs (JCM, AK), pp. 273–284.
- CADE-1997-Zhang #named #proving
- SATO: An Efficient Propositional Prover (HZ), pp. 272–275.
- CAV-1997-BeerBER #detection
- Efficient Detection of Vacuity in ACTL Formulaas (IB, SBD, CE, YR), pp. 279–290.
- CAV-1997-Biere #calculus #model checking #named #μ-calculus
- μcke — Efficient μ-Calculus Model Checking (AB), pp. 468–471.
- CAV-1997-CyrlukMR #formal method
- An Efficient Decision Procedure for the Theory of Fixed-Sized Bit-Vectors (DC, MOM, HR), pp. 60–71.
- CAV-1997-KamhiWF #automation
- Automatic Datapath Extraction for Efficient Usage of HDD (GK, OW, LF), pp. 95–106.
- CAV-1997-KelbMMG #named
- MOSEL: A Sound and Efficient Tool for M2L(Str) (PK, TMS, MM, CG), pp. 448–451.
- CAV-1997-RamakrishnanRRSSW #model checking #using
- Efficient Model Checking Using Tabled Resolution (YSR, CRR, IVR, SAS, TS, DSW), pp. 143–154.
- CAV-1997-VarpaaniemiHL #analysis #reachability
- prod 3.2: An Advanced Tool for Efficient Reachability Analysis (KV, KH, JL), pp. 472–475.
- CAV-1997-VelevBJ #array #memory management #modelling #simulation
- Efficient Modeling of Memory Arrays in Symbolic Simulation (MNV, REB, AJ), pp. 388–399.
- ICLP-1997-Codish #bottom-up #evaluation #logic programming #source code
- Efficient Goal Directed Bottom-up Evaluation of Logic Programs (MC), p. 422.
- ILPS-1997-AravindanB #algorithm #database
- A Rational and Efficient Algorithm for View Deletion in Databases (CA, PB), pp. 165–179.
- ADL-1996-AndresenYEIS #library #scalability #web
- Scalability Issues for High Performance Digital Libraries on the World Wide Web (DA, TY, ÖE, OHI, TRS), pp. 139–148.
- PODS-1996-GangulyGS #cost analysis #modelling #optimisation #parallel #query
- Efficient and Acurate Cost Models for Parallel Query Optimization (SG, AG, AS), pp. 172–181.
- PODS-1996-TheodoridisS #predict
- A Model for the Prediction of R-tree Performance (YT, TKS), pp. 161–171.
- SIGMOD-1996-FranklinJK #query #trade-off
- Performance Tradeoffs for Client-Server Query Processing (MJF, BÞJ, DK), pp. 149–160.
- SIGMOD-1996-LeflerSW #database #named #predict #simulation
- DBSim: A Simulation Tool for Predicting Database Performance (ML, MS, CW), p. 548.
- SIGMOD-1996-LiskovACDGGMMS #persistent
- Safe and Efficient Sharing of Persistent Objects in Thor (BL, AA, MC, MD, SG, RG, UM, ACM, LS), pp. 318–329.
- SIGMOD-1996-McAuliffeCS #effectiveness #towards
- Towards Effective and Efficient Free Space Management (MLM, MJC, MHS), pp. 389–400.
- SIGMOD-1996-ZhangRL #clustering #database #named #scalability
- BIRCH: An Efficient Data Clustering Method for Very Large Databases (TZ, RR, ML), pp. 103–114.
- VLDB-1996-Baru #database
- Performance of Future Database Systems: Bottlenecks and Bonananzas (CKB), p. 599.
- VLDB-1996-FukudaMMT #using
- Constructing Efficient Decision Trees by Using Optimized Numeric Association Rules (TF, YM, SM, TT), pp. 146–155.
- VLDB-1996-KornSFSP #database #image #nearest neighbour
- Fast Nearest Neighbor Search in Medical Image Databases (FK, NS, CF, ELS, ZP), pp. 215–226.
- VLDB-1996-LabioG #algorithm #difference
- Efficient Snapshot Differential Algorithms for Data Warehousing (WL, HGM), pp. 63–74.
- VLDB-1996-Ogawa #documentation #effectiveness #ranking #scalability #using
- Effective & Efficient Document Ranking without using a Large Lexicon (YO), pp. 192–202.
- VLDB-1996-Rengarajan #how #sql
- How System 11 SQL Server Became Fast (TKR), p. 590.
WPC-1996-GriswoldAM #flexibility #pattern matching- Fast, Flexible Syntactic Pattern Matching and Processing (WGG, DCA, CM), pp. 144–153.
- ICALP-1996-AumannB
- Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler (YA, MAB), pp. 622–633.
- ICALP-1996-BermondGPRV #communication #network
- Efficient Collective Communication in Optical Networks (JCB, LG, SP, AAR, UV), pp. 574–585.
- ICALP-1996-HerleyPP #backtracking
- Fast Deterministic Backtrack Search (KTH, AP, GP), pp. 598–609.
- ICALP-1996-JennerV
- Fast Asynchronous Systems in Dense Time (LJ, WV), pp. 75–86.
- ICALP-1996-Ranade #parallel
- Bandwidth Efficient Parallel Computation (AGR), pp. 4–23.
- FME-1996-MartinsH #evaluation #specification
- A New System Engineering Methodology Coupling Formal Specification and Performance Evaluation (JJM, JPH), pp. 140–159.
- RTA-1996-CurienQS #higher-order
- Efficient Second-Order Matching (RC, ZQ, HS), pp. 317–331.
- RTA-1996-HillenbrandBF #on the #proving #theorem proving
- On Gaining Efficiency in Completion-Based Theorem Proving (TH, AB, RF), pp. 432–435.
- AFP-1996-RuncimanR96 #profiling
- Heap Profiling for Space Efficiency (CR, NR), pp. 159–183.
- ICFP-1996-BlellochG #implementation
- A Provable Time and Space Efficient Implementation of NESL (GEB, JG), pp. 213–225.
- ICFP-1996-JonesPS #float #named #source code
- Let-floating: Moving Bindings to Give Faster Programs (SLPJ, WP, AS), pp. 1–12.
- IFL-1996-Groningen #array #implementation
- The Implementation and Efficiency of Arrays in Clean 1.1 (JHGvG), pp. 105–124.
- CHI-1996-ZhaiMB #multi
- The Influence of Muscle Groups on Performance of Multiple Degree-of-Freedom Input (SZ, PM, WB), pp. 308–315.
- CSCW-1996-KrautMS #collaboration #communication #physics
- Collaboration in Performance of Physical Tasks: Effects on Outcomes and Communication (REK, MDM, JS), pp. 57–66.
- AKDDM-1996-AgrawalMSTV
- Fast Discovery of Association Rules (RA, HM, RS, HT, AIV), pp. 307–328.
- CIKM-1996-Kamel #retrieval
- Fast Retrieval of Cursive Handwriting (IK), pp. 91–98.
- CIKM-1996-LiuOSWYR #database #evaluation #fuzzy
- Performance Evaluation of G-tree and Its Application in Fuzzy Databases (CL, AMO, APS, JW, CTY, NR), pp. 235–242.
- CIKM-1996-ShinKC #named #query
- S-signature: A New Scheme for Efficient Query Processing of Complex Objects in OODB (HS, KK, JWC), pp. 207–214.
- CIKM-1996-WuAASS #database #image #retrieval #scalability
- Efficient Retrieval for Browsing Large Image Databases (DW, DA, AEA, AKS, TRS), pp. 11–18.
- ICML-1996-CarbonaraS #knowledge base #refinement
- Improving the Efficiency of Knowledge Base Refinement (LC, DHS), pp. 78–86.
- ICML-1996-SinghP #classification #learning #network
- Efficient Learning of Selective Bayesian Network Classifiers (MS, GMP), pp. 453–461.
- ICML-1996-Suzuki #algorithm #learning #network #using
- Learning Bayesian Belief Networks Based on the Minimum Description Length Principle: An Efficient Algorithm Using the B & B Technique (JS), pp. 462–470.
- ICML-1996-ZuckerG #learning #representation
- Representation Changes for Efficient Learning in Structural Domains (JDZ, JGG), pp. 543–551.
- ICPR-1996-AppenzellerC #adaptation
- Experimental performance characterization of adaptive filters (GA, JLC), pp. 417–421.
- ICPR-1996-AriasCM #documentation
- Efficient interpretation of tabular documents (JFA, AKC, VM), pp. 681–685.
- ICPR-1996-BakkerVOS #image
- High-speed acquisition of range images (MdB, PWV, FvdO, GKS), pp. 293–297.
- ICPR-1996-BasriGJ #image #multi
- Efficient determination of shape from multiple images containing partial information (RB, AJG, DWJ), pp. 268–274.
- ICPR-1996-ChaoN #3d
- Cubical singular simplex model for 3D objects and fast computation of homology groups (JC, JN), pp. 190–194.
- ICPR-1996-Chetverikov #algorithm #interactive
- Structural filtering with texture feature-based interaction maps: fast algorithm and applications (DC), pp. 795–799.
- ICPR-1996-CordellaFSV #algorithm #graph #using
- An efficient algorithm for the inexact matching of ARG graphs using a contextual transformational model (LPC, PF, CS, MV), pp. 180–184.
- ICPR-1996-DuttaM #comparison
- Performance comparison of two evolutionary schemes (PD, DDM), pp. 659–663.
- ICPR-1996-GarciaB #image
- Fast extraction of surface primitives from range images (MAG, LB), pp. 568–572.
- ICPR-1996-HsiehLFK #algorithm #image
- A fast algorithm for image registration without predetermining correspondences (JWH, HYML, KCF, MTK), pp. 765–769.
- ICPR-1996-HuangHH #adaptation #estimation #video
- Adaptive early jump-out technique for fast motion estimation in video coding (HCH, YPH, WLH), pp. 864–868.
- ICPR-1996-HuijsmansL #image #retrieval #using
- Efficient content-based image retrieval in digital picture collections using projections: (near)-copy location (DPH, MSL), pp. 104–108.
- ICPR-1996-HwangB #classification #network #recognition
- An efficient method to construct a radial basis function neural network classifier and its application to unconstrained handwritten digit recognition (YSH, SYB), pp. 640–644.
- ICPR-1996-JengLLC #approach #detection #geometry #using
- An efficient approach for facial feature detection using geometrical face model (SHJ, HYML, YTL, MYC), pp. 426–430.
- ICPR-1996-JiangHF #approach #detection #documentation
- A fast approach to detect and correct skew documents (HFJ, CCH, KCF), pp. 742–746.
- ICPR-1996-LamY #detection
- Efficient circular object detection with hypothesis filtering strategy and Hough transform (WCYL, SYY), pp. 542–546.
- ICPR-1996-LinT #algorithm #video
- Fast full-search block-matching algorithm for motion-compensated video compression (YCL, SCT), pp. 914–918.
- ICPR-1996-LiuD #algorithm
- Sparse pixel tracking: a fast vectorization algorithm applied to engineering drawings (WL, DD), pp. 808–812.
- ICPR-1996-LiuL #approach #classification #effectiveness #using
- An efficient and effective texture classification approach using a new notion in wavelet theory (JFL, JCML), pp. 820–824.
- ICPR-1996-MartinezST #linear #recursion
- A recursive updating rule for efficient computation of linear moments in sliding-window applications (JM, ES, FT), pp. 295–299.
- ICPR-1996-MinCL #documentation #estimation #reduction
- A data reduction method for efficient document skew estimation based on Hough transformation (YM, SBC, YL), pp. 732–736.
- ICPR-1996-MollerGW #clustering #network
- Fast vector quantizer on neural clustering networks providing globally optimal cluster solutions (UM, MG, HW), pp. 351–355.
- ICPR-1996-MorimotoC #image
- Fast electronic digital image stabilization (CM, RC), pp. 284–288.
- ICPR-1996-MukherjeePCCK #algorithm #detection #image
- An efficient algorithm for detection of road-like structures in satellite images (AM, SKP, DC, BBC, RK), pp. 875–879.
- ICPR-1996-NakanishiO #algorithm #evaluation #realtime
- A real-time CAM-based Hough transform algorithm and its performance evaluation (MN, TO), pp. 516–521.
- ICPR-1996-ParodiP #documentation #image #preprocessor
- An efficient pre-processing of mixed-content document images for OCR systems (PP, GP), pp. 778–782.
- ICPR-1996-PhillipsHD #algorithm #process #recognition
- An efficient registration and recognition algorithm via sieve processes (PJP, JH, SMD), pp. 775–779.
- ICPR-1996-ReiherLDLHZ #recognition #robust
- A system for efficient and robust map symbol recognition (ER, YL, VDD, ML, CH, CZ), pp. 783–787.
- ICPR-1996-SaidCS
- Dynamical morphological processing: a fast method for base line extraction (JNS, MC, CYS), pp. 8–12.
- ICPR-1996-SawasakiMU #analysis #design #implementation #realtime #visual notation
- Design and implementation of high-speed visual tracking system for real-time motion analysis (NS, TM, TU), pp. 478–483.
- ICPR-1996-Schikuta #clustering #named #scalability #set
- Grid-clustering: an efficient hierarchical clustering method for very large data sets (ES), pp. 101–105.
- ICPR-1996-SchlicherBV #locality
- Fast analytical medial-axis localization in convex polyhedra (MPPS, EB, PWV), pp. 55–61.
- ICPR-1996-SequeiraGR #3d #re-engineering
- Active view selection for efficient 3D scene reconstruction (VS, JGMG, MIR), pp. 815–819.
- ICPR-1996-Shimshoni #3d #image #nondeterminism #recognition
- A fast method for estimating the uncertainty in the location of image points in 3D recognition (IS), pp. 590–594.
- ICPR-1996-Skubalska-RafajlowiczK #classification #metric #using
- Fast k-NN classification rule using metric on space-filling curves (ESR, AK), pp. 121–125.
- ICPR-1996-TuzikovMH #symmetry
- Efficient computation of a reflection symmetry measure for convex polygons based on Minkowski addition (AVT, GLM, HJAMH), pp. 236–240.
- ICPR-1996-Vailaya0J #image #retrieval
- A hierarchical system for efficient image retrieval (AV, YZ, AKJ), pp. 356–360.
- ICPR-1996-WestlingD #generative #interactive #reasoning #recognition
- Object recognition by fast hypothesis generation and reasoning about object interactions (MFW, LSD), pp. 148–153.
- ICPR-1996-YuY #algorithm #image
- An efficient algorithm for smoothing binary image contours (DY, HY), pp. 403–407.
- KDD-1996-Domingos96a #induction
- Efficient Specific-to-General Rule Induction (PMD), pp. 319–322.
- KDD-1996-KramerP
- Efficient Search for Strong Partial Determinations (SK, BP), pp. 371–374.
- KDD-1996-Ullman #implementation
- Efficient Implementation of Data Cubes Via Materialized Views (JDU), pp. 386–388.
- KR-1996-CadoliDLS #information management #representation
- Comparing Space Efficiency of Propositional Knowledge Representation Formalisms (MC, FMD, PL, MS), pp. 364–373.
- KR-1996-SmirnovV #contest #integer #programming #representation
- Efficiency Competition through Representation Changes: Pigeonhole Principle vs. Integer Programming Methods (YVS, MMV), pp. 124–134.
- SEKE-1996-HwangCWS #3d #using #visualisation
- A Fast 3-D Visualization Methodology Using Characteristic Views of Objects (SH, SYC, TW, PCYS), pp. 577–584.
- SEKE-1996-JamoussiB #generative #monte carlo #random testing #testing
- Efficient Monte Carlo Method for Generating Random Test Data from Irregular Test Regions (AJ, FBB), pp. 17–24.
- SIGIR-1996-BellM #design #information management
- The Design of a High Performance Information Filtering System (TAHB, AM), pp. 12–20.
- SIGIR-1996-CahoonM #architecture #distributed #evaluation #information retrieval
- Performance Evaluation of a Distributed Architecture for Information Retrieval (BC, KSM), pp. 110–118.
- SIGIR-1996-KamathR #information management #information retrieval #transaction
- Efficient Transaction Support for Dynamic Information Retrieval Systems (MK, KR), pp. 147–155.
- SIGIR-1996-LiuLYR #2d #memory management #proximity #query
- Efficient Processing of One and Two Dimensional Proximity Queries in Associative Memory (KLL, GJL, CTY, NR), pp. 138–146.
- OOPSLA-1996-BaconS #c++ #static analysis
- Fast Static Analysis of C++ Virtual Function Calls (DFB, PFS), pp. 324–341.
- AdaEurope-1996-MillanB #ada #persistent
- Ada/O2 Coupling: A Solution for an Efficient Management of Persistence in Ada 83 (TM, PB), pp. 396–412.
- PLDI-1996-Adl-TabatabaiLLW #independence #mobile #source code
- Efficient and Language-Independent Mobile Programs (ARAT, GL, SL, RW), pp. 127–136.
- PLDI-1996-AuslanderPCEB #compilation #effectiveness
- Fast, Effective Dynamic Compilation (JA, MP, CC, SJE, BNB), pp. 149–159.
- PLDI-1996-Engler #code generation #named
- VCODE: a Retargetable, Extensible, Very Fast Dynamic Code Generation System (DRE), pp. 160–170.
- PLILP-1996-Fecht #logic programming #precise #source code
- An Efficient and Precise Sharing Domain for Logic Programs (CF), pp. 469–470.
- PLILP-1996-RoyMS #concurrent #constraints #programming
- Integrating Efficient Records into Concurrent Constraint Programming (PVR, MM, RS), pp. 438–453.
- POPL-1996-EnglerHK #code generation #independence
- ‘C: A Language for High-Level, Efficient, and Machine-Independent Dynamic Code Generation (DRE, WCH, MFK), pp. 131–144.
- POPL-1996-JacksonJD #specification
- Faster Checking of Software Specifications by Eliminating Isomorphs (DJ, SJ, CD), pp. 79–90.
- SAS-1996-FechtS #equation
- An Even Faster Solver for General Systems of Equations (CF, HS), pp. 189–204.
- SAC-1996-BurgeN #communication #distributed #memory management
- A decentralized communication efficient distributed shared memory (LLBI, MLN), pp. 358–365.
- SAC-1996-Cripps #predict #using
- Using artificial neural nets to predict academic performance (AC), pp. 33–37.
- SAC-1996-CucuccioGS #fuzzy #logic #low cost
- W.A.R.P and FUZZYSTUDIO: an easy and fast way to implement, With low cost, fuzzy logic control systems (AC, BG, GS), pp. 580–585.
- SAC-1996-LeeHHC #case study #how #implementation #problem #process #set
- Efficient implementations of two variant subset sum problems: a case study of how to process appraisal books resulting from fire-destroyed money (PL, FYH, CYH, HTC), pp. 230–237.
- ASPLOS-1996-ErlichsonNCH #clustering #distributed #memory management #named
- SoftFLASH: Analyzing the Performance of Clustered Distributed Virtual Shared Memory (AE, NN, GC, JLH), pp. 210–220.
- ASPLOS-1996-GrunwaldN #optimisation #thread
- Whole-Program Optimization for Time and Space Efficient Threads (DG, RN), pp. 50–59.
- ASPLOS-1996-PeirHYO
- Improving Cache Performance with Balanced Tag and Data Paths (JKP, WWH, HCY, SO), pp. 268–278.
- ASPLOS-1996-RomerLVWWBBL
- The Structure and Performance of Interpreters (THR, DL, GMV, AW, WAW, JLB, BNB, HML), pp. 150–159.
- CC-1996-LiK #reuse #using
- Efficient Storage Reuse of Aggregates in Single Assignment Languages (ZL, CCK), pp. 238–252.
- CC-1996-McLeanH #earley #parsing
- A Faster Earley Parser (PM, RNH), pp. 281–293.
- DAC-1996-BasaranR #algorithm #constraints
- An O(n) Algorithm for Transistor Stacking with Performance Constraints (BB, RAR), pp. 221–226.
- DAC-1996-ChenCW #optimisation
- Fast Performance-Driven Optimization for Buffered Clock Trees Based on Lagrangian Relaxation (CPC, YWC, DFW), pp. 405–408.
- DAC-1996-ChenH #algorithm #approximate
- Efficient Approximation Algorithms for Floorplan Area Minimization (DZC, XH), pp. 483–486.
- DAC-1996-DesaiCJ #cpu #network
- Sizing of Clock Distribution Networks for High Performance CPU Chips (MPD, RC, JJ), pp. 389–394.
- DAC-1996-GenderenM #using
- Using Articulation Nodes to Improve the Efficiency of Finite-Element based Resistance Extraction (AJvG, NPvdM), pp. 758–763.
- DAC-1996-HiguchiM #algorithm #finite #reduction #state machine
- A Fast State Reduction Algorithm for Incompletely Specified Finite State Machines (HH, YM), pp. 463–466.
- DAC-1996-KernsY #analysis #congruence #multi #network #reduction #scalability
- Stable and Efficient Reduction of Large, Multiport RC Networks by Pole Analysis via Congruence Transformations (KJK, ATY), pp. 280–285.
- DAC-1996-LillisCLH #trade-off
- New Performance Driven Routing Techniques With Explicit Area/Delay Tradeoff and Simultaneous Wire Sizing (JL, CKC, TTYL, CYH), pp. 395–400.
- DAC-1996-LiouLC #pipes and filters #pseudo #testing
- Area Efficient Pipelined Pseudo-Exhaustive Testing with Retiming (HYL, TTYL, CKC), pp. 274–279.
- DAC-1996-Matsunaga #equivalence
- An Efficient Equivalence Checker for Combinational Circuits (YM), pp. 629–634.
- DAC-1996-PhilippsCL #analysis #reduction
- Efficient Full-Wave Electromagnetic Analysis via Model-Order Reduction of Fast Integral Transforms (JRP, EC, DDL), pp. 377–382.
- DAC-1996-SanghaviRBS #memory management
- High Performance BDD Package By Exploiting Memory Hiercharchy (JVS, RKR, RKB, ALSV), pp. 635–640.
- DAC-1996-Sheehan
- An AWE Technique for Fast Printed Circuit Board Delays (BNS), pp. 539–543.
- DAC-1996-StornettaB #implementation #parallel
- Implementation of an Efficient Parallel BDD Package (TS, FB), pp. 641–644.
- DAC-1996-SunDH #equation #geometry #independence #parametricity #using
- Fast Parameters Extraction of General Three-Dimension Interconnects Using Geometry Independent Measured Equation of Invariance (WS, WWMD, WHI), pp. 371–376.
- DAC-1996-SuzukiS #estimation #hardware
- Efficient Software Performance Estimation Methods for Hardware/Software Codesign (KS, ALSV), pp. 605–610.
- DAC-1996-TelicheveskyKW #analysis
- Efficient AC and Noise Analysis of Two-Tone RF Circuits (RT, KSK, JW), pp. 292–297.
- DAC-1996-TsuiMMP
- Improving the Efficiency of Power Simulators by Input Vector Compaction (CYT, RM, DM, MP), pp. 165–168.
- DAC-1996-VerlindJL #analysis
- Efficient Partial Enumeration for Timing Analysis of Asynchronous Systems (EV, GGdJ, BL), pp. 55–58.
- DAC-1996-VideiraVS #communication #design
- Efficient Communication in a Design Environment (IV, PV, HS), pp. 169–174.
- HPCA-1996-CvetanovicB #specification #using
- Performance Characterization of the Alpha 21164 Microprocessor Using TP and SPEC Workloads (ZC, DB), pp. 270–280.
- HPCA-1996-GulatiB #parallel #thread
- Performance Study of a Multithreaded Superscalar Microprocessor (MG, NB), pp. 291–301.
- HPCA-1996-KarlssonS #clustering #evaluation #multi
- Performance Evaluation of a Cluster-Based Multiprocessor Built from ATM Switches and Bus-Based Multiprocessor Servers (MK, PS), pp. 4–13.
- HPCA-1996-KontothanassisS #distributed #interface #memory management #network #using
- Using Memory-Mapped Network Interfaces to Improve the Performance of Distributed Shared Memory (LIK, MLS), pp. 166–177.
- HPCA-1996-XiaT #multi #operating system
- Improving the Data Cache Performance of Multiprocessor Operating Systems (CX, JT), pp. 85–94.
- HPDC-1996-BotorogK #algorithm #distributed #imperative #named #programming
- Skil: An Imperative Language with Algorithmic Skeletons for Efficient Distributed Programming (GHB, HK), pp. 243–252.
- HPDC-1996-CarterLA #clustering #comparison
- Commodity Clusters: Performance Comparison Between PC’s and Workstations (RC, JL, RA), pp. 292–304.
- HPDC-1996-CrandallSC #clustering #comparison #multi
- Performance Comparison of Desktop Multiprocessing and Workstation Cluster Computing (PC, EVS, MJC), pp. 272–281.
- HPDC-1996-FigueiraB #modelling
- Modeling the Effects of Contention on the Performance of Heterogeneous Applications (SMF, FB), pp. 392–401.
- HPDC-1996-FosterGNST #distributed #empirical #framework
- Software Infrastructure for the I-WAY Performance Distributed Computing Experiment (ITF, JG, BN, WS, ST), pp. 562–571.
- HPDC-1996-FoxF #distributed #evolution #towards #virtual machine #web
- Towards Web/Java-Based High Performance Distributed Computing-an Evolving Virtual Machine (GF, WF), pp. 308–317.
- HPDC-1996-LigonR #distributed #file system #implementation #parallel
- Implementation and Performance of a Parallel File System for High Performance Distributed Applications (WBLI, RBR), pp. 471–480.
- HPDC-1996-LuO #algorithm #parallel
- A Massively Parallel Fast Multipole Algorithm in Three Dimensions (EJLL, DIO), pp. 40–48.
- HPDC-1996-SolimanE #adaptation #clustering #distributed #simulation
- An Efficient Clustered Adaptive-Risk Technique for Distributed Simulation (HMS, ASE), pp. 383–391.
- PDP-1996-ChenPK #architecture #parallel #thread
- Performance of Shared Cache on Multithreaded Architectures (YYC, JKP, CTK), pp. 541–548.
- PDP-1996-DubouxF #distributed #scalability #taxonomy
- Achieving Good Performance for Dictionary Machines: A Scalable Distributed Data Balancing Technique (TD, AF), pp. 266–273.
- PDP-1996-GiloiBS #architecture #distributed #memory management #named #prototype
- MANNA: Prototype of a Distributed Memory Architecture with Maximized Sustained Performance (WKG, UB, WSP), pp. 297–304.
- PDP-1996-KimKY #multi
- A New Efficient Submesh Allocation Strategy for Mesh Multicomputers (GK, JK, HY), pp. 227–234.
- PDP-1996-KimKYMC #analysis #multi #network
- Performance Analysis of Multipath Multistage Interconnection Networks with Nonuniform Output Traffic Distribution (BK, BK, HY, SM, JWC), pp. 196–203.
- PDP-1996-MassariM #automation #source code
- Performance Evualuation of Automatically Generated Data-Parallel Programs (LM, YM), pp. 534–540.
- ESOP-1996-MontanariPY #equivalence
- Efficient Minimization up to Location Equivalence (UM, MP, DY), pp. 265–279.
- RWLW-1996-Eker #equation
- Fast matching in combinations of regular equational theories (SE), pp. 90–109.
- STOC-1996-CheriyanT #algorithm
- Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation (JC, RT), pp. 37–46.
- STOC-1996-FarachK #algorithm #evolution
- Efficient Algorithms for Inverting Evolution (MF, SK), pp. 230–236.
- STOC-1996-Grover #algorithm #database #quantum
- A Fast Quantum Mechanical Algorithm for Database Search (LKG), pp. 212–219.
- STOC-1996-KleinL #algorithm #approximate #source code
- Efficient Approximation Algorithms for Semidefinite Programs Arising from MAX CUT and COLORING (PNK, HIL), pp. 338–347.
- STOC-1996-McCormick #algorithm #parametricity #scheduling
- Fast Algorithms for Parametric Scheduling Come from Extensions to Parametric Maximum Flow (STM), pp. 319–328.
- STOC-1996-Spielman #graph #morphism #testing
- Faster Isomorphism Testing of Strongly Regular Graphs (DAS), pp. 576–584.
- STOC-1996-VengroffV #3d #memory management
- Efficient 3-D Range Searching in External Memory (DEV, JSV), pp. 192–201.
- TACAS-1996-DamonJ #specification
- Efficient Search as a Means of Executing Specifications (CD, DJ), pp. 70–86.
- CADE-1996-SchutzG #compilation #generative
- Efficient Model Generation through Compilation (HS, TG), pp. 433–447.
- CSL-1996-BaazL
- Fast Cut-Elimination by Projection (MB, AL), pp. 18–33.
- ISSTA-1996-KangL #analysis #generative #realtime
- An Efficient State Space Generation for Analysis of Real-Time Systems (IK, IL), pp. 4–13.
- JICSLP-1996-KusalikP #execution #logic programming #parallel #visualisation
- Visualizing Parallel Logic Program Execution for Performance Tuning (AJK, SDP), pp. 498–512.
- JICSLP-1996-NiemelaS #implementation #semantics
- Efficient Implementation of the Well-founded and Stable Model Semantics (IN, PS), pp. 289–303.
- LICS-1996-BhatC #calculus #equation #model checking #μ-calculus
- Efficient Model Checking via the Equational μ-Calculus (GB, RC), pp. 304–312.
- LICS-1996-NatarajanC #algebra #process
- An Algebraic Theory of Process Efficiency (VN, RC), pp. 63–72.
- ICDAR-v1-1995-Kawatani #recognition #using
- Character recognition performance improvement using personal handwriting characteristics (TK), pp. 98–103.
- ICDAR-v1-1995-LuOS #comprehension #interactive #recognition
- A proposal of efficient interactive recognition system for understanding of map drawings (WL, TO, MS), pp. 520–523.
- ICDAR-v2-1995-AriasKC
- Efficient techniques for telephone company line drawing interpretation (JFA, RK, AKC), pp. 795–798.
- ICDAR-v2-1995-DeforgesB #detection #documentation #image #multi #robust #segmentation
- Segmentation of Complex Documents Multilevel Images: A Robust and Fast Text Bodies-Headers Detection and Extraction Scheme 770 (OD, DB), pp. 770–773.
- ICDAR-v2-1995-FutrelleN #analysis #constraints #diagrams #parsing #using
- Efficient analysis of complex diagrams using constraint-based parsing (RPF, NN), pp. 782–790.
- ICDAR-v2-1995-SauvolaP #analysis #classification #feature model #segmentation #using
- Page segmentation and classification using fast feature extraction and connectivity analysis (JJS, MP), pp. 1127–1131.
- ICDAR-v2-1995-Smith #algorithm #detection
- A simple and efficient skew detection algorithm via text row accumulation (RS), pp. 1145–1148.
- SIGMOD-1995-AdyaGLM #concurrent #using
- Efficient Optimistic Concurrency Control Using Loosely Synchronized Clocks (AA, RG, BL, UM), pp. 23–34.
- SIGMOD-1995-FaloutsosL #algorithm #dataset #multi #named #visualisation
- FastMap: A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets (CF, KIL), pp. 163–174.
- SIGMOD-1995-LuMSS #maintenance
- Efficient Maintenance of Materialized Mediated Views (JJL, GM, JS, VSS), pp. 340–351.
- SIGMOD-1995-WhiteD #implementation
- Implementing Crash Recovery in QuickStore: A Performance Study (SJW, DJD), pp. 187–198.
- VLDB-1995-AgrawalLSS #database #scalability #similarity
- Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases (RA, KIL, HSS, KS), pp. 490–501.
- VLDB-1995-AmsalegFG #database #garbage collection #incremental
- Efficient Incremental Garbage Collection for Client-Server Object Database Systems (LA, MJF, OG), pp. 42–53.
- VLDB-1995-EicklerGK #evaluation
- A Performance Evaluation of OID Mapping Techniques (AE, CAG, DK), pp. 18–29.
- VLDB-1995-GallersdorferN #database
- Improving Performance in Replicated Databases through Relaxed Coherency (RG, MN), pp. 445–456.
- VLDB-1995-LeslieJBY #multi
- Efficient Search of Multi-Dimensional B-Trees (HL, RJ, DB, HY), pp. 710–719.
- VLDB-1995-SavasereON #algorithm #database #mining #scalability
- An Efficient Algorithm for Mining Association Rules in Large Databases (AS, EO, SBN), pp. 432–444.
- VLDB-1995-WuYCT #concurrent #database #multi
- A Performance Study of Workfile Disk Management for Concurrent Mergesorts in a Multiprocessor Database System (KLW, PSY, JYC, JZT), pp. 100–109.
- DLT-1995-Hartmann
- Efficient Subgraph Matching Within Cellular Hypergraphs (PH), pp. 309–318.
- ICALP-1995-BermondGRV
- Fast Gossiping by Short Messages (JCB, LG, AAR, UV), pp. 135–146.
- RTA-1995-SchmidF #testing #towards
- Towards an Efficient Construction of Test Sets for Deciding Ground Reducability (KS, RF), pp. 86–100.
- AFP-1995-EekelenP95 #functional #source code
- Constructing Medium Sized Efficient Functional Programs in Clean (MCJDvE, MJP), pp. 183–227.
FPCA-1995-GoncalvesA #source code- Cache Performance of Fast-Allocating Programs (MJRG, AWA), pp. 293–305.
- CIKM-1995-ElmagarmidJB #algorithm #mobile #reliability #transaction
- An Efficient and Reliable Reservation Algorithm for Mobile Transactions (AKE, JJ, OAB), pp. 90–95.
- CIKM-1995-KimC #information retrieval #parallel
- A New Parallel Signature File Method for Efficient Information Retrieval (JKK, JWC), pp. 66–73.
- CIKM-1995-ParkCY #data mining #mining #parallel
- Efficient Parallel and Data Mining for Association Rules (JSP, MSC, PSY), pp. 31–36.
- ICML-1995-CichoszM #difference #learning
- Fast and Efficient Reinforcement Learning with Truncated Temporal Differences (PC, JJM), pp. 99–107.
- ICML-1995-Cohen #effectiveness #induction
- Fast Effective Rule Induction (WWC), pp. 115–123.
- ICML-1995-FultonKS #algorithm #multi
- Efficient Algorithms for Finding Multi-way Splits for Decision Trees (TF, SK, SS), pp. 244–251.
- ICML-1995-Lubinsky #classification #consistency #using
- Increasing the Performance and Consistency of Classification Trees by Using the Accuracy Criterion at the Leaves (DJL), pp. 371–377.
- ICML-1995-MaassW #learning
- Efficient Learning with Virtual Threshold Gates (WM, MKW), pp. 378–386.
- ICML-1995-MoriartyM #evolution #learning
- Efficient Learning from Delayed Rewards through Symbiotic Evolution (DEM, RM), pp. 396–404.
- ICML-1995-Peng #programming
- Efficient Memory-Based Dynamic Programming (JP), pp. 438–446.
- KDD-1995-HwangF #algorithm #induction
- Efficient Algorithms for Attribute-Oriented Induction (HYH, AWCF), pp. 168–173.
- KDD-1995-StolorzNMMSSYNCMF #data mining #dataset #mining #scalability
- Fast Spatio-Temporal Data Mining of Large Geophysical Datasets (PES, HN, EM, RRM, ECS, JRS, JY, KWN, SYC, CRM, JDF), pp. 300–305.
- SEKE-1995-CostagliolaLOT #data flow #graph #parsing
- Efficient Parsing of Data-Flow Graphs (GC, ADL, SO, GT), pp. 226–233.
- SIGIR-1995-Brown #evaluation #information retrieval #query
- Fast Evaluation of Structured Queries for Information Retrieval (EWB0), pp. 30–38.
- SIGIR-1995-Chien #natural language
- Fast and Quasi-Natural Language Search for Gigabits of Chinese Texts (LFC), pp. 112–120.
- SIGIR-1995-EfraimidisGMST #parallel #retrieval #using
- Parallel Text Retrieval on a High Performance Super Computer Using the Vector Space Model (PSE, CG, BM, PGS, BT), pp. 58–66.
- SIGIR-1995-Klein #retrieval
- Efficient Recompression Techniques for Dynamic Full-Text Retrieval Systems (STK), pp. 39–47.
- SIGIR-1995-PfeiferF #approach #data type #query #using
- Efficient Processing of Vague Queries using a Data Stream Approach (UP, NF), pp. 189–197.
- AdaEurope-1995-RognesS #ada
- Performance Tuning of a Check-Out System Coded in Ada (BR, PIS), pp. 99–110.
- LOPSTR-1995-Hanus #functional #lazy evaluation #logic programming #prolog #source code
- Efficient Translation of Lazy Functional Logic Programs into Prolog (MH), pp. 252–266.
- PLDI-1995-TuP
- Efficient Building and Placing of Gating Functions (PT, DAP), pp. 47–55.
- PLDI-1995-WilsonL #analysis #c #pointer #source code
- Efficient Context-Sensitive Pointer Analysis for C Programs (RPW, MSL), p. 1–?.
- PLILP-1995-DawsonRR #design #implementation #logic programming #source code
- Design and Implementation of Jump Tables for Fast Indexing of Logic Programs (SD, CRR, IVR), pp. 133–150.
- PLILP-1995-GluckJ #generative #multi
- Efficient Multi-level Generating Extensions for Program Specialization (RG, JJ), pp. 259–278.
- PLILP-1995-Mohnen #data type #garbage collection
- Efficient Compile-Time Garbage Collection for Arbitrary Data Structures (MM), pp. 241–258.
- PLILP-1995-TongL #concurrent #constraints #programming
- Performance of A Data-Parallel Concurrent Constraint Programming System (BMT, HfL), pp. 463–464.
- POPL-1995-DawsonRRSSSW #execution #logic programming #source code #unification
- Unification Factoring for Efficient Execution of Logic Programs (SD, CRR, IVR, KFS, SS, TS, DSW), pp. 247–258.
- POPL-1995-PlevyakZC #concurrent #object-oriented
- Obtaining Sequential Efficiency for Concurrent Object-Oriented Languages (JP, XZ, AAC), pp. 311–321.
- SAS-1995-AltM #generative #interprocedural
- Generation of Efficient Interprocedural Analyzers with PAG (MA, FM), pp. 33–50.
- SAS-1995-Mohnen #analysis #higher-order #inheritance
- Efficient Closure Utilisation by Higher-Order Inheritance Analysis (MM), pp. 261–278.
- TRI-Ada-1995-Ogren
- O4S (Objects for Systems): Tailoring MIL-STD-498 for Efficiency (IÖ), pp. 741–772.
- ESEC-1995-Chamillard #analysis #case study #metric #predict #reachability
- An Exploratory Study of Program Metrics as Predictors of Reachability Analysis Performance (ATC), pp. 343–361.
- ESEC-1995-VidalFG #modelling
- Instrumentation of Synchronous Reactive Models for Performance Engineering (AVV, MVF, JGG), pp. 76–89.
- KBSE-1995-LowryB #domain-specific language #named #synthesis
- META-AMPHION: Synthesis of Efficient Domain-Specific Program Synthesis Systems (MRL, JVB), pp. 2–10.
- SAC-1995-BangL #database #named
- SMR-tree: an efficient index structure for spatial databases (KSB, HL), pp. 46–50.
- SAC-1995-BironK #feedback #information retrieval
- New methods for relevance feedback: improving information retrieval performance (PVB, DHK), pp. 482–487.
- SAC-1995-ChenH #algorithm #analysis #concurrent #database
- Performance analysis of a periodic data reorganization algorithm for concurrent B-trees in database systems (IRC, SH), pp. 40–45.
- SAC-1995-Li #algorithm #optimisation #set
- An efficient algorithm for computing a minimum node cutset from a vertex-disjoint path set for timing optimization (WNL), pp. 56–60.
- SAC-1995-MakowskiP #parallel
- Achieving efficient register allocation via parallelism (CM, LLP), pp. 123–129.
- SAC-1995-MotzkinEKT #database #evaluation
- A tool for performance evaluation of database systems for small computer systems (DM, RE, MK, ST), pp. 420–426.
- SAC-1995-RunklerG #algorithm #multi #set
- Multidimensional defuzzification — fast algorithms for the determination of crisp characteristic subsets (TAR, MG), pp. 575–579.
- SAC-1995-SmithPN #analysis #network
- Performance analysis of small FDDI networks (JS, LDP, TN), pp. 401–405.
- DAC-1995-BernMS
- Efficient OBDD-Based Boolean Manipulation in CAD beyond Current Limits (JB, CM, AS), pp. 408–413.
- DAC-1995-ChangMC #algorithm #set
- An Efficient Algorithm for Local Don’t Care Sets Calculation (SCC, MMS, KTC), pp. 663–667.
- DAC-1995-ClarkeGMZ #generative #model checking
- Efficient Generation of Counterexamples and Witnesses in Symbolic Model Checking (EMC, OG, KLM, XZ), pp. 427–432.
- DAC-1995-GeloshS #layout #modelling #tool support
- Deriving Efficient Area and Delay Estimates by Modeling Layout Tools (DSG, DES), pp. 402–407.
- DAC-1995-KonukFL #fault #network #simulation
- Accurate and Efficient Fault Simulation of Realistic CMOS Network Breaks (HK, FJF, TL), pp. 345–351.
- DAC-1995-LalgudiP #modelling #named
- DELAY: An Efficient Tool for Retiming with Realistic Delay Modeling (KNL, MCP), pp. 304–309.
- DAC-1995-LeeW
- A Performance and Routability Driven Router for FPGAs Considering Path Delays (YSL, ACHW), pp. 557–561.
- DAC-1995-LiM #analysis #embedded #using
- Performance Analysis of Embedded Software Using Implicit Path Enumeration (YTSL, SM), pp. 456–461.
- DAC-1995-LiuPD #scalability
- A Fast State Assignment Procedure for Large FSMs (SL, MP, AMD), pp. 327–332.
- DAC-1995-MarculescuMP #correlation #estimation
- Efficient Power Estimation for Highly Correlated Input Streams (RM, DM, MP), pp. 628–634.
- DAC-1995-MehrotraFS #generative
- Performance Driven Global Routing and Wiring Rule Generation for High Speed PCBs and MCMs (SM, PDF, MBS), pp. 381–387.
- DAC-1995-SilveiraKW #3d #modelling
- Efficient Reduced-Order Modeling of Frequency-Dependent Coupling Inductances Associated with 3-D Interconnect Structures (LMS, MK, JW), pp. 376–380.
- DAC-1995-SparmannLCR #fault #identification #robust
- Fast Identification of Robust Dependent Path Delay Faults (US, DL, KTC, SMR), pp. 119–125.
- DAC-1995-TelicheveskyKW #analysis
- Efficient Steady-State Analysis Based on Matrix-Free Krylov-Subspace Methods (RT, KSK, JW), pp. 480–484.
- DAC-1995-TremblayMIK #analysis #architecture #flexibility #trade-off
- A Fast and Flexible Performance Simulator for Micro-Architecture Trade-off Analysis on UltraSPARC-I (MT, GM, AI, LK), pp. 2–6.
- HPCA-1995-AndersonB #multi
- Two Techniques for Improving Performance on Bus-Based Multiprocessors (CA, JLB), pp. 264–275.
- HPCA-1995-CappelloG #communication #network #towards
- Toward High Communication Performance through Compiled Communications on a Circuit Switched Interconnection Network (FC, CG), pp. 44–53.
- HPCA-1995-GovindarajanNL #architecture #design #evaluation #parallel #thread
- Design and Performance Evaluation of a Multithreaded Architecture (RG, SSN, PL), pp. 298–307.
- HPCA-1995-JohnRHC #architecture
- Program Balance and Its Impact on High Performance RISC Architectures (LKJ, VR, PTH, LDC), pp. 370–379.
- HPCA-1995-NuthD #implementation
- The Named-State Register File: Implementation and Performance (PRN, WJD), pp. 4–13.
- HPCA-1995-Panda #multi #network
- Fast Barrier Synchronization in Wormhole k-ary n-cube Networks with Multidestination Worms (DKP), pp. 200–209.
- HPCA-1995-TorrellasXD #operating system #optimisation
- Optimizing Instruction Cache Performance for Operating System Intensive Workloads (JT, CX, RLD), pp. 360–369.
- HPCA-1995-UpadhyayVM #2d #adaptation
- Efficient and Balanced Adaptive Routing in Two-Dimensional Meshes (JU, VV, PM), pp. 112–121.
- HPCA-1995-WesterholzHPH #memory management
- Improving Performance by Cache Driven Memory Management (KW, SH, JP, CH), pp. 234–242.
- HPDC-1995-BaldoniMR #multi #order #realtime
- Efficient Causally Ordered Communications for Multimedia Real-Time Applications (RB, AM, MR), pp. 140–147.
- HPDC-1995-CowanLB #programming
- Performance Benefits of Optimistic Programming: A Measure of HOPE (CC, HL, MAB), pp. 197–204.
- HPDC-1995-DaviesM
- Network-Specific Performance Enhancements for PVM (GD, NSM), pp. 205–211.
- HPDC-1995-JacobL #algorithm #recursion #refinement
- A Spanning Tree Based Recursive Refinement Algorithm for Fast Task Mapping (JCJ, SYL), pp. 58–65.
- HPDC-1995-Menon #array #comparison
- A Performance Comparison of RAID-5 and Log-Structured Arrays (JM0), pp. 167–178.
- HPDC-1995-SalehiKT #network #parallel #scheduling
- The Performance Impact of Scheduling for Cache Affinity in Parallel Network Processing (JDS, JFK, DFT), pp. 66–77.
- IWMM-1995-AttardiFI
- Performance Tuning in a Customizable Collector (GA, TF, PI), pp. 179–196.
- IWMM-1995-SuzukiKT #named #scalability
- MOA — A Fast Sliding Compaction Scheme for a Large Storage Space (MS, HK, MT), pp. 197–210.
- LCT-RTS-1995-LiM #analysis #embedded #using
- Performance Analysis of Embedded Software Using Implicit Path Enumeration (YTSL, SM), pp. 88–98.
- PDP-1995-AudenaertL #concurrent #detection #graph #parallel #source code
- Space efficient data race detection for parallel programs with series-parallel task graphs (KA, LL), pp. 508–515.
- PDP-1995-BadiaV #matrix #multi #problem #symmetry
- Efficient solution of the eigenproblem of banded symmetric Toeplitz matrices on multicomputers (JMB, AMV), pp. 416–423.
- PDP-1995-Broggi #optimisation #parallel #word
- Word parallelism vs spatial parallelism: a performance optimization technique on the PAPRICA system (AB), pp. 236–243.
- PPoPP-1995-BlumofeJKLRZ #named #parallel #runtime #thread
- Cilk: An Efficient Multithreaded Runtime System (RDB, CFJ, BCK, CEL, KHR, YZ), pp. 207–216.
- PPoPP-1995-MukherjeeSHLRS
- Efficient Support for Irregular Applications on Distributed-Memory Machines (SSM, SDS, MDH, JRL, AR, JHS), pp. 68–79.
- PPoPP-1995-WisniewskiKS #algorithm #multi
- High Performance Synchronization Algorithms for Multiprogrammed Multiprocessors (RWW, LIK, MLS), pp. 199–206.
- SOSP-1995-AndersonP #delivery
- The Performance of the Container Shipping I/O System (EWA, JP), p. 229.
- SOSP-1995-BershadSPSFBCE #operating system #safety
- Extensibility, Safety and Performance in the SPIN Operating System (BNB, SS, PP, EGS, MEF, DB, CC, SJE), pp. 267–284.
- SOSP-1995-ChenECMDSS #operating system
- The Measured Performance of Personal Computer Operating Systems (JBC, YE, KC, DM, AD, MIS, MDS), pp. 299–313.
- SOSP-1995-GhemawatKL #database #object-oriented #using
- Using a Modified Object Buffer to Improve the Write Performance of an Object-Oriented Database (SG, MFK, BL), p. 235.
- SOSP-1995-HeidemannP
- Performance of Cache Coherence in Stackable Filing (JSH, GJP), pp. 127–142.
- SOSP-1995-RosenblumBHWG #architecture #operating system #roadmap
- The Impact of Architectural Trends on Operating System Performance (MR, EB, SAH, EW, AG), pp. 285–298.
- STOC-1995-AfekDT
- Wait-free made fast (YA, DD, DT), pp. 538–547.
- STOC-1995-DolevKKP #adaptation #named #network
- Bubbles: adaptive routing scheme for high-speed dynamic networks (SD, EK, DK, DP), pp. 528–537.
- STOC-1995-HartI
- Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal (WEH, SI), pp. 157–168.
- STOC-1995-LovaszW #markov
- Efficient stopping rules for Markov chains (LL, PW), pp. 76–82.
- STOC-1995-Reif #parallel #polynomial
- Work efficient parallel solution of Toeplitz systems and polynomial GCD (JHR), pp. 751–761.
- TACAS-1995-EngbergL #bisimulation
- Efficient Simplification of Bisimulation Formulas (UE, KSL), pp. 111–132.
- CAV-1995-AndersenV #behaviour #fixpoint #using
- Efficient Checking of Behavioural Relations and Modal Assertions using Fixed-Point Inversion (HRA, BV), pp. 142–154.
- CAV-1995-HulgaardB #analysis #petri net
- Efficient Timing Analysis of a Class of Petri Nets (HH, SMB), pp. 423–436.
- ICLP-1995-HermenegildoL
- Efficient Term Size Computation for Granularity Control (MVH, PLG), pp. 647–661.
- ICLP-1995-RamakrishnanRSSW #logic programming #source code
- Efficient Tabling Mechanisms for Logic Programs (IVR, PR, KFS, TS, DSW), pp. 697–711.
- ICLP-1995-SagonasW #execution #implementation #prolog
- Efficient Execution of HiLog in WAM-based Prolog Implementations (KFS, DSW), pp. 349–363.
- ICLP-1995-Sripada #calculus #database #implementation
- Efficient Implementation of the Event Calculus for Temporal Database Applications (SMS), pp. 99–113.
- ILPS-1995-BandaMS #analysis #logic programming #scheduling #source code
- Efficient Analysis of Logic Programs with Dynamic Scheduling (MJGdlB, KM, PJS), pp. 417–431.
- LICS-1995-BhatCG #model checking #on the fly
- Efficient On-the-Fly Model Checking for CTL* (GB, RC, OG), pp. 388–397.
- SIGMOD-1994-BrinkhoffKSS94a #named #query
- GENESYS: A System for Efficient Spatial Query Processing (TB, HPK, RS, BS), p. 519.
- SIGMOD-1994-DarR #algorithm #transitive
- A Performance Study of Transitive Closure Algorithms (SD, RR), pp. 454–465.
- SIGMOD-1994-FaloutsosRM #database #sequence
- Fast Subsequence Matching in Time-Series Databases (CF, MR, YM), pp. 419–429.
- SIGMOD-1994-ImielinskiVB #energy
- Energy Efficient Indexing on Air (TI, SV, BRB), pp. 25–36.
- SIGMOD-1994-SagonasSW #database #deduction
- XSB as an Efficient Deductive Database Engine (KFS, TS, DSW), pp. 442–453.
- SIGMOD-1994-VingralekBW #distributed #scalability
- Distributed File Organization with Scalable Cost/Performance (RV, YB, GW), pp. 253–264.
- SIGMOD-1994-WhiteD #named
- QuickStore: A High Performance Mapped Object Store (SJW, DJD), pp. 395–406.
- VLDB-1994-AgrawalS #algorithm #database #mining #scalability
- Fast Algorithms for Mining Association Rules in Large Databases (RA, RS), pp. 487–499.
- VLDB-1994-AnandBH #database #empirical #scalability
- An Empirical Performance Study of the Ingres Search Accelerator for a Large Property Management Database System (SSA, DAB, JGH), pp. 676–685.
- VLDB-1994-BrownCC #incremental #information retrieval
- Fast Incremental Indexing for Full-Text Information Retrieval (EWB, JPC, WBC), pp. 192–202.
- VLDB-1994-BrownMCL #automation #towards
- Towards Automated Performance Tuning for Complex Workloads (KPB, MM, MJC, ML), pp. 72–84.
- VLDB-1994-ColletCS #composition #database #named #object-oriented
- NAOS — Efficient and Modular Reactive Capabilities in an Object-Oriented Database System (CC, TC, TS), pp. 132–143.
- VLDB-1994-Galindo-LegariaPK #question #random #why
- Fast, Randomized Join-Order Selection — Why Use Transformations? (CAGL, AP, MLK), pp. 85–95.
- VLDB-1994-HoelS
- Performance of Data-Parallel Spatial Operations (EGH, HS), pp. 156–167.
- VLDB-1994-JagadishLRSS #in memory #memory management #named
- Dalí: A High Performance Main Memory Storage Manager (HVJ, DFL, RR, AS, SS), pp. 48–59.
- VLDB-1994-JohnsonS #algorithm #named
- 2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm (TJ, DS), pp. 439–450.
- VLDB-1994-NgH #clustering #data mining #effectiveness #mining
- Efficient and Effective Clustering Methods for Spatial Data Mining (RTN, JH), pp. 144–155.
- VLDB-1994-SreenathS #database #object-oriented
- The hcC-tree: An Efficient Index Structure for Object Oriented Databases (BS, SS), pp. 203–213.
- VLDB-1994-WienerN
- Bulk Loading into an OODB: A Performance Study (JLW, JFN), pp. 120–131.
- VLDB-1994-XieH #database #object-oriented
- Join Index Hierarchies for Supporting Efficient Navigations in Object-Oriented Databases (ZX, JH), pp. 522–533.
- ICALP-1994-Feige #algorithm #graph #random
- A Fast Randomized LOGSPACE Algorithm for Graph Connectivity (UF), pp. 499–507.
- ICALP-1994-GilM #parallel
- Simple Fast Parallel Hashing (JYG, YM), pp. 239–250.
- ICALP-1994-GyssensBG
- Expressiveness of Efficient Semi-Deterministic Choice Constructs (MG, JVdB, DVG), pp. 106–117.
- ICALP-1994-HotzP #analysis #context-free grammar
- Fast Uniform Analysis of Coupled-Context-Free Languages (GH, GP), pp. 412–423.
- ICALP-1994-MeiI #navigation
- Efficient Strategies for Robot Navigation in Unknown Environment (AM, YI), pp. 630–641.
- ICALP-1994-VergauwenL #correctness #equation
- Efficient Local Correctness Checking for Single and Alternating Boolean Equation Systems (BV, JL), pp. 304–315.
- ICALP-1994-YusterZ
- Finding Even Cycles Even Faster (RY, UZ), pp. 532–543.
- LFP-1994-AshleyD #implementation #multi
- An Efficient Implementation of Multiple Return Values in Scheme (JMA, RKD), pp. 140–149.
- CHI-1994-KurtenbachB94a #learning
- User learning and performance with marking menus (GK, WB), pp. 258–264.
- CHI-1994-MasuiN94b #editing #predict
- Repeat and predict — two keys to efficient text editing (TM, KN), pp. 118–123.
- CHI-1994-VenoliaN94a #named #self
- T-Cube: a fast, self-disclosing pen-based alphabet (DV, FN), pp. 265–270.
- CSCW-1994-PrakashS #collaboration #named #using
- DistView: Support for Building Efficient Collaborative Applications Using Replicated Objects (AP, HSS), pp. 153–164.
- CSCW-1994-ZabeleRV #framework
- High Performance Infrastructure for Visually-Intensive CSCW Applications (SZ, SLR, RLV), pp. 395–403.
- CIKM-1994-Shrufi #clustering #policy
- Performance of Clustering Policies in Object Bases (AS), pp. 80–87.
- ICML-1994-KietzL #algorithm #induction #logic programming
- An Efficient Subsumption Algorithm for Inductive Logic Programming (JUK, ML), pp. 130–138.
- ICML-1994-MooreL #algorithm #fault #validation
- Efficient Algorithms for Minimizing Cross Validation Error (AWM, MSL), pp. 190–198.
- ICML-1994-Schaffer
- A Conservation Law for Generalization Performance (CS), pp. 259–265.
- KDD-1994-MannilaTV #algorithm
- Efficient Algorithms for Discovering Association Rules (HM, HT, AIV), pp. 181–192.
- KR-1994-Ben-EliyahuP #algorithm #modelling #reasoning
- Reasoning with Minimal Models: Efficient Algorithms and Applications (RBE, LP), pp. 39–50.
- KR-1994-GereviniS #reasoning
- An Efficient Method for Managing Disjunctions in Qualitative Temporal Reasoning (AG, LKS), pp. 214–225.
- SEKE-1994-JacksonLP #automation #constraints #modelling #specification #towards
- Towards automatic building of performance models: Formal specification of performance constraints (KJ, AL, RP), pp. 148–155.
- SIGIR-1994-Allen #information retrieval #learning
- Perceptual Speed, Learning and Information Retrieval Performance (BA), pp. 71–80.
- SIGIR-1994-Persin #documentation #ranking
- Document Filtering for Fast Ranking (MP), pp. 339–348.
- SIGIR-1994-ShoensTG #analysis #incremental
- Synthetic Workload Performance Analysis of Incremental Updates (KAS, AT, HGM), pp. 329–338.
- SIGIR-1994-Turtle #comparison #evaluation #natural language #query #retrieval
- Natural Language vs. Boolean Query Evaluation: A Comparison of Retrieval Performance (HRT), pp. 212–220.
- SIGIR-1994-Yang #categorisation #effectiveness #learning #network #retrieval
- Expert Network: Effective and Efficient Learning from Human Decisions in Text Categorization and Retrieval (YY), pp. 13–22.
- ECOOP-1994-ChenTK #multi
- Efficient Dynamic Look-Up Strategy for Multi-Methods (WC, VT, WK), pp. 408–431.
- ECOOP-1994-VitekH #message passing
- Taming Message Passing: Efficient Method Look-Up for Dynamically Typed Languages (JV, RNH), pp. 432–449.
- OOPSLA-1994-HolzleU #implementation #latency
- A Third-Generation SELF Implementation: Reconsiling Responsiveness with Performance (UH, DU), pp. 229–243.
- OOPSLA-1994-KarpovichGF #approach #file system #object-oriented
- Extensible File Systems (ELFS): An Object-Oriented Approach to High Performance File I/O (JFK, ASG, JCF), pp. 191–204.
- PLDI-1994-AustinBS #array #detection #fault #pointer
- Efficient Detection of All Pointer and Array Access Errors (TMA, SEB, GSS), pp. 290–301.
- PLDI-1994-Reinhold #garbage collection #source code
- Cache Performance of Garbage-Collected Programs (MBR), pp. 206–217.
- PLDI-1994-Wang #precise #predict
- Precise Compile-Time Performance Prediction for Superscalar-Based Computers (KYW), pp. 73–84.
- PLILP-1994-BevemyrL #garbage collection #prolog
- A Simple and Efficient Copying Garbage Collector for Prolog (JB, TL), pp. 88–101.
- PLILP-1994-ChikayamaFS #implementation
- A Portable and Efficient Implementation of KL1 (TC, TF, DS), pp. 25–39.
- PLILP-1994-CodognetD #constraints #theorem proving
- clp(B): Combining Simplicity and Efficiency in Boolean Constraint Solving (PC, DD), pp. 244–260.
- PLILP-1994-MetzemakersMSS #using
- Improving Arithmetic Performance using Fine-Grain Unfolding (TM, AM, DS, RS), pp. 324–339.
- POPL-1994-DiwanTM #garbage collection #memory management #source code #using
- Memory Subsystem Performance of Programs Using Copying Garbage Collection (AD, DT, JEBM), pp. 1–14.
- SAS-1994-ArmstrongMSS #algebra #analysis #dependence #representation
- Boolean Functions for Dependency Analysis: Algebraic Properties and Efficient Representation (TA, KM, PS, HS), pp. 266–280.
- SAS-1994-Consel #analysis #fixpoint #strict
- Fast Strictness Analysis Via Symbolic Fixpoint Iteration (CC), pp. 423–431.
- SAS-1994-JensenHR #analysis #haskell #strict
- Efficient Strictness Analysis of Haskell (KDJ, PH, MR), pp. 246–362.
- SAS-1994-MuellerW #analysis #behaviour #on the fly #simulation
- Efficient On-the-fly Analysis of Program Behavior and Static Cache Simulation (FM, DBW), pp. 101–115.
- SAS-1994-VergauwenWL #fixpoint
- Efficient FixPoint Computation (BV, JW, JL), pp. 314–328.
- ICSE-1994-TakadaMT #debugging #process #testing
- A Programmer Performance Measure Based on Programmer State Transitions in Testing and Debugging Process (YT, KiM, KT), pp. 123–132.
- SAC-1994-BosschereT #continuation #prolog
- High performance continuation passing style Prolog-to-C mapping (KDB, PT), pp. 383–387.
- SAC-1994-ChenB #analysis #concurrent #database #detection #petri net #transaction
- A Petri net model for the performance analysis of transaction database systems with continuous deadlock detection (IRC, RB), pp. 539–544.
- SAC-1994-GordonBW #algorithm #problem #search-based
- A note on the performance of genetic algorithms on zero-one knapsack problems (VSG, APWB, DW), pp. 194–195.
- SAC-1994-Julstrom #algorithm #problem #search-based
- Seeding the population: improved performance in a genetic algorithm for the rectilinear Steiner problem (BAJ), pp. 222–226.
- SAC-1994-LiMC #analysis #fuzzy
- Performance analysis of fuzzy proportional-derivative control systems (HL, HAM, GC), pp. 115–119.
- SAC-1994-MerkleL #algorithm #analysis #parallel #search-based
- An initial analysis of data parallelism in the fast messy genetic algorithm (LDM, GBL), pp. 488–492.
- SAC-1994-MotzkinG #information management #parallel
- Parallel organization and performance of an information system (DM, AKG), pp. 499–503.
- SAC-1994-RunklerG #approximate #fuzzy #named #realtime
- DECADE — fast centroid approximation defuzzification for real time fuzzy control applications (TAR, MG), pp. 161–165.
- SAC-1994-Sabharwal #algorithm #implementation
- A fast implementation of surface/surface intersection algorithm (CLS), pp. 333–337.
- SAC-1994-VaradarajanH #adaptation #algorithm #refinement
- An efficient dynamic load balancing algorithm for adaptive mesh refinement (RV, IH), pp. 467–472.
- ASPLOS-1994-CarterKD #hardware
- Hardware Support for Fast Capability-based Addressing (NPC, SWK, WJD), pp. 319–327.
- ASPLOS-1994-EnglerP #code generation #definite clause grammar #named
- DCG: An Efficient, Retargetable Dynamic Code Generation System (DRE, TAP), pp. 263–272.
- ASPLOS-1994-HeinrichKOHBSSGNHGRH #flexibility #multi
- The Performance Impact of Flexibility in the Stanford FLASH Multiprocessor (MH, JK, DO, JH, JB, JPS, RS, KG, DN, MH, AG, MR, JLH), pp. 274–285.
- ASPLOS-1994-MaynardDO #multi
- Contrasting Characteristics and Cache Performance of Technical and Multi-User Commercial Workloads (AMGM, CMD, BRO), pp. 145–156.
- ASPLOS-1994-SchmidtN #garbage collection #realtime
- Performance of a Hardware-Assisted Real-Time Garbage Collector (WJS, KDN), pp. 76–85.
- ASPLOS-1994-TalluriH #operating system
- Surpassing the TLB Performance of Superpages with Less Operating System Support (MT, MDH), pp. 171–182.
- ASPLOS-1994-ThekkathL #exception #hardware
- Hardware and Software Support for Efficient Exception Handling (CAT, HML), pp. 110–119.
- ASPLOS-1994-WooSH #multi
- The Performance Advantages of Integrating Block Data Trabsfer in Cache-Coherent Multiprocessors (SCW, JPS, JLH), pp. 219–229.
- CC-1994-BenkerBZ #array #compilation #fortran #interface
- Processing Array Statements and Procedure Interfaces in the PREPARE High Performance Fortran Compiler (SB, PB, HPZ), pp. 324–338.
- CC-1994-HogenL #distributed #implementation
- Efficient Organization of Control Structures in Distributed Implementations (GH, RL), pp. 98–112.
- CC-1994-Poetzsch-Heffter #formal method #specification
- Developing Efficient Interpreters Based on Formal Language Specifications (APH), pp. 233–247.
- CC-1994-RingstromFP #compilation #generative #parallel #specification
- Generating an Efficient Compiler for a Data Parallel Language from a Denotational Specification (JR, PF, MP), pp. 248–262.
- DAC-1994-BhattacharyaDB94a #analysis #optimisation #specification
- Performance Analysis and Optimization of Schedules for Conditional and Loop-Intensive Specifications (SB, SD, FB), pp. 491–496.
- DAC-1994-BuiM #algorithm #clustering #hybrid #problem #search-based
- A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut Partitioning Problem on Hypergraphs (TNB, BRM), pp. 664–669.
- DAC-1994-DartuMQP
- A Gate-Delay Model for high-Speed CMOS Circuits (FD, NM, JQ, LTP), pp. 576–580.
- DAC-1994-DrechslerSTBP #diagrams #functional #order #representation
- Efficient Representation and Manipulation of Switching Functions Based on Ordered Kronecker Functional Decision Diagrams (RD, AS, MT, BB, MAP), pp. 415–419.
- DAC-1994-Edahiro #algorithm
- An Efficient Zero-Skew Routing Algorithm (ME), pp. 375–380.
- DAC-1994-HaradaK #optimisation
- A Global Router Optimizing Timing and Area for High-Speed Bipolar LSI’s (IH, HK), pp. 177–181.
- DAC-1994-HeraguBA #fault
- An Efficient Path Delay Fault Coverage Estimator (KH, MLB, VDA), pp. 516–521.
- DAC-1994-HuYD #verification
- New Techniques for Efficient Verification with Implicitly Conjoined BDDs (AJH, GY, DLD), pp. 276–282.
- DAC-1994-MonteiroDL #estimation #logic #process
- A Methodology for Efficient Estimation of Switching Activity in Sequential Logic Circuits (JCM, SD, BL), pp. 12–17.
- DAC-1994-Nguyen #simulation
- Efficient Simulation of Lossy and Dispersive Transmission Lines (TVN), pp. 622–627.
- DAC-1994-NielsenK #analysis #simulation
- Performance Analysis Based on Timing Simulation (CDN, MK), pp. 70–76.
- DAC-1994-PotkonjakSC #constant #multi #using
- Efficient Substitution of Multiple Constant Multiplications by Shifts and Additions Using Iterative Pairwise Matching (MP, MBS, AC), pp. 189–194.
- DAC-1994-SaldanhaHMBS #optimisation #using
- Performance Optimization Using Exact Sensitization (AS, HH, PCM, RKB, ALSV), pp. 425–429.
- DAC-1994-SilveiraEWCK #approach #simulation #using
- An Efficient Approach to Transmission Line Simulation Using Measured or Tabulated S-parameter Data (LMS, IME, JW, MC, KSK), pp. 634–639.
- DAC-1994-TeraiGNSO #automation #concept #design
- Basic Concept of Cooperative Timing-driven Design Automation Technology for High-speed RISC Processor HARP-1 (HT, KG, YN, YS, YO), pp. 262–269.
- DAC-1994-VerlindKJLM #abstraction #communication #verification
- A Time Abstraction Method for Efficient Verification of Communicating Systems (EV, TK, GGdJ, BL, HDM), pp. 609–614.
- EDAC-1994-BrashearMOPM #analysis #predict #statistics #using
- Predicting Circuit Performance Using Circuit-level Statistical Timing Analysis (RBB, NM, CO, LTP, MRM), pp. 332–337.
- EDAC-1994-FranssenNSCM #control flow #optimisation #simulation
- Control flow optimization for fast system simulation and storage minimization (FHMF, LN, HS, FC, HDM), pp. 20–24.
- EDAC-1994-GaiMR #fault #named
- TORSIM: An Efficient Fault Simulator for Synchronous Sequential Circuits (SG, PLM, MSR), pp. 46–50.
- EDAC-1994-HuangR #behaviour #throughput #using
- Maximizing the Throughput of High Performance DSP Applications Using Behavioral Transformations (SHH, JMR), pp. 25–30.
- EDAC-1994-JohanssonVG
- “Underground Capacitors” Very Efficient Decoupling for High Performance UHF Signal Processing ICs (TJ, LRV, JMG), p. 655.
- EDAC-1994-LinCL #fault #named
- TRANS: A Fast and Memory-Efficient Path Delay Fault Simulator (MCL, JEC, CLL), pp. 508–512.
- EDAC-1994-NicolaidisB #array #implementation #multi #self
- Efficient Implementations of Self-Checking Multiply and Divide Arrays (MN, HB), pp. 574–579.
- EDAC-1994-VacherBGRS #fourier #implementation #parallel
- A VLSI Implementation of Parallel Fast Fourier Transform (AV, MB, AG, TR, AS), pp. 250–255.
- EDAC-1994-WangD #approximate #linear #optimisation #using
- An Efficient Yield Optimization Method Using A Two Step Linear Approximation of Circuit Performance (ZW, SWD), pp. 567–571.
- EDAC-1994-WittmannH #identification #optimisation #testing
- Efficient Path Identification for Delay Testing — Time and Space Optimization (HCW, MH), pp. 513–517.
- EDAC-1994-WuM #2d #array #programmable
- An Efficient Router for 2-D Field Programmable Gate Arrays (YLW, MMS), pp. 412–416.
- EDAC-1994-WurthW #logic #multi #optimisation
- Efficient Calculation of Boolean Relations for Multi-Level Logic Optimization (BW, NW), pp. 630–634.
- HPDC-1994-BornsteinS
- Data Reshuffling in Support of Fast I/O for Distributed-Memory Machines (CFB, PS), pp. 227–235.
- HPDC-1994-BurrellMP #analysis #capacity #implementation #multi #network #protocol
- Performance Analysis of a New Implementation Efficient Capacity Allocation Protocol for Multimedia Traffic in ATM Networks (AB, DM, PPK), pp. 51–60.
- HPDC-1994-CataniaPRV #array #clustering #evaluation
- Performance Evaluation of a Partial Dynamic Declustering Disk Array System (VC, AP, SR, LV), pp. 244–252.
- HPDC-1994-ChiuC #distributed #fault tolerance
- Process-Replication Technique for Fault Tolerance and Performance Improvement in Distributed Computing Systems (JFC, GMC), pp. 236–243.
- HPDC-1994-KremienK #distributed #scalability
- Providing High Performance Distributed Computing Through Scalable Computation Servers (OK, JK), pp. 70–77.
- HPDC-1994-LiHW #program analysis #program transformation
- Program Analysis and Transformations for Fast Data Sharing (AL, GH, LDW), pp. 131–138.
- HPDC-1994-SrbljicVB #consistency #distributed #memory management #predict
- Performance Prediction for Different Consistency Schemes in Distributed Shared Memory Systems (SS, ZGV, LB), pp. 295–302.
- HPDC-1994-TakamuraT #communication #protocol #scalability
- Large-Scale Group Communication Protocol on High-Speed Channel (MT, MT), pp. 254–261.
- HPDC-1994-WornerGHZ #grid #parallel
- Reducing Variations in Parallel Efficiency for Unstructured Grid Computations (BW, UG, MH, RZ), pp. 287–294.
- PDP-1994-BarrigaA #generative
- Efficient Generation Of Synthetic Traces (LB, RA), pp. 406–412.
- PDP-1994-BastiaensLDV #algorithm #concurrent #image #implementation #operating system #parallel #re-engineering #thread
- An Efficient Parallel Implementation Of The Ml-EM Algorithm For PET Image Reconstruction With A Multi-threaded Operating System (KB, IL, PD, WV), pp. 253–259.
- PDP-1994-BekleyTG #network
- Performance Of Very High Frequencies Networks (AB, BT, GG), pp. 180–184.
- PDP-1994-Beus-DukicG #evaluation #protocol
- Performance Evaluation Of Time-critical Protocols (LBD, CG), pp. 400–405.
- PDP-1994-ChenK #execution #flexibility #interface #memory management #network
- Integrating Memory And Network Accesses : A Flexible Processor-network Interface For Efficient Application Execution (YYC, CTK), pp. 103–110.
- PDP-1994-CrookesB #image #implementation #programming
- Efficient Implementation Of An Abstract Programming Model For Image Processing On Transputers (DC, TJB), pp. 22–28.
- PDP-1994-Dauphin #debugging #distributed #functional #modelling #monitoring #parallel
- Combining Functional And Performance Debugging Of Parallel And Distributed Systems Based On Model-driven Monitoring (PD), pp. 463–470.
- PDP-1994-Fahringer #benchmark #estimation #evaluation #fortran #metric #parallel #source code
- Evaluation Of Benchmark Performance Estimation For Parallel Fortran Programs On Massively Parallel SIMD And MIMD Computers (TF), pp. 449–456.
- PDP-1994-GulleyCW #parallel #risk management
- Controlling Parallel Software Performance Risks With VPB (JWG, PJCC, SRW), pp. 366–371.
- PDP-1994-JoosenPV #clustering
- The Efficient Management Of Task Clusters In A Dynamic Load Balancer (WJ, JP, PV), pp. 285–290.
- PDP-1994-MarinL #design #requirements
- Bandwidth Requirements For Wormhole Switches: A Simple And Efficient Design (JDM, PL), pp. 377–384.
- PDP-1994-Ribeiro-JustoW
- Improving Performance With Serialisation (GRRJ, PHW), pp. 496–502.
- PDP-1994-RostiS #parallel
- Workload Characterization For Performance Engineering Of Parallel Applications (ER, GS), pp. 457–462.
- STOC-1994-AwerbuchCS #distributed #symmetry
- Efficient asynchronous distributed symmetry breaking (BA, LC, MAS), pp. 214–223.
- STOC-1994-BellareGLR #approximate #probability #proving
- Efficient probabilistic checkable proofs and applications to approximation (MB, SG, CL, AR), p. 820.
- STOC-1994-Gabow #algorithm #graph
- Efficient splitting off algorithms for graphs (HNG), pp. 696–705.
- STOC-1994-KleinRRS #algorithm #graph
- Faster shortest-path algorithms for planar graphs (PNK, SR, MRH, SS), pp. 27–37.
- STOC-1994-KollerMS #algorithm #game studies #random
- Fast algorithms for finding randomized strategies in game trees (DK, NM, BvS), pp. 750–759.
- STOC-1994-OstrovskyRV
- Simple and efficient leader election in the full information model (RO, SR, UVV), pp. 234–242.
- STOC-1994-RaghavanU #network
- Efficient routing in all-optical networks (PR, EU), pp. 134–143.
- CADE-1994-Plaisted #proving #theorem proving
- The Search Efficiency of Theorem Proving Strategies (DAP), pp. 57–71.
- CAV-1994-CousinH
- Performance Improvement of State Space Exploration by Regular & Diffrential Hashing Functions (BC, JMH), pp. 364–376.
- CAV-1994-GeistB #automation #model checking
- Efficient Model Checking by Automated Ordering of Transition Relation Partitions (DG, IB), pp. 299–310.
- ICLP-1994-Christiansen
- Efficient and Complete Demo Predicates for Definite Clause Languages (HC), pp. 735–736.
- ICLP-1994-GallagherW #approximate #logic programming #precise #source code
- Fast and Precise Regular Approximations of Logic Programs (JPG, DAdW), pp. 599–613.
- ILPS-1994-RamakrishnanRSS #evaluation #incremental #query
- Efficient Incremental Evaluation of Queries with Aggregation (RR, KAR, DS, SS), pp. 204–218.
- ILPS-1994-TangPGC #backtracking #logic programming #optimisation #parallel
- Last Parallel Call Optimization and Fast Backtracking in And-parallel Logic Programming Systems (DT, EP, GG, MC), pp. 683–684.
- ISSTA-1994-FleyshgakkerW #analysis #approach #mutation testing
- Efficient Mutation Analysis: A New Approach (VNF, SNW), pp. 185–195.
- LICS-1994-Palsberg
- Efficient Inference of Object Types (JP), pp. 186–195.
- ICDAR-1993-Bunke #algorithm #nearest neighbour #taxonomy #word
- A fast algorithm for finding the nearest neighbor of a word in a dictionary (HB), pp. 632–637.
- ICDAR-1993-GuillevicS #recognition
- Cursive script recognition: A fast reader scheme (DG, CYS), pp. 311–314.
- ICDAR-1993-JaisimhaHD #algorithm
- A methodology for the characterization of the performance of thinning algorithms (MYJ, RMH, DD), pp. 282–286.
- ICDAR-1993-KanaiNRN #comprehension #documentation #metric
- Performance metrics for document understanding systems (JK, TAN, SVR, GN), pp. 424–427.
- ICDAR-1993-LeeKM #algorithm #fault #recognition
- Efficient postprocessing algorithms for error correction in handwritten Hangul address and human name recognition (SWL, ESK, BWM), pp. 232–235.
- ICDAR-1993-LeePT #evaluation #normalisation #recognition
- Performance evaluation of nonlinear shape normalization methods for the recognition of large-set handwritten characters (SWL, JSP, YT), pp. 402–407.
- ICDAR-1993-ShabanLNR #image #implementation
- Fast image filtering implementation (MS, SL, LN, RB), pp. 735–738.
- ICDAR-1993-TungCL #analysis #generative
- Performance analysis of an OCR system via an artificial handwritten Chinese character generator (CHT, YJC, HJL), pp. 315–318.
- PODS-1993-PagelSTW #analysis #data type #query #towards
- Towards an Analysis of Range Query Performance in Spatial Data Structures (BUP, HWS, HT, PW), pp. 214–221.
- SIGMOD-1993-BrinkhoffKS #using
- Efficient Processing of Spatial Joins Using R-Trees (TB, HPK, BS), pp. 237–246.
- SIGMOD-1993-KeenD #evaluation
- Performance Evaluation of Ephemeral Logging (JSK, WJD), pp. 187–196.
- SIGMOD-1993-MoenkebergZHW #automation #database #prototype #towards
- The COMFORT Prototype: A Step Toward Automated Database Performance Tuning (AM, PZ, CH, GW), pp. 542–543.
- SIGMOD-1993-MohanN #database #flexibility
- An Efficient and Flexible Method for Archiving a Data Base (CM, IN), pp. 139–146.
- VLDB-1993-Hong #database #distributed
- Performance of Catalog Management Schemes for Running Access Modules in a Locally Distributed Database System (EKH), pp. 194–205.
- VLDB-1993-HoskingBM #comparative #evaluation #persistent #programming language
- Update Logging for Persistent Programming Languages: A Comparative Performance Evaluation (ALH, EWB, JEBM), pp. 429–440.
- VLDB-1993-HoutsmaWF #algorithm #evaluation #implementation #parallel #transitive
- Implementation and Performance Evaluation of a Parallel Transitive Closure Algorithm on PRISMA/DB (MAWH, ANW, JF), pp. 206–217.
- CSM-1993-RothermelH #algorithm #testing
- A Safe, Efficient Algorithm for Regression Test Selection (GR, MJH), pp. 358–367.
- ICALP-1993-ChlebusDP #network #reliability
- Sparse Networks Supporting Efficient Reliable Broadcasting (BSC, KD, AP), pp. 388–397.
- ICALP-1993-CodishFMW #analysis #concurrent #constraints #logic programming #source code
- Efficient Analysis of Concurrent Constraint Logic Programs (MC, MF, KM, WHW), pp. 633–644.
- ICALP-1993-FranklinY
- Secure and Efficient Off-Line Digital Money (MKF, MY), pp. 265–276.
- ICALP-1993-Kirousis #constraints #parallel
- Fast Parallel Constraint Satisfaction (LMK), pp. 418–429.
- ICALP-1993-Schonhage #adaptation #finite #parallel
- Fast Parallel Computation of Characteristic Polynomials by Leverrier’s POwer Sum Method Adapted to Fields of Finite Characteristic (AS), pp. 410–417.
- FPCA-1993-Ang #data flow #implementation
- Efficient Implementation of Sequential Loops in Dataflow Computation (BSA), pp. 169–178.
- HCI-ACS-1993-AielloS #feedback #monitoring
- Electronic Performance Monitoring and Stress: The Role of Feedback and Goal Setting (JRA, YS), pp. 1011–1016.
- HCI-ACS-1993-ArthurB
- The Relationship Between Secretaries Opinions of Computing and Their Computer Performance Within a United Kingdom Health-Care Setting (JA, PB), pp. 362–367.
- HCI-ACS-1993-Burger #assessment #case study #usability
- Performance of a Usability Assessment Model: A New Zealand Case Study (SVB), pp. 660–665.
- HCI-ACS-1993-CarayonLYSSL #monitoring #research
- Recent Research Findings on Stress and Electronic Performance Monitoring (PC, SYL, CLY, MJS, KJS, DL), pp. 1017–1022.
- HCI-ACS-1993-Carling #modelling
- Performance, Mental Models and Background Knowledge in Mastering a Simulated Dynamic System (EC), pp. 599–604.
- HCI-ACS-1993-Cook #correlation
- Teleoperation of Heavy Equipment: Individual and Environmental Correlates of Operator Performance (TMC), pp. 278–282.
- HCI-ACS-1993-GalinskySP #monitoring
- The Influence of Electronic Performance Monitoring on Speed and Accuracy in a VDT-Based Data-Entry Task (TLG, LMS, CSP), pp. 1023–1028.
- HCI-ACS-1993-StanneyS #human-computer #information management
- The Influence of Information Processing Strategies on Human-Computer Performance (KMS, GS), pp. 463–468.
- HCI-ACS-1993-SwansonS
- The Relationship of Working Posture to Performance in a Data Entry Task (NGS, SLS), pp. 994–998.
- HCI-ACS-1993-Yamamoto
- Topographic EEG Study of VDT Performance with Special Reference to Frontal Midline Theta Waves (Fm q) and Mental Work (SY), pp. 897–902.
- HCI-ACS-1993-YangC
- Effects of Computer System Performance and Job Support on Stress Among Office Workers (CLY, PC), pp. 931–936.
- HCI-ACS-1993-YufikSV #evaluation #predict
- Quantitative Evaluation and Performance Prediction (YMY, TBS, VFV), pp. 642–647.
- HCI-SHI-1993-BatraBD #hypermedia #navigation
- Effects of Hypertext Topology on Navigation Performance (SB, RRB, BD), pp. 175–180.
- HCI-SHI-1993-CarlsonH #design #interface
- The Impact of the Design of the Software Control Interface on User Performance (JRC, LLH), pp. 116–121.
- HCI-SHI-1993-DillonND #experience #interactive
- Spoken Language Interaction: Effects of Vocabulary Size and Experience on User Efficiency and Acceptability (TWD, AFN, MJD), pp. 140–145.
- HCI-SHI-1993-DouglasH #design
- Evaluating Performance, Discomfort, and Subjective Preference between Computer Keyboard Designs (SDD, AJH), pp. 1064–1069.
- HCI-SHI-1993-McAlindon #metric
- Performance Measures in an “Ergonomically” Designed Keyboard (PJM), pp. 1079–1084.
- HCI-SHI-1993-YuT
- Musculoskeletal Discomfort and Job Performance of Keyboard Operators (ITSY, HSCT), pp. 1058–1063.
- INTERCHI-1993-KabbashMB #using
- Human performance using computer input devices in the preferred and non-preferred hands (PK, ISM, WB), pp. 474–481.
- INTERCHI-1993-KurtenbachB #using
- The limits of expert performance using hierarchic marking menus (GK, WB), pp. 482–487.
- INTERCHI-1993-MacKenzieW #interactive
- Lag as a determinant of human performance in interactive systems (ISM, CW), pp. 488–493.
- INTERCHI-1993-NilsenJOBRM #learning
- The growth of software skill: a longitudinal look at learning & performance (EN, HSJ, JSO, KB, HHR, SM), pp. 149–156.
- INTERCHI-1993-Redmiles #variability
- Reducing the variability of programmers’ performance through explained examples (DFR), pp. 67–73.
- INTERCHI-1993-Wenzel #design #hardware #interface
- Perceptual vs. hardware performance in advanced acoustic interface design (EMW), pp. 363–366.
- CAiSE-1993-PuigjanerBA #constraints #design #embedded #estimation #process #realtime
- Estimation Process of Performance Constraints during the design of Real-Time & Embedded Systems (RP, AB, SA), pp. 629–648.
- CIKM-1993-BhargavaH #database #distributed
- Efficient Availability Mechanisms in Distributed Databases Systems (BKB, AH), pp. 645–654.
- CIKM-1993-Maine #bound #named
- HSGIMS — A Secure High-Speed Tool with Bound Search Times for Transparently Managing and Manipulating Information (PADdM), pp. 216–222.
- CIKM-1993-NiePV #information retrieval
- Adjusting the Performance of an Information Retrieval System (JYN, FP, JGV), pp. 726–728.
- CIKM-1993-SegevZ #maintenance
- Efficient Maintenance of Rule-Derived Data through Join Pattern Indexing (AS, JLZ), pp. 194–205.
- CIKM-1993-Wolin #evaluation #maintenance
- Performance Evaluation of MAX — the Maintenance Administrator Expert System (EJW), pp. 729–731.
- ICML-1993-Gil #independence
- Efficient Domain-Independent Experimentation (YG), pp. 128–134.
- SIGIR-1993-BelkinCCC #information retrieval #multi #query
- Effect of Multiple Query Representations on Information Retrieval System Performance (NJB, CC, WBC, JPC), pp. 339–346.
- SIGIR-1993-BruzaG
- Efficient Context-Sensitive Plausible Inference for Information Disclosure (PB, LCvdG), pp. 12–21.
- OOPSLA-1993-Caseau #inheritance #multi
- Efficient Handling of Multiple Inheritance Hierarchies (YC), pp. 271–287.
- OOPSLA-1993-HoskingM #evaluation #fault #persistent #programming language
- Object Fault Handling for Persistent Programming Languages: A Performance Evaluation (ALH, JEBM), pp. 288–303.
- OOPSLA-1993-MatsuokaTY #concurrent #encapsulation #object-oriented #using
- Highly Efficient and Encapsulated Re-use of Synchronization Code in Concurrent Object-Oriented Languages (SM, KT, AY), pp. 109–126.
- AdaEurope-1993-BurnsWH #ada #modelling #runtime #scheduling
- The Impact of an Ada Run-Time System’s Performance Characteristics on Scheduling Models (AB, AJW, ADH), pp. 240–248.
- AdaEurope-1993-Lundberg #ada #evaluation #parallel #source code #using
- Performance Evaluation of Parallel Ada Programs Using an Experimental Multiprocessor (LL), pp. 280–297.
- AdaEurope-1993-Tonndorf #ada #compilation #validation
- An Efficient Compiler Validation Method for Ada 9X (MT), pp. 95–107.
- AdaEurope-1993-WallABL #ada #source code
- Performance Expectations on Ada Programs (GW, LA, LB, KL), pp. 227–239.
- LOPSTR-1993-MaddenHGB #automation #generative #proving #source code #theorem proving #using
- A General Technique for Automatically Generating Efficient Programs Through the Use of Proof Planning (PM, JH, IG, AB), pp. 64–66.
- PEPM-1993-ConselPW #composition #incremental #operating system #partial evaluation
- Incremental Partial Evaluation: The Key to High Performance, Modularity and Portability in Operating Systems (CC, CP, JW), pp. 44–46.
- PEPM-1993-Malmkjaer #partial evaluation #towards
- Towards Efficient Partial Evaluation (KM), pp. 33–43.
- PLDI-1993-BarrettZ #memory management #predict #using
- Using Lifetime Predictors to Improve Memory Allocation Performance (DAB, BGZ), pp. 187–196.
- PLDI-1993-Boehm #garbage collection
- Space Efficient Conservative Garbage Collection (HJB), pp. 197–206.
- PLDI-1993-CytronG #alias
- Efficient Accomodation of May-Alias Information in SSA Form (RC, RG), pp. 36–45.
- PLILP-1993-CorsiniMRC #abstract interpretation #bottom-up #constraints #finite #prolog #theorem proving
- Efficient Bottom-up Abstract Interpretation of Prolog by Means of Constraint Solving over Symbolic Finite Domains (MMC, KM, AR, BLC), pp. 75–91.
- PLILP-1993-KesslerR #scalability
- Efficient Register Allocation for Large Basic Blocks (CWK, TR), pp. 418–419.
- PLILP-1993-Moreno-NavarroKMWH #analysis #lazy evaluation #using
- Efficient Lazy Narrowing using Demandedness Analysis (JJMN, HK, JMC, SW, WH), pp. 167–183.
- POPL-1993-ChoiBC #alias #interprocedural #pointer
- Efficient Flow-Sensitive Interprocedural Computation of Pointer-Induced Aliases and Side Effects (JDC, MGB, PRC), pp. 232–245.
- POPL-1993-KozenPS #recursion #type system
- Efficient Recursive Subtyping (DK, JP, MIS), pp. 419–428.
- WSA-1993-CharlierDMH #abstract interpretation #algorithm #fixpoint #optimisation #prolog
- Optimization Techniques for General Purpose Fixpoint Algorithms — Practical Efficiency for the Abstract Interpretation of Prolog (BLC, OD, LM, PVH), pp. 15–26.
- WSA-1993-FergusonH #abstract interpretation #algorithm #using
- Fast Abstract Interpretation Using Sequential Algorithms (AF, JH), pp. 45–59.
- WSA-1993-KatoSI #abduction #program analysis #reasoning
- An Efficient Abductive Reasoning System Based on Program Analysis (SK, HS, HI), pp. 230–241.
- Best-of-PLDI-1993-Boehm93a #garbage collection
- Space efficient conservative garbage collection (with retrospective) (HJB), pp. 490–501.
- RE-1993-Nixon #development #information management #requirements
- Dealing with performance requirements during the development of information systems (BAN), pp. 42–49.
- SAC-1993-GuuS #search-based #sequence
- An Efficient Storage Scheme for Aligned Genetic Sequences (YWG, SS), pp. 139–146.
- SAC-1993-Jeffay #paradigm #predict #realtime
- The Real-Time Producer/Consumer Paradigm: A Paradigm for the Construction of Efficient, Predictable Real-Time Systems (KJ), pp. 796–804.
- SAC-1993-JoshiRN #algorithm #network #problem
- A Fast Algorithm for Generalized Network Location Problems (DSJ, SR, CN), pp. 701–708.
- SAC-1993-KelleherLD #equation #on the #parallel #reduction
- On the Performance of a Direct Parallel Method for Solving Separable Elliptic Equations Based on Block Cyclic Reduction (KK, SL, SKD), pp. 517–524.
- DAC-1993-AlpertK #clustering #geometry #multi
- Geometric Embeddings for Faster and Better Multi-Way Netlist Partitioning (CJA, ABK), pp. 743–748.
- DAC-1993-CarlsonC #order
- Performance Enhancement of CMOS VLSI Circuits by Transistor Reordering (BSC, CYRC), pp. 361–366.
- DAC-1993-ChangA #named
- VIPER: An Efficient Vigorously Sensitizable Path Extractor (HC, JAA), pp. 112–117.
- DAC-1993-ChiproutN #evaluation
- Addressing High-Speed Interconnect Issues in Asymptotic Waveform Evaluation (EC, MSN), pp. 732–736.
- DAC-1993-ChoS #algorithm
- A Nuffer Distribution Algorithm for High-Speed Clock Routing (JDC, MS), pp. 537–543.
- DAC-1993-ChouCC #finite #modelling #simulation #using
- High-Speed Interconnect Modeling and High-Accuracy Simulation Using SPICE and Finite Element Methods (TYC, JC, ZJC), pp. 684–690.
- DAC-1993-ChuML #finite #state machine
- An Efficient Critical Race-Free State Assignment Technique for Asynchronous Finite State Machines (TAC, NM, CKCL), pp. 2–6.
- DAC-1993-HuangHCK #algorithm
- An Efficient Timing-Driven Global Routing Algorithm (JH, XH, CKC, ESK), pp. 596–600.
- DAC-1993-KhooC #multi
- An Efficient Multilayer MCM Router Based on Four-Via Routing (KYK, JC), pp. 590–595.
- DAC-1993-LaiFW #data type #query
- HV/VH Trees: A New Spatial Data Structure for Fast Region Queries (GGL, DSF, DFW), pp. 43–47.
- DAC-1993-LamSBS #fault #trade-off
- Delay Fault Coverage and Performance Tradeoffs (WKCL, AS, RKB, ALSV), pp. 446–452.
- DAC-1993-LimCW
- Performance Oriented Rectilinear Steiner Trees (AL, SWC, CTW), pp. 171–176.
- DAC-1993-MandayamV #attribute grammar #specification #using
- Performance Specification Using Attributed Grammars (RM, RV), pp. 661–667.
- DAC-1993-MeyerC #fault #multi #simulation
- Fast Hierarchical Multi-Level Fault Simulation of Sequential Circuits with Switch-Level Accuracy (WM, RC), pp. 515–519.
- DAC-1993-Nagaraj #optimisation
- A New Optimizer for Performance Optimization of Analog Integrated Circuits (NSN), pp. 148–153.
- DAC-1993-NagR
- Iterative Wirability and Performance Improvement for FPGAs (SN, KR), pp. 321–325.
- DAC-1993-OhlrichEGS #algorithm #identification #morphism #named #using
- SubGemini: Identifying SubCircuits using a Fast Subgraph Isomorphism Algorithm (MO, CE, EG, LS), pp. 31–37.
- DAC-1993-SawkarT
- Performance Directed Technology Mapping for Look-Up Table Based FPGAs (PS, DET), pp. 208–212.
- DAC-1993-SeawrightB #synthesis
- High-Level Symbolic Construction Technique for High Performance Sequential Synthesis (AS, FB), pp. 424–428.
- DAC-1993-SharmaJ93a #architecture #synthesis
- Estimating Architectural Resources and Performance for High-Level Synthesis Applications (AS, RJ), pp. 355–360.
- DAC-1993-SrinivasanGB #clustering #pseudo #testing
- An Efficient Partitioning Strategy for Pseudo-Exhaustive Testing (RS, SKG, MAB), pp. 242–248.
- DAC-1993-SriramK #approximate
- Fast Approximation of the Transient Response of Lossy Transmision Line Trees (MS, SMK), pp. 691–696.
- DAC-1993-WooK #clustering #implementation #multi
- An Efficient Method of Partitioning Circuits for Multiple-FPGA Implementation. (NSW, JK), pp. 202–207.
- DAC-1993-YangLYD #simulation
- An Efficient Non-Quasi-Static Diode Model for Circuit Simulation (ATY, YL, JTY, RRD), pp. 720–725.
- HPDC-1993-BiswasRTK #analysis #distributed #file system
- Performance Analysis of Distributed File Systems with Non-Volatile Caches (PB, KKR, DFT, CMK), pp. 252–262.
- HPDC-1993-HouP #capacity
- Trading Disk Capacity for Performance (RYH, YNP), pp. 263–270.
- HPDC-1993-Kung #network
- New Flow Control Methods for High-Speed Networks (HTK), p. 4.
- HPDC-1993-MukherjeeS #adaptation #concurrent #configuration management #multi #thread #using
- Improving Performance by Use of Adaptive Objects: Experimentation with a Configurable Multiprocessor Thread Package (BM, KS), pp. 59–66.
- HPDC-1993-NakamuraT #network #protocol
- Starvation-Prevented Priority-Based Total Ordering Broadcast Protocol on High-Speed Single Channel Network (AN, MT), pp. 281–288.
- HPDC-1993-SrbljicB #evaluation #memory management #replication
- Analytical Performance Evaluation of Data Replication Based Shared Memory Model (SS, LB), pp. 326–335.
- HPDC-1993-VarmaSB #evaluation #standard
- Performance Evaluation of a High-Speed Switching System Based on the Fibre Channel Standard (AV, VS, RB), pp. 144–151.
- HPDC-1993-WehnerABDEMFMMS #distributed #memory management #towards
- Toward a High Performance Distributed Memory Climate Model (MFW, JJA, JCB, WPD, PGE, AAM, JDF, CCM, CRM, JAS), pp. 102–113.
- PDP-1993-AshworthD #3d #parallel
- Performance of a three dimensional hydrodynamic model on a range of parallel computers (MA, AMD), pp. 383–390.
- PDP-1993-GetovH #analysis #comparative #distributed
- Comparative performance analysis of uniformly distributed applications (VG, RWH), pp. 259–262.
- PDP-1993-LevrouwA #memory management #source code
- An efficient record-replay mechanism for shared memory programs (LL, KA), pp. 169–176.
- PDP-1993-SharpC #algorithm #fourier #functional #program transformation #synthesis
- Synthesis of the fast Fourier transform algorithm by functional language program transformation (DWNS, MC), pp. 136–143.
- PPoPP-1993-ChapmanMZ #fortran
- High Performance Fortran Without Templates: An Alternative Model for Distribution and Alignment (BMC, PM, HPZ), pp. 92–101.
- PPoPP-1993-KontothanassisW #using
- Using Scheduler Information to Achieve Optimal Barrier Synchronization Performance (LIK, RWW), pp. 64–72.
- PPoPP-1993-LeungZ #parallel #runtime
- Improving the Performance of Runtime Parallelization (STL, JZ), pp. 83–91.
- PPoPP-1993-TauraMY #concurrent #implementation #multi #object-oriented
- An Efficient Implementation Scheme of Concurrent Object-Oriented Languages on Stock Multicomputers (KT, SM, AY), pp. 218–228.
- PPoPP-1993-WagnerC #implementation #named
- Leapfrogging: A Portable Technique for Implementing Efficient Futures (DBW, BC), pp. 208–217.
- SOSP-1993-ChenB #memory management #operating system
- The Impact of Operating System Structure on Memory System Performance (JBC, BNB), pp. 120–133.
- SOSP-1993-PerlW
- Performance Assertion Checking (SEP, WEW), pp. 134–145.
- SOSP-1993-WahbeLAG #fault
- Efficient Software-Based Fault Isolation (RW, SL, TEA, SLG), pp. 203–216.
- STOC-1993-BellareGLR #approximate #proving
- Efficient probabilistically checkable proofs and applications to approximations (MB, SG, CL, AR), pp. 294–304.
- STOC-1993-CanettiR
- Fast asynchronous Byzantine agreement with optimal resilience (RC, TR), pp. 42–51.
- STOC-1993-CooperL #linear #protocol
- Fast perfection-information leader-election protocol with linear immunity (JC, NL), pp. 662–671.
- STOC-1993-FreundKRRSS #automaton #finite #learning #random
- Efficient learning of typical finite automata from random walks (YF, MJK, DR, RR, RES, LS), pp. 315–324.
- STOC-1993-Kearns #learning #query #statistics
- Efficient noise-tolerant learning from statistical queries (MJK), pp. 392–401.
- STOC-1993-LinialLSZ #combinator #set
- Efficient construction of a small hitting set for combinatorial rectangles in high dimension (NL, ML, MES, DZ), pp. 258–267.
- TAPSOFT-1993-Vandevoorde #source code #specification
- Specifications Can Make Programs Run Faster (MTV), pp. 215–229.
- CAV-1993-HuD #invariant #using #verification
- Efficient Verification with BDDs using Implicitly Conjoined Invariants (AJH, DLD), pp. 3–14.
- CAV-1993-YannakakisL #algorithm #realtime
- An Efficient Algorithm for Minimizing Real-time Transition Systems (MY, DL), pp. 210–224.
- CAV-1993-YonedaSSC #parallel #realtime #verification
- Efficient Verification of Parallel Real-Time Systems (TY, AS, BHS, EMC), pp. 321–346.
- ICLP-1993-ChikayamaFY #implementation
- A Portable and Reasonably Efficient Implementation of KL1 (TC, TF, HY), p. 833.
- ICLP-1993-TickB #compilation #evaluation #kernel #runtime
- Performance Evaluation of Monaco Compiler and Runtime Kernel (ET, CB), pp. 757–773.
- ICLP-1993-YangBDCW
- Performance of the Compiler-Based Andorra-I System (RY, TB, IdCD, VSC, DHDW), pp. 150–166.
- ILPS-1993-Bsaies #automation #logic programming #source code
- Automated Derivation of Efficient Logic Programs by Synthesizing Eureka Properties (KB), p. 633.
- ILPS-1993-Tarau #continuation #source code
- An Efficient Specialization of the WAM for Continuation Passing Binary Programs (PT), p. 652.
- ISSTA-1993-HarroldMR #dependence #graph
- Efficient Construction of Program Dependence Graphs (MJH, BAM, GR), pp. 160–170.
- PODS-1992-Greiner #learning #query
- Learning Efficient Query Processing Strategies (RG), pp. 33–46.
- SIGMOD-1992-AnalytiP #database #in memory #memory management
- Fast Search in Main Memory Databases (AA, SP), pp. 215–224.
- SIGMOD-1992-Bamford #consistency #multi #using
- Using Multiversioning to Improve Performance Without Loss of Consistency (RB), p. 164.
- SIGMOD-1992-BhideGHJ
- An Efficient Scheme for Providing High Availability (AB, AG, HIH, AJ), pp. 236–245.
- SIGMOD-1992-Biliris #database #scalability
- The Performance of Three Database Storage Structures for Managing Large Objects (AB), pp. 276–285.
- SIGMOD-1992-DanY #analysis #policy
- Performance Analysis of Coherency Control Policies through Lock Retention (AD, PSY), pp. 114–123.
- SIGMOD-1992-GhandeharizadehDQ #analysis #clustering #multi
- A Performance Analysis of Alternative Multi-Attribute Declustering Strategies (SG, DJD, WQ), pp. 29–38.
- SIGMOD-1992-HarrisRW #concurrent #database #multi #protocol
- A High Performance Multiversion Concurrency Control Protocol of Object Databases (CH, MR, CW), p. 320.
- SIGMOD-1992-Kasi
- High Performance and Availability Through Data Distribution (JK), p. 102.
- SIGMOD-1992-MohanL #concurrent #named #using
- ARIES/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging (CM, FEL), pp. 371–380.
- SIGMOD-1992-MohanPL #flexibility #transaction #version control
- Efficient and Flexible Methods for Transient Versioning of Records to Avoid Locking by Read-Only Transactions (CM, HP, RAL), pp. 124–133.
- SIGMOD-1992-Rahm #architecture #evaluation #transaction
- Performance Evaluation of Extended Storage Architectures for Transaction Processing (ER), pp. 308–317.
- SIGMOD-1992-TsangarisN #clustering #on the
- On the Performance of Object Clustering Techniques (MMT, JFN), pp. 144–153.
- VLDB-1992-AgrawalA #logic
- Resilient Logical Structures for Efficient Management of Replicated Data (DA, AEA), pp. 151–162.
- VLDB-1992-DelisR #architecture #database #scalability
- Performance and Scalability of Client-Server Database Architectures (AD, NR), pp. 610–623.
- VLDB-1992-MoenkebergW #adaptation #evaluation #robust
- Performance Evaluation of an Adaptive and Robust Load Control Method for the Avoidance of Data-Contention Thrashing (AM, GW), pp. 432–443.
- VLDB-1992-WhiteD #pointer
- A Performance Study of Alternative Object Faulting and Pointer Swizzling Strategies (SJW, DJD), pp. 419–431.
- VLDB-1992-WilschutFA #in memory #parallel
- Parallelism in a Main-Memory DBMS: The Performance of PRISMA/DB (ANW, JF, PMGA), pp. 521–532.
- VLDB-1992-ZobelMS #database
- An Efficient Indexing Technique for Full Text Databases (JZ, AM, RSD), pp. 352–362.
- ICALP-1992-Hagerup #integer
- Fast Integer Merging on the EREW PRAM (TH), pp. 318–329.
- ICALP-1992-Westbrook #incremental #testing
- Fast Incremental Planarity Testing (JW), pp. 342–353.
- LFP-1992-CooperNS #garbage collection #memory management #using
- Improving the Performance of SML Garbage Collection Using Application-Specific Virtual Memory Management (EC, SN, IS), pp. 43–52.
- LFP-1992-Henessey #delivery #lisp #named
- WCL: Delivering Efficient Common Lisp Applications Under Unix (WH), pp. 260–269.
- LFP-1992-JagannathanP #concurrent #multi #thread
- A Foundation for an Efficient Multi-Threaded Scheme System (SJ, JP), pp. 345–357.
- LFP-1992-KaserPRRS #experience #implementation #lazy evaluation #parallel
- Fast Parallel Implementation of Lazy Languages — The EQUALS Experience (OK, SP, CRR, IVR, RCS), pp. 335–344.
- LFP-1992-NagasakaSIGT #implementation #lisp
- Tachyon Common Lisp: An Efficient and Portable Implementation of CLtL2 (AN, YS, TI, HG, JT), pp. 270–277.
- CHI-1992-TealR
- A performance model of system delay and user strategy selection (SLT, AIR), pp. 295–305.
- CAiSE-1992-OpdahlS #development #framework #information management
- A Framework for Performance Engineering During Information System Development (ALO, AS), pp. 65–87.
- KR-1992-MintonDBP #partial order
- Total Order vs. Partial Order Planning: Factors Influencing Performance (SM, MD, JLB, ABP), pp. 83–92.
- ML-1992-Carpineto #consistency #induction
- Trading Off Consistency and Efficiency in version-Space Induction (CC), pp. 43–48.
- ML-1992-HunterHS #classification
- Efficient Classification of Massive, Unsegmented Datastreams (LH, NLH, DJS), pp. 224–232.
- ML-1992-LapointeM #induction #named #recursion #source code
- Sub-unification: A Tool for Efficient Induction of Recursive Programs (SL, SM), pp. 273–281.
- ML-1992-McCallum #learning #proximity #using
- Using Transitional Proximity for Faster Reinforcement Learning (AM), pp. 316–321.
- SIGIR-1992-FoxCH #algorithm
- A Faster Algorithm for Constructing Minimal Perfect Hash Functions (EAF, QFC, LSH), pp. 266–273.
- OOPSLA-1992-HoskingMS #comparative #evaluation #implementation
- A Comparative Performance Evaluation of Write Barrier Implementations (ALH, JEBM, DS), pp. 92–109.
- OOPSLA-1992-RichardsonSC #fine-grained #named
- CACL: Efficient Fine-Grained Protection for Objects (JER, PMS, LFC), pp. 263–275.
- ALP-1992-BundgenE #algorithm #analysis #normalisation
- A Fast Algorithm for Ground Normal Form Analysis (RB, HE), pp. 291–305.
- LOPSTR-1992-Demoen #on the #prolog
- On the Transformation of a Prolog Program to a More Efficient Binary Program (BD), pp. 242–252.
- LOPSTR-1992-Jimenez-MartinMM #compilation #lazy evaluation #prolog
- Efficient Compilation of Lazy Narrowing into Prolog (JAJM, JMC, JJMN), pp. 253–270.
- PEPM-1992-HarnettM #compilation #object-oriented #towards
- Towards Efficient Compilation of a Dynamic Object-Oriented Language (SH, MM), pp. 82–89.
- PLDI-1992-Maslov #dependence #equation #multi #named
- Delinearization: An Efficient Way to Break Multiloop Dependence Equations (VM), pp. 152–161.
- PLDI-1992-Proebsting #generative
- Simple and Efficient BURS Table Generation (TAP), pp. 331–340.
- PLILP-1992-KrallB #compilation #prolog
- Fast Prolog with VAM1p based Prolog Compiler (AK, TB), pp. 245–259.
- TRI-Ada-C-1992-Westley #communication #distributed #evaluation #realtime
- Evaluation and Improvement of Performance of the Communication Subsystem of a Real-Time, Distributed, C2 Simulator (TJW), pp. 553–562.
- WSA-1992-Ayers #analysis #reachability
- Efficient Closure Analysis with Reachability (AEA), pp. 126–134.
- WSA-1992-BreuerB #decompiler
- Decompilation is the Efficient Enumeration of Types (PTB, JPB), pp. 255–273.
- WSA-1992-CodishFMW #analysis #concurrent #constraints #logic programming #source code
- Efficient Analysis of Reactive Properties of Concurrent Constraint Logic Programs (MC, MF, KM, WHW), pp. 35–42.
- KBSE-1992-Liao #execution #on the
- On Efficiently Computing Derived Performance Data of Program Execution (YL), p. 25.
- SOSP-WIP-1991-Perl92
- Performance Assertion Checking (SEP), p. 25.
- ASPLOS-1992-BakerADOS #file system #memory management #reliability
- Non-Volatile Memory for Fast, Reliable File Systems (MB, SA, ED, JKO, MIS), pp. 10–22.
- ASPLOS-1992-BershadRE
- Fast Mutual Exclusion for Uniprocessors (BNB, DDR, JRE), pp. 223–233.
- ASPLOS-1992-SmithHL
- Efficient Superscalar Performance Through Boosting (MDS, MH, MSL), pp. 248–259.
- ASPLOS-1992-TorrellasGH #multi #operating system
- Characterizing the Caching and Synchronization Performance of a Multiprocessor Operating System (JT, AG, JLH), pp. 162–174.
- ASPLOS-1992-VeenstraF #evaluation #hybrid #protocol
- A Performance Evaluation of Optimal Hybrid Cache Coherency Protocols (JEV, RJF), pp. 149–160.
- ASPLOS-1992-Wahbe
- Efficient Data Breakpoints (RW), pp. 200–212.
- CC-1992-Knopp #analysis #lisp #parallel
- Improving the Performance of Parallel LISP by Compile Time Analysis (JK), pp. 271–277.
- DAC-1992-ChangCLLO #design #named
- IPDA: Interconnect Performance Design Assistant (NHC, KJC, JL, KL, SYO), pp. 472–477.
- DAC-1992-ChenF #algorithm #logic #optimisation #set
- Efficient Sum-to-One Subsets Algorithm for Logic Optimization (KCC, MF), pp. 443–448.
- DAC-1992-ChengCDL #optimisation
- The Role of Long and Short Paths in Circuit Performance Optimization (SWC, HCC, DHCD, AL), pp. 543–548.
- DAC-1992-FangFL #approach #multi #problem
- A New Efficient Approach to Multilayer Channel Routing Problem (SCF, WSF, SLL), pp. 579–584.
- DAC-1992-GaoVL #algorithm
- A Performance Driven Macro-Cell Placement Algorithm (TG, PMV, CLL), pp. 147–152.
- DAC-1992-GregoryMF #named #resource management
- ISIS: A System for Performance Driven Resource Sharing (BG, DM, DF), pp. 285–290.
- DAC-1992-Hirose #evaluation #logic #simulation
- Performance Evaluation of an Event-Driven Logic Simulation Machine (FH), pp. 428–431.
- DAC-1992-HongHCK #algorithm #named
- FARM: An Efficient Feed-Through Pin Assignment Algorithm (XH, JH, CKC, ESK), pp. 530–535.
- DAC-1992-KimOI #generative
- Experiments with a Performance Driven Module Generator (SK, RMO, MJI), pp. 687–690.
- DAC-1992-LeeH #fault #named #parallel
- HOPE: An Efficient Parallel Fault Simulator for Synchronous Sequential Circuits (HKL, DSH), pp. 336–340.
- DAC-1992-LeeR92a #concurrent #fault #on the #simulation
- On Efficient Concurrent Fault Simulation for Synchronous Sequential Circuits (DHL, SMR), pp. 327–331.
- DAC-1992-MercerKR #functional #generative #order
- Functional Approaches to Generating Orderings for Efficient Symbolic Representations (MRM, RK, DER), pp. 624–627.
- DAC-1992-NatarajanSHS
- Over-the-Cell Channel Routing for High Performance Circuits (SN, NAS, NDH, MS), pp. 600–603.
- DAC-1992-OkudaO #algorithm #generative #layout
- An Efficient Routing Algorithm for SOG Cell Generation on a Dense Gate-Isolated Layout Style (RO, SO), pp. 676–681.
- DAC-1992-PuriG #algorithm
- An Efficient algorithm for Microword Length Minimization (RP, JG), pp. 651–656.
- DAC-1992-RaghavanBR #named #problem #simulation
- AWESpice: A General Tool for the Accurate and Efficient Simulation of Interconnect Problems (VR, JEB, RAR), pp. 87–92.
- DAC-1992-SarabiP #canonical #network
- Fast Exact and Quasi-Minimal Minimization of Highly Testable Fixed-Polarity AND/XOR Canonical Networks (AS, MAP), pp. 30–35.
- HPDC-1992-BilgicS
- High Performance PDU Processing for Application Layer (MB, BS), pp. 161–170.
- HPDC-1992-BogineniD #comparison #network #protocol
- Performance Comparison of Reservation and Preallocation Protocols for Star-Coupled WDM Photonic Networks (KB, PWD), pp. 94–103.
- HPDC-1992-CheungR #clustering
- High Performance Computing on a Cluster of Workstations (ALC, APR), pp. 152–160.
- HPDC-1992-FaigleFHNPS #distributed
- MOVIE Model for Open Systems Based High Performance Distributed Computing (CF, WF, TH, JN, MP, DAS), pp. 37–56.
- HPDC-1992-NgM #array #maintenance
- Maintaining Good Performance In Disk Arrays During Failure via Uniform Parity Group Distribution (SWN, RLM), pp. 260–269.
- HPDC-1992-ParasharHMF #analysis #distributed
- A Requirement Analysis for High Performance Distributed Computing over LANs (MP, SH, AGM, GF), pp. 142–151.
- HPDC-1992-PuFSWY #comparison #distributed #policy
- Performance Comparison of Active-Sender and Active-Receiver Policies for Distributed Caching (CP, DF, PS, KLW, PSY), pp. 218–227.
- HPDC-1992-SchmidtBS #adaptation #architecture #flexibility #lightweight #multi #named #network #protocol
- ADAPTIVE: A Flexible and Adaptive Transport System Architecture to Support Lightweight Protocols for Multimedia Applications on High-Speed Networks (DCS, DFB, TS), pp. 174–186.
- HPDC-1992-SinghAW
- Computing Radiosity Solution on a High Performance Workstation LAN (GBS, SGA, FHW), pp. 248–257.
- HPDC-1992-WilsonGC #case study #experience
- Experiences in High Performance Computing with Pleiades and ESP (LFW, MJG, MWC), pp. 67–76.
- IWMM-1992-Mateu #implementation
- An Efficient Implementation for Coroutines (LM), pp. 230–247.
- ESOP-1992-Chuang #array #incremental #persistent
- Fully Persistent Arrays for Efficient Incremental Updates and Voluminous Reads (TRC), pp. 110–129.
- STOC-1992-BellareP #proving
- Making Zero-Knowledge Provers Efficient (MB, EP), pp. 711–722.
- STOC-1992-BlumR #learning #query
- Fast Learning of k-Term DNF Formulas with Queries (AB, SR), pp. 382–389.
- STOC-1992-ChoyS #algorithm #distributed #fault tolerance #resource management
- Efficient Fault Tolerant Algorithms for Resource Allocation in Distributed Systems (MC, AKS), pp. 593–602.
- STOC-1992-DworkW #bound #concurrent #exclamation
- Simple and Efficient Bounded Concurrent Timestamping or Bounded Concurrent Timestamp Systems are Comprehensible! (CD, OW), pp. 655–666.
- STOC-1992-KarpLH #distributed #memory management #simulation
- Efficient PRAM Simulation on a Distributed Memory Machine (RMK, ML, FMadH), pp. 318–326.
- STOC-1992-KedemPRR #parallel #program transformation
- Efficient Program Transformations for Resilient Parallel Computation via Randomization (ZMK, KVP, MOR, AR), pp. 306–317.
- STOC-1992-Kilian #proving
- A Note on Efficient Zero-Knowledge Proofs and Arguments (JK), pp. 723–732.
- STOC-1992-Rao #algorithm #graph
- Faster Algorithms for Finding Small Edge Cuts in Planar Graphs (SR), pp. 229–240.
- CADE-1992-ChirimarGI #interface #named #proving #visual notation
- Xpnet: A Graphical Interface to Proof Nets with an Efficient Proof Checker (JC, CAG, MVI), pp. 711–715.
- CADE-1992-Zhang #named
- Herky: High Performance Rewriting in RRL (HZ), pp. 696–700.
- CAV-1992-CleavelandKS #calculus #model checking #μ-calculus
- Faster Model Checking for the Modal μ-Calculus (RC, MK, BS), pp. 410–422.
- CAV-1992-HojatiTKB #regular expression
- Efficient ω-Regular Language Containment (RH, HJT, RPK, RKB), pp. 396–409.
- CAV-1992-Larsen #correctness
- Efficient Local Correctness Checking (KGL), pp. 30–43.
- IWPTS-1992-ChungS #generative #protocol #testing
- Applications of Sufficient Conditions for Efficient Protocol Test Generation (AC, DPS), pp. 219–228.
- IWPTS-1992-Koblentz #testing
- Issues in Testing Fast Packet Services over the Broadband ISDN (MK), pp. 3–18.
- JICSLP-1992-GudemanBD #implementation #named
- jc: An Efficient and Portable Sequential Implementation of Janus (DG, KDB, SKD), pp. 399–413.
- PODS-1991-Matsliach #analysis #multi
- Performance Analysis of File Organizations that Use Multi-Bucket Data Leaves with Partial Expansions (GM), pp. 164–180.
- SIGMOD-1991-KellerGM #assembly
- Efficient Assembly of Complex Objects (TK, GG, DM), pp. 148–157.
- SIGMOD-1991-SrinivasanC #algorithm #concurrent
- Performance of B-Tree Concurrency Algorithms (VS, MJC), pp. 416–425.
- VLDB-1991-BrantGLM #case study #database
- Effects of Database Size on Rule System Performance: Five Case Studies (DAB, TG, BJL, DPM), pp. 287–296.
- VLDB-1991-HasseW #evaluation #multi #transaction
- A Performance Evaluation of Multi-Level Transaction Management (CH, GW), pp. 55–66.
- VLDB-1991-MohanN #protocol #transaction
- Recovery and Coherency-Control Protocols for Fast Intersystem Page Transfer and Fine-Granularity Locking in a Shared Disks Transaction Environment (CM, IN), pp. 193–207.
- VLDB-1991-ZobelTS #database #documentation #relational
- Efficiency of Nested Relational Document Database Systems (JZ, JAT, RSD), pp. 91–102.
- ICALP-1991-Furer #algorithm #graph
- An Efficient NC Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs (MF), pp. 429–440.
- ICALP-1991-Hagerup #generative #parallel #permutation #random
- Fast Parallel Generation of Random Permutations (TH), pp. 405–416.
- ICALP-1991-LengauerT #algorithm #problem
- Efficient Algorithms for Path Problems with Gernal Cost Citeria (TL, DT), pp. 314–326.
- ICALP-1991-Loebl #graph #polynomial
- Efficient Maximal Cubic Graph Cuts (ML), pp. 351–362.
- RTA-1991-CohenW #representation #term rewriting
- An Efficient Representation of Arithmetic for Term Rewriting (DC, PW), pp. 240–251.
- RTA-1991-RameshR #incremental #normalisation #term rewriting
- Incremental Techniques for Efficient Normalization of Nonlinear Rewrite Systems (RR, IVR), pp. 335–347.
- FPCA-1991-FrandsenS #implementation #question #what #λ-calculus
- What is an Efficient Implementation of the λ-calculus? (GSF, CS), pp. 289–312.
- FPCA-1991-Henglein #analysis #higher-order #type inference
- Efficient Type Inference for Higher-Order Binding-Time Analysis (FH), pp. 448–472.
- FPCA-1991-SmetsersNGP #functional #generative #lazy evaluation
- Generating Efficient Code for Lazy Functional Languages (SS, EN, JHGvG, MJP), pp. 592–617.
- KR-1991-ChalasaniEM #algorithm #permutation #problem
- Integrating Efficient Model-Learning and Problem-Solving Algorithms in Permutation Environments (PC, OE, JM), pp. 89–98.
- ML-1991-KijsirikulNS #learning #logic programming #source code
- Efficient Learning of Logic Programs with Non-determinant, Non-discriminating Literals (BK, MN, MS), pp. 417–421.
- ML-1991-MaW #consistency #knowledge base #optimisation
- Improving the Performance of Inconsistent Knowledge Bases via Combined Optimization Method (YM, DCW), pp. 23–27.
- ML-1991-Walczak #induction #predict
- Predicting Actions from Induction on Past Performance (SW), pp. 275–279.
- SIGIR-1991-Mauldin #concept #information retrieval
- Performance in FERRET: A Conceptual Information Retrieval System (MLM), pp. 347–355.
- SIGIR-1991-Motzkin #documentation #retrieval
- An Efficient Directory System for Document Retrieval (DM), pp. 291–303.
- AdaEurope-1991-Lundberg #ada #multi
- A Coprocessor for High Performance Multiprocessor Ada Tasking (LL), pp. 147–165.
- PLDI-1991-MaydanHL #analysis #data flow #dependence
- Efficient and Exact Data Dependence Analysis (DEM, JLH, MSL), pp. 1–14.
- PLILP-1991-BaumF
- The System FLR (Fast Laboratory for Recomposition) (BB, PF), pp. 427–428.
- PLILP-1991-CheongF #integration #prolog
- Efficient Integration of Simplifications into Prolog (PHC, LF), pp. 359–370.
- PLILP-1991-HalbwachsRR #data flow #generative #source code
- Generating Efficient Code From Data-Flow Programs (NH, PR, CR), pp. 207–218.
- PLILP-1991-VogtSK #attribute grammar #higher-order #incremental
- Efficient Incremental Evaluation of Higher order Attribute Grammars (HV, SDS, MFK), pp. 231–242.
- PLILP-1991-Vollmer #case study #compilation #experience #logic programming
- Experiences with Gentle: Efficient Compiler Construction Based On Logic Programming (JV), pp. 425–426.
- ESEC-1991-HonidenUI #design #process #prototype #realtime
- An Application of Artifical Intelligence to Prototyping Process in Performance Design for Real-time Systems (SH, NU, KI), pp. 189–209.
- ASPLOS-1991-BagrodiaM #implementation #parallel #source code
- Efficient Implementation of High Level Parallel Programs (RB, SM), pp. 142–151.
- ASPLOS-1991-BhandarkarC #architecture #hardware
- Performance From Architecture: Comparing a RISC and CISC with Similar Hardware Organization (DB, DWC), pp. 310–319.
- ASPLOS-1991-GharachorlooGH #consistency #evaluation #memory management #modelling #multi
- Performance Evaluation of Memory Consistency Models for Shared Memory Multiprocessors (KG, AG, JLH), pp. 245–257.
- ASPLOS-1991-HallO #architecture
- Performance Characteristics of Architectural Features of the IBM RISC System/6000 (CBH, KO), pp. 303–309.
- ASPLOS-1991-LamRW #algorithm #optimisation
- The Cache Performance and Optimizations of Blocked Algorithms (MSL, EER, MEW), pp. 63–74.
- ASPLOS-1991-LeeK #array
- Performance Consequences of Parity Placement in Disk Arrays (EKL, RHK), pp. 190–199.
- ASPLOS-1991-LeeKB #float
- The Floating-Point Performance of a Superscalar SPARC Processor (RLL, AYK, FAB), pp. 28–37.
- ASPLOS-1991-MinC #detection
- An Efficient Cache-Based Access Anomaly Detection Scheme (SLM, JDC), pp. 235–244.
- ASPLOS-1991-MogulB
- The Effect of Context Switches on Cache Performance (JCM, AB), pp. 75–84.
- DAC-1991-ButlerRKM #diagrams #heuristic #order
- Heuristics to Compute Variable Orderings for Efficient Manipulation of Ordered Binary Decision Diagrams (KMB, DER, RK, MRM), pp. 417–420.
- DAC-1991-CardenC #algorithm #approximate #multi #using
- A Global Router Using An Efficient Approximate Multicommodity Multiterminal Flow Algorithm (RCCI, CKC), pp. 316–321.
- DAC-1991-ChenDL #optimisation
- Critical Path Selection for Performance Optimization (HCC, DHCD, LRL), pp. 547–550.
- DAC-1991-FrancisRV #named
- Chortle-crf: Fast Technology Mapping for Lookup Table-Based FPGAs (RJF, JR, ZGV), pp. 227–233.
- DAC-1991-Gad-El-KarimG #generative #layout
- Generation of Performance Sensitivities for Analog Cell Layout (GGEK, RSG), pp. 500–505.
- DAC-1991-HwangHLH #automation #generative #layout
- An Efficient Layout Style for 2-Metal CMOS Leaf Cells And Their Automatic Generation (CYH, YCH, YLL, YCH), pp. 481–486.
- DAC-1991-Krasniewski #logic #pseudo #synthesis #testing
- Logic Synthesis for Efficient Pseudoexhaustive Testability (AK), pp. 66–72.
- DAC-1991-LiuDC #algorithm #parallel
- An Efficient Parallel Critical Path Algorithm (LRL, DHCD, HCC), pp. 535–540.
- DAC-1991-Luk #constraints #generative #layout #physics
- A Fast Physical Constraint Generator for Timing Driven Layout (WKL), pp. 626–631.
- DAC-1991-MontessoroG #concurrent #fault #multi #named #simulation
- Creator: General and Efficient Multilevel Concurrent Fault Simulation (PLM, SG), pp. 160–163.
- DAC-1991-ParkK #automation #scheduling
- Fast and Near Optimal Scheduling in Automatic Data Path Aynthesis (ICP, CMK), pp. 680–685.
- DAC-1991-RoychowdhuryP #simulation
- Efficient Transient Simulation of Lossy Interconnect (JSR, DOP), pp. 740–745.
- DAC-1991-ShihK #approach #equation #named #using
- ILLIADS: A New Fast MOS Timing Simulator Using Direct Equation-Solving Approach (YHS, SMK), pp. 20–25.
- DAC-1991-TsayK #approach #optimisation
- An Analytic Net Weighting Approach for Performance Optimization in Circuit Placement (RST, JK), pp. 620–625.
- DAC-1991-VandrisS #algorithm #fault #memory management #simulation
- Algorithms for Fast, Memory Efficient Switch-Level Fault Simulation (EV, GES), pp. 138–143.
- DAC-1991-VisweswariahR #simulation
- Efficient Simulation of Bipolar Digital ICs (CV, RAR), pp. 32–37.
- PPoPP-1991-BalasundaramFKK #clustering
- A Static Performance Estimator to Guide Data Partitioning Decisions (VB, GF, KK, UK), pp. 213–223.
- PPoPP-1991-HollingsworthIM #integration #metric #parallel
- The Integration of Application and System Based Metrics in a Parallel Program Performance Tool (JKH, RBI, BPM), pp. 189–200.
- PPoPP-1991-KungSGK #network #scalability
- Parallelizing a New Class of Large Applications over High-speed Networks (HTK, PS, MG, MK), pp. 167–177.
- PPoPP-1991-Malony #case study
- Event-Based Performance Perturbation: A Case Study (ADM), pp. 201–212.
- PPoPP-1991-MeierE #algorithm #parallel
- Parallelization and Performance of Conjugate Gradient Algorithms on the Cedar Hierarchical-Memory Multiprocessor (UM, RE), pp. 178–188.
- SOSP-1991-CarterBZ #implementation
- Implementation and Performance of Munin (JBC, JKB, WZ), pp. 152–164.
- SOSP-1991-MullerP #design #file system #multi
- A High Performance Multi-Structured File System Design (KM, JP), pp. 56–67.
- CCPSD-1991-SteffenKR #adaptation #reduction
- Efficient Code Motion and an Adaption to Strength Reduction (BS, JK, OR), pp. 394–415.
- STOC-1991-BabaiCFLS #algorithm #monte carlo #permutation
- Fast Monte Carlo Algorithms for Permutation Groups (LB, GC, LF, EML, ÁS), pp. 90–100.
- STOC-1991-DjidjevR #algorithm #problem
- An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs (HD, JHR), pp. 337–347.
- STOC-1991-KedemPRS #parallel
- Combining Tentative and Definite Executions for Very Fast Dependable Parallel Computing (ZMK, KVP, AR, PGS), pp. 381–390.
- STOC-1991-LeightonMPSTT #algorithm #approximate #multi #problem
- Fast Approximation Algorithms for Multicommodity Flow Problems (FTL, FM, SAP, CS, ÉT, ST), pp. 101–111.
- CAV-1991-ChristoffC #algorithm #probability #process #verification
- Efficient Algorithms for Verification of Equivalences for Probabilistic Processes (LC, IC), pp. 310–321.
- CAV-1991-GodefroidW #concurrent #partial order #safety #using #verification
- Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties (PG, PW), pp. 332–342.
- ISLP-1991-Kawamura #logic programming #source code
- Derivation of Efficient Logic Programs by Synthesizing New Predicates (TK), pp. 611–625.
- TAV-1991-GuptaS #approach #detection #runtime
- Loop Monotonic Computations: An Approach for the Efficient Run-Time Detection of Races (RG, MS), pp. 98–111.
- PODS-1990-ArefS #data type #query
- Efficient Processing of Window Queries in The Pyramid Data Structure (WGA, HS), pp. 265–272.
- PODS-1990-JohnsonS #algorithm #analysis #concurrent #framework
- A Framework for the Performance Analysis of Concurrent B-tree Algorithms (TJ, DS), pp. 273–287.
- SIGMOD-1990-AtzeniT #independence
- Efficient Updates to Independent Schemes in the Weak Instance Model (PA, RT), pp. 84–93.
- SIGMOD-1990-BadrinathR #concurrent #evaluation #multi #protocol #semantics
- Performance Evaluation of Semantics-based Multilevel Concurrency Control Protocols (BRB, KR), pp. 163–172.
- SIGMOD-1990-BeckmannKSS #robust
- The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles (NB, HPK, RS, BS), pp. 322–331.
- SIGMOD-1990-LometS #multi
- The Performance of a Multiversion Access Method (DBL, BS), pp. 353–363.
- SIGMOD-1990-ShekitaC #evaluation #pointer
- A Performance Evaluation of Pointer-Based Joins (EJS, MJC), pp. 300–311.
- SIGMOD-1990-Wang #design #polynomial #towards
- Polynomial Time Designs toward Both BCNF and Efficient Data Manipulation (KW), pp. 74–83.
- VLDB-1990-AgrawalA #approach #protocol
- The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data (DA, AEA), pp. 243–254.
- VLDB-1990-DrewKH #algorithm #implementation
- The Performance and Utility of the Cactis Implementation Algorithms (PD, RK, SEH), pp. 135–147.
- VLDB-1990-KuittinenNSS #bottom-up #evaluation #implementation #logic #query
- Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries (JK, ON, SS, ESS), pp. 372–379.
- VLDB-1990-MuntzL #analysis #array
- Performance Analysis of Disk Arrays under Failure (RRM, JCSL), pp. 162–173.
- VLDB-1990-PucheralTV #data transformation #in memory #memory management #using
- Efficient Main Memory Data Management Using the DBGraph Storage Model (PP, JMT, PV), pp. 683–695.
- VLDB-1990-SeegerK #database #robust
- The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems (BS, HPK), pp. 590–601.
- ICALP-1990-ColeGO #diagrams #parallel
- Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (RC, MTG, CÓ), pp. 432–445.
- ICALP-1990-GrooteV #algorithm #bisimulation #branch #equivalence
- An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence (JFG, FWV), pp. 626–638.
- ICALP-1990-NaherM #algorithm #data type #library #named
- LEDA: A Library of Efficient Data Types and Algorithms (SN, KM), pp. 1–5.
- LFP-1990-FeeleyM #compilation #parallel #virtual machine
- A Parallel Virtual Machine for Efficient Scheme Compilation (MF, JSM), pp. 119–130.
- LFP-1990-Hanson #recursion #stack
- Efficient Stack Allocation for Tail-Recursive Languages (CH), pp. 106–118.
- LFP-1990-KiczalesR
- Efficient Method Dispatch in PCL (GK, LR), pp. 99–105.
- GG-1990-BunkeGT #algorithm #graph grammar #implementation
- An Efficient Implementation of Graph Grammars Based on the RETE Matching Algorithm (HB, TG, THT), pp. 174–189.
- CHI-1990-CushmanOD #question #requirements #what
- Usable OCR: what are the minimum performance requirements? (WHC, PSO, CMD), pp. 145–152.
- CHI-1990-JellinekC
- Powermice and user performance (HDJ, SKC), pp. 213–220.
- CHI-1990-John #analysis #visual notation
- Extensions of GOMS analyses to expert performance requiring perception of dynamic visual and auditory information (BEJ), pp. 107–116.
- ML-1990-BonelliPSW #named
- Newboole: A Fast GBML System (PB, AP, SS, SWW), pp. 153–159.
- ML-1990-ChanW #analysis #induction #learning #probability
- Performance Analysis of a Probabilistic Inductive Learning System (KCCC, AKCW), pp. 16–23.
- ML-1990-KadabaN #algorithm #automation #parametricity #search-based
- Improving the Performance of Genetic Algorithms in Automated Discovery of Parameters (NK, KEN), pp. 140–148.
- ML-1990-SammutC #learning #question
- Is Learning Rate a Good Performance Criterion for Learning? (CS, JC), pp. 170–178.
- OOPSLA-ECOOP-1990-FaustL #object-oriented #thread
- The Performance of an Object-Oriented Threads Package (JEF, HML), pp. 278–288.
- PLDI-1990-Kessler #design #implementation
- Fast Breakpoints: Design and Implementation (PBK), pp. 78–84.
- PLDI-1990-Wendt #code generation #using
- Fast Code Generation Using Automatically-Generated Decision Trees (ALW), pp. 9–15.
- PLILP-1990-Leroy #data transformation #polymorphism #representation
- Efficient Data Representation in Polymorphic Languages (XL), pp. 255–276.
- POPL-1990-MarloweR #algorithm #analysis #data flow #hybrid #incremental
- An Efficient Hybrid Algorithm for Incremental Data Flow Analysis (TJM, BGR), pp. 184–196.
- POPL-1990-SekarPR #analysis #strict
- Small Domains Spell Fast Strictness Analysis (RCS, SP, IVR), pp. 169–183.
- Best-of-PLDI-1990-Kessler90a #design #implementation
- Fast breakpoints: design and implementation (with retrospective) (PBK), pp. 390–397.
- CC-1990-Pettersson #continuation #generative #semantics
- Generating Efficient Code from Continuation Semantics (MP), pp. 165–178.
- DAC-1990-BraceRB #implementation
- Efficient Implementation of a BDD Package (KSB, RLR, REB), pp. 40–45.
- DAC-1990-ButlerM #design #fault
- The Influences of Fault Type and Topology on Fault Model Performance and the Implications to Test and Testable Design (KMB, MRM), pp. 673–678.
- DAC-1990-CaiNSM #assembly #layout
- A Data Path Layout Assembler for High Performance DSP Circuits (HC, SN, PS, HDM), pp. 306–311.
- DAC-1990-CarlsonR #algorithm #design #evaluation #parallel #verification
- Design and Performance Evaluation of New Massively Parallel VLSI Mask Verification Algorithms in JIGSAW (ECC, RAR), pp. 253–259.
- DAC-1990-LeeH #automation #fault #generative #named
- SOPRANO: An Efficient Automatic Test Pattern Generator for Stuck-Open Faults in CMOS Combinational Circuits (HKL, DSH), pp. 660–666.
- DAC-1990-MinatoIY #diagrams
- Shared Binary Decision Diagram with Attributed Edges for Efficient Boolean function Manipulation (SiM, NI, SY), pp. 52–57.
- DAC-1990-NiermannCP #fault #memory management #named #proving
- Proofs: A Fast, Memory Efficient Sequential Circuit Fault Simulator (TMN, WTC, JHP), pp. 535–540.
- DAC-1990-ParkM #generative #logic #testing
- An Efficient Delay Test Generation System for Combinational Logic Circuits (ESP, MRM), pp. 522–528.
- DAC-1990-SaabR #effectiveness #evolution #heuristic #layout #probability #problem
- Stochastic Evolution: a Fast Effective Heuristic for Some Generic Layout Problems (YS, VBR), pp. 26–31.
- STOC-1990-KaoK #algorithm #graph #parallel #towards #transitive
- Towards Overcoming the Transitive-Closure Bottleneck: Efficient Parallel Algorithms for Planar Digraphs (MYK, PNK), pp. 181–192.
- STOC-1990-KedemPS #parallel #robust
- Efficient Robust Parallel Computations (ZMK, KVP, PGS), pp. 138–148.
- STOC-1990-KleinST #algorithm #approximate #concurrent
- Leighton-Rao Might Be Practical: Faster Approximation Algorithms for Concurrent Flow with Uniform Capacities (PNK, CS, ÉT), pp. 310–321.
- STOC-1990-NaorN #probability
- Small-bias Probability Spaces: Efficient Constructions and Applications (JN, MN), pp. 213–223.
- STOC-1990-Ostrovsky
- Efficient Computation on Oblivious RAMs (RO), pp. 514–523.
- STOC-1990-Vishkin #pattern matching
- Deterministic Sampling-A New Technique for Fast Pattern Matching (UV), pp. 170–180.
- CADE-1990-Boudet #algorithm #equation #unification
- Unification in a Combination of Equational Theories: an Efficient Algorithm (AB), pp. 292–307.
- CADE-1990-SchumannLK #implementation #parallel #proving #theorem proving #tutorial
- Tutorial on High-Performance Theorem Provers: Efficient Implementation and Parallelisation (JS, RL, FJK), p. 683.
- CAV-1990-CourcoubetisVWY #algorithm #memory management #verification
- Memory Efficient Algorithms for the Verification of Temporal Properties (CC, MYV, PW, MY), pp. 233–242.
- CLP-1990-DelcherK90 #anti #parallel
- Efficient Parallel Term Matching and Anti-Unification (ALD, SK), pp. 355–369.
- CLP-1990-HermenegildoG90 #independence #prolog
- &-Prolog and its Performance: Exploiting Independent And-Parallelism (MVH, KJG), pp. 253–268.
- CLP-1990-KorslootM90 #architecture #comparison #modelling #prolog
- Sequential Architecture Models for Prolog: A Performance Comparison (MK, HMM), pp. 49–67.
- CLP-1990-VerschaetseSB90 #compilation #generative
- Generation and Compilation of Efficient Computation Rules (KV, DDS, MB), pp. 700–714.
- CSL-1990-Burgard #logic programming #source code
- Efficiency Considerations on Goal-Directed Chaining for Logic Programs (WB), pp. 80–94.
- CSL-1990-Durdanovic #algorithm #garbage collection #prolog
- A Fast Garbage Collection Algorithm for WAM-Based Prolog (ID), pp. 110–127.
- CSL-1990-Hahnle #logic #multi #proving #towards
- Towards an Efficient Tableau Proof Procedure for Multiple-Valued Logics (RH), pp. 248–260.
- LICS-1990-EmersonES #decidability #on the
- On the Limits of Efficient Temporal Decidability (EAE, ME, JS), pp. 464–475.
- NACLP-1990-AliK #prolog
- The Muse Or-Parallel Prolog Model and its Performance (KAMA, RK), pp. 757–776.
- NACLP-1990-Bol #towards
- Towards More Efficient Loop Checks (RNB), pp. 465–479.
- PODS-1989-Grahne #database
- Horn Tables — An Efficient Tool for Handling Incomplete Information in Databases (GG), pp. 75–82.
- SIGMOD-1989-AgrawalBJ #knowledge base #scalability #transitive
- Efficient Management of Transitive Relationships in Large Data and Knowledge Bases (RA, AB, HVJ), pp. 253–262.
- SIGMOD-1989-Bry #evaluation #quantifier #query #revisited #towards
- Towards an Efficient Evaluation of General Queries: Quantifier and Disjunction Processing Revisited (FB), pp. 193–204.
- SIGMOD-1989-CareyL #concurrent #database #distributed #parallel
- Parallelism and Concurrency Control Performance in Distributed Database Machines (MJC, ML), pp. 122–133.
- SIGMOD-1989-Christodoulakis #retrieval
- Retrieval Performance Versus Disc Space Utilization on WORM Optical Discs (SC, DAF), pp. 306–314.
- SIGMOD-1989-Gray #database #metric
- Database Performance Metrics (JG), p. 2.
- SIGMOD-1989-NaughtonRSU #evaluation
- Efficient Evaluation of Right-, Left-, and Mult-Lineare Rules (JFN, RR, YS, JDU), pp. 235–242.
- SIGMOD-1989-SchneiderD #algorithm #evaluation #parallel
- A Performance Evaluation of Four Parallel Join Algorithms in a Shared-Nothing Multiprocessor Environment (DAS, DJD), pp. 110–121.
- SIGMOD-1989-ShekitaC #object-oriented #replication
- Performance Enhancement Through Replication in an Object-Oriented DBMS (EJS, MJC), pp. 325–336.
- ICALP-1989-Baeza-YatesG #regular expression
- Efficient Text Searching of Regular Expressions (RABY, GHG), pp. 46–62.
- RTA-1989-AvenhausDM #named #proving #theorem proving
- THEOPOGLES — An efficient Theorem Prover based on Rewrite-Techniques (JA, JD, JM), pp. 538–541.
- RTA-1989-Christian #summary
- Fast Knuth-Bendix Completion: Summary (JC), pp. 551–555.
- RTA-1989-SekarPR #execution #parallel #term rewriting
- Transforming Strongly Sequential Rewrite Systems with Constructors for Efficient parallel Execution (RCS, SP, IVR), pp. 404–418.
- RTA-1989-Snyder #algorithm #equation #generative #set
- Efficient Ground Completion: An O(n log n) Algorithm for Generating Reduced Sets of Ground Rewrite Rules Equivalent to a Set of Ground Equations E (WS), pp. 419–433.
- RTA-1989-Strandh #equation #source code
- Classes of Equational Programs that Compile into Efficient Machine Code (RS), pp. 449–461.
- FPCA-1989-Bloss #analysis #functional #implementation
- Update Analysis and the Efficient Implementation of Functional Aggregates (AGB), pp. 26–38.
- FPCA-1989-Takayama #proving #source code
- Extended Projection — New Method to Extract Efficient Programs from Constructive Proofs (YT), pp. 299–312.
- CHI-1989-Hendrickson #design #interface #visual notation
- Performance, preference, and visual scan patterns on a menu-based system: implications for interface design (JJH), pp. 217–222.
- KR-1989-BorgidaE #knowledge base #reasoning
- Hierarchical Knowledge Bases and Efficient Disjunctive Reasoning (AB, DWE), pp. 33–43.
- ML-1989-Keller #compilation #learning
- Compiling Learning Vocabulary from a Performance System Description (RMK), pp. 482–495.
- ML-1989-Wogulis #framework
- A Framework for Improving Efficiency and Accuracy (JW), pp. 78–80.
- SEKE-1989-Meyers #verification
- Performance Verification of the AT&T 5ESSOR Switch (MNM), p. 60.
- OOPSLA-1989-ChambersUL #dynamic typing #implementation #object-oriented #prototype
- An Efficient Implementation of SELF — a Dynamically-Typed Object-Oriented Language Based on Prototypes (CC, DU, EL), pp. 49–70.
- OOPSLA-1989-DixonMSV #inheritance #multi
- A Fast Method Dispatcher for Compiled Languages with Multiple Inheritance (RD, TM, PS, MV), pp. 211–214.
- PLDI-1989-EmmelmannSL #generative #named
- BEG — A Generator for Efficient Back Ends (HE, FWS, RL), pp. 227–237.
- POPL-1989-CooperK #alias #analysis #interprocedural
- Fast Interprocedural Alias Analysis (KDC, KK), pp. 49–59.
- POPL-1989-CytronFRWZ
- An Efficient Method of Computing Static Single Assignment Form (RC, JF, BKR, MNW, FKZ), pp. 25–35.
- POPL-1989-EmersonSS #reasoning
- Efficient Temporal Reasoning (EAE, TS, JS), pp. 166–178.
- ICSE-1989-Fox #development #lifecycle #scalability
- Performance Engineering as a Part of the Development Life Cycle for Large-Scale Software Systems (GF), pp. 85–94.
- ASPLOS-1989-AralGS #debugging #multi
- Efficient Debugging Primitives for Multiprocessors (ZA, IG, GS), pp. 87–95.
- ASPLOS-1989-EggersK #parallel #source code
- The Effect of Sharing on the Cache and Bus Performance of Parallel Programs (SJE, RHK), pp. 257–270.
- ASPLOS-1989-Karger #using
- Using Registers to Optimize Cross-Domain Call Performance (PAK), pp. 194–204.
- ASPLOS-1989-OwickiA
- Evaluating the Performance of Software Cache Coherence (SSO, AA), pp. 230–242.
- DAC-1989-BuiHJL #algorithm #graph
- Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms (TNB, CH, CJ, FTL), pp. 775–778.
- DAC-1989-ChengY #difference #fault #memory management #simulation #using
- Differential Fault Simulation — a Fast Method Using Minimal Memory (WTC, MLY), pp. 424–428.
- DAC-1989-FujiharaSIY #automation #named #optimisation
- DYNAJUST: An Efficient Automatic Routing Technique Optimizing Delay Conditions (YF, YS, YI, MY), pp. 791–794.
- DAC-1989-Jones #compilation #online
- Fast Online/Offline Netlist Compilation of Hierarchical Schematics (LGJ), pp. 822–825.
- DAC-1989-Kahng
- Fast Hypergraph Partition (ABK), pp. 762–766.
- DAC-1989-LokanathanK #graph
- Performance optimized floor planning by graph planarization (BL, EK), pp. 116–121.
- DAC-1989-McGeerB #logic
- Efficient Prime Factorization of Logic Expressions (PCM, RKB), pp. 221–225.
- DAC-1989-McGeerB89a #algorithm #network
- Efficient Algorithms for Computing the Longest Viable Path in a Combinational Network (PCM, RKB), pp. 561–567.
- DAC-1989-MeijsG #finite
- An Efficient Finite Element Method for Submicron IC Capacitance Extraction (NPvdM, AJvG), pp. 678–681.
- DAC-1989-SadayappanV #matrix #simulation
- Efficient Sparse Matrix Factorization for Circuit Simulation on Vector Supercomputers (PS, VV), pp. 13–18.
- DAC-1989-ShinL #2d #algorithm #layout
- An Efficient Two-Dimensional Layout Compaction Algorithm (HS, CYL), pp. 290–295.
- DAC-1989-WongS #optimisation
- Efficient Floorplan Area Optimization (DFW, PSS), pp. 586–589.
- DAC-1989-YenDG #algorithm #analysis
- Efficient Algorithms for Extracting the K most Critical Paths in Timing Analysis (SHY, DHCD, SG), pp. 649–654.
- DAC-1989-ZhangPR
- Efficient Final Placement Based on Nets-as-Points (XZ, LTP, RAR), pp. 578–581.
- SOSP-1989-BraunsteinRW
- Improving the Efficiency of UNIX File Buffer Caches (AB, MR, JW), pp. 71–82.
- SOSP-1989-Duchamp #analysis #transaction
- Analysis of Transaction Management Performance (DD), pp. 177–190.
- SOSP-1989-GrayC #consistency #distributed #fault tolerance #named
- Leases: An Efficient Fault-Tolerant Mechanism for Distributed File Cache Consistency (CGG, DRC), pp. 202–210.
- SOSP-1989-SchroederB
- Performance of Firefly RPC (MDS, MB), pp. 83–90.
- STOC-1989-FellowsL #algorithm #on the #polynomial
- On Search, Decision and the Efficiency of Polynomial-Time Algorithms (MRF, MAL), pp. 501–512.
- STOC-1989-HastadLN #using
- Fast Computation Using Faulty Hypercubes (JH, FTL, MN), pp. 251–263.
- STOC-1989-SchmidtS #aspect-oriented #on the
- On Aspects of Universality and Performance for Closed Hashing (JPS, AS), pp. 355–366.
- STOC-1989-Vallee #integer #polynomial
- Provably Fast Integer Factoring with Quasi-Uniform Small Quadratic Residues (BV), pp. 98–106.
- NACLP-1989-FurukawaFS #partial evaluation
- Deriving an Efficient Production System by Partial Evaluation (KF, HF, TS), pp. 661–674.
- NACLP-1989-HermenegildoR #correctness #independence #logic programming #on the #source code
- On the Correctness and Efficiency of Independent And-Parallelism in Logic Programs (MVH, FR), pp. 369–389.
- NACLP-1989-JacobsL #alias #approximate #logic programming #source code
- Accurate and Efficient Approximation of Variable Aliasing in Logic Programs (DJ, AL), pp. 154–165.
- NACLP-1989-KonogayaHAY #evaluation
- Performance Evaluation of a Sequential Inference Machine CHI (AK, SH, AA, MY), pp. 1165–1179.
- NACLP-1989-Lin #backtracking #parallel #random
- Expected Performance of the Randomized Parallel Backtracking Method (ZL), pp. 677–696.
- NACLP-1989-Mudambi #analysis #multi
- Performance Analysis of Aurora on a Switch-Based Multiprocessor (SM), pp. 697–712.
- NACLP-1989-SaletoreK #execution #logic programming #parallel #source code
- Obtaining First Solutions Faster in AND-OR Parallel Execution of Logic Programs (VAS, LVK), pp. 390–406.
- NACLP-1989-Szeredi #analysis #prolog
- Performance Analysis of the Aurora Or-Parallel Prolog System (PS), pp. 713–732.
- SIGMOD-1988-BorrP #integration #low level #sql
- High Performance SQL Through Low-Level System Integration (AJB, GRP), pp. 342–349.
- SIGMOD-1988-ChristodoulakisF #analysis
- Performance Analysis and Fundamental Performance Trade Offs for CLV Optical Disks (SC, DAF), pp. 286–294.
- SIGMOD-1988-DeWittGS #analysis #database
- A Performance Analysis of the Gamma Database Machine (DJD, SG, DAS), pp. 350–360.
- SIGMOD-1988-Hanson #analysis #database #query
- Processing Queries Against Database Procedures: A Performance Analysis (ENH), pp. 295–302.
- VLDB-1988-AbbottG #evaluation #realtime #scheduling #transaction
- Scheduling Real-time Transactions: a Performance Evaluation (RKA, HGM), pp. 1–12.
- VLDB-1988-AgrawalJ #database #scalability
- Efficient Search in Very Large Databases (RA, HVJ), pp. 407–418.
- VLDB-1988-CareyL #algorithm #case study #concurrent #distributed #replication
- Distributed Concurrency Control Performance: A Study of Algorithms, Distribution, and Replication (MJC, ML), pp. 13–25.
- VLDB-1988-FaloutsosC #comparison #data access #design #scalability
- Fast Text Access Methods for Optical and Large Magnetic Disks: Designs and Performance Comparison (CF, RC), pp. 280–293.
- VLDB-1988-IoannidisR #algorithm #transitive
- Efficient Transitive Closure Algorithms (YEI, RR), pp. 382–394.
- VLDB-1988-Jhingran #algorithm #database #optimisation #query
- A Performance Study of Query Optimization Algorithms on a Database System Supporting Procedures (AJ), pp. 88–99.
- VLDB-1988-SeegerK #data access #design #implementation
- Techniques for Design and Implementation of Efficient Spatial Access Methods (BS, HPK), pp. 360–371.
- ICALP-1988-ChangIP #bound #modelling #parallel #simulation
- Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATM’s and Space-Bounded TM’s (JHC, OHI, MAP), pp. 119–132.
- ICALP-1988-KruskalRS #algorithm #complexity #parallel
- A Complexity Theory of Efficient Parallel Algorithms (CPK, LR, MS), pp. 333–346.
- ICALP-1988-Lautemann #algorithm #graph grammar
- Efficient Algorithms on Context-Free Graph Grammars (CL), pp. 362–378.
- ICALP-1988-LengauerW #analysis #graph
- Efficient Analysis of Graph Properties on Context-free Graph Languages (TL, EW), pp. 379–393.
- LFP-1988-GharachorlooSH #approach
- A Simple and Efficient Implmentation Approach for Single Assignment Languages (KG, VS, JLH), pp. 259–268.
- LFP-1988-Norman #combinator #hardware #reduction #using
- Faster Combinator Reduction Using stock Hardware (ACN), pp. 235–243.
- OOPSLA-1988-DuhlD #benchmark #comparison #database #metric #relational #using
- A Performance Comparison of Object and Relational Databases Using the Sun Benchmark (JD, CD), pp. 153–163.
- OOPSLA-1988-Rose #hardware
- Fast Dispatch Mechanisms for Stock Hardware (JRR), pp. 27–35.
- ALP-1988-HoffmannP #evaluation #term rewriting
- Jungle Evaluation for Efficient Term Rewriting (BH, DP), pp. 191–203.
- PLDI-1988-FraserW #automation #code generation #generative #optimisation
- Automatic Generation of Fast Optimizing Code Generators (CWF, ALW), pp. 79–84.
- PLDI-1988-JainT #analysis #approach #data flow #multi
- An Efficient Approach to Data Flow Analysis in a Multi Pass Global Optimizer (SJ, CLT), pp. 154–163.
- PLDI-1988-LiskovS #distributed #named
- Promises: Linguistic Support for Efficient Asynchronous Procedure Calls in Distributed Systems (BL, LS), pp. 260–267.
- PLDI-1988-MillerC #debugging #parallel #source code
- A Mechanism for Efficient Debugging of Parallel Programs (BPM, JDC), pp. 135–144.
- POPL-1988-Debray #analysis #data flow #logic programming #source code
- Efficient Dataflow Analysis of Logic Programs (SKD), pp. 260–273.
- ICSE-1988-Benjamin #metric #named
- PILOT: A Prescription for Program Performance Measurement (JLB), pp. 388–395.
- CCHSC-1988-Grosch #generative
- Generators for High-Speed Front-Ends (JG), pp. 81–92.
- DAC-1988-BaltusA #generative #named
- SOLO: A Generator of Efficient Layouts from Optimized MOS Circuit Schematics (DGB, JA), pp. 445–452.
- DAC-1988-BeattyB #analysis #incremental #using
- Fast Incremental Circuit Analysis Using Extracted Hierarchy (DLB, REB), pp. 495–500.
- DAC-1988-ChangCS
- An Accurate and Efficient Gate Level Delay Calculator for MOS Circuits (FCC, CFC, PS), pp. 282–287.
- DAC-1988-ChiangNL #algorithm #analysis
- Time Efficient VLSI Artwork Analysis Algorithms in GOALIE2 (KWC, SN, CYL), pp. 471–475.
- DAC-1988-GaiMS #algorithm #concurrent #fault #simulation
- The Performance of the Concurrent Fault Simulation Algorithms in MOZART (SG, PLM, FS), pp. 692–697.
- DAC-1988-HelliwellP #algorithm #multi
- A Fast Algorithm to Minimize Multi-Output Mixed-Polarity Generalized Reed-Muller Forms (MH, MAP), pp. 427–432.
- DAC-1988-KazamaKNM #algorithm #evaluation #logic #simulation
- Algorithm for Vectorizing Logic Simulation and Evaluation of “VELVET” Performance (YK, YK, MN, HM), pp. 231–236.
- DAC-1988-KuoCS #algorithm
- Fast Algorithm for Optimal Layer Assignment (YSK, TCC, WKS), pp. 554–559.
- DAC-1988-LamD
- Performance of a New Annealing Schedule (JL, JMD), pp. 306–311.
- DAC-1988-MarpleSH #layout
- An Efficient Compactor for 45° Layout (DM, MS, HH), pp. 396–402.
- DAC-1988-MotoharaMUMS #approach #fault #simulation
- An Approach to Fast Hierarchical Fault Simulation (AM, MM, MU, YM, MS), pp. 698–703.
- DAC-1988-TsayKH #algorithm #named
- Proud: A Fast Sea-of-Gates Placement Algorithm (RST, ESK, CPH), pp. 318–323.
- PPEALS-1988-GuptaS #parallel
- Compile-time Techniques for Efficient Utilization of Parallel Memories (RG, MLS), pp. 235–246.
- PPEALS-1988-LiY #analysis #interprocedural #parallel
- Efficient Interprocedural Analysis for Program Parallelization and Restructuring (ZL, PCY), pp. 85–99.
- STOC-1988-Orlin #algorithm
- A Faster Strongly Polynominal Minimum Cost Flow Algorithm (JBO), pp. 377–387.
- STOC-1988-PelegU #trade-off
- A Tradeoff between Space and Efficiency for Routing Tables (DP, EU), pp. 43–52.
- STOC-1988-PintzSS #infinity #testing
- Two Infinite Sets of Primes with Fast Primality Tests (JP, WLS, ES), pp. 504–509.
- CADE-1988-ButlerLO #automaton #compilation #program transformation #prolog
- Notes on Prolog Program Transformations, Prolog Style, and Efficient Compilation to The Warren Abstract Machine (RB, RL, RO), pp. 323–332.
- CADE-1988-McRobbieMT #automation #knowledge-based #logic #proving #standard #theorem proving #towards
- Towards Efficient “Knowledge-Based” Automated Theorem Proving for Non-Standard Logics (MAM, RKM, PBT), pp. 197–217.
- JICSCP-1988-GorlickK88 #analysis #logic programming #named #source code
- Gauge: A Workbench for the Performance Analysis of Logic Programs (MMG, CK), pp. 548–561.
- JICSCP-1988-KurosawaYAB88 #architecture #prolog
- Instruction Architecture for a High Performance Integrated Prolog Processor IPP (KiK, SY, SA, TB), pp. 1506–1530.
- JICSCP-1988-Shintani88 #prolog
- A Fast Prolog-Based Production System KORE/IE (TS), pp. 26–41.
- LICS-1988-KuperMPP #algorithm #anti #parallel
- Efficient Parallel Algorithms for Anti-Unification and Relative Complement (GMK, KM, KVP, KJP), pp. 112–120.
- PODS-1987-GrahneSS #evaluation #query #recursion #set
- Efficient Evaluation for a Subset of Recursive Queries (GG, SS, ESS), pp. 284–293.
- PODS-1987-SunT #concurrent #multi
- Performance Results in Multiversion Timestamp Concurrency Control with Predeclared Writesets (RS, GT), pp. 177–184.
- SIGMOD-1987-Hanson #analysis
- A Performance Analysis of View Materialization Strategies (ENH), pp. 440–453.
- SIGMOD-1987-Hardwick #database #design #optimisation #why
- Why Rose is Fast: Five Optimizations in the Design of an Experimental Database System for CAD/CAM Applications (MH), pp. 292–298.
- VLDB-1987-KumarS #evaluation #operating system #transaction
- Performance Evaluation of an Operating System Transaction Manager (AK, MS), pp. 473–481.
- VLDB-1987-LiRW #database #scalability
- A New Compression Method with Fast Searching on Large Databases (JL, DR, HKTW), pp. 311–318.
- VLDB-1987-NoeW #concurrent
- Measured Performance of Time Interval Concurrency Control Techniques (JDN, DBW), pp. 359–367.
- VLDB-1987-QianS #constraints #validation
- Integrity Constraint Reformulation for Efficient Validation (XQ, DRS), pp. 417–425.
- ICALP-1987-Marchetti-SpaccamelaV #algorithm #online #problem
- Efficient On-Line Algorithms for the Knapsack Problem (AMS, CV), pp. 445–456.
- FPCA-1987-ToynDR #morphism #polymorphism
- Performance polymorphism (IT, AJD, CR), pp. 325–346.
- HCI-SES-1987-Cornell
- Job Performance and QWL in a Data Entry Task (PTC), pp. 59–66.
- HCI-SES-1987-Frese #concept #human-computer #interactive
- A Concept of Control: Implications for Stress and Performance in Human-Computer Interaction (MF), pp. 43–50.
- SIGIR-1987-MukherjeeB #retrieval
- A VLSI Chip for Efficient Transmission and Retrieval of Information (AM, MAB), pp. 208–216.
- SIGIR-1987-OommenM #automaton #clustering #learning #probability #using
- Fast Object Partitioning Using Stochastic Learning Automata (BJO, DCYM), pp. 111–122.
- PLDI-1987-Barklund #prolog #source code
- Efficient interpretation of Prolog programs (JB), pp. 132–137.
- PLDI-1987-Krall #implementation #interpreter #prolog
- Implementation of a high-speed Prolog interpreter (AK), pp. 125–131.
- PLDI-1987-May #named
- Mimic: a fast system/370 simulator (CM), pp. 1–13.
- PLDI-1987-Pittman #execution #hybrid #interpreter
- Two-level hybrid interpreter/native code execution for combined space-time program efficiency (TP), pp. 150–152.
- PLDI-1987-Waters
- Efficient interpretation of synchronizable series expressions (RCW), pp. 74–85.
- POPL-1987-CaiP #design
- Binding Performance at Language Design Time (JC, RP), pp. 85–97.
- ASPLOS-1987-Clark #pipes and filters
- Pipelining and Performance in the VAX 8800 Processor (DWC), pp. 173–177.
- ASPLOS-1987-DavidsonV #complexity #memory management #set
- The Effect of Instruction Set Complexity on Program Size and Memory Performance (JWD, RAV), pp. 60–64.
- ASPLOS-1987-TakiNNI #architecture #evaluation
- Performance and Architectural Evaluation of the PSI Machine (KT, KN, HN, MI), pp. 128–135.
- DAC-1987-BeekmanOI #array #generative
- Mesh Arrays and LOGICIAN: A Tool for Their Efficient Generation (JAB, RMO, MJI), pp. 357–362.
- DAC-1987-DaiSK #layout #representation
- A Dynamic and Efficient Representation of Building-Block Layout (WWMD, MS, ESK), pp. 376–384.
- DAC-1987-Dion
- Fast Printed Circuit Board Routing (JD), pp. 727–734.
- DAC-1987-JonesB #algorithm #parallel #standard
- Performance of a Parallel Algorithm for Standard Cell Placement on the Intel Hypercube (MJ, PB), pp. 807–813.
- DAC-1987-NguyenPG #named
- PALMINI — Fast Boolean Minimizer for Personal Computers (LBN, MAP, NBG), pp. 615–621.
- DAC-1987-Serlet #combinator
- Fast, Small, and Static Combinatorial CMOS Circuits (BS), pp. 451–458.
- DAC-1987-SmithSS #architecture #parallel #simulation
- Faster Architectural Simulation Through Parallelism (JWS, KSS, RJSI), pp. 189–194.
- DAC-1987-SpiersE
- A High Performance Routing Engine (TDS, DAE), pp. 793–799.
- DAC-1987-TanTBVP #self #simulation
- A Fast Signature Simulation Tool for Built-In Self-Testing Circuits (SBT, KT, KB, PV, RP), pp. 17–25.
- DAC-1987-XiongK #named
- Nutcracker: An Efficient and Intelligent Channel Spacer (XMX, ESK), pp. 298–304.
- SOSP-1987-BirrellJW #big data #database #implementation
- A Simple and Efficient Implementation for Small Databases (AB, MBJ, EW), pp. 149–154.
- SOSP-1987-HowardKMNSSW #distributed #file system
- Scale and Performance in a Distributed File System (JHH, MLK, SGM, DAN, MS, RNS, MJW), pp. 1–2.
- SOSP-1987-MogulRA #network
- The Packet Filter: An Efficient Mechanism for User-level Network Code (JCM, RFR, MJA), pp. 39–51.
- SOSP-1987-VargheseL #data type #implementation
- Hashed and Hierarchical Timing Wheels: Data Structures for the Efficient Implementation of a Timer Facility (GV, AL), pp. 25–38.
- CAAP-1987-GambosiNT #representation #taxonomy
- Efficient Representation of Taxonomies (GG, JN, MT), pp. 232–240.
- CFLP-1987-LindstromGY #generative #strict
- Generating Efficient Code from Strictness Annotations (GL, LG, DY), pp. 140–154.
- STOC-1987-NaorNS #algorithm #graph #parallel
- Fast Parallel Algorithms for Chordal Graphs (JN, MN, AAS), pp. 355–364.
- STOC-1987-Vazirani #using
- Efficiency Considerations in Using Semi-random Sources (UVV), pp. 160–168.
- ICLP-1987-Ebcioglu87 #logic programming #music #programming language
- An Efficient Logic Programming Language and Its Application to Music (KE), pp. 513–532.
- ICLP-1987-LindholmO87 #implementation #prolog #semantics
- Efficient Implementation of a Defensible Semantics for Dynamic PROLOG Code (TGL, RAO), pp. 21–39.
- ICLP-1987-MulderT87 #comparison #prolog
- A Performance Comparison between PLM and a M68020 PROLOG Processor (HM, ET), pp. 59–73.
- SLP-1987-HausmanCH87 #memory management #multi #prolog
- OR-Parallel Prolog Made Efficient on Shared Memory Multiprocessors (BH, AC, SH), pp. 69–79.
- SLP-1987-Wallace87 #constraints #database #deduction #implementation
- Negation by Constraints: A Sound and Efficient Implementation of Negation in Deductive Databases (MW), pp. 253–263.
- PODS-1986-OlkenR
- Rearranging Data to Maximize the Efficiency of Compression (FO, DR), pp. 78–90.
- SIGMOD-1986-AhnS #database #evaluation
- Performance Evaluation of a Temporal Database Management System (IA, RTS), pp. 96–107.
- SIGMOD-1986-Boral #database #metric
- Database System Performance Measurement (HB), pp. 153–154.
- SIGMOD-1986-MackertL #evaluation #query #validation
- R* Optimizer Validation and Performance Evaluation for Local Queries (LFM, GML), pp. 84–95.
- VLDB-1986-DeWittGGHKM #data flow #database #named
- GAMMA — A High Performance Dataflow Database Machine (DJD, RHG, GG, MLH, KBK, MM), pp. 228–237.
- VLDB-1986-Hagmann #database #metric
- An Observation on Database Buffering Performance Metrics (RBH), pp. 289–293.
- VLDB-1986-MackertL #distributed #evaluation #query #validation
- R* Optimizer Validation and Performance Evaluation for Distributed Queries (LFM, GML), pp. 149–159.
- VLDB-1986-Seki #database #distributed #network
- New Seat Reservation System for Japanese National Railways — Distributed Processing Network and High Efficiency Databases (ES), pp. 502–510.
- ICALP-1986-Schnorr #algorithm #reduction
- A More Efficient Algorithm for Lattice Basis Reduction (CPS), pp. 359–369.
- ICALP-1986-SpirakisT #algorithm
- A Very Fast, Practical Algorithm for Finding a Negative Cycle in a Digraph (PGS, AKT), pp. 397–406.
- LFP-1986-LemaitreCDDL #combinator #multi #reduction
- Mechanisms for Efficient Multiprocessor Combinator Reduction (ML, MC, MHD, GD, BL), pp. 113–121.
- LFP-1986-White #case study #configuration management #lisp
- Reconfigurable, Retargetable Bignums: A Case Study in Efficient, Portable Lisp System Building (JLW), pp. 174–191.
- GG-1986-MontanariR #algorithm #constraints #network
- An Efficient Algorithm for the Solution of Hierarchical Networks of Constraints (UM, FR), pp. 440–457.
- SIGIR-1986-Bookstein #documentation #self
- Performance of Self-Taught Documents: Exploiting Co-Relevance Structure in a Document Collection (AB), pp. 244–248.
- SIGIR-1986-LoseeBY #comparison #database #documentation #modelling #probability #retrieval
- Probabilistic Models for Document Retrieval: A Comparison of Performance on Experimental and Synthetic Databases (RML, AB, CTY), pp. 258–264.
- SIGIR-1986-Voorhees #clustering
- The Efficiency of Inverted Index and Cluster Searches (EMV), pp. 164–174.
- OOPSLA-1986-LewisGFT #named
- Swamp: A Fast Processor for Smalltalk-80 (DML, DRG, RJF, BWT), pp. 131–139.
- Best-of-PLDI-1986-MuchnickG #architecture #pipes and filters #scheduling
- Efficient instruction scheduling for a pipelined architecture (with retrospective) (SSM, PBG), pp. 167–174.
- DAC-1986-BarzilaiBHIS #analysis #fault #named #verification
- SLS — a fast switch level simulator for verification and fault coverage analysis (ZB, DKB, LMH, VSI, GMS), pp. 164–170.
- DAC-1986-JacobNP #analysis #empirical #multi
- An empirical analysis of the performance of a multiprocessor-based circuit simulator (GKJ, ARN, DOP), pp. 588–593.
- DAC-1986-KuoF #array #configuration management
- Efficient spare allocation in reconfigurable arrays (SYK, WKF), pp. 385–390.
- DAC-1986-NaharS
- A time and space efficient net extractor (SN, SS), pp. 411–417.
- DAC-1986-OgawaISTKYC #algorithm #optimisation
- Efficient placement algorithms optimizing delay for high-speed ECL masterslice LSIs (YO, TI, YS, HT, TK, KY, KC), pp. 404–410.
- DAC-1986-TadaH #scalability
- Router system for printed wiring boards of very high-speed, very large-scale computers (TT, AH), pp. 791–797.
- STOC-1986-Ben-OrFKT #algorithm #parallel #polynomial
- A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots (MBO, EF, DK, PT), pp. 340–349.
- STOC-1986-CoffmanL #algorithm
- A Provably Efficient Algorithm for Dynamic Storage Allocation (EGCJ, FTL), pp. 77–90.
- STOC-1986-KapoorV #algorithm #multi #polynomial #programming
- Fast Algorithms for Convex Quadratic Programming and Multicommodity Flows (SK, PMV), pp. 147–159.
- STOC-1986-KarlinU #implementation #memory management #parallel
- Parallel Hashing-An Efficient Implementation of Shared Memory (ARK, EU), pp. 160–168.
- STOC-1986-LandauV #algorithm #approximate #parallel #string
- Introducing Efficient Parallelism into Approximate String Matching and a New Serial Algorithm (GML, UV), pp. 220–230.
- STOC-1986-Mulmuley #algorithm #matrix #parallel #rank
- A Fast Parallel Algorithm to Compute the Rank of a Matrix over an Arbitrary Field (KM), pp. 338–339.
- ICLP-1986-BowenBCT86 #compilation #design #implementation #incremental #prolog
- The Design and Implementation of a High-Speed Incremental Portable Prolog Compiler (KAB, KAB, IC, AKT), pp. 650–656.
- ICLP-1986-Buettner86 #decompiler #prolog
- Fast Decompilation of Compiled Prolog Clauses (KAB), pp. 663–670.
- ICLP-1986-HermenegildoN86 #backtracking
- Efficient Management of Backtracking in AND-Parallelism (MVH, RIN), pp. 40–54.
- ICLP-1986-Tick86 #lisp #memory management #prolog #source code
- Memory Performance of Lisp and Prolog Programs (ET), pp. 642–649.
- LICS-1986-EmersonL #calculus #model checking #μ-calculus
- Efficient Model Checking in Fragments of the Propositional μ-Calculus (EAE, CLL), pp. 267–278.
- SLP-1986-CiepielewskiH86 #evaluation #execution #logic programming #source code
- Performance Evaluation of a Storage Model for OR--Parallel Execution of Logic Programs (AC, BH), pp. 246–257.
- PODS-1985-AbbadiSC #data transformation #fault tolerance #protocol
- An Efficient, Fault-Tolerant Protocol for Replicated Data Management (AEA, DS, FC), pp. 215–229.
- PODS-1985-AtzeniC #approach #query
- Efficient Query Answering in the Representative Instance Approach (PA, EPFC), pp. 181–188.
- SIGMOD-1985-AgrawalCL #concurrent #modelling
- Models for Studying Concurrency Control Performance: Alternatives and Implications (RA, MJC, ML), pp. 108–121.
- SIGMOD-1985-Faloutsos #comparison #design
- Signature files: Design and Performance Comparison of Some Signature Extraction Methods (CF), pp. 63–82.
- SIGMOD-1985-FushimiKNTM #adaptation #algorithm #clustering #evaluation #multi
- Algorithm and Performance Evaluation of Adaptive Multidimensional Clustering Technique (SF, MK, MN, HT, TMO), pp. 308–318.
- SIGMOD-1985-Gray #database #prolog
- Efficient Prolog Access to CODASYL and FDM Databases (PMDG), pp. 437–443.
- SIGMOD-1985-Robinson #hardware
- A Fast General-Purpose Hardware Synchronisation Mechanism (JTR), pp. 122–130.
- VLDB-1985-Furman #database #implementation #relational
- An Efficient Implementation of a Relational Data Base (MSF), pp. 181–191.
- VLDB-1985-GoldSH
- The Private Workspace Model Feasibility and Applications to 2PL Performance Improvements (IG, OS, MH), pp. 192–208.
- VLDB-1985-Kiessling #correlation #on the #query #semantics
- On Semantic Reefs and Efficient Processing of Correlation Queries with Aggregates (WK), pp. 241–250.
- VLDB-1985-LeungW
- File Processing Efficiency on the Content Addressable File Store (CHCL, KSW), pp. 282–291.
- ICALP-1985-Fortune #algorithm
- A Fast Algorithm for Polygon Containment by Translation (SF), pp. 189–198.
- ICALP-1985-GabowS #algorithm
- Efficient Algorithms for Graphic Matroid Intersection and Parity (HNG, MFMS), pp. 210–220.
- ICALP-1985-SippuS #algorithm #design #on the #relational #using
- On the Use of Relational Expressions in the Design of Efficient Algorithms (SS, ESS), pp. 456–464.
- RTA-1985-PurdomB #algorithm
- Fast Many-to-One Matching Algorithms (PWPJ, CAB), pp. 407–416.
- FPCA-1985-Kieburtz85
- The G-Machine: A Fast, Graph-Reduction Evaluator (RBK), pp. 400–413.
- FPCA-1985-Plaisted85 #architecture #data flow
- An Architecture for fast Data Movement in the FFP Machine (DAP), pp. 147–163.
- SIGIR-1985-ArnowTW #multi #named
- P-Trees: Storage Efficient Multiway Trees (DMA, AMT, CW), pp. 111–121.
- SIGIR-1985-ChouekaKP
- Efficient Variants of Huffman Codes in High Level Languages (YC, STK, YP), pp. 122–130.
- POPL-1985-AhoG #code generation #pattern matching
- Efficient Tree Pattern Matching: An Aid to Code Generation (AVA, MG), pp. 334–340.
- ICSE-1985-DeMarcoL
- Programmer Performance and the Effects of the Workplace (TD, TL), pp. 268–272.
- DAC-1985-BryantS #concurrent #evaluation #fault
- Performance evaluation of FMOSSIM, a concurrent switch-level fault simulator (REB, MDS), pp. 715–719.
- DAC-1985-HahnF #music #named #simulation
- MuSiC: an event-flow computer for fast simulation of digital systems (WH, KF), pp. 338–344.
- DAC-1985-Lemaire #design #named #process #prototype #testing
- GAMMA: a fast prototype design, build, and test process (LTL), pp. 773–776.
- DAC-1985-RoseBT #analysis #design #probability #tool support
- Integrating stochastic performance analysis with system design tools (CWR, MB, YT), pp. 482–488.
- DAC-1985-TygarE #comparison #using
- Efficient netlist comparison using hierarchy and randomization (JDT, RE), pp. 702–708.
- CAAP-1985-Chazelle #algebra #complexity #geometry
- Fast Searching in a Real Algebraic Manifold with Applications to Geometric Complexity (BC), pp. 145–156.
- STOC-1985-Heide #algorithm #problem #strict
- Fast Algorithms for N-Dimensional Restrictions of Hard Problems (FMadH), pp. 413–420.
- STOC-1985-PanR #linear #parallel
- Efficient Parallel Solution of Linear Systems (VYP, JHR), pp. 143–152.
- PODS-1984-TaySG #database
- A Mean Value Performance Model for Locking in Databases: The Waiting Case (YCT, RS, NG), pp. 311–322.
- SIGMOD-1984-BaruS #evaluation #statistics
- Performance Evaluation of the Statistical Aggregation by Caterogization in the SM3 System (CKB, SYWS), pp. 77–89.
- SIGMOD-1984-BoralD #database #evaluation
- A Methodology for Database System Performance Evaluation (HB, DJD), pp. 176–185.
- SIGMOD-1984-Kriegel #comparison #multi #retrieval
- Performance Comparison of Index Structures for Multi-Key Retrieval (HPK), pp. 186–196.
- SIGMOD-1984-Willard #calculus #query #relational #using
- Efficient Processing of Relational Calculus Expressions Using Range Query Theory (DEW), pp. 164–175.
- VLDB-1984-CareyS #algorithm #concurrent #database
- The Performance of Concurrency Control Algorithms for Database Management Systems (MJC, MS), pp. 107–118.
- VLDB-1984-TayS #database
- Choice and Performance in Locking for Databases (YCT, RS), pp. 119–128.
- ICALP-1984-IbarraKR #simulation #strict
- Space and Time Efficient Simulations and Characterizations of Some Restricted Classes of PDAs (OHI, SMK, LER), pp. 247–259.
- ICALP-1984-Jung #complexity #matrix #on the #probability #problem
- On Probabilistic Tape Complexity and Fast Circuits for Matrix Inversion Problems (HJ), pp. 281–291.
- ICALP-1984-Lagarias #analysis
- Performance Analysis of Shamir’s Attack on the Basic Merkle-Hellman Knapsack Cryptosystem (JCL), pp. 312–323.
- LFP-1984-ChaillouxDH #lisp
- LE LISP, a Portable and Efficient LISP System (JC, MD, JMH), pp. 113–122.
- LFP-1984-Pettorossi #source code
- A Powerful Strategy for Deriving Efficient Programs by Transformation (AP), pp. 273–281.
- LFP-1984-Saint-James #recursion
- Recursion is More Efficient than Iteration (ESJ), pp. 228–234.
- POPL-1984-DeutschS #implementation
- Efficient Implementation of the Smalltalk-80 System (LPD, AMS), pp. 297–302.
- POPL-1984-Myers #data type
- Efficient Applicative Data Types (EWM), pp. 66–75.
- POPL-1984-SuzukiT #object-oriented
- Creating Efficient Systems for Object-Oriented Languages (NS, MT), pp. 290–296.
- SCC-1984-Blower #ada #implementation
- An efficient implementation of visibility in Ada (MIB), pp. 259–265.
- SCC-1984-CooperK #interprocedural #summary
- Efficient computation of flow insensitive interprocedural summary information (KDC, KK), pp. 247–258.
- SCC-1984-Johnsson #compilation #evaluation #lazy evaluation
- Efficient compilation of lazy evaluation (TJ), pp. 58–69.
- SCC-1984-Robbins #compilation #pascal
- Engineering a high-capacity Pascal compiler for high performance (DCR), pp. 300–309.
- Best-of-PLDI-1984-Johnsson #compilation #evaluation #lazy evaluation
- Efficient compilation of lazy evaluation (with retrospective) (TJ), pp. 125–138.
- DAC-1984-MarW #verification
- Performance verification of circuits (JM, YPW), pp. 479–483.
- DAC-1984-Palczewski #algorithm
- Performance of algorithms for initial placement (MP), pp. 399–404.
- DAC-1984-Ross #design #implementation
- Efficient implementation of experimental design systems (GDMR), p. 109.
- DAC-1984-Yoshimura
- An efficient channel router (TY), pp. 38–44.
- STOC-1984-Awerbuch #network #protocol
- An Efficient Network Synchronization Protocol (BA), pp. 522–525.
- STOC-1984-BroderDFS #fault tolerance #network
- Efficient Fault Tolerant Routings in Networks (AZB, DD, MJF, BS), pp. 536–541.
- STOC-1984-Clarkson #algorithm #approximate #geometry
- Fast Expected-Time and Approximation Algorithms for Geometric Minimum Spanning Trees (KLC), pp. 342–348.
- STOC-1984-KarpW #algorithm #independence #parallel #problem #set
- A Fast Parallel Algorithm for the Maximal Independent Set Problem (RMK, AW), pp. 266–272.
- STOC-1984-OngSS #equation #polynomial
- An Efficient Signature Scheme Based on Quadratic Equations (HO, CPS, AS), pp. 208–216.
- STOC-1984-SleatorT
- Amortized Efficiency of List Update Rules (DDS, RET), pp. 488–492.
- STOC-1984-SlotB #on the
- On Tape Versus Core; An Application of Space Efficient Perfect Hash Functions to the Invariance of Space (CFS, PvEB), pp. 391–400.
- ILPC-1984-Plaisted84 #algorithm #debugging
- An Efficient Bug Location Algorithm (DAP), pp. 151–157.
- SLP-1984-Warren84 #flexibility #memory management #prolog
- Efficient Prolog Memory Management for Flexible Control Strategies (DSW), pp. 198–202.
- PODS-1983-Gonnet #database #semistructured data
- Unstructured Data Bases or Very Efficient Text Searching (GHG), pp. 117–124.
- PODS-1983-GoodmanST #database
- A Simple Analytic Model for Performance of Exclusive Locking in Database Systems (NG, RS, YCT), pp. 203–215.
- SIGMOD-1983-JarkeK #quantifier #query
- Range Nesting: A Fast Method to Evaluate Quantified Queries (MJ, JK), pp. 196–206.
- SIGMOD-1983-Lomet
- A High Performance, Universal, Key Associative Access Method (DBL), pp. 120–133.
- ICALP-1983-LangSSS #algorithm #sorting
- A Fast Sorting Algorithm for VLSI (HWL, MS, HS, HS), pp. 408–419.
- POPL-1983-BackMR #algorithm #graph
- Derivation of Efficient DAG Marking Algorithms (RJB, HM, KJR), pp. 20–27.
- DAC-1983-BenmehrezM #implementation
- Measured performance of a programmed implementation of the subscripted D-Algorithm (CB, JFM), pp. 308–315.
- DAC-1983-GranackiP #design #trade-off
- The effect of register-transfer design tradeoffs on chip area and performance (JJG, ACP), pp. 419–424.
- DAC-1983-SzymanskiW #algorithm #analysis
- Space efficient algorithms for VLSI artwork analysis (TGS, CJVW), pp. 734–739.
- SOSP-1983-CheritonZ #distributed #kernel
- The Distributed V Kernel and its Performance for Diskless Workstations (DRC, WZ), pp. 129–140.
- SOSP-1983-Stephenson
- Fast Fits (CJS), pp. 30–32.
- STOC-1983-Gabow #network #problem #reduction
- An Efficient Reduction Technique for Degree-Constrained Subgraph and Bidirected Network Flow Problems (HNG), pp. 448–456.
- PODS-1982-MenasceN #commit #evaluation #protocol
- Performance Evaluation of a Two-Phase Commit Based Protocol for DDBS (DAM, TN), pp. 247–255.
- SIGMOD-1982-BernsteinB #calculus #quantifier #relational #testing
- Fast Methods for Testing Quantified Relational Calculus Assertions (PAB, BTB), pp. 39–50.
- SIGMOD-1982-Tamminen #database
- Efficient Spatial Access to a Data Base (MT), pp. 200–206.
- VLDB-1982-KedemMS #concurrent #protocol
- An Efficient Deadlock Removal Scheme for Non-Two-Phase Locking Protocols (ZMK, CM, AS), pp. 91–97.
- ICALP-1982-DobkinK #detection
- Fast Detection of Polyhedral Intersections (DPD, DGK), pp. 154–165.
- ICALP-1982-Vitanyi #multi #simulation
- Efficient Simulations of Multicounter Machines (PMBV), pp. 546–560.
- LFP-1982-GabrielM #lisp
- Performance of Lisp Systems (RPG, LM), pp. 123–142.
- GG-1982-Staples #evaluation #representation
- Two-level expression representation for faster evaluation (JS), pp. 392–404.
- SCC-1982-RudmikM #compilation #scalability #source code
- An Efficient Separate Compilation Strategy for Very Large Programs (AR, BGM), pp. 301–307.
- ASPLOS-1982-HennessyJBGG #hardware #trade-off
- Hardware/Software Tradeoffs for Increased Performance (JLH, NPJ, FB, TRG, JG), pp. 2–11.
- ASPLOS-1982-Lampson
- Fast Procedure Calls (BWL), pp. 66–76.
- ASPLOS-1982-RauGG #architecture #generative
- Architectural Support for the Efficient Generation of Code for Horizontal Architectures (BRR, CDG, EMG), pp. 96–99.
- DAC-1982-Korn
- An efficient variable-cost maze router (RKK), pp. 425–431.
- DAC-1982-TamminenS #data access #geometry
- The excell method for efficient geometric access to data (MT, RS), pp. 345–351.
- STOC-1982-Bach #algorithm
- Fast Algorithms under the Extended Riemann Hypothesis: A Concrete Estimate (EB), pp. 290–295.
- CADE-1982-MatwinP #backtracking #data type #exponential #implementation
- Exponential Improvement of Efficient Backtracking: data Structure and Implementation (SM, TP), pp. 240–259.
- CADE-1982-PietrzykowskiM #backtracking #deduction #exponential
- Exponential Improvement of Efficient Backtracking: A Strategy for Plan-Based Deduction (TP, SM), pp. 223–239.
- SIGMOD-1981-Batory #comparison
- B+ Trees and Indexed Sequential Files: A Performance Comparison (DSB), pp. 30–39.
- SIGMOD-1981-Lin #concurrent #database #distributed #evaluation
- Performance Evaluation of Two Concurrency Control Mechanisms in a Distributed Database System (WTKL), pp. 84–92.
- VLDB-1981-DeWittH #architecture #database #evaluation
- A Performance Evaluation of Data Base Machine Architectures (DJD, PBH), pp. 199–214.
- VLDB-1981-Sevcik #database #predict #using
- Data Base System Performance Prediction Using an Analytical Model (KCS), pp. 182–198.
- VLDB-1981-Warren #database #interactive #logic #query #relational
- Efficient Processing of Interactive Relational Data Base Queries expressed in Logic (DHDW), pp. 272–281.
- SIGIR-1981-BuellK #fuzzy #metric #retrieval
- Performance Measurement in a Fuzzy Retrieval Environment (DAB, DHK), pp. 56–62.
- DAC-1981-DeesS
- Performance of interconnection rip-up and reroute strategies (WADJ, RJSI), pp. 382–390.
- DAC-1981-Montoye
- Area-time efficient addition in charge based technology (RKM), pp. 862–872.
- DAC-1981-Wilmore
- Efficient Boolean operations on IC masks (JAW), pp. 571–579.
- STOC-1981-ArjomandiFL #difference
- A Difference in Efficiency between Synchronous and Asynchronous Systems (EA, MJF, NAL), pp. 128–132.
- STOC-1981-GalilP #parallel
- An Efficient General Purpose Parallel Computer (ZG, WJP), pp. 247–262.
- STOC-1981-JosephY #modelling #polynomial #source code
- Fast Programs for Initial Segments and Polynomial Time Computation in Weak Models of Arithmetic (DJ, PY), pp. 55–61.
- VLDB-1980-Badal #analysis #concurrent #database #distributed
- The Analysis of the Effects of Concurrency Control on Distributed Database System Performance (DZB), pp. 376–383.
- VLDB-1980-BernsteinBC #maintenance #semantics #using
- Fast Maintenance of Semantic Integrity Assertions Using Redundant Aggregate Data (PAB, BTB, EMC), pp. 126–136.
- VLDB-1980-EggersS
- Efficient Access of Compressed Data (SJE, AS), pp. 205–211.
- ICALP-1980-Reischuk #implementation #multi
- A “Fast Implementation” of a Multidimensional Storage into a Tree Storage (RR), pp. 531–542.
- LISP-1980-McDermott #interpreter #lisp
- An Efficient Environment Allocation Scheme in an Interpreter for a Lexically-Scoped LISP (DVM), pp. 154–162.
- SIGIR-1980-NoreaultMK #documentation #evaluation #metric #similarity
- A Performance Evaluation of Similarity Measures, Document Term Weighting Schemes and Representations in a Boolean Environment (TN, MM, MBK), pp. 57–76.
- POPL-1980-HuntR #algorithm #similarity
- Efficient Algorithms for Structural Similarity of Grammars (HBHI, DJR), pp. 213–219.
- SOSP-J-1979-CanonFHHMR80 #evaluation #virtual machine
- A Virtual Machine Emulator for Performance Evaluation (MDC, DHF, JHH, TDH, MFM, JRR), pp. 71–80.
- DAC-1980-ShiraishiH #slicing
- Efficient placement and routing techniques for master slice LSI (HS, FH), pp. 458–464.
- DAC-1980-SmithSP #component #named
- Comet — a fast component placer (VKS, RJSI, PAP), pp. 465–471.
- DAC-1980-TadaYKS #strict #using
- A fast maze router with iterative use of variable search space restriction (FT, KY, TK, TS), pp. 250–254.
- DAC-1980-Ulrich #flexibility #logic #simulation
- Table lookup techniques for fast and flexible digital logic simulation (EU), pp. 560–563.
- DAC-1980-UlrichLPTKEB #concurrent #fault #simulation
- High-speed concurrent fault simulation with vectors and scalars (EU, DL, NP, JT, MK, TE, RB), pp. 374–380.
- DAC-1980-WesteA #design
- An IC design station needs a high performance color graphic display (NW, BDA), pp. 285–291.
- STOC-1980-Lynch #distributed
- Fast Allocation of Nearby Resources in a Distributed System (NAL), pp. 70–81.
- STOC-1980-Yao #programming #using
- Efficient Dynamic Programming Using Quadrangle Inequalities (FFY), pp. 429–435.
- SIGMOD-1979-BadalP #analysis #semantics #validation
- Cost and Performance Analysis of Semantic Integrity Validation Methods (DZB, GJP), pp. 109–115.
- SIGMOD-1979-HawthornS #analysis #database #relational
- Performance Analysis of a Relational Data Base Management System (PBH, MS), pp. 1–12.
- SIGMOD-1979-YuLSO #analysis #problem
- Performance Analysis of three Related Assignment Problems (CTY, KL, MKS, ZMÖ), pp. 82–92.
- VLDB-1979-Svensson #on the #order #query
- On Search Performance for Conjunctive Queries in Compressed, Fully Transposed Ordered Files (PS), pp. 155–163.
- ICALP-1979-Commentz-Walter #algorithm #string
- A String Matching Algorithm Fast on the Average (BCW), pp. 118–132.
- POPL-1979-Banning #alias
- An Efficient Way to Find Side Effects of Procedure Calls and Aliases of Variables (JB), pp. 29–41.
- SCC-1979-DeRemerP #lalr #set
- Efficient computation of LALR(1) look-ahead sets (FD, TJP), pp. 176–187.
- SCC-1979-RudmikL #code generation #compilation #design #optimisation
- Compiler design for efficient code generation and program optimization (AR, ESL), pp. 127–138.
- Best-of-PLDI-1979-PennelloD #lalr #set
- Efficient computation of LALR(1) look-ahead sets (with retrospective) (TJP, FD), pp. 14–27.
- ICSE-1979-CurtisSM #complexity #metric #predict #replication
- Third Time Charm: Stronger Replication of the Ability of Software Complexity Metrics to Predict Programmer Performance (BC, SBS, PM), pp. 356–360.
- DAC-1979-El-Ziq #fault #generative #network #simulation #testing
- Testing of MOS combinational networks a procedure for efficient fault simulation and test generation (YMEZ), pp. 162–170.
- DAC-1979-Meyer #interactive #low cost
- A low cost satellite for fast interactive graphics in a time-sharing environment (BM), pp. 39–44.
- DAC-1979-NavabiH #simulation
- Efficient simulation of AHPL (ZN, FJH), pp. 255–262.
- DAC-1979-ONeillSTFFWMBE #design
- Designers Workbench — efficient and economical design aids (LAO, CGS, TJT, JMF, RAF, EDW, PHM, JRB, DSE), pp. 185–199.
- DAC-1979-Wilmore #database #design #interactive #layout
- The design of an efficient data base to support an interactive LSI layout system (JAW), pp. 445–451.
- SOSP-1979-CanonFHHMR #evaluation #virtual machine
- A Virtual Machine Emulator for Performance Evaluation (MDC, DHF, JHH, TDH, MFM, JRR), p. 1.
- STOC-1979-Kosaraju79a #algorithm #array #graph #parallel #problem
- Fast Parallel Processing Array Algorithms for some Graph Problems (SRK), pp. 231–236.
- SIGMOD-1978-AhoSU #optimisation #relational
- Efficient Optimization of a Class of Relational Expressions (AVA, YS, JDU), p. 39.
- SIGMOD-1978-HammerS #database #monitoring
- Efficient Monitoring of Database Assertions (MH, SKS), p. 159.
- VLDB-1978-BanerjeeH #database #relational
- Performance Study of a Database Machine in Supporting Relational Databases (JB, DKH), pp. 319–329.
- VLDB-1978-ChenLT #bound #scalability
- The Rebound Sorter: An Efficient Sort Engine for Large Files (TCC, VYL, CT), pp. 312–318.
- VLDB-1978-Stocker
- Efficient Organization of Internal DBMS Structure (PMS), p. 136.
- ICALP-1978-Saarinen #attribute grammar #on the
- On Constructing Efficient Evaluators for Attribute Grammars (MS), pp. 382–397.
- SIGIR-1978-Williams #documentation #feedback #question #retrieval
- Does Relevance Feedback Improve Document Retrieval Performance? (RLW), pp. 151–170.
- POPL-1978-NelsonO #algorithm
- A Simplifier Based on Efficient Decision Algorithms (CGN, DCO), pp. 141–150.
- POPL-1978-PrabhalaS
- Efficient Computation of Expressions with Common Subexpressions (BP, RS), pp. 222–230.
- ICSE-1978-BrowneJ #generative #named #program analysis
- FAST: A Second Generation Program Analysis System (JCB, DBJ), pp. 142–148.
- DAC-1978-KoppelSP #logic
- A high performance delay calculation software system for MOSFET digital logic chips (AK, SS, PP), pp. 405–417.
- DAC-1978-Soukup
- Fast maze router (JS), pp. 100–102.
- DAC-1978-Wold #analysis #design #verification
- Design verification and performance analysis (MAW), pp. 264–270.
- STOC-1978-Filotti #algorithm #graph #polynomial
- An Efficient Algorithm for Determining Whether a Cubic Graph is Toroidal (ISF), pp. 133–142.
- SIGMOD-1977-LochovskyT
- User Performance Considerations in DBMS Selection (FHL, DT), pp. 128–134.
- VLDB-1977-ChenY #database #design #tool support
- Design and Performance Tools for Data Base Systems (PPC, SBY), pp. 3–15.
- VLDB-1977-Eastlake #memory management
- Tertiary Memory Access and Performance in the Datacomputer (DEEI), pp. 259–268.
- VLDB-1977-HultenS #analysis #database #scalability #simulation
- A Simulation Model for Performance Analysis of Large Shared Data Bases (CH, LS), pp. 524–532.
- POPL-1977-FischerMQ #ll #parsing
- An Efficient Insertion-Only Error-Corrector for LL(1) Parsers (CNF, DRM, SBQ), pp. 97–103.
- POPL-1977-Pratt #programming
- The Competence/Performance Dichotomy in Programming (VRP), pp. 194–200.
- DAC-1977-Baird #algorithm #analysis
- Fast algorithms for LSI artwork analysis (HSB), pp. 303–311.
- DAC-1977-SchulerC #fault #simulation
- An efficient method of fault simulation for digital circuits modeled from boolean gates and memories (DMS, RKC), pp. 230–238.
- DAC-1977-ThomasS #automation #design #verification
- Measuring designer performance to verify design automation systems (DET, DPS), pp. 411–418.
- STOC-1977-AngluinV #algorithm #probability
- Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings (DA, LGV), pp. 30–41.
- STOC-1977-LynchB #programming
- Efficient Reducibility Between Programming Systems: Preliminary Report (NAL, EKB), pp. 228–238.
- SIGMOD-1976-Pecherer
- Efficient Exploration of Product Spaces (RMP), pp. 169–177.
- SIGMOD-1976-ShermanB #database #memory management
- Performance of a Data Base Manager in a Virtual Memory System (SWS, RSB), p. 31.
- VLDB-1976-McGregorTD #database #hardware
- High Performance Hardware for Database Systems (DRM, RGT, WND), pp. 103–116.
- VLDB-1976-Tompa
- Choosing an Efficient Internal Schema (FWT), pp. 65–77.
- POPL-1976-KennedyW #attribute grammar #automation #generative
- Automatic Generation of Efficient Evaluators for Attribute Grammars (KK, SKW), pp. 32–49.
- ICSE-1976-BalkovichE #requirements #research #specification #towards
- Research Towards a technology to Support the Specification of Data Processing System Performance Requirements (EEB, GPE), pp. 110–115.
- ICSE-1976-BarstowK #interactive #synthesis
- Observations on the Interaction Between Coding and Efficiency Knowledge in the PSI Program Synthesis System (DRB, EK), pp. 19–31.
- ICSE-1976-Browne #evaluation #overview
- A Critical Overview of Computer Performance Evaluation (JCB), pp. 138–145.
- ICSE-1976-FerrariL #empirical
- An Experiment in Program Restructuring for Performance Enhancement (DF, EJL), pp. 146–150.
- SIGMOD-1975-SmithC #algebra #database #interface #optimisation #relational
- Optimizing the Performance of a Relational Algebra Data Base Interface (JMS, PYTC), p. 64.
- VLDB-1975-Manacher #database #implementation #on the #relational #scalability
- On the Feasibility of Implementing a Large Relational Data Base with Optimal Performance on a Mini-Computer (GKM), pp. 175–201.
- VLDB-1975-Miyamoto #analysis #database #modelling
- Hierarchical Performance Analysis Models for Data Base Systems (IM), pp. 322–352.
- VLDB-1975-Todd #database #implementation #named #relational #scalability
- PRTV: An Efficient Implementation for Large Relational Data Bases (ST), pp. 554–556.
- POPL-1975-GrahamW #algorithm #analysis #linear
- A Fast and Usually Linear Algorithm for Global Flow Analysis (SLG, MNW), pp. 22–34.
- DAC-1975-Losleben #design
- Computer aided LSI circuit design: A relationship between topology and performance (PL), pp. 102–104.
- SOSP-1975-Sadeh #algorithm #analysis #fault
- An Analysis of the Performance of the Page Fault Frequency (PFF) Replacement Algorithm (ES), pp. 6–13.
- ICALP-1974-Dezani-CiancagliniZ #algorithm #parallel
- Application of Church-Rosser Properties to Increase the Parallelism and Efficiency of Algorithms (MDC, MZ), pp. 170–184.
- ICALP-1974-FischerP #algorithm #matrix #using
- Efficient Procedures for Using Matrix Algorithms (PCF, RLP), pp. 413–427.
- ICALP-1974-Lang #nondeterminism #parsing
- Deterministic Techniques for Efficient Non-Deterministic Parsers (BL), pp. 255–269.
- DAC-1974-DruffelSW #automation #design
- A simple, efficient design automation processor (LED, DCS, RAW), pp. 127–136.
- DAC-1974-Kjelkerud #generative #source code #testing
- A system of computer programs for efficient test generation for combinational switching circuits (EK), pp. 166–168.
- DAC-1974-Sr #simulation #using
- Using simulation to evaluate system performance (EKBS), pp. 359–365.
- STOC-1974-Horvath #sorting
- Efficient Stable Sorting with Minimal Extra Space (ECH), pp. 194–215.
- STOC-1974-HyafilPV #algorithm
- An Efficient Algorithm for Computing Optimal Desk Merge Patterns (LH, FP, JV), pp. 216–229.
- SOSP-1973-Svobodova #hybrid #metric #monitoring #online
- Online System Performance Measurements with Software and Hybrid Monitors (LS), pp. 45–53.
- STOC-1973-FischerS #integer #multi #online
- Fast On-Line Integer Multiplication (MJF, LJS), pp. 67–72.
- STOC-1973-Moenck
- Fast Computation of GCDs (RTM), pp. 142–151.
- SIGFIDET-1972-Stonebraker #retrieval #using
- Retrieval Efficiency Using Combined Indexes (MS), pp. 243–256.
- STOC-1972-Fiduccia #algorithm #evaluation #fourier #polynomial #revisited
- Polynomial Evaluation via the Division Algorithm: The Fast Fourier Transform Revisited (CMF), pp. 88–93.
- STOC-1972-Kung #bound #multi
- A Bound on the Multiplication Efficiency of Iteration (HTK), pp. 102–107.
- SIGFIDET-1971-Nijssen #random
- Efficient Batch Updating of a Random File (GMN), pp. 173–186.
- SIGIR-1971-Katcher
- Efficient Utilization of Limited Access Archival Storage in a Time Shared Environment (AMK), pp. 197–205.
- STOC-1971-Fiduccia #matrix #multi
- Fast Matrix Multiplication (CMF), pp. 45–49.
- STOC-1971-Munro #algorithm
- Some Results Concerning Efficient and Optimal Algorithms (JIM), pp. 40–44.
- SOSP-1969-ArdenB #metric #multi
- Measurement and performance of a multiprogramming system (BA, DB), pp. 130–146.
- SOSP-1969-BryanS #analysis
- The UTS time-sharing system: performance analysis and instrumentation (GEB, JES), pp. 147–158.
- SOSP-1969-Karush
- Two approaches for measuring the performance of time-sharing systems (ADK), pp. 159–166.
- SOSP-1969-Wulf #monitoring #multi
- Performance monitors for multi-programming systems (WAW), pp. 175–181.
- STOC-1969-Korenjak #lr
- Efficient LR(1) Processor Construction (AJK), pp. 191–200.
- DAC-1968-CharneyP #clustering #component
- Efficient partitioning of components (HRC, DLP).
