BibSLEIGH — fast stem

Used together with:

algorithm (183)
base (143)
use (132)
method (80)
model (79)

Stem fast$ (all stems)

1282 papers:

CASE-2015-HolmOFUHAK #evolution #industrial #integration #performance #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-LiuC #algorithm #evaluation #performance #quality #using: A fast algorithm for grasp quality evaluation using the object wrench space (SL, SC), pp. 558–563.
DAC-2015-MilutinovicQAC #estimation #named #performance: PACO: fast average-performance estimation for time-randomized caches (SM, EQ, JA, FJC), p. 6.
DAC-2015-PapamichaelMH #algorithm #automation #design #named #performance #search-based #using: Nautilus: fast automated IP design space search using guided genetic algorithms (MKP, PM, JCH), p. 6.
DATE-2015-0001B #clustering #energy #manycore #performance: A ultra-low-energy convolution engine for fast brain-inspired vision in multicore clusters (FC, LB), pp. 683–688.
DATE-2015-AhmadyanGNCV #analysis #diagrams #performance: Fast eye diagram analysis for high-speed CMOS circuits (SNA, CG, SN, EC, SV), pp. 1377–1382.
DATE-2015-BringmannEGGMSS #generative #prototype #simulation: The next generation of virtual prototyping: ultra-fast yet accurate simulation of HW/SW systems (OB, WE, AG, AG, DMG, PS, SS), pp. 1698–1707.
DATE-2015-ChenWY #parallel #performance: A fast parallel sparse solver for SPICE-based circuit simulators (XC, YW, HY), pp. 205–210.
DATE-2015-CourbonLFT #detection #hardware #performance: A high efficiency hardware trojan detection technique based on fast SEM imaging (FC, PLM, JJAF, AT), pp. 788–793.
DATE-2015-DoumaAP #estimation #execution #performance #precise: Fast and precise cache performance estimation for out-of-order execution (RD, SA, ADP), pp. 1132–1137.
DATE-2015-FaravelonFP #branch #performance #predict #simulation: Fast and accurate branch predictor simulation (AF, NF, FP), pp. 317–320.
DATE-2015-GoncalvesLCTCB #algorithm #modelling #performance #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-KriebelRSASH #analysis #combinator #configuration management #fault #named #performance: 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 #performance #simulation: Dynamic power and performance back-annotation for fast and accurate functional hardware simulation (DL, LKJ, AG), pp. 1126–1131.
DATE-2015-LiaperdosSATAL #deployment #performance #using: Fast deployment of alternate analog test using Bayesian model fusion (JL, HGDS, LA, YT, AA, XL), pp. 1030–1035.
DATE-2015-LinSKRM #debugging #detection #effectiveness #fault #performance #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-LiuDNL #hardware #named #realtime: FastTree: a hardware KD-tree construction acceleration engine for real-time ray tracing (XL, YD, YN, ZL), pp. 1595–1598.
DATE-2015-ParkAHYL #big data #energy #gpu #low cost #memory management #performance: 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-TeysseyreNOCCG #performance #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.
PODS-2015-AcharyaDHLS #algorithm #approximate #performance: Fast and Near-Optimal Algorithms for Approximating Distributions by Histograms (JA, ID, CH, JZL, LS), pp. 249–263.
SIGMOD-2015-0001MK #concurrent #database #in memory #multi #performance: Fast Serializable Multi-Version Concurrency Control for Main-Memory Database Systems (TN, TM, AK), pp. 677–689.
SIGMOD-2015-ColgroveDHMSSTV #component #enterprise #named #performance: 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-PrasadFGMLXHR #data transfer #distributed #performance #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-TeflioudiGM #matrix #named #performance #retrieval #scalability: LEMP: Fast Retrieval of Large Entries in a Matrix Product (CT, RG, OM), pp. 107–122.
VLDB-2015-DingWDFZZ #clustering #named #performance #scalability: YADING: Fast Clustering of Large-Scale Time Series Data (RD, QW, YD, QF, HZ, DZ), pp. 473–484.
VLDB-2015-KhayyatLSOPQ0K #difference #performance: Lightning Fast and Space Efficient Inequality Joins (ZK, WL, MS, MO, PP, JAQR, NT, PK), pp. 2074–2085.
VLDB-2015-MitliagkasBDC #approximate #exclamation #graph #performance #rank: FrogWild! — Fast PageRank Approximations on Graph Engines (IM, MB, AGD, CC), pp. 874–885.
VLDB-2015-PelkonenFCHMTV #database #in memory #named #performance #scalability: Gorilla: A Fast, Scalable, In-Memory Time Series Database (TP, SF, PC, QH, JM, JT, KV), pp. 1816–1827.
VLDB-2015-ZhouLLZ #graph #named #optimisation #performance: GraphTwist: Fast Iterative Graph Computation with Two-tier Optimizations (YZ, LL, KL, QZ), pp. 1262–1273.
PLDI-2015-MarrSD #metaprogramming #performance #protocol: Zero-overhead metaprogramming: reflection and metaobject protocols fast and without compromises (SM, CS, SD), pp. 545–554.
PLDI-2015-SinghPV #performance #program analysis: Making numerical program analysis fast (GS, MP, MTV), pp. 303–313.
STOC-2015-AmbainisFG #matrix #multi #performance: Fast Matrix Multiplication: Limitations of the Coppersmith-Winograd Method (AA, YF, FLG), pp. 585–593.
ICALP-v1-2015-GrosseGKSS #algorithm #performance: Fast Algorithms for Diameter-Optimally Augmenting Paths (UG, JG, CK, MHMS, FS), pp. 678–688.
ICALP-v2-2015-BringmannFHRS #network: Ultra-Fast Load Balancing on Scale-Free Networks (KB, TF, MH, RR, TS), pp. 516–527.
ICFP-2015-SmolkaEFG #compilation #performance: A fast compiler for NetKAT (SS, SAE, NF, AG), pp. 328–341.
CHI-2015-DeberJFW #how #latency #performance: How Much Faster is Fast Enough?: User Perception of Latency & Latency Improvements in Direct and Indirect Touch (JD, RJ, CF, DW), pp. 1827–1836.
CHI-2015-LuL #gesture #mobile #performance: Gesture On: Enabling Always-On Touch Gestures for Fast Mobile Access from the Device Standby Mode (HL, YL), pp. 3355–3364.
CHI-2015-VertanenMERK #mobile #named #performance #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 #performance #smarttech: SwiPIN: Fast and Secure PIN-Entry on Smartphones (EvZ, ADL, BB, HH), pp. 1403–1406.
ICML-2015-BachHBG #learning #performance: Paired-Dual Learning for Fast Training of Latent Variable Hinge-Loss MRFs (SHB, BH, JLBG, LG), pp. 381–390.
ICML-2015-FlaxmanWNNS #performance #process: Fast Kronecker Inference in Gaussian Processes with non-Gaussian Likelihoods (SF, AGW, DN, HN, AJS), pp. 607–616.
ICML-2015-GouwsBC #distributed #named #performance #word: BilBOWA: Fast Bilingual Distributed Representations without Word Alignments (SG, YB, GC), pp. 748–756.
ICML-2015-JerniteRS #approach #learning #markov #modelling #performance #random: A Fast Variational Approach for Learning Markov Random Field Language Models (YJ, AMR, DS), pp. 2209–2217.
ICML-2015-SteinhardtL15a #learning #modelling #predict: Learning Fast-Mixing Models for Structured Prediction (JS, PL), pp. 1063–1072.
ICML-2015-YiCP #algorithm #performance: Binary Embedding: Fundamental Limits and Fast Algorithm (XY, CC, EP), pp. 2162–2170.
KDD-2015-CaiTFJH #higher-order #mining #named #performance: Facets: Fast Comprehensive Mining of Coevolving High-order Time Series (YC, HT, WF, PJ, QH), pp. 79–88.
KDD-2015-FujiwaraNSIT #adaptation #performance: Adaptive Message Update for Fast Affinity Propagation (YF, MN, HS, YI, MT), pp. 309–318.
KDD-2015-Llinares-LopezS #mining #mutation testing #performance #permutation #testing: Fast and Memory-Efficient Significant Pattern Mining via Permutation Testing (FLL, MS, LP, KMB), pp. 725–734.
KDD-2015-OhHYJ #matrix #parallel #performance #robust: Fast and Robust Parallel SGD Matrix Factorization (JO, WSH, HY, XJ), pp. 865–874.
KDD-2015-ZhangTMTJL #named #network #performance #scalability #similarity: Panther: Fast Top-k Similarity Search on Large Networks (JZ, JT, CM, HT, YJ, JL), pp. 1445–1454.
KDD-2015-ZhaoJCJ #estimation #parametricity #performance #quality: SAME but Different: Fast and High Quality Gibbs Parameter Estimation (HZ, BJ, JFC, BJ), pp. 1495–1502.
MLDM-2015-SalahAM #mining #optimisation #performance #pipes and filters: Optimizing the Data-Process Relationship for Fast Mining of Frequent Itemsets in MapReduce (SS, RA, FM), pp. 217–231.
RecSys-2015-LiuWS #matrix #performance: Fast Differentially Private Matrix Factorization (ZL, YXW, AJS), pp. 171–178.
SIGIR-2015-LuccheseNOPTV #algorithm #documentation #named #performance #rank: QuickScorer: A Fast Algorithm to Rank Documents with Additive Ensembles of Regression Trees (CL, FMN, SO, RP, NT, RV), pp. 73–82.
OOPSLA-2015-0003KLS #data type #memory management #multi #performance #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-SteindorferV #agile #optimisation #performance #virtual machine: Optimizing hash-array mapped tries for fast and lean immutable JVM collections (MJS, JJV), pp. 783–800.
SAC-2015-BoitoKND #performance #profiling #towards: Towards fast profiling of storage devices regarding access sequentiality (FZB, RK, POAN, YD), pp. 2015–2020.
SAC-2015-JakobssonKS #c #hybrid #memory management #monitoring #performance: Fast as a shadow, expressive as a tree: hybrid memory monitoring for C (AJ, NK, JS), pp. 1765–1772.
SAC-2015-PapeBH #adaptation #data type #execution #optimisation #performance: Adaptive just-in-time value class optimization: transparent data structure inlining for fast execution (TP, CFB, RH), pp. 1970–1977.
SAC-2015-Rekha #big data #detection #performance #using: A fast support vector data description system for anomaly detection using big data (AGR), pp. 931–932.
ICSE-v1-2015-PapadakisJHT #compilation #detection #effectiveness #empirical #equivalence #performance #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-v2-2015-Roos #code completion #performance #precise #statistics: Fast and Precise Statistical Code Completion (PR), pp. 757–759.
ICSE-v2-2015-VetroOF0 #empirical #feedback #performance #re-engineering #research: Fast Feedback Cycles in Empirical Software Engineering Research (AV, SO, DMF, SW), pp. 583–586.
CC-2015-DemangePS #coq #optimisation #performance #verification: Verifying Fast and Sparse SSA-Based Optimizations in Coq (DD, DP, LS), pp. 233–252.
CGO-2015-StepanovS #c++ #detection #memory management #named #performance: MemorySanitizer: fast detector of uninitialized memory use in C++ (ES, KS), pp. 46–55.
CGO-2015-ZhangGCCH #named #performance: HERMES: a fast cross-ISA binary translator with post-optimization (XZ, QG, YC, TC, WH), pp. 246–256.
HPDC-2015-ZhouLLPZ #abstraction #graph #parallel #performance: Fast Iterative Graph Computation with Resource Aware Graph Parallel Abstractions (YZ, LL, KL, CP, QZ), pp. 179–190.
ISMM-2015-Kuszmaul #named #parallel #performance #thread: SuperMalloc: a super fast multithreaded malloc for 64-bit machines (BCK), pp. 41–55.
PPoPP-2015-BensonB #framework #matrix #parallel #performance: A framework for practical parallel fast matrix multiplication (ARB, GB), pp. 42–53.
PPoPP-2015-RamachandranM #concurrent #named #performance #using: CASTLE: fast concurrent internal binary search tree using edge-based locking (AR, NM), pp. 281–282.
SOSP-2015-WeiSCCC #in memory #performance #transaction #using: Fast in-memory transaction processing using RDMA and HTM (XW, JS, YC, RC, HC), pp. 87–104.
CAV-2015-VizelGM #performance: Fast Interpolating BMC (YV, AG, SM), pp. 641–657.
TAP-2015-BirchFP #fault #locality #modelling #performance #testing: Fast Model-Based Fault Localisation with Test Suites (GB, BF, MRP), pp. 38–57.
CASE-2014-CaoMDZ #detection #performance #visual notation: A gabor based fast interest point detector for image-based robot visual servo control (ZC, FM, JSD, JZ), pp. 883–888.
DAC-2014-PengPL #optimisation #performance: Fast and Accurate Full-chip Extraction and Optimization of TSV-to-Wire Coupling (YP, DP, SKL), p. 6.
DAC-2014-SamalPSSDL #3d #modelling #optimisation #performance: Fast and Accurate Thermal Modeling and Optimization for Monolithic 3D ICs (SKS, SP, KS, MS, YD, SKL), p. 6.
DATE-2014-AhmadC #performance #predict #simulation: Fast STA prediction-based gate-level timing simulation (TBA, MJC), pp. 1–6.
DATE-2014-AlaghiH #performance #probability #using: Fast and accurate computation using stochastic circuits (AA, JPH), pp. 1–4.
DATE-2014-GuerreAL #architecture #benchmark #metric #parallel #performance: A unified methodology for a fast benchmarking of parallel architecture (AG, JTA, YL), pp. 1–4.
DATE-2014-MottaghiRD #framework #named #network #performance: RETLab: A fast design-automation framework for arbitrary RET networks (MDM, AR, CD), pp. 1–6.
DATE-2014-NawinneSJP #performance: Hardware-based fast exploration of cache hierarchies in application specific MPSoCs (IN, JS, HJ, SP), pp. 1–6.
DATE-2014-NoursPB #architecture #evaluation #manycore #performance: A dynamic computation method for fast and accurate performance evaluation of multi-core architectures (SLN, AP, NWB), pp. 1–6.
DATE-2014-SongDY #analysis #bound #multi #order #parametricity #performance #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-TangZS #design #development #performance: System-level design methodology enabling fast development of baseband MP-SoC for 4G small cell base station (ST, ZZ, YS), pp. 1–6.
DRR-2014-GaoRKL #database #documentation #image #performance #retrieval: Fast structural matching for document image retrieval through spatial databases (HG, MR, DK, JL), p. ?–10.
HT-2014-ChengKWT #architecture #distributed #memory management #performance #rdf #scalability: A two-tier index architecture for fast processing large RDF data over distributed memory (LC, SK, TEW, GT), pp. 300–302.
SIGMOD-2014-AgarwalMKTJMMS #approximate #performance #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-GoelCGMMHW #database #facebook #performance: Fast database restarts at facebook (AG, BC, CG, DM, JM, FUH, JLW), pp. 541–549.
SIGMOD-2014-WangKFGKM #framework #performance #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 #performance #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-ZengGMZ #approximate #estimation #fault #performance #query: The analytical bootstrap: a new method for fast error estimation in approximate query processing (KZ, SG, BM, CZ), pp. 277–288.
VLDB-2014-ChenNC #detection #performance #sql: Fast Foreign-Key Detection in Microsoft SQL Server PowerPivot for Excel (ZC, VRN, SC), pp. 1417–1428.
VLDB-2014-ChiangDN #algorithm #performance: Tracking Entities in the Dynamic World: A Fast Algorithm for Matching Temporal Records (YHC, AD, JFN), pp. 469–480.
VLDB-2014-LiLWB #in the cloud #performance #privacy #query: Fast Range Query Processing with Strong Privacy Protection for Cloud Computing (RL, AXL, ALW, BB), pp. 1953–1964.
VLDB-2015-ShenCJLOT14 #distributed #graph #performance: Fast Failure Recovery in Distributed Graph Processing Systems (YS, GC, HVJ, WL, BCO, BMT), pp. 437–448.
SCAM-2014-LiangSM #analysis #performance: Fast Flow Analysis with Godel Hashes (SL, WS, MM), pp. 225–234.
PLDI-2014-DAntoniVLM #named #performance #transducer: Fast: a transducer-based language for tree manipulation (LD, MV, BL, DM), p. 40.
ICALP-v1-2014-ColeK #algorithm #performance #summary: Fast Algorithms for Constructing Maximum Entropy Summary Trees (RC, HJK), pp. 332–343.
ICALP-v1-2014-MekaRRR #independence #performance #pseudo: Fast Pseudorandomness for Independence and Load Balancing — (Extended Abstract) (RM, OR, GNR, RDR), pp. 859–870.
ILC-2014-Strandh #lisp #performance: Fast Generic Dispatch for Common Lisp (RS), p. 89.
CHI-2014-GutwinCSMO #performance: Faster command selection on tablets with FastTap (CG, AC, JS, SM, SCO), pp. 2617–2626.
CHI-2014-MuellerMGFB #3d #functional #named #performance: faBrickation: fast 3D printing of functional objects by integrating construction kit building blocks (SM, TM, KG, JF, PB), pp. 3827–3834.
CSCW-2014-TeoJ #functional #online #performance #quality: Fast, functional, and fitting: expert response dynamics and response quality in an online newcomer help forum (HJT, AJ), pp. 332–341.
HCI-TMT-2014-JuniorSFMC #performance: Fast and Not Furious (LLLJ, FES, FAF, LFVM, JPC), pp. 219–229.
CIKM-2014-BudaCMK #database #named #performance: VFDS: An Application to Generate Fast Sample Databases (TSB, TC, JM, MK), pp. 2048–2050.
CIKM-2014-ChatzistergiouV #clustering #data type #heuristic #performance: Fast Heuristics for Near-Optimal Task Allocation in Data Stream Processing over Clusters (AC, SDV), pp. 1579–1588.
CIKM-2014-LimCK #data type #performance: Fast, Accurate, and Space-efficient Tracking of Time-weighted Frequent Items from Data Streams (YL, JC, UK), pp. 1109–1118.
CIKM-2014-SchuthSWLR #evaluation #multi #online #performance: Multileaved Comparisons for Fast Online Evaluation (AS, FS, SW, DL, MdR), pp. 71–80.
ICML-c1-2014-NguyenB #performance #process: Fast Allocation of Gaussian Process Experts (TVN, EVB), pp. 145–153.
ICML-c1-2014-Shrivastava0 #performance #permutation: Densifying One Permutation Hashing via Rotation for Fast Near Neighbor Search (AS, PL), pp. 557–565.
ICML-c1-2014-ZhongK #multi #performance #probability: Fast Stochastic Alternating Direction Method of Multipliers (WZ, JTYK), pp. 46–54.
ICML-c2-2014-AgarwalHKLLS #algorithm #performance: Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits (AA, DH, SK, JL, LL, RES), pp. 1638–1646.
ICML-c2-2014-CuturiD #performance: Fast Computation of Wasserstein Barycenters (MC, AD), pp. 685–693.
ICML-c2-2014-Sohl-DicksteinPG #optimisation #performance #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 #performance: Fast Multi-stage Submodular Maximization (KW, RKI, JAB), pp. 1494–1502.
ICPR-2014-Ahn #adaptation #online #performance #robust: Fast Adaptive Robust Subspace Tracking for Online Background Subtraction (JHA), pp. 2555–2559.
ICPR-2014-Desrosiers #adaptation #approach #image #performance #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 #performance: Evaluation of Binary Descriptors for Fast and Fully Automatic Identification (LE, MH), pp. 154–159.
ICPR-2014-HuangCZ #performance: An Improved Filtering for Fast Stereo Matching (XH, GC, YZ), pp. 2448–2452.
ICPR-2014-LiewY #detection #feature model #novel #performance #robust: Generalized BRIEF: A Novel Fast Feature Extraction Method for Robust Hand Detection (CFL, TY), pp. 3014–3019.
ICPR-2014-MicoO #algorithm #performance: Dynamic Insertions in TLAESA Fast NN Search Algorithm (LM, JO), pp. 3828–3833.
ICPR-2014-OuyangYLW #performance #robust: A FAST Extreme Illumination Robust Feature in Affine Space (PO, SY, LL, SW), pp. 2365–2370.
ICPR-2014-PatriciaTC #adaptation #learning #multi #performance: Multi-source Adaptive Learning for Fast Control of Prosthetics Hand (NP, TT, BC), pp. 2769–2774.
ICPR-2014-RothermelHWB #generative #modelling #performance #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-Shirakawa #multi #performance #similarity #using: Fast Similarity Search Using Multiple Binary Codes (SS), pp. 3714–3719.
ICPR-2014-UbukataSTMKMU #detection #image #performance #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 #performance: 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 #performance: Logistic Component Analysis for Fast Distance Metric Learning (KW, TW), pp. 1278–1282.
ICPR-2014-YunJKHC #detection #modelling #performance #self: Self-Organizing Cascaded Structure of Deformable Part Models for Fast Object Detection (SY, HJ, WSK, BH, JYC), pp. 4246–4250.
KDD-2014-ChenCW #classification #performance #scalability: Fast flux discriminant for large-scale sparse nonlinear classification (WC, YC, KQW), pp. 621–630.
KDD-2014-FangP #algorithm #linear #performance: Fast DTT: a near linear algorithm for decomposing a tensor into factor tensors (XF, RP), pp. 967–976.
KDD-2014-LofgrenBGC #estimation #graph #named #personalisation #rank #scalability: FAST-PPR: scaling personalized pagerank estimation for large graphs (PL, SB, AG, SC), pp. 1436–1445.
KDD-2014-PrabhuV #classification #learning #multi #named #performance: FastXML: a fast, accurate and stable tree-classifier for extreme multi-label learning (YP, MV), pp. 263–272.
KDD-2014-PurohitPKZS #network #performance #scalability: Fast influence-based coarsening for large networks (MP, BAP, CK, YZ, VSS), pp. 1296–1305.
MLDM-2014-BugaychenkoZ #diagrams #learning #multi #pattern matching #pattern recognition #performance #recognition #using: Fast Pattern Recognition and Deep Learning Using Multi-Rooted Binary Decision Diagrams (DB, DZ), pp. 73–77.
SIGIR-2014-YuWYTLZ #performance #retrieval #taxonomy: Discriminative coupled dictionary hashing for fast cross-media retrieval (ZY, FW, YY, QT, JL, YZ), pp. 395–404.
SKY-2014-ExmanN #network #performance #recommendation #social: Location-based Fast Recommendation Social Network (IE, EN), pp. 55–62.
OOPSLA-2014-ShahriyarBM #garbage collection #performance: Fast conservative garbage collection (RS, SMB, KSM), pp. 121–139.
OOPSLA-2014-SteeleLF #generative #performance #pseudo: Fast splittable pseudorandom number generators (GLSJ, DL, CHF), pp. 453–472.
SAC-2014-SerranoG #performance: Locking fast (MS, JG), pp. 1556–1561.
SAC-2014-SpiegelJA #classification #distance #performance: Fast time series classification under lucky time warping distance (SS, BJJ, SA), pp. 71–78.
SAC-2014-TinK #clustering #distributed #performance: Method for fast clustering of data distributed on a sphere surface (TT, SRK), pp. 1735–1736.
ASPLOS-2014-MenychtasSS #performance #scheduling: Disengaged scheduling for fair, protected access to fast computational accelerators (KM, KS, MLS), pp. 301–316.
ISMM-2014-Joisha #performance #scalability: Sticky tries: fast insertions, fast lookups, no deletions for large key universes (PGJ), pp. 35–46.
OSDI-2014-LeesatapornwongsaHJLG #debugging #model checking #named #performance #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 #performance: Fast Databases with Fast Durability and Recovery Through Multicore Parallelism (WZ, ST, EK, BL), pp. 465–477.
PPoPP-2014-NatarajanM #concurrent #performance: Fast concurrent lock-free binary search trees (AN, NM), pp. 317–328.
ISSTA-2014-HendersonPYHWZY #analysis #framework #performance: 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.
SAT-2014-FinkbeinerT #performance: Fast DQBF Refutation (BF, LT), pp. 243–251.
CASE-2013-MarturiDP #image #performance #using: Fast image drift compensation in scanning electron microscope using image registration (NM, SD, NP), pp. 807–812.
CASE-2013-QianY #named #navigation #performance #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 #performance: Prior-knowledge assisted fast 3D map building of structured environments for steel bridge maintenance (SS, GP, DRS, DL), pp. 1040–1046.
DATE-2013-BoleyCAC #analysis #estimation #performance: Leveraging sensitivity analysis for fast, accurate estimation of SRAM dynamic write VMIN (JB, VC, RCA, BHC), pp. 1819–1824.
DATE-2013-CevreroEAILBS #estimation #performance: 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-DaloukasMETS #approach #network #parallel #performance #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-HelmstetterCGMV #performance #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 #performance: A fast and Effective DFT for test and diagnosis of power switches in SoCs (XH, JM, RAS, SB, DKP), pp. 1089–1092.
DATE-2013-LeeJS #architecture #hybrid #memory management #performance: Fast shared on-chip memory architecture for efficient hybrid computing with CGRAs (JL, YJ, SS), pp. 1575–1578.
DATE-2013-LiD #approach #debugging #hybrid #performance: A hybrid approach for fast and accurate trace signal selection for post-silicon debug (ML, AD), pp. 485–490.
DATE-2013-LivramentoGGJ #performance: Fast and efficient lagrangian relaxation-based discrete gate sizing (VSL, CG, JLG, MOJ), pp. 1855–1860.
DATE-2013-LoiaconoPPPQRVB #estimation #multi #performance #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 #performance #simulation: Fast cache simulation for host-compiled simulation of embedded software (KL, DMG, US), pp. 637–642.
DATE-2013-PiriouDRR #architecture #estimation #performance #programmable #reduction: A fast and accurate methodology for power estimation and reduction of programmable architectures (EP, RD, FR, SR), pp. 1054–1055.
DATE-2013-WangH #embedded #modelling #performance #simulation: Fast and accurate cache modeling in source-level simulation of embedded software (ZW, JH), pp. 587–592.
DATE-2013-YingHH #3d #performance: 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.
ICDAR-2013-LebourgeoisDGD #documentation #image #performance #segmentation: Fast Integral MeanShift: Application to Color Segmentation of Document Images (FL, FD, DG, JD), pp. 52–56.
ICDAR-2013-MondalRRP #kernel #locality #performance #retrieval #word: A Fast Word Retrieval Technique Based on Kernelized Locality Sensitive Hashing (TM, NR, JYR, UP), pp. 1195–1199.
ICDAR-2013-ToselliV #approach #documentation #performance #word: Fast HMM-Filler Approach for Key Word Spotting in Handwritten Documents (AHT, EV), pp. 501–505.
ICDAR-2013-ZhouYL #learning #performance #polynomial #recognition: GPU-Based Fast Training of Discriminative Learning Quadratic Discriminant Function for Handwritten Chinese Character Recognition (MKZ, FY, CLL), pp. 842–846.
SIGMOD-2013-AkibaIY #distance #network #performance #query #scalability: Fast exact shortest-path distance queries on large networks by pruned landmark labeling (TA, YI, YY), pp. 349–360.
SIGMOD-2013-FanXS #adaptation #monitoring #named #performance #realtime: FAST: differentially private real-time aggregate monitor with filtering and adaptive sampling (LF, LX, VSS), pp. 1065–1068.
SIGMOD-2013-LiP #in memory #memory management #named #performance: BitWeaving: fast scans for main memory data processing (YL, JMP), pp. 289–300.
SIGMOD-2013-MishneDLSL #architecture #big data #performance #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.
VLDB-2013-BambaRHA #geometry #graph #performance #statistics: Statistics Collection in Oracle Spatial and Graph: Fast Histogram Construction for Complex Geometry Objects (BB, SR, YH, RA), pp. 1021–1032.
VLDB-2013-JinW #performance #reachability #scalability: Simple, Fast, and Scalable Reachability Oracle (RJ, GW), pp. 1978–1989.
VLDB-2013-KhanWAY #graph #named #performance #similarity: NeMa: Fast Graph Search with Label Similarity (AK, YW, CCA, XY), pp. 181–192.
VLDB-2013-Sellam #performance: Fast Cartography for Data Explorers (TS), pp. 1456–1461.
VLDB-2013-SimoesGG #algorithm #approximate #information management #performance #using: When Speed Has a Price: Fast Information Extraction Using Approximate Algorithms (GS, HG, LG), pp. 1462–1473.
VLDB-2013-XieWBDG #graph #performance: Fast Iterative Graph Computation with Block Updates (WX, GW, DB, AJD, JG), pp. 2014–2025.
VLDB-2013-YuanLWJZL #named #performance #rdf #scalability: TripleBit: a Fast and Compact System for Large Scale RDF Data (PY, PL, BW, HJ, WZ, LL), pp. 517–528.
MSR-2013-JiangAG #case study #how #kernel #linux #performance: Will my patch make it? and how fast?: case study on the Linux kernel (YJ, BA, DMG), pp. 101–110.
PEPM-2013-MartinezVP #compilation #exclamation #haskell #performance: Just do it while compiling!: fast extensible records in haskell (BM, MV, AP), pp. 77–86.
PLDI-2013-JohnsonOZA #dependence #graph #performance: Fast condensation of the program dependence graph (NPJ, TO, AZ, DIA), pp. 39–50.
PLDI-2013-RajaramNSE #implementation #performance #semantics: Fast RMWs for TSO: semantics and implementation (BR, VN, SS, ME), pp. 61–72.
PLDI-2013-ZhangLYS #algorithm #alias #analysis #performance: Fast algorithms for Dyck-CFL-reachability with applications to alias analysis (QZ, MRL, HY, ZS), pp. 435–446.
STOC-2013-CyganKN #performance: Fast hamiltonicity checking via bases of perfect matchings (MC, SK, JN), pp. 301–310.
STOC-2013-LenzenP #performance #using: Fast routing table construction using small messages: extended abstract (CL, BPS), pp. 381–390.
STOC-2013-RodittyW #algorithm #approximate #graph #performance: Fast approximation algorithms for the diameter and radius of sparse graphs (LR, VVW), pp. 515–524.
ICALP-v2-2013-BachrachP #big data #performance #pseudo #recommendation #sketching #using: Sketching for Big Data Recommender Systems Using Fast Pseudo-random Fingerprints (YB, EP), pp. 459–471.
ICALP-v2-2013-DereniowskiDKPU #collaboration #graph #performance: Fast Collaborative Graph Exploration (DD, YD, AK, DP, PU), pp. 520–532.
ICALP-v2-2013-FuscoPP #learning #performance: Learning a Ring Cheaply and Fast (EGF, AP, RP), pp. 557–568.
ICALP-v2-2013-PettieS #algorithm #distributed #graph #performance: Fast Distributed Coloring Algorithms for Triangle-Free Graphs (SP, HHS), pp. 681–693.
CEFP-2013-DaneluttoT #parallel #programming: Structured Parallel Programming with “core” FastFlow (MD, MT), pp. 29–75.
CHI-2013-JotaNDW #case study #how #latency #performance: 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-LeitnerPLRH #gesture #named #performance #scalability: Kolibri: tiny and fast gestures for large pen-based surfaces (JL, FP, CL, CR, MH), pp. 1789–1798.
CHI-2013-SunLFK0 #architecture #interface #multi #performance #sketching: A multi-touch interface for fast architectural sketching and massing (QS, JL, CWF, SK, YH), pp. 247–256.
HCI-III-2013-LiLL #algorithm #performance: Fast Dynamic Channel Allocation Algorithm for TD-HSPA System (HL, HLL, XL), pp. 82–91.
HCI-III-2013-WangLLD #algorithm #performance #realtime #visual notation: A New Real-Time Visual SLAM Algorithm Based on the Improved FAST Features (LW, RL, CL, FD), pp. 206–215.
CAiSE-2013-RiemerSS #design #performance: A Methodology for Designing Events and Patterns in Fast Data Processing (DR, NS, LS), pp. 133–148.
CIKM-2013-SchneiderV #clustering #performance #random: Fast parameterless density-based clustering via random projections (JS, MV), pp. 861–866.
CIKM-2013-WangZS #performance #scalability #similarity: Weighted hashing for fast large scale similarity search (QW, DZ, LS), pp. 1185–1188.
ECIR-2013-ChattopadhyayaSS #distance #edit distance #generative #performance: A Fast Generative Spell Corrector Based on Edit Distance (IC, KS, KS), pp. 404–410.
ICML-c1-2013-Hennig #optimisation #performance #probability: Fast Probabilistic Optimization from Noisy Gradients (PH), pp. 62–70.
ICML-c1-2013-KumarSK #algorithm #matrix #performance: Fast Conical Hull Algorithms for Near-separable Non-negative Matrix Factorization (AK, VS, PK), pp. 231–239.
ICML-c1-2013-ZhuCPZ #algorithm #modelling #performance #topic: Gibbs Max-Margin Topic Models with Fast Sampling Algorithms (JZ, NC, HP, BZ), pp. 124–132.
ICML-c2-2013-WangM #performance: Fast dropout training (SIW, CDM), pp. 118–126.
ICML-c3-2013-ChenZW #image #performance: Fast Image Tagging (MC, AXZ, KQW), pp. 1274–1282.
ICML-c3-2013-CovielloMCL #exclamation #performance: That was fast! Speeding up NN search of high dimensional distributions (EC, AM, ABC, GRGL), pp. 468–476.
ICML-c3-2013-IyerJB #optimisation #performance: Fast Semidifferential-based Submodular Function Optimization (RKI, SJ, JAB), pp. 855–863.
ICML-c3-2013-Izbicki #algebra #approach #classification #online #parallel #performance: Algebraic classifiers: a generic approach to fast cross-validation, online training, and parallel training (MI), pp. 648–656.
ICML-c3-2013-KhanAFS #modelling #performance: Fast Dual Variational Inference for Non-Conjugate Latent Gaussian Models (MEK, AYA, MPF, MWS), pp. 951–959.
ICML-c3-2013-Kuleshov #algorithm #analysis #component #performance: Fast algorithms for sparse principal component analysis based on Rayleigh quotient iteration (VK), pp. 1418–1425.
ICML-c3-2013-WangK #algorithm #energy #performance: A Fast and Exact Energy Minimization Algorithm for Cycle MRFs (HW, DK), pp. 190–198.
ICML-c3-2013-XuZZ #matrix #performance: Fast Max-Margin Matrix Factorization with Data Augmentation (MX, JZ, BZ), pp. 978–986.
KDD-2013-BahadoriLX #learning #performance #probability #process: Fast structure learning in generalized stochastic processes with latent factors (MTB, YL, EPX), pp. 284–292.
KDD-2013-HanLPL0KY #graph #named #parallel #performance: 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-KuangP #clustering #documentation #matrix #performance: Fast rank-2 nonnegative matrix factorization for hierarchical document clustering (DK, HP), pp. 739–747.
KDD-2013-LiuCZ #approach #performance #probability: Summarizing probabilistic frequent patterns: a fast approach (CL, LC, CZ), pp. 527–535.
KDD-2013-PhamP #kernel #performance #polynomial #scalability: Fast and scalable polynomial kernels via explicit feature maps (NP, RP), pp. 239–247.
KDD-2013-ZengJZLLLSZLDLW #data mining #distributed #mining #named #performance: 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.
RecSys-2013-ZhuangCJL #matrix #memory management #parallel #performance: A fast parallel SGD for matrix factorization in shared memory systems (YZ, WSC, YCJ, CJL), pp. 249–256.
SIGIR-2013-DimopoulosNS #performance #query: A candidate filtering mechanism for fast top-k query processing on modern cpus (CD, SN, TS), pp. 723–732.
SIGIR-2013-RossiMCS #performance #query #using: Fast document-at-a-time query processing using two-tier indexes (CR, ESdM, ALC, ASdS), pp. 183–192.
OOPSLA-2013-MillerHBO #combinator #generative #object-oriented #performance: Instant pickles: generating object-oriented pickler combinators for fast and extensible serialization (HM, PH, EB, MO), pp. 183–202.
SAC-2013-HapfelmeierSK #dataset #incremental #linear #performance: Incremental linear model trees on massive datasets: keep it simple, keep it fast (AH, JS, SK), pp. 129–135.
CGO-2013-RodriguesCP #integer #performance #source code: A fast and low-overhead technique to secure programs against integer overflows (RER, VHSC, FMQP), p. 11.
HPCA-2013-ArdestaniR #manycore #named #performance #using: ESESC: A fast multicore simulator using Time-Based Sampling (EKA, JR), pp. 448–459.
PPoPP-2013-MorrisonA #concurrent #performance: Fast concurrent queues for x86 processors (AM, YA), pp. 103–112.
PPoPP-2013-WamhoffFFRM #concurrent #memory management #named #performance #thread #transaction: FastLane: improving performance of software transactional memory for low thread counts (JTW, CF, PF, ER, GM), pp. 113–122.
PPoPP-2013-YanLZ #algorithm #named #performance: StreamScan: fast scan algorithms for GPUs without global barrier synchronization (SY, GL, YZ), pp. 229–238.
SOSP-2013-KediaB #kernel #performance: Fast dynamic binary translation for the kernel (PK, SB), pp. 101–115.
CADE-2013-Shankar #automation #performance #reasoning: Automated Reasoning, Fast and Slow (NS), pp. 145–161.
CAV-2013-KroeningLW #approximate #c #detection #performance #source code: Under-Approximating Loops in C Programs for Fast Counterexample Detection (DK, ML, GW), pp. 381–396.
ASE-2012-Shang0X #analysis #experience #incremental #performance #points-to #precise #summary: Fast and precise points-to analysis with incremental CFL-reachability summarisation: preliminary experience (LS, YL, JX), pp. 270–273.
CASE-2012-ParulkarSK #automation #performance #random: Fast randomized planner for SLAM automation (AP, PS, KMK), pp. 765–770.
DAC-2012-ChungJ #analysis #functional #performance: Functional timing analysis made fast and general (YTC, JHRJ), pp. 1055–1060.
DAC-2012-Gester0NPSV #algorithm #data type #performance: Algorithms and data structures for fast and good VLSI routing (MG, DM, TN, CP, CS, JV), pp. 459–464.
DAC-2012-JiangZZY #embedded #multi #performance #scalability: Constructing large and fast multi-level cell STT-MRAM based cache for embedded processors (LJ, BZ, YZ, JY), pp. 907–912.
DAC-2012-SeversonYD #performance #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-WenZCWX #analysis #named #performance #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 #performance #reduction: Fast nonlinear model order reduction via associated transforms of high-order volterra transfer functions (YZ, HL, QW, NF, NW), pp. 289–294.
DATE-2012-BombieriFG #fault #framework #functional #named #simulation #verification: FAST-GP: An RTL functional verification framework based on fault simulation on GP-GPUs (NB, FF, VG), pp. 562–565.
DATE-2012-BonamyPPC #configuration management #named #power management: UPaRC — Ultra-fast power-aware reconfiguration controller (RB, HMP, SP, DC), pp. 1373–1378.
DATE-2012-CupaiuoloI #flexibility #framework #implementation #performance: A flexible and fast software implementation of the FFT on the BPE platform (TC, DLI), pp. 1467–1470.
DATE-2012-LiuMG #estimation #performance #problem: A fast analog circuit yield estimation method for medium and high dimensional problems (BL, JM, GGEG), pp. 751–756.
DATE-2012-MandalKM #design #performance: A fast, source-synchronous ring-based network-on-chip design (AM, SPK, RNM), pp. 1489–1494.
DATE-2012-MarongiuBB #clustering #embedded #lightweight #parallel #performance: 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 #performance #synthesis #testing: Fast isomorphism testing for a graph-based analog circuit synthesis framework (MM, OM, LL, LH), pp. 757–762.
DATE-2012-NassarSGD #named #performance: 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-PomataMTRL #design #performance: Exploiting binary translation for fast ASIP design space exploration on FPGAs (SP, PM, GT, LR, ML), pp. 566–569.
DATE-2012-StefanMAG #multi #performance: 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 #performance: TagTM — accelerating STMs with hardware tags for fast meta-data access (SS, ST, FZ, AC, OSÜ, MV), pp. 39–44.
DATE-2012-ThachTKI #estimation #performance: Fast cycle estimation methodology for instruction-level emulator (DT, YT, SK, AI), pp. 248–251.
SIGMOD-2012-EngleLXZFSS #data analysis #distributed #memory management #named #performance #using: Shark: fast data analysis using coarse-grained distributed memory (CE, AL, RX, MZ, MJF, SS, IS), pp. 689–692.
SIGMOD-2012-KimPSLDC #clustering #distributed #named #performance #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-RosnerHGPB #correlation #performance #word: Fast sampling word correlations of high dimensional text data (abstract only) (FR, AH, MG, MP, AB), p. 866.
SIGMOD-2012-ThomsonDWRSA #database #distributed #named #performance #transaction: Calvin: fast distributed transactions for partitioned database systems (AT, TD, SCW, KR, PS, DJA), pp. 1–12.
VLDB-2012-DittrichQRSJS #performance: Only Aggressive Elephants are Fast Elephants (JD, JAQR, SR, SS, AJ, JS), pp. 1591–1602.
VLDB-2012-EwenTKM #data flow #performance: Spinning Fast Iterative Data Flows (SE, KT, MK, VM), pp. 1268–1279.
VLDB-2012-FujiwaraNOK #performance #random: Fast and Exact Top-k Search for Random Walk with Restart (YF, MN, MO, MK), pp. 442–453.
VLDB-2012-LamLPRVD #named #performance: Muppet: MapReduce-Style Processing of Fast Data (WL, LL, SP, AR, ZV, AD), pp. 1814–1825.
VLDB-2012-SatuluriP #locality #performance #similarity: Bayesian Locality Sensitive Hashing for Fast Similarity Search (VS, SP), pp. 430–441.
TACAS-2012-BabiakKRS #automaton #ltl #performance: LTL to Büchi Automata Translation: Fast and More Deterministic (TB, MK, VR, JS), pp. 95–109.
WCRE-2012-GauthierM #data access #detection #performance #php: Fast Detection of Access Control Vulnerabilities in PHP Applications (FG, EM), pp. 247–256.
WCRE-2012-GuerroujGGAP #algorithm #identifier #named #performance: TRIS: A Fast and Accurate Identifiers Splitting and Expansion Algorithm (LG, PG, YGG, GA, MDP), pp. 103–112.
PEPM-2012-Puschel #compilation #performance: Compiling math to fast code (MP), pp. 1–2.
PLDI-2012-HackettG #hybrid #javascript #performance #precise #type inference: Fast and precise hybrid type inference for JavaScript (BH, SyG), pp. 239–250.
STOC-2012-Censor-HillelHKM #dependence #performance: 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 #performance #rank: Fast matrix rank algorithms and applications (HYC, TCK, LCL), pp. 549–562.
CIAA-2012-FaroL #algorithm #automaton #online #performance #string: A Fast Suffix Automata Based Algorithm for Exact Online String Matching (SF, TL), pp. 149–158.
ICALP-v2-2012-BernsHP #algorithm #distributed #metric: Super-Fast Distributed Algorithms for Metric Facility Location (AB, JH, SVP), pp. 428–439.
LATA-2012-BilleS #dependence #performance #programming: Fast and Cache-Oblivious Dynamic Programming with Local Dependencies (PB, MS), pp. 131–142.
CIKM-2012-AkogluTVF #category theory #detection #performance #reliability: Fast and reliable anomaly detection in categorical data (LA, HT, JV, CF), pp. 415–424.
CIKM-2012-AsadiL #documentation #generative #performance #ranking: Fast candidate generation for two-phase document ranking: postings list intersection with bloom filters (NA, JL), pp. 2419–2422.
CIKM-2012-GubichevN #approximate #graph #performance #scalability: Fast approximation of steiner trees in large graphs (AG, TN), pp. 1497–1501.
CIKM-2012-LowZ #matrix #performance #query #similarity: Fast top-k similarity queries via matrix compression (YL, AXZ), pp. 2070–2074.
CIKM-2012-OrdonezMGTM #performance: Fast PCA computation in a DBMS with aggregate UDFs and LAPACK (CO, NM, CGA, PTT, EM), pp. 2219–2223.
CIKM-2012-SunSL #learning #multi #performance #query: Fast multi-task learning for query spelling correction (XS, AS, PL), pp. 285–294.
CIKM-2012-WelchSD #incremental #knowledge base #performance: Fast and accurate incremental entity resolution relative to an entity knowledge base (MJW, AS, CD), pp. 2667–2670.
ICML-2012-Busa-FeketeBK #classification #graph #performance #using: Fast classification using sparse decision DAGs (RBF, DB, BK), p. 99.
ICML-2012-DefazioC #collaboration #performance #visual notation: A Graphical Model Formulation of Collaborative Filtering Neighbourhood Methods with Fast Maximum Entropy Training (AD, TSC), p. 75.
ICML-2012-HoiWZJW #algorithm #bound #kernel #learning #online #performance #scalability: Fast Bounded Online Gradient Descent Algorithms for Scalable Kernel-Based Online Learning (SCHH, JW, PZ, RJ, PW), p. 141.
ICML-2012-KimuraK #kernel #performance: Fast Computation of Subpath Kernel for Trees (DK, HK), p. 81.
ICML-2012-KoepkeB #performance #predict: Fast Prediction of New Feature Utility (HAK, MB), p. 130.
ICML-2012-MahoneyDMW #approximate #matrix #performance #statistics: Fast approximation of matrix coherence and statistical leverage (MWM, PD, MMI, DPW), p. 137.
ICML-2012-MnihT #algorithm #modelling #performance #probability: A fast and simple algorithm for training neural probabilistic language models (AM, YWT), p. 58.
ICML-2012-VladymyrovC #algorithm #performance: Fast Training of Nonlinear Embedding Algorithms (MV, MÁCP), p. 129.
ICPR-2012-Abdel-HakimE #analysis #component #named #online #performance #robust: FRPCA: Fast Robust Principal Component Analysis for online observations (AEAH, MES), pp. 413–416.
ICPR-2012-AnhNKKL #automation #geometry #performance #segmentation: Fast automatic saliency map driven geometric active contour model for color object segmentation (NTLA, VQN, EK, SHK, GL), pp. 2557–2560.
ICPR-2012-EdmundsonS #image #performance #retrieval #using: Fast JPEG image retrieval using optimised Huffman tables (DE, GS), pp. 3188–3191.
ICPR-2012-FerrazB #3d #estimation #performance #robust: Fast and robust monocular 3D deformable shape estimation for inextensible and smooth surfaces (LF, XB), pp. 2104–2107.
ICPR-2012-GerogiannisNL #detection #image #performance: Fast and efficient vanishing point detection in indoor images (DG, CN, AL), pp. 3244–3247.
ICPR-2012-Goldstein #algorithm #detection #named: FastLOF: An Expectation-Maximization based Local Outlier detection algorithm (MG), pp. 2282–2285.
ICPR-2012-GuSM #image #performance: Fast image super resolution via local regression (SG, NS, FM), pp. 3128–3131.
ICPR-2012-HaraKMM #3d #generative #using #video: Fast-accurate 3D face model generation using a single video camera (TH, HK, AM, SM), pp. 1269–1272.
ICPR-2012-HoangT #orthogonal #performance: Fast computation of orthogonal polar harmonic transforms (TVH, ST), pp. 3160–3163.
ICPR-2012-HsinSK #algorithm #performance #synthesis: A fast wavelet-packet-based algorithm for texture synthesis (HCH, TYS, LTK), pp. 3124–3127.
ICPR-2012-Imajo #algorithm #performance #using: Fast Gaussian filtering algorithm using splines (KI), pp. 489–492.
ICPR-2012-LiuW12b #performance #recognition #robust: Accelerated robust sparse coding for fast face recognition (GL, YY, HW), pp. 3394–3397.
ICPR-2012-MiksikM #detection #evaluation #performance: Evaluation of local detectors and descriptors for fast feature matching (OM, KM), pp. 2681–2684.
ICPR-2012-MitraKGSMLOVM #clustering #multimodal #performance: 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 #performance #retrieval: Mapping high dimensional features onto Hilbert curve: Applying to fast image retrieval (GN, PF, RM, JMO), pp. 425–428.
ICPR-2012-SchleifZGH #approximate #clustering #kernel #performance #relational: Fast approximated relational and kernel clustering (FMS, XZ, AG, BH), pp. 1229–1232.
ICPR-2012-SouzaOT #performance: Fast global non-rigid registration for mosaic creation (RHCdS, MO, AT), pp. 2736–2739.
ICPR-2012-SunXAL #approach #online #performance #video: A tracking based fast online complete video synopsis approach (LS, JX, HA, SL), pp. 1956–1959.
ICPR-2012-VacavantAMS #performance: Fast smoothed shock filtering (AV, AAK, PYM, JS), pp. 182–185.
ICPR-2012-YaoZLL #algorithm #effectiveness #modelling #performance: A fast and effective appearance model-based particle filtering object tracking algorithm (ZY, YZ, JL, WL), pp. 1475–1478.
ICPR-2012-ZarifFR #image #multi #performance #similarity #using: Fast and efficient multichannel image completion using local similarity (SZ, IF, DR), pp. 3116–3119.
KDD-2012-ChengZKC #algorithm #clique #memory management #performance: Fast algorithms for maximal clique enumeration with limited memory (JC, LZ, YK, SC), pp. 1240–1248.
KDD-2012-LiLP #coordination #performance #using: Fast bregman divergence NMF using taylor expansion and coordinate descent (LL, GL, HP), pp. 307–315.
KDD-2012-MarchCG #algorithm #correlation #performance: Fast algorithms for comprehensive n-point correlation estimates (WBM, AJC, AGG), pp. 1478–1486.
KDD-2012-MatsubaraSFIY #mining #performance: Fast mining and forecasting of complex time-stamped events (YM, YS, CF, TI, MY), pp. 271–279.
SIGIR-2012-KovesiGA #categorisation #learning #multi #online #performance: Fast on-line learning for multilingual categorization (MK, CG, MRA), pp. 1071–1072.
ECMFA-2012-WinklerFGM #performance: BOB the Builder: A Fast and Friendly Model-to-PetriNet Transformer (UW, MF, WG, AM), pp. 416–427.
TOOLS-EUROPE-2012-CatanoHR #formal method #named #network #policy #privacy #social: Poporo: A Formal Methods Tool for Fast-Checking of Social Network Privacy Policies (NC, SH, CR), pp. 9–16.
SAC-2012-JungJCHJCJK #performance: A fast mount mechanism for YAFFS2 (JJ, JJ, YC, HH, GJ, SC, MJ, JYK), pp. 1791–1795.
SAC-2012-KosinaG #multi #performance #problem: Very Fast Decision Rules for multi-class problems (PK, JG), pp. 795–800.
SAC-2012-LiuHHYS #multi #performance: An application of circumscribed circle filter in the Multi-Stencils Fast Marching method (HL, CCH, HH, MY, ES), pp. 33–38.
SAC-2012-OongI #classification #fuzzy #learning #multi #performance #testing: Multilayer Fuzzy ARTMAP: fast learning and fast testing for pattern classification (THO, NAMI), pp. 27–32.
FSE-2012-ParkHHCGTFX #named #performance: CarFast: achieving higher statement coverage faster (SP, BMMH, IH, CC, MG, KT, CF, QX), p. 35.
ICSE-2012-PaganoJBRBM #maintenance #monitoring #named: FastFix: Monitoring control for remote software maintenance (DP, MAJ, AB, TR, BB, WM), pp. 1437–1438.
ASPLOS-2012-CaulfieldMEDCS #performance: Providing safe, user space access to fast, solid state disks (AMC, TIM, LAE, AD, JC, SS), pp. 387–400.
CGO-2012-SembrantBH #modelling #performance #profiling: Phase guided profiling for fast cache modeling (AS, DBS, EH), pp. 175–185.
HPDC-2012-XiaCLTDB #named #network #performance: VNET/P: bridging the cloud and high performance computing through fast overlay networking (LX, ZC, JRL, YT, PAD, PGB), pp. 259–270.
OSDI-2012-LiPCGPR #consistency #performance: Making Geo-Replicated Systems Fast as Possible, Consistent when Necessary (CL, DP, AC, JG, NMP, RR), pp. 265–278.
PPoPP-2012-BlellochFGS #algorithm #parallel #performance: Internally deterministic parallel algorithms can be fast (GEB, JTF, PBG, JS), pp. 181–192.
PPoPP-2012-KoganP #data type #performance: A methodology for creating fast wait-free data structures (AK, EP), pp. 141–150.
ICLP-2012-Tarau #performance: Deriving a Fast Inverse of the Generalized Cantor N-tupling Bijection (PT), pp. 312–322.
CASE-2011-ColP #detection #performance #recursion: Fast and accurate object detection by means of recursive monomial feature elimination and cascade of SVM (LDC, FAP), pp. 304–309.
CASE-2011-JasperF #detection #performance: Fast focus-based depth detection for manipulation in scanning electron microscopes (DJ, SF), pp. 375–380.
CASE-2011-MaiHHH #adaptation #algorithm #performance #speech: A fast adaptive Kalman filtering algorithm for speech enhancement (QM, DH, YH, ZH), pp. 327–332.
DAC-2011-BardhanH #performance: A fast solver for nonlocal electrostatic theory in biomolecular science and engineering (JPB, AH), pp. 801–805.
DAC-2011-GongYH #analysis #monte carlo #orthogonal #performance #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-KoseF #algorithm #analysis #information retrieval #locality #performance: Fast algorithms for IR voltage drop analysis exploiting locality (SK, EGF), pp. 996–1001.
DAC-2011-OnaissiTLN #analysis #approach #performance: A fast approach for static timing analysis covering all PVT corners (SO, FT, JL, FNN), pp. 777–782.
DAC-2011-StattelmannBR #optimisation #performance #simulation: Fast and accurate source-level simulation of software timing considering complex code optimizations (SS, OB, WR), pp. 486–491.
DAC-2011-ZhaoF #3d #gpu #parallel #performance: 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 #performance: Automated construction of fast and accurate system-level models for wireless sensor networks (LSB, RPD, PHC, PAD), pp. 1083–1088.
DATE-2011-BiKVSM #analysis #performance #statistics: Fast statistical analysis of RC nets subject to manufacturing variabilities (YB, KJvdK, JFV, LMS, NvdM), pp. 31–37.
DATE-2011-BoghratiS #analysis #grid #performance #power management #random: A scaled random walk solver for fast power grid analysis (BB, SSS), pp. 38–43.
DATE-2011-ErbP #analysis #performance: A method for fast jitter tolerance analysis of high-speed PLLs (SE, WP), pp. 1107–1112.
DATE-2011-IndrusiakS #performance #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 #performance #simulation #using: Temporal parallel simulation: A fast gate-level HDL simulation using higher level models (DK, MJC, KS, SY), pp. 1584–1589.
DATE-2011-LoCWT #modelling #performance #simulation: Cycle-count-accurate processor modeling for fast and accurate system-level simulation (CKL, LCC, MHW, RST), pp. 341–346.
DATE-2011-MeyerNHBSGSB #configuration management #performance #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-StattelmannBR #analysis #manycore #performance #simulation: Fast and accurate resource conflict simulation for performance analysis of multi-core systems (SS, OB, WR), pp. 210–215.
ICDAR-2011-DuAL #detection #performance: Dot Text Detection Based on FAST Points (YD, HA, SL), pp. 435–439.
ICDAR-2011-KumarD #image #performance #using: Fast Rule-Line Removal Using Integral Images and Support Vector Machines (JK, DSD), pp. 584–588.
ICDAR-2011-SaabniB #performance: Fast Key-Word Searching via Embedding and Active-DTW (RS, AB), pp. 68–72.
ICDAR-2011-TerasawaSK #image #performance: A Fast Appearance-Based Full-Text Search Method for Historical Newspaper Images (KT, TS, TK), pp. 1379–1383.
ICDAR-2011-YalnizM #automation #evaluation #performance: A Fast Alignment Scheme for Automatic OCR Evaluation of Books (IZY, RM), pp. 754–758.
SIGMOD-2011-BahmaniCX #performance #personalisation #pipes and filters #rank: Fast personalized PageRank on MapReduce (BB, KC, DX), pp. 973–984.
SIGMOD-2011-CaoSSYDGW #algorithm #consistency #performance: Fast checkpoint recovery algorithms for frequently consistent applications (TC, MAVS, BS, YY, AJD, JG, WMW), pp. 265–276.
SIGMOD-2011-KhanLYGCT #graph #network #performance #scalability: Neighborhood based fast graph search in large networks (AK, NL, XY, ZG, SC, ST), pp. 901–912.
VLDB-2011-DingK #in memory #memory management #performance #set: Fast Set Intersection in Memory (BD, ACK), pp. 255–266.
VLDB-2011-YangPS #graph #mining #multi #performance: Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining (XY, SP, PS), pp. 231–242.
VLDB-2012-KruegerKGSSCPDZ11 #database #manycore #performance #using: Fast Updates on Read-Optimized Databases Using Multi-Core CPUs (JK, CK, MG, NS, DS, JC, HP, PD, AZ), pp. 61–72.
STOC-2011-KaneNPW #data type #estimation #performance: Fast moment estimation in data streams in optimal space (DMK, JN, EP, DPW), pp. 745–754.
CIAA-2011-JezM #automaton #performance: Computing All ℓ-Cover Automata Fast (AJ, AM), pp. 203–214.
ICALP-v2-2011-ChanN #convergence #network #performance: Fast Convergence for Consensus in Dynamic Networks (THHC, LN), pp. 514–525.
CHI-2011-AmershiLKMC #named #network #performance: CueT: human-guided fast and accurate network alarm triage (SA, BL, AK, RM, BC), pp. 157–166.
CHI-2011-BrumbyDJG #how #performance: Fast or safe?: how performance objectives determine modality output choices while interacting on the move (DPB, SCED, CPJ, JJG), pp. 473–482.
CHI-2011-MarshallB #case study #experience #interactive #performance #using: Using fast interaction to create intense experiences (JM, SB), pp. 1255–1264.
HCI-DDA-2011-XuZC #algorithm #image #performance: High-Quality Fast Image Upsampling Algorithm Based on CUDA (QX, XZ, JC), pp. 677–683.
CIKM-2011-SchifanellaCS #composition #multi #performance: Fast metadata-driven multiresolution tensor decomposition (CS, KSC, MLS), pp. 1275–1284.
CIKM-2011-TariqK #feature model #performance: Fast supervised feature extraction by term discrimination information pooling (AT, AK), pp. 2233–2236.
CIKM-2011-TretyakovAGVD #estimation #graph #performance #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-WahabzadaKPB #performance #scheduling: More influence means less work: fast latent dirichlet allocation by influence scheduling (MW, KK, AP, CB), pp. 2273–2276.
CIKM-2011-XuSPZ #kernel #named #performance: TAKES: a fast method to select features in the kernel space (YX, FS, WP, JZ), pp. 683–692.
ICML-2011-Cuturi #kernel #performance: Fast Global Alignment Kernels (MC), pp. 929–936.
ICML-2011-JimenezS #performance: Fast Newton-type Methods for Total Variation Regularization (ÁBJ, SS), pp. 313–320.
ICML-2011-OrabonaL #algorithm #kernel #learning #multi #optimisation: Ultra-Fast Optimization Algorithm for Sparse Multi Kernel Learning (FO, JL), pp. 249–256.
KDD-2011-AoyamaSSU #approximate #graph #performance #similarity: Fast approximate similarity search based on degree-reduced neighborhood graphs (KA, KS, HS, NU), pp. 1055–1063.
KDD-2011-DasguptaKS #performance: Fast locality-sensitive hashing (AD, RK, TS), pp. 1073–1081.
KDD-2011-EneIM #clustering #performance #pipes and filters #using: Fast clustering using MapReduce (AE, SI, BM), pp. 681–689.
KDD-2011-HsiehD #coordination #matrix #performance: Fast coordinate descent methods with variable selection for non-negative matrix factorization (CJH, ISD), pp. 1064–1072.
KDD-2011-ZhangLWGZG #data type #modelling #performance #predict: Enabling fast prediction for ensemble models on data streams (PZ, JL, PW, BJG, XZ, LG), pp. 177–185.
KDIR-2011-Vanetik #algorithm #graph #mining #performance: A Fast Algorithm for Mining Graphs of Prescribed Connectivity (NV), pp. 5–13.
SIGIR-2011-RendleGFS #performance #recommendation: Fast context-aware recommendations with factorization machines (SR, ZG, CF, LST), pp. 635–644.
SAC-2011-BiancoGH #approach #manycore #parallel #performance: A fast approach for parallel deduplication on multicore processors (GDB, RdMG, CAH), pp. 1027–1032.
SAC-2011-ZhangWAWLL #performance #using: Fast lists intersection with Bloom filter using graphics processing units (FZ, DW, NA, GW, XL, JL), pp. 825–826.
ICSE-2011-SumnerBZP #analysis #nondeterminism #performance: Coalescing executions for fast uncertainty analysis (WNS, TB, XZ, SP), pp. 581–590.
ASPLOS-2011-CoburnCAGGJS #named #performance #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.
HPCA-2011-BrownPT #concurrent #migration #performance #predict #set #thread: Fast thread migration via cache working set prediction (JAB, LP, DMT), pp. 193–204.
HPCA-2011-JoshiZL #energy #memory management #multi #named #performance: Mercury: A fast and energy-efficient multi-level cell based Phase Change Memory system (MJ, WZ, TL), pp. 345–356.
HPCA-2011-SmullenMNGS #energy #performance: Relaxing non-volatility for fast and energy-efficient STT-RAM caches (CWSI, VM, AN, SG, MRS), pp. 50–61.
PPoPP-2011-DotsenkoBLG #fourier #performance: Auto-tuning of fast fourier transform on graphics processors (YD, SSB, BL, NKG), pp. 257–266.
SOSP-2011-OngaroRSOR #performance: Fast crash recovery in RAMCloud (DO, SMR, RS, JKO, MR), pp. 29–41.
ISSTA-2011-GligoricMK #code generation #named #performance: CoDeSe: fast deserialization via code generation (MG, DM, SK), pp. 298–308.
RTA-2011-ConchinhaBC #deduction #equivalence #named #performance: FAST: An Efficient Decision Procedure for Deduction and Static Equivalence (BC, DAB, CC), pp. 11–20.
CASE-2010-ChenPWBC #modelling #performance: Modeling and control of a fast steering mirror in imaging applications (NC, BP, JTW, SB, AC), pp. 27–32.
DAC-2010-HaquePJP #approach #embedded #named #performance #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-ShihC #independence #performance #synthesis: Fast timing-model independent buffered clock-tree synthesis (XWS, YWC), pp. 80–85.
DAC-2010-WangCW #identification #performance: Fast identification of operating current for toggle MRAM by spiral search (SHW, CYC, CWW), pp. 923–928.
DATE-2010-HaquePJP #approach #embedded #named #performance #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-Scholzel #detection #fault #performance: HW/SW co-detection of transient and permanent faults with fast recovery in statically scheduled data paths (MS), pp. 723–728.
DATE-2010-TieDWC #performance #reduction #scheduling: Dual-Vth leakage reduction with Fast Clock Skew Scheduling Enhancement (MT, HD, TW, XC), pp. 520–525.
DATE-2010-WatanabeA #modelling #multi #performance #simulation: Equivalent circuit modeling of multilayered power/ground planes for fast transient simulation (TW, HA), pp. 1153–1158.
PODS-2010-NelsonW #data type #performance #sketching: Fast Manhattan sketches in data streams (JN, DPW), pp. 99–110.
SIGMOD-2010-KimCSSNKLBD #architecture #named #performance: 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-MueenNL #approximate #correlation #performance: Fast approximate correlation for massive time-series data (AM, SN, JL), pp. 171–182.
SIGMOD-2010-SatishKCNLKD #performance: Fast sort on CPUs and GPUs: a case for bandwidth oblivious SIMD sort (NS, CK, JC, ADN, VWL, DK, PD), pp. 351–362.
VLDB-2010-GrimsmoBH #performance: Fast Optimal Twig Joins (NG, TAB, MLH), pp. 894–905.
VLDB-2010-KandhanTP #multi #named #pattern matching #performance #scalability: SigMatch: Fast and Scalable Multi-Pattern Matching (RK, NT, JMP), pp. 1173–1184.
VLDB-2010-McConnellPH #approach #named #performance #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 #performance #query #rdf: x-RDF-3X: Fast Querying, High Update Rates, and Consistency for RDF Databases (TN, GW), pp. 256–263.
VLDB-2011-BahmaniCG10 #incremental #performance #personalisation #rank: Fast Incremental and Personalized PageRank (BB, AC, AG), pp. 173–184.
ICSM-2010-Letarte #interprocedural #model checking #performance #static analysis: Conversion of fast inter-procedural static analysis to model checking (DL), pp. 1–2.
CIAA-2010-Maletti #fault #performance: Better Hyper-minimization — Not as Fast, But Fewer Errors (AM), pp. 201–210.
DLT-2010-Okhotin #algorithm #boolean grammar #parsing #performance: Fast Parsing for Boolean Grammars: A Generalization of Valiant’s Algorithm (AO), pp. 340–351.
LATA-2010-Arslan #algorithm #performance #sequence #string: A Fast Longest Common Subsequence Algorithm for Similar Strings (ANA), pp. 82–93.
CHI-2010-Li #gesture #named #performance: Protractor: a fast and accurate gesture recognizer (YL), pp. 2169–2172.
CHI-2010-VertanenM #performance #speech #using: Speech dasher: fast writing using speech and gaze (KV, DJCM), pp. 595–598.
CIKM-2010-CartrightALM #approximate #modelling #performance #query #using: Fast query expansion using approximations of relevance models (MAC, JA, VL, AM), pp. 1573–1576.
CIKM-2010-GaoQJWY #graph #performance: Fast top-k simple shortest paths discovery in graphs (JG, HQ, XJ, TW, DY), pp. 509–518.
CIKM-2010-GuanXZGY #analysis #classification #documentation #performance #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 #performance #scalability: Fast and accurate estimation of shortest paths in large graphs (AG, SJB, SS, GW), pp. 499–508.
CIKM-2010-SilvestriV #encoding #integer #named #performance #programming: VSEncoding: efficient coding and fast decoding of integer lists via dynamic programming (FS, RV), pp. 1219–1228.
ICML-2010-Busa-FeketeK #performance #using: Fast boosting using adversarial bandits (RBF, BK), pp. 143–150.
ICML-2010-CostaG #distance #kernel #performance: Fast Neighborhood Subgraph Pairwise Distance Kernel (FC, KDG), pp. 255–262.
ICML-2010-GregorL #approximate #learning #performance: Learning Fast Approximations of Sparse Coding (KG, YL), pp. 399–406.
ICML-2010-McAuleyC #performance: Exploiting Data-Independence for Fast Belief-Propagation (JJM, TSC), pp. 767–774.
ICML-2010-RouxF #performance: A fast natural Newton method (NLR, AWF), pp. 623–630.
ICML-2010-TomiokaSSK #algorithm #learning #matrix #performance #rank: A Fast Augmented Lagrangian Algorithm for Learning Low-Rank Matrices (RT, TS, MS, HK), pp. 1087–1094.
ICPR-2010-BauerEOBKFHN #approach #bound #estimation #graph #performance #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-Coeurjolly #approximate #performance: Fast and Accurate Approximation of the Euclidean Opening Function in Arbitrary Dimension (DC), pp. 229–232.
ICPR-2010-EudesLND #integration #performance #visual notation: Fast Odometry Integration in Local Bundle Adjustment-Based Visual SLAM (AE, ML, SNC, MD), pp. 290–293.
ICPR-2010-FefilatyevGL #image #performance: Tracking Ships from Fast Moving Camera through Image Registration (SF, DBG, CL), pp. 3500–3503.
ICPR-2010-FrohlichRD #approach #image #performance: A Fast Approach for Pixelwise Labeling of Facade Images (BF, ER, JD), pp. 3029–3032.
ICPR-2010-GranaBC #algorithm #performance: Decision Trees for Fast Thinning Algorithms (CG, DB, RC), pp. 2836–2839.
ICPR-2010-HiraiUK #performance #realtime: Real-Time Pose Regression with Fast Volume Descriptor Computation (MH, NU, MK), pp. 1852–1855.
ICPR-2010-IwahoriIWKFK #performance: 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 #performance #using: Fast and Spatially-Smooth Terrain Classification Using Monocular Camera (CJ, KMK, CVJ), pp. 4060–4063.
ICPR-2010-KonyaES #detection #documentation #image #performance: Fast Seamless Skew and Orientation Detection in Document Images (IVK, SE, CS), pp. 1924–1928.
ICPR-2010-Lian #detection #performance #retrieval: Fast Fingerprint Retrieval with Line Detection (HCL), pp. 3151–3154.
ICPR-2010-LiSN #detection #documentation #image #performance #recognition: Fast Logo Detection and Recognition in Document Images (ZL, MSA, MN), pp. 2716–2719.
ICPR-2010-LiuZYL #hybrid #image #performance: A Fast Image Inpainting Method Based on Hybrid Similarity-Distance (JL, SZ, WY, HL), pp. 4432–4435.
ICPR-2010-MicoO #algorithm #constant #nearest neighbour #performance: A Constant Average Time Algorithm to Allow Insertions in the LAESA Fast Nearest Neighbour Search Index (LM, JO), pp. 3911–3914.
ICPR-2010-NasonovK #performance #using: Fast Super-Resolution Using Weighted Median Filtering (AVN, ASK), pp. 2230–2233.
ICPR-2010-NguyenAC #approach #locality #performance: Unifying Approach for Fast License Plate Localization and Super-Resolution (CDN, MA, LC), pp. 376–379.
ICPR-2010-QiuPVLL #performance #recognition #representation #robust: A Fast Extension for Sparse Representation on Robust Face Recognition (HQ, DSP, SV, WL, JHL), pp. 1023–1027.
ICPR-2010-SeppkeDHW #equation #multi #parametricity #performance #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 #performance #recognition: A Novel Shape Feature for Fast Region-Based Pedestrian Recognition (AS, DG, JMF), pp. 444–447.
ICPR-2010-ShibataKI #classification #nearest neighbour #performance #scalability: Large Margin Discriminant Hashing for Fast k-Nearest Neighbor Classification (TS, SK, SI), pp. 1015–1018.
ICPR-2010-VajdaF #network #performance: Exploring Pattern Selection Strategies for Fast Neural Network Training (SV, GAF), pp. 2913–2916.
ICPR-2010-WijnhovenW #detection #performance #probability #using: Fast Training of Object Detection Using Stochastic Gradient Descent (RGJW, PHNdW), pp. 424–427.
ICPR-2010-YangK #feature model #fourier #performance: Fast Polar and Spherical Fourier Descriptors for Feature Extraction (ZY, SiK), pp. 975–978.
ICPR-2010-ZouH #3d #performance #using: Recovering 3D Shape Using an Improved Fast Marching Method (CZ, ERH), pp. 1678–1681.
KDD-2010-AgarwalCE #learning #online #performance #recommendation: Fast online learning through offline initialization for time-sensitive recommendation (DA, BCC, PE), pp. 703–712.
KDD-2010-LaoC #execution #modelling #performance #query #random #retrieval: Fast query execution for retrieval models based on path-constrained random walks (NL, WWC), pp. 881–888.
KDD-2010-MarchRG #algorithm #analysis #performance: Fast euclidean minimum spanning tree: algorithm, analysis, and applications (WBM, PR, AGG), pp. 603–612.
KDD-2010-SarkarM #graph #nearest neighbour #performance: Fast nearest-neighbor search in disk-resident graphs (PS, AWM), pp. 513–522.
KDD-2010-ZhuLX #feature model #incremental #learning #markov #named #performance #random: Grafting-light: fast, incremental feature selection and structure learning of Markov random fields (JZ, NL, EPX), pp. 303–312.
RecSys-2010-PilaszyZT #dataset #feedback #matrix #performance: Fast als-based matrix factorization for explicit and implicit feedback datasets (IP, DZ, DT), pp. 71–78.
SEKE-2010-AbuzeidHT #algorithm #performance #reduction #testing: FLAT A Fast Lattice-Based Algorithm for Test Suite Reduction (ARA, HSH, IAHT), p. 67.
SIGIR-2010-ZhangWCL #performance #self #similarity: Self-taught hashing for fast similarity search (DZ, JW, DC, JL), pp. 18–25.
SAC-2010-AhmedLSH #identification #performance: Fast file-type identification (IA, KsL, HS, MH), pp. 1601–1602.
SAC-2010-AnastasiadisSP #detection #multi #performance: A fast multiplier-less edge detection accelerator for FPGAs (NA, IS, KZP), pp. 510–515.
SAC-2010-MarascuML #approximate #performance #set #streaming: A fast approximation strategy for summarizing a set of streaming time series (AM, FM, YL), pp. 1617–1621.
SAC-2010-SchiperP #algorithm #flexibility #multi #performance: Fast, flexible, and highly resilient genuine fifo and causal multicast algorithms (NS, FP), pp. 418–422.
HPDC-2010-DonassoloCLV #performance #scalability #simulation #using #volunteer: Fast and scalable simulation of volunteer computing systems using SimGrid (BD, HC, AL, PV), pp. 605–612.
HPDC-2010-McConnellPH #performance #reliability #replication: Detouring and replication for fast and reliable internet-scale stream processing (CM, FP, JHH), pp. 737–745.
OSDI-2010-PowerL #distributed #named #performance #source code: Piccolo: Building Fast, Distributed Programs with Partitioned Tables (RP, JL), pp. 293–306.
PPoPP-2010-ZhangCO #gpu #performance: Fast tridiagonal solvers on the GPU (YZ, JC, JDO), pp. 127–136.
CAV-2010-BozgaIK #performance: Fast Acceleration of Ultimately Periodic Relations (MB, RI, FK), pp. 227–242.
CASE-2009-MattosC #performance #precise #visual notation: A fast and precise micropipette positioning system based on continuous camera-robot recalibration and visual servoing (LSM, DGC), pp. 609–614.
DAC-2009-GhaniN #approximate #grid #performance #power management #using #verification: Fast vectorless power grid verification using an approximate inverse technique (NHAG, FNN), pp. 184–189.
DAC-2009-LiuH #optimisation #parallel #performance: GPU-based parallelization for fast circuit optimization (YL, JH), pp. 943–946.
DAC-2009-ShiCHMTHW #analysis #gpu #grid #network #performance #power management: GPU friendly fast Poisson solver for structured power grid network analysis (JS, YC, WH, LM, SXDT, PHH, XW), pp. 178–183.
DATE-2009-KahngLPS #design #performance: 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-MollCRB #modelling #performance #protocol #using: Fast and accurate protocol specific bus modeling using TLM 2.0 (HWMvM, HC, VR, MB), pp. 316–319.
ICDAR-2009-AlmaksourA #incremental #learning #online #performance #recognition: Fast Incremental Learning Strategy Driven by Confusion Reject for Online Handwriting Recognition (AA, ÉA), pp. 81–85.
SIGMOD-2009-ChenOG #performance #using: Fast and dynamic OLAP exploration using UDFs (ZC, CO, CGA), pp. 1087–1090.
VLDB-2009-KimSCKNBLSD #implementation #manycore #performance: 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-WillhalmPBPZS #in memory #named #performance #using: SIMD-Scan: Ultra Fast in-Memory Table Scan using on-Chip Vector Processing Units (TW, NP, YB, HP, AZ, JS), pp. 385–394.
PLDI-2009-FlanaganF #concurrent #detection #named #performance #precise: FastTrack: efficient and precise dynamic race detection (CF, SNF), pp. 121–133.
STOC-2009-NguyenDT #algorithm #approximate #matrix #performance #rank: A fast and efficient algorithm for low-rank approximation of a matrix (NHN, TTD, TDT), pp. 215–224.
ICALP-v1-2009-AlonLS #performance: Fast FAST (NA, DL, SS), pp. 49–58.
ICALP-v1-2009-BorosM #algorithm #parallel #performance #problem: A Fast and Simple Parallel Algorithm for the Monotone Duality Problem (EB, KM), pp. 183–194.
ICALP-v1-2009-Nederlof #algorithm #performance #problem #using: Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems (JN), pp. 713–725.
CHI-2009-ChengLCC #named #video: SmartPlayer: user-centric video fast-forwarding (KYC, SJL, BYC, HHC), pp. 789–798.
CHI-2009-MajarantaAS #performance #type system: Fast gaze typing with an adjustable dwell time (PM, UKA, OS), pp. 357–360.
DHM-2009-ChouvardaM #performance #simulation: Hyperkalemia vs. Ischemia Effects in Fast or Unstable Pacing: A Cardiac Simulation Study (IC, NM), pp. 492–501.
HCD-2009-Blasko-DrabikBB #game studies #physics #testing #usability: Combining Fast-Paced Usability and Scientific Testing to Improve the Lunar Quest Physics Game (HBD, JB, CAB), pp. 23–26.
IDGD-2009-Ellis #case study: A Case Study in Community-Driven Translation of a Fast-Changing Website (DE), pp. 236–244.
ICEIS-J-2009-ChangS #analysis #classification #performance: Fast Unsupervised Classification for Handwritten Stroke Analysis (WDC, JS), pp. 918–927.
CIKM-2009-HalimKY #effectiveness #performance: Fast and effective histogram construction (FH, PK, RHCY), pp. 1167–1176.
CIKM-2009-LaberSJACRTV #performance: 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-PotamiasBCG #distance #estimation #network #performance #scalability: Fast shortest path distance estimation in large networks (MP, FB, CC, AG), pp. 867–876.
CIKM-2009-TongQJF #graph #interactive #named #performance #proximity #query: iPoG: fast interactive proximity querying on graphs (HT, HQ, HJ, CF), pp. 1673–1676.
ICML-2009-GiesekePK #clustering #performance: Fast evolutionary maximum margin clustering (FG, TP, OK), pp. 361–368.
ICML-2009-SuttonMPBSSW #approximate #learning #linear #performance: 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 #performance #persistent #using: Using fast weights to improve persistent contrastive divergence (TT, GEH), pp. 1033–1040.
KDD-2009-WuSJRG #detection #framework #performance: A LRT framework for fast spatial anomaly detection (MW, XS, CJ, SR, JG), pp. 887–896.
KDD-2009-YanHJ #approximate #clustering #performance: Fast approximate spectral clustering (DY, LH, MIJ), pp. 907–916.
MLDM-2009-SakaiI #clustering #performance #random: Fast Spectral Clustering with Random Projection and Sampling (TS, AI), pp. 372–384.
MLDM-2009-SegataB #dataset #performance #scalability: Fast Local Support Vector Machines for Large Datasets (NS, EB), pp. 295–310.
SIGIR-2009-YuZLG #collaboration #matrix #parametricity #performance #scalability: Fast nonparametric matrix factorization for large-scale collaborative filtering (KY, SZ, JDL, YG), pp. 211–218.
TOOLS-EUROPE-2009-KnorreckAP #design #performance #simulation: Fast Simulation Techniques for Design Space Exploration (DK, LA, RP), pp. 308–327.
GPCE-2009-NedunuriC #performance #problem #source code #synthesis: Synthesis of fast programs for maximum segment sum problems (SN, WRC), pp. 117–126.
SAC-2009-CelikikB #performance #scalability: Fast error-tolerant search on very large texts (MC, HB), pp. 1724–1731.
SAC-2009-EirakuSPKK #network #performance #virtual machine: Fast networking with socket-outsourcing in hosted virtual machine environments (HE, YS, CP, YK, KK), pp. 310–317.
SAC-2009-GohKCC #analysis #performance #scalability #video: Fast mode decision for scalable video coding based on neighboring macroblock analysis (GG, JK, MC, KC), pp. 1845–1846.
SAC-2009-KiyoharaMMNK #embedded #performance: Method for fast compression of program codes for remote updates in embedded systems (RK, SM, MM, MN, SK), pp. 1683–1684.
SAC-2009-LandZEL #enterprise #integration #ontology #performance #towards: Towards a fast enterprise ontology based method for post merger integration (MOL, HZ, PE, QL), pp. 245–252.
SAC-2009-SharyginaTT #abstraction #performance #precise #verification: The synergy of precise and fast abstractions for program verification (NS, ST, AT), pp. 566–573.
ASPLOS-2009-CaulfieldGS #clustering #data-driven #memory management #named #performance #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 #performance: TwinDrivers: semi-automatic derivation of fast and safe hypervisor network drivers from guest OS drivers (AM, SS, WZ), pp. 301–312.
CGO-2009-CordesFM #abstract interpretation #analysis #modelling #performance #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-KelseyBDZ #optimisation #performance: Fast Track: A Software System for Speculative Program Optimization (KK, TB, CD, CZ), pp. 157–168.
HPCA-2009-ChenLHCSWP #consistency #memory management #performance #verification: Fast complete memory consistency verification (YC, YL, WH, TC, HS, PW, HP), pp. 381–392.
HPCA-2009-DuanLP #architecture #estimation #metric #performance #predict: Versatile prediction and fast estimation of Architectural Vulnerability Factor from processor performance metrics (LD, BL, LP), pp. 129–140.
SOSP-2009-AndersenFKPTV #array #named #performance: FAWN: a fast array of wimpy nodes (DGA, JF, MK, AP, LT, VV), pp. 1–14.
SOSP-2009-CastroCMPADBB #fault #performance: Fast byte-granularity software fault isolation (MC, MC, JPM, MP, PA, AD, PB, RB), pp. 45–58.
DAC-2008-GargNK #design #performance: A fast, analytical estimator for the SEU-induced pulse width in combinational designs (RG, CN, SPK), pp. 918–923.
DAC-2008-RajaVBG #analysis #modelling #performance: Transistor level gate modeling for accurate and fast timing, noise, and power analysis (SR, FV, MRB, JG), pp. 456–461.
DATE-2008-FangH #algorithm #approximate #performance #satisfiability: A Fast Approximation Algorithm for MIN-ONE SAT (LF, MSH), pp. 1087–1090.
DATE-2008-KangK #design #framework #machine learning #manycore #named #optimisation #performance: Magellan: A Search and Machine Learning-based Framework for Fast Multi-core Design Space Exploration and Optimization (SK, RK), pp. 1432–1437.
DATE-2008-PradhanV #performance #synthesis #using: Fast Analog Circuit Synthesis Using Sensitivity Based Near Neighbor Searches (AP, RV), pp. 523–526.
DocEng-2008-ValleCP #documentation #identification #performance #using #visual notation: Fast identification of visual documents using local descriptors (EV, MC, SPF), pp. 173–176.
SIGMOD-2008-PanZW #clustering #composition #dataset #matrix #named #performance #scalability: CRD: fast co-clustering on large datasets utilizing sampling-based matrix decomposition (FP, XZ, WW), pp. 173–184.
SIGMOD-2008-SinhaPMT #array #locality #pattern matching #performance: Improving suffix array locality for fast pattern matching on disk (RS, SJP, AM, AT), pp. 661–672.
ESOP-2008-Muller-OlmS #interprocedural #performance: Upper Adjoints for Fast Inter-procedural Variable Equalities (MMO, HS), pp. 178–192.
TACAS-2008-KupferschmidHL #abstraction #model checking #performance: Fast Directed Model Checking Via Russian Doll Abstraction (SK, JH, KGL), pp. 203–217.
TACAS-2008-Moskal #proving #smt: Rocket-Fast Proof Checking for SMT Solvers (MM), pp. 486–500.
SCAM-2008-LundbergGL #analysis #performance #points-to #precise: Fast and Precise Points-to Analysis (JL, TG, WL), pp. 133–142.
PLDI-2008-BlackburnM #garbage collection #named #performance: Immix: a mark-region garbage collector with space efficiency, fast collection, and mutator performance (SMB, KSM), pp. 22–32.
STOC-2008-ColeF #algorithm #problem: Fast-converging tatonnement algorithms for one-time and ongoing market problems (RC, LF), pp. 315–324.
STOC-2008-DeKSS #composition #integer #multi #performance #using: Fast integer multiplication using modular arithmetic (AD, PPK, CS, RS), pp. 499–506.
STOC-2008-Umans #composition #performance #polynomial: Fast polynomial factorization and modular composition in small characteristic (CU), pp. 481–490.
ICALP-A-2008-AvinKL #evolution #graph #how #random: How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs) (CA, MK, ZL), pp. 121–132.
ICALP-A-2008-Plaxton #performance #scheduling: Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines (CGP), pp. 222–233.
ICALP-A-2008-Pritchard #distributed #performance #random: Fast Distributed Computation of Cuts Via Random Circulations (DP), pp. 145–160.
SEFM-2008-PhamTTC #algorithm #bound #java #memory management #performance: A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets (THP, AHT, NTT, WNC), pp. 259–267.
AdaEurope-2008-Evequoz #concurrent #performance #using #word: Practical, Fast and Simple Concurrent FIFO Queues Using Single Word Synchronization Primitives (CE), pp. 59–72.
AdaEurope-2008-FahmyRJ #performance #realtime #scheduling #thread: Fast Scheduling of Distributable Real-Time Threads with Assured End-to-End Timeliness (SFF, BR, EDJ), pp. 211–225.
CIKM-2008-FormanK #classification #feature model #performance: Extremely fast text feature extraction for classification and indexing (GF, EK), pp. 1221–1230.
CIKM-2008-LinL #clique #mining #performance: Fast spatial co-location mining without cliqueness checking (ZL, SL), pp. 1461–1462.
CIKM-2008-NguyenS #analysis #correlation #dataset #performance: Fast correlation analysis on time series datasets (PN, NS), pp. 787–796.
CIKM-2008-SongZG #classification #framework #performance #process: A sparse gaussian processes classification framework for fast tag suggestions (YS, LZ, CLG), pp. 93–102.
CIKM-2008-TongSEF #mining #performance: Fast mining of complex time-stamped events (HT, YS, TER, CF), pp. 759–768.
ICML-2008-CatanzaroSK #classification #performance: Fast support vector machine training and classification on graphics processors (BCC, NS, KK), pp. 104–111.
ICML-2008-Cayton #nearest neighbour #performance #retrieval: Fast nearest neighbor retrieval for bregman divergences (LC), pp. 112–119.
ICML-2008-CunninghamSS #estimation #performance #process: Fast Gaussian process methods for point process intensity estimation (JPC, KVS, MS), pp. 192–199.
ICML-2008-KuzelkaZ #estimation #first-order #performance: Fast estimation of first-order clause coverage through randomization and maximum likelihood (OK, FZ), pp. 504–511.
ICML-2008-SarkarMP #graph #incremental #performance #proximity #scalability: Fast incremental proximity search in large graphs (PS, AWM, AP), pp. 896–903.
ICML-2008-WeinbergerS #distance #implementation #learning #metric #performance: Fast solvers and efficient implementations for distance metric learning (KQW, LKS), pp. 1160–1167.
ICPR-2008-BrasnettB #identification #image #performance #robust: Fast and robust image identification (PB, MB), pp. 1–5.
ICPR-2008-FilipH #performance #segmentation #sequence #video: Fast and reliablePCA-based temporal segmentation of video sequences (JF, MH), pp. 1–4.
ICPR-2008-FuR #learning #multi #performance: Fast multiple instance learning via L1, 2 logistic regression (ZF, ARK), pp. 1–4.
ICPR-2008-FuR08a #approach #image #performance #segmentation: A fast hierarchical approach to image segmentation (ZF, ARK), pp. 1–4.
ICPR-2008-GorisseCPP #approximate #image #kernel #performance #retrieval #similarity: Fast approximate kernel-based similarity search for image retrieval task (DG, MC, FP, SPF), pp. 1–4.
ICPR-2008-IwahoriNWFK #performance #self: Shape from self-calibration and Fast Marching Method (YI, TN, RJW, SF, HK), pp. 1–4.
ICPR-2008-KauffmannP #automaton #gpu: Cellular automaton for ultra-fast watershed transform on GPU (CK, NP), pp. 1–4.
ICPR-2008-KuksaHP #detection #kernel #performance: Fast protein homology and fold detection with sparse spatial sample kernels (PPK, PHH, VP), pp. 1–4.
ICPR-2008-LeeWN #detection #performance #using: Very fast ellipse detection using GPU-based RHT (JKL, BAW, TSN), pp. 1–4.
ICPR-2008-LiZ #algorithm #fixpoint #matrix #named #performance: FastNMF: A fast monotonic fixed-point non-negative Matrix Factorization algorithm with high ease of use (LL, YJZ), pp. 1–4.
ICPR-2008-Lu #performance: Markerless human motion capture: An application of simulated annealing and Fast Marching Method (YL), pp. 1–4.
ICPR-2008-MollerPF #multi #performance #reliability: Calibration-free camera hand-over for fast and reliable person tracking in multi-camera setups (BM, TP, GAF), pp. 1–4.
ICPR-2008-TauberRLCDO #automation #image #multi #performance #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-TiernyVD #3d #performance #precise: Fast and precise kinematic skeleton extraction of 3D dynamic meshes (JT, JPV, MD), pp. 1–4.
ICPR-2008-WangQ #3d #correlation #performance #recognition: 3D object recognition by fast spherical correlation between combined view EGIs and PFT (DW, HQ), pp. 1–4.
ICPR-2008-WatanabeIHY #algorithm #performance #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-YuanDZ #image #performance #re-engineering: Fast super-resolution for license plate image reconstruction (JY, SD, XZ), pp. 1–4.
ICPR-2008-YuS #classification #visual notation: FastWavelet-Based Visual Classification (GY, JJES), pp. 1–5.
KDD-2008-ChenW #classification #feature model #metric #named #performance #problem: FAST: a roc-based feature selection metric for small samples and imbalanced data classification problems (XwC, MW), pp. 124–132.
KDD-2008-IfrimBW #categorisation #n-gram #performance: Fast logistic regression for text categorization with variable-length n-grams (GI, GHB, GW), pp. 354–362.
KDD-2008-PorteousNIASW #performance: Fast collapsed gibbs sampling for latent dirichlet allocation (IP, DN, ATI, AUA, PS, MW), pp. 569–577.
KDD-2008-TongPSYF #graph #mining #named #performance #scalability: Colibri: fast mining of large static and dynamic graphs (HT, SP, JS, PSY, CF), pp. 686–694.
KDD-2008-ZhaoWZ #algorithm #named #performance #virtual machine: Cuts3vm: a fast semi-supervised svm algorithm (BZ, FW, CZ), pp. 830–838.
LOPSTR-2008-LeuschelV #logic programming #partial evaluation #performance #scalability #source code: Fast Offline Partial Evaluation of Large Logic Programs (ML, GV), pp. 119–134.
SAC-2008-BealBVT #performance #self: Fast self-healing gradients (JB, JB, DV, MT), pp. 1969–1975.
SAC-2008-YuB #detection #effectiveness #multi #performance: A fast and effective method to detect multiple least significant bits steganography (XY, NB), pp. 1443–1447.
CGO-2008-BoissinotHGDR #liveness #performance #source code: Fast liveness checking for ssa-form programs (BB, SH, DG, BDdD, FR), pp. 35–44.
HPCA-2008-KimGWB #analysis #performance #using: System level analysis of fast, per-core DVFS using on-chip switching regulators (WK, MSG, GYW, DMB), pp. 123–134.
LCTES-2008-LeeKJKEKH #architecture #embedded #named #performance: FaCSim: a fast and cycle-accurate architecture simulator for embedded systems (JL, JK, CJ, SK, BE, KK, SH), pp. 89–100.
PPoPP-2008-GiacomoniMV #concurrent #parallel #performance #pipes and filters #queue: FastForward for efficient pipeline parallelism: a cache-optimized concurrent lock-free queue (JG, TM, MV), pp. 43–52.
SAT-2008-MaarenW #performance: Finding Guaranteed MUSes Fast (HvM, SW), pp. 291–304.
CASE-2007-FontanelliRS #algorithm #locality #metric #performance #using: A Fast RANSAC-Based Registration Algorithm for Accurate Localization in Unknown Environments using LIDAR Measurements (DF, LR, SS), pp. 597–602.
DAC-2007-ChenZ #performance #process: Fast Min-Cost Buffer Insertion under Process Variations (RC, HZ), pp. 338–343.
DAC-2007-FengLZ #analysis #higher-order #parametricity #performance #reduction #statistics #using: Fast Second-Order Statistical Static Timing Analysis Using Parameter Dimension Reduction (ZF, PL, YZ), pp. 244–249.
DAC-2007-KimJH #estimation #monte carlo #performance: Fast, Non-Monte-Carlo Estimation of Transient Performance Variation Due to Device Mismatch (JK, KDJ, MAH), pp. 440–443.
DAC-2007-YeZL #optimisation #performance #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 #performance #using: Fast Capacitance Extraction in Multilayer, Conformal and Embedded Dielectric using Hybrid Boundary Element Method (NYZ, ZL, WS), pp. 835–840.
DATE-2007-ChenZLC #analysis #performance #statistics: Fast statistical circuit analysis with finite-point based transistor model (MC, WZ, FL, YC), pp. 1391–1396.
DATE-2007-DAscoliIMMTFGRM #performance #prototype: Low-g accelerometer fast prototyping for automotive applications (FD, FI, CM, MM, MT, LF, AG, AR, MDM), pp. 486–491.
DATE-2007-HuVKCP #dependence #estimation #memory management #performance: Fast memory footprint estimation based on maximal dependency vector calculation (QH, AV, PGK, FC, MP), pp. 379–384.
DATE-2007-MoselhyHD #3d #performance: pFFT in FastMaxwell: a fast impedance extraction solver for 3D conductor structures over substrate (TM, XH, LD), pp. 1194–1199.
DATE-2007-SingheeR #monte carlo #novel #performance #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 #performance: Fast and accurate routing demand estimation for efficient routability-driven placement (PS, FMJ), pp. 1226–1231.
DATE-2007-Wong #equation #performance #symmetry #using: Fast positive-real balanced truncation of symmetric systems using cross Riccati equations (NW), pp. 1496–1501.
ICDAR-2007-LiLT #keyword #performance: A Fast Keyword-Spotting Technique (LL, SJL, CLT), pp. 68–72.
ICDAR-2007-LuWT #detection #documentation #performance: Fast and Accurate Detection of Document Skew and Orientation (SJL, JW, CLT), pp. 684–688.
ICDAR-2007-SchulzMM #performance #precise #set: Fast Selection of Small and Precise Candidate Sets from Dictionaries for Text Correction Tasks (KUS, SM, PM), pp. 471–475.
ICDAR-2007-WeinmanLH #performance #recognition: Fast Lexicon-Based Scene Text Recognition with Sparse Belief Propagation (JJW, EGLM, ARH), pp. 979–983.
SIGMOD-2007-BandiMAA #algorithm #data type #performance #using: Fast data stream algorithms using associative memories (NB, AM, DA, AEA), pp. 247–256.
SIGMOD-2007-TrisslL #graph #performance #query #scalability: Fast and practical indexing and querying of very large graphs (ST, UL), pp. 845–856.
VLDB-2007-GhinitaKKM #performance: Fast Data Anonymization with Low Information Loss (GG, PK, PK, NM), pp. 758–769.
VLDB-2007-LitwinMRS #algebra #performance #string #using: Fast nGram-Based String Search Over Data Encoded Using Algebraic Signatures (WL, RM, PR, TJES), pp. 207–218.
ITiCSE-2007-AdelmannBL #animation #framework #idea #interactive #named #performance #sketching: IDEA: a framework for the fast creation of interactive animations by pen sketching (RA, TB, TL), pp. 291–295.
ITiCSE-2007-RosslingKS #algorithm #animation #flexibility #generative #performance: Easy, fast, and flexible algorithm animation generation (GR, SK, SS), p. 357.
ICSM-2007-ArchuletaTF #architecture #composition #performance #sequence: A Maintainable Software Architecture for Fast and Modular Bioinformatics Sequence Search (JSA, ET, WcF), pp. 144–153.
SCAM-2007-MolinaS #approximate #open source #performance #source code #using: Fast Approximate Matching of Programs for Protecting Libre/Open Source Software by Using Spatial Indexes (AJMM, TS), pp. 111–122.
PLDI-2007-HardekopfL #analysis #performance #pointer: The ant and the grasshopper: fast and accurate pointer analysis for millions of lines of code (BH, CL), pp. 290–299.
SAS-2007-BanterleG #abstract domain #hardware #implementation #performance: A Fast Implementation of the Octagon Abstract Domain on Graphics Hardware (FB, RG), pp. 315–332.
STOC-2007-BjorklundHKK #fourier #performance #set: Fourier meets möbius: fast subset convolution (AB, TH, PK, MK), pp. 67–74.
STOC-2007-GilbertSTV #algorithm #performance #sketching: One sketch for all: fast algorithms for compressed sensing (ACG, MJS, JAT, RV), pp. 237–246.
LATA-2007-KutribM #automaton #performance #recognition #using: Fast Reversible Language Recognition Using Cellular Automata (MK, AM), pp. 331–342.
AGTIVE-2007-GeissK #graph grammar #performance: GrGen.NET: A Fast, Expressive, and General Purpose Graph Rewrite Tool (RG, MK), pp. 568–569.
CHI-2007-BiehlCSR #named #visual notation: FASTDash: a visual dashboard for fostering awareness in software teams (JTB, MC, GS, GGR), pp. 1313–1322.
DHM-2007-SongLM #algorithm #estimation #performance: A Fast Motion Estimation Algorithm for H.264 (JS, BL, QlM), pp. 189–196.
CIKM-2007-ChanZ #algorithm #evaluation #performance #query: A fast unified optimal route query evaluation algorithm (EPFC, JZ), pp. 371–380.
ECIR-2007-LiuYZQM #clustering #optimisation #performance #scalability: Fast Large-Scale Spectral Clustering by Sequential Shrinkage Optimization (TYL, HYY, XZ, TQ, WYM), pp. 319–330.
ICML-2007-EspositoR #algorithm #classification #evaluation #named #performance: CarpeDiem: an algorithm for the fast evaluation of SSL classifiers (RE, DPR), pp. 257–264.
ICML-2007-MoschittiZ #effectiveness #kernel #learning #performance #relational: Fast and effective kernels for relational learning from texts (AM, FMZ), pp. 649–656.
ICML-2007-YoganandaMG #linear #performance: A fast linear separability test by projection of positive points on subspaces (APY, MNM, LG), pp. 713–720.
KDD-2007-LaxmanSU #algorithm #performance: A fast algorithm for finding frequent episodes in event streams (SL, PSS, KPU), pp. 410–419.
KDD-2007-TongFGE #graph #pattern matching #performance #scalability: Fast best-effort pattern matching in large attributed graphs (HT, CF, BG, TER), pp. 737–746.
KDD-2007-TongFK #graph #mining #performance #proximity: Fast direction-aware proximity for graph mining (HT, CF, YK), pp. 747–756.
MLDM-2007-NgaiY: Fast-Maneuvering Target Seeking Based on Double-Action Q-Learning (DCKN, NHCY), pp. 653–666.
SIGIR-2007-TurpinTHW #generative #performance #web: Fast generation of result snippets in web search (AT, YT, DH, HEW), pp. 127–134.
SIGIR-2007-ZhangX #estimation #modelling #performance: Fast exact maximum likelihood estimation for mixture of language models (YZ, WX), pp. 865–866.
GPCE-2007-Puschel #education #library #performance #question: Can we teach computers to write fast libraries? (MP), pp. 1–2.
REFSQ-2007-Schneider #elicitation #feedback #generative #performance #requirements: Generating Fast Feedback in Requirements Elicitation (KS), pp. 160–174.
SAC-2007-CheliusFF #development #framework #named #network #performance: Worldsens: a fast and accurate development framework for sensor network applications (GC, AF, EF), pp. 222–226.
SAC-2007-HiserDW #design #embedded #memory management #performance: Fast, accurate design space exploration of embedded systems memory configurations (JH, JWD, DBW), pp. 699–706.
SAC-2007-LebbahMR #constraints #implementation #performance #reduction #using: Using constraint techniques for a safe and fast implementation of optimality-based reduction (YL, CM, MR), pp. 326–331.
SAC-2007-PigeauNG #approximate #image #performance: 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 #performance: A fast algorithm to binarize and filter documents with back-to-front interference (JMMdS, RDL), pp. 639–640.
GTTSE-2007-ChellappaFP #how #performance: How to Write Fast Numerical Code: A Small Introduction (SC, FF, MP), pp. 196–259.
CC-2007-GrundH #algorithm #performance: A Fast Cutting-Plane Algorithm for Optimal Coalescing (DG, SH), pp. 111–125.
HPDC-2007-ShiraiST #parallel #performance: A fast topology inference: a building block for network-aware parallel processing (TS, HS, KT), pp. 11–22.
ISMM-2007-Joisha #framework #garbage collection #performance: Overlooking roots: a framework for making nondeferred reference-counting garbage collection fast (PGJ), pp. 141–158.
CAV-2007-KahlonYSG #concurrent #detection #performance #source code: Fast and Accurate Static Data-Race Detection for Concurrent Programs (VK, YY, SS, AG), pp. 226–239.
LICS-2007-Escardo #infinity #performance #set: Infinite sets that admit fast exhaustive search (MHE), pp. 443–452.
RTA-2007-BoichutGJR #approximate #performance #prototype: Rewriting Approximations for Fast Prototyping of Static Analyzers (YB, TG, TPJ, LLR), pp. 48–62.
CASE-2006-ChengSOYII #performance #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-LiuWL #algorithm #performance #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-SunXZ #adaptation #correlation #performance #self: Self-adaptive Surge Adjustment based on Fast Correlation Integral Method in Centrifugal Compressors (TS, GX, CZ), pp. 661–666.
DAC-2006-AtienzaVPPBMM #framework #multi #performance: 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 #performance #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-HuAHKLSS #algorithm #performance: Fast algorithms for slew constrained minimum cost buffering (SH, CJA, JH, SKK, ZL, WS, CCNS), pp. 308–313.
DAC-2006-PeranandamNRWKR #bound #performance: Fast falsification based on symbolic bounded property checking (PMP, PKN, JR, RJW, TK, WR), pp. 1077–1082.
DAC-2006-VianaGKBV #configuration management #performance: Configurable cache subsetting for fast cache tuning (PV, AGR, EJK, EB, FV), pp. 695–700.
DAC-2006-VimjamH #identification #induction #performance #satisfiability: Fast illegal state identification for improving SAT-based induction (VCV, MSH), pp. 241–246.
DAC-2006-WongC #matrix #performance: 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 #performance #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 #performance #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-Beutel #framework #prototype #using: Fast-prototyping using the BTnode platform (JB), pp. 977–982.
DATE-2006-McConaghyG #canonical #modelling #performance: 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-ParkESNDP #automation #embedded #generative #performance: Automatic generation of operation tables for fast exploration of bypasses in embedded processors (SP, EE, AS, AN, ND, YP), pp. 1197–1202.
DATE-DF-2006-ChengL #multi: A fast-lock mixed-mode DLL with wide-range operation and multiphase outputs (KHC, YLL), pp. 178–182.
DATE-DF-2006-DumitrascuBPBJ #flexibility #framework #performance: 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 #performance: Automated conversion from a LUT-based FPGA to a LUT-based MPGA with fast turnaround time (FJV, MS, HJP), pp. 36–41.
DocEng-2006-LindholmKT #difference #performance #sequence #xml: Fast and simple XML tree differencing by sequence alignment (TL, JK, ST), pp. 75–84.
SIGMOD-2006-BonczGKMRT #named #performance #relational #xquery: MonetDB/XQuery: a fast XQuery processor powered by a relational engine (PAB, TG, MvK, SM, JR, JT), pp. 479–490.
SIGMOD-2006-RusuD #estimation #performance #random: Fast range-summable random variables for efficient aggregate estimation (FR, AD), pp. 193–204.
SIGMOD-2006-VuHCL #database #performance #scalability #similarity: A non-linear dimensionality-reduction technique for fast similarity search in large databases (KV, KAH, HC, SDL), pp. 527–538.
SIGMOD-2006-ZuzarteY #approximate #performance #statistics: Fast approximate computation of statistics on views (CZ, XY), p. 724.
VLDB-2006-AbererHS #deployment #flexibility #middleware #network #performance: A Middleware for Fast and Flexible Sensor Network Deployment (KA, MH, AS), pp. 1199–1202.
ITiCSE-2006-Gomez-MartinG #concept #development #performance: Fast application development to demonstrate computer graphics concepts (PPGM, MAGM), pp. 250–254.
ITiCSE-2006-GriswoldS #learning #performance #scalability #ubiquitous: Ubiquitous presenter: fast, scalable active learning for the whole classroom (WGG, BS), p. 358.
PLDI-2006-ErtlCG #automaton #flexibility #on-demand #performance: Fast and flexible instruction selection with on-demand tree-parsing automata (MAE, KC, DG), pp. 52–60.
STOC-2006-AilonC #approximate #nearest neighbour #performance: Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform (NA, BC), pp. 557–563.
STOC-2006-Antonakopoulos #bound #performance #protocol: Fast leader-election protocols with bounded cheaters’ edge (SA), pp. 187–196.
STOC-2006-FischerRV #adaptation #convergence #performance: Fast convergence to Wardrop equilibria by adaptive sampling methods (SF, HR, BV), pp. 653–662.
DLT-J-2005-FukagawaA06 #algorithm #comparison #performance: Fast Algorithms for Comparison of Similar Unordered Trees (DF, TA), pp. 703–729.
ICGT-2006-GeissBGHS #graph grammar #named #performance: GrGen: A Fast SPO-Based Graph Rewriting Tool (RG, GVB, DG, SH, AS), pp. 383–397.
CHI-2006-CutrellRDS #flexibility #performance: Fast, flexible filtering with phlat (EC, DCR, STD, RS), pp. 261–270.
EDOC-2006-Hashemzadeh #navigation #network #performance: A Fast and Efficient Route Finding Method for Car Navigation Systems with Neural Networks (MH), pp. 423–426.
CIKM-2006-VieiraSPMCF #detection #performance #robust #web: A fast and robust method for web page template detection and removal (KV, ASdS, NP, ESdM, JMBC, JF), pp. 258–267.
ECIR-2006-BernsteinC #performance #scalability #sequence: Fast Discovery of Similar Sequences in Large Genomic Collections (YB, MC), pp. 432–443.
ICML-2006-Carreira-Perpinan #clustering #parametricity #performance: Fast nonparametric clustering with Gaussian blurring mean-shift (MÁCP), pp. 153–160.
ICML-2006-Haffner #kernel #learning #performance: Fast transpose methods for kernel learning on sparse data (PH), pp. 385–392.
ICML-2006-KlaasBFDML #performance: Fast particle smoothing: if I had a million particles (MK, MB, NdF, AD, SM, DL), pp. 481–488.
ICML-2006-MaggioniM #analysis #evaluation #markov #multi #performance #policy #process #using: Fast direct policy evaluation using multiscale analysis of Markov diffusion processes (MM, SM), pp. 601–608.
ICML-2006-TeoV #array #kernel #performance #string #using: Fast and space efficient string kernels using suffix arrays (CHT, SVNV), pp. 929–936.
ICML-2006-XiKSWR #classification #performance #reduction #using: Fast time series classification using numerosity reduction (XX, EJK, CRS, LW, CAR), pp. 1033–1040.
ICML-2006-ZhangK #kernel #matrix #performance: Block-quantized kernel matrix for fast spectral embedding (KZ, JTK), pp. 1097–1104.
ICPR-v1-2006-BauckhageK #detection #multi #performance: Fast, Illumination Insensitive Face Detection Based on Multilinear Techniques and Curvature Features (CB, TK), pp. 507–510.
ICPR-v1-2006-CaparG #concurrent #performance #recognition #segmentation: Concurrent Segmentation and Recognition with Shape-Driven Fast Marching Methods (AÇ, MG), pp. 155–158.
ICPR-v1-2006-KimH #3d #image #multi #performance #sequence: Variational Multigrid for Fast 3D Interpretation of Image Sequences (JSK, KSH), pp. 267–270.
ICPR-v1-2006-Li #algorithm #clustering #performance: A clustering Based Color Model and Fast Algorithm for Object Tracking (PL), pp. 671–674.
ICPR-v1-2006-LourakisA #3d #performance #reliability: Chaining Planar Homographies for Fast and Reliable 3D Plane Tracking (MIAL, AAA), pp. 582–586.
ICPR-v1-2006-RoeckCG #3d #constraints #performance: Augmenting fast stereo with silhouette constraints for dynamic 3D capture (SDR, NC, LJVG), pp. 131–134.
ICPR-v1-2006-ViswanathP #clustering #hybrid #performance: l-DBSCAN : A Fast Hybrid Density Based Clustering Method (PV, RP), pp. 912–915.
ICPR-v2-2006-GorceP #algorithm #multi #performance: Fast Dichotomic Multiple Search Algorithm for Shortest Cirular Path (MdLG, NP), pp. 403–406.
ICPR-v2-2006-LuB #image #nearest neighbour #performance #retrieval: Fast Image Retrieval Based on Equal-average Equal-variance K-Nearest Neighbour Search (ZML, HB), p. 853–?.
ICPR-v2-2006-MitaKH #approach #categorisation #performance #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-SunV #detection #linear #multi #performance #using: Fast Linear Feature Detection Using Multiple Directional Non-Maximum Suppression (CS, PV), pp. 288–291.
ICPR-v2-2006-TangT #analysis #linear #performance #using: Fast Linear Discriminant Analysis Using Binary Bases (FT, HT), pp. 52–55.
ICPR-v2-2006-ViswanathJ #clustering #performance: A Fast and Efficient Ensemble Clustering Method (PV, KJ), pp. 720–723.
ICPR-v3-2006-AbdallahHB #composition #image #performance #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-ArreolaFB #classification #linear #performance #using: Fast Support Vector Machine Classification using linear SVMs (KZA, JF, HB), pp. 366–369.
ICPR-v3-2006-BaudrierMNR #comparison #performance #quantifier: A fast binary-image comparison method with local-dissimilarity quantification (EB, GM, FN, SR), pp. 216–219.
ICPR-v3-2006-ChanL #algorithm #approximate #fault #multi #performance: Multiplierless Fast DCT Algorithms with Minimal Approximation Errors (RKWC, MCL), pp. 921–925.
ICPR-v3-2006-HalavatiSTCR #approach #novel #performance #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-LiuWL #estimation #performance: Winner Update on Walsh-Hadamard Domain for Fast Motion Estimation (SWL, SDW, SHL), pp. 794–797.
ICPR-v3-2006-SagheerTTAM #approach #feature model #multi #performance #problem: Fast Feature Extraction Approach for Multi-Dimension Feature Space Problems (AES, NT, RiT, DA, SM), pp. 417–420.
ICPR-v3-2006-VandeportaeleCM #detection #image #performance: A Fast Detector of Line Images Acquired by an Uncalibrated Paracatadioptric Camera (BV, MC, PM), pp. 1042–1045.
ICPR-v4-2006-FilipHC #performance #synthesis: Fast Synthesis of Dynamic Colour Textures (JF, MH, DC), pp. 25–28.
ICPR-v4-2006-LienY #performance #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 #performance: Metric tree partitioning and Taylor approximation for fast support vector classification (TVP, AWMS), pp. 132–135.
ICPR-v4-2006-PratiSC #performance: Fast Dynamic Mosaicing and Person Following (AP, FS, RC), pp. 920–923.
KDD-2006-FanMY #framework #performance #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-LoekitoB #diagrams #mining #performance #using: Fast mining of high dimensional expressive contrast patterns using zero-suppressed binary decision diagrams (EL, JB), pp. 307–316.
KDD-2006-TongF #performance #problem: Center-piece subgraphs: problem definition and fast solutions (HT, CF), pp. 404–413.
SIGIR-2006-BastW #performance: Type less, find more: fast autocompletion search with a succinct index (HB, IW), pp. 364–371.
POPL-2006-DanielssonHJG #performance #reasoning: Fast and loose reasoning is morally correct (NAD, JH, PJ, JG), pp. 206–217.
SAC-2006-AbidinP #classification #data mining #mining #named #nearest neighbour #performance #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 #performance: Selective compilation via fast code analysis and bytecode tracing (GA, SCR, PP, MS), pp. 906–911.
SAC-2006-WolfG #development #named #performance: Good/fast/cheap: contexts, relationships and professional responsibility during software development (MJW, FSG), pp. 261–266.
FSE-2006-ZhangTG #execution #performance #slicing #source code: Dynamic slicing long running programs through execution fast forwarding (XZ, ST, RG), pp. 81–91.
CGO-2006-PanE #automation #compilation #distributed #effectiveness #optimisation #performance: Fast and Effective Orchestration of Compiler Optimizations for Automatic Performance Tuning (ZP, RE), pp. 319–332.
ISMM-2006-HuangBGM #order #performance: Fast and efficient partial code reordering: taking advantage of dynamic recompilatior (XH, SMB, DG, KSM), pp. 184–192.
PPoPP-2006-ChristodoulopoulouMBA #clustering #performance: Fast and transparent recovery for continuous availability of cluster-based servers (RC, KM, AB, CA), pp. 221–229.
CAV-2006-BardinLP #performance: FAST Extended Release (SB, JL, GP), pp. 63–66.
CAV-2006-DutertreM #performance: A Fast Linear-Arithmetic Solver for DPLL(T) (BD, LMdM), pp. 81–94.
CAV-2006-LahiriNO #abstraction #performance #smt: SMT Techniques for Fast Predicate Abstraction (SKL, RN, AO), pp. 424–437.
CAV-2006-Lev-AmiIS #abstraction #analysis #performance #precise: Abstraction for Shape Analysis with Fast and Precise Transformers (TLA, NI, SS), pp. 547–561.
CAV-2006-RoyZFH #consistency #memory management #performance #polynomial #verification: Fast and Generalized Polynomial Time Memory Consistency Verification (AR, SZ, CJF, JCH), pp. 503–516.
SAT-2006-CottonM #constraints #difference #flexibility #performance: Fast and Flexible Difference Constraint Propagation for DPLL(T) (SC, OM), pp. 170–183.
DAC-2005-AbdollahiP #canonical #logic #performance #synthesis #verification: A new canonical form for fast boolean matching in logic synthesis and verification (AA, MP), pp. 379–384.
DAC-2005-GopeCJ #3d #multi #named #performance: 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-JinS #performance: Prime clauses for fast enumeration of satisfying assignments to boolean circuits (HJ, FS), pp. 750–753.
DAC-2005-KimK05a #evaluation #modelling #performance #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-LiQTWCH #approach #clustering #performance: Partitioning-based approach to fast on-chip decap budgeting and minimization (HL, ZQ, SXDT, LW, YC, XH), pp. 170–175.
DAC-2005-MitraYP #named #performance #simulation #using: RADAR: RET-aware detailed routing using fast lithography simulations (JM, PY, DZP), pp. 369–372.
DAC-2005-PengL #named #performance #power management #using: Freeze: engineering a fast repeater insertion solver for power minimization using the ellipsoid method (YP, XL), pp. 813–818.
DAC-2005-SuWKLK #analysis #effectiveness #embedded #functional #performance: A noise-driven effective capacitance method with fast embedded noise rule calculation for functional noise analysis (HS, DW, CVK, FL, BK), pp. 186–189.
DATE-2005-BadaouiV #multi #performance #synthesis: Multi-Placement Structures for Fast and Optimized Placement in Analog Circuit Synthesis (RFB, RV), pp. 138–143.
DATE-2005-KimKKSCCKE #architecture #modelling #performance #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-LiS #performance #simulation: An Efficiently Preconditioned GMRES Method for Fast Parasitic-Sensitive Deep-Submicron VLSI Circuit Simulation (ZL, CJRS), pp. 752–757.
DATE-2005-Lopez-OngilGPE #fault #performance: Techniques for Fast Transient Fault Grading Based on Autonomous Emulation (CLO, MGV, MPG, LEA), pp. 308–309.
DATE-2005-MahadevanASOSM #generative #network #performance #simulation: A Network Traffic Generator Model for Fast Network-on-Chip Simulation (SM, FA, MS, RGO, JS, JM), pp. 780–785.
DATE-2005-RosselloCBKS #concurrent #performance: A Fast Concurrent Power-Thermal Model for Sub-100nm Digital ICs (JLR, VC, SAB, AK, JS), pp. 206–211.
DATE-2005-VillaSVMP #framework #integration #memory management #multi #performance: 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 #performance: A Fast Diagnosis Scheme for Distributed Small Embedded SRAMs (BW, YW, AI), pp. 852–857.
DocEng-2005-AvilaL #algorithm #detection #documentation #image #performance: A fast orientation and skew detection algorithm for monochromatic document images (BTÁ, RDL), pp. 118–126.
ICDAR-2005-ChellapillaSN #documentation #performance #recognition: Fast Optical Character Recognition through Glyph Hashing for Document Conversion (KC, PYS, RN), pp. 829–834.
ICDAR-2005-ChuZZT #approach #documentation #image #performance: A Fast and Stable Approach for Restoration of Warped Document Images (KBC, LZ, YZ, CLT), pp. 384–388.
ICDAR-2005-LiuLCL #performance #recognition: Fast Vector Matching Methods and Their Applications to Handwriting Recognition (YHL, WHL, FC, CCL), pp. 871–877.
ICDAR-2005-LucasC #grid #performance: Fast Convolutional OCR with the Scanning N-Tuple Grid (SML, KTC), pp. 799–805.
ICDAR-2005-Schambach #performance #recognition #scalability #word: Fast Script Word Recognition with Very Large Vocabulary (MPS), pp. 9–13.
PODS-2005-SakuraiYF #distance #named #performance #similarity: FTW: fast similarity search under the time warping distance (YS, MY, CF), pp. 326–337.
SIGMOD-2005-ChenOO #performance #robust #similarity: Robust and Fast Similarity Search for Moving Object Trajectories (LC, MTÖ, VO), pp. 491–502.
SIGMOD-2005-GovindarajuRM #approximate #mining #performance #using: Fast and Approximate Stream Mining of Quantiles and Frequencies Using Graphics Processors (NKG, NR, DM), pp. 611–622.
SIGMOD-2005-TaoYPMH #named #optimisation #performance: RPJ: Producing Fast Join Results on Streams through Rate-based Optimization (YT, MLY, DP, MH, NM), pp. 371–382.
SCAM-2005-JonesK #analysis #garbage collection #performance #thread: A Fast Analysis for Thread-Local Garbage Collection with Dynamic Class Loading (REJ, ACK), pp. 129–138.
STOC-2005-Ben-OrH #performance #quantum: Fast quantum byzantine agreement (MBO, AH), pp. 481–485.
STOC-2005-Hallgren #algorithm #performance #quantum: Fast quantum algorithms for computing the unit group and class group of a number field (SH), pp. 468–474.
ICALP-2005-EliasL #performance: Fast Neighbor Joining (IE, JL), pp. 1263–1274.
ICALP-2005-KaoSS #design #performance #random #word: Randomized Fast Design of Short DNA Words (MYK, MS, RTS), pp. 1275–1286.
ICFP-2005-RamosSV #partial evaluation #performance #source code: Fast narrowing-driven partial evaluation for inductively sequential programs (JGR, JS, GV), pp. 228–239.
CIKM-2005-KanT #classification #performance #using: Fast webpage classification using URL features (MYK, HONT), pp. 325–326.
CIKM-2005-LesterMZ #clustering #geometry #online #performance: Fast on-line index construction by geometric partitioning (NL, AM, JZ), pp. 776–783.
CIKM-2005-ZhaoLTX #framework #identification #performance #visualisation: Opportunity map: a visualization framework for fast identification of actionable knowledge (KZ, BL, TMT, WX), pp. 60–67.
ICML-2005-Angiulli #nearest neighbour #performance: Fast condensed nearest neighbor rule (FA), pp. 25–32.
ICML-2005-RennieS #collaboration #matrix #performance #predict: Fast maximum margin matrix factorization for collaborative prediction (JDMR, NS), pp. 713–719.
ICML-2005-SiddiqiM #learning #performance: Fast inference and learning in large-state-space HMMs (SMS, AWM), pp. 800–807.
KDD-2005-ColeSZ #correlation #performance: Fast window correlations over uncooperative time series (RC, DS, XZ), pp. 743–749.
KDD-2005-DhillonGK #algorithm #clustering #graph #kernel #multi #performance: A fast kernel-based multilevel algorithm for graph clustering (ISD, YG, BK), pp. 629–634.
KDD-2005-JaroszewiczS #network #performance: Fast discovery of unexpected patterns in data, relative to a Bayesian network (SJ, TS), pp. 118–127.
KDD-2005-SanghaiSDK #architecture #clustering #design #multi #performance #simulation: A multinomial clustering model for fast simulation of computer architecture designs (KS, TS, JGD, DRK), pp. 808–813.
SEKE-2005-ChiangTK #classification #multi #performance #using: Fast Class Rendering Using Multiresolution Classification in Discrete Cosine Transform Domain (TWC, TT, LJK), pp. 689–694.
SAC-2005-YimKK #memory management #performance: A fast start-up technique for flash memory based computing systems (KSY, JK, KK), pp. 843–849.
HPCA-2005-KondoN #clustering #performance #power management: A Small, Fast and Low-Power Register File by Bit-Partitioning (MK, HN), pp. 40–49.
PPoPP-2005-Hanrahan #hardware #performance #question #why: Why is graphics hardware so fast? (PH), p. 1.
SAT-2005-SangBK #heuristic #performance: Heuristics for Fast Exact Model Counting (TS, PB, HAK), pp. 226–240.
DAC-2004-AgarwalSYV #modelling #performance: Fast and accurate parasitic capacitance models for layout-aware (AA, HS, VY, RV), pp. 145–150.
DAC-2004-AlpertHHQ #flexibility #layout #performance #physics: Fast and flexible buffer trees that navigate the physical layout environment (CJA, MH, JH, STQ), pp. 24–29.
DAC-2004-GopeCJ #matrix #modelling #multi #performance #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-JeongN #detection #performance: Fast hazard detection in combinational circuits (CJ, SMN), pp. 592–595.
DAC-2004-KimYKK #functional #hardware #performance #simulation: Communication-efficient hardware acceleration for fast functional simulation (YIK, WSY, YSK, CMK), pp. 293–298.
DAC-2004-MeiRCHD #performance #robust: Robust, stable time-domain methods for solving MPDEs of fast/slow systems (TM, JSR, TSC, SAH, DMD), pp. 848–853.
DAC-2004-NakamuraHKYY #c #c++ #communication #hardware #performance #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 #performance #statistics: Fast statistical timing analysis handling arbitrary delay correlations (MO, AB), pp. 337–342.
DAC-2004-PasrichaDB #approach #architecture #communication #modelling #performance #transaction: Extending the transaction level modeling approach for fast communication architecture exploration (SP, NDD, MBR), pp. 113–118.
DAC-2004-ZhangDRRC #performance #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 #performance #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-v1-2004-HandaV #algorithm #performance: A Fast Algorithm for Finding Maximal Empty Rectangles for Dynamic FPGA Placement (MH, RV), pp. 744–745.
DATE-v1-2004-RanjanVASVG #modelling #performance #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-ShinKCCKE #architecture #design #performance: Fast Exploration of Parameterized Bus Architecture for Communication-Centric SoC Design (CS, YTK, EYC, KMC, JTK, SKE), pp. 352–357.
DATE-v2-2004-GuptaK #performance #statistics: A Fast Word-Level Statistical Estimator of Intra-Bus Crosstalk (SG, SK), pp. 1110–1115.
DATE-v2-2004-KarandikarS #implementation #performance: Fast Comparisons of Circuit Implementations (SKK, SSS), pp. 910–915.
DocEng-2004-HuangCL #performance #query #retrieval: Fast structural query with application to chinese treebank sentence retrieval (CHH, TRC, HML), pp. 11–20.
SIGMOD-2004-GovindarajuLWLM #database #performance #using: Fast Computation of Database Operations using Graphics Processors (NKG, BL, WW, MCL, DM), pp. 215–226.
SIGMOD-2004-LernerSWZZ #algorithm #biology #music #performance #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-QianZZ #approach #clustering #effectiveness #named #performance: FAÇADE: A Fast and Effective Approach to the Discovery of Dense Clusters in Noisy Spatial Data (YQ, GZ, KZ), pp. 921–922.
ESOP-2004-AbadiBF #performance #π-calculus: Just Fast Keying in the π Calculus (MA, BB, CF), pp. 340–354.
PLDI-2004-KulkarniHHWDJ #effectiveness #optimisation #performance #sequence: Fast searches for effective optimization phase sequences (PAK, SH, JH, DBW, JWD, DLJ), pp. 171–182.
ICALP-2004-FominT #algorithm #exponential #graph #kernel #linear #performance: Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up (FVF, DMT), pp. 581–592.
ICFP-2004-MarlowJ #higher-order #performance: Making a fast curry: push/enter vs. eval/apply for higher-order languages (SM, SLPJ), pp. 4–15.
ICEIS-v1-2004-El-SonbatyK #algorithm #incremental #mining #performance: New Fast Algorithm for Incremental Mining of Association Rules (YES, RK), pp. 275–281.
CIKM-2004-JingYKT #locality #performance #similarity #transaction: Localized signature table: fast similarity search on transaction data (QJ, RY, PK, AKHT), pp. 314–323.
CIKM-2004-SongB #algorithm #detection #effectiveness #named #performance: BioDIFF: an effective fast change detection algorithm for genomic and proteomic data (YS, SSB), pp. 146–147.
ICML-2004-FungDBR #algorithm #kernel #performance #using: A fast iterative algorithm for fisher discriminant using heterogeneous kernels (GF, MD, JB, RBR).
ICPR-v1-2004-Debled-RennessonTW #approximate #performance: Fast Polygonal Approximation of Digital Curves (IDR, ST, LW), pp. 465–468.
ICPR-v1-2004-SirisathitkulAU #distance #image #performance #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-v2-2004-BlicherRP #2d #3d #image #named #performance: LightSphere: Fast Lighting Compensation for Matching a 2D Image to a 3D Model (APB, SR, PSP), pp. 157–162.
ICPR-v2-2004-DuanQ #image #performance: Fast Tone Mapping for High Dynamic Range Images (JD, GQ), pp. 847–850.
ICPR-v2-2004-TremblaisA #algorithm #detection #multi #performance: A Fast Multiscale Edge Detection Algorithm Based on a New Edge Preserving PDE Resolution Scheme (BT, BA), pp. 811–814.
ICPR-v2-2004-YaoKG #detection #performance #robust: Fast Robust GA-Based Ellipse Detection (JY, NNK, PG), pp. 859–862.
ICPR-v2-2004-YuWC #3d #algorithm #multi #performance #re-engineering #recursion: A Fast Recursive 3D Model Reconstruction Algorithm for Multimedia Applications (YKY, KhW, MMYC), pp. 241–244.
ICPR-v3-2004-KawanishiKKT #adaptation #algorithm #performance #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 #performance #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 #performance #using: Fast Object Localization using Multi-Scale Image Relevance Function (RMP, RM, MBZ), pp. 227–230.
ICPR-v3-2004-SchoutenB #distance #performance: Fast Exact Euclidean Distance (FEED) Transformation (TES, ELvdB), pp. 594–597.
ICPR-v3-2004-WestphalW #performance #recognition: Fast Object and Pose Recognition Through Minimum Entropy Coding (GW, RPW), pp. 53–56.
ICPR-v3-2004-YingK #evaluation #performance: Fast Leave-One-Out Evaluation and Improvement on Inference for LS-SVMs (ZY, KCK), pp. 494–497.
ICPR-v3-2004-YuanTR #performance #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-BruniVK #performance: Fast Removal of Line Scratches in Old Movies (VB, DV, ACK), pp. 827–830.
ICPR-v4-2004-IshiyamaS #3d #estimation #performance: Fast and Accurate Facial Pose Estimation by Aligning a 3D Appearance Model (RI, SS), pp. 388–391.
ICPR-v4-2004-TaguchiOA #performance #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 #performance: An Effective and Fast Soccer Ball Detection and Tracking Method (XFT, HQL, QSL), pp. 795–798.
KDD-2004-AndersonMCN #performance: Fast nonlinear regression via eigenimages applied to galactic morphology (BA, AWM, AJC, RN), pp. 40–48.
KDD-2004-FaloutsosMT #performance: Fast discovery of connection subgraphs (CF, KSM, AT), pp. 118–127.
KDD-2004-ZhangMCS #mining #performance: Fast mining of spatial collocations (XZ, NM, DWC, YS), pp. 384–393.
SAC-2004-JuhaszC #clustering #multi #performance: Exploiting fast ethernet performance in multiplatform cluster environment (SJ, HC), pp. 1407–1411.
SAC-2004-LuLFDB #algorithm #clustering #named #performance #search-based: FGKA: a Fast Genetic K-means Clustering Algorithm (YL, SL, FF, YD, SJB), pp. 622–623.
SAC-2004-QianZ #automation #clustering #named #performance: GraphZip: a fast and automatic compression method for spatial data clustering (YQ, KZ), pp. 571–575.
SAC-2004-StamatakisLM #performance #scalability: A fast program for maximum likelihood-based inference of large phylogenetic trees (AS, TL, HM), pp. 197–201.
SAC-2004-WuCY #performance: VCR indexing for fast event matching for highly-overlapping range predicates (KLW, SKC, PSY), pp. 740–747.
ICSE-2004-AkgulMP #assembly #execution #performance #slicing: A Fast Assembly Level Reverse Execution Method via Dynamic Slicing (TA, VJMI, SP), pp. 522–531.
ICSE-2004-Matinlassi #architecture #comparison #design #performance #product line: Comparison of Software Product Line Architecture Design Methods: COPA, FAST, FORM, KobrA and QADA (MM), pp. 127–136.
CC-2004-McPeakN #generative #glr #named #parsing #performance: Elkhound: A Fast, Practical GLR Parser Generator (SM, GCN), pp. 73–88.
LCTES-2004-ZengSE #concurrent #dependence #generative #graph #performance: Generating fast code from concurrent program dependence graphs (JZ, CS, SAE), pp. 175–181.
OSDI-2004-BosBCNP #named #performance: FFPF: Fairly Fast Packet Filters (HB, WdB, MLC, TN, GP), pp. 347–363.
CAV-2004-GanzingerHNOT #performance: DPLL( T): Fast Decision Procedures (HG, GH, RN, AO, CT), pp. 175–188.
ICLP-2004-TronconJV #compilation #control flow #evaluation #lazy evaluation #performance #query: Fast Query Evaluation with (Lazy) Control Flow Compilation (RT, GJ, HV), pp. 240–253.
DAC-2003-ChaiK #constraints #performance #pseudo #theorem proving: A fast pseudo-boolean constraint solver (DC, AK), pp. 830–835.
DAC-2003-El-GamalBBHMOP #implementation #performance: Fast, cheap and under control: the next implementation fabric (AEG, IB, AB, CH, PM, ZOB, LTP), pp. 354–355.
DAC-2003-MaideeAB #clustering #performance: Fast timing-driven partitioning-based placement for island style FPGAs (PM, CA, KB), pp. 598–603.
DAC-2003-ReshadiMD #flexibility #performance #set #simulation: Instruction set compiled simulation: a technique for fast and flexible instruction set simulation (MR, PM, NDD), pp. 758–763.
DAC-2003-ZhuSW #3d #algorithm #geometry #performance: Algorithms in FastImp: a fast and wideband impedance extraction program for complicated 3-D geometries (ZZ, BS, JW), pp. 712–717.
DATE-2003-LiliusTV #architecture #evaluation #performance #protocol: Fast Evaluation of Protocol Processor Architectures for IPv6 Routing (JL, DT, SV), pp. 20158–20163.
DATE-2003-RenczSP #algorithm #layout #performance #simulation: A Fast Algorithm for the Layout Based Electro-Thermal Simulation (MR, VS, AP), pp. 11032–11037.
DATE-2003-YooBBPJ #abstraction #hardware #modelling #performance #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 #performance #using: Fast Computation of Data Correlation Using BDDs (ZZ, QZ, IGH, MJC), pp. 10122–10129.
DATE-2003-ZivkovicKWD #architecture #multi #performance #source code: Fast and Accurate Multiprocessor Architecture Exploration with Symbolic Programs (VDZ, EAdK, PvdW, EFD), pp. 10656–10661.
ICDAR-2003-GattaniMG #analysis #approach #documentation #image #multi #performance: A Fast Multifunctional Approach for Document Image Analysis (AG, MM, HG), pp. 1178–1182.
ICDAR-2003-LucasPD #image #performance #recognition #word: Fast Lexicon-Based Word Recognition in Noisy Index Card Images (SML, GP, ACD), pp. 462–466.
CSMR-2003-Latendresse #c #c++ #evaluation #performance #preprocessor #symbolic computation #using: Fast Symbolic Evaluation of C/C++ Preprocessing Using Conditional Value (ML), p. 170–?.
CSMR-2003-MerloAB #analysis #fuzzy #performance: Fast Flow Analysis to Compute Fuzzy Estimates of Risk Levels (EM, GA, PLB), p. 351–?.
PEPM-2003-AgerDR #partial evaluation #pattern matching #performance #string: Fast partial evaluation of pattern matching in strings (MSA, OD, HKR), pp. 3–9.
STOC-2003-ColeH #algorithm #performance: A fast algorithm for computing steiner edge connectivity (RC, RH), pp. 167–176.
STOC-2003-Thorup03a #performance #query: Space efficient dynamic stabbing with fast queries (MT), pp. 649–658.
ICEIS-v2-2003-KeeniGS #learning #network #on the #performance #using: On Fast Learning of Neural Networks Using Back Propagation (KK, KG, HS), pp. 266–271.
ECIR-2003-LinKT #e-commerce #performance: Attaining Fast and Successful Searches in E-commerce Environments (RL, SK, JDT), pp. 120–134.
ECIR-2003-ShinKKK #automation #database #music #performance: 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 #performance: Fast Query-Optimized Kernel Machine Classification Via Incremental Approximate Nearest Support Vectors (DD, DM), pp. 115–122.
ICML-2003-KubicaMCS #analysis #collaboration #graph #performance #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 #performance #policy: The Cross Entropy Method for Fast Policy Search (SM, RYR, YG), pp. 512–519.
ICML-2003-YuL #feature model #performance: Feature Selection for High-Dimensional Data: A Fast Correlation-Based Filter Solution (LY, HL), pp. 856–863.
KDD-2003-ZakiG #mining #performance #using: Fast vertical mining using diffsets (MJZ, KG), pp. 326–335.
MLDM-2003-DongKS #optimisation #parallel #performance: A Fast Parallel Optimization for Training Support Vector Machine (JxD, AK, CYS), pp. 96–105.
SEKE-2003-Agren #concept #database #named #performance: CHiC: A Fast Concept Hierarchy Constructor for Discrete or Mixed Mode Databases (OÅ), pp. 250–258.
SEKE-2003-LiWQ #algorithm #performance #recognition: A Fast Binary Tree Based Face Recognition Algorithm (HL, SW, FQ), pp. 594–598.
OOPSLA-2003-BlackburnM #garbage collection #performance: Ulterior reference counting: fast garbage collection without a long wait (SB, KSM), pp. 344–358.
OOPSLA-2003-SachindranEM #garbage collection #named #performance: Mark-copy: fast copying GC with less space overhead (NS, JEBM), pp. 326–343.
PADL-2003-HuetC #algorithm #performance: Zen and the Art of Symbolic Computing: Light and Fast Applicative Algorithms for Computational Linguistics (GPH), pp. 17–18.
SAC-2003-CanWWS #3d #java #named #performance #using #visualisation: FPV: Fast Protein Visualization Using Java 3D (TC, YW, YFW, JS), pp. 88–95.
SAC-2003-ZhangP #algorithm #effectiveness #performance: A Fast and Effective Steganalytic Technique Against JSteg-like Algorithms (TZ, XP), pp. 307–311.
CAV-2003-BardinFLP #named #performance: FAST: Fast Acceleration of Symbolikc Transition Systems (SB, AF, JL, LP), pp. 118–121.
CAV-2003-Obdrzalek #bound #calculus #model checking #performance #μ-calculus: Fast μ-Calculus Model Checking when Tree-Width Is Bounded (JO), pp. 80–92.
CSL-2003-RybinaV #infinity #model checking #performance: Fast Infinite-State Model Checking in Integer-Based Systems (Invited Lecture) (TR, AV), pp. 546–573.
TestCom-2003-ArnedoCN #performance #testing: Fast Testing of Critical Properties through Passive Testing (JAA, ARC, MN), pp. 295–310.
DAC-2002-BernasconiCLP #logic #performance #symmetry: Fast three-level logic minimization based on autosymmetry (AB, VC, FL, LP), pp. 425–430.
DAC-2002-CadambiMA #functional #hardware #performance #scalability #simulation: A fast, inexpensive and scalable hardware acceleration technique for functional simulation (SC, CM, PA), pp. 570–575.
DAC-2002-KurzwegLMKC #modelling #performance: A fast optical propagation technique for modeling micro-optical systems (TPK, SPL, JAM, MK, DMC), pp. 236–241.
DAC-2002-LyseckyCV #memory management #performance #profiling: A fast on-chip profiler memory (RLL, SC, FV), pp. 28–33.
DAC-2002-NohlBSLMH #architecture #flexibility #performance #simulation: A universal technique for fast and flexible instruction-set architecture simulation (AN, GB, OS, RL, HM, AH), pp. 22–27.
DAC-2002-Perrott #behaviour #performance #simulation: Fast and accurate behavioral simulation of fractional-N frequency synthesizers and other PLL/DLL circuits (MHP), pp. 498–503.
DATE-2002-GoldbergN #named #performance #robust: BerkMin: A Fast and Robust Sat-Solver (EIG, YN), pp. 142–149.
DATE-2002-ThielenV #performance #simulation: Fast Method to Include Parasitic Coupling in Circuit Simulations (BLAVT, GAEV), pp. 1033–1037.
DATE-2002-YooNGJ #automation #design #generative #modelling #operating system #performance #simulation: Automatic Generation of Fast Timed Simulation Models for Operating Systems in SoC Design (SY, GN, LG, AAJ), pp. 620–627.
PODS-2002-GuhaKS #algorithm #performance: Fast Algorithms For Hierarchical Range Histogram Construction (SG, NK, DS), pp. 180–187.
SIGMOD-2002-ProcopiucJAM #algorithm #clustering #monte carlo #performance: A Monte Carlo algorithm for fast projective clustering (CMP, MJ, PKA, TMM), pp. 418–427.
VLDB-2002-ChakrabartiRS #classification #linear #multi #performance: Fast and Accurate Text Classification via Multiple Linear Discriminant Projections (SC, SR, MVS), pp. 658–669.
PLDI-2002-BudimlicCHKOR #identification #performance: Fast Copy Coalescing and Live-Range Identification (ZB, KDC, TJH, KK, TSO, SWR), pp. 25–32.
PLDI-2002-SoHD #approach #compilation #design #hardware #performance: A Compiler Approach to Fast Hardware Design Space Exploration in FPGA-based Systems (BS, MWH, PCD), pp. 165–176.
STOC-2002-GilbertGIKMS #algorithm #approximate #maintenance #performance: Fast, small-space algorithms for approximate histogram maintenance (ACG, SG, PI, YK, SM, MS), pp. 389–398.
ICALP-2002-AkcogluDK #performance: Fast Universalization of Investment Strategies with Provably Good Relative Returns (KA, PD, MYK), pp. 888–900.
ICALP-2002-GuhaIMS #data type #performance: Histogramming Data Streams with Fast Per-Item Processing (SG, PI, SM, MS), pp. 681–692.
AFP-2002-ChakravartyK02 #approach #array #haskell #performance: An Approach to Fast Arrays in Haskell (MMTC, GK), pp. 27–58.
IFL-2002-Bagwell #functional #performance: Fast Functional Lists (PB), pp. 34–50.
CIKM-2002-OrdonezO #clustering #named #performance #robust #scalability #set: FREM: fast and robust EM clustering for large data sets (CO, EO), pp. 590–599.
CIKM-2002-SungZP #database #performance #scalability: A fast filtering scheme for large database cleansing (SYS, ZL, SP), pp. 76–83.
ICML-2002-DeCoste #classification #distance #geometry #kernel #performance: Anytime Interval-Valued Outputs for Kernel Machines: Fast Support Vector Machine Classification via Distance Geometry (DD), pp. 99–106.
ICML-2002-ElomaaR #fault #performance: Fast Minimum Training Error Discretization (TE, JR), pp. 131–138.
ICML-2002-KeerthiDSP #algorithm #kernel #performance: A Fast Dual Algorithm for Kernel Logistic Regression (SSK, KD, SKS, ANP), pp. 299–306.
ICPR-v1-2002-CamusW #image #performance #reliability: Reliable and Fast Eye Finding in Close-up Images (TAC, RPW), pp. 389–394.
ICPR-v1-2002-DeschampsC #3d #performance: Fast Extraction of Tubular and Tree 3D Surfaces with Front Propagation Methods (TD, LDC), pp. 731–734.
ICPR-v1-2002-FleuretG #detection #estimation #performance #precise: Fast Face Detection with Precise Pose Estimation (FF, DG), p. 235–?.
ICPR-v2-2002-Al-ShaherH #learning #modelling #online #performance: Fast On-Line learning of Point Distribution Models (AAAS, ERH), pp. 208–211.
ICPR-v2-2002-BalthasarP #classification #performance: Fast Projection Plane Classifier (DB, LP), pp. 200–203.
ICPR-v2-2002-GarciaD #architecture #detection #performance #robust: A Neural Architecture for Fast and Robust Face Detection (CG, MD), pp. 44–47.
ICPR-v2-2002-GiugnoS #graph #named #performance #query: GraphGrep: A Fast and Universal Method for Querying Graphs (RG, DS), pp. 112–115.
ICPR-v2-2002-MoghaddamZ #analysis #linear #online #pattern matching #pattern recognition #performance #recognition: Fast Linear Discriminant Analysis for On-Line Pattern Recognition Applications (HAM, KAZ), pp. 64–67.
ICPR-v2-2002-RendonB #clustering #performance: Fast Hierarchical Clustering Based on Compressed Data (ER, RB), pp. 216–219.
ICPR-v2-2002-Robles-KellySH #approximate #performance #segmentation: A Fast Leading Eigenvector Approximation for Segmentation and Grouping (ARK, SS, ERH), pp. 639–642.
ICPR-v2-2002-VishwanathanM #algorithm #geometry #performance: Geometric SVM: A Fast and Intuitive SVM Algorithm (SVNV, MNM), pp. 56–59.
ICPR-v3-2002-ChenHF #database #performance #sequence: Fast Semi-Local Alignment for DN Sequence Database Search (YSC, YPH, CSF), pp. 1019–1022.
ICPR-v3-2002-FengH #performance: Confidence Guided Progressive Search and Fast Match Techniques for High Performance Chinese/English OCR (ZDF, QH), pp. 89–92.
ICPR-v3-2002-FitchKCK #performance #robust: Fast Exhaustive Robust Matching (AJF, AK, WJC, JK), pp. 903–906.
ICPR-v3-2002-HaindlF #performance: Fast Restoration of Colour Movie Scratches (MH, JF), pp. 269–272.
ICPR-v3-2002-MarugameSYMFYKKTT #metric #performance #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-SmolkaSPV #on the #performance: On the Fast Modification of the Vector Median Filter (BS, MS, KNP, ANV), pp. 931–934.
ICPR-v4-2002-KolesnikovF #algorithm #approximate #performance: A Fast Near-Optimal Algorithm for Approximation of Polygonal Curves (AK, PF), pp. 335–338.
ICPR-v4-2002-PerisM #classification #distance #edit distance #performance: Fast Cyclic Edit Distance Computation with Weighted Edit Costs in Classification (GP, AM), pp. 184–187.
ICPR-v4-2002-YuiHZH #3d #adaptation #modelling #performance: A Fast Narrow Band Method and Its Application in Topology-Adaptive 3-D Modeling (SY, KH, HZ, TH), pp. 122–125.
KDD-2002-PalmerGF #data mining #graph #mining #named #performance #scalability: ANF: a fast and scalable tool for data mining in massive graphs (CRP, PBG, CF), pp. 81–90.
KDD-2002-WuF #performance #scalability: Making every bit count: fast nonlinear axis scaling (LW, CF), pp. 664–669.
KDD-2002-YangGY #algorithm #clustering #effectiveness #named #performance #transaction: CLOPE: a fast and effective clustering algorithm for transactional data (YY, XG, JY), pp. 682–687.
SIGIR-2002-ScholerWYZ #evaluation #performance #query: Compression of inverted indexes for fast query evaluation (FS, HEW, JY, JZ), pp. 222–229.
OOPSLA-2002-ZibinG #algorithm #multi #performance: Fast algorithm for creating space efficient dispatching tables with application to multi-dispatching (YZ, JYG), pp. 142–160.
SAC-2002-LuSP #generative #implementation #performance #smarttech: Implementation of fast RSA key generation on smart cards (CL, ALMdS, FRP), pp. 214–220.
LCTES-SCOPES-2002-MilnerD #performance #pipes and filters: Quick piping: a fast, high-level model for describing processor pipelines (CWM, JWD), pp. 175–184.
DAC-2001-KedingCLM #performance #simulation: Fast Bit-True Simulation (HK, MC, OL, HM), pp. 708–713.
DAC-2001-LiouCKK #analysis #performance #probability #statistics: Fast Statistical Timing Analysis By Probabilistic Event Propagation (JJL, KTC, SK, AK), pp. 661–666.
DAC-2001-TanS #modelling #network #optimisation #performance: Fast Power/Ground Network Optimization Based on Equivalent Circuit Modeling (SXDT, CJRS), pp. 550–554.
DATE-2001-HoffmanKM #framework #performance: A framework for fast hardware-software co-simulation (AH, TK, HM), pp. 760–765.
DATE-2001-SaitohAT #clustering #performance #scheduling: Clustering based fast clock scheduling for light clock-tree (MS, MA, AT), pp. 240–245.
ICDAR-2001-GatosP #image #performance #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-Takasu #approximate #documentation #performance #string: Document Filtering for Fast Approximate String Matching of Errorneous Text (AT), pp. 916–920.
VLDB-2001-BohmMSW #evaluation #performance #query #similarity: Fast Evaluation Techniques for Complex Similarity Queries (KB, MM, HJS, RW), pp. 211–220.
VLDB-2001-CooperSFHS #performance #semistructured data: A Fast Index for Semistructured Data (BFC, NS, MJF, GRH, MS), pp. 341–350.
VLDB-2001-MargaritisFT #data mining #mining #named #performance #scalability: NetCube: A Scalable Tool for Fast Data Mining and Compression (DM, CF, ST), pp. 311–320.
PLDI-2001-HeintzeT01a #alias #analysis #c #using: Ultra-fast Aliasing Analysis using CLA: A Million Lines of C Code in a Second (NH, OT), pp. 254–263.
STOC-2001-AchlioptasM #matrix #performance #rank: Fast computation of low rank matrix (DA, FM), pp. 611–618.
STOC-2001-ErgunSSS #performance: Biased dictionaries with fast insert/deletes (FE, SCS, JS, RKS), pp. 483–491.
ICML-2001-SingerV #implementation #learning #performance: Learning to Generate Fast Signal Processing Implementations (BS, MMV), pp. 529–536.
KDD-2001-BeygelzimerPM #category theory #dataset #performance #scalability #visualisation: Fast ordering of large categorical datasets for better visualization (AB, CSP, SM), pp. 239–244.
SIGIR-2001-Hoenkamp #performance #semantics: Unitary Operators for Fast Latent Semantic Indexing (FLSI) (EH), pp. 400–401.
SAC-2001-VuHT #algorithm #detection #image #performance #query: An efficient core-area detection algorithm for fast noise-free image query processing (KV, KAH, DAT), pp. 258–263.
ICSE-2001-MenziesPH #analysis #diagrams #formal method #performance #requirements: Fast Formal Analysis of Requirements via “Topoi Diagrams” (TM, JDP, MEH), pp. 391–400.
LCTES-OM-2001-PalopoliLANAC #embedded #performance #prototype #simulation: A Tool for Simulation and Fast Prototyping of Embedded Control Systems (LP, GL, LA, MDN, PA, FC), pp. 73–81.
CAV-2001-DovierPP #algorithm #bisimulation #performance: A Fast Bisimulation Algorithm (AD, CP, AP), pp. 79–90.
CAV-2001-GastinO #automaton #ltl #performance: Fast LTL to Büchi Automata Translation (PG, DO), pp. 53–65.
DAC-2000-ChangCSM #detection #functional #performance #symmetry #using: Fast post-placement rewiring using easily detectable functional symmetries (CWJC, CKC, PS, MMS), pp. 286–289.
DAC-2000-JagannathanHL #algorithm #performance: A fast algorithm for context-aware buffer insertion (AJ, SWH, JL), pp. 368–373.
DAC-2000-KanapkaPW #performance: Fast methods for extraction and sparsification of substrate coupling (JK, JRP, JW), pp. 738–743.
DAC-2000-NassifK #grid #performance #power management #simulation: Fast power grid simulation (SRN, JNK), pp. 156–161.
DAC-2000-TsaiK #performance #reduction #simulation: Fast temperature calculation for transient electrothermal simulation by mixed frequency/time domain thermal model reduction (CHT, SMK), pp. 750–755.
DATE-2000-HenkeGV #design #estimation #performance: Fast Cache and Bus Power Estimation for Parameterized System-on-a-Chip Design (JH, TG, FV), pp. 333–338.
DATE-2000-TangWT #evaluation #performance #sequence: Fast Evaluation of Sequence Pair in Block Placement by Longest Common Subsequence Computation (XT, DFW, RT), pp. 106–111.
DATE-2000-YooLJRCC #execution #performance: Fast Hardware-Software Coverification by Optimistic Execution of Real Processor (SY, JeL, JJ, KR, YC, KC), pp. 663–668.
SIGMOD-2000-OrdonezC #algorithm #clustering #named #performance #sql #using: SQLEM: Fast Clustering in SQL using the EM Algorithm (CO, PC), pp. 559–570.
VLDB-2000-YiF #performance #sequence: Fast Time Sequence Indexing for Arbitrary Lp Norms (BKY, CF), pp. 385–394.
CIAA-2000-BergeronH #automaton #implementation #performance: Fast Implementations of Automata Computations (AB, SH), pp. 47–56.
ICALP-2000-AielloBOR #performance #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 #performance #problem: Fast Approximation Schemes for Euclidean Multi-connectivity Problems (AC, AL), pp. 856–868.
CIKM-2000-HanK #algorithm #categorisation #documentation #performance #reduction #retrieval: Fast Supervised Dimensionality Reduction Algorithm with Applications to Document Categorization & Retrieval (EHH, GK), pp. 12–19.
ICPR-v1-2000-Farneback #estimation #modelling #parametricity #performance #using: Fast and Accurate Motion Estimation Using Orientation Tensors and Parametric Motion Models (GF), pp. 1135–1139.
ICPR-v1-2000-GotzeDH #invariant #recognition: Invariant Object Recognition with Discriminant Features Based on Local Fast-Fourier Mellin Transform (NG, SD, GH), pp. 1948–1951.
ICPR-v2-2000-CordellaFSV #component #detection #graph #image #performance: 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 #performance #string: 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-LingC #bound #feature model #performance: Fast and Efficient Feature Extraction Based on Bayesian Decision Boundaries (LLL, HMC), pp. 2390–2393.
ICPR-v2-2000-MacLeanT #image #pattern matching #pattern recognition #performance #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 #performance: Fast Unit Selection Algorithm for Neural Network Design (KM, JK), pp. 2981–2984.
ICPR-v2-2000-SuzukiHS #component #performance: 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-v3-2000-BoydM #implementation #multi #performance: Fast Implementation of Multiple Oriented Filters (JEB, JM), pp. 3458–3462.
ICPR-v3-2000-ChuC #algorithm #generative #performance: A Fast Algorithm for Generating Fractals (HTC, CCC), pp. 3306–3309.
ICPR-v3-2000-HongHT #finite #gesture #performance #recognition #state machine: Constructing Finite State Machines for Fast Gesture Recognition (PH, TSH, MT), pp. 3695–3698.
ICPR-v3-2000-HufnaglU #classification #fault #performance: Resolving a Defect in Quadrant-Based Classification for Fast Block-Matching (CH, AU), pp. 3203–3206.
ICPR-v3-2000-KimCL #detection #feature model #performance #using: Fast Scene Change Detection Using Direct Feature Extraction from MPEG Compressed Videos (YMK, SWC, SWL), pp. 3178–3181.
ICPR-v3-2000-KozlovMSRK #performance #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 #performance #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 #performance #using: Initialized Eigenlip Estimator for Fast Lip Tracking Using Linear Regression (SL, SS, VC), pp. 3182–3185.
ICPR-v3-2000-PeceP #composition #performance: Fast Atomic Decomposition by the Inhibition Method (AECP, NP), pp. 3215–3218.
ICPR-v3-2000-RomeroRT #performance: Fast Skeletonization of Spatially Encoded Objects (FR, LR, FT), pp. 3514–3517.
ICPR-v4-2000-HaritaogluHD #maintenance #modelling #performance: A Fast Background Scene Modeling and Maintenance for Outdoor Surveillance (IH, DH, LSD), pp. 4179–4183.
ICPR-v4-2000-HasegawaYM #algorithm #online #performance #recognition: Fast Discrete HMM Algorithm for On-line Handwriting Recognition (TH, HY, TM), pp. 4535–4538.
ICPR-v4-2000-VinczeAZ #integration #performance #using: Fast Tracking of Ellipses Using Edge-Projected Integration of Cues (MV, MA, MZ), pp. 4072–4075.
KDD-2000-KittsFV #independence #named #performance #recommendation: Cross-sell: a fast promotion-tunable customer-item recommendation method based on conditionally independent probabilities (BK, DF, MV), pp. 437–446.
ICSE-2000-Murphy #how #industrial #performance: Grow fast, grow global: how the Irish software industry evolved to this business model (BM), pp. 606–607.
ASPLOS-2000-BurkeMA #architecture #encryption #performance #symmetry: Architectural Support for Fast Symmetric-Key Cryptography (JB, JM, TMA), pp. 178–189.
CC-2000-GayS #analysis #performance #source code #stack: Fast Escape Analysis and Stack Allocation for Object-Based Programs (DG, BS), pp. 82–93.
OSDI-2000-FuKM #distributed #file system #performance: Fast and Secure Distributed Read-Only File System (KF, MFK, DM), pp. 181–196.
LICS-2000-MurawskiO #performance #proving #verification: Dominator Trees and Fast Verification of Proof Nets (ASM, CHLO), pp. 181–191.
DAC-1999-ClementHLRCP #design #multi #performance #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 #performance: Technology Mapping for FPGAs with Nonuniform Pin Delays and Fast Interconnections (JC, YYH, SX), pp. 373–378.
DAC-1999-PerkowskiMGBM #algorithm #evaluation #graph #performance: Graph Coloring Algorithms for Fast Evaluation of Curtis Decompositions (MAP, RM, SG, MB, AM), pp. 225–230.
DAC-1999-TauschW #multi #performance: A Multiscale Method for Fast Capacitance Extraction (JT, JKW), pp. 537–542.
DATE-1999-PaschalisKPGZ #architecture #effectiveness #multi #performance: An Effective BIST Architecture for Fast Multiplier Cores (AMP, NK, MP, DG, YZ), pp. 117–121.
DATE-1999-TabbaraSSFL #modelling #performance #using: Fast Hardware-Software Co-simulation Using VHDL Models (BT, MS, ALSV, EF, LL), p. 309–?.
DATE-1999-WeissSR #embedded #operating system #performance #realtime #using: Emulation of a Fast Reactive Embedded System using a Real Time Operating System (KW, TS, WR), pp. 764–765.
DATE-1999-YangZ #fault #performance #robust #simulation: Fast, Robust DC and Transient Fault Simulation for Nonlinear Analog Circuits (ZRY, MZ), pp. 244–248.
ICDAR-1999-Ho #identification #keyword #learning #performance #word: Fast Identification of Stop Words for Font Learning and Keyword Spotting (TKH), pp. 333–336.
ICDAR-1999-MisraAC #image #memory management #performance: A Memory Efficient Method for Fast Transposing Run-length Encoded Images (VM, JFA, AKC), pp. 161–164.
PODS-1999-ChuW #performance #scalability: Fast Time-Series Searching with Scaling and Shifting (KKWC, MHW), pp. 237–248.
SIGMOD-1999-AggarwalPWYP #algorithm #clustering #performance: Fast Algorithms for Projected Clustering (CCA, CMP, JLW, PSY, JSP), pp. 61–72.
VLDB-1999-AcharyaGP #approximate #named #performance #query #using: Aqua: A Fast Decision Support Systems Using Approximate Query Answers (SA, PBG, VP), pp. 754–757.
VLDB-1999-PacittMS #algorithm #consistency #database #lazy evaluation #maintenance #performance: Fast Algorithms for Maintaining Replica Consistency in Lazy Master Replicated Databases (EP, PM, ES), pp. 126–137.
TACAS-1999-Kreitz #automation #communication #configuration management: Automated Fast-Track Reconfiguration of Group Communication Systems (CK), pp. 104–118.
PLDI-1999-Frigo #compilation #fourier #performance: A Fast Fourier Transform Compiler (MF), pp. 169–180.
STOC-1999-ErgunKR #approximate #performance: Fast Approximate PCPs (FE, RK, RR), pp. 41–50.
Best-of-PLDI-1999-Frigo99a #compilation #fourier #performance: A fast Fourier transform compiler (with retrospective) (MF), pp. 642–655.
FLOPS-1999-Chakravarty #lazy evaluation #performance: Lazy Lexing is Fast (MMTC), pp. 68–84.
ICFP-1999-Okasaki #matrix #performance: From Fast Exponentiation to Square Matrices: An Adventure in Types (CO), pp. 28–35.
HCI-EI-1999-LaubliSWK #performance #process: Fatigue and Muscle Activity in Fast Repetitive Finger Movements (TL, MS, JW, HK), pp. 106–110.
ICEIS-1999-DuKM #algorithm #mining #performance #reuse: Two Fast Algorithms for Repeated Mining of Association Rules Based on Ressource Reuse (XD, KK, AM), pp. 65–73.
KDD-1999-LarsenA #clustering #documentation #effectiveness #linear #mining #performance #using: Fast and Effective Text Mining Using Linear-Time Document Clustering (BL, CA), pp. 16–22.
KDD-1999-ZhangRL #database #estimation #kernel #performance #scalability #using: Fast Density Estimation Using CF-Kernel for Very Large Databases (TZ, RR, ML), pp. 312–316.
SAC-1999-KocberberC #information retrieval #multi #performance: Compressed Multi-Framed Signature Files: An Index Structure for Fast Information Retrieval (SK, FC), pp. 221–226.
HPCA-1999-GatlinC #memory management #performance: Memory Hierarchy Considerations for Fast Transpose and Bit-Reversals (KSG, LC), pp. 33–42.
PPoPP-1999-MainwaringC #challenge #communication #design #network #performance: Design Challenges of Virtual Networks: Fast, General-Purpose Communication (AMM, DEC), pp. 119–130.
SOSP-1999-ShapiroSF #named #performance: EROS: a fast capability system (JSS, JMS, DJF), pp. 170–185.
IWTCS-1999-ProbertW #functional #generative #performance #testing #using: Fast Functional Test Generation Using an SDL Model (RLP, AWW), pp. 299–316.
RTA-1999-Gobel #performance #symmetry: Fast Rewriting of Symmetric Polynomials (MG), pp. 371–381.
DAC-1998-BauerBKV #configuration management #logic #performance #simulation: A Reconfigurable Logic Machine for Fast Event-Driven Simulation (JB, MB, IK, PV), pp. 668–671.
DAC-1998-DrechslerDG #performance: Fast Exact Minimization of BDDs (RD, ND, WG), pp. 200–205.
DAC-1998-El-MalehKR #learning #performance: A Fast Sequential Learning Technique for Real Circuits with Application to Enhancing ATPG Performance (AHEM, MK, JR), pp. 625–631.
DAC-1998-GhoshDJ #low cost #performance #testing: A Fast and Low Cost Testing Technique for Core-Based System-on-Chip (IG, SD, NKJ), pp. 542–547.
DAC-1998-Kung #algorithm #library #optimisation #performance: A Fast Fanout Optimization Algorithm for Near-Continuous Buffer Libraries (DSK), pp. 352–355.
DAC-1998-LuoWA #functional #hybrid #performance #simulation: Hybrid Techniques for Fast Functional Simulation (YL, TW, AA), pp. 664–667.
DAC-1998-ShiLKY #3d #algorithm #performance: A Fast Hierarchical Algorithm for 3-D Capacitance Extraction (WS, JL, NK, TY), pp. 212–217.
DAC-1998-SunVJ #performance #verification: Fast State Verification (DS, BV, WJ), pp. 619–624.
DATE-1998-FlottesPRV #effectiveness #performance: Scanning Datapaths: A Fast and Effective Partial Scan Selection Technique (MLF, RP, BR, LV), pp. 921–922.
DATE-1998-HsiaoC #performance #sequence: State Relaxation Based Subsequence Removal for Fast Static Compaction in Sequential Circuits (MSH, STC), pp. 577–582.
DATE-1998-MarquesKWS #3d #algorithm #modelling #order #performance #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-RudnickVECPR #generative #performance #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-SzekelyR #performance #static analysis: Fast Field Solvers for Thermal and Electrostatic Analysis (VS, MR), pp. 518–523.
VLDB-1998-GehrkeRG #dataset #framework #named #performance #scalability: RainForest — A Framework for Fast Decision Tree Construction of Large Datasets (JG, RR, VG), pp. 416–427.
VLDB-1998-KornLKF #data mining #mining #paradigm #performance: Ratio Rules: A New Paradigm for Fast, Quantifiable Data Mining (FK, AL, YK, CF), pp. 582–593.
VLDB-1998-OoiGT #database #performance #semistructured data: Fast High-Dimensional Data Search in Incomplete Databases (BCO, CHG, KLT), pp. 357–367.
PLDI-1998-Adl-TabatabaiCLPS #code generation #compilation #effectiveness #java #performance: Fast, Effective Code Generation in a Just-In-Time Java Compiler (ARAT, MC, GYL, VMP, JMS), pp. 280–290.
STOC-1998-Grover #algorithm #framework #performance #quantum: A Framework for Fast Quantum Mechanical Algorithms (LKG), pp. 53–62.
WIA-1998-Watson #algorithm #performance: A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs (BWW), pp. 121–132.
CIKM-1998-QuWW #multi #performance: Supporting Fast Search in Time Series for Movement Patterns in Multiple Scales (YQ, CW, XSW), pp. 251–258.
ICML-1998-FriessCC #algorithm #kernel #learning #performance: 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 #performance: A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization (MJK, YM), pp. 269–277.
ICPR-1998-CordellaFSTV #algorithm #evaluation #graph #performance: Graph matching: a fast algorithm and its evaluation (LPC, PF, CS, FT, MV), pp. 1582–1584.
ICPR-1998-HaindlZ #image #performance #segmentation: Fast segmentation of planar surfaces in range images (MH, PZ), pp. 985–987.
ICPR-1998-JuanVA #algorithm #approximate #nearest neighbour #performance: 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 #performance: Approaches to decompose flat structuring element for fast overlapping search morphological algorithm (RWKL, HHSI, CKL), pp. 1461–1463.
ICPR-1998-PalauS #approximate #classification #nearest neighbour #performance: The labelled cell classifier: a fast approximation to k nearest neighbors (AMP, RRS), pp. 823–827.
ICPR-1998-SegenK #3d #gesture #interface #performance #recognition: Fast and accurate 3D gesture recognition interface (JS, SK), pp. 86–91.
ICPR-1998-TakacsW #image #library #metric #performance #using: Fast searching of digital face libraries using binary image metrics (BT, HW), pp. 1235–1237.
KDD-1998-AndersonM #learning #performance: ADtrees for Fast Counting and for Fast Learning of Association Rules (BSA, AWM), pp. 134–138.
KDD-1998-DuMouchelS #algorithm #detection #performance #testing: A Fast Computer Intrusion Detection Algorithm Based on Hypothesis Testing of Command Transition Probabilities (WD, MS), pp. 189–193.
KDD-1998-JohnsonKN #2d #performance: Fast Computation of 2-Dimensional Depth Contours (TJ, IK, RTN), pp. 224–228.
KDD-1998-KeoghP #classification #clustering #feedback #performance #representation: An Enhanced Representation of Time Series Which Allows Fast and Accurate Classification, Clustering and Relevance Feedback (EJK, MJP), pp. 239–243.
KDD-1998-SteegRW #correlation #detection #higher-order #multi #performance: Coincidence Detection: A Fast Method for Discovering Higher-Order Correlations in Multidimensional Data (EWS, DAR, EW), pp. 112–120.
SIGIR-1998-ChiaramellaMMOP #image #performance #retrieval #towards: Towards a Fast Precision-Oriented Image Retrieval System (YC, PM, MM, IO, MP), pp. 383–384.
SIGIR-1998-MouraNZB #fault #performance: Fast Searching on Compressed Text Allowing Errors (ESdM, GN, NZ, RABY), pp. 298–306.
SIGIR-1998-YamanaKKSY #parallel #performance: Fast Speculative Search Engine on the Highly Parallel Computer EM-X (HY, HK, YK, HS, YY), p. 390.
POPL-1998-DeFouwGC #analysis #interprocedural #performance: Fast Interprocedural Class Analysis (GD, DG, CC), pp. 222–236.
SAC-1998-AhmedDR #fuzzy #graph #memory management #performance #reuse #using: Fast recall of reusable fuzzy plans using acyclic directed graph memory (MA, ED, DCR), pp. 272–276.
SAC-1998-MerkleGL #algorithm #performance #scalability #search-based: Scalability of an MPI-based fast messy genetic algorithm (LDM, GHGJ, GBL), pp. 386–393.
ASPLOS-1998-SchnarrL #performance #simulation #using: Fast Out-Of-Order Processor Simulation Using Memoization (ES, JRL), pp. 283–294.
CC-1998-LelaitGE #algorithm #performance: A New Fast Algorithm for Optimal Register Allocation in Modulo Scheduled Loops (SL, GRG, CE), pp. 204–218.
HPCA-1998-LangendoenHB #network #performance: Challenging Applications on Fast Networks (KL, RFHH, HEB), pp. 68–79.
HPCA-1998-MackenzieKFLLAK #performance: Exploiting Two-Case Delivery for Fast Protected Messaging (KM, JK, MF, WL, VL, AA, MFK), pp. 231–242.
HPDC-1998-GianniniC #architecture #clustering #communication #performance: A Software Architecture for Global Address Space Communication on Clusters: Put/Get on Fast Messages (LAG, AAC), pp. 330–337.
HPDC-1998-LauriaPC #communication #performance: Efficient Layering for High Speed Communication: Fast Messages 2.x (ML, SP, AAC), pp. 10–20.
CADE-1998-OliartS #algorithm #performance: A Fast Algorithm for Uniform Semi-Unification (AO, WS), pp. 239–253.
DAC-1997-CroixW #logic #performance #synthesis: A Fast And Accurate Technique To Optimize Characterization Tables For Logic Synthesis (JFC, DFW), pp. 337–340.
DAC-1997-KapurZ #parametricity #performance: A Fast Method of Moments Solver for Efficient Parameter Extraction of MCMs (SK, JZ), pp. 141–146.
DAC-1997-PasseroneLCS #analysis #hardware #performance #prototype #trade-off: Fast Hardware/Software Co-Simulation for Virtual Prototyping and Trade-Off Analysis (CP, LL, MC, ALSV), pp. 389–394.
EDTC-1997-GavrilovGRBJV #performance: Fast power loss calculation for digital static CMOS circuits (SG, AG, SR, DB, LGJ, GV), pp. 411–415.
EDTC-1997-HertwigW #performance: Fast controllers for data dominated applications (AH, HJW), pp. 84–89.
EDTC-1997-HettDB #order #performance #synthesis: Fast and efficient construction of BDDs by reordering based synthesis (AH, RD, BB), pp. 168–175.
EDTC-1997-LaquaiRW #metric #performance #testing: A production-oriented measurement method for fast and exhaustive Iddq tests (BL, HR, HW), pp. 279–286.
EDTC-1997-OzimekVT #array #implementation #performance #scheduling: Optimal scheduling for fast systolic array implementations (IO, RV, JFT), p. 620.
ICDAR-1997-TakahashiYM #algorithm #online #performance #recognition: A Fast HMM Algorithm for On-line Handwritten Character Recognition (KT, HY, TM), pp. 369–375.
ICDAR-1997-WolfNS #image #performance: Fast Address Block Location on Handwritten and Machine Printed Mail--piece Images (MW, HN, WS), pp. 753–757.
SIGMOD-1997-BerchtoldBBKK #database #parallel #performance #similarity: Fast Parallel Similarity Search in Multimedia Databases (SB, CB, BB, DAK, HPK), pp. 1–12.
VLDB-1997-GibbonsMP #approximate #incremental #maintenance #performance: Fast Incremental Maintenance of Approximate Histograms (PBG, YM, VP), pp. 466–475.
VLDB-1997-RossS #performance: Fast Computation of Sparse Datacubes (KAR, DS), pp. 116–125.
PLDI-1997-PolettoEK #code generation #flexibility #named #performance: tcc: A System for Fast, Flexible, and High-level Dynamic Code Generation (MP, DRE, MFK), pp. 109–121.
SAS-1997-WaddellD #effectiveness #performance: Fast and Effective Procedure Inlining (OW, RKD), pp. 35–52.
STOC-1997-BuhlerSS #fourier #integer #performance #precise #using: Fast and Precise Computations of Discrete Fourier Transforms Using Cyclotomic Integers (JB, MAS, VS), pp. 40–47.
KDD-1997-Drucker #classification #performance: Fast Committee Machines for Regression and Classification (HD), pp. 159–162.
KDD-1997-KeoghS #approach #database #pattern matching #performance #probability: A Probabilistic Approach to Fast Pattern Matching in Time Series Databases (EJK, PS), pp. 24–30.
KDD-1997-MihalisinT #data mining #mining #performance #robust #visual notation: Fast Robust Visual Data Mining (TM, JT), pp. 231–234.
KDD-1997-ZakiPOL #algorithm #performance: New Algorithms for Fast Discovery of Association Rules (MJZ, SP, MO, WL), pp. 283–286.
KDD-1997-ZamirEMK #clustering #documentation #performance #web: Fast and Intuitive Clustering of Web Documents (OZ, OE, OM, RMK), pp. 287–290.
SIGIR-1997-VelezWSG #effectiveness #performance #query #refinement: Fast and Effective Query Refinement (BV, RW, MAS, DKG), pp. 6–15.
POPL-1997-ShapiroH #analysis #performance #points-to: Fast and Accurate Flow-Insensitive Points-To Analysis (MS, SH), pp. 1–14.
RE-1997-GuptaJKW #generative #named #performance: Auditdraw: Generating Audits the FAST Way (NKG, LJJ, EK, DMW), pp. 188–197.
HPCA-1997-WelshBE #communication #interface #network #performance: ATM and Fast Ethernet Network Interfaces for User-Level Communication (MW, AB, TvE), pp. 332–342.
DAC-1996-ChenCW #optimisation #performance: Fast Performance-Driven Optimization for Buffered Clock Trees Based on Lagrangian Relaxation (CPC, YWC, DFW), pp. 405–408.
DAC-1996-HiguchiM #algorithm #finite #performance #reduction #state machine: A Fast State Reduction Algorithm for Incompletely Specified Finite State Machines (HH, YM), pp. 463–466.
DAC-1996-PhilippsCL #analysis #performance #reduction: Efficient Full-Wave Electromagnetic Analysis via Model-Order Reduction of Fast Integral Transforms (JRP, EC, DDL), pp. 377–382.
DAC-1996-Sheehan #performance: An AWE Technique for Fast Printed Circuit Board Delays (BNS), pp. 539–543.
DAC-1996-SunDH #equation #geometry #independence #parametricity #performance #using: Fast Parameters Extraction of General Three-Dimension Interconnects Using Geometry Independent Measured Equation of Invariance (WS, WWMD, WHI), pp. 371–376.
VLDB-1996-KornSFSP #database #image #nearest neighbour #performance: Fast Nearest Neighbor Search in Medical Image Databases (FK, NS, CF, ELS, ZP), pp. 215–226.
VLDB-1996-Rengarajan #how #performance #sql: How System 11 SQL Server Became Fast (TKR), p. 590.
RWLW-1996-Eker #equation #performance: Fast matching in combinations of regular equational theories (SE), pp. 90–109.
WPC-1996-GriswoldAM #flexibility #pattern matching #performance: Fast, Flexible Syntactic Pattern Matching and Processing (WGG, DCA, CM), pp. 144–153.
PLDI-1996-AuslanderPCEB #compilation #effectiveness #performance: Fast, Effective Dynamic Compilation (JA, MP, CC, SJE, BNB), pp. 149–159.
PLDI-1996-Engler #code generation #named #performance: VCODE: a Retargetable, Extensible, Very Fast Dynamic Code Generation System (DRE), pp. 160–170.
STOC-1996-CheriyanT #algorithm #performance: Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation (Extended Abstract) (JC, RT), pp. 37–46.
STOC-1996-Grover #algorithm #database #performance #quantum: A Fast Quantum Mechanical Algorithm for Database Search (LKG), pp. 212–219.
STOC-1996-McCormick #algorithm #parametricity #performance #scheduling: Fast Algorithms for Parametric Scheduling Come from Extensions to Parametric Maximum Flow (STM), pp. 319–328.
ICALP-1996-HerleyPP #backtracking #performance: Fast Deterministic Backtrack Search (KTH, AP, GP), pp. 598–609.
ICALP-1996-JennerV #performance: Fast Asynchronous Systems in Dense Time (LJ, WV), pp. 75–86.
AKDDM-1996-AgrawalMSTV #performance: Fast Discovery of Association Rules (RA, HM, RS, HT, AIV), pp. 307–328.
CIKM-1996-Kamel #performance #retrieval: Fast Retrieval of Cursive Handwriting (IK), pp. 91–98.
ICPR-1996-ChaoN #3d #performance: Cubical singular simplex model for 3D objects and fast computation of homology groups (JC, JN), pp. 190–194.
ICPR-1996-Chetverikov #algorithm #interactive #performance: Structural filtering with texture feature-based interaction maps: fast algorithm and applications (DC), pp. 795–799.
ICPR-1996-GarciaB #image #performance: Fast extraction of surface primitives from range images (MAG, LB), pp. 568–572.
ICPR-1996-HsiehLFK #algorithm #image #performance: A fast algorithm for image registration without predetermining correspondences (JWH, HYML, KCF, MTK), pp. 765–769.
ICPR-1996-HuangHH #adaptation #estimation #performance #video: Adaptive early jump-out technique for fast motion estimation in video coding (HCH, YPH, WLH), pp. 864–868.
ICPR-1996-JiangHF #approach #detection #documentation #performance: A fast approach to detect and correct skew documents (HFJ, CCH, KCF), pp. 742–746.
ICPR-1996-LinT #algorithm #performance #video: Fast full-search block-matching algorithm for motion-compensated video compression (YCL, SCT), pp. 914–918.
ICPR-1996-LiuD #algorithm #performance: Sparse pixel tracking: a fast vectorization algorithm applied to engineering drawings (WL, DD), pp. 808–812.
ICPR-1996-MollerGW #clustering #network #performance: Fast vector quantizer on neural clustering networks providing globally optimal cluster solutions (UM, MG, HW), pp. 351–355.
ICPR-1996-MorimotoC #image #performance: Fast electronic digital image stabilization (CM, RC), pp. 284–288.
ICPR-1996-SaidCS #performance: Dynamical morphological processing: a fast method for base line extraction (JNS, MC, CYS), pp. 8–12.
ICPR-1996-SchlicherBV #locality #performance: Fast analytical medial-axis localization in convex polyhedra (MPPS, EB, PWV), pp. 55–61.
ICPR-1996-Shimshoni #3d #image #nondeterminism #performance #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 #performance #using: Fast k-NN classification rule using metric on space-filling curves (ESR, AK), pp. 121–125.
ICPR-1996-WestlingD #generative #interactive #performance #reasoning #recognition: Object recognition by fast hypothesis generation and reasoning about object interactions (MFW, LSD), pp. 148–153.
SEKE-1996-HwangCWS #3d #performance #using #visualisation: A Fast 3-D Visualization Methodology Using Characteristic Views of Objects (SH, SYC, TW, PCYS), pp. 577–584.
OOPSLA-1996-BaconS #c++ #performance #static analysis: Fast Static Analysis of C++ Virtual Function Calls (DFB, PFS), pp. 324–341.
SAC-1996-CucuccioGS #fuzzy #logic #low cost #performance: 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.
HPDC-1996-LuO #algorithm #parallel #performance: A Massively Parallel Fast Multipole Algorithm in Three Dimensions (EJLL, DIO), pp. 40–48.
CSL-1996-BaazL #performance: Fast Cut-Elimination by Projection (MB, AL), pp. 18–33.
DAC-1995-LiuPD #performance #scalability: A Fast State Assignment Procedure for Large FSMs (SL, MP, AMD), pp. 327–332.
DAC-1995-SparmannLCR #fault #identification #performance #robust: Fast Identification of Robust Dependent Path Delay Faults (US, DL, KTC, SMR), pp. 119–125.
DAC-1995-TremblayMIK #analysis #architecture #flexibility #performance #trade-off: A Fast and Flexible Performance Simulator for Micro-Architecture Trade-off Analysis on UltraSPARC-I (MT, GM, AI, LK), pp. 2–6.
ICDAR-v2-1995-DeforgesB #detection #documentation #image #multi #performance #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-SauvolaP #analysis #classification #feature model #performance #segmentation #using: Page segmentation and classification using fast feature extraction and connectivity analysis (JJS, MP), pp. 1127–1131.
SIGMOD-1995-FaloutsosL #algorithm #dataset #multi #named #performance #visualisation: FastMap: A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets (CF, KIL), pp. 163–174.
VLDB-1995-AgrawalLSS #database #performance #scalability #similarity: Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases (RA, KIL, HSS, KS), pp. 490–501.
STOC-1995-AfekDT #performance: Wait-free made fast (Extended Abstract) (YA, DD, DT), pp. 538–547.
STOC-1995-HartI #performance: Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal (Extended Abstract) (WEH, SI), pp. 157–168.
ICALP-1995-BermondGRV #performance: Fast Gossiping by Short Messages (JCB, LG, AAR, UV), pp. 135–146.
FPCA-1995-GoncalvesA #performance #source code: Cache Performance of Fast-Allocating Programs (MJRG, AWA), pp. 293–305.
ICML-1995-CichoszM #difference #learning #performance: Fast and Efficient Reinforcement Learning with Truncated Temporal Differences (PC, JJM), pp. 99–107.
ICML-1995-Cohen #effectiveness #induction #performance: Fast Effective Rule Induction (WWC), pp. 115–123.
KDD-1995-StolorzNMMSSYNCMF #data mining #dataset #mining #performance #scalability: Fast Spatio-Temporal Data Mining of Large Geophysical Datasets (PES, HN, EM, RRM, ECS, JRS, JY, KWN, SYC, CRM, JDF), pp. 300–305.
SIGIR-1995-Brown #evaluation #information retrieval #performance #query: Fast Evaluation of Structured Queries for Information Retrieval (EWB0), pp. 30–38.
SIGIR-1995-Chien #natural language #performance: Fast and Quasi-Natural Language Search for Gigabits of Chinese Texts (LFC), pp. 112–120.
PLILP-1995-DawsonRR #design #implementation #logic programming #performance #source code: Design and Implementation of Jump Tables for Fast Indexing of Logic Programs (SD, CRR, IVR), pp. 133–150.
SAC-1995-RunklerG #algorithm #multi #performance #set: Multidimensional defuzzification — fast algorithms for the determination of crisp characteristic subsets (TAR, MG), pp. 575–579.
HPCA-1995-Panda #multi #network #performance: Fast Barrier Synchronization in Wormhole k-ary n-cube Networks with Multidestination Worms (DKP), pp. 200–209.
HPDC-1995-JacobL #algorithm #performance #recursion #refinement: A Spanning Tree Based Recursive Refinement Algorithm for Fast Task Mapping (JCJ, SYL), pp. 58–65.
IWMM-1995-SuzukiKT #named #performance #scalability: MOA — A Fast Sliding Compaction Scheme for a Large Storage Space (MS, HK, MT), pp. 197–210.
DAC-1994-BuiM #algorithm #clustering #hybrid #performance #problem #search-based: A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut Partitioning Problem on Hypergraphs (TNB, BRM), pp. 664–669.
EDAC-1994-FranssenNSCM #control flow #optimisation #performance #simulation: Control flow optimization for fast system simulation and storage minimization (FHMF, LN, HS, FC, HDM), pp. 20–24.
EDAC-1994-LinCL #fault #named #performance: TRANS: A Fast and Memory-Efficient Path Delay Fault Simulator (MCL, JEC, CLL), pp. 508–512.
EDAC-1994-VacherBGRS #fourier #implementation #parallel #performance: A VLSI Implementation of Parallel Fast Fourier Transform (AV, MB, AG, TR, AS), pp. 250–255.
SIGMOD-1994-FaloutsosRM #database #performance #sequence: Fast Subsequence Matching in Time-Series Databases (CF, MR, YM), pp. 419–429.
VLDB-1994-AgrawalS #algorithm #database #mining #performance #scalability: Fast Algorithms for Mining Association Rules in Large Databases (RA, RS), pp. 487–499.
VLDB-1994-BrownCC #incremental #information retrieval #performance: Fast Incremental Indexing for Full-Text Information Retrieval (EWB, JPC, WBC), pp. 192–202.
VLDB-1994-Galindo-LegariaPK #performance #question #random #why: Fast, Randomized Join-Order Selection — Why Use Transformations? (CAGL, AP, MLK), pp. 85–95.
SAS-1994-Consel #analysis #fixpoint #performance #strict: Fast Strictness Analysis Via Symbolic Fixpoint Iteration (CC), pp. 423–431.
STOC-1994-KollerMS #algorithm #game studies #performance #random: Fast algorithms for finding randomized strategies in game trees (DK, NM, BvS), pp. 750–759.
ICALP-1994-Feige #algorithm #graph #performance #random: A Fast Randomized LOGSPACE Algorithm for Graph Connectivity (UF), pp. 499–507.
ICALP-1994-GilM #parallel #performance: Simple Fast Parallel Hashing (JYG, YM), pp. 239–250.
ICALP-1994-HotzP #analysis #context-free grammar #performance: Fast Uniform Analysis of Coupled-Context-Free Languages (GH, GP), pp. 412–423.
CHI-1994-VenoliaN94a #named #performance #self: T-Cube: a fast, self-disclosing pen-based alphabet (DV, FN), pp. 265–270.
SIGIR-1994-Persin #documentation #performance #ranking: Document Filtering for Fast Ranking (MP), pp. 339–348.
SAC-1994-MerkleL #algorithm #analysis #parallel #performance #search-based: An initial analysis of data parallelism in the fast messy genetic algorithm (LDM, GBL), pp. 488–492.
SAC-1994-RunklerG #approximate #fuzzy #named #performance #realtime: DECADE — fast centroid approximation defuzzification for real time fuzzy control applications (TAR, MG), pp. 161–165.
SAC-1994-Sabharwal #algorithm #implementation #performance: A fast implementation of surface/surface intersection algorithm (CLS), pp. 333–337.
ASPLOS-1994-CarterKD #hardware #performance: Hardware Support for Fast Capability-based Addressing (NPC, SWK, WJD), pp. 319–327.
HPDC-1994-BornsteinS #performance: Data Reshuffling in Support of Fast I/O for Distributed-Memory Machines (CFB, PS), pp. 227–235.
HPDC-1994-LiHW #performance #program analysis #program transformation: Program Analysis and Transformations for Fast Data Sharing (AL, GH, LDW), pp. 131–138.
ICLP-1994-GallagherW #approximate #logic programming #performance #precise #source code: Fast and Precise Regular Approximations of Logic Programs (JPG, DAdW), pp. 599–613.
ILPS-1994-TangPGC #backtracking #logic programming #optimisation #parallel #performance: Last Parallel Call Optimization and Fast Backtracking in And-parallel Logic Programming Systems (DT, EP, GG, MC), pp. 683–684.
DAC-1993-KamonTW #3d #multi #named: FastHenry: A Multipole-Accelerated 3-D Inductance Extraction Program (MK, MJT, JW), pp. 678–683.
DAC-1993-LaiFW #data type #performance #query: HV/VH Trees: A New Spatial Data Structure for Fast Region Queries (GGL, DSF, DFW), pp. 43–47.
DAC-1993-MeyerC #fault #multi #performance #simulation: Fast Hierarchical Multi-Level Fault Simulation of Sequential Circuits with Switch-Level Accuracy (WM, RC), pp. 515–519.
DAC-1993-OhlrichEGS #algorithm #identification #morphism #named #performance #using: SubGemini: Identifying SubCircuits using a Fast Subgraph Isomorphism Algorithm (MO, CE, EG, LS), pp. 31–37.
DAC-1993-SriramK #approximate #performance: Fast Approximation of the Transient Response of Lossy Transmision Line Trees (MS, SMK), pp. 691–696.
ICDAR-1993-Bunke #algorithm #nearest neighbour #performance #taxonomy #word: A fast algorithm for finding the nearest neighbor of a word in a dictionary (HB), pp. 632–637.
ICDAR-1993-GuillevicS #performance #recognition: Cursive script recognition: A fast reader scheme (DG, CYS), pp. 311–314.
ICDAR-1993-ShabanLNR #image #implementation #performance: Fast image filtering implementation (MS, SL, LN, RB), pp. 735–738.
STOC-1993-CanettiR #performance: Fast asynchronous Byzantine agreement with optimal resilience (RC, TR), pp. 42–51.
STOC-1993-CooperL #linear #performance #protocol: Fast perfection-information leader-election protocol with linear immunity (JC, NL), pp. 662–671.
WSA-1993-FergusonH #abstract interpretation #algorithm #performance #using: Fast Abstract Interpretation Using Sequential Algorithms (AF, JH), pp. 45–59.
ICALP-1993-Kirousis #constraints #parallel #performance: Fast Parallel Constraint Satisfaction (LMK), pp. 418–429.
ICALP-1993-Schonhage #adaptation #finite #parallel #performance: Fast Parallel Computation of Characteristic Polynomials by Leverrier’s POwer Sum Method Adapted to Fields of Finite Characteristic (AS), pp. 410–417.
SAC-1993-JoshiRN #algorithm #network #performance #problem: A Fast Algorithm for Generalized Network Location Problems (DSJ, SR, CN), pp. 701–708.
DAC-1992-SarabiP #canonical #network #performance: Fast Exact and Quasi-Minimal Minimization of Highly Testable Fixed-Polarity AND/XOR Canonical Networks (AS, MAP), pp. 30–35.
SIGMOD-1992-AnalytiP #database #in memory #memory management #performance: Fast Search in Main Memory Databases (AA, SP), pp. 215–224.
STOC-1992-BlumR #learning #performance #query: Fast Learning of k-Term DNF Formulas with Queries (AB, SR), pp. 382–389.
ICALP-1992-Hagerup #integer #performance: Fast Integer Merging on the EREW PRAM (TH), pp. 318–329.
ICALP-1992-Westbrook #incremental #performance #testing: Fast Incremental Planarity Testing (JW), pp. 342–353.
LFP-1992-KaserPRRS #experience #implementation #lazy evaluation #parallel #performance: Fast Parallel Implementation of Lazy Languages — The EQUALS Experience (OK, SP, CRR, IVR, RCS), pp. 335–344.
CHI-1992-RowleyR #evaluation #user interface: The cognitive jogthrough: a fast-paced user interface evaluation procedure (DER, DGR), pp. 389–395.
ALP-1992-BundgenE #algorithm #analysis #normalisation #performance: A Fast Algorithm for Ground Normal Form Analysis (RB, HE), pp. 291–305.
PLILP-1992-KrallB #compilation #performance #prolog: Fast Prolog with VAM1p based Prolog Compiler (AK, TB), pp. 245–259.
ASPLOS-1992-BakerADOS #file system #memory management #performance #reliability: Non-Volatile Memory for Fast, Reliable File Systems (MB, SA, ED, JKO, MIS), pp. 10–22.
ASPLOS-1992-BershadRE #performance: Fast Mutual Exclusion for Uniprocessors (BNB, DDR, JRE), pp. 223–233.
IWPTS-1992-Koblentz #performance #testing: Issues in Testing Fast Packet Services over the Broadband ISDN (MK), pp. 3–18.
DAC-1991-FrancisRV #named #performance: Chortle-crf: Fast Technology Mapping for Lookup Table-Based FPGAs (RJF, JR, ZGV), pp. 227–233.
DAC-1991-Luk #constraints #generative #layout #performance #physics: A Fast Physical Constraint Generator for Timing Driven Layout (WKL), pp. 626–631.
DAC-1991-ParkK #automation #performance #scheduling: Fast and Near Optimal Scheduling in Automatic Data Path Aynthesis (ICP, CMK), pp. 680–685.
DAC-1991-ShihK #approach #equation #named #performance #using: ILLIADS: A New Fast MOS Timing Simulator Using Direct Equation-Solving Approach (YHS, SMK), pp. 20–25.
DAC-1991-VandrisS #algorithm #fault #memory management #performance #simulation: Algorithms for Fast, Memory Efficient Switch-Level Fault Simulation (EV, GES), pp. 138–143.
VLDB-1991-MohanN #performance #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.
STOC-1991-BabaiCFLS #algorithm #monte carlo #performance #permutation: Fast Monte Carlo Algorithms for Permutation Groups (LB, GC, LF, EML, ÁS), pp. 90–100.
STOC-1991-KedemPRS #parallel #performance: Combining Tentative and Definite Executions for Very Fast Dependable Parallel Computing (Extended Abstract) (ZMK, KVP, AR, PGS), pp. 381–390.
STOC-1991-LeightonMPSTT #algorithm #approximate #multi #performance #problem: Fast Approximation Algorithms for Multicommodity Flow Problems (FTL, FM, SAP, CS, ÉT, ST), pp. 101–111.
ICALP-1991-Hagerup #generative #parallel #performance #permutation #random: Fast Parallel Generation of Random Permutations (TH), pp. 405–416.
PLILP-1991-BaumF #performance: The System FLR (Fast Laboratory for Recomposition) (BB, PF), pp. 427–428.
DAC-1990-NiermannCP #fault #memory management #named #performance #proving: Proofs: A Fast, Memory Efficient Sequential Circuit Fault Simulator (TMN, WTC, JHP), pp. 535–540.
DAC-1990-SaabR #effectiveness #evolution #heuristic #layout #performance #probability #problem: Stochastic Evolution: a Fast Effective Heuristic for Some Generic Layout Problems (YS, VBR), pp. 26–31.
SIGMOD-1990-SalzbergTGSUV #distributed #named: FastSort: A Distributed Single-Input Single-Output External Sort (BS, AT, JG, MS, SU, BV), pp. 94–101.
PLDI-1990-Kessler #design #implementation #performance: Fast Breakpoints: Design and Implementation (PBK), pp. 78–84.
PLDI-1990-Wendt #code generation #performance #using: Fast Code Generation Using Automatically-Generated Decision Trees (ALW), pp. 9–15.
STOC-1990-Vishkin #pattern matching #performance: Deterministic Sampling-A New Technique for Fast Pattern Matching (UV), pp. 170–180.
Best-of-PLDI-1990-Kessler90a #design #implementation #performance: Fast breakpoints: design and implementation (with retrospective) (PBK), pp. 390–397.
ML-1990-BonelliPSW #named #performance: Newboole: A Fast GBML System (PB, AP, SS, SWW), pp. 153–159.
POPL-1990-SekarPR #analysis #performance #strict: Small Domains Spell Fast Strictness Analysis (RCS, SP, IVR), pp. 169–183.
CSL-1990-Durdanovic #algorithm #garbage collection #performance #prolog: A Fast Garbage Collection Algorithm for WAM-Based Prolog (ID), pp. 110–127.
DAC-1989-ChengY #difference #fault #memory management #performance #simulation #using: Differential Fault Simulation — a Fast Method Using Minimal Memory (WTC, MLY), pp. 424–428.
DAC-1989-Jones #compilation #online #performance: Fast Online/Offline Netlist Compilation of Hierarchical Schematics (LGJ), pp. 822–825.
DAC-1989-Kahng #performance: Fast Hypergraph Partition (ABK), pp. 762–766.
STOC-1989-HastadLN #performance #using: Fast Computation Using Faulty Hypercubes (Extended Abstract) (JH, FTL, MN), pp. 251–263.
STOC-1989-Vallee #integer #performance #polynomial: Provably Fast Integer Factoring with Quasi-Uniform Small Quadratic Residues (BV), pp. 98–106.
OOPSLA-1989-DixonMSV #inheritance #multi #performance: A Fast Method Dispatcher for Compiled Languages with Multiple Inheritance (RD, TM, PS, MV), pp. 211–214.
POPL-1989-CooperK #alias #analysis #interprocedural #performance: Fast Interprocedural Alias Analysis (KDC, KK), pp. 49–59.
RTA-1989-Christian #performance #summary: Fast Knuth-Bendix Completion: Summary (JC), pp. 551–555.
DAC-1988-BeattyB #analysis #incremental #performance #using: Fast Incremental Circuit Analysis Using Extracted Hierarchy (DLB, REB), pp. 495–500.
DAC-1988-HelliwellP #algorithm #multi #performance: A Fast Algorithm to Minimize Multi-Output Mixed-Polarity Generalized Reed-Muller Forms (MH, MAP), pp. 427–432.
DAC-1988-KuoCS #algorithm #performance: Fast Algorithm for Optimal Layer Assignment (YSK, TCC, WKS), pp. 554–559.
DAC-1988-MotoharaMUMS #approach #fault #performance #simulation: An Approach to Fast Hierarchical Fault Simulation (AM, MM, MU, YM, MS), pp. 698–703.
DAC-1988-TsayKH #algorithm #named #performance: Proud: A Fast Sea-of-Gates Placement Algorithm (RST, ESK, CPH), pp. 318–323.
VLDB-1988-FaloutsosC #comparison #data access #design #performance #scalability: Fast Text Access Methods for Optical and Large Magnetic Disks: Designs and Performance Comparison (CF, RC), pp. 280–293.
PLDI-1988-FraserW #automation #code generation #generative #optimisation #performance: Automatic Generation of Fast Optimizing Code Generators (CWF, ALW), pp. 79–84.
STOC-1988-PintzSS #infinity #performance #testing: Two Infinite Sets of Primes with Fast Primality Tests (JP, WLS, ES), pp. 504–509.
OOPSLA-1988-Rose #hardware #performance: Fast Dispatch Mechanisms for Stock Hardware (JRR), pp. 27–35.
JICSCP-1988-Shintani88 #performance #prolog: A Fast Prolog-Based Production System KORE/IE (TS), pp. 26–41.
DAC-1987-Dion #performance: Fast Printed Circuit Board Routing (JD), pp. 727–734.
DAC-1987-NguyenPG #named #performance: PALMINI — Fast Boolean Minimizer for Personal Computers (LBN, MAP, NBG), pp. 615–621.
DAC-1987-Serlet #combinator #performance: Fast, Small, and Static Combinatorial CMOS Circuits (BS), pp. 451–458.
DAC-1987-TanTBVP #performance #self #simulation: A Fast Signature Simulation Tool for Built-In Self-Testing Circuits (SBT, KT, KB, PV, RP), pp. 17–25.
SIGMOD-1987-Hardwick #database #design #optimisation #performance #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-LiRW #database #performance #scalability: A New Compression Method with Fast Searching on Large Databases (JL, DR, HKTW), pp. 311–318.
PLDI-1987-May #named #performance: Mimic: a fast system/370 simulator (CM), pp. 1–13.
STOC-1987-NaorNS #algorithm #graph #parallel #performance: Fast Parallel Algorithms for Chordal Graphs (Extended Abstract) (JN, MN, AAS), pp. 355–364.
SIGIR-1987-OommenM #automaton #clustering #learning #performance #probability #using: Fast Object Partitioning Using Stochastic Learning Automata (BJO, DCYM), pp. 111–122.
DAC-1986-BarzilaiBHIS #analysis #fault #named #performance #verification: SLS — a fast switch level simulator for verification and fault coverage analysis (ZB, DKB, LMH, VSI, GMS), pp. 164–170.
STOC-1986-Ben-OrFKT #algorithm #parallel #performance #polynomial: A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots (MBO, EF, DK, PT), pp. 340–349.
STOC-1986-KapoorV #algorithm #multi #performance #polynomial #programming: Fast Algorithms for Convex Quadratic Programming and Multicommodity Flows (SK, PMV), pp. 147–159.
STOC-1986-Mulmuley #algorithm #matrix #parallel #performance #rank: A Fast Parallel Algorithm to Compute the Rank of a Matrix over an Arbitrary Field (KM), pp. 338–339.
ICALP-1986-SpirakisT #algorithm #performance: A Very Fast, Practical Algorithm for Finding a Negative Cycle in a Digraph (PGS, AKT), pp. 397–406.
OOPSLA-1986-LewisGFT #named #performance: Swamp: A Fast Processor for Smalltalk-80 (DML, DRG, RJF, BWT), pp. 131–139.
ICLP-1986-Buettner86 #decompiler #performance #prolog: Fast Decompilation of Compiled Prolog Clauses (KAB), pp. 663–670.
DAC-1985-HahnF #music #named #performance #simulation: MuSiC: an event-flow computer for fast simulation of digital systems (WH, KF), pp. 338–344.
DAC-1985-Lemaire #design #named #performance #process #prototype #testing: GAMMA: a fast prototype design, build, and test process (LTL), pp. 773–776.
SIGMOD-1985-Robinson #hardware #performance: A Fast General-Purpose Hardware Synchronisation Mechanism (JTR), pp. 122–130.
STOC-1985-Heide #algorithm #performance #problem #strict: Fast Algorithms for N-Dimensional Restrictions of Hard Problems (FMadH), pp. 413–420.
ICALP-1985-Fortune #algorithm #performance: A Fast Algorithm for Polygon Containment by Translation (Extended Abstract) (SF), pp. 189–198.
FPCA-1985-Kieburtz85 #performance: The G-Machine: A Fast, Graph-Reduction Evaluator (RBK), pp. 400–413.
FPCA-1985-Plaisted85 #architecture #data flow #performance: An Architecture for fast Data Movement in the FFP Machine (DAP), pp. 147–163.
RTA-1985-PurdomB #algorithm #performance: Fast Many-to-One Matching Algorithms (PWPJ, CAB), pp. 407–416.
STOC-1984-Clarkson #algorithm #approximate #geometry #performance: Fast Expected-Time and Approximation Algorithms for Geometric Minimum Spanning Trees (Extended Abstract) (KLC), pp. 342–348.
STOC-1984-KarpW #algorithm #independence #parallel #performance #problem #set: A Fast Parallel Algorithm for the Maximal Independent Set Problem (RMK, AW), pp. 266–272.
ICALP-1984-Jung #complexity #matrix #on the #performance #probability #problem: On Probabilistic Tape Complexity and Fast Circuits for Matrix Inversion Problems (Extended Abstract) (HJ), pp. 281–291.
SIGMOD-1983-JarkeK #performance #quantifier #query: Range Nesting: A Fast Method to Evaluate Quantified Queries (MJ, JK), pp. 196–206.
ICALP-1983-LangSSS #algorithm #performance #sorting: A Fast Sorting Algorithm for VLSI (HWL, MS, HS, HS), pp. 408–419.
SOSP-1983-Stephenson #performance: Fast Fits (CJS), pp. 30–32.
SIGMOD-1982-BernsteinB #calculus #performance #quantifier #relational #testing: Fast Methods for Testing Quantified Relational Calculus Assertions (PAB, BTB), pp. 39–50.
STOC-1982-Bach #algorithm #performance: Fast Algorithms under the Extended Riemann Hypothesis: A Concrete Estimate (EB), pp. 290–295.
ICALP-1982-DobkinK #detection #performance: Fast Detection of Polyhedral Intersections (DPD, DGK), pp. 154–165.
ASPLOS-1982-Lampson #performance: Fast Procedure Calls (BWL), pp. 66–76.
STOC-1981-JosephY #modelling #performance #polynomial #source code: Fast Programs for Initial Segments and Polynomial Time Computation in Weak Models of Arithmetic (Preliminary Abstract) (DJ, PY), pp. 55–61.
DAC-1980-SmithSP #component #named #performance: Comet — a fast component placer (VKS, RJSI, PAP), pp. 465–471.
DAC-1980-TadaYKS #performance #strict: A fast maze router with iterative use of variable search space restriction (FT, KY, TK, TS), pp. 250–254.
DAC-1980-Ulrich #flexibility #logic #performance #simulation: Table lookup techniques for fast and flexible digital logic simulation (EU), pp. 560–563.
VLDB-1980-BernsteinBC #maintenance #performance #semantics #using: Fast Maintenance of Semantic Integrity Assertions Using Redundant Aggregate Data (PAB, BTB, EMC), pp. 126–136.
STOC-1980-Lynch #distributed #performance: Fast Allocation of Nearby Resources in a Distributed System (NAL), pp. 70–81.
ICALP-1980-Reischuk #implementation #multi #performance: A “Fast Implementation” of a Multidimensional Storage into a Tree Storage (RR), pp. 531–542.
DAC-1979-Meyer #interactive #low cost #performance: A low cost satellite for fast interactive graphics in a time-sharing environment (BM), pp. 39–44.
STOC-1979-Kosaraju79a #algorithm #array #graph #parallel #performance #problem: Fast Parallel Processing Array Algorithms for some Graph Problems (Preliminary Version) (SRK), pp. 231–236.
ICALP-1979-Commentz-Walter #algorithm #performance #string: A String Matching Algorithm Fast on the Average (BCW), pp. 118–132.
DAC-1978-Soukup #performance: Fast maze router (JS), pp. 100–102.
ICSE-1978-BrowneJ #generative #named #performance #program analysis: FAST: A Second Generation Program Analysis System (JCB, DBJ), pp. 142–148.
DAC-1977-Baird #algorithm #analysis #performance: Fast algorithms for LSI artwork analysis (HSB), pp. 303–311.
STOC-1977-AngluinV #algorithm #performance #probability: Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings (DA, LGV), pp. 30–41.
POPL-1975-GrahamW #algorithm #analysis #linear #performance: A Fast and Usually Linear Algorithm for Global Flow Analysis (SLG, MNW), pp. 22–34.
STOC-1973-FischerS #integer #multi #online #performance: Fast On-Line Integer Multiplication (MJF, LJS), pp. 67–72.
STOC-1973-Moenck #performance: Fast Computation of GCDs (RTM), pp. 142–151.
STOC-1972-Fiduccia #algorithm #evaluation #fourier #performance #polynomial #revisited: Polynomial Evaluation via the Division Algorithm: The Fast Fourier Transform Revisited (CMF), pp. 88–93.
STOC-1971-Fiduccia #matrix #multi #performance: Fast Matrix Multiplication (CMF), pp. 45–49.