BibSLEIGH — algorithm tag

algorithm

algorithm

Tag #algorithm

4733 papers:

ASPLOS-2020-SunC #co-evolution #design #named: SAC: A Co-Design Cache Algorithm for Emerging SMR-based High-Density Disks (DS, YC), pp. 1047–1061.
CC-2020-ChidaKITS #linear #parsing: Is stateful packrat parsing really linear in practice? a counter-example, an improved grammar, and its parsing algorithms (NC, YK, DI, KT, KS), pp. 155–166.
CGO-2020-JavanmardAKPCH #compilation #divide and conquer #multi #parametricity #programming #recursion #using: Deriving parametric multi-way recursive divide-and-conquer dynamic programming algorithms using polyhedral compilers (MMJ, ZA, MK, LNP, RC, RJH), pp. 317–329.
CGO-2020-ZhangBCDKAS #graph #optimisation #order: Optimizing ordered graph algorithms with GraphIt (YZ, AB, XC, LD, SK, SPA, JS), pp. 158–170.
CSL-2020-Parys #game studies: Parity Games: Another View on Lehtinen's Algorithm (PP), p. 15.
CSL-2020-SchmidtSVZK #complexity: Dynamic Complexity Meets Parameterised Algorithms (JS, TS, NV, TZ, IK), p. 17.
EDM-2019-BahargamLT #clustering #complexity #problem: The Guided Team-Partitioning Problem: Definition, Complexity, and Algorithm (SB, TL, ET).
EDM-2019-LevyHTESGCT #education #empirical: Teacher vs. Algorithm: Double-blind experiment of content sequencing in mathematics (BL, AH, OT, OE, AS, KG, AC, MT).
EDM-2019-Reddick #learning #using: Using a Glicko-based Algorithm to Measure In-Course Learning (RR).
ICPC-2019-MashhadiH #empirical #mining #specification: An empirical study on practicality of specification mining algorithms on a real-world application (MJM, HH), pp. 65–69.
MSR-2019-MarkovtsevLMSB #consistency #named #nondeterminism: STYLE-ANALYZER: fixing code style inconsistencies with interpretable unsupervised algorithms (VM, WL, HM, KS, EB), pp. 468–478.
SANER-2019-NghiYJ #classification #dependence #network: Bilateral Dependency Neural Networks for Cross-Language Algorithm Classification (BDQN, YY, LJ), pp. 422–433.
CIAA-2019-Denzumi #sequence: New Algorithms for Manipulating Sequence BDDs (SD), pp. 108–120.
DLT-2019-KuperbergPP #automaton #induction: Coinductive Algorithms for Büchi Automata (DK, LP, DP), pp. 206–220.
FM-2019-MoscatoTFM #float #implementation: Provably Correct Floating-Point Implementation of a Point-in-Polygon Algorithm (MMM, LT, MAF, CAM), pp. 21–37.
ICFP-2019-MiraldoS #difference #performance #type safety: An efficient algorithm for type-safe structural diffing (VCM, WS), p. 29.
ICFP-2019-WaliaNCTS #performance: From high-level inference algorithms to efficient code (RW, PN, JC, STH, CcS), p. 30.
CoG-2019-KimLLHK #automation #game studies #generative #graph #using: Automatic Generation of Game Content using a Graph-based Wave Function Collapse Algorithm (HK, SL, HL, TH, SK), pp. 1–4.
CoG-2019-ThakkarCWCT #generative: Autoencoder and Evolutionary Algorithm for Level Generation in Lode Runner (ST, CC, LW, TJC, JT), pp. 1–4.
CIKM-2019-ChehreghaniBA #adaptation: Adaptive Algorithms for Estimating Betweenness and k-path Centralities (MHC, AB, TA), pp. 1231–1240.
CIKM-2019-DongZ #performance #set: Faster Algorithms for k-Regret Minimizing Sets via Monotonicity and Sampling (QD, JZ), pp. 2213–2216.
CIKM-2019-DurschSWFFSBHJP #dependence #evaluation: Inclusion Dependency Discovery: An Experimental Evaluation of Thirteen Algorithms (FD, AS, FW, MF, TF, NS, TB, HH, LJ, TP, FN), pp. 219–228.
CIKM-2019-FujiwaraIKKAU #bound #incremental #performance #random: Fast Random Forest Algorithm via Incremental Upper Bound (YF, YI, SK, AK, JA, NU), pp. 2205–2208.
CIKM-2019-HuynhP #benchmark #knowledge base #metric: A Benchmark for Fact Checking Algorithms Built on Knowledge Bases (VPH, PP), pp. 689–698.
CIKM-2019-Lakhotia0 #approximate #coordination #network #social: Approximation Algorithms for Coordinating Ad Campaigns on Social Networks (KL, DK0), pp. 339–348.
CIKM-2019-NiYWLNQC #facebook #feature model #ranking: Feature Selection for Facebook Feed Ranking System via a Group-Sparsity-Regularized Training Algorithm (XN, YY, PW, YL, SN, QQ, CC), pp. 2085–2088.
CIKM-2019-Wang0CRR #higher-order #parallel #performance: Efficient Sequential and Parallel Algorithms for Estimating Higher Order Spectra (ZW, AAM0, XC, NR, SR), pp. 1743–1752.
ECIR-p1-2019-BhattacharyaHRP #case study #comparative #summary: A Comparative Study of Summarization Algorithms Applied to Legal Case Judgments (PB, KH, SR, NP, KG, SG0), pp. 413–428.
ECIR-p1-2019-BorattoFM #bias #online #recommendation: The Effect of Algorithmic Bias on Recommender Systems for Massive Open Online Courses (LB, GF, MM), pp. 457–472.
ECIR-p2-2019-BeelK #information retrieval: Proposal for the 1st Interdisciplinary Workshop on Algorithm Selection and Meta-Learning in Information Retrieval (AMIR) (JB, LK), pp. 383–388.
ICML-2019-0001PRW #matrix #performance: Faster Algorithms for Binary Matrix Factorization (RK0, RP, AR, DPW), pp. 3551–3559.
ICML-2019-0002LLJ #adaptation: Bridging Theory and Algorithm for Domain Adaptation (YZ0, TL, ML, MIJ), pp. 7404–7413.
ICML-2019-AgarwalDW: Fair Regression: Quantitative Definitions and Reduction-Based Algorithms (AA, MD, ZSW), pp. 120–129.
ICML-2019-AkrourP0N #approximate #policy: Projections for Approximate Policy Iteration Algorithms (RA, JP, JP0, GN), pp. 181–190.
ICML-2019-AnconaOG #approximate #network #polynomial: Explaining Deep Neural Networks with a Polynomial Time Algorithm for Shapley Value Approximation (MA, CÖ, MHG), pp. 272–281.
ICML-2019-BeygelzimerPSTW #classification #linear #multi #performance: Bandit Multiclass Linear Classification: Efficient Algorithms for the Separable Case (AB, DP, BS, DT, CYW, CZ), pp. 624–633.
ICML-2019-ChenW0R #graph #incremental #performance: Fast Incremental von Neumann Graph Entropy Computation: Theory, Algorithm, and Applications (PYC, LW, SL0, IR), pp. 1091–1101.
ICML-2019-DaoGERR #learning #linear #performance #using: Learning Fast Algorithms for Linear Transforms Using Butterfly Factorizations (TD, AG, ME, AR, CR), pp. 1517–1527.
ICML-2019-DereliOG #analysis #biology #kernel #learning #multi: A Multitask Multiple Kernel Learning Algorithm for Survival Analysis with Application to Cancer Biology (OD, CO, MG), pp. 1576–1585.
ICML-2019-Elhamifar #approximate: Sequential Facility Location: Approximate Submodularity and Greedy Algorithm (EE), pp. 1784–1793.
ICML-2019-FuKSL: Diagnosing Bottlenecks in Deep Q-learning Algorithms (JF, AK, MS, SL), pp. 2021–2030.
ICML-2019-GhaffariLM #clustering #network #parallel: Improved Parallel Algorithms for Density-Based Network Clustering (MG, SL, SM), pp. 2201–2210.
ICML-2019-GollapudiP #online: Online Algorithms for Rent-Or-Buy with Expert Advice (SG, DP), pp. 2319–2327.
ICML-2019-GuY #modelling #multi #performance #ranking: Fast Algorithm for Generalized Multinomial Models with Ranking Data (JG, GY), pp. 2445–2453.
ICML-2019-HarshawFWK #performance: Submodular Maximization beyond Non-negativity: Guarantees, Fast Algorithms, and Applications (CH, MF, JW, AK), pp. 2634–2643.
ICML-2019-HeidariNG #learning #on the #policy #social: On the Long-term Impact of Algorithmic Decision Policies: Effort Unfairness and Feature Segregation through Social Learning (HH, VN, KPG), pp. 2692–2701.
ICML-2019-Huang0 #community #correlation #detection: Detecting Overlapping and Correlated Communities without Pure Nodes: Identifiability and Algorithm (KH, XF0), pp. 2859–2868.
ICML-2019-JiWZL #analysis #optimisation: Improved Zeroth-Order Variance Reduced Algorithms and Analysis for Nonconvex Optimization (KJ, ZW, YZ, YL), pp. 3100–3109.
ICML-2019-KasaiJM #adaptation #matrix #probability: Riemannian adaptive stochastic gradient algorithms on matrix manifolds (HK, PJ, BM), pp. 3262–3271.
ICML-2019-KempkaKW #adaptation #invariant #learning #linear #modelling #online: Adaptive Scale-Invariant Online Algorithms for Learning Linear Models (MK, WK, MKW), pp. 3321–3330.
ICML-2019-KimP #multi: Contextual Multi-armed Bandit Algorithm for Semiparametric Reward Model (GSK, MCP), pp. 3389–3397.
ICML-2019-KoloskovaSJ #communication #distributed #optimisation #probability: Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communication (AK, SUS, MJ), pp. 3478–3487.
ICML-2019-LattanziS: A Better k-means++ Algorithm via Local Search (SL, CS), pp. 3662–3671.
ICML-2019-LeeW #first-order #performance #problem: First-Order Algorithms Converge Faster than $O(1/k)$ on Convex Problems (CPL, SW), pp. 3754–3762.
ICML-2019-LiCW #classification #kernel #linear #quantum #sublinear: Sublinear quantum algorithms for training linear and kernel-based classifiers (TL, SC, XW), pp. 3815–3824.
ICML-2019-LinHJ #analysis #on the #performance: On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithms (TL, NH, MIJ), pp. 3982–3991.
ICML-2019-LuWHZ: Optimal Algorithms for Lipschitz Bandits with Heavy-tailed Rewards (SL, GW, YH, LZ0), pp. 4154–4163.
ICML-2019-MahabadiIGR #composition: Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm (SM, PI, SOG, AR), pp. 4254–4263.
ICML-2019-MakkuvaVKO #consistency #performance: Breaking the gridlock in Mixture-of-Experts: Consistent and Efficient Algorithms (AVM, PV, SK, SO), pp. 4304–4313.
ICML-2019-MannelliKUZ #modelling: Passed & Spurious: Descent Algorithms and Local Minima in Spiked Matrix-Tensor Models (SSM, FK, PU, LZ), pp. 4333–4342.
ICML-2019-PanageasPW #convergence #distributed #higher-order #multi #optimisation: Multiplicative Weights Updates as a distributed constrained optimization algorithm: Convergence to second-order stationary points almost always (IP, GP, XW), pp. 4961–4969.
ICML-2019-RouletDSH #complexity: Iterative Linearized Control: Stable Algorithms and Complexity Guarantees (VR, DD, SSS, ZH), pp. 5518–5527.
ICML-2019-SajedS: An Optimal Private Stochastic-MAB Algorithm based on Optimal Private Stopping Rule (TS, OS), pp. 5579–5588.
ICML-2019-Upadhyay #sublinear: Sublinear Space Private Algorithms Under the Sliding Window Model (JU), pp. 6363–6372.
ICML-2019-WeiszGS #approximate #named: CapsAndRuns: An Improved Method for Approximately Optimal Algorithm Configuration (GW, AG, CS), pp. 6707–6715.
ICML-2019-ZhangZLWZ #matrix #orthogonal: Greedy Orthogonal Pivoting Algorithm for Non-Negative Matrix Factorization (KZ, SZ, JL, JW, JZ), pp. 7493–7501.
KDD-2019-ChiangLSLBH #clustering #graph #named #network #performance #scalability: Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks (WLC, XL, SS, YL0, SB, CJH), pp. 257–266.
KDD-2019-FoucheKB #multi #scalability: Scaling Multi-Armed Bandit Algorithms (EF, JK, KB), pp. 1449–1459.
KDD-2019-Huang0DLLPST0Y0 #learning #network #theory and practice: Learning From Networks: Algorithms, Theory, and Applications (XH, PC0, YD, JL, HL0, JP, LS, JT0, FW0, HY, WZ0), pp. 3221–3222.
KDD-2019-WangWZPL #network #personalisation #recommendation: Empowering A* Search Algorithms with Neural Networks for Personalized Route Recommendation (JW, NW, WXZ, FP, XL), pp. 539–547.
KDD-2019-ZhaCLY #mining #roadmap: Mining Algorithm Roadmap in Scientific Publications (HZ, WC, KL, XY), pp. 1083–1092.
ECOOP-2019-ChungNV #performance #tuple #type system: Julia's Efficient Algorithm for Subtyping Unions and Covariant Tuples (Pearl) (BC, FZN, JV), p. 15.
POPL-2019-ChatterjeeGOP #performance: Efficient parameterized algorithms for data packing (KC, AKG, NO, AP), p. 28.
PPDP-2019-LiuCS #distributed #execution #specification: Moderately Complex Paxos Made Simple: High-Level Executable Specification of Distributed Algorithms (YAL, SC, SDS), p. 15.
SAS-2019-GantyR0 #abstract interpretation: Language Inclusion Algorithms as Complete Abstract Interpretations (PG, FR, PV0), pp. 140–161.
SAS-2019-NeiderS0M #invariant #learning #named: Sorcar: Property-Driven Algorithms for Learning Conjunctive Invariants (DN, SS, PG0, PM), pp. 323–346.
ASE-2019-HeLWMZLHLX #analysis: Performance-Boosting Sparsification of the IFDS Algorithm with Applications to Taint Analysis (DH, HL, LW, HM, HZ, JL0, SH, LL, JX), pp. 267–279.
ESEC-FSE-2019-AwadhutkarSHK #complexity #detection #named: DISCOVER: detecting algorithmic complexity vulnerabilities (PA, GRS, BH, SK), pp. 1129–1133.
ESEC-FSE-2019-LinCLLZ #combinator #generative #metaheuristic #performance #testing #towards: Towards more efficient meta-heuristic algorithms for combinatorial test generation (JL, SC, CL, QL, HZ0), pp. 212–222.
ICSE-2019-JoshiFM #approximate #profiling #random #source code #statistics: Statistical algorithmic profiling for randomized approximate programs (KJ, VF, SM), pp. 608–618.
ASPLOS-2019-BanerjeeKI #markov #modelling #monte carlo #probability: AcMC 2 : Accelerating Markov Chain Monte Carlo Algorithms for Probabilistic Models (SSB, ZTK, RKI), pp. 515–528.
CASE-2019-BaiTYZD #evaluation #exponential #finite #performance #robust: An Accurate and Robust Algorithm for Performance Evaluation of Exponential Serial Lines with Finite Buffers (YB, JT, MY, LZ, PD), pp. 42–47.
CASE-2019-FaronovP: Algorithm for Power Stabilization in Rotary Drilling Systems (MVF, IGP), pp. 867–872.
CASE-2019-SharabianiBGND #kernel #polynomial #using: A Computer-Aided System for Determining the Application Range of a Warfarin Clinical Dosing Algorithm Using Support Vector Machines with a Polynomial Kernel Function (AS, AB, WLG, RN, HD), pp. 418–423.
CASE-2019-SunW #assembly #design #hybrid #network: Hybrid Evolutionary Algorithm for Integrated Supply Chain Network Design With Assembly Line Balancing (BqS, LW), pp. 885–890.
CASE-2019-TengDHWTL #automation #design #evolution #novel #scheduling: A Novel Grammatical Evolution Algorithm for Automatic Design of Scheduling Heuristics* (YT, SD, ZH, XW, YT, DL), pp. 579–584.
CASE-2019-WangW #distributed #hybrid #problem #scheduling: An Iterated Greedy Algorithm for Distributed Hybrid Flowshop Scheduling Problem with Total Tardiness Minimization (JjW, LW), pp. 350–355.
CASE-2019-WuPZ #fault tolerance #heuristic #network: A heuristic pathfinding algorithm for dynamic fault tolerance in manufacturing networks (YW, GP, HZ), pp. 1580–1585.
CASE-2019-XingQ0 #energy #hybrid #multi #scheduling: A Hybrid Multi-objective Algorithm for Energy-Efficient Scheduling Considering Machine Maintenance* (JX, FQ, HL0), pp. 115–120.
CASE-2019-YangWLZ #multi #scheduling: A Multi-Stage Dispatching and Scheduling Algorithm for Individualized Public Transportation System (ZY, XW, CL, QZ), pp. 745–750.
CASE-2019-ZhangLGWL #classification #learning #taxonomy: A Shapelet Dictionary Learning Algorithm for Time Series Classification (JZ, XL, LG0, LW, GL), pp. 299–304.
CASE-2019-ZhangXZW #distributed #estimation #network: A Decentralized State Estimation Algorithm for Building Electrical Distribution Network Based on ADMM (YZ, JX, QZ, SW), pp. 756–761.
CASE-2019-ZhouLHC #scheduling #search-based: A Cuckoo Search-Based Scheduling Algorithm for a Semiconductor Production Line with Constrained Waiting Time (LZ, CL, BH, ZC), pp. 338–343.
CC-2019-BlassP #analysis #compilation #fixpoint #performance: GPU-accelerated fixpoint algorithms for faster compiler analyses (TB, MP), pp. 122–134.
CGO-2019-ProkopecDLW #compilation #incremental: An Optimization-Driven Incremental Inline Substitution Algorithm for Just-in-Time Compilers (AP, GD, DL, TW), pp. 164–179.
CAV-2019-Gastin0S #automaton #constraints #performance: Fast Algorithms for Handling Diagonal Constraints in Timed Automata (PG, SM0, BS), pp. 41–59.
CAV-2019-RoussanalySM #abstraction #automaton #refinement: Abstraction Refinement Algorithms for Timed Automata (VR, OS, NM), pp. 22–40.
CAV-2019-BerkovitsLLPS #composition #decidability #distributed #logic #verification: Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics (IB, ML, GL, OP, SS), pp. 245–266.
CAV-2019-LiuZWYLLYZ #hoare #logic #quantum #using #verification: Formal Verification of Quantum Algorithms Using Quantum Hoare Logic (JL, BZ, SW, SY, TL, YL, MY, NZ), pp. 187–207.
ICST-2019-SharmaW #machine learning #testing: Testing Machine Learning Algorithms for Balanced Data Usage (AS, HW), pp. 125–135.
ICTSS-2019-SachtlebenHH0 #adaptation #proving: A Mechanised Proof of an Adaptive State Counting Algorithm (RS, RMH, WlH, JP0), pp. 176–193.
ICTSS-2019-SellAFGWF #empirical #evaluation #testing: An Empirical Evaluation of Search Algorithms for App Testing (LS, MA, CF, MG, PW, GF), pp. 123–139.
TAP-2019-HuraultQ #process #proving: Proving a Non-blocking Algorithm for Process Renaming with TLA ^+ + (AH, PQ), pp. 147–166.
TAP-2019-LavillonniereMC #automation #formal method #generative #performance #search-based #testing: Fast, Automatic, and Nearly Complete Structural Unit-Test Generation Combining Genetic Algorithms and Formal Methods (EL, DM, DC0), pp. 55–63.
VMCAI-2019-AndreFMS #abstraction #industrial #model checking #parametricity #using #verification: Verification of an Industrial Asynchronous Leader Election Algorithm Using Abstractions and Parametric Model Checking (ÉA, LF, JMM, RS), pp. 409–424.
VMCAI-2019-HuybersL #bisimulation #parallel: A Parallel Relation-Based Algorithm for Symbolic Bisimulation Minimization (RH, AL), pp. 535–554.
VMCAI-2019-MurphyK: A Practical Algorithm for Structure Embedding (CM, ZK), pp. 342–362.
EDM-2018-EstebanGR #approach #hybrid #multi #recommendation #search-based #student #using: A Hybrid Multi-Criteria approach using a Genetic Algorithm for Recommending Courses to University Students (AE, AZG, CR).
ICSME-2018-FrickWP #independence #named #visualisation: DiffViz: A Diff Algorithm Independent Visualization Tool for Edit Scripts (VF, CW, MP0), pp. 705–709.
SANER-2018-NetoCK #empirical #refactoring: The impact of refactoring changes on the SZZ algorithm: An empirical study (ECN, DAdC, UK), pp. 380–390.
CIAA-2018-AllauzenR #automaton #finite: Algorithms for Weighted Finite Automata with Failure Transitions (CA, MDR), pp. 46–58.
CIAA-2018-Condon #analysis #design #network #on the: On Design and Analysis of Chemical Reaction Network Algorithms (AC), pp. 1–3.
CIAA-2018-DeBenedettoC #automaton #multi #regular expression: Algorithms and Training for Weighted Multiset Automata and Regular Expressions (JD, DC0), pp. 146–158.
CIAA-2018-MasudaSU #self #towards: Towards the Algorithmic Molecular Self-assembly of Fractals by Cotranscriptional Folding (YM, SS, YU), pp. 261–273.
FM-2018-TitoloMMDB #float #implementation: A Formally Verified Floating-Point Implementation of the Compact Position Reporting Algorithm (LT, MMM, CAM, AD, FB), pp. 364–381.
AIIDE-2018-GainaLP #named #visualisation: VERTIGØ: Visualisation of Rolling Horizon Evolutionary Algorithms in GVGAI (RDG, SML, DPL), pp. 265–267.
AIIDE-2018-KunanusontLP #experience #modelling: Modeling Player Experience with the N-Tuple Bandit Evolutionary Algorithm (KK, SML, DPL), pp. 180–186.
CIG-2018-Guerrero-Romero #design #game studies #testing #using: Using a Team of General AI Algorithms to Assist Game Design and Testing (CGR, SML, DPL), pp. 1–8.
CIG-2018-SwiechowskiTJ #learning: Improving Hearthstone AI by Combining MCTS and Supervised Learning Algorithms (MS, TT, AJ), pp. 1–8.
CIKM-2018-ANR #generative #higher-order #scalability #using: A Scalable Algorithm for Higher-order Features Generation using MinHash (PA, NN, RR), pp. 1213–1222.
CIKM-2018-LiYYZ #framework: A Two-Layer Algorithmic Framework for Service Provider Configuration and Planning with Optimal Spatial Matching (XL, JY, MY, JZ), pp. 2273–2281.
CIKM-2018-RoleMN #clustering #evaluation #using #word: Unsupervised Evaluation of Text Co-clustering Algorithms Using Neural Word Embeddings (FR, SM, MN), pp. 1827–1830.
ICML-2018-AlaaS #design #guidelines: Limits of Estimating Heterogeneous Treatment Effects: Guidelines for Practical Algorithm Design (AMA, MvdS), pp. 129–138.
ICML-2018-CharlesP #learning: Stability and Generalization of Learning Algorithms that Converge to Global Optima (ZBC, DSP), pp. 744–753.
ICML-2018-ColasSO #learning #named: GEP-PG: Decoupling Exploration and Exploitation in Deep Reinforcement Learning Algorithms (CC, OS, PYO), pp. 1038–1047.
ICML-2018-DaiKDSS #graph #learning: Learning Steady-States of Iterative Algorithms over Graphs (HD, ZK, BD, AJS, LS), pp. 1114–1122.
ICML-2018-Drutsa #consistency: Weakly Consistent Optimal Pricing Algorithms in Repeated Posted-Price Auctions with Strategic Buyer (AD), pp. 1318–1327.
ICML-2018-DunnerLGBHJ #distributed #higher-order #trust: A Distributed Second-Order Algorithm You Can Trust (CD, AL, MG, AB, TH, MJ), pp. 1357–1365.
ICML-2018-DvurechenskyGK #complexity: Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn's Algorithm (PED, AG, AK), pp. 1366–1375.
ICML-2018-EsfandiariLM #composition #parallel #streaming: Parallel and Streaming Algorithms for K-Core Decomposition (HE, SL, VSM), pp. 1396–1405.
ICML-2018-GanianKOS #matrix #problem: Parameterized Algorithms for the Matrix Completion Problem (RG, IAK, SO, SS), pp. 1642–1651.
ICML-2018-GuHDH #memory management #performance #probability: Faster Derivative-Free Stochastic Algorithm for Shared Memory Machines (BG, ZH, CD, HH), pp. 1807–1816.
ICML-2018-HongRL #distributed #higher-order #network #optimisation: Gradient Primal-Dual Algorithm Converges to Second-Order Stationary Solution for Nonconvex Distributed Optimization Over Networks (MH, MR, JDL), pp. 2014–2023.
ICML-2018-KasaiSM #analysis #convergence #probability #recursion: Riemannian Stochastic Recursive Gradient Algorithm with Retraction and Vector Transport and Its Convergence Analysis (HK, HS, BM), pp. 2521–2529.
ICML-2018-LinC18a #sketching: Optimal Rates of Sketched-regularized Algorithms for Least-Squares Regression over Hilbert Spaces (JL, VC), pp. 3108–3117.
ICML-2018-LopesWM #estimation #fault #random: Error Estimation for Randomized Least-Squares Algorithms via the Bootstrap (MEL, SW, MWM), pp. 3223–3232.
ICML-2018-MishchenkoIMA #distributed #learning: A Delay-tolerant Proximal-Gradient Algorithm for Distributed Learning (KM, FI, JM, MRA), pp. 3584–3592.
ICML-2018-MorvanV #higher-order #interactive #modelling #named #set: WHInter: A Working set algorithm for High-dimensional sparse second order Interaction models (MLM, JPV), pp. 3632–3641.
ICML-2018-NatoleYL #probability: Stochastic Proximal Algorithms for AUC Maximization (MN, YY, SL), pp. 3707–3716.
ICML-2018-OstrovskiiH #adaptation #first-order #performance: Efficient First-Order Algorithms for Adaptive Signal Denoising (DO, ZH), pp. 3943–3952.
ICML-2018-RaguetL #graph: Cut-Pursuit Algorithm for Regularizing Nonsmooth Functionals with Graph Total Variation (HR, LL), pp. 4244–4253.
ICML-2018-RamdasZWJ #adaptation #named #online: SAFFRON: an Adaptive Algorithm for Online Control of the False Discovery Rate (AR, TZ, MJW, MIJ), pp. 4283–4291.
ICML-2018-ShenSWLZ #framework #hybrid #metric: An Algorithmic Framework of Variable Metric Over-Relaxed Hybrid Proximal Extra-Gradient Method (LS, PS, YW, WL0, TZ0), pp. 4641–4650.
ICML-2018-Streeter #approximate #modelling #predict: Approximation Algorithms for Cascading Prediction Models (MS), pp. 4759–4767.
ICML-2018-WeiszGS #approximate #bound #named: LEAPSANDBOUNDS: A Method for Approximately Optimal Algorithm Configuration (GW, AG, CS), pp. 5254–5262.
ICML-2018-WuSHDR #probability #programming #semantics: Discrete-Continuous Mixtures in Probabilistic Programming: Generalized Semantics and Inference Algorithms (YW, SS, NH, SD, SJR), pp. 5339–5348.
ICML-2018-YaroslavtsevV #clustering #parallel: Massively Parallel Algorithms and Hardness for Single-Linkage Clustering under 𝓁p Distances (GY, AV), pp. 5596–5605.
ICML-2018-YuanST #clustering #performance: An Efficient Semismooth Newton Based Algorithm for Convex Clustering (YY, DS, KCT), pp. 5704–5712.
ICML-2018-ZhangKL #distributed #privacy: Improving the Privacy and Accuracy of ADMM-Based Distributed Algorithms (XZ, MMK, ML), pp. 5791–5800.
ICML-2018-ZhouSC #convergence #performance #probability: A Simple Stochastic Variance Reduced Algorithm with Fast Convergence Rates (KZ, FS, JC), pp. 5975–5984.
ICML-2018-ZhouZZ #performance: Racing Thompson: an Efficient Algorithm for Thompson Sampling with Non-conjugate Priors (YZ, JZ0, JZ), pp. 5995–6003.
ICPR-2018-AiZYH #identification #named: iCushion: A Pressure Map Algorithm for High Accuracy Human Identification (HA, LZ, ZY, HH), pp. 3483–3488.
ICPR-2018-ChenLT #approximate #detection #memory management: An Approximate Bayesian Long Short- Term Memory Algorithm for Outlier Detection (CC, XL, GT), pp. 201–206.
ICPR-2018-FonalZW #classification #composition: Feature-Fusion HALS-based Algorithm for Linked CP Decomposition Model in Application to Joint EMG/MMG Signal Classification (KF, RZ, AW), pp. 928–933.
ICPR-2018-GalteriBSB #detection #video: Video Compression for Object Detection Algorithms (LG, MB, LS, ADB), pp. 3007–3012.
ICPR-2018-HouMZ #classification: A Voting-Near-Extreme-Learning-Machine Classification Algorithm (HRH, QHM, XNZ), pp. 237–241.
ICPR-2018-HouP: A Game- Theoretic Hyper-Graph Matching Algorithm (JH, MP), pp. 1012–1017.
ICPR-2018-LeiZZXCS #image: An Image Rain Removal algorithm based on the depth of field and sparse coding (JL, SZ, WZ, JX, YC, HS), pp. 2368–2373.
ICPR-2018-LiH #estimation #performance #robust #using: Fast and Robust Pose Estimation Algorithm for Bin Picking Using Point Pair Feature (ML, KH), pp. 1604–1609.
ICPR-2018-NadeemHS #automation #detection #image #segmentation #using: An automated airway segmentation algorithm for CT images using topological leakage detection and volume freezing (SAN, EAH, PKS), pp. 1181–1186.
ICPR-2018-NieLQZJ #classification #incremental #learning #multi: An Incremental Multi-view Active Learning Algorithm for PolSAR Data Classification (XN, YL, HQ, BZ0, ZPJ), pp. 2251–2255.
ICPR-2018-RazinkovSM #detection #named: ALFA: Agglomerative Late Fusion Algorithm for Object Detection (ER, IS, JM), pp. 2594–2599.
ICPR-2018-Shen0 #composition: A New Singular Value Decomposition Algorithm for Octonion Signal (MS, RW0), pp. 3233–3237.
ICPR-2018-SunLHW #array #classification #multi: A New ECOC Algorithm for Multiclass Microarray Data Classification (MS, KL, QH, BW), pp. 454–458.
ICPR-2018-WangLH #multi #performance: An Efficient Budget Allocation Algorithm for Multi-Channel Advertising (XW, PL, AH), pp. 886–891.
ICPR-2018-WangSH #black box #generative #using: Universal Perturbation Generation for Black-box Attack Using Evolutionary Algorithms (SW, YS, YH), pp. 1277–1282.
ICPR-2018-XiaoLLLK #network: Single-image Dehazing Algorithm Based on Convolutional Neural Networks (JX, LL, EL, JL, RK), pp. 1259–1264.
KDD-2018-0022PYT #effectiveness #network #optimisation: Network Connectivity Optimization: Fundamental Limits and Effective Algorithms (CC0, RP, LY, HT), pp. 1167–1176.
KDD-2018-Anagnostopoulos #online #outsourcing: Algorithms for Hiring and Outsourcing in the Online Labor Market (AA, CC0, AF, SL, ET), pp. 1109–1118.
KDD-2018-Ertl #set: BagMinHash - Minwise Hashing Algorithm for Weighted Sets (OE), pp. 1368–1377.
KDD-2018-GuYCH #incremental #learning: New Incremental Learning Algorithm for Semi-Supervised Support Vector Machine (BG, XTY, SC, HH), pp. 1475–1484.
KDD-2018-LeeLW #distributed #empirical: A Distributed Quasi-Newton Algorithm for Empirical Risk Minimization with Nonsmooth Regularization (CpL, CHL, SJW), pp. 1646–1655.
KDD-2018-LiYCYZ #3d #constraints #data-driven #delivery #problem: A Data-Driven Three-Layer Algorithm for Split Delivery Vehicle Routing Problem with 3D Container Loading Constraint (XL, MY, DC, JY, JZ), pp. 528–536.
KDD-2018-Smola #hardware #tool support: Algorithms, Data, Hardware and Tools: A Perfect Storm (AS), p. 2878.
KDD-2018-SpeicherHGGSWZ #approach #difference: A Unified Approach to Quantifying Algorithmic Unfairness: Measuring Individual &Group Unfairness via Inequality Indices (TS, HH, NGH, KPG, AS, AW, MBZ), pp. 2239–2248.
KDD-2018-Xing #co-evolution #design #machine learning #named: SysML: On System and Algorithm Co-design for Practical Machine Learning (EPX), p. 2880.
MoDELS-2018-ArcegaFC #configuration management #debugging #locality #modelling #runtime: Evolutionary Algorithm for Bug Localization in the Reconfigurations of Models at Runtime (LA, JF, CC), pp. 90–100.
PLATEAU-2018-HuangM #named #quantum #source code #towards: QDB: From Quantum Algorithms Towards Correct Quantum Programs (YH0, MM), p. 14.
PLDI-2018-ChenHLLTTZ #termination: Advanced automata-based algorithms for program termination checking (YFC, MH, OL, YL0, MHT, AT, LZ0), pp. 135–150.
POPL-2018-LiY #analysis #problem #quantum #source code #termination: Algorithmic analysis of termination problems for quantum programs (YL, MY), p. 29.
ASE-2018-DegiovanniMRA #identification #search-based: A genetic algorithm for goal-conflict identification (RD, FM, GR, NA), pp. 520–531.
ICSE-2018-AbdessalemNBS #testing #using: Testing vision-based control systems using learnable evolutionary algorithms (RBA, SN, LCB, TS), pp. 1016–1026.
ASPLOS-2018-Chong #architecture #quantum: Quantum Computing is Getting Real: Architecture, PL, and OS Roles in Closing the Gap between Quantum Algorithms and Machines (FTC), p. 285.
CASE-2018-CaoGZL #hybrid #problem #scheduling #self: A Self-braking Symbiotic Organisms Search Algorithm for Bi-objective Reentrant Hybrid Flow Shop Scheduling Problem (ZC, SG, MZ, KL), pp. 803–808.
CASE-2018-CaoLZ: A Combined Model for Short-term Load Forecasting Based on Bird Swarm Algorithm (ZC, LL, MZ), pp. 791–796.
CASE-2018-GalvanauskasSLB #design #development #performance #process: Development and Investigation of Efficient Substrate Feeding and Dissolved Oxygen Control Algorithms for Design of Recombinant E. coli Cultivation Process (VG, RS, DL, MB, RU), pp. 657–660.
CASE-2018-HidakaK #generative #hybrid: Hybrid Sensor-Based and Frontier-Based Exploration Algorithm for Autonomous Transport Vehicle Map Generation (KH, NK), pp. 994–999.
CASE-2018-KuoC #capacity #industrial #scheduling #search-based #using: Using Auxiliary Capacity Planning Strategy Genetic Algorithm for TFT-LCD photolithography scheduling to empower Industry 3.5 (HAK, CFC0), pp. 920–925.
CASE-2018-QuintonHH #flexibility #problem: Algorithms for the flexible cyclic jobshop problem (FQ, IH, LH), pp. 945–950.
CASE-2018-RiaziBL #parallel #problem: Parallelization of a gossip algorithm for vehicle routing problems (SR, KB, BL), pp. 92–97.
CASE-2018-TanLW #scheduling: An Improved NSGA-II based Algorithm for Economical Hot Rolling Batch Scheduling under Time-sensitive Electricity Prices (MT, ML, LW), pp. 962–967.
CASE-2018-ThayerVGC #multi: Multi-Robot Routing Algorithms for Robots Operating in Vineyards (TCT, SV, KG, SC), pp. 14–21.
CASE-2018-ThonnessenRRSK #correctness #multi #specification: Correctness Properties and Exemplified Applicability of a Signal Matching Algorithm with Multidimensional Tolerance Specifications (DT, NR, SR, AS, SK), pp. 1197–1202.
CASE-2018-VitoloMCM #evaluation #navigation #performance: Performance Evaluation of the Dyna-Q algorithm for Robot Navigation (EV, ASM, JC, CM), pp. 322–327.
CASE-2018-WangDML #problem #scheduling #search-based: A Grouping Genetic Algorithm for the Intercell Scheduling Problem (SW, SD, TM, DL), pp. 956–961.
CASE-2018-WijayasingheSPP #adaptation #interface #search-based #using: Adaptive Interface for Robot Teleoperation using a Genetic Algorithm (IBW, MNS, SP, DOP, SC), pp. 50–56.
CASE-2018-WuL #difference #distributed #evolution #flexibility #problem #scheduling: An Improved Differential Evolution Algorithm for Solving a Distributed Flexible Job Shop Scheduling Problem (XW, XL), pp. 968–973.
CASE-2018-XuL #clustering #optimisation: A New Particle Swarm Optimization Algorithm for Clustering (XX, JL), pp. 768–773.
CASE-2018-ZhangQW #assessment #health: Equipment health assessment and fault-early warning algorithm based on improved SVDD (LZ, FQ, JW), pp. 716–721.
CASE-2018-ZhangZY #detection #distributed #fault: A Distributed Algorithm for Sensor Fault Detection (ZZ, QZ, WY), pp. 756–761.
CASE-2018-ZhuLH #heuristic #multi #problem #scheduling: A Modified Heuristic Algorithm for Resource Constrained Multi-project Scheduling Problem based on Inspection and Rework (HZ, ZL, XH), pp. 1058–1063.
CC-2018-KochMVCF #analysis #compilation #parallel #towards: Towards a compiler analysis for parallel algorithmic skeletons (TJKEvK, SM, CV, MC, BF), pp. 174–184.
CGO-2018-BarthelsCB #matrix: The generalized matrix chain algorithm (HB, MC, PB), pp. 138–148.
ESOP-2018-MertenBS #complexity #distributed #game studies #learning: Verified Learning Without Regret - From Algorithmic Game Theory to Distributed Systems with Mechanized Complexity Guarantees (SM, AB, GS0), pp. 561–588.
CAV-2018-KelmendiKKW #game studies #learning #probability: Value Iteration for Simple Stochastic Games: Stopping Criterion and Learning Algorithm (EK, JK, JK, MW), pp. 623–642.
CAV-2018-ChatterjeeHLOT #graph #markov #process: Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives (KC, MH, VL, SO, VT), pp. 178–197.
IJCAR-2018-FazekasBB #modulo theories #satisfiability #set: Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories (KF, FB, AB), pp. 134–151.
IJCAR-2018-GeMLZM #approximate #probability: A New Probabilistic Algorithm for Approximate Model Counting (CG, FM, TL, JZ0, XM), pp. 312–328.
IJCAR-2018-MelquiondR #framework #proving #why: A Why3 Framework for Reflection Proofs and Its Application to GMP's Algorithms (GM, RRH), pp. 178–193.
VMCAI-2018-AminofRSWZ #abstraction #distributed #model checking: Parameterized Model Checking of Synchronous Distributed Algorithms by Abstraction (BA, SR, IS, JW, FZ), pp. 1–24.
EDM-2017-PriceZB #data-driven #evaluation #feedback #programming: Evaluation of a Data-driven Feedback Algorithm for Open-ended Programming (TWP, RZ, TB).
ICPC-2017-FerreiraVF #comparison: A comparison of three algorithms for computing truck factors (MMF, MTV, KAMF), pp. 207–217.
ICSME-2017-FanLZZZ #challenge #empirical #fault #predict #privacy: The Utility Challenge of Privacy-Preserving Data-Sharing in Cross-Company Defect Prediction: An Empirical Study of the CLIFF&MORPH Algorithm (YF, CL, XZ, GZ, YZ), pp. 80–90.
ICSME-2017-Rodeghero #automation #behaviour #documentation #generative: Behavior-Informed Algorithms for Automatic Documentation Generation (PR), pp. 660–664.
ICSME-2017-Shi #constraints #optimisation #theorem proving: Combining Evolutionary Algorithms with Constraint Solving for Configuration Optimization (KS), pp. 665–669.
CIAA-2017-Pous #automaton #induction: CoInductive Automata Algorithms (DP), p. xvii-xviii.
FSCD-2017-KanovichKMS #bound #calculus #order #polynomial: A Polynomial-Time Algorithm for the Lambek Calculus with Brackets of Bounded Order (MIK, SK, GM, AS), p. 17.
Haskell-2017-Quick #haskell #music: Algorithmic music in Haskell (invited talk) (DQ), p. 98.
ICFP-2017-Elliott #functional #parallel: Generic functional parallel algorithms: scan and FFT (CE), p. 25.
AIIDE-2017-OskouieB #fault #heuristic #realtime #robust: Robustness of Real-Time Heuristic Search Algorithms to Read/Write Error in Externally Stored Heuristics (MAO, VB), pp. 137–143.
AIIDE-2017-SigurdsonB #heuristic #learning #realtime: Deep Learning for Real-Time Heuristic Search Algorithm Selection (DS, VB), pp. 108–114.
AIIDE-2017-Tavares #game studies: Algorithm Selection in Zero-Sum Computer Games (ART), pp. 301–303.
CIG-2017-DemediukTRZLM #monte carlo: Monte Carlo tree search based algorithms for dynamic difficulty adjustment (SD, MT, WLR, FZ, XL0, F'M), pp. 53–59.
CIG-2017-RooijackersW #game studies: Resource-gathering algorithms in the game of starcraft (MLMR, MHMW), pp. 264–271.
CIKM-2017-HuHQ #communication #parallel #parametricity #performance: A Communication Efficient Parallel DBSCAN Algorithm based on Parameter Server (XH, JH0, MQ), pp. 2107–2110.
CIKM-2017-NasirGMG: Fully Dynamic Algorithm for Top-k Densest Subgraphs (MAUN, AG, GDFM, SG), pp. 1817–1826.
CIKM-2017-SeoK #clustering #graph #named #performance #scalability: pm-SCAN: an I/O Efficient Structural Clustering Algorithm for Large-scale Graphs (JHS, MHK), pp. 2295–2298.
CIKM-2017-SongYL #multi #set: SIMD-Based Multiple Sets Intersection with Dual-Scale Search Algorithm (XS, YY, XL), pp. 2311–2314.
CIKM-2017-UedaYK #twitter: Collecting Non-Geotagged Local Tweets via Bandit Algorithms (SU, YY, HK), pp. 2331–2334.
CIKM-2017-Whang #community #empirical: An Empirical Study of Community Overlap: Ground-truth, Algorithmic Solutions, and Implications (JJW), pp. 2363–2366.
CIKM-2017-WilkieA #bias #documentation #question: Algorithmic Bias: Do Good Systems Make Relevant Documents More Retrievable? (CW, LA), pp. 2375–2378.
CIKM-2017-YuQL0CZ #performance: Fast Algorithms for Pareto Optimal Group-based Skyline (WY, ZQ, JL, LX0, XC, HZ), pp. 417–426.
CIKM-2017-ZehlikeB0HMB #ranking: FA*IR: A Fair Top-k Ranking Algorithm (MZ, FB, CC0, SH, MM, RBY), pp. 1569–1578.
ECIR-2017-BhattacharjeeA #clustering #dataset #incremental #nearest neighbour: Batch Incremental Shared Nearest Neighbor Density Based Clustering Algorithm for Dynamic Datasets (PB, AA), pp. 568–574.
ICML-2017-AndersonG #approximate #online #performance #rank: An Efficient, Sparsity-Preserving, Online Algorithm for Low-Rank Approximation (DGA, MG0), pp. 156–165.
ICML-2017-BachmanST #learning: Learning Algorithms for Active Learning (PB, AS, AT), pp. 301–310.
ICML-2017-BackursT #clique #performance: Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms (AB, CT), pp. 311–321.
ICML-2017-BraunPZ: Lazifying Conditional Gradient Algorithms (GB, SP, DZ), pp. 566–575.
ICML-2017-ChierichettiG0L #approximate #rank: Algorithms for lₚ Low-Rank Approximation (FC, SG, RK0, SL, RP, DPW), pp. 806–814.
ICML-2017-GarberSS #analysis #component #distributed #probability: Communication-efficient Algorithms for Distributed Stochastic Principal Component Analysis (DG, OS, NS), pp. 1203–1212.
ICML-2017-HassidimS #probability #robust: Robust Guarantees of Stochastic Greedy Algorithms (AH, YS), pp. 1424–1432.
ICML-2017-HongHZ #distributed #learning #named #network #optimisation #performance: Prox-PDA: The Proximal Primal-Dual Algorithm for Fast Distributed Nonconvex Optimization and Learning Over Networks (MH, DH, MMZ), pp. 1529–1538.
ICML-2017-LiLZ #linear: Provably Optimal Algorithms for Generalized Linear Contextual Bandits (LL0, YL, DZ), pp. 2071–2080.
ICML-2017-LiTE #adaptation #equation #probability: Stochastic Modified Equations and Adaptive Stochastic Gradient Algorithms (QL, CT, WE), pp. 2101–2110.
ICML-2017-LiuLNT #complexity: Algorithmic Stability and Hypothesis Complexity (TL, GL, GN, DT), pp. 2159–2167.
ICML-2017-PanahiDJB #clustering #convergence #incremental #probability: Clustering by Sum of Norms: Stochastic Incremental Algorithm, Convergence and Cluster Recovery (AP, DPD, FDJ, CB), pp. 2769–2777.
ICML-2017-ScamanBBLM #distributed #network #optimisation: Optimal Algorithms for Smooth and Strongly Convex Distributed Optimization in Networks (KS, FRB, SB, YTL, LM), pp. 3027–3036.
ICML-2017-ShalitJS #bound: Estimating individual treatment effect: generalization bounds and algorithms (US, FDJ, DAS), pp. 3076–3085.
ICML-2017-SharanV #composition: Orthogonalized ALS: A Theoretically Principled Tensor Decomposition Algorithm for Practical Use (VS, GV), pp. 3095–3104.
ICML-2017-ShenLYM #multi #named #optimisation: GSOS: Gauss-Seidel Operator Splitting Algorithm for Multi-Term Nonsmooth Convex Composite Optimization (LS, WL0, GY, SM), pp. 3125–3134.
ICML-2017-SunDK: Safety-Aware Algorithms for Adversarial Contextual Bandit (WS, DD, AK), pp. 3280–3288.
ICML-2017-WangX #first-order: Exploiting Strong Convexity from Data with Primal-Dual First-Order Algorithms (JW, LX), pp. 3694–3702.
ICML-2017-ZhuWZG #probability: High-Dimensional Variance-Reduced Stochastic Gradient Expectation-Maximization Algorithm (RZ, LW, CZ, QG), pp. 4180–4188.
KDD-2017-AhmedLSW #industrial #modelling #problem #topic: A Practical Algorithm for Solving the Incoherence Problem of Topic Models In Industrial Applications (AA, JL, DS, YW), pp. 1713–1721.
KDD-2017-Corbett-DaviesP #cost analysis: Algorithmic Decision Making and the Cost of Fairness (SCD, EP, AF, SG, AH), pp. 797–806.
KDD-2017-GuLH #automation: Groups-Keeping Solution Path Algorithm for Sparse Regression with Automatic Feature Grouping (BG, GL, HH), pp. 185–193.
KDD-2017-HillNLIV #multi #optimisation #performance #realtime: An Efficient Bandit Algorithm for Realtime Multivariate Optimization (DNH, HN, YL0, AI, SVNV), pp. 1813–1821.
KDD-2017-KobrenMKM #clustering: A Hierarchical Algorithm for Extreme Clustering (AK, NM, AK, AM), pp. 255–264.
KDD-2017-LakkarajuKLLM #predict #problem: The Selective Labels Problem: Evaluating Algorithmic Predictions in the Presence of Unobservables (HL, JMK, JL, JL, SM), pp. 275–284.
KDD-2017-ShahSC #constraints #online #ranking #web: Online Ranking with Constraints: A Primal-Dual Algorithm and Applications to Web Traffic-Shaping (PS, AS, TC), pp. 405–414.
KDD-2017-YangZH #predict #towards: Local Algorithm for User Action Prediction Towards Display Ads (HY, YZ, JH), pp. 2091–2099.
KDD-2017-ZhouZYATDH #graph: A Local Algorithm for Structure-Preserving Graph Cut (DZ, SZ, MYY, SA, HT, HD, JH), pp. 655–664.
LOPSTR-2017-Fruhwirth #constraints #logic: Justifications in Constraint Handling Rules for Logical Retraction in Dynamic Algorithms (TWF), pp. 147–163.
PLDI-2017-HuangTM #compilation #markov #modelling #monte carlo #probability: Compiling Markov chain Monte Carlo algorithms for probabilistic modeling (DH0, JBT, GM), pp. 111–125.
POPL-2017-KonnovLVW #distributed #fault tolerance #liveness #safety #verification: A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms (IVK0, ML, HV, JW), pp. 719–734.
PPDP-2017-Gulwani #ambiguity #programming: Programming by examples: applications, algorithms, and ambiguity resolution (SG), p. 2.
ESEC-FSE-2017-MaAXLZLZ #graph #machine learning #named: LAMP: data provenance for graph based machine learning algorithms through derivative computation (SM, YA, ZX, WCL, JZ, YL, XZ0), pp. 786–797.
ESEC-FSE-2017-SorensenED #gpu #kernel #multi: Cooperative kernels: GPU multitasking for blocking algorithms (TS0, HE, AFD), pp. 431–441.
ICSE-2017-SoltaniPD #automation #search-based: A guided genetic algorithm for automated crash reproduction (MS, AP, AvD), pp. 209–220.
GPCE-2017-Perard-GayotWMS #abstraction #named #performance #traversal: RaTrace: simple and efficient abstractions for BVH ray traversal algorithms (APG, MW, RM, PS, RL, SH), pp. 157–168.
CASE-2017-CaoLZH #scheduling #testing: An improved cuckoo search algorithm for semiconductor final testing scheduling (ZC, CL, MZ, RH), pp. 1040–1045.
CASE-2017-ChenKLFG #case study #education #user study: An algorithm and user study for teaching bilateral manipulation via iterated best response demonstrations (CC, SK, ML, RF, KG), pp. 151–158.
CASE-2017-ChoiPR #automation #multi #scalability #synthesis: Automated synthesis of scalable algorithms for inferring non-local properties to assist in multi-robot teaming (TC, TPP, AWR), pp. 1522–1527.
CASE-2017-GongHC #problem #scheduling: An improved symbiotic organisms search algorithm for low-yield stepper scheduling problem (SG, RH, ZC), pp. 289–294.
CASE-2017-HuangMY #difference #evolution #performance #throughput #using: Forecasting of throughput performance using an ARMA model with improved differential evolution algorithm (JTH, YM, YY), pp. 376–381.
CASE-2017-JeongKC #empirical #precise: Initial experiment of practical algorithm for precision motion control of human-like tendon-driven joint mechanism (HJ, BK, JC), pp. 1469–1474.
CASE-2017-JiangL #adaptation #process #robust #scheduling: An adaptive sampling-estimation of distribution algorithm for robust scheduling in the steelmaking-continuous casting process (SlJ, QL), pp. 440–445.
CASE-2017-KinghorstGLCYFZ #approach #maintenance #markov #modelling #predict #search-based: Hidden Markov model-based predictive maintenance in semiconductor manufacturing: A genetic algorithm approach (JK, OG, ML, HLC, KY, JF, MZ, BVH), pp. 1260–1267.
CASE-2017-LeeLH #constraints #design #evaluation #performance: Iteration algorithms for performance evaluation and buffer design of Bernoulli serial lines with waiting time constraints (JHL, JL, JAH), pp. 654–655.
CASE-2017-LiuLH #difference #evolution #problem: A differential evolution algorithm for the resource investment problem with discounted cash flows (ML, JL, XH), pp. 1554–1559.
CASE-2017-LiuYJLL #3d: 3D trajectory planning algorithm for organ groups and irregular obstacles with application for prostate brachytherapy (FL, ZY, SJ0, PL0, DL), pp. 1420–1424.
CASE-2017-LiZCPJW #3d #optimisation: 3D laser scanner calibration method based on invasive weed optimization and Levenberg-Marquardt algorithm (YL, WZ, JC, JP, BJ, LW), pp. 1280–1285.
CASE-2017-LuBHB #delivery #search-based: Improved genetic algorithm based delivery time control for Fourth Party Logistics (FL, HB, LH, WB), pp. 390–393.
CASE-2017-LuQ #energy #parallel #problem #scheduling #search-based: An improved genetic algorithm for a parallel machine scheduling problem with energy consideration (HL0, FQ), pp. 1487–1492.
CASE-2017-MatlMG #3d: An algorithm for transferring parallel-jaw grasps between 3D mesh subsegments (MM, JM, KG), pp. 756–763.
CASE-2017-RochollM #multi #order #problem #scheduling #search-based: Genetic algorithms for a single-machine multiple orders per job scheduling problem with a common due date (JR, LM), pp. 1038–1039.
CASE-2017-VijayaraghavanK #scalability: An L1-minimization based algorithm to measure the redundancy of state estimators in large sensor systems (VV, KK, YD, HP), pp. 424–428.
CASE-2017-WangGJZ #estimation #search-based: Genetic algorithm based transition probabilities estimation (XW, NG, ZJ, LZ), pp. 213–218.
CASE-2017-WangLJ #optimisation: A memetic algorithm for optimization of combination chemotherapy with dose adjustment (PW, RL0, ZJ), pp. 207–212.
CASE-2017-WuWW #estimation #graph #multi: A t-level driven search for estimation of distribution algorithm in solving task graph allocation to multiprocessors (CW, LW0, JW), pp. 630–635.
CASE-2017-ZhangH #coordination #multi: Cooperative bat searching algorithm: A combined perspective from multiagent coordination and swarm intelligence (HZ0, QH), pp. 1362–1367.
CASE-2017-ZouMY #difference #evolution #hybrid #industrial #problem: A hybrid differential evolution algorithm for open-order coil allocation problem in the steel industry (FZ, YM, YY), pp. 636–641.
ESOP-2017-ChatterjeeKMP #performance #recursion #state machine: Faster Algorithms for Weighted Recursive State Machines (KC, BK, SM, AP), pp. 287–313.
CADE-2017-PassmoreI #verification: Formal Verification of Financial Algorithms (GOP, DI), pp. 26–41.
CAV-2017-MaricSB #bound: Cutoff Bounds for Consensus Algorithms (OM, CS0, DAB), pp. 217–237.
CSL-2017-ChatterjeeDHL #game studies: Improved Set-Based Symbolic Algorithms for Parity Games (KC, WD, MH, VL), p. 21.
CSL-2017-Thomas #approach #game studies #infinity: Determinacy of Infinite Games: Perspectives of the Algorithmic Approach (Invited Talk) (WT), p. 1.
ICST-2017-PradhanWAYL #clustering #multi #named #optimisation #search-based: CBGA-ES: A Cluster-Based Genetic Algorithm with Elitist Selection for Supporting Multi-Objective Test Optimization (DP, SW0, SA0, TY0, ML), pp. 367–378.
VMCAI-2017-HahnST0 #game studies #recursion: Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games (EMH, SS, AT, LZ0), pp. 266–287.
VMCAI-2017-KonnovWSS #abstraction #distributed #fault tolerance: Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms (IVK0, JW, FS, LS), pp. 347–366.
EDM-2016-NiuNZWKY #clustering #learning: A Coupled User Clustering Algorithm for Web-based Learning Systems (KN, ZN, XZ, CW, KK, MY), pp. 175–182.
SANER-2016-PanichellaDOPPL #search-based #using: Parameterizing and Assembling IR-Based Solutions for SE Tasks Using Genetic Algorithms (AP, BD, RO, MDP, DP, ADL), pp. 314–325.
SCAM-2016-HollandSAK #complexity #detection #dynamic analysis #tool support: Statically-Informed Dynamic Analysis Tools to Detect Algorithmic Complexity Vulnerabilities (BH, GRS, PA, SK), pp. 79–84.
CIAA-2016-Fujiyoshi #automaton #multi #problem: A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata (AF), pp. 101–112.
CIAA-2016-StasioMPV #game studies #using: Solving Parity Games Using an Automata-Based Algorithm (ADS, AM, GP, MYV), pp. 64–76.
Haskell-2016-WangNF #named #search-based #strict #using: Autobahn: using genetic algorithms to infer strictness annotations (YRW, DN, KF), pp. 114–126.
ICFP-2016-Sergey #case study #experience #geometry #random testing #testing: Experience report: growing and shrinking polygons for random testing of computational geometry algorithms (IS), pp. 193–199.
AIIDE-2016-BontragerKMT #game studies #video: Matching Games and Algorithms for General Video Game Playing (PB, AK, AM, JT), pp. 122–128.
AIIDE-2016-Bulitko #heuristic #realtime: Per-Map Algorithm Selection in Real-Time Heuristic Search (VB), pp. 143–148.
CIG-2016-SatoI #game studies: Three types of forward pruning techniques to apply the alpha beta algorithm to turn-based strategy games (NS, KI), pp. 1–8.
CIG-2016-SchmittK #multi #search-based #simulation: A multi-objective genetic algorithm for simulating optimal fights in StarCraft II (JS, HK), pp. 1–8.
CIG-2016-SungurS #behaviour #learning: Voluntary behavior on cortical learning algorithm based agents (AKS, ES), pp. 1–7.
CIG-2016-YooK #game studies #using #video: Changing video game graphic styles using neural algorithms (BY, KJK), pp. 1–2.
VS-Games-2016-RoseB #generative #overview: Algorithms and Approaches for Procedural Terrain Generation - A Brief Review of Current Techniques (TJR, AGB), pp. 1–2.
CIKM-2016-FangZWFZZ #effectiveness: Cost-Effective Stream Join Algorithm on Cloud System (JF, RZ0, XW, TZJF, ZZ, AZ), pp. 1773–1782.
CIKM-2016-HoLSKDWZS #behaviour #distributed #graph #scalability: A Distributed Graph Algorithm for Discovering Unique Behavioral Groups from Large-Scale Telco Data (QH, WL, ES, SK, TAD, JW, ICZ, ASN), pp. 1353–1362.
CIKM-2016-KangLAC #clustering: A Filtering-based Clustering Algorithm for Improving Spatio-temporal Kriging Interpolation Accuracy (QK, WkL, AA, ANC), pp. 2209–2214.
CIKM-2016-RajasekaranS #performance #problem: Efficient Algorithms for the Two Locus Problem in Genome-Wide Association Study: Algorithms for the Two Locus Problem (SR, SS), pp. 2305–2310.
CIKM-2016-Wang0PB #cpu #detection #online #self: A Self-Learning and Online Algorithm for Time Series Anomaly Detection, with Application in CPU Manufacturing (XW0, JL0, NP, MB), pp. 1823–1832.
ECIR-2016-WangYZ #realtime: Real-Time Bidding Based Display Advertising: Mechanisms and Algorithms (JW0, SY0, WZ0), pp. 897–901.
ICML-2016-AcharyaDLS #performance: Fast Algorithms for Segmented Regression (JA, ID, JL0, LS), pp. 2878–2886.
ICML-2016-AltschulerBFMRZ #bound #distributed #set: Greedy Column Subset Selection: New Bounds and Distributed Algorithms (JA, AB, GF, VSM, AR, MZ), pp. 2539–2548.
ICML-2016-ArjevaniS #complexity #first-order #on the #optimisation: On the Iteration Complexity of Oblivious First-Order Optimization Algorithms (YA, OS), pp. 908–916.
ICML-2016-AroraGKMM #modelling #topic: Provable Algorithms for Inference in Topic Models (SA, RG0, FK, TM, AM), pp. 2859–2867.
ICML-2016-AsterisKKP: A Simple and Provable Algorithm for Sparse Diagonal CCA (MA, AK, OK, RAP), pp. 1148–1157.
ICML-2016-BaiIWB #optimisation: Algorithms for Optimizing the Ratio of Submodular Functions (WB, RKI, KW, JAB), pp. 2751–2759.
ICML-2016-BlondelIFU #network #performance #polynomial: Polynomial Networks and Factorization Machines: New Insights and Efficient Training Algorithms (MB, MI, AF, NU), pp. 850–858.
ICML-2016-Curtis #optimisation #probability #self: A Self-Correcting Variable-Metric Algorithm for Stochastic Optimization (FC), pp. 632–641.
ICML-2016-DavidS #bound #performance #problem: PAC Lower Bounds and Efficient Algorithms for The Max K-Armed Bandit Problem (YD, NS), pp. 878–887.
ICML-2016-DegenneP #multi #probability: Anytime optimal algorithms in stochastic multi-armed bandits (RD, VP), pp. 1587–1595.
ICML-2016-GeJKNS #analysis #canonical #correlation #performance #scalability: Efficient Algorithms for Large-scale Generalized Eigenvector Computation and Canonical Correlation Analysis (RG0, CJ, SMK, PN, AS), pp. 2741–2750.
ICML-2016-JenattonHA #adaptation #constraints #online #optimisation: Adaptive Algorithms for Online Convex Optimization with Long-term Constraints (RJ, JCH, CA), pp. 402–411.
ICML-2016-KomiyamaHN #bound #performance #problem: Copeland Dueling Bandit Problem: Regret Lower Bound, Optimal Algorithm, and Computationally Efficient Algorithm (JK, JH, HN), pp. 1235–1244.
ICML-2016-LocatelliGC #problem: An optimal algorithm for the Thresholding Bandit Problem (AL, MG, AC), pp. 1690–1698.
ICML-2016-MandtHB #analysis #probability: A Variational Analysis of Stochastic Gradient Algorithms (SM, MDH, DMB), pp. 354–363.
ICML-2016-MedinaY #linear: No-Regret Algorithms for Heavy-Tailed Linear Bandits (AMM, SY), pp. 1642–1650.
ICML-2016-QuXO #analysis #optimisation #performance #probability: Fast Rate Analysis of Some Stochastic Optimization Algorithms (CQ, HX, CJO), pp. 662–670.
ICML-2016-Shamir #convergence #performance #probability: Fast Stochastic Algorithms for SVD and PCA: Convergence Properties and Convexity (OS), pp. 248–256.
ICML-2016-SyrgkanisKS #learning #performance: Efficient Algorithms for Adversarial Contextual Learning (VS, AK, RES), pp. 2159–2168.
ICML-2016-WangSDNSX #coordination #distributed #parallel: Parallel and Distributed Block-Coordinate Frank-Wolfe Algorithms (YXW, VS, WD0, WN, SS, EPX), pp. 1548–1557.
ICML-2016-ZarembaMJF #learning: Learning Simple Algorithms from Examples (WZ, TM, AJ, RF), pp. 421–429.
ICPR-2016-DushkoffMP: A temporally coherent neural algorithm for artistic style transfer (MD, RM, RWP), pp. 3288–3293.
ICPR-2016-HajduHBLEHT #approximate #grid #network #using: Measuring regularity of network patterns by grid approximations using the LLL algorithm (AH, BH, RB, IL, GE, LH, RT), pp. 1524–1529.
ICPR-2016-HsiaoC #identification #orthogonal #re-engineering #recognition: Over-atoms accumulation orthogonal matching pursuit reconstruction algorithm for fish recognition and identification (YHH, CCC), pp. 1071–1076.
ICPR-2016-OhY #graph #learning: Enhancing label inference algorithms considering vertex importance in graph-based semi-supervised learning (BO, JY), pp. 1671–1676.
ICPR-2016-YuenMT #dataset #evaluation #on the: On looking at faces in an automobile: Issues, algorithms and evaluation on naturalistic driving dataset (KY, SM, MMT), pp. 2777–2782.
ICPR-2016-ZhangCUL #performance: MLPF algorithm for tracking fast moving target against light interference (LZ, YC, ZU, TL), pp. 3939–3944.
KDD-2016-GhashamiLP #matrix #performance: Efficient Frequent Directions Algorithm for Sparse Matrices (MG, EL, JMP), pp. 845–854.
KDD-2016-HajianBC #bias #data mining #mining: Algorithmic Bias: From Discrimination Discovery to Fairness-aware Data Mining (SH, FB, CC0), pp. 2125–2126.
KDD-2016-LiLDWWC #linear #parallel #sequence: A Real Linear and Parallel Multiple Longest Common Subsequences (MLCS) Algorithm (YL, HL, TD, SW, ZW, YC), pp. 1725–1734.
KDD-2016-MaiAS #clustering #dataset #named #performance #scalability: AnyDBC: An Efficient Anytime Density-based Clustering Algorithm for Very Large Complex Datasets (STM, IA, MS), pp. 1025–1034.
KDD-2016-PrakashR #data mining #mining #modelling: Leveraging Propagation for Data Mining: Models, Algorithms and Applications (BAP, NR), pp. 2133–2134.
KDD-2016-TanFLWLLPXH #adaptation #predict #scalability: Scalable Time-Decaying Adaptive Prediction Algorithm (YT, ZF, GL, FW, ZL, SL, QP, EPX, QH), pp. 617–626.
KDD-2016-YangFK0 #feature model #online #parallel: Online Feature Selection: A Limited-Memory Substitution Algorithm and Its Asynchronous Parallel Variation (HY, RF, YK, JL0), pp. 1945–1954.
KDD-2016-YinW #clustering #online #using: A Text Clustering Algorithm Using an Online Clustering Scheme for Initialization (JY, JW), pp. 1995–2004.
MoDELS-2016-FontAHC #feature model #information retrieval #modelling #search-based: Feature location in models through a genetic algorithm driven by information retrieval techniques (JF, LA, ØH, CC), pp. 272–282.
MoDELS-2016-FreundB #development #modelling: A generic transformation algorithm to simplify the development of mapping models (MF, AB), pp. 284–294.
OOPSLA-2016-Itzhaky0SYLLC #divide and conquer #programming #using: Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations (SI, RS0, ASL, KY, YL, CEL, RAC), pp. 145–164.
OOPSLA-2016-PaiP #compilation #graph #optimisation #throughput: A compiler for throughput optimization of graph algorithms on GPUs (SP, KP), pp. 1–19.
OOPSLA-2016-SrinivasanR #slicing: An improved algorithm for slicing machine code (VS, TWR), pp. 378–393.
POPL-2016-ChatterjeeFNH #analysis #probability #problem #source code #termination: Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs (KC, HF0, PN0, RH), pp. 327–342.
POPL-2016-ChatterjeeGIP #algebra #component #concurrent #constant: Algorithms for algebraic path properties in concurrent systems of constant treewidth components (KC, AKG, RIJ, AP), pp. 733–747.
POPL-2016-CiminiS #generative #type system: The gradualizer: a methodology and algorithm for generating gradual type systems (MC, JGS), pp. 443–455.
POPL-2016-DragoiHZ #distributed #fault tolerance #named: PSync: a partially synchronous language for fault-tolerant distributed algorithms (CD, TAH, DZ), pp. 400–415.
PPDP-2016-MesnardPV #framework #recognition #towards: Towards a framework for algorithm recognition in binary code (FM, ÉP, WV), pp. 202–213.
FSE-2016-CohenPV #lens #testing: Budgeted testing through an algorithmic lens (MBC, AP, NVV), pp. 948–951.
ICSE-2016-MedeirosKRGA #comparison #configuration management: A comparison of 10 sampling algorithms for configurable systems (FM, CK, MR, RG, SA), pp. 643–654.
ICSE-2016-WangAYLL #quality #re-engineering #search-based: A practical guide to select quality indicators for assessing pareto-based search algorithms in search-based software engineering (SW0, SA0, TY0, YL, ML), pp. 631–642.
CASE-2016-ChenKZW #classification #clustering #novel: A novel under-sampling algorithm based on Iterative-Partitioning Filters for imbalanced classification (XC, QK, MZ, ZW), pp. 490–494.
CASE-2016-FaalO #random: Regionally Growing Random Trees: A synergistic motion planning and control algorithm for dynamic systems (SGF, CDO), pp. 141–147.
CASE-2016-KabirLSRZKMG #multi #tool support: Planning algorithms for multi-setup multi-pass robotic cleaning with oscillatory moving tools (AMK, JDL, SS, VSR, CZ, KNK, JAM, SKG), pp. 751–757.
CASE-2016-LiLGGH #novel: A novel RGB-D SLAM algorithm based on points and plane-patches (RL, QL0, JG, DG, HH), pp. 1348–1353.
CASE-2016-RahmanBR #multi: Sampling-based planning algorithms for multi-objective missions (MMR, LB, BR), pp. 709–714.
CASE-2016-Ritt #bound #permutation #problem #scheduling: A branch-and-bound algorithm with cyclic best-first search for the permutation flow shop scheduling problem (MR), pp. 872–877.
CASE-2016-SundarQRNDV #problem #scheduling: Algorithms for a Satellite Constellation scheduling Problem (KS, JQ, SR, LN, SD, CGV), pp. 373–378.
CASE-2016-ZhouCLZ #clustering #constraints #reduction: Model reduction method based on selective clustering ensemble algorithm and Theory of Constraints in semiconductor wafer fabrication (CZ, ZC, ML0, JZ), pp. 885–890.
ESOP-2016-MineBR #constraints #induction #invariant #source code #theorem proving: An Algorithm Inspired by Constraint Solvers to Infer Inductive Invariants in Numeric Programs (AM, JB, TWR), pp. 560–588.
CAV-2016-HahnSTZ #game studies #probability: A Simple Algorithm for Solving Qualitative Probabilistic Parity Games (EMH, SS, AT, LZ0), pp. 291–311.
ICTSS-2016-KampelS #combinator #generative #testing: Set-Based Algorithms for Combinatorial Test Set Generation (LK, DES), pp. 231–240.
IJCAR-2016-Gulwani #ambiguity #programming: Programming by Examples: Applications, Algorithms, and Ambiguity Resolution (SG), pp. 9–14.
IJCAR-2016-Nivelle #geometry: Subsumption Algorithms for Three-Valued Geometric Resolution (HdN), pp. 257–272.
HT-2015-RoutB #dataset #ranking #twitter: A Human-annotated Dataset for Evaluating Tweet Ranking Algorithms (DPR, KB), pp. 95–99.
PODS-2015-AcharyaDHLS #approximate #performance: Fast and Near-Optimal Algorithms for Approximating Distributions by Histograms (JA, ID, CH, JZL, LS), pp. 249–263.
SIGMOD-2015-ChangLQYZ #component: Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity (LC, XL, LQ, JXY, WZ), pp. 459–474.
SIGMOD-2015-GuoCC #keyword #performance #query: Efficient Algorithms for Answering the m-Closest Keywords Query (TG, XC, GC), pp. 405–418.
SIGMOD-2015-TrummerK #incremental #multi #optimisation #query: An Incremental Anytime Algorithm for Multi-Objective Query Optimization (IT, CK), pp. 1941–1953.
SIGMOD-2015-YuanMYG #graph: Updating Graph Indices with a One-Pass Algorithm (DY, PM, HY, CLG), pp. 1903–1916.
VLDB-2015-ChoBBFKP #named #parallel #performance: PARADIS: An Efficient Parallel Algorithm for In-place Radix Sort (MC, DB, RB, UF, VK, RP), pp. 1518–1529.
VLDB-2015-DingSMM #framework #named #optimisation #problem: TOP: A Framework for Enabling Algorithmic Optimizations for Distance-Related Problems (YD, XS, MM, TM), pp. 1046–1057.
VLDB-2015-InoueT #array #sorting: SIMD- and Cache-Friendly Algorithm for Sorting an Array of Structures (HI, KT), pp. 1274–1285.
VLDB-2015-KejariwalKR #realtime: Real Time Analytics: Algorithms and Systems (AK, SK, KR), pp. 2040–2051.
VLDB-2015-PapenbrockEMNRZ #dependence #evaluation #functional: Functional Dependency Discovery: An Experimental Evaluation of Seven Algorithms (TP, JE, JM, TN, JPR, MS, JZ, FN), pp. 1082–1093.
VLDB-2015-ShiokawaFO #clustering #graph #performance #scalability: SCAN++: Efficient Algorithm for Finding Clusters, Hubs and Outliers on Large-scale Graphs (HS, YF, MO), pp. 1178–1189.
VLDB-2015-VesdapuntBD #crowdsourcing: Errata for “Crowdsourcing Algorithms for Entity Resolution” (PVLDB 7(12): 1071-1082) (NV, KB, NND), p. 641.
EDM-2015-OstrowDH #optimisation #performance #predict #student: Optimizing Partial Credit Algorithms to Predict Student Performance (KO, CD, NTH), pp. 404–407.
EDM-2015-PriceLBC #data-driven #probability: An Improved Data-Driven Hint Selection Algorithm for Probability Tutors (TWP, CL, TB, MC), pp. 610–611.
EDM-2015-StrechtCSMA #case study #classification #comparative #modelling #performance #student: A Comparative Study of Regression and Classification Algorithms for Modelling Students' Academic Performance (PS, LC0, CS, JMM, RA), pp. 392–395.
ITiCSE-2015-Frison #education: A Teaching Assistant for Algorithm Construction (PF), pp. 9–14.
ITiCSE-2015-Soyslo #student: From Algorithmic to Computational Thinking: On the Way for Computing for all Students (MMS), p. 1.
ITiCSE-2015-Thomas #women: Supporting Computational Algorithmic Thinking (SCAT): Exploring the difficulties African-American middle school girls face while enacting computational algorithmic thinking (JOT), pp. 69–74.
SANER-2015-PalixFL #difference: Improving pattern tracking with a language-aware tree differencing algorithm (NP, JRF, JL), pp. 43–52.
ICALP-v1-2015-AmanatidisMNS #approximate: Approximation Algorithms for Computing Maximin Share Allocations (GA, EM, AN, AS), pp. 39–51.
ICALP-v1-2015-BehsazFSS #approximate #clustering: Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median (BB, ZF, MRS, RS), pp. 116–128.
ICALP-v1-2015-BhattacharyaHI #design: Design of Dynamic Algorithms via Primal-Dual Method (SB, MH, GFI), pp. 206–218.
ICALP-v1-2015-BurtonMS #complexity #invariant: Algorithms and Complexity for Turaev-Viro Invariants (BAB, CM, JS), pp. 281–293.
ICALP-v1-2015-ChekuriGQ #streaming: Streaming Algorithms for Submodular Function Maximization (CC, SG, KQ), pp. 318–330.
ICALP-v1-2015-FominKLPS #polynomial: Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (FVF, PK, DL, FP, SS), pp. 494–505.
ICALP-v1-2015-GaspersS #performance #set: Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets (SG, GBS), pp. 567–579.
ICALP-v1-2015-GrosseGKSS #performance: Fast Algorithms for Diameter-Optimally Augmenting Paths (UG, JG, CK, MHMS, FS), pp. 678–688.
ICALP-v1-2015-HenzingerKN #graph #reachability: Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs (MH, SK, DN), pp. 725–736.
ICALP-v1-2015-LokshtanovRS #feedback #linear #set: Linear Time Parameterized Algorithms for Subset Feedback Vertex Set (DL, MSR, SS), pp. 935–946.
ICALP-v1-2015-MitchellPSW: An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains (JSBM, VP, MS, HW), pp. 947–959.
ICALP-v1-2015-MomkeW #approximate #problem: A (2+ε)-Approximation Algorithm for the Storage Allocation Problem (TM, AW), pp. 973–984.
ICALP-v1-2015-WangW #online: Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm (YW, SCwW), pp. 1070–1081.
ICALP-v1-2015-Yu #combinator #matrix #multi: An Improved Combinatorial Algorithm for Boolean Matrix Multiplication (HY), pp. 1094–1105.
ICALP-v2-2015-Charron-BostFN #approximate #network: Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms (BCB, MF, TN), pp. 528–539.
LATA-2015-BjorklundDZ #automaton #performance: An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring (JB, FD, NZ), pp. 97–108.
LATA-2015-DaiW #parallel #random #sequence: A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk (HKD, ZW), pp. 133–144.
SEFM-2015-VollingerR #certification #distributed #problem: Certification of Distributed Algorithms Solving Problems with Optimal Substructure (KV, WR), pp. 190–195.
ICFP-2015-ZilianiS #coq #morphism #polymorphism #unification: A unification algorithm for Coq featuring universe polymorphism and overloading (BZ, MS), pp. 179–191.
AIIDE-2015-ManavalanBS #behaviour #generative #lightweight: A Lightweight Algorithm for Procedural Generation of Emotionally Affected Behavior and Appearance (YBM, VB, MS), pp. 142–148.
CIG-2015-ChangHH #analysis #case study #convergence #correctness #monte carlo: Convergence and correctness analysis of Monte-Carlo tree search algorithms: A case study of 2 by 4 Chinese dark chess (HJC, CWH, TsH), pp. 260–266.
CIG-2015-ChuHGHT #game studies #knowledge-based #monte carlo #video: Combining pathfmding algorithm with Knowledge-based Monte-Carlo tree search in general video game playing (CYC, HH, ZG, TH, RT), pp. 523–529.
CIG-2015-FujikiIV #comparison #framework #game studies #monte carlo #platform: A platform for turn-based strategy games, with a comparison of Monte-Carlo algorithms (TF, KI, SV), pp. 407–414.
CIG-2015-ImagawaK #game studies #monte carlo: Enhancements in Monte Carlo tree search algorithms for biased game trees (TI, TK), pp. 43–50.
CIG-2015-KozlovaBR #generative: Examination of representational expression in maze generation algorithms (AK, JAB, ER), pp. 532–533.
CIG-2015-ZelinkaS #named: StarCraft: Brood War - Strategy powered by the SOMA swarm algorithm (IZ, LS), pp. 511–516.
FDG-2015-Thomas #comprehension #design #development #game studies #women: Supporting Computational Algorithmic Thinking (SCAT): Understanding the Development of Computational Algorithmic Thinking Capabilities in African-American Middle-School Girls Through Game Design (JOT).
VS-Games-2015-YohannisP #gamification #learning #sorting #visualisation: Sort Attack: Visualization and Gamification of Sorting Algorithm Learning (AY, YP), pp. 1–8.
CHI-2015-EslamiRVAVKHS #quote #reasoning: “I always assumed that I wasn’t really that close to [her]”: Reasoning about Invisible Algorithms in News Feeds (ME, AR, KV, AA, AV, KK, KH, CS), pp. 153–162.
CHI-2015-LeeKMD #data-driven: Working with Machines: The Impact of Algorithmic and Data-Driven Management on Human Workers (MKL, DK, EM, LD), pp. 1603–1612.
CHI-2015-LoeppH0 #information management #interactive #recommendation: Blended Recommending: Integrating Interactive Information Filtering and Algorithmic Recommender Techniques (BL, KH, JZ), pp. 975–984.
CHI-2015-RaderG #comprehension #facebook: Understanding User Beliefs About Algorithmic Curation in the Facebook News Feed (ER, RG), pp. 173–182.
CHI-2015-WarshawMWKBS #comprehension #people: Can an Algorithm Know the “Real You”?: Understanding People’s Reactions to Hyper-personal Analytics Systems (JW, TM, SW, CK, MNB, BAS), pp. 797–806.
CSCW-2015-SenGGHLNRWH #community #standard: Turkers, Scholars, “Arafat” and “Peace”: Cultural Communities and Algorithmic Gold Standards (SS, MEG, RG, BH, ML, SN, JR, Z(W, BH), pp. 826–838.
CSCW-2015-Tufekci: Algorithms in our Midst: Information, Power and Choice when Software is Everywhere (ZT), p. 1918.
DHM-EH-2015-GeurtsSKBL #3d #comparison #image #modelling #segmentation #statistics #visual notation: Visual Comparison of 3D Medical Image Segmentation Algorithms Based on Statistical Shape Models (AG, GS, AK, MB, TvL), pp. 336–344.
HCI-DE-2015-GrobelnyM #analysis #comparative #design #grid #visual notation: Comparative Analysis of Regular Grid Based Algorithms in the Design of Graphical Control Panels (JG, RM), pp. 332–339.
ICEIS-v1-2015-AwasthiLK #linear #problem #sequence #strict: Un-restricted Common Due-Date Problem with Controllable Processing Times — Linear Algorithm for a Given Job Sequence (AA, JL, OK), pp. 526–534.
ICEIS-v1-2015-CarboneraA #category theory #clustering #named: CBK-Modes: A Correlation-based Algorithm for Categorical Data Clustering (JLC, MA), pp. 603–608.
ICEIS-v1-2015-Castanon-PugaSG #data mining #fuzzy #logic #mining #mobile #using: Hybrid-Intelligent Mobile Indoor Location Using Wi-Fi Signals — Location Method Using Data Mining Algorithms and Type-2 Fuzzy Logic Systems (MCP, ASC, CGP, GLS, MFP, EAT), pp. 609–615.
ICEIS-v1-2015-NouriDG #flexibility #multi #problem #scheduling #search-based: Genetic Algorithm Combined with Tabu Search in a Holonic Multiagent Model for Flexible Job Shop Scheduling Problem (HEN, OBD, KG), pp. 573–584.
ICEIS-v1-2015-YakhyaevaY: An Algorithm to Compare Computer-security Knowledge from Different Sources (GY, OY), pp. 565–572.
ICEIS-v2-2015-CanutMOPS #case study #comparative #empirical #profiling: A Comparative Study of Two Egocentric-based User Profiling Algorithms — Experiment in Delicious (CMFC, MM, SOa, AP, FS), pp. 632–639.
CIKM-2015-ChoromanskiRS #database #online #query #statistics: An Optimal Online Algorithm For Retrieving Heavily Perturbed Statistical Databases In The Low-Dimensional Querying Model (KMC, AR, US), pp. 1381–1390.
CIKM-2015-KangGWM #clustering #network #scalability: Scalable Clustering Algorithm via a Triangle Folding Processing for Complex Networks (YK, XG, WW0, DM), pp. 33–42.
CIKM-2015-MiyauchiK #community #detection #network #novel #quality #what: What Is a Network Community?: A Novel Quality Function and Detection Algorithms (AM0, YK), pp. 1471–1480.
ECIR-2015-SchedlHFT #music #on the #recommendation: On the Influence of User Characteristics on Music Recommendation Algorithms (MS, DH, KF, MT), pp. 339–345.
ICML-2015-BenavoliCMZ #parametricity: A Bayesian nonparametric procedure for comparing algorithms (AB, GC, FM, MZ), pp. 1264–1272.
ICML-2015-BeygelzimerKL #adaptation #online: Optimal and Adaptive Algorithms for Online Boosting (AB, SK, HL), pp. 2323–2331.
ICML-2015-FrostigGKS #approximate #empirical #named #performance #probability: Un-regularizing: approximate proximal point and faster stochastic algorithms for empirical risk minimization (RF, RG, SK, AS), pp. 2540–2548.
ICML-2015-GajaneUC #exponential: A Relative Exponential Weighing Algorithm for Adversarial Utility-based Dueling Bandits (PG, TU, FC), pp. 218–227.
ICML-2015-GiguereRLM #kernel #predict #problem #string: Algorithms for the Hard Pre-Image Problem of String Kernels and the General Problem of String Prediction (SG, AR, FL, MM), pp. 2021–2029.
ICML-2015-GuL #fault: A New Generalized Error Path Algorithm for Model Selection (BG, CXL), pp. 2549–2558.
ICML-2015-KricheneBTB: The Hedge Algorithm on a Continuum (WK, MB, CJT, AMB), pp. 824–832.
ICML-2015-MarietS #fixpoint #learning #process: Fixed-point algorithms for learning determinantal point processes (ZM, SS), pp. 2389–2397.
ICML-2015-NarasimhanRS0 #consistency #metric #multi #performance: Consistent Multiclass Algorithms for Complex Performance Measures (HN, HGR, AS, SA), pp. 2398–2407.
ICML-2015-RaskuttiM #random #sketching #statistics: Statistical and Algorithmic Perspectives on Randomized Sketching for Ordinary Least-Squares (GR, MM), pp. 617–625.
ICML-2015-ShahKG #empirical #probability #process: An Empirical Study of Stochastic Variational Inference Algorithms for the Beta Bernoulli Process (AS, DAK, ZG), pp. 1594–1603.
ICML-2015-Shamir #convergence #exponential #probability: A Stochastic PCA and SVD Algorithm with an Exponential Convergence Rate (OS), pp. 144–152.
ICML-2015-WuS #learning #modelling #online: An Online Learning Algorithm for Bilinear Models (YW, SS), pp. 890–898.
ICML-2015-XuJZ #matrix: CUR Algorithm for Partially Observed Matrices (MX, RJ, ZHZ), pp. 1412–1421.
ICML-2015-YangX #framework: A Unified Framework for Outlier-Robust PCA-like Algorithms (WY, HX), pp. 484–493.
ICML-2015-YiCP #performance: Binary Embedding: Fundamental Limits and Fast Algorithm (XY, CC, EP), pp. 2162–2170.
ICML-2015-ZhangWJ #bound #distributed #estimation #matrix #performance #rank: Distributed Estimation of Generalized Matrix Rank: Efficient Algorithms and Lower Bounds (YZ, MJW, MIJ), pp. 457–465.
KDD-2015-ChierichettiEKL #network #performance #social: Efficient Algorithms for Public-Private Social Networks (FC, AE, RK, SL, VSM), pp. 139–148.
KDD-2015-CortesMM #adaptation: Adaptation Algorithm and Theory Based on Generalized Discrepancy (CC, MM, AMM), pp. 169–178.
KDD-2015-GleichM #graph #learning #using: Using Local Spectral Methods to Robustify Graph-Based Learning Algorithms (DFG, MWM), pp. 359–368.
KDD-2015-MahdianSV: Algorithmic Cartography: Placing Points of Interest and Ads on Maps (MM, OS, SV), pp. 755–764.
KDD-2015-MinorDC #data-driven #evaluation #predict #process: Data-Driven Activity Prediction: Algorithms, Evaluation Methodology, and Applications (BM, JRD, DJC), pp. 805–814.
KDD-2015-RiondatoU15a #learning #statistics: VC-Dimension and Rademacher Averages: From Statistical Learning Theory to Sampling Algorithms (MR, EU), pp. 2321–2322.
KDD-2015-Shun #estimation #evaluation #graph #parallel: An Evaluation of Parallel Eccentricity Estimation Algorithms on Undirected Real-World Graphs (JS), pp. 1095–1104.
KDD-2015-Yi0YLW #clustering #constraints #performance: An Efficient Semi-Supervised Clustering Algorithm with Sequential Constraints (JY, LZ, TY, WL, JW), pp. 1405–1414.
MLDM-2015-AmalamanE #clustering #named: Avalanche: A Hierarchical, Divisive Clustering Algorithm (PKA, CFE), pp. 296–310.
MLDM-2015-IshayH #clustering #integration #novel: A Novel Algorithm for the Integration of the Imputation of Missing Values and Clustering (RBI, MH), pp. 115–129.
MLDM-2015-TaT #database #owl #relational: Improving the Algorithm for Mapping of OWL to Relational Database Schema (CDCT, TPT), pp. 130–139.
RecSys-2015-EkstrandKHK #case study #recommendation: Letting Users Choose Recommender Algorithms: An Experimental Study (MDE, DK, FMH, JAK), pp. 11–18.
RecSys-2015-ForsatiBMER #named #performance #recommendation #trust: PushTrust: An Efficient Recommendation Algorithm by Leveraging Trust and Distrust Relations (RF, IB, FM, AHE, HR), pp. 51–58.
RecSys-2015-KowaldL #case study #comparative #folksonomy #recommendation: Evaluating Tag Recommender Algorithms in Real-World Folksonomies: A Comparative Study (DK, EL), pp. 265–268.
RecSys-2015-MarinhoTP #question #recommendation: Are Real-World Place Recommender Algorithms Useful in Virtual World Environments? (LBM, CT, DP), pp. 245–248.
SEKE-2015-Murillo-MoreraJ #approach #framework #learning #predict #search-based #using: A Software Defect-Proneness Prediction Framework: A new approach using genetic algorithms to generate learning schemes (JMM, MJ), pp. 445–450.
SEKE-2015-SaberE #array #clustering #novel: BiBinConvmean : A Novel Biclustering Algorithm for Binary Microarray Data (HBS, ME), pp. 178–181.
SEKE-2015-XuSZ #policy #testing: Fault-Based Testing of Combining Algorithms in XACML3.0 Policies (DX, NS, YZ), pp. 433–438.
SIGIR-2015-LuccheseNOPTV #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.
ICMT-J-2012-VarroDWS15 #emf #generative #modelling #pattern matching: An algorithm for generating model-sensitive search plans for pattern matching on EMF models (GV, FD, MW, AS), pp. 597–621.
ICMT-2015-KlugeVS #design #graph transformation: A Methodology for Designing Dynamic Topology Control Algorithms via Graph Transformation (RK, GV, AS), pp. 199–213.
MoDELS-2015-GregoricsGKDD #diagrams #layout #visualisation: Textual diagram layout language and visualization algorithm (BG, TG, GFK, AD, GD), pp. 196–205.
SPLC-2015-ArrietaSE #cyber-physical #product line #validation: Test control algorithms for the validation of cyber-physical systems product lines (AA, GS, LE), pp. 273–282.
LOPSTR-2015-InsaS #debugging: A Generalized Model for Algorithmic Debugging (DI, JS), pp. 261–276.
PLDI-2015-DingAVSOA: Autotuning algorithmic choice for input sensitivity (YD, JA, KV, XS, UMO, SPA), pp. 379–390.
PLDI-2015-FaddegonC #debugging #dependence #haskell #source code #stack: Algorithmic debugging of real-world haskell programs: deriving dependencies from the cost centre stack (MF, OC), pp. 33–42.
POPL-2015-ChatterjeeIPG #algebra #constant #performance #recursion #state machine: Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth (KC, RIJ, AP, PG), pp. 97–109.
POPL-2015-Pous #algebra #equivalence #testing: Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests (DP), pp. 357–368.
ASE-2015-LinLCSH0 #combinator #generative #metaheuristic #named #performance #testing: TCA: An Efficient Two-Mode Meta-Heuristic Algorithm for Combinatorial Test Generation (T) (JL, CL, SC, KS, DH, LZ), pp. 494–505.
ICSE-v1-2015-ZouWXZSM #detection #float #search-based: A Genetic Algorithm for Detecting Significant Floating-Point Inaccuracies (DZ, RW, YX, LZ, ZS, HM), pp. 529–539.
SAC-2015-AbdiAM #robust #video: A robust video watermarking algorithm in H.264/AVC compressed domain (LA, FBA, AM), pp. 1291–1293.
SAC-2015-AbdiH #distributed: An algorithm for distributed certificate chain discovery in open environments (SA, JH), pp. 2292–2298.
SAC-2015-BarddalGE #clustering #data type #named #social: SNCStream: a social network-based data stream clustering algorithm (JPB, HMG, FE), pp. 935–940.
SAC-2015-BasgaluppBP #evolution #induction #multi: Evolving decision-tree induction algorithms with a multi-objective hyper-heuristic (MPB, RCB, VP), pp. 110–117.
SAC-2015-CruzPQSSOBO #game studies #named #probability #using: Amê: an environment to learn and analyze adversarial search algorithms using stochastic card games (ABC, LP, JQ, US, SS, AO, EB, ESO), pp. 208–213.
SAC-2015-FerrucciSKS #framework #parallel #pipes and filters #search-based: A parallel genetic algorithms framework based on Hadoop MapReduce (FF, PS, MTK, FS), pp. 1664–1667.
SAC-2015-GoldnerVSG #2d: A shortest path algorithm for 2D seismic horizon tracking (ELG, CNV, PMS, MG), pp. 80–85.
SAC-2015-JeongYAYP #interactive #network #search-based #using: Inference of disease-specific gene interaction network using a Bayesian network learned by genetic algorithm (DJ, YY, JA, YY, SP), pp. 47–53.
SAC-2015-Jo #image #interactive #search-based #using: Color image quantization using interactive genetic algorithm (SJ), pp. 139–140.
SAC-2015-JoCKBO #approach #collaboration #cpu #data-driven #on the: On running data-intensive algorithms with intelligent SSD and host CPU: a collaborative approach (YYJ, SC, SWK, DHB, HO), pp. 2060–2065.
SAC-2015-LeeKKE #architecture #hybrid #memory management #named: M-CLOCK: migration-optimized page replacement algorithm for hybrid DRAM and PCM memory architecture (ML, DK, JK, YIE), pp. 2001–2006.
SAC-2015-LevoratoDFF #network #social: An ILS algorithm to evaluate structural balance in signed social networks (ML, LMdAD, YF, RMVdF), pp. 1117–1122.
SAC-2015-MartinCBGP #gpu: OpenACC-based GPU acceleration of an optical flow algorithm (NM, JC, GB, CG, MP), pp. 96–98.
SAC-2015-NascimentoPM #machine learning #metaheuristic: A data quality-aware cloud service based on metaheuristic and machine learning provisioning algorithms (DCN, CESP, DGM), pp. 1696–1703.
SAC-2015-RiediBP #performance #scalability: Channel and power allocation algorithm to optimize the performance of large WLANs (MR, GGB, MEP), pp. 673–679.
SAC-2015-RochaRCOMVADGF #classification #dataset #documentation #named #performance #using: G-KNN: an efficient document classification algorithm for sparse datasets on GPUs using KNN (LCdR, GSR, RC, RSO, DM, FV, GA, SD, MAG, RF), pp. 1335–1338.
SAC-2015-SilvaMR #approach #problem #using: An approach to the MOGAS initialization problem using an algorithm based on path relinking (TGNdS, JEBM, LSR), pp. 118–124.
SAC-2015-Zheng #recommendation: Improve general contextual slim recommendation algorithms by factorizing contexts (YZ), pp. 929–930.
CASE-2015-ChangL #fuzzy #image: A fuzzy weighted mean aggregation algorithm for color image impulse noise removal (JYC, PCL), pp. 1268–1273.
CASE-2015-ChengTLCH #modelling #network #optimisation: Modeling and optimizing tensile strength and yield point on steel bar by artificial neural network with evolutionary algorithm (CKC, JTT, TTL, JHC, KSH), pp. 1562–1563.
CASE-2015-ChouTHC #adaptation #design #parametricity #process: Adaptive neuro-fuzzy inference system with evolutionary algorithm for designing process parameters of color filter (PYC, JTT, WHH, JHC), pp. 1555–1556.
CASE-2015-DeviNVKM #implementation: E-mandi implementation based on gale-shapely algorithm for perishable goods supply chain (SPD, YN, NV, SVK, SM), pp. 1421–1426.
CASE-2015-FarhanPWL #machine learning #predict #using: Predicting individual thermal comfort using machine learning algorithms (AAF, KRP, BW, PBL), pp. 708–713.
CASE-2015-LinHK #fuzzy #image #segmentation: A noise- and size-insensitive integrity-based fuzzy c-means algorithm for image segmentation (PLL, PWH, CHK), pp. 1282–1287.
CASE-2015-LiuC #evaluation #performance #quality #using: A fast algorithm for grasp quality evaluation using the object wrench space (SL, SC), pp. 558–563.
CASE-2015-LyuWC #heuristic #integer #programming: Mixed integer programming model and heuristic algorithm for production planning of continuous casting and hot rolling (ML, ZW, FTSC), pp. 1503–1508.
CASE-2015-MaedaK #hybrid: Inverse kinematics solution algorithm for continuous/binary hybrid manipulator (KM, EK), pp. 483–488.
CASE-2015-ShellshearCBT #concurrent #multi #problem #thread: A multi-threaded memetic packing algorithm for the ISO luggage packing problem (ES, JSC, RB, ST), pp. 1509–1514.
CASE-2015-SterlingSZC #optimisation #parametricity #process: Welding parameter optimization based on Gaussian process regression Bayesian optimization algorithm (DS, TS, YZ, HC), pp. 1490–1496.
CASE-2015-TanakaM #bound #problem #strict: Dominance properties for the unrestricted block relocation problem and their application to a branch-and-bound algorithm (ST, FM), pp. 509–514.
CASE-2015-ZakharovZYJ #configuration management #distributed #fault tolerance #optimisation #performance #predict: A performance optimization algorithm for controller reconfiguration in fault tolerant distributed model predictive control (AZ, EZ, MY, SLJJ), pp. 886–891.
DAC-2015-BockHKS #modelling: Local search algorithms for timing-driven placement under arbitrary delay models (AB, SH, NK, US), p. 6.
DAC-2015-DingCZ #invariant #performance: An efficient shift invariant rasterization algorithm for all-angle mask patterns in ILT (YD, CCNC, XZ), p. 6.
DAC-2015-PapamichaelMH #automation #design #named #performance #search-based #using: Nautilus: fast automated IP design space search using guided genetic algorithms (MKP, PM, JCH), p. 6.
DAC-2015-RamprasathV #optimisation #performance #statistics: An efficient algorithm for statistical timing yield optimization (SR, VV), p. 6.
DAC-2015-VasudevanR #performance: An efficient algorithm for frequency-weighted balanced truncation of VLSI interconnects in descriptor form (VV, MR), p. 6.
DAC-2015-ZhuangYKWC #exponential #framework #performance #scalability #simulation #using: An algorithmic framework for efficient large-scale circuit simulation using exponential integrators (HZ, WY, IK, XW, CKC), p. 6.
DATE-2015-ArumugamSAPUBPY #co-evolution #design #energy #memory management #novel #performance: Novel inexact memory aware algorithm co-design for energy efficient computation: algorithmic principles (GPA, PS, JA, KVP, EU, AB, P, SY), pp. 752–757.
DATE-2015-CasagrandeR #fuzzy #game studies #named #novel #optimisation #robust: GTFUZZ: a novel algorithm for robust dynamic power optimization via gate sizing with fuzzy games (TC, NR), pp. 677–682.
DATE-2015-ChenKXMLYVSCY #array #learning: Technology-design co-optimization of resistive cross-point array for accelerating learning algorithms on chip (PYC, DK, ZX, AM, BL, JY, SBKV, JsS, YC, SY), pp. 854–859.
DATE-2015-FernandoWNKC #agile #design #synthesis #using: (AS)2: accelerator synthesis using algorithmic skeletons for rapid design space exploration (SF, MW, CN, AK, HC), pp. 305–308.
DATE-2015-GoncalvesLCTCB #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-HuangHC #clustering #framework #multi #problem #scalability: Clustering-based multi-touch algorithm framework for the tracking problem with a large number of points (SLH, SYH, CPC), pp. 719–724.
DATE-2015-KamalIAP: A thermal stress-aware algorithm for power and temperature management of MPSoCs (MK, AI, AAK, MP), pp. 954–959.
DATE-2015-LiDC #clustering #power of: A scan partitioning algorithm for reducing capture power of delay-fault LBIST (NL, ED, GC), pp. 842–847.
DATE-2015-PhilippeCBP #design #embedded: Exploration and design of embedded systems including neural algorithms (JMP, AC, OB, MP), pp. 986–991.
HPCA-2015-HayesPUCV #architecture #novel #sorting: VSR sort: A novel vectorised sorting algorithm & architecture extensions for future microprocessors (TH, OP, OSÜ, AC, MV), pp. 26–38.
PDP-2015-AcostaA #android #implementation #mobile #parallel: Parallel Implementations of the Particle Filter Algorithm for Android Mobile Devices (AA, FA), pp. 244–247.
PDP-2015-BravoSW #architecture #implementation #performance: Efficient Implementation of a Fast Viewshed Algorithm on SIMD Architectures (JCB, TS, JW), pp. 199–202.
PDP-2015-CicirelliFFGMS: Strategies for Parallelizing Swarm Intelligence Algorithms (FC, GF, AF, AG, CM, GS), pp. 329–336.
PDP-2015-CruzDPN #performance: An Efficient Algorithm for Communication-Based Task Mapping (EHMdC, MD, LLP, POAN), pp. 207–214.
PDP-2015-DkhilDLR #embedded #hybrid #scheduling #self #streaming: A Hybrid Scheduling Algorithm Based on Self-Timed and Periodic Scheduling for Embedded Streaming Applications (AD, XD, SL, CR), pp. 711–715.
PDP-2015-GlantzMN #architecture #grid #parallel #process: Algorithms for Mapping Parallel Processes onto Grid and Torus Architectures (RG, HM, AN), pp. 236–243.
PDP-2015-KamalBBM #estimation #parallel: Cost Estimation of Parallel Constrained Producer-Consumer Algorithms (TK, KRB, ARB, MVM), pp. 86–93.
PDP-2015-Morancho #case study #implementation: A Vector Implementation of Gaussian Elimination over GF(2): Exploring the Design-Space of Strassen’s Algorithm as a Case Study (EM), pp. 111–118.
PDP-2015-NakanoI #gpu #implementation #memory management #parallel: Optimality of Fundamental Parallel Algorithms on the Hierarchical Memory Machine, with GPU Implementation (KN, YI), pp. 626–634.
PDP-2015-PenarandaRGL #adaptation #named: XORAdap: A HoL-Blocking Aware Adaptive Routing Algorithm (RP, CGR, MEG, PL), pp. 48–52.
PDP-2015-RezaeiDZSWE: Dynamic Application Mapping Algorithm for Wireless Network-on-Chip (AR, MD, DZ, FS, XW, ME), pp. 421–424.
PDP-2015-SalamatEB #3d #adaptation #fault #strict: An Adaptive, Low Restrictive and Fault Resilient Routing Algorithm for 3D Network-on-Chip (RS, ME, NB), pp. 392–395.
PDP-2015-SoroushniaDPP #gpu #implementation #parallel #pattern matching: Parallel Implementation of Fuzzified Pattern Matching Algorithm on GPU (SS, MD, TP, JP), pp. 341–344.
PDP-2015-SousaMP #parallel #performance: A Generic and Highly Efficient Parallel Variant of Boruvka’s Algorithm (CdSS, AM, AP), pp. 610–617.
PDP-2015-ZahidGBJS #clustering #enterprise #performance: A Weighted Fat-Tree Routing Algorithm for Efficient Load-Balancing in Infini Band Enterprise Clusters (FZ, EGG, BB, BDJ, TS), pp. 35–42.
PPoPP-2015-ChangG #concurrent #parallel: A parallel algorithm for global states enumeration in concurrent systems (YJC, VKG), pp. 140–149.
PPoPP-2015-Gramoli #concurrent #impact analysis: More than you ever wanted to know about synchronization: synchrobench, measuring the impact of the synchronization on concurrent algorithms (VG), pp. 1–10.
PPoPP-2015-HarshvardhanAR #approach #communication #graph #parallel: A hierarchical approach to reducing communication in parallel graph algorithms (H, NMA, LR), pp. 285–286.
PPoPP-2015-TangYKTGC #parallel #programming #recursion: Cache-oblivious wavefront: improving parallelism of recursive dynamic programming algorithms without losing cache-efficiency (YT, RY, HK, JJT, PG, RAC), pp. 205–214.
ESOP-2015-SergeyNB #concurrent #specification #verification: Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity (IS, AN, AB), pp. 333–358.
STOC-2015-BhattacharyaHNT #maintenance: Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams (SB, MH, DN, CET), pp. 173–182.
STOC-2015-ChawlaMSY #clustering #graph: Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs (SC, KM, TS, GY), pp. 219–228.
STOC-2015-CousinsV: Bypassing KLS: Gaussian Cooling and an O^*(n3) Volume Algorithm (BC, SV), pp. 539–548.
STOC-2015-Gupta0: Greedy Algorithms for Steiner Forest (AG, AK), pp. 871–878.
STOC-2015-HansenZ: An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm (TDH, UZ), pp. 209–218.
STOC-2015-LackiOPSZ #distance #performance #power of: The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree (JL, JO, MP, PS, AZ), pp. 11–20.
STOC-2015-LarsenNN #adaptation #bound #streaming: Time Lower Bounds for Nonadaptive Turnstile Streaming Algorithms (KGL, JN, HLN), pp. 803–812.
STOC-2015-Louis #approximate #markov: Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms (AL), pp. 713–722.
STOC-2015-SchulmanS #analysis #matrix: Analysis of a Classical Matrix Preconditioning Algorithm (LJS, AS), pp. 831–840.
CAV-2015-ChatterjeeIP #constant #graph #performance #verification: Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs (KC, RIJ, AP), pp. 140–157.
CAV-2015-FinkbeinerRS #model checking: Algorithms for Model Checking HyperLTL and HyperCTL ^* (BF, MNR, CS), pp. 30–48.
CAV-2015-KonnovVW #abstraction #distributed #model checking #smt: SMT and POR Beat Counter Abstraction: Parameterized Model Checking of Threshold-Based Distributed Algorithms (IK, HV, JW), pp. 85–102.
ICLP-2015-Zaniolo #logic programming #source code: Expressing and Supporting Efficiently Greedy Algorithms as Locally Stratified Logic Programs (CZ), pp. 287–300.
ICST-2015-HuuhtanenIL #algebra #design #testing: Combining Algebraic and Domain Testing to Design Adequate Test Cases for Signal Processing Algorithms (TH, JI, CL), pp. 1–10.
ICTSS-2015-SultanBGDZ #clustering #search-based: Genetic Algorithm Application for Enhancing State-Sensitivity Partitioning (AMS, SB, AAAG, JD, HZ), pp. 249–256.
ISSTA-2015-TanXCSLD #optimisation: Optimizing selection of competing features via feedback-directed evolutionary algorithms (THT, YX, MC, JS, YL, JSD), pp. 246–256.
LICS-2015-ChatterjeeHL: Improved Algorithms for One-Pair and k-Pair Streett Objectives (KC, MH, VL), pp. 269–280.
SAT-2015-ChenS #satisfiability: Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP (RC, RS), pp. 33–45.
SAT-2015-GanianS #community #satisfiability: Community Structure Inspired Algorithms for SAT and #SAT (RG, SS), pp. 223–237.
DRR-2014-MaXA #machine learning #segmentation #video: A machine learning based lecture video segmentation and indexing algorithm (DM, BX, GA), p. ?–8.
SIGMOD-2014-CaiGLPVJ #comparison #implementation #machine learning #platform #scalability: A comparison of platforms for implementing and running very large scale machine learning algorithms (ZC, ZJG, SL, LLP, ZV, CMJ), pp. 1371–1382.
SIGMOD-2014-ChenLWXML #network #performance #query: Efficient algorithms for optimal location queries in road networks (ZC, YL, RCWW, JX, GM, CL), pp. 123–134.
SIGMOD-2014-DengLF #similarity #string: A pivotal prefix based filtering algorithm for string similarity search (DD, GL, JF), pp. 673–684.
SIGMOD-2014-Dev #community #detection #interactive #network #online #social: A user interaction based community detection algorithm for online social networks (HD), pp. 1607–1608.
VLDB-2014-ChiangDN #performance: Tracking Entities in the Dynamic World: A Fast Algorithm for Matching Temporal Records (YHC, AD, JFN), pp. 469–480.
VLDB-2014-GaoP #exclamation: Finish Them!: Pricing Algorithms for Human Computation (YG, AGP), pp. 1965–1976.
VLDB-2014-KorulaL #network #performance #social: An efficient reconciliation algorithm for social networks (NK, SL), pp. 377–388.
VLDB-2014-LiHMW #difference #privacy #query: A Data- and Workload-Aware Query Answering Algorithm for Range Queries Under Differential Privacy (CL, MH, GM, YW), pp. 341–352.
VLDB-2014-ParameswaranBG0PW #rating: Optimal Crowd-Powered Rating and Filtering Algorithms (AGP, SB, HGM, AG, NP, JW), pp. 685–696.
VLDB-2014-SalihogluW #graph #optimisation: Optimizing Graph Algorithms on Pregel-like Systems (SS, JW), pp. 577–588.
VLDB-2014-VesdapuntBD #crowdsourcing: Crowdsourcing Algorithms for Entity Resolution (NV, KB, NND), pp. 1071–1082.
VLDB-2014-YanCXLNB #graph #performance #problem: Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees (DY, JC, KX, YL, WN, YB), pp. 1821–1832.
VLDB-2014-YunYHVD #distributed #matrix #multi #named #probability: NOMAD: Nonlocking, stOchastic Multi-machine algorithm for Asynchronous and Decentralized matrix completion (HY, HFY, CJH, SVNV, ISD), pp. 975–986.
EDM-2014-0001RRM #automation #comparison #modelling: Comparison of Algorithms for Automatically Building Example-Tracing Tutor Models (RK0, MER, RBR, JM), pp. 217–220.
EDM-2014-ZhengP #learning #using: Dynamic Re-Composition of Learning Groups Using PSO-Based Algorithms (ZZ, NP), pp. 357–358.
ITiCSE-2014-FerreiraM #analysis #design #education #using: The magic of algorithm design and analysis: teaching algorithmic skills using magic card tricks (JFF, AM), pp. 75–80.
ITiCSE-2014-Frison #education #named #programming: AlgoTouch: a programming by demonstration tool for teaching algorithms (PF), p. 334.
ITiCSE-2014-Katai #visualisation: Selective hiding for improved algorithmic visualization (ZK), pp. 33–38.
ITiCSE-2014-Katai14c #perspective: Algorithmic thinking for ALL: a motivational perspective (ZK), p. 353.
ITiCSE-2014-MaTKMSW #named #visualisation: SHAvisual: a secure hash algorithm visualization tool (JM, JT, MSK, JM, CKS, CW), p. 338.
ITiCSE-2014-MornarGM #automation #generative #pseudo #visualisation: System for automatic generation of algorithm visualizations based on pseudocode interpretation (JM, AG, SM), pp. 27–32.
CSMR-WCRE-2014-Kamiya #execution #keyword: An algorithm for keyword search on an execution path (TK), pp. 328–332.
ICSME-2014-RomanoRP #interface #refactoring #search-based #using: Refactoring Fat Interfaces Using a Genetic Algorithm (DR, SR, MP), pp. 351–360.
MSR-2014-TulsianKKLN #model checking #named: MUX: algorithm selection for software model checkers (VT, AK, RK, AL, AVN), pp. 132–141.
SCAM-2014-AbadiF #interprocedural #on-demand #parallel: A Parallel On-Demand Algorithm for Computing Interprocedural Dominators (AA, YAF), pp. 235–244.
AFL-2014-CarayolH #automaton #model checking: Saturation algorithms for model-checking pushdown systems (AC, MH), pp. 1–24.
DLT-2014-Berlinkov #automaton #on the #problem: On Two Algorithmic Problems about Synchronizing Automata — (MVB), pp. 61–67.
DLT-2014-FeliceN #automaton #complexity #on the: On the Average Complexity of Brzozowski’s Algorithm for Deterministic Automata with a Small Number of Final States (SDF, CN), pp. 25–36.
ICALP-v1-2014-AllamigeonBG #game studies #polynomial: The Tropical Shadow-Vertex Algorithm Solves Mean Payoff Games in Polynomial Time on Average (XA, PB, SG), pp. 89–100.
ICALP-v1-2014-BasavarajuFGMRS: Parameterized Algorithms to Preserve Connectivity (MB, FVF, PAG, PM, MSR, SS), pp. 800–811.
ICALP-v1-2014-BaswanaK #graph #incremental #maintenance: Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs (SB, SK), pp. 138–149.
ICALP-v1-2014-Ben-SassonRTW #proving: Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications (EBS, NRZ, MT, JW), pp. 955–966.
ICALP-v1-2014-CaiGW #artificial reality: Holographic Algorithms Beyond Matchgates (JYC, HG, TW), pp. 271–282.
ICALP-v1-2014-ColeK #performance #summary: Fast Algorithms for Constructing Maximum Entropy Summary Trees (RC, HJK), pp. 332–343.
ICALP-v1-2014-FialaKKN #aspect-oriented #graph: Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs (JF, PK, JK, RN), pp. 489–501.
ICALP-v1-2014-HajiaghayiLP #online #problem: Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems (MH, VL, DP), pp. 576–587.
ICALP-v1-2014-KlauckP #interactive #problem #streaming: An Improved Interactive Streaming Algorithm for the Distinct Elements Problem (HK, VP), pp. 919–930.
ICALP-v1-2014-ReidlRVS #performance: A Faster Parameterized Algorithm for Treedepth (FR, PR, FSV, SS), pp. 931–942.
ICALP-v1-2014-Tzameret #problem #random #satisfiability: Sparser Random 3-SAT Refutation Algorithms and the Interpolation Problem — (IT), pp. 1015–1026.
ICALP-v2-2014-NikzadR #approximate #multi #problem: Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems (AN, RR), pp. 568–607.
LATA-2014-Gysel #problem: Minimal Triangulation Algorithms for Perfect Phylogeny Problems (RG), pp. 421–432.
FM-2014-KordyLMP #analysis #automaton #robust: A Symbolic Algorithm for the Analysis of Robust Timed Automata (PK, RL, SM, JWP), pp. 351–366.
SFM-2014-GmeinerKSVW #distributed #fault tolerance #model checking #tutorial: Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms (AG, IK, US, HV, JW), pp. 122–171.
CIG-2014-TremblayTV #approach #game studies: An algorithmic approach to analyzing combat and stealth games (JT, PAT, CV), pp. 1–8.
CIG-2014-YamamotoMCT #deduction #game studies #nearest neighbour #using: Deduction of fighting-game countermeasures using the k-nearest neighbor algorithm and a game simulator (KY, SM, CYC, RT), pp. 1–5.
CHI-2014-ShrotRGK #collaboration #named: CRISP: an interruption management algorithm based on collaborative filtering (TS, AR, JG, SK), pp. 3035–3044.
DHM-2014-Delgado-GonzaloRCSLBL #embedded #energy #modelling #state of the art: Human Energy Expenditure Models: Beyond State-of-the-Art Commercialized Embedded Algorithms (RDG, PR, EMC, JS, CL, MB, ML), pp. 3–14.
HIMI-DE-2014-Rodriguez #image #matlab #predict: Prediction or Guess? Decide by Looking at Two Images Generated by a “MATLAB MySQL” Algorithm (CR0), pp. 87–97.
LCT-NLE-2014-WachtlerE #profiling: Attention Profiling Algorithm for Video-Based Lectures (JW, ME), pp. 358–367.
ICEIS-v1-2014-FaheemK #architecture #case study #framework #multi #problem: A Multiagent-based Framework for Solving Computationally Intensive Problems on Heterogeneous Architectures — Bioinformatics Algorithms as a Case Study (HMF, BKR), pp. 526–533.
ICEIS-v1-2014-HaddadCSM #heuristic #named #parallel #problem #scheduling: AIV: A Heuristic Algorithm based on Iterated Local Search and Variable Neighborhood Descent for Solving the Unrelated Parallel Machine Scheduling Problem with Setup Times (MNH, LPC, MJFS, NM), pp. 376–383.
ICEIS-v1-2014-Malgorzata #mobile #search-based #using: The Use of Genetic Algorithms in Mobile Applications (MPW), pp. 520–525.
ICEIS-v1-2014-NoelMC #problem #scheduling: Evolutionary Algorithms Applied to Agribusiness Scheduling Problem (AN, JMJ, AAC), pp. 489–496.
ICEIS-v1-2014-PenaAMFF #gpu #parallel #using: An Improved Parallel Algorithm Using GPU for Siting Observers on Terrain (GCP, MVAA, SVGM, WRF, CRF), pp. 367–375.
ICEIS-v1-2014-PinheiroCML #graph: An Evolutionary Algorithm for Graph Planarisation by Vertex Deletion (RLP, AAC, CFXdM, DLS), pp. 464–471.
ICEIS-v1-2014-SilvaNMFMM #detection #distributed #performance #pipes and filters #using: Efficient and Distributed DBScan Algorithm Using MapReduce to Detect Density Areas on Traffic Data (TLCdS, ACAN, RPM, VAEdF, JAFdM, JCM), pp. 52–59.
ECIR-2014-LuoGWL #classification #named #network #novel: HetPathMine: A Novel Transductive Classification Algorithm on Heterogeneous Information Networks (CL, RG, ZW, CL), pp. 210–221.
ICML-c1-2014-CombesP #bound: Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms (RC, AP), pp. 521–529.
ICML-c1-2014-LiuYF #constraints: Forward-Backward Greedy Algorithms for General Convex Smooth Functions over A Cardinality Constraint (JL, JY, RF), pp. 503–511.
ICML-c1-2014-MaMY #statistics: A Statistical Perspective on Algorithmic Leveraging (PM, MWM, BY), pp. 91–99.
ICML-c1-2014-MohriM #learning #optimisation: Learning Theory and Algorithms for revenue optimization in second price auctions with reserve (MM, AMM), pp. 262–270.
ICML-c1-2014-RajkumarA #convergence #rank #statistics: A Statistical Convergence Perspective of Algorithms for Rank Aggregation from Pairwise Data (AR, SA), pp. 118–126.
ICML-c1-2014-SilverLHDWR #policy: Deterministic Policy Gradient Algorithms (DS, GL, NH, TD, DW, MAR), pp. 387–395.
ICML-c1-2014-SomaKIK #performance: Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm (TS, NK, KI, KiK), pp. 351–359.
ICML-c1-2014-Thomas #bias: Bias in Natural Actor-Critic Algorithms (PT), pp. 441–448.
ICML-c2-2014-0005YJ #performance #robust: Efficient Algorithms for Robust One-bit Compressive Sensing (LZ, JY, RJ), pp. 820–828.
ICML-c2-2014-AgarwalHKLLS #performance: Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits (AA, DH, SK, JL, LL, RES), pp. 1638–1646.
ICML-c2-2014-AwasthiBV #clustering #interactive: Local algorithms for interactive clustering (PA, MFB, KV), pp. 550–558.
ICML-c2-2014-DaneshmandGSS #complexity #network: Estimating Diffusion Network Structures: Recovery Conditions, Sample Complexity & Soft-thresholding Algorithm (HD, MGR, LS, BS), pp. 793–801.
ICML-c2-2014-GleichM #approximate #case study: Anti-differentiating approximation algorithms: A case study with min-cuts, spectral, and flow (DG, MWM), pp. 1018–1025.
ICML-c2-2014-HaeffeleYV #image #matrix #rank: Structured Low-Rank Matrix Factorization: Optimality, Algorithm, and Applications to Image Processing (BDH, EY, RV), pp. 2007–2015.
ICML-c2-2014-Kontorovich #bound #metric: Concentration in unbounded metric spaces and algorithmic stability (AK), pp. 28–36.
ICML-c2-2014-LiuWRBS #coordination #parallel #probability: An Asynchronous Parallel Stochastic Coordinate Descent Algorithm (JL, SW, CR, VB, SS), pp. 469–477.
ICML-c2-2014-MaryPN #evaluation: Improving offline evaluation of contextual bandit algorithms via bootstrapping techniques (JM, PP, ON), pp. 172–180.
ICML-c2-2014-SchwingHPU #convergence #parallel #using: Globally Convergent Parallel MAP LP Relaxation Solver using the Frank-Wolfe Algorithm (AGS, TH, MP, RU), pp. 487–495.
ICML-c2-2014-SeldinS #probability: One Practical Algorithm for Both Stochastic and Adversarial Bandits (YS, AS), pp. 1287–1295.
ICML-c2-2014-SteinhardtL14a #adaptation: Adaptivity and Optimism: An Improved Exponentiated Gradient Algorithm (JS, PL), pp. 1593–1601.
ICML-c2-2014-SuzumuraOST #robust: Outlier Path: A Homotopy Algorithm for Robust SVM (SS, KO, MS, IT), pp. 1098–1106.
ICML-c2-2014-WangLYFWY #modelling #parallel #scalability: A Highly Scalable Parallel Algorithm for Isotropic Total Variation Models (JW, QL, SY, WF, PW, JY), pp. 235–243.
ICML-c2-2014-Yi0WJJ #clustering: A Single-Pass Algorithm for Efficiently Recovering Sparse Cluster Centers of High-dimensional Data (JY, LZ, JW, RJ, AKJ), pp. 658–666.
ICML-c2-2014-YuKC: Saddle Points and Accelerated Perceptron Algorithms (AWY, FKK, JGC), pp. 1827–1835.
ICPR-2014-AggarwalM #metric #multi #random: Extension of Sparse Randomized Kaczmarz Algorithm for Multiple Measurement Vectors (HKA, AM), pp. 1014–1019.
ICPR-2014-AkhtarSM #approximate #named: SUnGP: A Greedy Sparse Approximation Algorithm for Hyperspectral Unmixing (NA, FS, ASM), pp. 3726–3731.
ICPR-2014-AokiFKM #architecture #visual notation: KIZUKI Processing for Visual Inspection: A Smart Pattern Pop-Out Algorithm Based on Human Visual Architecture (KA, TF, HK, YM), pp. 2317–2322.
ICPR-2014-BlomerBK #comparison: A Theoretical and Experimental Comparison of the EM and SEM Algorithm (JB, KB, DK), pp. 1419–1424.
ICPR-2014-BruneauPO #automation #clustering #heuristic: A Heuristic for the Automatic Parametrization of the Spectral Clustering Algorithm (PB, OP, BO), pp. 1313–1318.
ICPR-2014-ChenPH: O(1) Algorithms for Overlapping Group Sparsity (CC, ZP, JH), pp. 1645–1650.
ICPR-2014-GhoraiC #composition #higher-order #image #using: An Image Inpainting Algorithm Using Higher Order Singular Value Decomposition (MG, BC), pp. 2867–2872.
ICPR-2014-KasturiGRPKHRZSAPAKCKEVPI #evaluation #performance #recognition: Performance Evaluation of Neuromorphic-Vision Object Recognition Algorithms (RK, DBG, ER, GAP, EK, DH, YR, QZ, RS, MA, MP, MA, DK, YC, KK, LE, RCV, DFP, LI), pp. 2401–2406.
ICPR-2014-MicoO #performance: Dynamic Insertions in TLAESA Fast NN Search Algorithm (LM, JO), pp. 3828–3833.
ICPR-2014-NeubertP #segmentation #trade-off: Compact Watershed and Preemptive SLIC: On Improving Trade-offs of Superpixel Segmentation Algorithms (PN, PP), pp. 996–1001.
ICPR-2014-OtteSZ #named #using: ANTSAC: A Generic RANSAC Variant Using Principles of Ant Colony Algorithms (SO, US, AZ), pp. 3558–3563.
ICPR-2014-PedersenNM #adaptation #estimation: Adaptive Non-local Means for Cost Aggregation in a Local Disparity Estimation Algorithm (CP, KN, TBM), pp. 2442–2447.
ICPR-2014-PuZ #segmentation #video: Sandwich Cut: An Algorithm for Temporally-Coherent Video Bilayer Segmentation (SP, HZ), pp. 1061–1066.
ICPR-2014-SetitraL #overview #perspective: Background Subtraction Algorithms with Post-processing: A Review (IS, SL), pp. 2436–2441.
ICPR-2014-YuanT #classification #image #multi: Multi-scale Tensor l1-Based Algorithm for Hyperspectral Image Classification (HY, YYT), pp. 1383–1388.
ICPR-2014-ZhaoF #re-engineering #reduction: A Dictionary-Based Algorithm for Dimensionality Reduction and Data Reconstruction (ZZ, GF), pp. 1556–1561.
KDD-2014-FangP #linear #performance: Fast DTT: a near linear algorithm for decomposing a tensor into factor tensors (XF, RP), pp. 967–976.
KDD-2014-LiuWY #performance: An efficient algorithm for weak hierarchical lasso (YL, JW, JY), pp. 283–292.
KDD-2014-PapalexakisFSTMF #challenge #multi: Good-enough brain model: challenges, algorithms and discoveries in multi-subject experiments (EEP, AF, NDS, PPT, TMM, CF), pp. 95–104.
KDD-2014-ParkG #health #named #rank #re-engineering: LUDIA: an aggregate-constrained low-rank reconstruction algorithm to leverage publicly released health data (YP, JG), pp. 55–64.
KDD-2014-Rudin #machine learning: Algorithms for interpretable machine learning (CR), p. 1519.
KDD-2014-Yoshida #adaptation #linear #sketching #using: Almost linear-time algorithms for adaptive betweenness centrality using hypergraph sketches (YY), pp. 1416–1425.
KDD-2014-ZoeterDCA #deployment: New algorithms for parking demand management and a city-scale deployment (OZ, CRD, SC, JMA), pp. 1819–1828.
KDIR-2014-AlHuwaishelAB #case study #database: Finding the Frequent Pattern in a Database — A Study on the Apriori Algorithm (NA, MA, GB), pp. 388–396.
KDIR-2014-FahedBB #mining #predict: Episode Rules Mining Algorithm for Distant Event Prediction (LF, AB, AB), pp. 5–13.
KMIS-2014-FredjLC #guidelines: Characterizing Generalization Algorithms — First Guidelines for Data Publishers (FBF, NL, ICW), pp. 360–366.
MLDM-2014-MountassirBB #classification #documentation #representation: The Nearest Centroid Based on Vector Norms: A New Classification Algorithm for a New Document Representation Model (AM, HB, IB), pp. 442–456.
RecSys-2014-EkstrandHWK #difference #recommendation: User perception of differences in recommender algorithms (MDE, FMH, MCW, JAK), pp. 161–168.
RecSys-2014-GueyeAN #recommendation: A parameter-free algorithm for an optimized tag recommendation list size (MG, TA, HN), pp. 233–240.
RecSys-2014-Zheng #recommendation #similarity: Deviation-based and similarity-based contextual SLIM recommendation algorithms (YZ), pp. 437–440.
RecSys-2014-ZhengMB #named #recommendation: CSLIM: contextual SLIM recommendation algorithms (YZ, BM, RDB), pp. 301–304.
SEKE-2014-ParkSHSHB #resource management #search-based #using: Practical Human Resource Allocation in Software Projects Using Genetic Algorithm (JP, DS, GH, DS, JH, DHB), pp. 688–694.
SIGIR-2014-ZhangTZX #recommendation: Addressing cold start in recommender systems: a semi-supervised co-training algorithm (MZ, JT, XZ, XX), pp. 73–82.
OOPSLA-2014-DrechslerSMM #distributed #programming: Distributed REScala: an update algorithm for distributed reactive programming (JD, GS, RM, MM), pp. 361–376.
OOPSLA-2014-VoraKG #consistency #named #parallel #using: ASPIRE: exploiting asynchronous parallelism in iterative algorithms using a relaxed consistency based DSM (KV, SCK, RG), pp. 861–878.
SAC-2014-AlexandreMP #multi #on the: On the support of task-parallel algorithmic skeletons for multi-GPU computing (FA, RM, HP), pp. 880–885.
SAC-2014-ChenLFCCK #design #detection #effectiveness #health #implementation #monitoring: Design and implementation of a personal health monitoring system with an effective SVM-based PVC detection algorithm in cardiology (HC, GTL, YCF, BCC, CMC, TCK), pp. 33–35.
SAC-2014-EliasMFB #analysis #memory management: Experimental and theoretical analyses of memory allocation algorithms (DE, RM, MF, LBdA), pp. 1545–1546.
SAC-2014-EvermannA #big data #implementation #mining #process: Big data meets process mining: implementing the alpha algorithm with map-reduce (JE, GA), pp. 1414–1416.
SAC-2014-GeorgiadisP #online #problem #scheduling #smarttech: Dealing with storage without forecasts in smart grids: problem transformation and online scheduling algorithm (GG, MP), pp. 518–524.
SAC-2014-JungKYM #search-based: Investigation of hungarian mating schemes for genetic algorithms (CJ, YHK, YY, BRM), pp. 140–147.
SAC-2014-LiuMHHSC #hybrid #recommendation #twitter: A hybrid algorithm for recommendation twitter peers (JNKL, ZM, YXH, YLH, SCKS, VWSC), pp. 644–649.
SAC-2014-LoCCSL #locality: ICAP, a new flash wear-leveling algorithm inspired by locality (SWL, BHC, YWC, TCS, YCL), pp. 1478–1483.
SAC-2014-LopezTCC #automation #design: Design of an automatic demand-side management system based on evolutionary algorithms (EGL, AT, SC, VC), pp. 525–530.
SAC-2014-MotaB #anti #internet: A dynamic frame slotted ALOHA anti-collision algorithm for the internet of things (RPBM, DMB), pp. 686–691.
SAC-2014-NabeezathP #detection #performance: Global value numbering for redundancy detection: a simple and efficient algorithm (SN, VP), pp. 1609–1611.
SAC-2014-RanaKS #evaluation #ranking #social: The strength of social strength: an evaluation study of algorithmic versus user-defined ranking (JR, JK, KS), pp. 658–659.
SAC-2014-RossiLR #classification #network #using: A parameter-free label propagation algorithm using bipartite heterogeneous networks for text classification (RGR, AAL, SOR), pp. 79–84.
SAC-2014-TarauB: Arithmetic algorithms for hereditarily binary natural numbers (PT, BPB), pp. 1593–1600.
SAC-2014-YangZL #debugging #developer #effectiveness #multi #recommendation: Utilizing a multi-developer network-based developer recommendation algorithm to fix bugs effectively (GY, TZ, BL), pp. 1134–1139.
CASE-2014-DengWW #distributed #problem #scheduling: A competitive memetic algorithm for the distributed flow shop scheduling problem (JD, LW, SW), pp. 107–112.
CASE-2014-KanagarajPL #optimisation #process: Application of a hybridized cuckoo search-genetic algorithm to path optimization for PCB holes drilling process (GK, SGP, WCEL), pp. 373–378.
CASE-2014-MaTLZLD #hybrid #optimisation #scheduling: A hybrid particle swarm optimization and simulated annealing algorithm for job-shop scheduling (PCM, FT, YL, LZ, HXL, ZD), pp. 125–130.
CASE-2014-TanakaT #bound #performance #problem: A faster branch-and-bound algorithm for the block relocation problem (ST, KT), pp. 7–12.
CASE-2014-WangCG #constraints #estimation #hybrid #multi #problem #scheduling: Hybrid estimation of distribution algorithm with multiple subpopulations for semiconductor manufacturing scheduling problem with limited waiting-time constraint (HKW, CFC, MG), pp. 101–106.
CASE-2014-WangW #estimation #problem #scheduling #testing: Compact estimation of distribution algorithm for semiconductor final testing scheduling problem (SW, LW), pp. 113–118.
CGO-2014-SureshS #automation #detection #fault #grid #problem: Automated Algorithmic Error Resilience for Structured Grid Problems Based on Outlier Detection (AS, JS), p. 240.
DAC-2014-AlbalawiLL #classification #design #fixpoint #implementation #machine learning #power management: Computer-Aided Design of Machine Learning Algorithm: Training Fixed-Point Classifier for On-Chip Low-Power Implementation (HA, YL, XL), p. 6.
DAC-2014-AmaruGM #graph #logic #novel #optimisation #performance: Majority-Inverter Graph: A Novel Data-Structure and Algorithms for Efficient Logic Optimization (LGA, PEG, GDM), p. 6.
DAC-2014-DongZC #online #performance #reduction: A Cost Efficient Online Algorithm for Automotive Idling Reduction (CD, HZ, MC), p. 6.
DAC-2014-ElbayoumiCKSHE #named #parallel #synthesis: TACUE: A Timing-Aware Cuts Enumeration Algorithm for Parallel Synthesis (ME, MC, VNK, AS, MSH, MYE), p. 6.
DAC-2014-LinLCLH #performance: An Efficient Bi-criteria Flow Channel Routing Algorithm For Flow-based Microfluidic Biochips (CXL, CHL, ICC, DTL, TYH), p. 6.
DAC-2014-LinRGDS #performance: An Efficient Wire Routing and Wire Sizing Algorithm for Weight Minimization of Automotive Systems (CWL, LR, PG, JD, ALSV), p. 6.
DAC-2014-ShanSFZTXYL #analysis #configuration management #encryption #multi: A Side-channel Analysis Resistant Reconfigurable Cryptographic Coprocessor Supporting Multiple Block Cipher Algorithms (WS, LS, XF, XZ, CT, ZX, JY, JL), p. 6.
DAC-2014-XiaCK #automation #detection #development: An Automobile Detection Algorithm Development for Automated Emergency Braking System (LX, TDC, KAAK), p. 6.
DATE-2014-AguileraLFMSK #clustering #multi #process: Process variation-aware workload partitioning algorithms for GPUs supporting spatial-multitasking (PA, JL, AFF, KM, MJS, NSK), pp. 1–6.
DATE-2014-Matsunaga #generative #parallel #synthesis: Synthesis algorithm of parallel index generation units (YM), pp. 1–6.
DATE-2014-Maurer #detection #symmetry: A universal symmetry detection algorithm (PMM), pp. 1–4.
HPCA-2014-LakshminarayanaK #graph: Spare register aware prefetching for graph algorithms on GPUs (NBL, HK), pp. 614–625.
PDP-2014-FabbroTP #parallel #problem: A Parallel Algorithm for the Best k-Mismatches Alignment Problem (CDF, FT, AP), pp. 586–589.
PDP-2014-Fernandez-CampusanoCL #performance: A Performance Study of Consensus Algorithms in Omission and Crash-Recovery Scenarios (CFC, RC, ML), pp. 240–243.
PDP-2014-GaliziaDRC #case study #fourier: Compute Intensive Algorithm on Heterogeneous System: A Case Study about Fourier Transform (AG, ED, GR, AC), pp. 223–227.
PDP-2014-IshigamiKN #gpu #implementation: GPU Implementation of Inverse Iteration Algorithm for Computing Eigenvectors (HI, KK, YN), pp. 664–671.
PDP-2014-Kwedlo #modelling #parallel #using: A Parallel EM Algorithm for Gaussian Mixture Models Implemented on a NUMA System Using OpenMP (WK), pp. 292–298.
PDP-2014-LakhlefMB #configuration management #parallel #performance #self: Efficient Parallel Self-Reconfiguration Algorithm for MEMS Microrobots (HL, HM, JB), pp. 154–161.
PDP-2014-WangXMPW: Selective Extension of Routing Algorithms Based on Turn Model (YW, LX, SM, ZP, KW), pp. 174–177.
PPoPP-2014-MaAC #analysis #manycore #thread: Theoretical analysis of classic algorithms on highly-threaded many-core GPUs (LM, KA, RDC), pp. 391–392.
PPoPP-2014-RodriguesJDH #clustering #interface #named #programming: Triolet: a programming system that unifies algorithmic skeleton interfaces for high-performance cluster computing (CIR, TBJ, AD, WmWH), pp. 247–258.
PPoPP-2014-TomkinsSAR #component #named #parallel: SCCMulti: an improved parallel strongly connected components algorithm (DT, TGS, NMA, LR), pp. 393–394.
FASE-2014-MoreauHM #api #design #online #testing #validation: An Online Validator for Provenance: Algorithmic Design, Testing, and API (LM, TDH, DTM), pp. 291–305.
STOC-2014-AgarwalS #approximate #geometry #metric: Approximation algorithms for bipartite matching with metric and geometric costs (PKA, RS), pp. 555–564.
STOC-2014-AlistarhCS #concurrent #question: Are lock-free concurrent algorithms practically wait-free? (DA, KCH, NS), pp. 714–723.
STOC-2014-AndoniNOY #geometry #graph #parallel #problem: Parallel algorithms for geometric graph problems (AA, AN, KO, GY), pp. 574–583.
STOC-2014-EisentragerHK0 #quantum: A quantum algorithm for computing the unit group of an arbitrary degree number field (KE, SH, AK, FS), pp. 293–302.
STOC-2014-EneV #approximate #bound #design #network #problem #requirements: Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements (AE, AV), pp. 754–763.
STOC-2014-FriggstadS #approximate #bound: Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing (ZF, CS), pp. 744–753.
STOC-2014-GargMV #equilibrium: Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions (JG, RM, VVV), pp. 525–534.
STOC-2014-GoldreichW #on the: On derandomizing algorithms that err extremely rarely (OG, AW), pp. 109–118.
STOC-2014-Goodrich #sorting: Zig-zag sort: a simple deterministic data-oblivious sorting algorithm running in O(n log n) time (MTG), pp. 684–693.
STOC-2014-HenzingerKN #graph #reachability: Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs (MH, SK, DN), pp. 674–683.
STOC-2014-ImKM #constraints #scheduling: Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints (SI, JK, KM), pp. 313–322.
STOC-2014-LiNW #linear #sketching #streaming: Turnstile streaming algorithms might as well be linear sketches (YL, HLN, DPW), pp. 174–183.
STOC-2014-Nanongkai #approximate #distributed: Distributed approximation algorithms for weighted shortest paths (DN), pp. 565–573.
STOC-2014-Vegh #polynomial: A strongly polynomial algorithm for generalized flow maximization (LAV), pp. 644–653.
STOC-2014-Williams #bound #linear: New algorithms and lower bounds for circuits with linear threshold gates (RW), pp. 194–202.
TACAS-2014-BoenderC #branch #correctness #on the: On the Correctness of a Branch Displacement Algorithm (JB, CSC), pp. 605–619.
TACAS-2014-Cheval #equivalence #named #proving: APTE: An Algorithm for Proving Trace Equivalence (VC), pp. 587–592.
TACAS-2014-Lowe #concurrent: Concurrent Depth-First Search Algorithms (GL), pp. 202–216.
ICLP-J-2014-HoosLS #programming #set: claspfolio 2: Advances in Algorithm Selection for Answer Set Programming (HH, MTL, TS), pp. 569–585.
ICTSS-2014-AliY #constraints #normalisation #ocl: Evaluating Normalization Functions with Search Algorithms for Solving OCL Constraints (SA, TY), pp. 17–31.
IJCAR-2014-SteigmillerGL #logic: Coupling Tableau Algorithms for Expressive Description Logics with Completion-Based Saturation Procedures (AS, BG, TL), pp. 449–463.
SAT-2014-BacchusN #analysis #satisfiability: Cores in Core Based MaxSat Algorithms: An Analysis (FB, NN), pp. 7–15.
SMT-2014-Melquiond #automation #float #verification: Automating the Verification of Floating-Point Algorithms (GM), p. 63.
VMCAI-2014-DragoiHVWZ #framework #verification: A Logic-Based Framework for Verifying Consensus Algorithms (CD, TAH, HV, JW, DZ), pp. 161–181.
VMCAI-2014-JezequelE #distributed #message passing #protocol #verification: Message-Passing Algorithms for the Verification of Distributed Protocols (LJ, JE), pp. 222–241.
DocEng-2013-NevesZM #adaptation #detection #documentation #image: An adaptive thresholding algorithm based on edge detection and morphological operations for document images (RFdPN, CZ, CABM), pp. 107–110.
DRR-2013-AriesON #automation #classification #clustering #summary #using: Using clustering and a modified classification algorithm for automatic text summarization (AA, HO, ON).
DRR-2013-Obafemi-AjayiA #documentation #evaluation #image: Goal-oriented evaluation of binarization algorithms for historical document images (TOA, GA).
HT-2013-JarukasemratanaML #community #detection #distance #network: Community detection algorithm based on centrality and node distance in scale-free networks (SJ, TM, XL), pp. 258–262.
ICDAR-2013-FernandezT #detection: Handwritten Line Detection via an EM Algorithm (FCF, ORT), pp. 718–722.
ICDAR-2013-KobayashiIMK #recognition: An Anytime Algorithm for Camera-Based Character Recognition (TK, MI, TM, KK), pp. 1140–1144.
ICDAR-2013-MoyssetK #detection #evaluation #on the: On the Evaluation of Handwritten Text Line Detection Algorithms (BM, CK), pp. 185–189.
ICDAR-2013-OliveiraLTFT #documentation #image #performance: An Efficient Algorithm for Segmenting Warped Text-Lines in Document Images (DMO, RDL, GT, JF, MT), pp. 250–254.
SIGMOD-2013-GeorgiadisKGPTM #data type #detection #framework #state of the art: Continuous outlier detection in data streams: an extensible framework and state-of-the-art algorithms (DG, MK, AG, ANP, KT, YM), pp. 1061–1064.
SIGMOD-2013-KimS #approximate #performance #string: Efficient top-k algorithms for approximate substring matching (YK, KS), pp. 385–396.
SIGMOD-2013-KlonatosNSKK #automation #synthesis: Automatic synthesis of out-of-core algorithms (YK, AN, AS, CK, VK), pp. 133–144.
SIGMOD-2013-OrdonezGGCBQ #as a service #data mining #database #in the cloud #mining #relational: Data mining algorithms as a service in the cloud exploiting relational database systems (CO, JGG, CGA, WC, VB, MSQ), pp. 1001–1004.
SIGMOD-2013-TaoLX #pipes and filters: Minimal MapReduce algorithms (YT, WL, XX), pp. 529–540.
SIGMOD-2013-VlachouDNK #bound #query: Branch-and-bound algorithm for reverse top-k queries (AV, CD, KN, YK), pp. 481–492.
SIGMOD-2013-ZhangXYZW #named #search-based #using: PrivGene: differentially private model fitting using genetic algorithms (JZ, XX, YY, ZZ, MW), pp. 665–676.
VLDB-2013-DayanSBBB #design #named: EagleTree: Exploring the Design Space of SSD-Based Algorithms (ND, MKS, MB, PB, LB), pp. 1290–1293.
VLDB-2013-DrosouP #modelling #named: POIKILO: A Tool for Evaluating the Results of Diversification Models and Algorithms (MD, EP), pp. 1246–1249.
VLDB-2013-ManshadiAGKMS #distributed #scalability: A Distributed Algorithm for Large-Scale Generalized Matching (FMM, BA, RG, RK, JM, MS), pp. 613–624.
VLDB-2013-SariyuceGJWC #composition #streaming: Streaming Algorithms for k-core Decomposition (AES, BG, GJS, KLW, ÜVÇ), pp. 433–444.
VLDB-2013-SimoesGG #approximate #information management #performance #using: When Speed Has a Price: Fast Information Extraction Using Approximate Algorithms (GS, HG, LG), pp. 1462–1473.
ITiCSE-2013-FeasterAZH #education #network #protocol: Serious toys II: teaching networks, protocols, and algorithms (YF, FA, JZ, JOH), pp. 273–278.
ITiCSE-2013-KaravirtaS #javascript #library #named #visualisation: JSAV: the JavaScript algorithm visualization library (VK, CAS), pp. 159–164.
ITiCSE-2013-Trakhtenbrot #analysis #complexity #concept #problem #student: Students misconceptions in analysis of algorithmic and computational complexity of problems (MT), pp. 353–354.
CSMR-2013-XiaLWYLS #case study #comparative #debugging #learning #predict: A Comparative Study of Supervised Learning Algorithms for Re-opened Bug Prediction (XX, DL, XW, XY, SL, JS), pp. 331–334.
ICPC-2013-MahmoudN #clustering #comprehension: Evaluating software clustering algorithms in the context of program comprehension (AM, NN), pp. 162–171.
ICSM-2013-OsmanCP #analysis #diagrams #machine learning: An Analysis of Machine Learning Algorithms for Condensing Reverse Engineered Class Diagrams (MHO, MRVC, PvdP), pp. 140–149.
SCAM-2013-MarcozziVH #constraints #database #execution #relational #source code #symbolic computation #testing: A relational symbolic execution algorithm for constraint-based testing of database programs (MM, WV, JLH), pp. 179–188.
CIAA-2013-GenetGLM #automaton: A Completion Algorithm for Lattice Tree Automata (TG, TLG, AL, VM), pp. 134–145.
CIAA-2013-HolzerJ #robust: Brzozowski’s Minimization Algorithm — More Robust than Expected — (MH, SJ), pp. 181–192.
DLT-2013-FeliceN #automaton: Brzozowski Algorithm Is Generically Super-Polynomial for Deterministic Automata (SDF, CN), pp. 179–190.
ICALP-v1-2013-0002LPRRSS #kernel #linear: Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions (EJK, AL, CP, FR, PR, IS, SS), pp. 613–624.
ICALP-v1-2013-AustrinKKM #set #trade-off: Space-Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm (PA, PK, MK, JM), pp. 45–56.
ICALP-v1-2013-BabenkoGGN #optimisation: Algorithms for Hub Label Optimization (MAB, AVG, AG, VN), pp. 69–80.
ICALP-v1-2013-BateniHL #approximate #problem: Improved Approximation Algorithms for (Budgeted) Node-Weighted Steiner Problems (MB, MH, VL), pp. 81–92.
ICALP-v1-2013-BienkowskiBCDNSSY #approximate #problem: Approximation Algorithms for the Joint Replenishment Problem with Deadlines (MB, JB, MC, NBD, TN, MS, GS, NEY), pp. 135–147.
ICALP-v1-2013-BodlaenderCKN #exponential #problem: Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth (HLB, MC, SK, JN), pp. 196–207.
ICALP-v1-2013-BorosEGM #game studies #probability #pseudo #random: A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions (EB, KME, VG, KM), pp. 220–231.
ICALP-v1-2013-BrunschR: Finding Short Paths on Polytopes by the Shadow Vertex Algorithm (TB, HR), pp. 279–290.
ICALP-v1-2013-CyganP #bound #graph #performance: Faster Exponential-Time Algorithms in Graphs of Bounded Average Degree (MC, MP), pp. 364–375.
ICALP-v1-2013-DeDS #analysis #difference #fourier #geometry #robust: A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry (AD, ID, RAS), pp. 376–387.
ICALP-v1-2013-DuanM #combinator #linear #polynomial: A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market (RD, KM), pp. 425–436.
ICALP-v1-2013-GolovachHKV #incremental #polynomial #set: An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets (PAG, PH, DK, YV), pp. 485–496.
ICALP-v1-2013-MarxV #parametricity: Fixed-Parameter Algorithms for Minimum Cost Edge-Connectivity Augmentation (DM, LAV), pp. 721–732.
ICALP-v1-2013-MoruzN #bound #random: Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms (GM, AN), pp. 757–768.
ICALP-v2-2013-AlbersP #online #scheduling #web: New Online Algorithms for Story Scheduling in Web Advertising (SA, AP), pp. 446–458.
ICALP-v2-2013-Kleinberg #network #social: Algorithms, Networks, and Social Phenomena (JMK), pp. 1–3.
ICALP-v2-2013-PettieS #distributed #graph #performance: Fast Distributed Coloring Algorithms for Triangle-Free Graphs (SP, HHS), pp. 681–693.
LATA-2013-BenzaidDE #complexity: Duplication-Loss Genome Alignment: Complexity and Algorithm (BB, RD, NEM), pp. 116–127.
LATA-2013-Etessami #infinity #probability #recursion #verification: Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems (KE), p. 12.
LATA-2013-KociumakaRRW #linear #testing: Linear-Time Version of Holub’s Algorithm for Morphic Imprimitivity Testing (TK, JR, WR, TW), pp. 383–394.
IFM-2013-AndriamiarinaMS #distributed #modelling: Integrating Proved State-Based Models for Constructing Correct Distributed Algorithms (MBA, DM, NKS), pp. 268–284.
IFM-2013-GavaFG #deduction #verification: Deductive Verification of State-Space Algorithms (FG, JF, MG), pp. 124–138.
RTA-2013-Schmidt-SchaussRS #complexity: Algorithms for Extended α-Equivalence and Complexity (MSS, CR, DS), pp. 255–270.
TLCA-2013-FridlenderP #evaluation #normalisation #type system: A Type-Checking Algorithm for Martin-Löf Type Theory with Subtyping Based on Normalisation by Evaluation (DF, MP), pp. 140–155.
CHI-2013-BiAPZ #named #recognition: Octopus: evaluating touchscreen keyboard correction and recognition algorithms via (XB, SA, KP, SZ), pp. 543–552.
CSCW-2013-SaidFJA #collaboration #evaluation #recommendation: User-centric evaluation of a K-furthest neighbor collaborative filtering recommender algorithm (AS, BF, BJJ, SA), pp. 1399–1408.
DUXU-NTE-2013-FukumotoI #interactive #mobile #optimisation #search-based: A Proposal for Optimization Method of Vibration Pattern of Mobile Device with Interactive Genetic Algorithm (MF, TI), pp. 264–269.
HCI-III-2013-JuL: A Dense Stereo Matching Algorithm with Occlusion and Less or Similar Texture Handling (HJ, CL), pp. 171–177.
HCI-III-2013-LiLL #performance: Fast Dynamic Channel Allocation Algorithm for TD-HSPA System (HL, HLL, XL), pp. 82–91.
HCI-III-2013-WangLLD #performance #realtime #visual notation: A New Real-Time Visual SLAM Algorithm Based on the Improved FAST Features (LW, RL, CL, FD), pp. 206–215.
HCI-IMT-2013-ShimizuNS #generative #search-based #using: System of Generating Japanese Sound Symbolic Expressions Using Genetic Algorithm (YS, TN, MS), pp. 126–134.
HIMI-D-2013-MogawaSI #product line #representation #set: Generalized Algorithm for Obtaining a Family of Evaluating Attributes’ Sets Representing Customer’s Preference (TM, FS, SI), pp. 494–504.
ICEIS-v1-2013-CazzolatoRYS #classification #data type #statistics: A Statistical Decision Tree Algorithm for Data Stream Classification (MTC, MXR, CAY, MTPS), pp. 217–223.
CIKM-2013-ArifuzzamanKM #named #network #parallel: PATRIC: a parallel algorithm for counting triangles in massive networks (SA, MK, MVM), pp. 529–538.
CIKM-2013-BonomiX #difference #mining #privacy: A two-phase algorithm for mining sequential patterns with differential privacy (LB, LX), pp. 269–278.
CIKM-2013-ParkC #graph #performance #pipes and filters #scalability: An efficient MapReduce algorithm for counting triangles in a very large graph (HMP, CWC), pp. 539–548.
ICML-c1-2013-AfkanpourGSB #kernel #learning #multi #random #scalability: A Randomized Mirror Descent Algorithm for Large Scale Multiple Kernel Learning (AA, AG, CS, MB), pp. 374–382.
ICML-c1-2013-GiguereLMS #approach #bound #learning #predict: Risk Bounds and Learning Algorithms for the Regression Approach to Structured Output Prediction (SG, FL, MM, KS), pp. 107–114.
ICML-c1-2013-KumarSK #matrix #performance: Fast Conical Hull Algorithms for Near-separable Non-negative Matrix Factorization (AK, VS, PK), pp. 231–239.
ICML-c1-2013-RuvoloE #learning #named #performance: ELLA: An Efficient Lifelong Learning Algorithm (PR, EE), pp. 507–515.
ICML-c1-2013-ZhuCPZ #modelling #performance #topic: Gibbs Max-Margin Topic Models with Fast Sampling Algorithms (JZ, NC, HP, BZ), pp. 124–132.
ICML-c2-2013-AroraGHMMSWZ #modelling #topic: A Practical Algorithm for Topic Modeling with Provable Guarantees (SA, RG, YH, DMM, AM, DS, YW, MZ), pp. 280–288.
ICML-c2-2013-GongZLHY #optimisation #problem: A General Iterative Shrinkage and Thresholding Algorithm for Non-convex Regularized Optimization Problems (PG, CZ, ZL, JH, JY), pp. 37–45.
ICML-c3-2013-Agarwal #multi #predict: Selective sampling algorithms for cost-sensitive multiclass prediction (AA), pp. 1220–1228.
ICML-c3-2013-CurtinMRAGI #independence: Tree-Independent Dual-Tree Algorithms (RRC, WBM, PR, DVA, AGG, CLI), pp. 1435–1443.
ICML-c3-2013-KarS0K #learning #on the #online: On the Generalization Ability of Online Learning Algorithms for Pairwise Loss Functions (PK, BKS, PJ, HK), pp. 441–449.
ICML-c3-2013-KolmogorovT #sequence: Inference algorithms for pattern-based CRFs on sequence data (RT, VK), pp. 145–153.
ICML-c3-2013-Kuleshov #analysis #component #performance: Fast algorithms for sparse principal component analysis based on Rayleigh quotient iteration (VK), pp. 1418–1425.
ICML-c3-2013-MenonNAC #classification #consistency #on the #statistics: On the Statistical Consistency of Algorithms for Binary Classification under Class Imbalance (AKM, HN, SA, SC), pp. 603–611.
ICML-c3-2013-NguyenS #classification #optimisation: Algorithms for Direct 0-1 Loss Optimization in Binary Classification (TN, SS), pp. 1085–1093.
ICML-c3-2013-SzorenyiBHOJK #distributed #probability: Gossip-based distributed stochastic bandit algorithms (BS, RBF, IH, RO, MJ, BK), pp. 19–27.
ICML-c3-2013-WangK #energy #performance: A Fast and Exact Energy Minimization Algorithm for Cycle MRFs (HW, DK), pp. 190–198.
ICML-c3-2013-WytockK #energy #random #theory and practice: Sparse Gaussian Conditional Random Fields: Algorithms, Theory, and Application to Energy Forecasting (MW, JZK), pp. 1265–1273.
ICML-c3-2013-YangX #robust: A Unified Robust Regression Model for Lasso-like Algorithms (WY, HX), pp. 585–593.
ICML-c3-2013-ZhuLM #clustering: A Local Algorithm for Finding Well-Connected Clusters (ZAZ, SL, VSM), pp. 396–404.
KDD-2013-FriezeGT #graph #mining #modelling #scalability: Algorithmic techniques for modeling and mining large graphs (AMAzING) (AMF, AG, CET), p. 1523.
KDD-2013-GilpinED #framework #learning: Guided learning for role discovery (GLRD): framework, algorithms, and applications (SG, TER, IND), pp. 113–121.
KDD-2013-JhaSP #performance #streaming #using: A space efficient streaming algorithm for triangle counting using the birthday paradox (MJ, CS, AP), pp. 589–597.
KDD-2013-NishimuraU #clustering #graph: Restreaming graph partitioning: simple versatile algorithms for advanced balancing (JN, JU), pp. 1106–1114.
KDD-2013-ThorntonHHL #classification #named #optimisation: Auto-WEKA: combined selection and hyperparameter optimization of classification algorithms (CT, FH, HHH, KLB), pp. 847–855.
KDD-2013-YangWFZWY #multi #performance #problem: An efficient ADMM algorithm for multidimensional anisotropic total variation regularization problems (SY, JW, WF, XZ, PW, JY), pp. 641–649.
KDIR-KMIS-2013-GengUA #mining: Trajectory Pattern Mining in Practice — Algorithms for Mining Flock Patterns from Trajectories (XG, TU, HA), pp. 143–151.
KDIR-KMIS-2013-WaadBL #feature model #rank #search-based: Feature Selection by Rank Aggregation and Genetic Algorithms (BW, ABB, ML), pp. 74–81.
MLDM-2013-AllahSG #array #dataset #mining #performance #scalability: An Efficient and Scalable Algorithm for Mining Maximal — High Confidence Rules from Microarray Dataset (WZAA, YKES, FFMG), pp. 352–366.
MLDM-2013-BrownPD #search-based: Dynamic-Radius Species-Conserving Genetic Algorithm for the Financial Forecasting of Dow Jones Index Stocks (MSB, MJP, HD), pp. 27–41.
MLDM-2013-DoganBK #integration #self: SOM++: Integration of Self-Organizing Map and K-Means++ Algorithms (YD, DB, AK), pp. 246–259.
MLDM-2013-GopalakrishnaOLL #machine learning #metric: Relevance as a Metric for Evaluating Machine Learning Algorithms (AKG, TO, AL, JJL), pp. 195–208.
MLDM-2013-MartineauCF #independence #named #topic: TISA: Topic Independence Scoring Algorithm (JCM, DC, TF), pp. 555–570.
MLDM-2013-MinhAN #feature model: DCA Based Algorithms for Feature Selection in Semi-supervised Support Vector Machines (LHM, LTHA, MCN), pp. 528–542.
RecSys-2013-Ben-Shimon #recommendation: Anytime algorithms for top-N recommenders (DBS), pp. 463–466.
SEKE-2013-DengWH #combinator #identification #multi #using: Combining multiple stress identification algorithms using combinatorial fusion (YD, ZW, DFH), pp. 421–428.
ICMT-2013-VarroD #incremental #network #pattern matching: A Rete Network Construction Algorithm for Incremental Pattern Matching (GV, FD), pp. 125–140.
MoDELS-2013-ArkinTI #approach #modelling #parallel #platform: Model-Driven Approach for Supporting the Mapping of Parallel Algorithms to Parallel Computing Platforms (EA, BT, KMI), pp. 757–773.
LOPSTR-2013-AransayD #algebra #execution #formal method #linear #theorem: Formalization and Execution of Linear Algebra: From Theorems to Algorithms (JA, JD), pp. 1–18.
PLDI-2013-ZhangLYS #alias #analysis #performance: Fast algorithms for Dyck-CFL-reachability with applications to alias analysis (QZ, MRL, HY, ZS), pp. 435–446.
POPL-2013-BlellochH #functional: Cache and I/O efficent functional algorithms (GEB, RH), pp. 39–50.
ICSE-2013-BeschastnikhBAEK #declarative #specification: Unifying FSM-inference algorithms through declarative specification (IB, YB, JA, MDE, AK), pp. 252–261.
ICSE-2013-PanichellaDOPPL #approach #effectiveness #how #modelling #re-engineering #search-based #topic: How to effectively use topic models for software engineering tasks? an approach based on genetic algorithms (AP, BD, RO, MDP, DP, ADL), pp. 522–531.
SAC-2013-AkritidisB #classification #machine learning #research: A supervised machine learning classification algorithm for research articles (LA, PB), pp. 115–120.
SAC-2013-BellatrecheBCM #clustering #incremental #query: Horizontal partitioning of very-large data warehouses under dynamically-changing query workloads via incremental algorithms (LB, RB, AC, SM), pp. 208–210.
SAC-2013-BhattacharjeeJ #named #repository #scalability #similarity: CodeBlast: a two-stage algorithm for improved program similarity matching in large software repositories (AB, HMJ), pp. 846–852.
SAC-2013-FariaGC #data type #detection #multi #problem: Novelty detection algorithm for data streams multi-class problems (ERF, JG, ACPLFC), pp. 795–800.
SAC-2013-HassanzadehN #detection #graph: A semi-supervised graph-based algorithm for detecting outliers in online-social-networks (RH, RN), pp. 577–582.
SAC-2013-HuangXCL #adaptation #analysis #detection #implementation #parallel #random testing #testing: Failure-detection capability analysis of implementing parallelism in adaptive random testing algorithms (RH, XX, JC, YL), pp. 1049–1054.
SAC-2013-IlicSKJ #assessment: Impact assessment of smart meter grouping on the accuracy of forecasting algorithms (DI, PGdS, SK, MJ), pp. 673–679.
SAC-2013-JiaBJPM #multi: A multi-resource load balancing algorithm for cloud cache systems (YJ, IB, RJP, MPM, DM), pp. 463–470.
SAC-2013-KhaniHAB #clustering #semistructured data #set: An algorithm for discovering clusters of different densities or shapes in noisy data sets (FK, MJH, AAA, HB), pp. 144–149.
SAC-2013-KimM #detection #hybrid #search-based #using: Disguised malware script detection system using hybrid genetic algorithm (JK, BRM), pp. 182–187.
SAC-2013-KumarR #data type #identification #online: Online identification of frequently executed acyclic paths by leveraging data stream algorithms (GK, SR), pp. 1694–1695.
SAC-2013-LakhlefMB #configuration management #distributed #performance #self: Distributed and efficient algorithm for self-reconfiguration of MEMS microrobots (HL, HM, JB), pp. 560–566.
SAC-2013-MottaLNRJO #clustering #relational: Comparing relational and non-relational algorithms for clustering propositional data (RM, AdAL, BMN, SOR, AMJ, MCFdO), pp. 150–155.
SAC-2013-PorterA #identification: An evolutionary spline fitting algorithm for identifying filamentous cyanobacteria (JP, DVA), pp. 40–45.
SAC-2013-SinghR #architecture #optimisation #predict: Meta-learning based architectural and algorithmic optimization for achieving green-ness in predictive workload analytics (NS, SR), pp. 1169–1176.
SAC-2013-SoleC: Amending C-net discovery algorithms (MS, JC), pp. 1418–1425.
SAC-2013-ToledoAOD #hybrid #multi #problem #search-based: A hybrid compact genetic algorithm applied to the multi-level capacitated lot sizing problem (CFMT, MdSA, RRRdO, ACBD), pp. 200–205.
SAC-2013-VasquesV #distributed #grid #scheduling: A decentralized utility-based grid scheduling algorithm (JV, LV), pp. 619–624.
SAC-2013-ZhangL #debugging #developer #hybrid #recommendation: A hybrid bug triage algorithm for developer recommendation (TZ, BL), pp. 1088–1094.
CASE-2013-BengtssonL #behaviour #identification #modelling #using #visualisation: Operation behavior modeling using relation identification and visualization algorithms (KB, BL), pp. 368–373.
CASE-2013-GargPSCHAPG #3d: An algorithm for computing customized 3D printed implants with curvature constrained channels for enhancing intracavitary brachytherapy radiation delivery (AG, SP, TS, JAMC, ICH, PA, JP, KG), pp. 466–473.
CASE-2013-JiaJL #scheduling: A job-family-oriented algorithm for re-entrant batch processing machine scheduling (WJ, ZJ, YL), pp. 1022–1027.
CASE-2013-JinM #clustering #constraints #scheduling #tool support: Transient scheduling of single armed cluster tools: Algorithms for wafer residency constraints (HYJ, JRM), pp. 856–861.
CASE-2013-LiJJ #heuristic: A heuristic algorithm for minimizing total absolute deviation from distinct due dates on a single machine (YL, ZJ, WJ), pp. 392–397.
CASE-2013-PanahiASG #performance #proximity: An efficient proximity probing algorithm for metrology (FP, AA, AFvdS, KG), pp. 342–349.
CASE-2013-QiaoMG #data-driven #scheduling: Attribute selection algorithm of data-based scheduling strategy for semiconductor manufacturing (FQ, YM, XG), pp. 410–415.
CASE-2013-ZhangH #analysis #convergence #coordination #implementation #optimisation #parallel: Convergence analysis and parallel computing implementation for the multiagent coordination optimization algorithm with applications (HZ, QH), pp. 825–830.
CGO-2013-DuchateauPB #algebra #automation #equation #linear #named: Hydra: Automatic algorithm exploration from linear algebra equations (AD, DAP, DB), p. 10.
CGO-2013-YanTZYS #fine-grained #graph #named #parallel #traversal: Vlock: Lock virtualization mechanism for exploiting fine-grained parallelism in graph traversal algorithms (JY, GT, XZ, EY, NS), p. 10.
DAC-2013-DoustiP #estimation #latency #named #quantum: LEQA: latency estimation for a quantum algorithm mapped to a quantum circuit fabric (MJD, MP), p. 7.
DAC-2013-KimJK #problem: An optimal algorithm of adjustable delay buffer insertion for solving clock skew variation problem (JK, DJ, TK), p. 6.
DAC-2013-NacciRBSBA #implementation #synthesis: A high-level synthesis flow for the implementation of iterative stencil loop algorithms on FPGA devices (AAN, VR, FB, DS, IB, DA), p. 6.
DAC-2013-QuanP #runtime: A scenario-based run-time task mapping algorithm for MPSoCs (WQ, ADP), p. 6.
DAC-2013-RaiSST #analysis #distributed #network #process: Distributed stable states for process networks: algorithm, analysis, and experiments on intel SCC (DR, LS, NS, LT), p. 10.
DAC-2013-ShahzadKRPC #encryption #named: CoARX: a coprocessor for ARX-based cryptographic algorithms (KS, AK, ZER, GP, AC), p. 10.
DAC-2013-WuWLH #generative #model checking #satisfiability: A counterexample-guided interpolant generation algorithm for SAT-based model checking (CYW, CAW, CYL, CY(H), p. 6.
DATE-2013-AhmadyanKV #incremental #runtime #using #verification: Runtime verification of nonlinear analog circuits using incremental time-augmented RRT algorithm (SNA, JAK, SV), pp. 21–26.
DATE-2013-EbrahimiDP #3d #fault tolerance #using: Fault-tolerant routing algorithm for 3D NoC using Hamiltonian path strategy (ME, MD, JP), pp. 1601–1604.
DATE-2013-LiuLC: A network-flow based algorithm for power density mitigation at post-placement stage (SYSL, RGL, HMC), pp. 1707–1710.
DATE-2013-SuZ #scheduling: An elastic mixed-criticality task model and its scheduling algorithm (HS, DZ), pp. 147–152.
DATE-2013-WangTSL: A power-driven thermal sensor placement algorithm for dynamic thermal management (HW, SXDT, SS, XL), pp. 1215–1220.
DATE-2013-ZhaiYZ #float #random: GPU-friendly floating random walk algorithm for capacitance extraction of VLSI interconnects (KZ, WY, HZ), pp. 1661–1666.
LCTES-2013-JangKL #parallel: Practical speculative parallelization of variable-length decompression algorithms (HJ, CK, JWL), pp. 55–64.
PDP-2013-AtaeeGP #multi #named #reliability #replication #scalability #streaming: ReStream — A Replication Algorithm for Reliable and Scalable Multimedia Streaming (SA, BG, FP), pp. 68–76.
PDP-2013-BukataS #design #gpu #problem #scheduling: A GPU Algorithm Design for Resource Constrained Project Scheduling Problem (LB, PS), pp. 367–374.
PDP-2013-CostaIMF #deployment: Service Deployment Algorithms for Vertical Search Engines (VGC, AIP, MM, EF), pp. 140–147.
PDP-2013-EbrahimiCDPLT #3d #adaptation #named: DyXYZ: Fully Adaptive Routing Algorithm for 3D NoCs (ME, XC, MD, JP, PL, HT), pp. 499–503.
PDP-2013-EbrahimiDP #fault tolerance #manycore #performance: High Performance Fault-Tolerant Routing Algorithm for NoC-Based Many-Core Systems (ME, MD, JP), pp. 462–469.
PDP-2013-EskandariKBJ #constraints #optimisation #quality #using: Quality of Service Optimization for Network-on-Chip Using Bandwidth-Constraint Mapping Algorithm (AE, AK, NB, MJ), pp. 504–508.
PDP-2013-GeleriTT #detection: Parallelizing Broad Phase Collision Detection Algorithms for Sampling Based Path Planners (FG, OT, HT), pp. 384–391.
PDP-2013-GoliG #architecture #coordination #hybrid #performance: Heterogeneous Algorithmic Skeletons for Fast Flow with Seamless Coordination over Hybrid Architectures (MG, HGV), pp. 148–156.
PDP-2013-Gomez-CalzadoLALC #evaluation #performance: An Evaluation of Efficient Leader Election Algorithms for Crash-Recovery Systems (CGC, ML, ISA, AL, RC), pp. 180–188.
PDP-2013-SmykT #execution #framework #monitoring #search-based: Genetic Algorithms Hierarchical Execution Control under a Global Application State Monitoring Infrastructure (AS, MT), pp. 16–23.
PPoPP-2013-Chen #detection #fault #fault tolerance #named #online: Online-ABFT: an online algorithm based fault tolerance scheme for soft error detection in iterative methods (ZC), pp. 167–176.
PPoPP-2013-DiamosWWLY #multi #relational: Relational algorithms for multi-bulk-synchronous processors (GFD, HW, JW, AL, SY), pp. 301–302.
PPoPP-2013-DiceLLLM #hardware #memory management #transaction #using: Using hardware transactional memory to correct and simplify and readers-writer lock algorithm (DD, YL, YL, VL, MM), pp. 261–270.
PPoPP-2013-EdmondsWL #graph #using: Expressing graph algorithms using generalized active messages (NE, JW, AL), pp. 289–290.
PPoPP-2013-NasreBP: Morph algorithms on GPUs (RN, MB, KP), pp. 147–156.
PPoPP-2013-PrountzosP #implementation: Betweenness centrality: algorithms and implementations (DP, KP), pp. 35–46.
PPoPP-2013-WuZZJS #analysis #complexity #design #gpu #memory management: Complexity analysis and algorithm design for reorganizing data to minimize non-coalesced memory accesses on GPU (BW, ZZ, EZZ, YJ, XS), pp. 57–68.
PPoPP-2013-YangXFGLXLSYZ #cpu #gpu #simulation: A peta-scalable CPU-GPU algorithm for global atmospheric simulations (CY, WX, HF, LG, LL, YX, YL, JS, GY, WZ), pp. 1–12.
PPoPP-2013-YanLZ #named #performance: StreamScan: fast scan algorithms for GPUs without global barrier synchronization (SY, GL, YZ), pp. 229–238.
ESOP-2013-GotsmanRY #concurrent #memory management #verification: Verifying Concurrent Memory Reclamation Algorithms with Grace (AG, NR, HY), pp. 249–269.
STOC-2013-AlonLSV #approximate #matrix #rank: The approximate rank of a matrix and its algorithmic applications: approximate rank (NA, TL, AS, SV), pp. 675–684.
STOC-2013-Ambainis #quantum: Superlinear advantage for exact quantum algorithms (AA), pp. 891–900.
STOC-2013-CaputoMSS #random: Random lattice triangulations: structure and algorithms (PC, FM, AS, AS), pp. 615–624.
STOC-2013-EisenstatK #graph #linear #multi: Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs (DE, PNK), pp. 735–744.
STOC-2013-FeldmanGRVX #bound #clique #detection #statistics: Statistical algorithms and a lower bound for detecting planted cliques (VF, EG, LR, SV, YX), pp. 655–664.
STOC-2013-GuptaTW #bound #graph: Sparsest cut on bounded treewidth graphs: algorithms and hardness results (AG, KT, DW), pp. 281–290.
STOC-2013-Har-PeledR #distance #linear #problem: Net and prune: a linear time algorithm for euclidean distance problems (SHP, BAR), pp. 605–614.
STOC-2013-KelnerOSZ #combinator: A simple, combinatorial algorithm for solving SDD systems in nearly-linear time (JAK, LO, AS, ZAZ), pp. 911–920.
STOC-2013-KwokLLGT #analysis #clustering #difference #higher-order: Improved Cheeger’s inequality: analysis of spectral partitioning algorithms through higher order spectral gap (TCK, LCL, YTL, SOG, LT), pp. 11–20.
STOC-2013-NeimanS: Simple deterministic algorithms for fully dynamic maximal matching (ON, SS), pp. 745–754.
STOC-2013-RodittyW #approximate #graph #performance: Fast approximation algorithms for the diameter and radius of sparse graphs (LR, VVW), pp. 515–524.
TACAS-2013-ChenW #learning #library #named: BULL: A Library for Learning Algorithms of Boolean Functions (YFC, BYW), pp. 537–542.
CADE-2013-BeckertGS #logic: Analysing Vote Counting Algorithms via Logic — And Its Application to the CADE Election Scheme (BB, RG, CS), pp. 135–144.
CAV-2013-ChatterjeeL #markov #performance #process: Faster Algorithms for Markov Decision Processes with Low Treewidth (KC, JL), pp. 543–558.
ICST-2013-YuLBKK #combinator #constraints #generative #performance #testing: An Efficient Algorithm for Constraint Handling in Combinatorial Test Generation (LY, YL, MNB, RK, DRK), pp. 242–251.
LICS-2013-Vicary #quantum: Topological Structure of Quantum Algorithms (JV), pp. 93–102.
SAT-2013-SamulowitzRSS #named: Snappy: A Simple Algorithm Portfolio (HS, CR, AS, MS), pp. 422–428.
TAP-2013-InsaSR #debugging #execution #using: Speeding Up Algorithmic Debugging Using Balanced Execution Trees (DI, JS, AR), pp. 133–151.
DocEng-2012-GobelHOO #comprehension #documentation: A methodology for evaluating algorithms for table understanding in PDF documents (MCG, TH, EO, GO), pp. 45–48.
DRR-2012-ChengWAST #classification #image #optimisation #visual notation: Graphical image classification combining an evolutionary algorithm and binary particle swarm optimization (BC, RW, SA, RJS, GRT).
DRR-2012-Silva #detection #evaluation #using: Using specific evaluation for comparing and combining competing algorithms: applying it to table column detection (ACeS).
JCDL-2012-TuarobMG #network #using: Improving algorithm search using the algorithm co-citation network (ST, PM, CLG), pp. 277–280.
PODS-2012-ChoromanskiM #database #graph #power of #privacy #statistics: The power of the dinur-nissim algorithm: breaking privacy of statistical and graph databases (KC, TM), pp. 65–76.
PODS-2012-HuangYZ #distributed #random: Randomized algorithms for tracking distributed count, frequencies, and ranks (ZH, KY, QZ), pp. 295–306.
PODS-2012-NgoPRR #worst-case: Worst-case optimal join algorithms: [extended abstract] (HQN, EP, CR, AR), pp. 37–48.
SIGMOD-2012-FaloutsosK #graph #mining #scalability: Managing and mining large graphs: patterns and algorithms (CF, UK), pp. 585–588.
SIGMOD-2012-ParameswaranGPPRW #named: CrowdScreen: algorithms for filtering data with humans (AGP, HGM, HP, NP, AR, JW), pp. 361–372.
VLDB-2012-ChoiCT #database #scalability: A Scalable Algorithm for Maximizing Range Sum in Spatial Databases (DWC, CWC, YT), pp. 1088–1099.
VLDB-2012-ShengZTJ #crawling #database #web: Optimal Algorithms for Crawling a Hidden Database in the Web (CS, NZ, YT, XJ), pp. 1112–1123.
VLDB-2012-Shim #big data #data analysis #pipes and filters: MapReduce Algorithms for Big Data Analysis (KS), pp. 2016–2017.
VLDB-2012-ZengH #graph #pattern matching: Comments on “Stack-based Algorithms for Pattern Matching on DAGs” (QZ, HZ), pp. 668–679.
VLDB-2013-LeeHKL12 #comparison #database #graph #morphism: An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases (JL, WSH, RK, JHL), pp. 133–144.
ITiCSE-2012-Gibson #education #graph: Teaching graph algorithms to children of all ages (JPG), pp. 34–39.
ITiCSE-2012-Levitin: Digging for algorithmic nuggets in the land of polyominoes (AL), pp. 52–56.
ITiCSE-2012-MehtaKP #learning #network: Forming project groups while learning about matching and network flows in algorithms (DPM, TMK, IP), pp. 40–45.
ITiCSE-2012-MI: A method to construct counterexamples for greedy algorithms (JM, SI), pp. 238–243.
ITiCSE-2012-Ragonis #education #source code: Integrating the teaching of algorithmic patterns into computer science teacher preparation programs (NR), pp. 339–344.
ITiCSE-2012-Velazquez-Iturbide #approach #learning #refinement: Refinement of an experimental approach tocomputer-based, active learning of greedy algorithms (JÁVI), pp. 46–51.
SIGITE-2012-AhmadzadehM #clustering #education #programming #research #using: A feasibility study on using clustering algorithms in programming education research (MA, EM), pp. 145–150.
WCRE-J-2009-LoRRV12 #evaluation #mining #quantifier: Mining quantified temporal rules: Formalism, algorithms, and evaluation (DL, GR, VPR, KV), pp. 743–759.
ICSM-2012-IslamMSKS #named #search-based #semantics #sorting #testing: MOTCP: A tool for the prioritization of test cases based on a sorting genetic algorithm and Latent Semantic Indexing (MMI, AM, AS, FBK, GS), pp. 654–657.
ICSM-2012-ZouG #automation #case study #detection #industrial #what #why: An industrial case study of Coman’s automated task detection algorithm: What Worked, What Didn’t, and Why (LZ, MWG), pp. 6–14.
WCRE-2012-AllierAHD #framework #ranking: A Framework to Compare Alert Ranking Algorithms (SA, NA, AH, SD), pp. 277–285.
WCRE-2012-GuerroujGGAP #identifier #named #performance: TRIS: A Fast and Accurate Identifiers Splitting and Expansion Algorithm (LG, PG, YGG, GA, MDP), pp. 103–112.
AFL-J-2011-Blanchet-Sadri12 #combinator #word: Algorithmic Combinatorics on Partial Words (FBS), pp. 1189–1206.
CIAA-2012-FaroL #automaton #online #performance #string: A Fast Suffix Automata Based Algorithm for Exact Online String Matching (SF, TL), pp. 149–158.
CIAA-2012-Mohri #ambiguity #automaton #finite #functional #transducer: A Disambiguation Algorithm for Finite Automata and Functional Transducers (MM), pp. 265–277.
ICALP-v1-2012-BuchbinderNRS #approximate #constraints #online #rank: Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints (NB, JN, RR, MS), pp. 145–156.
ICALP-v1-2012-ByrkaR #approximate: Improved LP-Rounding Approximation Algorithm for k-level Uncapacitated Facility Location (JB, BR), pp. 157–169.
ICALP-v1-2012-EtessamiSY #branch #equation #markov #polynomial #probability #process: Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations (KE, AS, MY), pp. 314–326.
ICALP-v1-2012-ItoTY: Constant-Time Algorithms for Sparsity Matroids (HI, SiT, YY), pp. 498–509.
ICALP-v1-2012-MansourRVX #online: Converting Online Algorithms to Local Computation Algorithms (YM, AR, SV, NX), pp. 653–664.
ICALP-v1-2012-ThalerUV #performance: Faster Algorithms for Privately Releasing Marginals (JT, JU, SPV), pp. 810–821.
ICALP-v1-2012-Zouzias #matrix: A Matrix Hyperbolic Cosine Algorithm and Applications (AZ), pp. 846–858.
ICALP-v2-2012-BernsHP #distributed #metric: Super-Fast Distributed Algorithms for Metric Facility Location (AB, JH, SVP), pp. 428–439.
ICALP-v2-2012-MurawskiT #game studies: Algorithmic Games for Full Ground References (ASM, NT), pp. 312–324.
ICALP-v2-2012-PelegRT #distributed #network: Distributed Algorithms for Network Diameter and Girth (DP, LR, ET), pp. 660–672.
ICALP-v2-2012-Spielman #equation #graph #linear: Algorithms, Graph Theory, and the Solution of Laplacian Linear Equations (DAS), pp. 24–26.
LATA-2012-BolligP #performance: An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings (BB, TP), pp. 143–154.
LATA-2012-GeilkeZ #learning #pattern matching #polynomial: Polynomial-Time Algorithms for Learning Typed Pattern Languages (MG, SZ), pp. 277–288.
FM-2012-GiorginoS #correctness #pointer: Correctness of Pointer Manipulating Algorithms Illustrated by a Verified BDD Construction (MG, MS), pp. 202–216.
FM-2012-NedunuriSC #performance: Theory and Techniques for Synthesizing Efficient Breadth-First Search Algorithms (SN, DRS, WRC), pp. 308–325.
FM-2012-SpasicM #formal method #incremental #refinement: Formalization of Incremental Simplex Algorithm by Stepwise Refinement (MS, FM), pp. 434–449.
SEFM-2012-LefticaruI #approach #finite #generative #search-based #state machine #testing #using: An Improved Test Generation Approach from Extended Finite State Machines Using Genetic Algorithms (RL, FI), pp. 293–307.
FLOPS-2012-Morihata #parallel #problem: Calculational Developments of New Parallel Algorithms for Size-Constrained Maximum-Sum Segment Problems (AM), pp. 213–227.
ICFP-2012-NeatherwayRO #higher-order #model checking: A traversal-based algorithm for higher-order model checking (RPN, SJR, CHLO), pp. 353–364.
CIG-2012-IkedaTVT #game studies #heuristic: Playing PuyoPuyo: Two search algorithms for constructing chain and tactical heuristics (KI, DT, SV, YT), pp. 71–78.
CHI-2012-HollandKT #detection #identification #usability #visual notation: Identifying usability issues via algorithmic detection of excessive visual search (CH, OK, DET), pp. 2943–2952.
CSCW-2012-PriedhorskyPST #evaluation #personalisation #recommendation: Recommending routes in the context of bicycling: algorithms, evaluation, and the value of personalization (RP, DP, SS, LGT), pp. 979–988.
ICEIS-J-2012-RibeiroFBKE #approach #learning #markov #process: Combining Learning Algorithms: An Approach to Markov Decision Processes (RR, FF, MACB, ALK, FE), pp. 172–188.
ICEIS-v1-2012-RibeiroFBBDKE #approach #learning: Unified Algorithm to Improve Reinforcement Learning in Dynamic Environments — An Instance-based Approach (RR, FF, MACB, APB, OBD, ALK, FE), pp. 229–238.
ICEIS-v1-2012-TertiltBK #enterprise #modelling #performance #scalability #using: Modeling the Performance and Scalability of a SAP ERP System using an Evolutionary Algorithm (DT, AB, HK), pp. 112–118.
CIKM-2012-BarbosaPG #query: Generically extending anonymization algorithms to deal with successive queries (MB, AP, BG), pp. 1362–1371.
CIKM-2012-HuangQYY #detection #robust: Local anomaly descriptor: a robust unsupervised algorithm for anomaly detection based on diffusion space (HH, HQ, SY, DY), pp. 405–414.
CIKM-2012-KranenWRRS #automation #evaluation: A tool for automated evaluation of algorithms (PK, SW, TR, SR, TS), pp. 2692–2694.
CIKM-2012-LinXCB #performance #query: Efficient algorithms for generalized subgraph query processing (WL, XX, JC, SSB), pp. 325–334.
CIKM-2012-MahajanRTM #named #recommendation: LogUCB: an explore-exploit algorithm for comments recommendation (DKM, RR, CT, AM), pp. 6–15.
CIKM-2012-RahmanBH #analysis #approximate #graph #named #scalability: GRAFT: an approximate graphlet counting algorithm for large graph analysis (MR, MB, MAH), pp. 1467–1471.
CIKM-2012-RamanSGB #learning #towards: Learning from mistakes: towards a correctable learning algorithm (KR, KMS, RGB, CJCB), pp. 1930–1934.
CIKM-2012-RiondatoDFU #approximate #mining #named #parallel #pipes and filters #random: PARMA: a parallel randomized algorithm for approximate association rules mining in MapReduce (MR, JAD, RF, EU), pp. 85–94.
CIKM-2012-WangGWCY #evolution #framework #novel: Polygene-based evolution: a novel framework for evolutionary algorithms (SW, BJG, SW, GC, YY), pp. 2263–2266.
ICML-2012-BachLO #equivalence #on the: On the Equivalence between Herding and Conditional Gradient Algorithms (FRB, SLJ, GO), p. 176.
ICML-2012-BartokZS #adaptation #finite #monitoring #probability: An adaptive algorithm for finite stochastic partial monitoring (GB, NZ, CS), p. 231.
ICML-2012-ChenLL #online: An Online Boosting Algorithm with Theoretical Justifications (STC, HTL, CJL), p. 243.
ICML-2012-HoiWZJW #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-JiYLJH #bound #fault #learning: A Simple Algorithm for Semi-supervised Learning with Improved Generalization Error Bound (MJ, TY, BL, RJ, JH), p. 110.
ICML-2012-KongD #linear: An Iterative Locally Linear Embedding Algorithm (DK, CHQD), p. 122.
ICML-2012-KrishnamurthyBXS #clustering #performance: Efficient Active Algorithms for Hierarchical Clustering (AK, SB, MX, AS), p. 39.
ICML-2012-KulisJ: Revisiting k-means: New Algorithms via Bayesian Nonparametrics (BK, MIJ), p. 148.
ICML-2012-Laue #hybrid #optimisation: A Hybrid Algorithm for Convex Semidefinite Optimization (SL), p. 142.
ICML-2012-MnihT #modelling #performance #probability: A fast and simple algorithm for training neural probabilistic language models (AM, YWT), p. 58.
ICML-2012-NaimG #convergence: Convergence of the EM Algorithm for Gaussian Mixtures with Unbalanced Mixing Coefficients (IN, DG), p. 185.
ICML-2012-Painter-WakefieldP #learning: Greedy Algorithms for Sparse Reinforcement Learning (CPW, RP), p. 114.
ICML-2012-ScherrerHTH #coordination #problem #scalability: Scaling Up Coordinate Descent Algorithms for Large ℓ1 Regularization Problems (CS, MH, AT, DH), p. 50.
ICML-2012-VladymyrovC #performance: Fast Training of Nonlinear Embedding Algorithms (MV, MÁCP), p. 129.
ICPR-2012-AmornbunchornvejLAIT #clustering: Iterative Neighbor-Joining tree clustering algorithm for genotypic data (CA, TL, AA, AI, ST), pp. 1827–1830.
ICPR-2012-ChatbriK #image #robust #sketching #towards: Towards making thinning algorithms robust against noise in sketch images (HC, KK), pp. 3030–3033.
ICPR-2012-DornellesH #approach #image #search-based: A genetic algorithm based approach for combining binary image operators (MMD, NSTH), pp. 3184–3187.
ICPR-2012-DoshiS #benchmark #metric #retrieval: A comprehensive benchmark of local binary pattern algorithms for texture retrieval (NPD, GS), pp. 2760–2763.
ICPR-2012-Goldstein #detection #named: FastLOF: An Expectation-Maximization based Local Outlier detection algorithm (MG), pp. 2282–2285.
ICPR-2012-HeCS #component: A new algorithm for labeling connected-components and calculating the Euler number, connected-component number, and hole number (LH, YC, KS), pp. 3099–3102.
ICPR-2012-HsinSK #performance #synthesis: A fast wavelet-packet-based algorithm for texture synthesis (HCH, TYS, LTK), pp. 3124–3127.
ICPR-2012-Imajo #performance #using: Fast Gaussian filtering algorithm using splines (KI), pp. 489–492.
ICPR-2012-JinGYZ #learning #multi: Multi-label learning vector quantization algorithm (XBJ, GG, JY, DZ), pp. 2140–2143.
ICPR-2012-LewinJC #composition #evaluation #framework #performance: Framework for quantitative performance evaluation of shape decomposition algorithms (SL, XJ, AC), pp. 3696–3699.
ICPR-2012-LiuZR #approximate: A direction Change-based algorithm for polygonal approximation (HL, XZ, AR), pp. 3586–3589.
ICPR-2012-LiWBL #adaptation #fault: Semi-supervised adaptive parzen Gentleboost algorithm for fault diagnosis (CL, ZW, SB, ZL), pp. 2290–2293.
ICPR-2012-NarayanamN #community #detection #distributed #game studies #graph #information management #social: A game theory inspired, decentralized, local information based algorithm for community detection in social graphs (RN, YN), pp. 1072–1075.
ICPR-2012-NguyenB #optimisation: Zombie Survival Optimization: A swarm intelligence algorithm inspired by zombie foraging (HTN, BB), pp. 987–990.
ICPR-2012-PighettiPP #image #interactive #multi #retrieval #search-based: Hybdrid Content Based Image Retrieval combining multi-objective interactive genetic algorithm and SVM (RP, DP, FP), pp. 2849–2852.
ICPR-2012-RaketN: A splitting algorithm for directional regularization and sparsification (LLR, MN), pp. 3094–3098.
ICPR-2012-XuanSCS #using: An Enhanced EM algorithm using maximum entropy distribution as initial condition (GX, YQS, PC, PS), pp. 849–852.
ICPR-2012-YaoZLL #effectiveness #modelling #performance: A fast and effective appearance model-based particle filtering object tracking algorithm (ZY, YZ, JL, WL), pp. 1475–1478.
ICPR-2012-ZhangFD #multi #recognition: A hierarchical algorithm with multi-feature fusion for facial expression recognition (ZZ, CF, XD), pp. 2363–2366.
ICPR-2012-ZhuoCQYX #classification #image #learning #using: Image classification using HTM cortical learning algorithms (WZ, ZC, YQ, ZY, YX), pp. 2452–2455.
KDD-2012-BharadwajCMNTVVY #named #performance: SHALE: an efficient algorithm for allocation of guaranteed display advertising (VB, PC, WM, CN, JT, SV, EV, JY), pp. 1195–1203.
KDD-2012-ChengZKC #clique #memory management #performance: Fast algorithms for maximal clique enumeration with limited memory (JC, LZ, YK, SC), pp. 1240–1248.
KDD-2012-KangPHF #analysis #named #scalability: GigaTensor: scaling tensor analysis up by 100 times — algorithms and discoveries (UK, EEP, AH, CF), pp. 316–324.
KDD-2012-Li12b #graph #mining #nondeterminism: Algorithms for mining uncertain graph data (JL), p. 813.
KDD-2012-MarchCG #correlation #performance: Fast algorithms for comprehensive n-point correlation estimates (WBM, AJC, AGG), pp. 1478–1486.
KDD-2012-PhamP #approximate #detection: A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data (NP, RP), pp. 877–885.
KDD-2012-YinZC #mining #named #performance: USpan: an efficient algorithm for mining high utility sequential patterns (JY, ZZ, LC), pp. 660–668.
KDIR-2012-Bhasker #case study #collaboration #comparative: Comparative Study of Collaborative Filtering Algorithms (BB), pp. 132–137.
KDIR-2012-KharbatBO #case study #dataset: A New Compaction Algorithm for LCS Rules — Breast Cancer Dataset Case Study (FK, LB, MO), pp. 382–385.
KDIR-2012-Potuzak #network #optimisation #search-based #using: Issues of Optimization of a Genetic Algorithm for Traffic Network Division using a Genetic Algorithm (TP), pp. 340–343.
KDIR-2012-ZanonACG #query: A New Query Suggestion Algorithm for Taxonomy-based Search Engines (RZ, SA, MC, IG), pp. 151–156.
KEOD-2012-BoinskiK #ontology: Lexicon based Algorithm for Domain Ontology Merging and Alignment (TB, HK), pp. 321–326.
KR-2012-LacknerP #modelling #parametricity: Fixed-Parameter Algorithms for Finding Minimal Models (ML, AP).
KR-2012-ThomazoBMR #query #set: A Generic Querying Algorithm for Greedy Sets of Existential Rules (MT, JFB, MLM, SR).
MLDM-2012-BorawskiF #automation #estimation #image: An Algorithm for the Automatic Estimation of Image Orientation (MB, DF), pp. 336–344.
MLDM-2012-LeiteBV #classification #testing: Selecting Classification Algorithms with Active Testing (RL, PB, JV), pp. 117–131.
RecSys-2012-EkstrandR #predict #recommendation: When recommenders fail: predicting recommender failure for algorithm selection and combination (MDE, JR), pp. 233–236.
SEKE-2012-SalamiA #diagrams #framework #retrieval #search-based #using: A Framework for Class Diagram Retrieval Using Genetic Algorithm (HOS, MAA), pp. 737–740.
SIGIR-2012-HongS #multi #retrieval: Mixture model with multiple centralized retrieval algorithms for result merging in federated search (DH, LS), pp. 821–830.
ICMT-2012-VarroDWS #emf #generative #modelling: An Algorithm for Generating Model-Sensitive Search Plans for EMF Models (GV, FD, MW, AS), pp. 224–239.
SPLC-2012-JohansenHF #array #feature model #generative #modelling #scalability: An algorithm for generating t-wise covering arrays from large feature models (MFJ, ØH, FF), pp. 46–55.
OOPSLA-2012-LiuSLG #distributed #performance: From clarity to efficiency for distributed algorithms (YAL, SDS, BL, MG), pp. 395–410.
PADL-2012-BransenMDS #attribute grammar: The Kennedy-Warren Algorithm Revisited: Ordering Attribute Grammars (JB, AM, AD, SDS), pp. 183–197.
PADL-2012-Lesniak #graph #haskell #named: Palovca: Describing and Executing Graph Algorithms in Haskell (ML), pp. 153–167.
PLDI-2012-ZaparanuksH #profiling: Algorithmic profiling (DZ, MH), pp. 67–76.
POPL-2012-VeanesHLMB #finite #transducer: Symbolic finite state transducers: algorithms and applications (MV, PH, BL, DM, NB), pp. 137–150.
SAS-2012-HenryMM #abstract interpretation #analysis #evaluation: Succinct Representations for Abstract Interpretation — Combined Analysis Algorithms and Experimental Evaluation (JH, DM, MM), pp. 283–299.
SAS-2012-ThakurER #abstraction: Bilateral Algorithms for Symbolic Abstraction (AVT, ME, TWR), pp. 111–128.
ASE-2012-FaunesSB #generative #model transformation #using: Generating model transformation rules from examples using an evolutionary algorithm (MF, HAS, MB), pp. 250–253.
ICSE-2012-Monteiro #effectiveness #named #parallel: HARPPIE: Hyper algorithmic recipe for productive parallelism intensive endeavors (PM), pp. 1559–1562.
SAC-2012-AhnC #locality #multi: A sensor network-based multiple acoustic source localization algorithm (JA, HC), pp. 544–549.
SAC-2012-CentenoA #approach #clustering #image: Clustering approach algorithm for image interpolation (TMC, MTA), pp. 56–57.
SAC-2012-CerriBC #classification #multi #search-based: A genetic algorithm for Hierarchical Multi-Label Classification (RC, RCB, ACPLFdC), pp. 250–255.
SAC-2012-ChenZD #effectiveness #search-based #segmentation #using: Effective radical segmentation of offline handwritten Chinese characters by using an enhanced snake model and Genetic Algorithm (ZC, BZ, SD), pp. 54–55.
SAC-2012-ChiwiacowskyGMVG #search-based: A two-level procedure based on genetic algorithms to optimize an aeronautical composite structure (LDC, PG, RM, HFdCV, ATG), pp. 259–260.
SAC-2012-ChoeYYR #automation #realtime #scheduling #search-based #using: Real-time scheduling of twin stacking cranes in an automated container terminal using a genetic algorithm (RC, HY, YY, KRR), pp. 238–243.
SAC-2012-EmirisMM #diagrams: Yet another algorithm for generalized Voronoï Diagrams (IZE, AM, BM), pp. 109–110.
SAC-2012-FariaBGC #clustering #data type: Improving the offline clustering stage of data stream algorithms in scenarios with variable number of clusters (ERF, RCB, JG, ACPLFC), pp. 829–830.
SAC-2012-HuangHL #framework: Evaluating force-directed algorithms with a new framework (MLH, WH, CCL), pp. 1030–1032.
SAC-2012-HuangHYY #approximate #correlation #network: An in-network approximate data gathering algorithm exploiting spatial correlation in wireless sensor networks (CCH, JLH, JAY, LYY), pp. 550–555.
SAC-2012-MascardiL #named #ontology: BOwL: exploiting Boolean operators and lesk algorithm for linking ontologies (VM, AL), pp. 398–400.
SAC-2012-MatsubaraMYUIK #named #performance #re-engineering: CCDR-PAID: more efficient cache-conscious PAID algorithm by data reconstruction (YM, JM, GY, YU, SI, HK), pp. 193–198.
SAC-2012-MengHO #analysis #search-based: Analysis of a triploid genetic algorithm over deceptive landscapes (LM, SH, CO), pp. 244–249.
SAC-2012-NeumannC #estimation: Introducing intervention targeting into estimation of distribution algorithms (GN, DC), pp. 220–225.
SAC-2012-ParkSSP #hybrid #in memory #memory management: PRAM wear-leveling algorithm for hybrid main memory based on data buffering, swapping, and shifting (SKP, HS, DJS, KHP), pp. 1643–1644.
SAC-2012-Pizzuti #community #composition #detection #search-based: Boosting the detection of modular community structure with genetic algorithms and local search (CP), pp. 226–231.
SAC-2012-RibasOBS #segmentation: Assessing handwitten digit segmentation algorithms (FR, LSO, AdSBJ, RS), pp. 772–776.
SAC-2012-SarroMFG #analysis #fault #predict #search-based #using: A further analysis on the use of Genetic Algorithm to configure Support Vector Machines for inter-release fault prediction (FS, SDM, FF, CG), pp. 1215–1220.
SAC-2012-ThanhZ #probability #simulation: Tree-based search for stochastic simulation algorithm (VHT, RZ), pp. 1415–1416.
SAC-2012-WangTWWG #behaviour #empirical #evaluation #mining #process: An empirical evaluation of process mining algorithms based on structural and behavioral similarities (JW, ST, LW, RKW, QG), pp. 211–213.
CASE-2012-CaiL #hybrid #multi #problem #scheduling #search-based: A hybrid genetic algorithm for resource-constrained multi-project scheduling problem with resource transfer time (ZC, XL), pp. 569–574.
CASE-2012-DimitrovB #evaluation #reduction #scheduling #search-based: Criteria evaluation considering the current time used by a genetic scheduling algorithm for changeover and tardiness reduction (TD, MB), pp. 425–430.
CASE-2012-IdenP #aspect-oriented #detection #functional #safety: Functional safety aspects of pattern detection algorithms (JI, CIP), pp. 747–752.
CASE-2012-JeongC #independence #quality: Independent contact region (ICR) based in-hand motion planning algorithm with guaranteed grasp quality margin (HJ, JC), pp. 1089–1094.
CASE-2012-JiaZH #fuzzy #parametricity #self: Active control of turbine tip clearance by fuzzy parameter self-setting PID algorithms (BJ, XZ, YH), pp. 162–166.
CASE-2012-KaneshigeNUMT #mobile #online: An algorithm for on-line path planning of autonomous mobile overhead traveling crane based on obstacle information (AK, SN, SU, TM, KT), pp. 914–919.
CASE-2012-KimKS #detection #recognition #using: Hole detection algorithm for square peg-in-hole using force-based shape recognition (YLK, BSK, JBS), pp. 1074–1079.
CASE-2012-KimLKCH: Proposal of built-in-guide-rail type building façade cleaning robot and its motion planning algorithm (DHK, SL, MK, BIC, CSH), pp. 1004–1009.
CASE-2012-NazeemR #performance #resource management: An efficient algorithm for the enumeration of the minimal unsafe states in complex resource allocation systems (AN, SAR), pp. 686–693.
CASE-2012-SintovRMS #set: A common 3-finger grasp search algorithm for a set of planar objects (AS, SR, RM, AS), pp. 1095–1100.
CASE-2012-SuhYO #locality #mobile #network: A cooperative localization algorithm for mobile sensor networks (JS, SY, SO), pp. 1126–1131.
CASE-2012-WangLC #realtime: Real-time path planning for low altitude flight based on A* algorithm and TF/TA algorithm (HW, QL, NC), pp. 837–842.
CASE-2012-YouKLKLH #assembly #development: Development of manipulation planning algorithm for a dual-arm robot assembly task (JSY, DHK, SJL, SPK, JYL, CSH), pp. 1061–1066.
DAC-2012-Al-MaashriDCCXNC #recognition: Accelerating neuromorphic vision algorithms for recognition (AAM, MD, MC, NC, YX, VN, CC), pp. 579–584.
DAC-2012-BhardwajCR #adaptation #towards: Towards graceful aging degradation in NoCs through an adaptive routing algorithm (KB, KC, SR), pp. 382–391.
DAC-2012-FangCC #composition #layout #novel: A novel layout decomposition algorithm for triple patterning lithography (SYF, YWC, WYC), pp. 1185–1190.
DAC-2012-Gester0NPSV #data type #performance: Algorithms and data structures for fast and good VLSI routing (MG, DM, TN, CP, CS, JV), pp. 459–464.
DAC-2012-LiuCL #multi #performance: An efficient algorithm for multi-layer obstacle-avoiding rectilinear Steiner tree construction (CHL, ICC, DTL), pp. 613–622.
DAC-2012-RanieriVCAV #manycore #named: EigenMaps: algorithms for optimal thermal maps extraction and sensor placement on multicore processors (JR, AV, AC, DA, MV), pp. 636–641.
DAC-2012-WangW #memory management #performance: Observational wear leveling: an efficient algorithm for flash memory management (CW, WFW), pp. 235–242.
DATE-2012-BattezzatiCMS #architecture #industrial #novel: SURF algorithm in FPGA: A novel architecture for high demanding industrial applications (NB, SC, MM, LS), pp. 161–162.
DATE-2012-BhardwajCR: An MILP-based aging-aware routing algorithm for NoCs (KB, KC, SR), pp. 326–331.
DATE-2012-CordesM #parallel #search-based #using: Multi-objective aware extraction of task-level parallelism using genetic algorithms (DC, PM), pp. 394–399.
DATE-2012-EbrahimiDLPT #network: CATRA- congestion aware trapezoid-based routing algorithm for on-chip networks (ME, MD, PL, JP, HT), pp. 320–325.
DATE-2012-JiangSCBP #constraints #generative #memory management #on the: On the optimality of K longest path generation algorithm under memory constraints (JJ, MS, AC, BB, IP), pp. 418–423.
DATE-2012-SabenaRS #testing: A new SBST algorithm for testing the register file of VLIW processors (DS, MSR, LS), pp. 412–417.
DATE-2012-TtofisT #adaptation #hardware #implementation #realtime #towards: Towards accurate hardware stereo correspondence: A real-time FPGA implementation of a segmentation-based adaptive support weight algorithm (CT, TT), pp. 703–708.
DATE-2012-WangLPW #difference #linear #simulation: An operational matrix-based algorithm for simulating linear and fractional differential circuits (YW, HL, GKHP, NW), pp. 1463–1466.
DATE-2012-ZhangWHY #energy #game studies #resource management: Fair energy resource allocation by minority game algorithm for smart buildings (CZ, WW, HH, HY), pp. 63–68.
HPCA-2012-MaJW12a #adaptation #design #performance: Whole packet forwarding: Efficient design of fully adaptive routing algorithms for networks-on-chip (SM, NDEJ, ZW), pp. 467–478.
HPDC-2012-KutluAK #data-driven #fault tolerance #parallel: Fault tolerant parallel data-intensive algorithms (MK, GA, OK), pp. 133–134.
PDP-2012-CastilloFC #complexity #concurrent #detection #linear: A Dynamic Deadlock Detection/Resolution Algorithm with Linear Message Complexity (MC, FF, AC), pp. 175–179.
PDP-2012-DilchM #analysis #architecture #gpu #novel #optimisation #performance: Optimization Techniques and Performance Analyses of Two Life Science Algorithms for Novel GPU Architectures (DD, EM), pp. 376–383.
PDP-2012-FlorioB #product line #robust: Robust and Tuneable Family of Gossiping Algorithms (VDF, CB), pp. 154–161.
PDP-2012-FreyRE #concurrent #thread: SIMT Microscheduling: Reducing Thread Stalling in Divergent Iterative Algorithms (SF, GR, TE), pp. 399–406.
PDP-2012-GavaGP #performance #protocol #security: Performance Evaluations of a BSP Algorithm for State Space Construction of Security Protocols (FG, MG, FP), pp. 170–174.
PDP-2012-HernaneGB #distributed: A Dynamic Distributed Algorithm for Read Write Locks (SLH, JG, MB), pp. 180–184.
PDP-2012-PabonL: Tackling Algorithmic Skeleton’s Inversion of Control (GP, ML), pp. 42–46.
PDP-2012-SaenkoK #design #evaluation #mining #performance #problem #search-based: Design and Performance Evaluation of Improved Genetic Algorithm for Role Mining Problem (IS, IVK), pp. 269–274.
PPoPP-2012-BlellochFGS #parallel #performance: Internally deterministic parallel algorithms can be fast (GEB, JTF, PBG, JS), pp. 181–192.
PPoPP-2012-MittalJGSK: Collective algorithms for sub-communicators (AM, NJ, TG, YS, SK), pp. 315–316.
PPoPP-2012-SackG #communication #performance: Faster topology-aware collective algorithms through non-minimal communication (PS, WG), pp. 45–54.
STOC-2012-AnKS: Improving christofides’ algorithm for the s-t path TSP (HCA, RK, DBS), pp. 875–886.
STOC-2012-CaiDW #multi: An algorithmic characterization of multi-dimensional mechanisms (YC, CD, SMW), pp. 459–478.
STOC-2012-ChalermsookCEL #approximate #concurrent: Approximation algorithms and hardness of integral concurrent flow (PC, JC, AE, SL), pp. 689–708.
STOC-2012-CheungKL #matrix #performance #rank: Fast matrix rank algorithms and applications (HYC, TCK, LCL), pp. 549–562.
STOC-2012-EtessamiSY #branch #context-free grammar #multi #polynomial #probability #process: Polynomial time algorithms for multi-type branching processes and stochastic context-free grammars (KE, AS, MY), pp. 579–588.
STOC-2012-GargMSV: A complementary pivot algorithm for markets under separable, piecewise-linear concave utilities (JG, RM, MAS, VVV), pp. 1003–1016.
STOC-2012-MakarychevMV #approximate #clustering #problem: Approximation algorithms for semi-random partitioning problems (KM, YM, AV), pp. 367–384.
STOC-2012-OrecchiaSV #approximate #exponential: Approximating the exponential, the lanczos method and an Õ(m)-time spectral algorithm for balanced separator (LO, SS, NKV), pp. 1141–1160.
STOC-2012-SharathkumarA #approximate #geometry: A near-linear time ε-approximation algorithm for geometric bipartite matching (RS, PKA), pp. 385–394.
STOC-2012-Vegh #low cost #polynomial #problem: Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (LAV), pp. 27–40.
CAV-2012-LeeWY #analysis #learning #termination: Termination Analysis with Algorithmic Learning (WL, BYW, KY), pp. 88–104.
CAV-2012-SchellhornWD #how: How to Prove Algorithms Linearisable (GS, HW, JD), pp. 243–259.
CSL-2012-ChatterjeeCK #performance #refinement: Faster Algorithms for Alternating Refinement Relations (KC, SC, PK), pp. 167–182.
ICLP-J-2012-BaralDGG #correctness #programming #set #λ-calculus: Typed answer set programming λ calculus theories and correctness of inverse λ algorithms with respect to them (CB, JD, MAG, AG), pp. 775–791.
ICST-2012-DelamareK #aspect-oriented #integration #order #search-based: A Genetic Algorithm for Computing Class Integration Test Orders for Aspect-Oriented Systems (RD, NAK), pp. 804–813.
ICST-2012-GeronimoFMS #automation #generative #parallel #pipes and filters #search-based #testing: A Parallel Genetic Algorithm Based on Hadoop MapReduce for the Automatic Generation of JUnit Test Suites (LDG, FF, AM, FS), pp. 785–793.
ICST-2012-LiLO #cost analysis: Better Algorithms to Minimize the Cost of Test Paths (NL, FL, JO), pp. 280–289.
IJCAR-2012-MarshallN #unification: New Algorithms for Unification Modulo One-Sided Distributivity and Its Variants (AMM, PN), pp. 408–422.
ISSTA-2012-IqbalAB #embedded #empirical #modelling #realtime #testing: Empirical investigation of search algorithms for environment model-based testing of real-time embedded software (MZZI, AA, LCB), pp. 199–209.
ISSTA-2012-ZhangJWLZ #detection #towards: A first step towards algorithm plagiarism detection (FZ, YcJ, DW, PL, SZ), pp. 111–121.
LICS-2012-GrigorieffV #bound #using: Functionals Using Bounded Information and the Dynamics of Algorithms (SG, PV), pp. 345–354.
SAT-2012-AchlioptasM #bound #exponential #random #satisfiability: Exponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas (DA, RMM), pp. 327–340.
SAT-2012-GoultiaevaB: Off the Trail: Re-examining the CDCL Algorithm (AG, FB), pp. 30–43.
SAT-2012-XuHHL #component: Evaluating Component Solver Contributions to Portfolio-Based Algorithm Selectors (LX, FH, HH, KLB), pp. 228–241.
VMCAI-2012-AlbarghouthiGC #interprocedural #named #verification: Whale: An Interpolation-Based Algorithm for Inter-procedural Verification (AA, AG, MC), pp. 39–55.
DocEng-2011-GippM #detection #pattern matching #sequence: Citation pattern matching algorithms for citation-based plagiarism detection: greedy citation tiling, citation chunking and longest common citation sequence (BG, NM), pp. 249–258.
DRR-2011-BukhariSB #documentation #image #multi #segmentation #using: Improved document image segmentation algorithm using multiresolution morphology (SSB, FS, TMB), pp. 1–10.
HT-2011-ChilukuriI: An algorithm to generate engaging narratives through non-linearity (VC, BI), pp. 291–298.
ICDAR-2011-AlaeiNP11a #approach #documentation: A New Text-Line Alignment Approach Based on Piece-Wise Painting Algorithm for Handwritten Documents (AA, PN, UP), pp. 324–328.
ICDAR-2011-BerettaL #evaluation #identification #performance: Performance Evaluation of Algorithms for Newspaper Article Identification (RB, LL), pp. 394–398.
ICDAR-2011-ChenL11a #detection #documentation #modelling: A Model-Based Ruling Line Detection Algorithm for Noisy Handwritten Documents (JC, DPL), pp. 404–408.
ICDAR-2011-CoustatyBBL #image #ontology #semantic gap #using: Using Ontologies to Reduce the Semantic Gap between Historians and Image Processing Algorithms (MC, AB, KB, GL), pp. 156–160.
ICDAR-2011-JiangDLW #markov #novel #segmentation #string #using: A Novel Short Merged Off-line Handwritten Chinese Character String Segmentation Algorithm Using Hidden Markov Model (ZJ, XD, CL, YW), pp. 668–672.
ICDAR-2011-KessentiniPG #multi #recognition #word: An Optimized Multi-stream Decoding Algorithm for Handwritten Word Recognition (YK, TP, AG), pp. 192–196.
ICDAR-2011-LamiroyLS #analysis #contest #documentation: Document Analysis Algorithm Contributions in End-to-End Applications: Report on the ICDAR 2011 Contest (BL, DPL, TS), pp. 1521–1525.
ICDAR-2011-LeloreB: Super-Resolved Binarization of Text Based on the FAIR Algorithm (TL, FB), pp. 839–843.
ICDAR-2011-SongXZYZ #documentation #image #multi: A Handwritten Character Extraction Algorithm for Multi-language Document Image (YS, GX, YZ, LY, LZ), pp. 93–98.
ICDAR-2011-VincentNP #documentation #using: Document Recto-verso Registration Using a Dynamic Time Warping Algorithm (VR, NJ, JPD), pp. 1230–1234.
ICDAR-2011-WinderAS #documentation #segmentation: Extending Page Segmentation Algorithms for Mixed-Layout Document Processing (AW, TLA, EHBS), pp. 1245–1249.
PODS-2011-MirMNW #sketching #statistics: Pan-private algorithms via statistics on sketches (DJM, SM, AN, RNW), pp. 37–48.
SIGMOD-2011-BlanasLP #design #evaluation #in memory #manycore #memory management: Design and evaluation of main memory hash join algorithms for multi-core CPUs (SB, YL, JMP), pp. 37–48.
SIGMOD-2011-CaoSSYDGW #consistency #performance: Fast checkpoint recovery algorithms for frequently consistent applications (TC, MAVS, BS, YY, AJD, JG, WMW), pp. 265–276.
SIGMOD-2011-HuangWYL #network: Sampling based algorithms for quantile computation in sensor networks (ZH, LW, KY, YL), pp. 745–756.
SIGMOD-2011-LiDF #approximate #named #performance: Faerie: efficient filtering algorithms for approximate dictionary-based entity extraction (GL, DD, JF), pp. 529–540.
SIGMOD-2011-OrdonezP #data mining #mining: One-pass data mining algorithms in a DBMS with UDFs (CO, SKP), pp. 1217–1220.
SIGMOD-2011-ZhaiLG #named #probability #similarity: ATLAS: a probabilistic algorithm for high dimensional similarity search (JZ, YL, JG), pp. 997–1008.
VLDB-2011-AoZWSWLLL #parallel #performance #using: Efficient Parallel Lists Intersection and Index Compression Algorithms using Graphics Processing Units (NA, FZ, DW, DSS, GW, XL, JL, SL), pp. 470–481.
VLDB-2011-NutanongJS #distance #incremental: An Incremental Hausdorff Distance Calculation Algorithm (SN, EHJ, HS), pp. 506–517.
VLDB-2011-YanZN #network #performance: Efficient Algorithms for Finding Optimal Meeting Point on Road Networks (DY, ZZ, WN), pp. 968–979.
VLDB-2012-PawlikA11 #distance #edit distance #named #robust: RTED: A Robust Algorithm for the Tree Edit Distance (MP, NA), pp. 334–345.
ITiCSE-2011-LeeR #behaviour #towards #visualisation: Toward replicating handmade algorithm visualization behaviors in a digital environment: a pre-study (MHL, GR), pp. 198–202.
ITiCSE-2011-RosslingMS #animation #automation #named: AnimalSense: combining automated exercise evaluations with algorithm animations (GR, MM, JS), pp. 298–302.
ITiCSE-2011-Sanchez-TorrubiaTT #assessment #automation #learning: GLMP for automatic assessment of DFS algorithm learning (MGST, CTB, GT), p. 351.
ITiCSE-2011-Velazquez-Iturbide #design #revisited: The design and coding of greedy algorithms revisited (JÁVI), pp. 8–12.
CSMR-2011-LamkanfiDSV #debugging #mining #predict: Comparing Mining Algorithms for Predicting the Severity of a Reported Bug (AL, SD, QDS, TV), pp. 249–258.
ICSM-2011-TarvoZC #branch #integration #mining #multi #version control: An integration resolution algorithm for mining multiple branches in version control systems (AT, TZ, JC), pp. 402–411.
MSR-2011-SadowskiLLZW #analysis #empirical: An empirical analysis of the FixCache algorithm (CS, CL, ZL, XZ, EJWJ), pp. 219–222.
SCAM-2011-SawinR #graph: Assumption Hierarchy for a CHA Call Graph Construction Algorithm (JS, AR), pp. 35–44.
CIAA-J-2010-AllauzenCM11 #coordination #kernel: A Dual Coordinate Descent Algorithm for SVMs Combined with Rational Kernels (CA, CC, MM), pp. 1761–1779.
CIAA-J-2010-AllauzenRS11 #composition #finite #performance #transducer: A Filter-Based Algorithm for Efficient Composition of Finite-State Transducers (CA, MR, JS), pp. 1781–1795.
CIAA-J-2010-CzumajCGJLZ11 #approximate #design #geometry #network: Approximation Algorithms for Buy-at-Bulk Geometric Network Design (AC, JC, LG, JJ, AL, PZ), pp. 1949–1969.
AFL-2011-Egri-NagyMN #composition #performance: Algorithms for the Efficient Calculation of the Holonomy Decomposition (AEN, JDM, CLN), pp. 389–390.
AFL-2011-Umeo #2d #automaton #implementation: Recent Developments in Firing Squad Synchronization Algorithms for Two-Dimensional Cellular Automata and Their State-Efficient Implementations (HU), pp. 368–387.
CIAA-2011-Buchnik #multi #named #string: Bouma2 — A High-Performance Input-Aware Multiple String-Match Algorithm (EB), pp. 53–64.
CIAA-2011-CastiglioneRS #automaton #nondeterminism: Nondeterministic Moore Automata and Brzozowski’s Algorithm (GC, AR, MS), pp. 88–99.
ICALP-v1-2011-AbrahamDFGW: VC-Dimension and Shortest Path Algorithms (IA, DD, AF, AVG, RFFW), pp. 690–699.
ICALP-v1-2011-AroraG #fault #learning: New Algorithms for Learning in Presence of Errors (SA, RG), pp. 403–415.
ICALP-v1-2011-FeldmanNS: Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm — (MF, JN, RS), pp. 342–353.
ICALP-v1-2011-GoldbergJ #polynomial: A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid (LAG, MJ), pp. 521–532.
ICALP-v1-2011-HarkinsH #bound #game studies #learning: Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds (RCH, JMH), pp. 416–423.
ICALP-v1-2011-Laekhanukit #approximate #low cost #set: An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity — (BL), pp. 13–24.
ICALP-v1-2011-Moldenhauer #approximate #graph: Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs (CM), pp. 748–759.
ICALP-v1-2011-QianW #online #problem: An O(logn)-Competitive Algorithm for Online Constrained Forest Problems (JQ, DPW), pp. 37–48.
ICALP-v2-2011-Cord-LandwehrDFHKKKKMHRSWWW #approach #convergence #mobile: A New Approach for Analyzing Convergence Algorithms for Mobile Robots (ACL, BD, MF, MH, BK, AK, PK, SK, MM, FMadH, CR, KS, DW, CW, DW), pp. 650–661.
ICALP-v2-2011-CrafaR #abstract interpretation #bisimulation #probability #simulation: Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation (SC, FR), pp. 295–306.
ICALP-v2-2011-Husfeldt: Invitation to Algorithmic Uses of Inclusion-Exclusion (TH), pp. 42–59.
ICALP-v2-2011-KieferMOWZ #on the: On Stabilization in Herman’s Algorithm (SK, ASM, JO, JW, LZ), pp. 466–477.
ICALP-v2-2011-Li #approximate #problem: A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem (SL), pp. 77–88.
ICALP-v2-2011-MegowMS #graph #online: Online Graph Exploration: New Results on Old and New Algorithms (NM, KM, PS), pp. 478–489.
LATA-2011-ConleyK #multi: Improved Alignment Based Algorithm for Multilingual Text Compression (ESC, STK), pp. 238–249.
FM-2011-MeryMT #verification: Refinement-Based Verification of Local Synchronization Algorithms (DM, MM, MT), pp. 338–352.
AIIDE-2011-OntanonZ #generative: The SAM Algorithm for Analogy-Based Story Generation (SO, JZ).
AIIDE-2011-YuT #generative #personalisation #ranking: Personalized Procedural Content Generation to Minimize Frustration and Boredom Based on Ranking Algorithm (HY, TT).
CIG-2011-AntonioFCP #evaluation #game studies #optimisation #search-based #using: Optimization of an evaluation function of the 4-sided dominoes game using a genetic algorithm (NSA, CFFCF, MGFC, RP), pp. 24–30.
CIG-2011-ReynoldsAYTP #named #social: Tutorials: Cultural Algorithms: Incorporating social intelligence into virtual worlds (RGR, DA, GNY, JT, MP).
HCI-DDA-2011-LuoY #clustering #framework #network #novel #parallel #using: A Novel Parallel Clustering Algorithm Based on Artificial Immune Network Using nVidia CUDA Framework (RL, QY), pp. 598–607.
HCI-DDA-2011-WangDL: A Global Optimal Algorithm for Camera Calibration with One-Dimensional Objects (LW, FD, CL), pp. 660–669.
HCI-DDA-2011-XuZC #image #performance: High-Quality Fast Image Upsampling Algorithm Based on CUDA (QX, XZ, JC), pp. 677–683.
HCI-DDA-2011-ZablotskiyPZM #estimation #parametricity #search-based: GMM Parameter Estimation by Means of EM and Genetic Algorithms (SZ, TP, KZ, WM), pp. 527–536.
ICEIS-J-2011-Moghadampour11b #random #search-based: Outperforming Mutation Operator with Random Building Block Operator in Genetic Algorithms (GM), pp. 178–192.
ICEIS-v1-2011-BiniLSSA: Non-exhaustive Join Ordering Search Algorithms for LJQO (TAB, AL, MSS, FS, ECdA), pp. 151–156.
ICEIS-v1-2011-HaoSHS #in the cloud #modelling #optimisation #scheduling: A Cloud Computing Model based on Hadoop with an Optimization of Its Task Scheduling Algorithms (YH, MS, JH, JS), pp. 524–528.
ICEIS-v1-2011-LuoYHJCH #named #query: IRTA: An Improved Threshold Algorithm for Reverse Top-k Queries (CL, FY, WCH, ZJ, DC, SH), pp. 135–140.
ICEIS-v2-2011-BadarudinSSMM #memory management #problem #representation #search-based: An Improved Genetic Algorithm with Gene Value Representation and Short Term Memory for Shape Assignment Problem (IB, ABMS, MNS, AM, MTMM), pp. 178–183.
ICEIS-v2-2011-LongLG #performance #predict #search-based: High-speed Railway based on Genetic Algorithm for Prediction of Travel Choice (CL, JL, YG), pp. 26–31.
ICEIS-v2-2011-Moghadampour #random #search-based: Random Building Block Operator for Genetic Algorithms (GM), pp. 54–62.
ICEIS-v2-2011-Moghadampour11a #adaptation #integer #search-based #self: Self-adaptive Integer and Decimal Mutation Operators for Genetic Algorithms (GM), pp. 184–191.
ICEIS-v2-2011-Santibanez-GonzalezLM #design #problem #search-based: A Genetic Algorithm for Solving a Public Sector Sustainable Supply Chain Design Problem (EDRSG, HPLL, GRM), pp. 222–227.
ICEIS-v2-2011-ZhangZ #optimisation #research: Research on the Route Optimization of Book Distribution based on the Tabu Search Algorithm (PZ, ZZ), pp. 125–130.
ICEIS-v3-2011-ZhangF #evaluation #performance: Performance Evaluation of Emergency Logistics based on DEA-AHP Algorithm (JZ, SF), pp. 527–532.
ICEIS-v4-2011-LuCGD #multi #network #optimisation #quality #using: Quality of Service Optimization of Wireless Sensor Networks using a Multi-objective Immune Co-evolutionary Algorithm (XL, ZRC, LG, YD), pp. 160–164.
ICEIS-v4-2011-ZhangZ11a #contest #game studies #performance: Model and Algorithm of Competition Between High-speed Railway and Air Transport — Game Theory Based (JZ, PZ), pp. 563–568.
CIKM-2011-CachedaCFF #analysis #dataset #nearest neighbour: Improving k-nearest neighbors algorithms: practical application of dataset analysis (FC, VC, DF, VF), pp. 2253–2256.
CIKM-2011-ChengQ #axiom #incremental: An algorithm for axiom pinpointing in EL+ and its incremental variant (XC, GQ), pp. 2433–2436.
CIKM-2011-ChuiKLC #query #sequence: I/O-efficient algorithms for answering pattern-based aggregate queries in a sequence OLAP system (CKC, BK, EL, RC), pp. 1619–1628.
CIKM-2011-HanusseM #parallel: A parallel algorithm for computing borders (NH, SM), pp. 1639–1648.
CIKM-2011-LadwigT #database #keyword: Index structures and top-k join algorithms for native keyword search databases (GL, TT), pp. 1505–1514.
CIKM-2011-LeeRK #recognition #using: Named entity recognition using a modified Pegasos algorithm (CL, PMR, HK), pp. 2337–2340.
CIKM-2011-RotaBG #database #keyword: The list Viterbi training algorithm and its application to keyword search over databases (SR, SB, FG), pp. 1601–1606.
CIKM-2011-Zobel #challenge #health: Data, health, and algorithmics: computational challenges for biomedicine (JZ), pp. 3–4.
ECIR-2011-AddisAV #assessment #categorisation #comparative: A Comparative Experimental Assessment of a Threshold Selection Algorithm in Hierarchical Text Categorization (AA, GA, EV), pp. 32–42.
ICML-2011-DasK #approximate #set #taxonomy: Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection (AD, DK), pp. 1057–1064.
ICML-2011-GrubbB #optimisation: Generalized Boosting Algorithms for Convex Optimization (AG, DB), pp. 1209–1216.
ICML-2011-HockingVBJ #clustering #named #using: Clusterpath: an Algorithm for Clustering using Convex Fusion Penalties (TH, JPV, FRB, AJ), pp. 745–752.
ICML-2011-KarasuyamaT: Suboptimal Solution Path Algorithm for Support Vector Machine (MK, IT), pp. 473–480.
ICML-2011-KnowlesGG #message passing: Message Passing Algorithms for the Dirichlet Diffusion Tree (DAK, JVG, ZG), pp. 721–728.
ICML-2011-OrabonaC: Better Algorithms for Selective Sampling (FO, NCB), pp. 433–440.
ICML-2011-OrabonaL #kernel #learning #multi #optimisation: Ultra-Fast Optimization Algorithm for Sparse Multi Kernel Learning (FO, JL), pp. 249–256.
ICML-2011-ParikhSX #modelling #visual notation: A Spectral Algorithm for Latent Tree Graphical Models (APP, LS, EPX), pp. 1065–1072.
ICML-2011-TamarCM: Integrating Partial Model Knowledge in Model Free RL Algorithms (AT, DDC, RM), pp. 305–312.
KDD-2011-BhaduriMG #detection: Algorithms for speeding up distance-based outlier detection (KB, BLM, CG), pp. 859–867.
KDD-2011-ChenBAD #realtime: Real-time bidding algorithms for performance-based display ad allocation (YC, PB, BA, NRD), pp. 1307–1315.
KDD-2011-GhotingKPK #data mining #implementation #machine learning #mining #named #parallel #pipes and filters #tool support: NIMBLE: a toolkit for the implementation of parallel data mining and machine learning algorithms on mapreduce (AG, PK, EPDP, RK), pp. 334–342.
KDD-2011-GilpinD #approach #clustering #flexibility #performance #satisfiability: Incorporating SAT solvers into hierarchical clustering algorithms: an efficient and flexible approach (SG, IND), pp. 1136–1144.
KDD-2011-MesterharmP #learning #online #using: Active learning using on-line algorithms (CM, MJP), pp. 850–858.
KDD-2011-MukerjeePG #framework #linear #mining #platform #semantics #sql: Linear scale semantic mining algorithms in microsoft SQL server’s semantic platform (KM, TP, SG), pp. 213–221.
KDIR-2011-AlkhalidCM #comparison: Comparison of Greedy Algorithms for Decision Tree Construction (AA, IC, MM), pp. 438–443.
KDIR-2011-GeraciM #detection #multi #web: A Multi-sequence Alignment Algorithm for Web Template Detection (FG, MM), pp. 121–128.
KDIR-2011-Ibrahim #clustering #network: Enhancing Clustering Network Planning Algorithm in the Presence of Obstacles (LFI), pp. 480–486.
KDIR-2011-LachetarB #categorisation #metadata #using: Application of an Ant Colony Algorithm — For Song Categorising using Metadata (NL, HB), pp. 379–384.
KDIR-2011-MartelotH #community #detection #multi #optimisation #using: Multi-scale Community Detection using Stability as Optimisation Criterion in a Greedy Algorithm (ELM, CH), pp. 216–225.
KDIR-2011-OmerBG #mining #motivation #using: A New Frequent Similar Tree Algorithm Motivated by Dom Mining — Using RTDM and its New Variant — SiSTeR (OB, RB, SG), pp. 238–243.
KDIR-2011-Potuzak #network #search-based: Suitability of a Genetic Algorithm for Road Traffic Network Division (TP), pp. 448–451.
KDIR-2011-Vanetik #graph #mining #performance: A Fast Algorithm for Mining Graphs of Prescribed Connectivity (NV), pp. 5–13.
KDIR-2011-ZalikZ #clustering #network: Network Clustering by Advanced Label Propagation Algorithm (KRZ, BZ), pp. 444–447.
MLDM-2011-GunesCO #classification #named #novel #relational #search-based #using: GA-TVRC: A Novel Relational Time Varying Classifier to Extract Temporal Information Using Genetic Algorithms (IG, ZÇ, SGÖ), pp. 568–583.
MLDM-2011-LozanoA #clustering: Comparing Clustering and Metaclustering Algorithms (EL, EA), pp. 306–319.
RecSys-2011-BelloginCC #comparison #evaluation #recommendation: Precision-oriented evaluation of recommender systems: an algorithmic comparison (AB, PC, IC), pp. 333–336.
SEKE-2011-VilkomirKT #case study #interface #testing #using: Interface Testing Using a Subgraph Splitting Algorithm: A Case Study (SV, AAK, NT), pp. 219–224.
SIGIR-2011-KanoulasSMPA #ranking #scalability #set: A large-scale study of the effect of training set characteristics over learning-to-rank algorithms (EK, SS, PM, VP, JAA), pp. 1243–1244.
SIGIR-2011-PaikPP #novel #statistics #using: A novel corpus-based stemming algorithm using co-occurrence statistics (JHP, DP, SKP), pp. 863–872.
SIGIR-2011-ZhouCZ #approximate #named #performance #string #towards: SEJoin: an optimized algorithm towards efficient approximate string searches (JZ, ZC, JZ), pp. 1249–1250.
MoDELS-2011-AliBAW #aspect-oriented #industrial #modelling #robust #testing #uml #using: An Industrial Application of Robustness Testing Using Aspect-Oriented Modeling, UML/MARTE, and Search Algorithms (SA, LCB, AA, SW), pp. 108–122.
ECOOP-2011-ZaparanuksH #design: The Beauty and the Beast: Separating Design from Algorithm (DZ, MH), pp. 27–51.
OOPSLA-2011-PuBS #first-order #programming #synthesis: Synthesis of first-order dynamic programming algorithms (YP, RB, SS), pp. 83–98.
PLDI-2011-PingaliNKBHKLLMMPS #parallel: The tao of parallelism in algorithms (KP, DN, MK, MB, MAH, RK, THL, AL, RM, MML, DP, XS), pp. 12–25.
PLDI-2011-ZhouCC #execution: An SSA-based algorithm for optimal speculative code motion under an execution profile (HZ, WC, FCC), pp. 98–108.
POPL-2011-AlurC #source code #streaming #transducer #verification: Streaming transducers for algorithmic verification of single-pass list-processing programs (RA, PC), pp. 599–610.
POPL-2011-AttiyaGHKMV #concurrent #order: Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated (HA, RG, DH, PK, MMM, MTV), pp. 487–498.
ASE-2011-InsaS #debugging: An optimal strategy for algorithmic debugging (DI, JS), pp. 203–212.
ASE-2011-PohlLP #analysis #automation #comparison #feature model #modelling #performance: A performance comparison of contemporary algorithmic approaches for automated analysis operations on feature models (RP, KL, KP), pp. 313–322.
ICSE-2011-ArcuriB #random #re-engineering #statistics #testing #using: A practical guide for using statistical tests to assess randomized algorithms in software engineering (AA, LCB), pp. 1–10.
SAC-2011-DaniAS #architecture #manycore #search-based: Applying genetic algorithms to optimize the power in tiled SNUCA chip multicore architectures (AMD, BA, YNS), pp. 1090–1091.
SAC-2011-DingSW #parallel #transitive: FPGA based parallel transitive closure algorithm (ZD, WS, MYW), pp. 393–394.
SAC-2011-HuangWCL #automation #image: An automatic selective color transfer algorithm for images (YHH, PCW, CCC, KPL), pp. 66–71.
SAC-2011-KatayamaKKM #clique #problem: Memetic algorithm with strategic controller for the maximum clique problem (KK, AK, KK, HM), pp. 1062–1069.
SAC-2011-KienHB #communication #hybrid #problem #search-based: New hybrid genetic algorithm for solving optimal communication spanning tree problem (PTK, NDH, HTTB), pp. 1076–1081.
SAC-2011-KuoLC #clustering #testing: Testing a binary space partitioning algorithm with metamorphic testing (FCK, SL, TYC), pp. 1482–1489.
SAC-2011-LanLSH #analysis #case study #classification #comparative #image: A comparative study and analysis on K-view based algorithms for image texture classification (YL, HL, ES, CCH), pp. 859–860.
SAC-2011-Muramatsu #online #random #verification: Random forgery attacks against DTW-based online signature verification algorithm (DM), pp. 27–28.
SAC-2011-OliveiraLTFT #documentation #image: A new algorithm for segmenting warped text-lines in document images (DMdO, RDL, GT, JF, MT), pp. 259–265.
SAC-2011-SeokPP #hybrid #in memory #memory management #migration: Migration based page caching algorithm for a hybrid main memory of DRAM and PRAM (HS, YP, KHP), pp. 595–599.
SAC-2011-YueFCY: ID* Lite: improved D* Lite algorithm (WY, JF, WC, HY), pp. 1364–1369.
SAC-2011-YukselBK #estimation #framework #parametricity #platform #search-based: A software platform for genetic algorithms based parameter estimation on digital sound synthesizers (KAY, BB, HK), pp. 1088–1089.
SLE-2011-JongeV #layout #refactoring: An Algorithm for Layout Preservation in Refactoring Transformations (MdJ, EV), pp. 40–59.
ASPLOS-2011-NguyenP #concurrent: Synthesizing concurrent schedulers for irregular algorithms (DN, KP), pp. 333–344.
CASE-2011-KalinovcicPBB #multi #scheduling: Modified Banker’s algorithm for scheduling in multi-AGV systems (LK, TP, SB, VB), pp. 351–356.
CASE-2011-MaiHHH #adaptation #performance #speech: A fast adaptive Kalman filtering algorithm for speech enhancement (QM, DH, YH, ZH), pp. 327–332.
CGO-2011-AnselWCOEA #compilation: Language and compiler support for auto-tuning variable-accuracy algorithms (JA, YLW, CPC, MO, AE, SPA), pp. 85–96.
DAC-2011-HsuSPCH #distributed #geometry #layout: A distributed algorithm for layout geometry operations (KTH, SS, YCP, CC, TYH), pp. 182–187.
DAC-2011-HuangY: An exact algorithm for the construction of rectilinear Steiner minimum trees among complex obstacles (TH, EFYY), pp. 164–169.
DAC-2011-KoseF #analysis #information retrieval #locality #performance: Fast algorithms for IR voltage drop analysis exploiting locality (SK, EGF), pp. 996–1001.
DAC-2011-LiuZYZ #3d: An integrated algorithm for 3D-IC TSV assignment (XL, YZ, GKY, XZ), pp. 652–657.
DAC-2011-MaYW: An optimal algorithm for layer assignment of bus escape routing on PCBs (QM, EFYY, MDFW), pp. 176–181.
DAC-2011-ShoaibJV #data-driven #energy #framework #monitoring #platform: A low-energy computation platform for data-driven biomedical monitoring algorithms (MS, NKJ, NV), pp. 591–596.
DATE-2011-AkinBNRSA #implementation #parallel: A high-performance parallel implementation of the Chambolle algorithm (AA, IB, AAN, VR, MDS, DA), pp. 1436–1441.
DATE-2011-BeltrameN #design #multi #platform: A multi-objective decision-theoretic exploration algorithm for platform-based design (GB, GN), pp. 1192–1195.
DATE-2011-ChrysanthouCSP #parallel: Parallel accelerators for GlimmerHMM bioinformatics algorithm (NC, GC, ES, IP), pp. 94–99.
DATE-2011-FalkZHT #clustering #data flow #embedded #performance #rule-based #synthesis: A rule-based static dataflow clustering algorithm for efficient embedded software synthesis (JF, CZ, CH, JT), pp. 521–526.
DATE-2011-FerreiraBCMM #process: Impact of process variation on endurance algorithms for wear-prone memories (APF, SB, BRC, RGM, DM), pp. 962–967.
DATE-2011-PaternaACPDB #energy #manycore #online #performance #platform: An efficient on-line task allocation algorithm for QoS and energy efficiency in multicore multimedia platforms (FP, AA, AC, FP, GD, LB), pp. 100–105.
DATE-2011-RoyRM #modelling #performance: Theoretical modeling of the Itoh-Tsujii Inversion algorithm for enhanced performance on k-LUT based FPGAs (SSR, CR, DM), pp. 1231–1236.
DATE-2011-SabatelliSFR #estimation #metric: A sensor fusion algorithm for an integrated angular position estimation with inertial measurement units (SS, FS, LF, AR), pp. 273–276.
DATE-2011-TsukiyamaF #analysis #statistics: An algorithm to improve accuracy of criticality in statistical static timing analysis (ST, MF), pp. 1529–1532.
DATE-2011-ZhiLZYZZ #multi #performance #scheduling: An efficient algorithm for multi-domain clock skew scheduling (YZ, WSL, HZ, CY, HZ, XZ), pp. 1364–1369.
DATE-2011-ZiermannTS #adaptation #named: DynOAA — Dynamic offset adaptation algorithm for improving response times of CAN systems (TZ, JT, ZS), pp. 269–272.
LCTES-2011-ChangH #low cost: A low-cost wear-leveling algorithm for block-mapping solid-state disks (LPC, LCH), pp. 31–40.
PDP-2011-EstradaCG #adaptation #architecture #manycore #optimisation #parallel #performance: Adaptive Parallel Interval Global Optimization Algorithms Based on their Performance for Non-dedicated Multicore Architectures (JFSE, LGC, IG), pp. 252–256.
PDP-2011-Gomez-IglesiasVCM #distributed #research: Distributed and Asynchronous Bees Algorithm Applied to Nuclear Fusion Research (AGI, MAVR, FC, MCM), pp. 365–372.
PDP-2011-HabibiAS #multi #network: Multicast-Aware Mapping Algorithm for On-chip Networks (AH, MA, HSA), pp. 455–462.
PDP-2011-LiHY #scheduling #workflow: A Deadline Satisfaction Enhanced Workflow Scheduling Algorithm (XL, ZH, CY), pp. 55–61.
PDP-2011-LiLTS #adaptation #parallel #problem: Adaptive and Cost-Optimal Parallel Algorithm for the 0-1 Knapsack Problem (KL, LL, TT, EHMS), pp. 537–544.
PDP-2011-MontesVRG: Accelerating Particle Swarm Algorithm with GPGPU (MCM, MAVR, JJRV, AGI), pp. 560–564.
PDP-2011-SaenkoK #mining #problem #search-based: Genetic Algorithms for Role Mining Problem (IS, IVK), pp. 646–650.
PDP-2011-SaezSCSC #architecture #simulation: Particle-in-Cell Algorithms for Plasma Simulations on Heterogeneous Architectures (XS, AS, JMC, ES, FC), pp. 385–389.
PDP-2011-SchlingmannGWU #manycore: Connectivity-Sensitive Algorithm for Task Placement on a Many-Core Considering Faulty Regions (SS, AG, SW, TU), pp. 417–422.
PDP-2011-VerbeekS #concurrent #network #performance #proving: A Fast and Verified Algorithm for Proving Store-and-Forward Networks Deadlock-Free (FV, JS), pp. 3–10.
PDP-2011-ZengTL #hybrid #memory management #transaction: Parallization of Adaboost Algorithm through Hybrid MPI/OpenMP and Transactional Memory (KZ, YT, FL), pp. 94–100.
PPoPP-2011-HassaanBP #comparison #order #parallel: Ordered vs. unordered: a comparison of parallelism and work-efficiency in irregular algorithms (MAH, MB, KP), pp. 3–12.
PPoPP-2011-HongKOO #graph: Accelerating CUDA graph algorithms at maximum warp (SH, SKK, TO, KO), pp. 267–276.
PPoPP-2011-MurarasuWBBP #data type #grid #scalability: Compact data structure and scalable algorithms for the sparse grid technique (AFM, JW, GB, DB, DP), pp. 25–34.
ESOP-2011-MurawskiT #game studies #semantics: Algorithmic Nominal Game Semantics (ASM, NT), pp. 419–438.
FoSSaCS-2011-Kobayashi #automaton #higher-order #linear #model checking #recursion: A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes (NK0), pp. 260–274.
STOC-2011-AdsulGMS #game studies #morphism #polynomial: Rank-1 bimatrix games: a homeomorphism and a polynomial time algorithm (BA, JG, RM, MAS), pp. 195–204.
STOC-2011-BrandaoCY #problem #quantum: A quasipolynomial-time algorithm for the quantum separability problem (FGSLB, MC, JY), pp. 343–352.
STOC-2011-Chuzhoy #graph #problem: An algorithm for the graph crossing number problem (JC), pp. 303–312.
STOC-2011-DemaineHK #composition #graph: Contraction decomposition in h-minor-free graphs and algorithmic applications (EDD, MH, KiK), pp. 441–450.
STOC-2011-FriedmannHZ #bound #random: Subexponential lower bounds for randomized pivoting rules for the simplex algorithm (OF, TDH, UZ), pp. 283–292.
STOC-2011-HansenKLMT #game studies #probability: Exact algorithms for solving stochastic games: extended abstract (KAH, MK, NL, PBM, EPT), pp. 205–214.
STOC-2011-ImmorlicaKLMPT: Dueling algorithms (NI, ATK, BL, AM, AP, MT), pp. 215–224.
STOC-2011-ItalianoNSW #graph: Improved algorithms for min cut and max flow in undirected planar graphs (GFI, YN, PS, CWN), pp. 313–322.
STOC-2011-KawarabayashiK #approximate #problem: Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two (KiK, YK), pp. 81–88.
STOC-2011-KawarabayashiW #composition #graph #proving: A simpler algorithm and shorter proof for the graph minor decomposition (KiK, PW), pp. 451–458.
STOC-2011-MoserS #satisfiability: A full derandomization of schöning’s k-SAT algorithm (RAM, DS), pp. 245–252.
STOC-2011-NovocinSV #complexity: An LLL-reduction algorithm with quasi-linear time complexity: extended abstract (AN, DS, GV), pp. 403–412.
STOC-2011-Yoshida #approximate #bound #csp: Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree CSP (YY), pp. 665–674.
TACAS-2011-ChengKLB #framework #game studies #platform #research: GAVS+: An Open Platform for the Research of Algorithmic Game Solving (CHC, AK, ML, CB), pp. 258–261.
CADE-2011-FredriksonCJ #analysis #approximate #behaviour #complexity: Dynamic Behavior Matching: A Complexity Analysis and New Approximation Algorithms (MF, MC, SJ), pp. 252–267.
CAV-2011-BuchholzHHZ #model checking: Model Checking Algorithms for CTMDPs (PB, EMH, HH, LZ), pp. 225–242.
CAV-2011-ChatterjeeHJS #analysis #automaton #markov #process: Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives (KC, MH, MJ, NS), pp. 260–276.
CAV-2011-JohnC #composition #equation #linear #quantifier: A Quantifier Elimination Algorithm for Linear Modular Equations and Disequations (AKJ, SC), pp. 486–503.
ICST-2011-HanselRHG #embedded #generative #realtime: An Evolutionary Algorithm for the Generation of Timed Test Traces for Embedded Real-Time Systems (JH, DR, PH, SG), pp. 170–179.
LICS-2011-LeC #formal method #random: Formalizing Randomized Matching Algorithms (DTML, SAC), pp. 185–194.
SAT-2011-JanotaS: Abstraction-Based Algorithm for 2QBF (MJ, JPMS), pp. 230–244.
SAT-2011-MalitskySSS #satisfiability: Non-Model-Based Algorithm Portfolios for SAT (YM, AS, HS, MS), pp. 369–370.
SAT-2011-SilvaL #on the: On Improving MUS Extraction Algorithms (JPMS, IL), pp. 159–173.
SAT-2011-Williams #bound #complexity #satisfiability: Connecting SAT Algorithms and Complexity Lower Bounds (RW), pp. 1–2.
VMCAI-2011-HooimeijerV #analysis #automaton #evaluation #string: An Evaluation of Automata Algorithms for String Analysis (PH, MV), pp. 248–262.
DocEng-2010-Hassan #evaluation #recognition #towards: Towards a common evaluation strategy for table structure recognition algorithms (TH), pp. 255–258.
DRR-2010-BelaidMR #documentation #modelling: Improved CHAID algorithm for document structure modelling (AB, TM, YR), pp. 1–10.
PODS-2010-GrecoS #consistency #power of: The power of tree projections: local consistency, greedy algorithms, and larger islands of tractability (GG, FS), pp. 327–338.
PODS-2010-KaneNW #problem: An optimal algorithm for the distinct elements problem (DMK, JN, DPW), pp. 41–52.
PODS-2010-LemayMN #learning #top-down #xml: A learning algorithm for top-down XML transformations (AL, SM, JN), pp. 285–296.
SIGMOD-2010-Amer-YahiaDKKF #big data: Crowds, clouds, and algorithms: exploring the human side of “big data” applications (SAY, AD, JMK, NK, MJF), pp. 1259–1260.
SIGMOD-2010-BlanasPERST #comparison #pipes and filters: A comparison of join algorithms for log processing in MaPreduce (SB, JMP, VE, JR, EJS, YT), pp. 975–986.
SIGMOD-2010-ParameswaranKBG #mining #named #precedence #recommendation: Recsplorer: recommendation algorithms based on precedence mining (AGP, GK, BB, HGM), pp. 87–98.
SIGMOD-2010-TranPLDL #data type #named #nondeterminism: PODS: a new model and processing algorithms for uncertain data streams (TTLT, LP, BL, YD, AL), pp. 159–170.
SIGMOD-2010-WangWLW #approach #summary: An algorithmic approach to event summarization (PW, HW, ML, WW), pp. 183–194.
VLDB-2010-MahPC #functional #named #realtime #set: UASMAs: a set of algorithms to instantaneously map SNPs in real time to aid functional SNP discovery (JM, DP, SC), pp. 1406–1413.
VLDB-2010-SadoghiJLSS #configuration management #hardware #performance: Efficient Event Processing through Reconfigurable Hardware for Algorithmic Trading (MS, HAJ, ML, WS, HS), pp. 1525–1528.
EDM-2010-NugentDA #automation #clustering #set #specification: Skill Set Profile Clustering: The Empty K-Means Algorithm with Automatic Specification of Starting Cluster Centers (RN, ND, EA), pp. 151–160.
EDM-2010-PardosH #convergence #modelling #navigation #parametricity #visualisation: Navigating the parameter space of Bayesian Knowledge Tracing models: Visualizations of the convergence of the Expectation Maximization algorithm (ZAP, NTH), pp. 161–170.
EDM-2010-SongmuangU #multi: Multiple Test Forms Construction based on Bees Algorithm (PS, MU), pp. 321–322.
ITiCSE-2010-LeeR #category theory #design #learning #visualisation: Integrating categories of algorithm learning objective into algorithm visualization design: a proposal (MHL, GR), pp. 289–293.
ICPC-2010-ScannielloDDD #clustering #using: Using the Kleinberg Algorithm and Vector Space Model for Software System Clustering (GS, AD, CD, TD), pp. 180–189.
ICPC-2010-ShternT #clustering #on the: On the Comparability of Software Clustering Algorithms (MS, VT), pp. 64–67.
ICPC-2010-Taherkhani #classification #sorting: Recognizing Sorting Algorithms with the C4.5 Decision Tree Classifier (AT), pp. 72–75.
ICSM-2010-InsaS #debugging #java: An algorithmic debugger for Java (DI, JS), pp. 1–6.
CIAA-2010-CastiglioneNS #automaton #product line: A Challenging Family of Automata for Classical Minimization Algorithms (GC, CN, MS), pp. 251–260.
DLT-2010-BenschBD: Algorithmic Properties of Millstream Systems (SB, HB, FD), pp. 54–65.
DLT-2010-Okhotin #boolean grammar #parsing #performance: Fast Parsing for Boolean Grammars: A Generalization of Valiant’s Algorithm (AO), pp. 340–351.
ICALP-v1-2010-BansalKN #scalability #scheduling: Better Scalable Algorithms for Broadcast Scheduling (NB, RK, VN), pp. 324–335.
ICALP-v1-2010-FakcharoenpholLN #performance #problem: Faster Algorithms for Semi-matching Problems (JF, BL, DN), pp. 176–187.
ICALP-v1-2010-GuptaNR #optimisation #robust: Thresholded Covering Algorithms for Robust and Max-min Optimization (AG, VN, RR), pp. 262–274.
ICALP-v1-2010-GuptaNR10a #adaptation #approximate #problem: Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems (AG, VN, RR), pp. 690–701.
ICALP-v1-2010-HalldorssonHLS #independence #set #streaming: Streaming Algorithms for Independent Sets (BVH, MMH, EL, MS), pp. 641–652.
ICALP-v1-2010-MakarychevMS #approximate #polynomial #problem #reduction: Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm (KM, RM, MS), pp. 594–604.
ICALP-v1-2010-RudraU #data type #testing: Data Stream Algorithms for Codeword Testing (AR, SU), pp. 629–640.
ICALP-v2-2010-BansalJKN #approximate #ranking: Approximation Algorithms for Diversified Search Ranking (NB, KJ, AK, JN), pp. 273–284.
ICALP-v2-2010-EvenM #online #random: An O(logn)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines (GE, MM), pp. 139–150.
ICALP-v2-2010-Wattenhofer #physics: Physical Algorithms (RW), pp. 38–51.
LATA-2010-Arslan #performance #sequence #string: A Fast Longest Common Subsequence Algorithm for Similar Strings (ANA), pp. 82–93.
LATA-2010-MarschallR #analysis #automaton #pattern matching #probability: Exact Analysis of Horspool’s and Sunday’s Pattern Matching Algorithms with Probabilistic Arithmetic Automata (TM, SR), pp. 439–450.
IFM-2010-BouchenebIN #model checking #replication: Symbolic Model-Checking of Optimistic Replication Algorithms (HB, AI, MN), pp. 89–104.
RTA-2010-LevyV #performance #unification: An Efficient Nominal Unification Algorithm (JL, MV), pp. 209–226.
ICFP-2010-Blelloch #functional #parallel: Functional parallel algorithms (GEB), pp. 247–248.
CIG-2010-CardamoneLLB #search-based #using: Searching for the optimal racing line using genetic algorithms (LC, DL, PLL, APB), pp. 388–394.
CIG-2010-TeytaudT #monte carlo #on the: On the huge benefit of decisive moves in Monte-Carlo Tree Search algorithms (FT, OT), pp. 359–364.
CHI-2010-LeeSL #adaptation #evaluation: An adaptive speed-call list algorithm and its evaluation with ESM (SL, JS, GL), pp. 2019–2022.
CSCW-2010-ShaoLG #mobile #sequence: A sequence transformation algorithm for supporting cooperative work on mobile devices (BS, DL, NG), pp. 159–168.
SOFTVIS-2010-AlbrechtEHK #automation #layout #process: An automatic layout algorithm for BPEL processes (BA, PE, MH, MK), pp. 173–182.
ICEIS-AIDSS-2010-Chatzinikolaou #adaptation #coordination #design #distributed #evolution #search-based #self: Coordinating Evolution — Designing a Self-adapting Distributed Genetic Algorithm (NC), pp. 13–20.
ICEIS-AIDSS-2010-KuhnDGC #ontology #sequence: KBE Template Update Propagation Support — Ontology and Algorithm for Update Sequence Computation (OK, TD, PG, PC), pp. 5–12.
ICEIS-AIDSS-2010-LafuenteP: Algorithm Applied in the Prioritisation of the Stakeholders (AMGL, LBdP), pp. 181–186.
ICEIS-AIDSS-2010-MianiYSF #optimisation #process #semantics: NARFO* Algorithm — Optimizing the Process of Obtaining Non-redundant and Generalized Semantic Association Rules (RGM, CAY, MTPS, VRTF), pp. 320–325.
ICEIS-AIDSS-2010-Moghadampour #search-based: Male and Female Chromosomes in Genetic Algorithms (GM), pp. 220–225.
ICEIS-DISI-2010-KalsingTI #incremental #mining #process: An Incremental Process Mining Algorithm (AK, LHT, CI), pp. 263–268.
ICEIS-DISI-2010-MoraesZF #concept #distributed: A Distributed Algorithm for Formal Concepts Processing based on Search Subspaces (NRMdM, LEZ, HCF), pp. 105–111.
ICEIS-J-2010-Chatzinikolaou10a #adaptation #architecture #coordination #evolution #peer-to-peer #search-based #self: Coordinating Evolution: An Open, Peer-to-Peer Architecture for a Self-adapting Genetic Algorithm (NC), pp. 164–176.
CIKM-2010-ChenJPL #database #mining #performance #scalability: An efficient algorithm for mining time interval-based patterns in large database (YCC, JCJ, WCP, SYL), pp. 49–58.
CIKM-2010-ChrysakisCP #evaluation #network #peer-to-peer #query #using: Evaluation of top-k queries in peer-to-peer networks using threshold algorithms (IC, CC, DP), pp. 1305–1308.
CIKM-2010-CormodeKW #dataset #scalability #set: Set cover algorithms for very large datasets (GC, HJK, AW), pp. 479–488.
CIKM-2010-DillonC #feedback #framework #optimisation #pseudo #robust: A unified optimization framework for robust pseudo-relevance feedback algorithms (JVD, KCT), pp. 1069–1078.
CIKM-2010-GargNB #memory management #performance #realtime: Real-time memory efficient data redundancy removal algorithm (VKG, AN, SB), pp. 1259–1268.
CIKM-2010-GyllstromM #delivery #towards #web: Wisdom of the ages: toward delivering the children’s web with the link-based agerank algorithm (KG, MFM), pp. 159–168.
CIKM-2010-HeMW #evaluation #learning #metric #optimisation #rank: Directly optimizing evaluation measures in learning to rank based on the clonal selection algorithm (QH, JM, SW), pp. 1449–1452.
CIKM-2010-HuangSHDSL #clustering #community #detection #named #network: SHRINK: a structural clustering algorithm for detecting hierarchical communities in networks (JH, HS, JH, HD, YS, YL), pp. 219–228.
CIKM-2010-MassSS #information retrieval: A peer-selection algorithm for information retrieval (YM, YS, MSS), pp. 1601–1604.
CIKM-2010-VijayalakshmiMMDRM #search-based #using: Intelligent sales forecasting engine using genetic algorithms (MV, BM, RM, AD, RR, KM), pp. 1669–1672.
ECIR-2010-AgarwalC #information retrieval #ranking: Maximum Margin Ranking Algorithms for Information Retrieval (SA, MC), pp. 332–343.
ECIR-2010-AthanasakosSJ #automation #framework #image: A Framework for Evaluating Automatic Image Annotation Algorithms (KA, VS, JMJ), pp. 217–228.
ICML-2010-BardenetK #optimisation: Surrogating the surrogate: accelerating Gaussian-process-based global optimization with a mixture cross-entropy algorithm (RB, BK), pp. 55–62.
ICML-2010-Carreira-Perpinan #reduction: The Elastic Embedding Algorithm for Dimensionality Reduction (MÁCP), pp. 167–174.
ICML-2010-CortesMR #kernel #learning: Two-Stage Learning Kernel Algorithms (CC, MM, AR), pp. 239–246.
ICML-2010-DuchiMJ #consistency #on the #ranking: On the Consistency of Ranking Algorithms (JCD, LWM, MIJ), pp. 327–334.
ICML-2010-FaivishevskyG #clustering #parametricity: Nonparametric Information Theoretic Clustering Algorithm (LF, JG), pp. 351–358.
ICML-2010-JaggiS #problem: A Simple Algorithm for Nuclear Norm Regularized Problems (MJ, MS), pp. 471–478.
ICML-2010-KimSD #scalability: A scalable trust-region algorithm with application to mixed-norm regression (DK, SS, ISD), pp. 519–526.
ICML-2010-LazaricGM #analysis #classification #policy: Analysis of a Classification-based Policy Iteration Algorithm (AL, MG, RM), pp. 607–614.
ICML-2010-TomiokaSSK #learning #matrix #performance #rank: A Fast Augmented Lagrangian Algorithm for Learning Low-Rank Matrices (RT, TS, MS, HK), pp. 1087–1094.
ICPR-2010-AbergW #3d #clustering: A Memetic Algorithm for Selection of 3D Clustered Features with Applications in Neuroscience (MBÅ, JW), pp. 1076–1079.
ICPR-2010-AroraS #learning #performance: An Efficient and Stable Algorithm for Learning Rotations (RA, WAS), pp. 2993–2996.
ICPR-2010-BaldacciBD #3d #bound #design #framework #graph #segmentation: Oriented Boundary Graph: A Framework to Design and Implement 3D Segmentation Algorithms (FB, AJPB, JPD), pp. 1116–1119.
ICPR-2010-CalanaROD #difference #prototype #representation #search-based: Prototype Selection for Dissimilarity Representation by a Genetic Algorithm (YPC, EBGR, MOA, RPWD), pp. 177–180.
ICPR-2010-CetinH #adaptation #estimation #video: An Adaptive True Motion Estimation Algorithm for Frame Rate Conversion of High Definition Video (MC, IH), pp. 4109–4112.
ICPR-2010-Chicheva #2d #data transformation #parallel #representation: Parallel Algorithm of Two-Dimensional Discrete Cosine Transform Based on Special Data Representation (MAC), pp. 2326–2328.
ICPR-2010-DitzlerPC #incremental #learning: An Incremental Learning Algorithm for Non-stationary Environments and Class Imbalance (GD, RP, NVC), pp. 2997–3000.
ICPR-2010-FahnC #realtime #recognition: Real-Time Upper-Limbs Posture Recognition Based on Particle Filters and AdaBoost Algorithms (CSF, SLC), pp. 3854–3857.
ICPR-2010-FerrerB #approximate #graph: An Iterative Algorithm for Approximate Median Graph Computation (MF, HB), pp. 1562–1565.
ICPR-2010-GlumovM #image #robust #scalability: The New Blockwise Algorithm for Large-Scale Images Robust Watermarking (NIG, VAM), pp. 1453–1456.
ICPR-2010-GranaBC #performance: Decision Trees for Fast Thinning Algorithms (CG, DB, RC), pp. 2836–2839.
ICPR-2010-GriniasKT #interactive #segmentation: Flooding and MRF-based Algorithms for Interactive Segmentation (IG, NK, GT), pp. 3943–3946.
ICPR-2010-HarirchiRMDG #detection #using: Two-Level Algorithm for MCs Detection in Mammograms Using Diverse-Adaboost-SVM (FH, PR, HAM, FD, MG), pp. 269–272.
ICPR-2010-HasanbelliuGP #kernel #online #recursion: A Recursive Online Kernel PCA Algorithm (EH, LGSG, JCP), pp. 169–172.
ICPR-2010-JouiliTL #clustering #graph: Median Graph Shift: A New Clustering Algorithm for Graph Domain (SJ, ST, VL), pp. 950–953.
ICPR-2010-KimKP #generative #simulation: A Simulation Study on the Generative Neural Ensemble Decoding Algorithms (SPK, MKK, GTP), pp. 3797–3800.
ICPR-2010-KopenkovM #performance #recursion #research: Research the Performance of a Recursive Algorithm of the Local Discrete Wavelet Transform (VNK, VVM), pp. 4452–4455.
ICPR-2010-LeeCL #data-driven #graph #markov #monte carlo #using: A Graph Matching Algorithm Using Data-Driven Markov Chain Monte Carlo Sampling (JL, MC, KML), pp. 2816–2819.
ICPR-2010-MicoO #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-Mirzaei #clustering #multi #novel: A Novel Multi-view Agglomerative Clustering Algorithm Based on Ensemble of Partitions on Different Views (HM), pp. 1007–1010.
ICPR-2010-NacereddineTZH10a #image #modelling #segmentation #symmetry: Asymmetric Generalized Gaussian Mixture Models and EM Algorithm for Image Segmentation (NN, ST, DZ, LH), pp. 4557–4560.
ICPR-2010-NishidaKOH #using #visual notation: Visual Tracking Algorithm Using Pixel-Pair Feature (KN, TK, YO, MH), pp. 1808–1811.
ICPR-2010-NovoSPF #modelling #multi #optimisation: Optimization of Topological Active Models with Multiobjective Evolutionary Algorithms (JN, JSR, MGP, AF), pp. 2226–2229.
ICPR-2010-PhilippotBB #classification #learning #network #online: Bayesian Networks Learning Algorithms for Online Form Classification (EP, YB, AB), pp. 1981–1984.
ICPR-2010-SoltanaACA #adaptation #search-based #using: Adaptive Feature and Score Level Fusion Strategy Using Genetic Algorithms (WBS, MA, LC, CBA), pp. 4316–4319.
ICPR-2010-SomolGP #feature model #problem #set: The Problem of Fragile Feature Subset Preference in Feature Selection Methods and a Proposal of Algorithmic Workaround (PS, JG, PP), pp. 4396–4399.
ICPR-2010-StadelmannWSEF #design #development #speech: Rethinking Algorithm Design and Development in Speech Processing (TS, YW, MS, RE, BF), pp. 4476–4479.
ICPR-2010-SuzukiIAT #estimation #image #using: A Scale Estimation Algorithm Using Phase-Based Correspondence Matching for Electron Microscope Images (AS, KI, TA, RT), pp. 2420–2423.
ICPR-2010-TakasuFA #similarity: A Variational Bayesian EM Algorithm for Tree Similarity (AT, DF, TA), pp. 1056–1059.
ICPR-2010-TasdizenH #estimation #recursion #video: Recursive Dynamically Variable Step Search Motion Estimation Algorithm for High Definition Video (OT, IH), pp. 2354–2357.
ICPR-2010-VuLB #clustering #constraints #performance: An Efficient Active Constraint Selection Algorithm for Clustering (VVV, NL, BBM), pp. 2969–2972.
ICPR-2010-XiongOL #composition #recursion: A Recursive and Model-Constrained Region Splitting Algorithm for Cell Clump Decomposition (WX, SHO, JHL), pp. 4416–4419.
ICPR-2010-YoonW: Improved Mean Shift Algorithm with Heterogeneous Node Weights (JWY, SPW), pp. 4222–4225.
KDD-2010-DasMSO #case study #detection #kernel #learning #multi #safety: Multiple kernel learning for heterogeneous anomaly detection: algorithm and aviation safety case study (SD, BLM, ANS, NCO), pp. 47–56.
KDD-2010-LiLZ #collaboration #concept #correlation: Negative correlations in collaboration: concepts and algorithms (JL, QL, TZ), pp. 463–472.
KDD-2010-LiuYY #performance #problem: An efficient algorithm for a class of fused lasso problems (JL, LY, JY), pp. 323–332.
KDD-2010-MarchRG #analysis #performance: Fast euclidean minimum spanning tree: algorithm, analysis, and applications (WBM, PR, AGG), pp. 603–612.
KDD-2010-TsengWSY #mining #named #performance: UP-Growth: an efficient algorithm for high utility itemset mining (VST, CWW, BES, PSY), pp. 253–262.
KDD-2010-WangC #linear #modelling #performance: An efficient causal discovery algorithm for linear models (ZW, LC), pp. 1109–1118.
KDD-2010-WangCSX #mining #mobile #network #social: Community-based greedy algorithm for mining top-K influential nodes in mobile social networks (YW, GC, GS, KX), pp. 1039–1048.
KDIR-2010-GokceA #trade-off: A Tradeoff Balancing Algorithm for Hiding Sensitive Frequent Itemsets (HG, OA), pp. 200–205.
KDIR-2010-GudysS: An Algorithm for Decision Rules Aggregation (AG, MS), pp. 216–225.
KDIR-2010-TsaiHYC #clustering #performance: An Efficient PSO-based Clustering Algorithm (CWT, KWH, CSY, MCC), pp. 150–155.
KEOD-2010-LeraJP #ambiguity #concept #ontology #semantics: Unsupervised Algorithm for the Concept Disambiguation in Ontologies — Semantic Rules and Voting System to Determine Suitable Senses (IL, CJ, RP), pp. 388–391.
KR-2010-DvorakPW #parametricity #towards: Towards Fixed-Parameter Tractable Algorithms for Argumentation (WD, RP, SW).
RecSys-2010-AdomaviciusZ #on the #recommendation: On the stability of recommendation algorithms (GA, JZ), pp. 47–54.
RecSys-2010-BerkovskyFCB #game studies #process #recommendation: Recommender algorithms in activity motivating games (SB, JF, MC, DB), pp. 175–182.
RecSys-2010-Burke #recommendation: Evaluating the dynamic properties of recommendation algorithms (RDB), pp. 225–228.
RecSys-2010-CremonesiKT #performance #recommendation: Performance of recommender algorithms on top-n recommendation tasks (PC, YK, RT), pp. 39–46.
RecSys-2010-MarxHM #comprehension #hybrid #recommendation: Increasing consumers’ understanding of recommender results: a preference-based hybrid algorithm with strong explanatory power (PM, THT, AM), pp. 297–300.
RecSys-2010-PessemierDDM #collaboration #dependence #quality: Time dependency of data quality for collaborative filtering algorithms (TDP, SD, TD, LM), pp. 281–284.
SEKE-2010-AbuzeidHT #performance #reduction #testing: FLAT A Fast Lattice-Based Algorithm for Test Suite Reduction (ARA, HSH, IAHT), p. 67.
SEKE-2010-AndresMN #multi #search-based #testing: Multi-objective Genetic Algorithms: Construction and Recombination of Passive Testing Properties (CA, MGM, MN), pp. 405–410.
SEKE-2010-BackerM #network: Evaluating the Weighted Sum Algorithm for Estimating Conditional Probabilities in Bayesian Networks (SB, EM), pp. 319–324.
SIGIR-2010-CaiZDC #similarity: Closed form solution of similarity algorithms (YC, MZ, CHQD, SC), pp. 709–710.
SIGIR-2010-LiL #clustering #named: HCC: a hierarchical co-clustering algorithm (JL, TL), pp. 861–862.
SIGIR-2010-SallesRPMMG #classification #documentation: Temporally-aware algorithms for document classification (TS, LCdR, GLP, FM, WMJ, MAG), pp. 307–314.
SIGIR-2010-SinglaWH #web: Studying trailfinding algorithms for enhanced web search (AS, RW, JH), pp. 443–450.
ECMFA-2010-Balderas-ContrerasGC #uml: A UML 2.0 Profile to Model Block Cipher Algorithms (TBC, GRG, RC), pp. 20–31.
AdaEurope-2010-AlbertosCSF #co-evolution #design #implementation: Control Co-design: Algorithms and Their Implementation (PA, AC, JES, AF), pp. 19–40.
AdaEurope-2010-AnderssonP #ada #implementation #manycore #realtime #scheduling #using: Implementing Multicore Real-Time Scheduling Algorithms Based on Task Splitting Using Ada 2012 (BA, LMP), pp. 54–67.
LOPSTR-2010-GiorginoSMP #graph #verification: Verification of the Schorr-Waite Algorithm — From Trees to Graphs (MG, MS, RM, MP), pp. 67–83.
LOPSTR-2010-InsaS #debugging #execution #scalability: Scaling Up Algorithmic Debugging with Virtual Execution Trees (DI, JS), pp. 149–163.
POPL-2010-JimMW #semantics: Semantics and algorithms for data-dependent grammars (TJ, YM, DW), pp. 417–430.
SAC-OOPS-J-2008-PirkelbauerPMS10 #concept #runtime: Dynamic algorithm selection for runtime concepts (PP, SP, MM, BS), pp. 773–786.
SAC-PL-J-2008-DennyM10 #generative #lr #parsing: The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution (JED, BAM), pp. 943–979.
ASE-2010-DuleySK #difference: A program differencing algorithm for verilog HDL (AD, CS, MK), pp. 477–486.
SAC-2010-AquinoOW #network: A wavelet-based sampling algorithm for wireless sensor networks applications (ALLdA, RARO, EFW), pp. 1604–1608.
SAC-2010-AyyappanWN #constraints #learning #named #network #scalability: MICHO: a scalable constraint-based algorithm for learning Bayesian networks (MA, YKW, WKN), pp. 985–989.
SAC-2010-BaeAVNB #performance #search-based: Convex onion peeling genetic algorithm: an efficient solution to map labeling of point-feature (WDB, SA, PV, SN, KYB), pp. 892–899.
SAC-2010-BaudetD #permutation: An improved algorithm to enumerate all traces that sort a signed permutation by reversals (CB, ZD), pp. 1521–1525.
SAC-2010-BlundoC #mining: A simple role mining algorithm (CB, SC), pp. 1958–1962.
SAC-2010-Chen #query: A time optimal algorithm for evaluating tree pattern queries (YC), pp. 1638–1642.
SAC-2010-GuoH #clustering: A two stage yard crane workload partitioning and job sequencing algorithm for container terminals (XG, SYH), pp. 2383–2388.
SAC-2010-HautakorpiM #network #using: Load balancing for structured P2P networks using the advanced finger selection algorithm (AFSA) (JH, JM), pp. 655–662.
SAC-2010-HoL #constraints: Simulated annealing based algorithm for smooth robot path planning with different kinematic constraints (YJH, JSL), pp. 1277–1281.
SAC-2010-LanLSH #classification #image #using: An improved K-view algorithm for image texture classification using new characteristic views selection methods (YL, HL, ES, CCH), pp. 959–963.
SAC-2010-LeeST #database #incremental #performance: An incremental algorithm for efficient unique signature discoveries on DNA databases (HPL, TFS, CYT), pp. 1506–1510.
SAC-2010-LinsOTFT #documentation: A dewarping algorithm to compensate volume binding distortion in scanned documents (RDL, DMdO, GT, JF, MT), pp. 61–62.
SAC-2010-LlorensOST #control flow #graph: An algorithm to generate the context-sensitive synchronized control flow graph (ML, JO, JS, ST), pp. 2144–2148.
SAC-2010-MatteoPTV #ambiguity #clustering #folksonomy: Of mice and terms: clustering algorithms on ambiguous terms in folksonomies (NRDM, SP, FT, FV), pp. 844–848.
SAC-2010-OssaPSG #graph #low cost #predict #web: Referrer graph: a low-cost web prediction algorithm (BdlO, AP, JS, JAG), pp. 831–838.
SAC-2010-PortugalR #clustering #graph #multi #using: MSP algorithm: multi-robot patrolling based on territory allocation using balanced graph partitioning (DP, RPR), pp. 1271–1276.
SAC-2010-RomaniAZCTT #mining #named: CLEARMiner: a new algorithm for mining association patterns on heterogeneous time series from climate data (LASR, AMHdÁ, JZJ, RC, CTJ, AJMT), pp. 900–905.
SAC-2010-SchiperP #flexibility #multi #performance: Fast, flexible, and highly resilient genuine fifo and causal multicast algorithms (NS, FP), pp. 418–422.
SAC-2010-TeixeiraG #network #scheduling: Uplink scheduling algorithm with dynamic polling management in IEEE 802.16 broadband wireless networks (MAT, PRG), pp. 601–602.
SAC-2010-ToledoOOP #parallel #problem #scheduling #search-based: Parallel genetic algorithm approaches applied to solve a synchronized and integrated lot sizing and scheduling problem (CFMT, LdO, RRRdO, MRP), pp. 1148–1152.
SAC-2010-WangLZY: An indoor tracking algorithm with the virtual reference based positioning (YW, JL, JZ, LY), pp. 568–574.
LDTA-2009-DennisJW10 #analysis #automation #memory management #named: SLAMM — Automating Memory Analysis for Numerical Algorithms (JMD, ERJ, WMW), pp. 89–104.
CASE-2010-ChoiTGLNJK #web: Web register control algorithm for roll-to-roll system based printed electronics (KHC, TTT, PG, KHL, MNN, JDJ, DSK), pp. 867–872.
CASE-2010-HassanzadehMB #mobile #optimisation: Mobile robot path planning based on shuffled frog leaping optimization algorithm (IH, KM, MAB), pp. 680–685.
CASE-2010-SunCL #scheduling #using: Scheduling of steel-making and continuous casting system using the surrogate subgradient algorithm for lagrangian relaxation (LS, TC, PBL), pp. 885–890.
CASE-2010-TaoW #3d #constraints #heuristic #problem: A new packing heuristic based algorithm for Vehicle Routing Problem with Three-dimensional Loading constraints (YT, FW), pp. 972–977.
CASE-2010-XuSY #problem: Exact algorithms for non-overlapping 2-frame problem with non-partial coverage for networked robotic cameras (YX, DS, JY), pp. 503–508.
CC-2010-DingO #representation #strict: Unrestricted Code Motion: A Program Representation and Transformation Algorithms Based on Future Values (SD, SÖ), pp. 26–45.
CC-2010-NaeemLR: Practical Extensions to the IFDS Algorithm (NAN, OL, JR), pp. 124–144.
DAC-2010-ChippaMRRC #design #energy #hardware #performance #scalability: Scalable effort hardware design: exploiting algorithmic resilience for energy efficiency (VKC, DM, AR, KR, STC), pp. 555–560.
DAC-2010-Coudert #performance #verification: An efficient algorithm to verify generalized false paths (OC), pp. 188–193.
DAC-2010-KinsmanN #design #hardware #robust: Robust design methods for hardware accelerators for iterative algorithms in scientific computing (ABK, NN), pp. 254–257.
DAC-2010-KongMYW: An optimal algorithm for finding disjoint rectangles and its application to PCB routing (HK, QM, TY, MDFW), pp. 212–217.
DAC-2010-LiuYT #analysis #performance #robust #scalability: A robust periodic arnoldi shooting algorithm for efficient analysis of large-scale RF/MM ICs (XL, HY, SXDT), pp. 573–578.
DAC-2010-ShenTX #analysis #correlation #linear #power management #statistics: A linear algorithm for full-chip statistical leakage power analysis considering weak spatial correlation (RS, SXDT, JX), pp. 481–486.
DAC-2010-ThongN #constant #multi #novel: A novel optimal single constant multiplication algorithm (JT, NN), pp. 613–616.
DAC-2010-XiaoSH: A universal state-of-charge algorithm for batteries (BX, YS, LH), pp. 687–692.
DAC-2010-XiongW #constraints #grid #linear #performance #power management #verification: An efficient dual algorithm for vectorless power grid verification under linear current constraints (XX, JW), pp. 837–842.
DATE-2010-AliARA #design #energy #evaluation #predict: Evaluation and design exploration of solar harvested-energy prediction algorithm (MIA, BMAH, JR, DA), pp. 142–147.
DATE-2010-ChenDS #analysis: Properties of and improvements to time-domain dynamic thermal analysis algorithms (XC, RPD, LS), pp. 1165–1170.
DATE-2010-CongHJ #behaviour #pattern matching #pattern recognition #recognition #synthesis: A generalized control-flow-aware pattern recognition algorithm for behavioral synthesis (JC, HH, WJ), pp. 1255–1260.
DATE-2010-JanapsatyaIPP #adaptation #policy: Dueling CLOCK: Adaptive cache replacement policy based on the CLOCK algorithm (AJ, AI, JP, SP), pp. 920–925.
DATE-2010-LiuTQ #constraints #performance #power management: Enhanced Q-learning algorithm for dynamic power management with performance constraint (WL, YT, QQ), pp. 602–605.
DATE-2010-LuckenbillLHMH #analysis #fault #logic #named #reliability: RALF: Reliability Analysis for Logic Faults — An exact algorithm and its applications (SBL, JYL, YH, RM, LH), pp. 783–788.
DATE-2010-Mirza-AghatabarBG #pipes and filters: Algorithms to maximize yield and enhance yield/area of pipeline circuitry by insertion of switches and redundant modules (MMA, MAB, SKG), pp. 1249–1254.
DATE-2010-PakerEB #architecture #low cost #multi #standard: A low cost multi-standard near-optimal soft-output sphere decoder: Algorithm and architecture (ÖP, SE, AB), pp. 1402–1407.
DATE-2010-SterponeB #multi: A new placement algorithm for the mitigation of multiple cell upsets in SRAM-based FPGAs (LS, NB), pp. 1231–1236.
DATE-2010-UgryumovaS #modelling #on the: On passivity of the super node algorithm for EM modeling of interconnect systems (MVU, WHAS), pp. 471–476.
DATE-2010-Zhu #multi #realtime: Retiming multi-rate DSP algorithms to meet real-time requirement (XYZ), pp. 1785–1790.
HPCA-2010-KimHMH #memory management #multi #named #scalability #scheduling: ATLAS: A scalable and high-performance scheduling algorithm for multiple memory controllers (YK, DH, OM, MHB), pp. 1–12.
PDP-2010-AllaniLGR #multi #named #reliability #scalability: RASM: A Reliable Algorithm for Scalable Multicast (MA, JL, BG, LETR), pp. 137–144.
PDP-2010-ArmasLM #2d #parallel #problem: Fine and Coarse-grained Parallel Algorithms for the 2D Cutting Stock Problem (JdA, CL, GM), pp. 255–262.
PDP-2010-BaldoGFR #re-engineering: Ultra-fast Tomographic Reconstruction with a Highly Optimized Weighted Back-Projection Algorithm (JIAB, EMG, IGF, JJF), pp. 281–285.
PDP-2010-BittencourtSM #graph #lookahead #scheduling #using: DAG Scheduling Using a Lookahead Variant of the Heterogeneous Earliest Finish Time Algorithm (LFB, RS, ERMM), pp. 27–34.
PDP-2010-DAgostinoCMCM #image #parallel #representation: A Parallel Algorithm for Molecular Surface Matching Through Image Representation (DD, AC, IM, PC, LM), pp. 387–394.
PDP-2010-Gomez-IglesiasVCCM #grid #research: Artificial Bee Colony Inspired Algorithm Applied to Fusion Research in a Grid Computing Environment (AGI, MAVR, FC, MCM, EMR), pp. 508–512.
PDP-2010-LeytonP #manycore #named #programming: Skandium: Multi-core Programming with Algorithmic Skeletons (ML, JMP), pp. 289–296.
PDP-2010-PinhoRS #biology #optimisation #parallel #process: Pluggable Parallelization of Evolutionary Algorithms Applied to the Optimization of Biological Processes (JHMdP, MFdAPdR, JLFS), pp. 395–402.
PDP-2010-Santana-SantanaCCR #information management #library: Load Balancing Algorithms with Partial Information Management for the DLML Library (JSS, MACG, MAC, GRA), pp. 64–68.
PDP-2010-SerafinoR #on the #parallel #search-based: On the Application of Multiple-Deme Parallel Genetic Algorithms in Astrophysics (DdS, FR), pp. 231–237.
PDP-2010-TaktakED #network #polynomial: A Polynomial Algorithm to Prove Deadlock-Freeness of Wormhole Networks (ST, EE, JLD), pp. 121–128.
PPoPP-2010-AliMP #communication #modelling: Modeling advanced collective communication algorithms on cell-based systems (QA, SPM, VSP), pp. 293–304.
PPoPP-2010-LiuL #locality #parallel: Improving parallelism and locality with asynchronous algorithms (LL, ZL), pp. 213–222.
FoSSaCS-2010-ToL #decidability #infinity #ltl #model checking: Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems (AWT, LL), pp. 221–236.
STOC-2010-CardinalFJJM #sorting: Sorting under partial information (without the ellipsoid algorithm) (JC, SF, GJ, RMJ, JIM), pp. 359–368.
STOC-2010-HartlineL #design: Bayesian algorithmic mechanism design (JDH, BL), pp. 301–310.
STOC-2010-KawarabayashiW #graph #proving #theorem: A shorter proof of the graph minor algorithm: the unique linkage theorem (KiK, PW), pp. 687–694.
STOC-2010-Madry #approximate #graph #multi #performance #problem: Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms (AM), pp. 121–130.
STOC-2010-MicciancioV #exponential #problem: A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations (DM, PV), pp. 351–358.
STOC-2010-Montanari #message passing: Message passing algorithms: a success looking for theoreticians (AM), pp. 37–38.
STOC-2010-Orlin: Improved algorithms for computing fisher’s market clearing prices: computing fisher’s market clearing prices (JBO), pp. 291–300.
TACAS-2010-DoyenR #automaton #finite: Antichain Algorithms for Finite Automata (LD, JFR), pp. 2–22.
TACAS-2010-GoreKP #algebra #logic: Optimal Tableau Algorithms for Coalgebraic Logics (RG, CK, DP), pp. 114–128.
CAV-2010-Michael #concurrent #memory management: Memory Management in Concurrent Algorithms (MMM), p. 23.
CAV-2010-PnueliSZ #framework #named #verification: Jtlv: A Framework for Developing Verification Algorithms (AP, YS, LDZ), pp. 171–174.
CSL-2010-BlassDG: Exact Exploration and Hanging Algorithms (AB, ND, YG), pp. 140–154.
CSL-2010-GanzowK #higher-order #induction #logic #monad: New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures (TG, LK), pp. 366–380.
ICST-2010-HuangCM #search-based #testing #user interface #using: Repairing GUI Test Suites Using a Genetic Algorithm (SH, MBC, AMM), pp. 245–254.
ICTSS-2010-CabralPV #integration #order #problem: A Pareto Ant Colony Algorithm Applied to the Class Integration and Test Order Problem (RdVC, AP, SRV), pp. 16–29.
SAT-2010-MakinoTY #problem: An Exact Algorithm for the Boolean Connectivity Problem for k-CNF (KM, ST, MY), pp. 172–180.
SAT-2010-ManquinhoML #optimisation #satisfiability: Improving Unsatisfiability-Based Algorithms for Boolean Optimization (VMM, RM, IL), pp. 181–193.
SAT-2010-Paturi #complexity: Exact Algorithms and Complexity (RP), pp. 8–9.
VMCAI-2010-JungKWY #abstraction #invariant #learning: Deriving Invariants by Algorithmic Learning, Decision Procedures, and Predicate Abstraction (YJ, SK, BYW, KY), pp. 180–196.
DRR-2009-MeilenderB #documentation #segmentation: Segmentation of continuous document flow by a modified backward-forward algorithm (TM, AB), pp. 1–10.
ICDAR-2009-BoubakerKA #detection: New Algorithm of Straight or Curved Baseline Detection for Short Arabic Handwritten Writing (HB, MK, AMA), pp. 778–782.
ICDAR-2009-BoussellaaBZAA #documentation #image #using: Enhanced Text Extraction from Arabic Degraded Document Images Using EM Algorithm (WB, AB, AZ, HEA, AMA), pp. 743–747.
ICDAR-2009-DaifallahZJ #online #segmentation: Recognition-Based Segmentation Algorithm for On-Line Arabic Handwriting (KD, NZ, HJ), pp. 886–890.
ICDAR-2009-HanifP #detection #image #locality #using: Text Detection and Localization in Complex Scene Images using Constrained AdaBoost Algorithm (SMH, LP), pp. 1–5.
SIGMOD-2009-FingerP #evaluation #performance #rank #robust: Robust and efficient algorithms for rank join evaluation (JF, NP), pp. 415–428.
VLDB-2009-HassanzadehCML #clustering #detection #framework: Framework for Evaluating Clustering Algorithms in Duplicate Detection (OH, FC, RJM, HCL), pp. 1282–1293.
VLDB-2009-SarmaLNX #multi #random #streaming: Randomized Multi-pass Streaming Skyline Algorithms (ADS, AL, DN, J(X), pp. 85–96.
VLDB-2009-UMM #multi #query: A Fair Assignment Algorithm for Multiple Preference Queries (LHU, NM, KM), pp. 1054–1065.
ITiCSE-2009-Garcia-MateosA #data type #online #using: A course on algorithms and data structures using on-line judging (GGM, JLFA), pp. 45–49.
ITiCSE-2009-KiesmullerB #automation #identification #problem: Automatically identifying learners’ problem solving strategies in-process solving algorithmic problems (UK, TB), p. 354.
ITiCSE-2009-MoffatT #education #using: The use of MUVE technology in teaching AI algorithms (DCM, KT), p. 396.
ITiCSE-2009-RosslingL #on the fly #visualisation: Visualizing compression algorithms on-the-fly (GR, FL), p. 376.
ITiCSE-2009-Velazquez-IturbideP #interactive #learning: Active learning of greedy algorithms by means of interactive experimentation (JÁVI, APC), pp. 119–123.
CSMR-2009-BittencourtG #architecture #clustering #comparison #graph: Comparison of Graph Clustering Algorithms for Recovering Software Architecture Module Views (RAB, DDSG), pp. 251–254.
CSMR-2009-KpodjedoRGA #evolution #question #using: Recovering the Evolution Stable Part Using an ECGM Algorithm: Is There a Tunnel in Mozilla? (SK, FR, PG, GA), pp. 179–188.
ICPC-2009-ShternT #clustering: Methods for selecting and improving software clustering algorithms (MS, VT), pp. 248–252.
WCRE-1999-LoRRV99a #evaluation #mining #quantifier: Mining Quantified Temporal Rules: Formalism, Algorithms, and Evaluation (DL, GR, VPR, KV), pp. 62–71.
CIAA-J-2008-ChamparnaudDJ09 #geometry #performance #regular expression: An Efficient Algorithm to Test Whether a Binary and Prolongeable Regular Language is Geometrical (JMC, JPD, HJ), pp. 763–774.
CIAA-2009-CastiglioneRS #on the: On Extremal Cases of Hopcroft’s Algorithm (GC, AR, MS), pp. 14–23.
CIAA-2009-CleophasH #automaton #tool support: Forest FIRE: A Taxonomy-based Toolkit of Tree Automata and Regular Tree Algorithms (LGC, KH), pp. 245–248.
CIAA-2009-HolzerM #automaton: An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton (MH, AM), pp. 4–13.
ICALP-v1-2009-AgnarssonHL #independence #problem #set: SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs (GA, MMH, EL), pp. 12–23.
ICALP-v1-2009-BorosM #parallel #performance #problem: A Fast and Simple Parallel Algorithm for the Monotone Duality Problem (EB, KM), pp. 183–194.
ICALP-v1-2009-Coja-Oghlan #random #satisfiability: A Better Algorithm for Random k-SAT (ACO), pp. 292–303.
ICALP-v1-2009-DemaineHK #approximate #graph: Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs (EDD, MH, KiK), pp. 316–327.
ICALP-v1-2009-KoufogiannakisY #approximate #constraints: Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost (CK, NEY), pp. 634–652.
ICALP-v1-2009-McDermid #approximate: A 3/2-Approximation Algorithm for General Stable Marriage (EM), pp. 689–700.
ICALP-v1-2009-Nederlof #performance #problem #using: Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems (JN), pp. 713–725.
ICALP-v1-2009-Papadimitriou #game studies: Algorithmic Game Theory: A Snapshot (CHP), pp. 3–11.
ICALP-v2-2009-FanghanelKV #latency #network: Improved Algorithms for Latency Minimization in Wireless Networks (AF, TK, BV), pp. 447–458.
ICALP-v2-2009-KorulaP #graph #problem: Algorithms for Secretary Problems on Graphs and Hypergraphs (NK, MP), pp. 508–520.
LATA-2009-BalbachZ #education: Recent Developments in Algorithmic Teaching (FJB, TZ), pp. 1–18.
LATA-2009-Blanchet-SadriMRW #using #word: An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms (FBS, RM, AR, EW), pp. 188–199.
LATA-2009-Courcelle #graph #higher-order #logic #monad: Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications (BC), pp. 19–22.
LATA-2009-LiefoogheTV #self: Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching (AL, HT, JSV), pp. 481–492.
LATA-2009-Roman #search-based: Genetic Algorithm for Synchronization (AR), pp. 684–695.
TLCA-2009-AbelCP #composition #proving #type system: A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance (AA, TC, MP), pp. 5–19.
CIG-2009-JangYC #game studies #realtime #using: Optimal strategy selection of non-player character on real time strategy game using a speciated evolutionary algorithm (SHJ, JY, SBC), pp. 75–79.
CIG-2009-JaskowskiK #analysis #coordination #formal method #game studies: Formal analysis and algorithms for extracting coordinate systems of games (WJ, KK), pp. 201–208.
CIG-2009-Pace #game studies #how #search-based: How a genetic algorithm learns to play Traveler's Dilemma by choosing dominated strategies to achieve greater payoffs (MP), pp. 194–200.
FDG-2009-ButtJ: Where do we go now?: anytime algorithms for path planning (RB, SJJ), pp. 248–255.
DHM-2009-Weber: Intelligent Motion Tracking by Combining Specialized Algorithms (MW), pp. 170–179.
ICEIS-AIDSS-2009-AbdoIE #rank: Ant PageRank Algorithm (MZA, MAI, MIE), pp. 73–79.
ICEIS-AIDSS-2009-Jou #hybrid #mining: A Projection-based Hybrid Sequential Patterns Mining Algorithm (CJ), pp. 152–157.
ICEIS-AIDSS-2009-MarinicaOG #mining #using: User-driven Association Rule Mining using a Local Algorithm (CM, AO, FG), pp. 200–205.
ICEIS-AIDSS-2009-OReilly #multi #optimisation #using: Frequency Assignment Optimization using the Swarm Intelligence Multi-agent based Algorithm (SIMBA) (GBO), pp. 25–32.
ICEIS-AIDSS-2009-TangL #quality #search-based: A Fuzzy-guided Genetic Algorithm for Quality Enhancement in the Supply Chain (CXHT, HCWL), pp. 85–89.
ICEIS-DISI-2009-GorawskiD #distributed #execution #performance #query: Algorithms for Efficient Top-K Spatial Preference Query Execution in a Heterogeneous Distributed Environment (MG, KD), pp. 43–48.
ICEIS-DISI-2009-Perez-CebrerosMC #parallel #query #scheduling: PSO-based Resource Scheduling Algorithm for Parallel Query Processing on Grids (APC, GML, NCC), pp. 131–137.
ICEIS-HCI-2009-TroianoBAC #layout #mobile #optimisation #search-based #web: Web Form Page in Mobile Devices — Optimization of Layout with a Simple Genetic Algorithm (LT, CB, RA, GC), pp. 118–123.
ICEIS-J-2009-MianiYSB #fuzzy #mining #ontology: NARFO Algorithm: Mining Non-redundant and Generalized Association Rules Based on Fuzzy Ontologies (RGM, CAY, MTPS, MB), pp. 415–426.
ICEIS-J-2009-SousaLCA #automation #metamodelling: A Step Forward in Semi-automatic Metamodel Matching: Algorithms and Tool (JdS, DL, DBC, ZA), pp. 137–148.
CIKM-2009-JinSLY #flexibility #simulation: A flexible simulation environment for flash-aware algorithms (PJ, XS, ZL, LY), pp. 2093–2094.
CIKM-2009-KanungoGKW #summary #user satisfaction #web: Web search result summarization: title selection algorithms and user satisfaction (TK, NG, KYK, LW), pp. 1581–1584.
CIKM-2009-LuHM #approximate #performance #using: Efficient algorithms for approximate member extraction using signature-based inverted lists (JL, JH, XM), pp. 315–324.
CIKM-2009-WangCH #clustering #performance #scalability #topic #web: An efficient clustering algorithm for large-scale topical web pages (LW, PC, LH), pp. 1851–1854.
CIKM-2009-ZhuCZWWC #ranking: A general magnitude-preserving boosting algorithm for search ranking (CZ, WC, ZAZ, GW, DW, ZC), pp. 817–826.
ECIR-2009-Ailon #linear #query #ranking #using: A Simple Linear Ranking Algorithm Using Query Dependent Intercept Variables (NA), pp. 685–690.
ECIR-2009-PaltoglouSS #adaptation #data fusion: Simple Adaptations of Data Fusion Algorithms for Source Selection (GP, MS, MS), pp. 497–508.
ECIR-2009-ParaparB #clustering #documentation #evaluation: Evaluation of Text Clustering Algorithms with N-Gram-Based Document Fingerprints (JP, AB), pp. 645–653.
ICML-2009-FooDN #learning #multi: A majorization-minimization algorithm for (multiple) hyperparameter learning (CSF, CBD, AYN), pp. 321–328.
ICML-2009-GargK #strict: Gradient descent with sparsification: an iterative algorithm for sparse recovery with restricted isometry property (RG, RK), pp. 337–344.
ICML-2009-HazanS #learning #performance: Efficient learning algorithms for changing environments (EH, CS), pp. 393–400.
ICML-2009-LanLML #analysis #ranking: Generalization analysis of listwise learning-to-rank algorithms (YL, TYL, ZM, HL), pp. 577–584.
KDD-2009-CherkasovaEMTV #enterprise #information management #similarity: Applying syntactic similarity algorithms for enterprise information management (LC, KE, CBMI, JT, ACV), pp. 1087–1096.
KDD-2009-DengLK #graph: A generalized Co-HITS algorithm and its application to bipartite graphs (HD, MRL, IK), pp. 239–248.
KDD-2009-GamaSR #evaluation #learning: Issues in evaluation of stream learning algorithms (JG, RS, PPR), pp. 329–338.
KDD-2009-OnumaTF #named #novel #recommendation: TANGENT: a novel, “Surprise me”, recommendation algorithm (KO, HT, CF), pp. 657–666.
KDD-2009-TantipathananandhB #approximate #community #identification: Constant-factor approximation algorithms for identifying dynamic communities (CT, TYBW), pp. 827–836.
KEOD-2009-LocoroM #ambiguity #ontology #word: A Correspondence Repair Algorithm based on Word Sense Disambiguation and Upper Ontologies (AL, VM), pp. 239–246.
KEOD-2009-YiR #clustering #ontology #using: Using a Clustering Algorithm for Domain Related Ontology Construction (HY, VJRS), pp. 336–341.
MLDM-2009-IsakssonD #case study #comparative #detection: A Comparative Study of Outlier Detection Algorithms (CI, MHD), pp. 440–453.
MLDM-2009-SmaouiMM #assessment #clustering #named #quality: CSBIterKmeans: A New Clustering Algorithm Based on Quantitative Assessment of the Clustering Quality (TS, SM, CMS), pp. 337–346.
MLDM-2009-YuksekC: An Improved Tabu Search (ITS) Algorithm Based on Open Cover Theory for Global Extremums (KY, SC), pp. 505–515.
SEKE-2009-LinWK #feature model #hybrid #novel: A Novel Hybrid Search Algorithm for Feature Selection (PL, HW, TMK), pp. 81–86.
SEKE-2009-PengLPF #requirements #using: Requirements Discovery Based on RGPS Using Evolutionary Algorithm (TP, BL, WP, ZF), pp. 286–290.
SEKE-2009-RusNSC #clustering #fault #graph #using: Clustering of Defect Reports Using Graph Partitioning Algorithms (VR, XN, SGS, YC), pp. 442–445.
SIGIR-2009-AminiU #information management #multi #ranking #summary: Incorporating prior knowledge into a transductive ranking algorithm for multi-document summarization (MRA, NU), pp. 704–705.
ICMT-2009-Garcia-MagarinoGF #generative #model transformation #transformation language: Model Transformation By-Example: An Algorithm for Generating Many-to-Many Transformation Rules in Several Model Transformation Languages (IGM, JJGS, RFF), pp. 52–66.
MoDELS-2009-WolfeGP #consistency #incremental #runtime: An Incremental Algorithm for High-Performance Runtime Model Consistency (CW, TCNG, WGP), pp. 357–371.
MoDELS-2009-WolfeGP #consistency #incremental #runtime: An Incremental Algorithm for High-Performance Runtime Model Consistency (CW, TCNG, WGP), pp. 357–371.
PLDI-2009-AnselCWOZEA #compilation #named: PetaBricks: a language and compiler for algorithmic choice (JA, CPC, YLW, MO, QZ, AE, SPA), pp. 38–49.
POPL-2009-GotsmanCPV #proving: Proving that non-blocking algorithms don’t block (AG, BC, MJP, VV), pp. 16–28.
PPDP-2009-NigamM #linear #logic #specification: Algorithmic specifications in linear logic with subexponentials (VN, DM), pp. 129–140.
PPDP-2009-Virseda #debugging #declarative #framework #higher-order #logic #source code #verification: A higher-order logical framework for the algorithmic debugging and verification of declarative programs (RdVV), pp. 49–60.
SAS-2009-Bodik #source code #synthesis: Algorithmic Program Synthesis with Partial Programs and Decision Procedures (RB), p. 1.
SAS-2009-Bouissou #correctness #implementation #proving: Proving the Correctness of the Implementation of a Control-Command Algorithm (OB), pp. 102–119.
SAS-2009-Qadeer #smt #using #verification: Algorithmic Verification of Systems Software Using SMT Solvers (SQ), p. 2.
SIGAda-2009-Barkstrom #ada #concurrent #multi #on the #problem #using: On using Ada to solve problems in computational economics and related disciplines with concurrent, multiagent algorithms (BRB), pp. 61–72.
ASE-2009-Hall #quantum #re-engineering: A Quantum Algorithm for Software Engineering Search (RJH), pp. 40–51.
SAC-2009-BasgaluppBCFR #induction #multi #named #search-based: LEGAL-tree: a lexicographic multi-objective genetic algorithm for decision tree induction (MPB, RCB, ACPLFdC, AAF, DDR), pp. 1085–1090.
SAC-2009-FaggioliTC #implementation #linux: An implementation of the earliest deadline first algorithm in Linux (DF, MT, FC), pp. 1984–1989.
SAC-2009-GamaRS #data type: Evaluating algorithms that learn from data streams (JG, PPR, RS), pp. 1496–1500.
SAC-2009-GaoZL #constraints #fuzzy #optimisation: A particle swarm optimization based algorithm for fuzzy bilevel decision making with constraints-shared followers (YG, GZ, JL), pp. 1075–1079.
SAC-2009-HijikataHON #analysis #using: HITS algorithm improvement using anchor-related text extracted by DOM structure analysis (YH, BQH, MO, SN), pp. 1691–1698.
SAC-2009-JangYC #clustering #multi #set: A smart clustering algorithm for photo set obtained from multiple digital cameras (CJJ, TY, HGC), pp. 1784–1791.
SAC-2009-LiuDSYH #classification #image #invariant #using: A new K-View algorithm for texture image classification using rotation-invariant feature (HL, SD, ES, CY, CCH), pp. 914–921.
SAC-2009-MasaruS #modelling #search-based: Daily demand forecasting of new products utilizing diffusion models and genetic algorithms (TM, MS), pp. 1106–1107.
SAC-2009-ParkPR #automation #using: Planning for remarshaling in an automated container terminal using cooperative coevolutionary algorithms (KP, TP, KRR), pp. 1098–1105.
SAC-2009-ParkYAMP #approach #detection #novel #search-based #segmentation #using: A novel approach to detect copy number variation using segmentation and genetic algorithm (CP, YY, JA, MM, SP), pp. 788–792.
SAC-2009-RyuKC #detection #documentation #evolution #using: A detecting and tracing algorithm for unauthorized internet-news plagiarism using spatio-temporal document evolution model (CKR, HJK, HGC), pp. 863–868.
SAC-2009-UddinZ #automation #monitoring #named #trust: ATM: an automatic trust monitoring algorithm for service software (MGU, MZ), pp. 1040–1044.
SAC-2009-WakataniK #grid #parallel: Reduced parallel PNN algorithm for PC grid systems (AW, TK), pp. 1009–1010.
SAC-2009-WangT #morphism: An algorithm for optimal comma free codes with isomorphism rejection (HW, VDT), pp. 1007–1008.
SAC-2009-WeiSW #clustering #email #fuzzy #novel #string: Clustering malware-generated spam emails with a novel fuzzy string matching algorithm (CW, AS, GW), pp. 889–890.
GPCE-2009-JarviMPFS #user interface: Algorithms for user interfaces (JJ, MM, SP, JF, JNS), pp. 147–156.
CASE-2009-BermanK #abstraction #assembly #scalability: Abstractions and algorithms for assembly tasks with large numbers of robots and parts (SB, VK), pp. 25–28.
CASE-2009-BountourelisR #learning: Customized learning algorithms for episodic tasks with acyclic state spaces (TB, SR), pp. 627–634.
CASE-2009-DInnocenzoWAIJP #scalability #scheduling: Scalable scheduling algorithms for wireless networked control systems (AD, GW, RA, AJI, KHJ, GJP), pp. 409–414.
CASE-2009-GargM #agile #clustering #named #using: RACK: RApid clustering using K-means algorithm (VKG, MNM), pp. 621–626.
CASE-2009-GirishJ #flexibility #optimisation #problem #scheduling: A particle swarm optimization algorithm for flexible job shop scheduling problem (BSG, NJ), pp. 298–303.
CASE-2009-MysoreNUMR #performance: An efficient algorithm for RFID reader positioning for coverage of irregularly-shaped areas (NM, PN, RSU, RM, SR), pp. 233–240.
CASE-2009-NaveenRR #difference #evolution #network #search-based #using: Rule extraction from differential evolution trained radial basis function network using genetic algorithms (NN, VR, CRR), pp. 152–157.
CGO-2009-RoyS #profiling: Profiling k-Iteration Paths: A Generalization of the Ball-Larus Profiling Algorithm (SR, YNS), pp. 70–80.
DAC-2009-CromarLC #reduction: FPGA-targeted high-level binding algorithm for power and area reduction with glitch-estimation (SC, JL, DC), pp. 838–843.
DAC-2009-El-MoselhyED #performance: An efficient resistance sensitivity extraction algorithm for conductors of arbitrary shapes (TAEM, IME, BD), pp. 770–775.
DAC-2009-FengZYTZ #performance: Provably good and practically efficient algorithms for CMP dummy fill (CF, HZ, CY, JT, XZ), pp. 539–544.
DAC-2009-LiS #optimisation #robust: Yield-driven iterative robust circuit optimization algorithm (YL, VS), pp. 599–604.
DAC-2009-LiuWQ #adaptation #energy #realtime #scheduling: An adaptive scheduling and voltage/frequency selection algorithm for real-time energy harvesting systems (SL, QW, QQ), pp. 782–787.
DAC-2009-LiuYKC: An O(n log n) path-based obstacle-avoiding algorithm for rectilinear Steiner tree construction (CHL, SYY, SYK, YHC), pp. 314–319.
DAC-2009-LuZSZ #manycore #parallel: Multicore parallel min-cost flow algorithm for CAD applications (YL, HZ, LS, XZ), pp. 832–837.
DAC-2009-ShengXM #fault #multi #optimisation #search-based #standard: Soft error optimization of standard cell circuits based on gate sizing and multi-objective genetic algorithm (WS, LX, ZM), pp. 502–507.
DATE-2009-AlimohammadFC #architecture #development #flexibility #verification: A flexible layered architecture for accurate digital baseband algorithm development and verification (AA, SFF, BFC), pp. 45–50.
DATE-2009-ConcerIB #named #network #novel: aEqualized: A novel routing algorithm for the Spidergon Network On Chip (NC, SI, LB), pp. 749–754.
DATE-2009-FickDCBSB #fault tolerance: A highly resilient routing algorithm for fault-tolerant NoCs (DF, AD, GKC, VB, DS, DB), pp. 21–26.
DATE-2009-GaluzziTMB #automation: Algorithms for the automatic extension of an instruction-set (CG, DT, RM, KB), pp. 548–553.
DATE-2009-HeH #encoding #performance #verification: An efficient path-oriented bitvector encoding width computation algorithm for bit-precise verification (NH, MSH), pp. 1602–1607.
DATE-2009-HolstW: A diagnosis algorithm for extreme space compaction (SH, HJW), pp. 1355–1360.
DATE-2009-KeinertDHHT #image #modelling #multi #optimisation #synthesis: Model-based synthesis and optimization of static multi-rate image processing algorithms (JK, HD, FH, CH, JT), pp. 135–140.
DATE-2009-WhittySEP #architecture #configuration management: Mapping of a film grain removal algorithm to a heterogeneous reconfigurable architecture (SW, HS, RE, WPR), pp. 27–32.
ISMM-2009-OanceaMW #approach: A new approach to parallelising tracing algorithms (CEO, AM, SMW), pp. 10–19.
PDP-2009-AchourNS #adaptation #clustering #modelling #on the #performance #using: On the Use of Performance Models for Adaptive Algorithm Selection on Heterogeneous Clusters (SA, WN, LAS), pp. 85–89.
PDP-2009-KunisR #constraints #optimisation #parallel #precedence #scheduling #using: Optimization of Layer-based Scheduling Algorithms for Mixed Parallel Applications with Precedence Constraints Using Move-blocks (RK, GR), pp. 70–77.
PDP-2009-LeonMSS #library #parallel: Parallel Library of Multi-objective Evolutionary Algorithms (CL, GM, ES, CS), pp. 28–35.
PDP-2009-PatooghyM #fault tolerance #named #network #performance: XYX: A Power & Performance Efficient Fault-Tolerant Routing Algorithm for Network on Chip (AP, SGM), pp. 245–251.
PPoPP-2009-KangB #graph #memory management #performance #transaction: An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs (SK, DAB), pp. 15–24.
ESOP-2009-BonchiM #similarity: Minimization Algorithm for Symbolic Bisimilarity (FB, UM), pp. 267–284.
ESOP-2009-YuanE #performance #problem #reachability: An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees (HY, PTE), pp. 175–189.
FASE-2009-SumnerZ #automation: Algorithms for Automatically Computing the Causal Paths of Failures (WNS, XZ), pp. 355–369.
STOC-2009-AroraDS #message passing: Message passing algorithms and improved LP decoding (SA, CD, DS), pp. 3–12.
STOC-2009-CardinalFJJM #partial order #performance: An efficient algorithm for partial order production (JC, SF, GJ, RMJ, JIM), pp. 93–100.
STOC-2009-ChadhaGKM: A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation (JSC, NG, AK, VNM), pp. 679–684.
STOC-2009-CleveGMSY #performance #quantum #query #simulation: Efficient discrete-time simulations of continuous-time quantum query algorithms (RC, DG, MM, RDS, DLYM), pp. 409–416.
STOC-2009-DworkNRRV #complexity #on the #performance: On the complexity of differentially private data release: efficient algorithms and hardness results (CD, MN, OR, GNR, SPV), pp. 381–390.
STOC-2009-Liu #quantum #using: Quantum algorithms using the curvelet transform (YKL), pp. 391–400.
STOC-2009-NguyenDT #approximate #matrix #performance #rank: A fast and efficient algorithm for low-rank approximation of a matrix (NHN, TTD, TDT), pp. 215–224.
STOC-2009-YoshidaYI #approximate: An improved constant-time approximation algorithm for maximum~matchings (YY, MY, HI), pp. 225–234.
CADE-2009-LahiriQ #abstraction #complexity: Complexity and Algorithms for Monomial and Clausal Predicate Abstraction (SKL, SQ), pp. 214–229.
CAV-2009-FiliotJR #ltl: An Antichain Algorithm for LTL Realizability (EF, NJ, JFR), pp. 263–277.
CSL-2009-AlurCW #analysis #source code: Algorithmic Analysis of Array-Accessing Programs (RA, PC, SW), pp. 86–101.
ICLP-2009-Li #constraints #difference #functional #integer #research #summary: Research Summary: Extending Elimination Algorithms for Functional Constraints to Solve Two Integer Variables per Inequality (CL), pp. 530–531.
LICS-2009-Friedmann #bound #exponential #game studies: An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it (OF), pp. 145–156.
SAT-2009-AtseriasFT #bound: Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution (AA, JKF, MT), pp. 114–127.
SAT-2009-ManquinhoSP #optimisation: Algorithms for Weighted Boolean Optimization (VMM, JPMS, JP), pp. 495–508.
SAT-2009-Nieuwenhuis #modulo theories #satisfiability: SAT Modulo Theories: Enhancing SAT with Special-Purpose Algorithms (RN), p. 1.
DocEng-2008-Nguyen #documentation #image #using: A rotation method for binary document images using DDA algorithm (DTN), pp. 267–270.
DocEng-2008-Oliveira #automation #documentation #layout: Two algorithms for automatic document page layout (JBSdO), pp. 141–149.
DocEng-2008-SturgillS #approach #recognition: An optical character recognition approach to qualifying thresholding algorithms (MS, SJS), pp. 263–266.
PODS-2008-AnagnostopoulosDK #approximate #clustering: Approximation algorithms for co-clustering (AA, AD, RK), pp. 201–210.
PODS-2008-CormodeM #approximate #clustering #nondeterminism: Approximation algorithms for clustering uncertain data (GC, AM), pp. 191–200.
PODS-2008-LiuPRY #problem: A generic flow algorithm for shared filter ordering problems (ZL, SP, AR, HY), pp. 79–88.
SIGMOD-2008-GouC #graph #pattern matching #performance: Efficient algorithms for exact ranked twig-pattern matching over graphs (GG, RC), pp. 581–594.
SIGMOD-2008-LiuPRY #data type #evaluation: Near-optimal algorithms for shared filter evaluation in data stream systems (ZL, SP, AR, HY), pp. 133–146.
SIGMOD-2008-OConnell #challenge #optimisation #streaming: Extreme streaming: business optimization driving algorithmic challenges (WO), pp. 13–14.
VLDB-2008-ShangZLY #morphism #performance #testing #verification: Taming verification hardness: an efficient algorithm for testing subgraph isomorphism (HS, YZ, XL, JXY), pp. 364–375.
VLDB-2008-XiaoWL #constraints #distance #edit distance #named #performance #similarity: Ed-Join: an efficient algorithm for similarity joins with edit distance constraints (CX, WW, XL), pp. 933–944.
EDM-2008-RomeroVEH #data mining #mining #student: Data Mining Algorithms to Classify Students (CR, SV, PGE, CH), pp. 8–17.
ITiCSE-2008-Armoni: Reductive thinking in a quantitative perspective: the case of the algorithm course (MA), pp. 53–57.
ITiCSE-2008-Garcia-OsorioGG #education #ll #lr #parsing: A tool for teaching LL and LR parsing algorithms (CGO, CGP, NGP), p. 317.
ITiCSE-2008-KiesmullerB #analysis #how #problem: How do 7th graders solve algorithmic problems?: a tool-based analysis (UK, TB), p. 353.
ITiCSE-2008-MartinH #design: Cognitive dimensions questionnaire applied to exploratory algorithm design (CJM, JMH), pp. 184–188.
ITiCSE-2008-Velazquez-IturbidePU #animation #named #recursion: SRec: an animation system of recursion for algorithm courses (JÁVI, APC, JUF), pp. 225–229.
ICSM-2008-KinneerR #control flow #java #maintenance #representation #type inference: Assessing the usefulness of type inference algorithms in representing Java control flow to support software maintenance tasks (AK, GR), pp. 127–136.
AFL-2008-Roska: Cellular Wave Computers — Algorithms for million processor computers (TR), p. 352.
CIAA-2008-GlabbeekP #nondeterminism: Five Determinisation Algorithms (RJvG, BP), pp. 161–170.
DLT-2008-AllauzenMR #ambiguity #automaton #finite #testing: General Algorithms for Testing the Ambiguity of Finite Automata (CA, MM, AR), pp. 108–120.
ICALP-A-2008-AzarBKMN #approximate: Improved Approximation Algorithms for Budgeted Allocations (YA, BEB, ARK, CM, CTN), pp. 186–197.
ICALP-A-2008-ChekuriK #problem: Algorithms for 2-Route Cut Problems (CC, SK), pp. 472–484.
ICALP-A-2008-HaeuplerKMST #incremental #performance: Faster Algorithms for Incremental Topological Ordering (BH, TK, RM, SS, RET), pp. 421–433.
ICALP-A-2008-JansenT #approximate #parallel #scheduling: Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2 (KJ, RT), pp. 234–245.
ICALP-A-2008-Koutis #algebra #performance #problem: Faster Algebraic Algorithms for Path and Packing Problems (IK), pp. 575–586.
ICALP-A-2008-LaberM #approximate: An Approximation Algorithm for Binary Searching in Trees (ESL, MM), pp. 459–471.
ICALP-A-2008-Phillips #approximate: Algorithms for epsilon-Approximations of Terrains (JMP), pp. 447–458.
ICALP-B-2008-SimmonsP #linear #logic: Linear Logical Algorithms (RJS, FP), pp. 336–347.
LATA-2008-CastiglioneRS #automaton: Hopcroft’s Algorithm and Cyclic Automata (GC, AR, MS), pp. 172–183.
LATA-2008-Yoshinaka #performance #problem #subclass: An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs (RY), pp. 487–498.
SEFM-2008-PhamTTC #bound #java #memory management #performance: A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets (THP, AHT, NTT, WNC), pp. 259–267.
FLOPS-2008-Yokouchi #analysis #difference #lazy evaluation #strict: Strictness Analysis Algorithms Based on an Inequality System for Lazy Types (HY), pp. 255–271.
CIG-2008-delaOssaGL #optimisation: Improvement of a car racing controller by means of Ant Colony Optimization algorithms (Ld, JAG0, VL), pp. 365–371.
GT-VC-2007-Pennemann08 #approximate #problem #satisfiability: An Algorithm for Approximating the Satisfiability Problem of High-level Conditions (KHP), pp. 75–94.
GT-VMT-2008-MaierM #layout: A Static Layout Algorithm for DiaMeta (SM, MM).
ICGT-2008-MazanekMM: An Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammars (SM, SM, MM), pp. 39–53.
CHI-2008-EvansC #social #web: Augmented information assimilation: social and algorithmic web aids for the information long tail (BE, SC), pp. 989–998.
CHI-2008-MatsuiY #search-based: Genetic algorithm can optimize hierarchical menus (SM, SY), pp. 1385–1388.
SOFTVIS-2008-BernardinBH #visualisation: Stacked-widget visualization of scheduling-based algorithms (TB, BB, BH), pp. 165–174.
SOFTVIS-2008-ParduhnSW #graph #using #visualisation: Algorithm visualization using concrete and abstract shape graphs (SAP, RS, RW), pp. 33–36.
ICEIS-AIDSS-2008-AjroudOBY #approximate #network: An Approximate Propagation Algorithm for Product-Based Possibilistic Networks (AA, MNO, SB, HY), pp. 321–326.
ICEIS-AIDSS-2008-BezerraW #detection #process: Anomaly Detection Algorithms in Business Process Logs (FdLB, JW), pp. 11–18.
ICEIS-AIDSS-2008-DeliasDM #optimisation #workflow: A Joint Optimization Algorithm for Dispatching Tasks in Agent-Based Workflow Management Systems (PD, ADD, NFM), pp. 199–206.
ICEIS-AIDSS-2008-MarinakisMMZ #clustering: A Memetic-Grasp Algorithm for Clustering (YM, MM, NFM, CZ), pp. 36–43.
ICEIS-AIDSS-2008-RybakovB #logic #multi: Algorithms for AI Logic of Decisions in Multi-Agent Environment (VVR, SB), pp. 125–129.
ICEIS-AIDSS-2008-StateCRP #classification #learning: A New Learning Algorithm for Classification in the Reduced Space (LS, CC, IR, PV), pp. 155–160.
ICEIS-HCI-2008-ConciNPS #detection: Comparing Color and Texture-Based Algorithms for Human Skin Detection (AC, EN, JJP, ÁS), pp. 166–173.
ICEIS-ISAS2-2008-BainaT #graph #hybrid #towards #verification #workflow: Toward a Hybrid Algorithm for Workflow Graph Structural Verification (FT, KB, WG), pp. 442–447.
ICEIS-J-2008-PapatheocharousA08a #approach #hybrid #modelling #network #predict #search-based #using: Hybrid Computational Models for Software Cost Prediction: An Approach Using Artificial Neural Networks and Genetic Algorithms (EP, ASA), pp. 87–100.
CIKM-2008-AlqadahB #clustering #effectiveness #mining: An effective algorithm for mining 3-clusters in vertically partitioned data (FA, RB), pp. 1103–1112.
CIKM-2008-KormilitsinCFS #heuristic: View and index selection for query-performance improvement: quality-centered algorithms and heuristics (MK, RC, YF, MFS), pp. 1329–1330.
CIKM-2008-RodriguezB: An algorithm to determine peer-reviewers (MAR, JB), pp. 319–328.
ICML-2008-CortesMPR: Stability of transductive regression algorithms (CC, MM, DP, AR), pp. 176–183.
ICML-2008-FrancS: Optimized cutting plane algorithm for support vector machines (VF, SS), pp. 320–327.
ICML-2008-KakadeST #multi #online #performance #predict: Efficient bandit algorithms for online multiclass prediction (SMK, SSS, AT), pp. 440–447.
ICML-2008-RothF #linear #modelling #performance: The Group-Lasso for generalized linear models: uniqueness of solutions and efficient algorithms (VR, BF), pp. 848–855.
ICML-2008-Schnall-LevinCB #design #framework: Inverting the Viterbi algorithm: an abstract framework for structure design (MSL, LC, BB), pp. 904–911.
ICML-2008-XiaLWZL #approach #learning #rank: Listwise approach to learning to rank: theory and algorithm (FX, TYL, JW, WZ, HL), pp. 1192–1199.
ICML-2008-ZhangDT: Estimating local optimums in EM algorithm over Gaussian mixture model (ZZ, BTD, AKHT), pp. 1240–1247.
ICPR-2008-AlpcanB #distributed #learning #parallel: A discrete-time parallel update algorithm for distributed learning (TA, CB), pp. 1–4.
ICPR-2008-BenezethJELR #evaluation #overview: Review and evaluation of commonly-implemented background subtraction algorithms (YB, PMJ, BE, HL, CR), pp. 1–4.
ICPR-2008-ChenR #3d #invariant #linear #recognition: Linear time recognition algorithms for topological invariants in 3D (LC, YR), pp. 1–4.
ICPR-2008-ChenSXS #identification #search-based #using: Computer graphics identification using genetic algorithm (WC, YQS, GX, WS), pp. 1–4.
ICPR-2008-ChouaibTTCV #classification #feature model #search-based: Feature selection combining genetic algorithm and Adaboost classifiers (HC, ORT, ST, FC, NV), pp. 1–4.
ICPR-2008-FerrerVSRB #approximate #graph #using: An approximate algorithm for median graph computation using graph embedding (MF, EV, FS, KR, HB), pp. 1–4.
ICPR-2008-HahnKW #3d #estimation #using: Spatio-temporal 3D pose estimation and tracking of human body parts using the Shape Flow algorithm (MH, LK, CW), pp. 1–4.
ICPR-2008-HortaMF #clustering #comparison #image #using: A comparison of clustering fully polarimetric SAR images using SEM algorithm and G0P mixture modelwith different initializations (MMH, NDAM, ACF), pp. 1–4.
ICPR-2008-HuaSY #clustering #invariant: Scale-invariant density-based clustering initialization algorithm and its application (CH, RS, YY), pp. 1–4.
ICPR-2008-KanataniS #ml #strict: Compact algorithm for strictly ML ellipse fitting (KK, YS), pp. 1–4.
ICPR-2008-KiserSM: Accelerating active contour algorithms with the Gradient Diffusion Field (WK, PS, CM), pp. 1–4.
ICPR-2008-KonyaSGE #detection #robust #scalability: A robust front page detection algorithm for large periodical collections (IVK, CS, SG, SE), pp. 1–5.
ICPR-2008-KrizekKH #feature model: Feature condensing algorithm for feature selection (PK, JK, VH), pp. 1–4.
ICPR-2008-LiZ #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-MansouriSHV #adaptation #estimation #image: An adaptive-PCA algorithm for reflectance estimation from color images (AM, TS, JYH, YV), pp. 1–4.
ICPR-2008-ShanCW #automation #image #novel: A novel automatic seed point selection algorithm for breast ultrasound images (JS, HDC, YW), pp. 1–4.
ICPR-2008-ShettyA #clustering: A uniformity criterion and algorithm for data clustering (SS, NA), pp. 1–4.
ICPR-2008-ShinK #using: Enhanced Resolution-aware Fitting algorithm using interpolation operator (JS, DK), pp. 1–4.
ICPR-2008-StathisKP #documentation #evaluation #overview: An evaluation survey of binarization algorithms on historical documents (PS, EK, NP), pp. 1–4.
ICPR-2008-Vega-PonsRV #segmentation #set #using: Active contour algorithm for texture segmentation using a texture feature set (SVP, JLGR, OLV), pp. 1–4.
ICPR-2008-Wang #string: A new method to obtain the shift-table in Boyer-Moore’s string matching algorithm (YW), pp. 1–4.
ICPR-2008-WangW #estimation: A factorization algorithm for trifocal tensor estimation (LW, FW), pp. 1–4.
ICPR-2008-WangWCW #clustering #learning: A clustering algorithm combine the FCM algorithm with supervised learning normal mixture model (WW, CW, XC, AW), pp. 1–4.
ICPR-2008-WanYM #segmentation: A new algorithm for static camera foreground segmentation via active coutours and GMM (CW, BY, ZM), pp. 1–4.
ICPR-2008-WatanabeIHY #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-YangB #fault #sketching #using: Curve fitting algorithm using iterative error minimization for sketch beautification (JY, HB), pp. 1–4.
ICPR-2008-YangZS #comparison #optimisation #search-based: Comparison of Particle Swarm Optimization and Genetic Algorithm for HMM training (FY, CZ, TS), pp. 1–4.
ICPR-2008-ZaidiS #detection: Confidence rated boosting algorithm for generic object detection (NAZ, DS), pp. 1–4.
ICPR-2008-ZhongGA #classification: Properties of the k-norm pruning algorithm for decision tree classifiers (MZ, MG, GCA), pp. 1–4.
ICPR-2008-ZitouniSOD #graph #image #ranking #using #web: Re-ranking of web image search results using a graph algorithm (HZ, SGS, DO, PD), pp. 1–4.
KDD-2008-BecchettiBCG #graph #performance: Efficient semi-streaming algorithms for local triangle counting in massive graphs (LB, PB, CC, AG), pp. 16–24.
KDD-2008-GuptaFFSK #approximate #evaluation #mining: Quantitative evaluation of approximate frequent pattern mining algorithms (RG, GF, BF, MS, VK), pp. 301–309.
KDD-2008-ZhangZW #named #performance: Fastanova: an efficient algorithm for genome-wide association study (XZ, FZ, WW), pp. 821–829.
KDD-2008-ZhaoWZ #named #performance #virtual machine: Cuts3vm: a fast semi-supervised svm algorithm (BZ, FW, CZ), pp. 830–838.
RecSys-2008-TakacsPNT #matrix #problem: Matrix factorization and neighbor based algorithms for the netflix prize problem (GT, IP, BN, DT), pp. 267–274.
SEKE-2008-ChenLMW #case study #optimisation #polynomial #problem #verification: Verification of Optimization Algorithms: a Case Study of a Quadratic Assignment Problem Solver (TYC, HL, RGM, DW), pp. 16–21.
SEKE-2008-DingH #mining #named #performance: VP: an Efficient Algorithm for Frequent Itemset Mining (QD, WSH), pp. 381–386.
SEKE-2008-MiliAN: An Algorithm for Computing Loop Functions (AM, SA, CN), pp. 448–453.
SIGIR-2008-AminiTG #learning #ranking: A boosting algorithm for learning bipartite ranking functions with partially labeled data (MRA, TVT, CG), pp. 99–106.
SIGIR-2008-GkanogiannisK #categorisation: An algorithm for text categorization (AG, TK), pp. 869–870.
SIGIR-2008-LeeKJ #constraints #learning: Fixed-threshold SMO for Joint Constraint Learning Algorithm of Structural SVM (CL, HK, MGJ), pp. 829–830.
SIGIR-2008-PickensGSQB #collaboration: Algorithmic mediation for collaborative exploratory search (JP, GG, CS, PQ, MB), pp. 315–322.
SIGIR-2008-ZhangZL #rank #recommendation #topic: A topical PageRank based algorithm for recommender systems (LZ, KZ, CL), pp. 713–714.
MoDELS-2008-ShoushaBL #analysis #concurrent #search-based #uml: A UML/SPT Model Analysis Methodology for Concurrent Systems Based on Genetic Algorithms (MS, LCB, YL), pp. 475–489.
MoDELS-2008-ShoushaBL #analysis #concurrent #search-based #uml: A UML/SPT Model Analysis Methodology for Concurrent Systems Based on Genetic Algorithms (MS, LCB, YL), pp. 475–489.
LOPSTR-2008-AlpuenteEMO #composition #equation: A Modular Equational Generalization Algorithm (MA, SE, JM, PO), pp. 24–39.
LOPSTR-2008-MontenegroPS: An Inference Algorithm for Guaranteeing Safe Destruction (MM, RPM, CS), pp. 135–151.
PEPM-2008-Mu #bound #problem: Maximum segment sum is back: deriving algorithms for two segment problems with bounded lengths (SCM), pp. 31–39.
POPL-2008-Chaudhuri #recursion #state machine: Subcubic algorithms for recursive state machines (SC), pp. 159–169.
PPDP-2008-ChitilD #debugging #finite #functional #higher-order #source code: Comprehending finite maps for algorithmic debugging of higher-order functional programs (OC, TD), pp. 205–216.
SAC-2008-BezerraW #detection #process: Anomaly detection algorithms in logs of process aware systems (FdLB, JW), pp. 951–952.
SAC-2008-BuenoTT #data access #effectiveness #metric #optimisation: An algorithm for effective deletion and a new optimization technique for metric access methods (RB, AJMT, CTJ), pp. 1034–1035.
SAC-2008-Denner-Broser #analysis #problem #using: An algorithm for the tracing problem using interval analysis (BDB), pp. 1832–1837.
SAC-2008-FonsecaCC #named #nearest neighbour: k-RNN: k-relational nearest neighbour algorithm (NAF, VSC, RC), pp. 944–948.
SAC-2008-GoldbargGM: Selecting beam directions in radiotherapy with an evolutionary algorithm (MCG, EFGG, CRAM), pp. 1420–1421.
SAC-2008-GoldsztejnMR #approximate #performance #quantifier: An efficient algorithm for a sharp approximation of universally quantified inequalities (AG, CM, MR), pp. 134–139.
SAC-2008-Kavallieratou: An objective way to evaluate and compare binarization algorithms (EK), pp. 397–401.
SAC-2008-KuangZ #detection #using: An anomaly intrusion detection method using the CSI-KNN algorithm (LK, MZ), pp. 921–926.
SAC-2008-LasserreLR #algebra: Computing the real variety of an ideal: a real algebraic and symbolic-numeric algorithm (JBL, ML, PR), pp. 1845–1846.
SAC-2008-MaK #search-based: Dynamic populations in genetic algorithms (Z(M, AWK), pp. 1807–1811.
SAC-2008-MakrisPPS #personalisation #web: An integrated web system to facilitate personalized web searching algorithms (CM, YP, YP, ES), pp. 2397–2402.
SAC-2008-MariSPZL #3d #re-engineering: Improving the neural meshes algorithm for 3D surface reconstruction with edge swap operations (JFM, JHS, GP, MRZ, ALML), pp. 1236–1240.
SAC-2008-MengleG #ambiguity #classification #feature model #using: Using ambiguity measure feature selection algorithm for support vector machine classifier (SSRM, NG), pp. 916–920.
SAC-2008-MontanaTT #data type #mining: Data stream mining for market-neutral algorithmic trading (GM, KT, TT), pp. 966–970.
SAC-2008-RadtkeSW #classification #using: Using the RRT algorithm to optimize classification systems for handwritten digits and letters (PVWR, RS, TW), pp. 1748–1752.
SAC-2008-RaveendranBG #evaluation #realtime #scheduling #trade-off: Evaluation of priority based real time scheduling algorithms: choices and tradeoffs (BKR, SB, SG), pp. 302–307.
SAC-2008-RibeiroTT #feature model: A new algorithm for data discretization and feature selection (MXR, AJMT, CTJ), pp. 953–954.
SAC-2008-SaffarianM #novel #protocol: A novel protocol to prevent malicious nodes from misdirecting forward ants in AntNet algorithm (MS, MCM), pp. 1849–1853.
SAC-2008-SeifertWK #detection #divide and conquer #interactive #paradigm: Application of divide-and-conquer algorithm paradigm to improve the detection speed of high interaction client honeypots (CS, IW, PK), pp. 1426–1432.
SAC-2008-SeoKRK #2d #deployment #search-based: A genetic algorithm for sensor deployment based on two-dimensional operators (JHS, YHK, HBR, SJK), pp. 1812–1813.
SAC-2008-ToledoFR #problem #scheduling #search-based: Evaluating genetic algorithms with different population structures on a lot sizing and scheduling problem (CFMT, PMF, KAR), pp. 1777–1781.
SAC-2008-Tso-SutterMS #collaboration #recommendation: Tag-aware recommender systems by fusion of collaborative filtering algorithms (KHLTS, LBM, LST), pp. 1995–1999.
SAC-2008-VellosoR #analysis: Percolation analyses in a swarm based algorithm for shortest-path finding (BPV, MR), pp. 1861–1865.
GPCE-2008-JarviMPFS #component #modelling #reuse: Property models: from incidental algorithms to reusable components (JJ, MM, SP, JF, JNS), pp. 89–98.
CASE-2008-ArnaoutMR #optimisation #parallel #problem #scheduling: Ant colony optimization algorithm to parallel machine scheduling problem with setups (JPA, RM, GR), pp. 578–582.
CASE-2008-BandaruN #combinator #composition #performance #web #web service: Efficient algorithms for combinatorial auctions with volume discounts arising in web service composition (PB, YN), pp. 995–1000.
CASE-2008-BeghiBBC #design #simulation: A simulation environment for dry-expansion evaporators with application to the design of autotuning control algorithms for electronic (AB, UB, CB, LC), pp. 814–820.
CASE-2008-BittonG #framework #named: Hydra: A framework and algorithms for mixed-initiative UAV-assisted search and rescue (EB, KG), pp. 61–66.
CASE-2008-ChuCSC #polynomial: An O(T3) Polynomial algorithm for crude oil transportation (FC, CC, QS, HC), pp. 303–308.
CASE-2008-DangWLZ #image: Heavy-ion radiotherapy treatment planning system and medical image processing algorithm used in it (JD, YW, SL, ZZ), pp. 726–731.
CASE-2008-SakuraiOKT #delivery #multi #problem #search-based: A multi-inner-world Genetic Algorithm to optimize delivery problem with interactive-time (YS, TO, SK, ST), pp. 583–590.
CASE-2008-SongQXKLG: System and algorithms for an autonomous observatory assisting the search for the Ivory-Billed Woodpecker (DS, NQ, YX, CYK, DL, KG), pp. 200–205.
CASE-2008-TanakaF #performance #scheduling: An efficient exact algorithm for general single-machine scheduling with machine idle time (ST, SF), pp. 371–376.
CASE-2008-WengF #evolution #problem #scheduling: Self evolution algorithm for common due date scheduling problem (WW, SF), pp. 790–795.
CASE-2008-XuFWY #multi #problem: An Or-opt NSGA-II algorithm for multi-objective Vehicle Routing Problem with Time Windows (HX, WF, TW, LY), pp. 309–314.
DAC-2008-BharathES #automation #search-based #using: Automatic package and board decoupling capacitor placement using genetic algorithms and M-FDM (KB, EE, MS), pp. 560–565.
DAC-2008-CaoFHS #multi #scalability: Optimality and improvement of dynamic voltage scaling algorithms for multimedia applications (ZC, BF, LH, MvdS), pp. 179–184.
DAC-2008-ChangWSC #energy #multi #named: ETAHM: an energy-aware task allocation algorithm for heterogeneous multiprocessor (PCC, IWW, JJJS, CPC), pp. 776–779.
DAC-2008-El-MoselhyEW #parametricity #performance #scalability #set: Efficient algorithm for the computation of on-chip capacitance sensitivities with respect to a large set of parameters (TAEM, IME, DW), pp. 906–911.
DAC-2008-HsuW #memory management #network #power management: A generalized network flow based algorithm for power-aware FPGA memory mapping (TYH, TCW), pp. 30–33.
DAC-2008-JiangS #scalability: Circuit-wise buffer insertion and gate sizing algorithm with scalability (ZJ, WS), pp. 708–713.
DAC-2008-WangZ #incremental #performance: An efficient incremental algorithm for min-area retiming (JW, HZ), pp. 528–533.
DAC-2008-YuhSYC: A progressive-ILP based routing algorithm for cross-referencing biochips (PHY, SSS, CLY, YWC), pp. 284–289.
DAC-2008-ZhangGT #2d #configuration management #fault tolerance: A reconfigurable routing algorithm for a fault-tolerant 2D-Mesh Network-on-Chip (ZZ, AG, ST), pp. 441–446.
DATE-2008-AltCS #architecture #detection #hardware #realtime: Hardware/software architecture of an algorithm for vision-based real-time vehicle detection in dark environments (NA, CC, WS), pp. 176–181.
DATE-2008-FangH #approximate #performance #satisfiability: A Fast Approximation Algorithm for MIN-ONE SAT (LF, MSH), pp. 1087–1090.
DATE-2008-FrechetteL #detection #fault #self: Error Detection/Correction in DNA Algorithmic Self-Assembly (SF, FL), pp. 1079–1082.
DATE-2008-HashemiG #approximate #pipes and filters #synthesis: Exact and Approximate Task Assignment Algorithms for Pipelined Software Synthesis (MH, SG), pp. 746–751.
DATE-2008-KoenigSB #novel #recursion: A Novel Recursive Algorithm for Bit-Efficient Realization of Arbitrary Length Inverse Modified Cosine Transforms (RK, TS, JB), pp. 604–609.
DATE-2008-LuMGB #for free #performance: An efficient algorithm for free resources management on the FPGA (YL, TM, GG, KB), pp. 1095–1098.
DATE-2008-MarconiLBG #configuration management #online: Intelligent Merging Online Task Placement Algorithm for Partial Reconfigurable Systems (TM, YL, KB, GG), pp. 1346–1351.
DATE-2008-Marques-SilvaP #satisfiability #using: Algorithms for Maximum Satisfiability using Unsatisfiable Cores (JMS, JP), pp. 408–413.
DATE-2008-MeisterLT #component #novel: Novel Pin Assignment Algorithms for Components with Very High Pin Counts (TM, JL, GT), pp. 837–842.
DATE-2008-SathanurPBMMP #framework #scalability: A Scalable Algorithmic Framework for Row-Based Power-Gating (AVS, AP, LB, AM, EM, MP), pp. 379–384.
DATE-2008-VillenaS #named #order #reduction #scalability: SPARE — a Scalable algorithm for passive, structure preserving, Parameter-Aware model order REduction (JFV, LMS), pp. 586–591.
DATE-2008-WuH #design #performance #validation: Efficient Design Validation Based on Cultural Algorithms (WW, MSH), pp. 402–407.
PDP-2008-BoudaniCSS #simulation: Internet-Scale Simulations of a Peer Selection Algorithm (AB, YC, GS, GS), pp. 531–535.
PDP-2008-CaromelHL #type safety: Type Safe Algorithmic Skeletons (DC, LH, ML), pp. 45–53.
PDP-2008-CordascoMR: Extending IC-Scheduling via the Sweep Algorithm (GC, GM, ALR), pp. 366–373.
PDP-2008-KangR #energy #parallel: Dynamic Algorithms for Energy Minimization on Parallel Machines (JK, SR), pp. 399–406.
PDP-2008-LarreaACL #evaluation: An Evaluation of Communication-Optimal P Algorithms (ML, ISA, RC, AL), pp. 274–279.
PDP-2008-LeonMRS #2d #distributed #parallel #problem: A Distributed Parallel Algorithm to Solve the 2D Cutting Stock Problem (CL, GM, CR, CS), pp. 429–434.
PDP-2008-LinC #clustering #graph #internet #named #parallel #simulation: BC-GA: A Graph Partitioning Algorithm for Parallel Simulation of Internet Applications (SL, XC), pp. 358–365.
PDP-2008-Quintana-OrtiQCGZ #architecture #manycore #scheduling: Scheduling of QR Factorization Algorithms on SMP and Multi-Core Architectures (GQO, ESQO, EC, RAvdG, FGVZ), pp. 301–310.
PPoPP-2008-AnsariKJLKW #adaptation #case study #concurrent #experience #memory management #transaction #using: Experiences using adaptive concurrency in transactional memory with Lee’s routing algorithm (MA, CK, KJ, ML, CCK, IW), pp. 261–262.
ESOP-2008-GulwaniM: Cover Algorithms and Their Combination (SG, MM), pp. 193–207.
FASE-2008-MohaGMD #analysis #design #detection #fault: A Domain Analysis to Specify Design Defects and Generate Detection Algorithms (NM, YGG, AFLM, LD), pp. 276–291.
STOC-2008-BansalBN #random: Randomized competitive algorithms for generalized caching (NB, NB, JN), pp. 235–244.
STOC-2008-ChenLL #feedback #parametricity #problem #set: A fixed-parameter algorithm for the directed feedback vertex set problem (JC, YL, SL, BO, IR), pp. 177–186.
STOC-2008-ColeF #problem: Fast-converging tatonnement algorithms for one-time and ongoing market problems (RC, LF), pp. 315–324.
STOC-2008-DaitchS #approximate #performance: Faster approximate lossy generalized flow via interior point algorithms (SID, DAS), pp. 451–460.
STOC-2008-DasK #linear #set: Algorithms for subset selection in linear regression (AD, DK), pp. 45–54.
STOC-2008-FakcharoenpholL #approximate #problem: An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem (JF, BL), pp. 153–158.
STOC-2008-Feldman #learning: Evolvability from learning algorithms (VF), pp. 619–628.
STOC-2008-ODonnellW #testing: An optimal sdp algorithm for max-cut, and equally optimal long code tests (RO, YW), pp. 335–344.
STOC-2008-Raghavendra #csp #question: Optimal algorithms and inapproximability results for every CSP? (PR), pp. 245–254.
STOC-2008-ReichardtS #quantum: Span-program-based quantum algorithm for evaluating formulas (BR, RS), pp. 103–112.
TACAS-2008-WulfDMR #anti #ltl #model checking #named #satisfiability: Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking (MDW, LD, NM, JFR), pp. 63–77.
CAV-2008-GlabbeekP #simulation: Correcting a Space-Efficient Simulation Algorithm (RJvG, BP), pp. 517–529.
CSL-2008-Schewe #game studies: An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games (SS), pp. 369–384.
ICLP-2008-CohenSS #logic programming #source code: Dynamic Programming Algorithms as Products of Weighted Logic Programs (SBC, RJS, NAS), pp. 114–129.
ICLP-2008-SenniPP #constraints #logic programming #source code: A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs (VS, AP, MP), pp. 284–300.
ICLP-2008-VanhoofD #logic programming #source code: An Algorithm for Sophisticated Code Matching in Logic Programs (WV, FD), pp. 785–789.
ICLP-2008-ZhangYLM #constraints #functional #performance: Efficient Algorithms for Functional Constraints (YZ, RHCY, CL, SM), pp. 606–620.
SAT-2008-Gao #complexity #problem #random: Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms (YG), pp. 91–104.
SAT-2008-GeorgiouP #complexity #satisfiability: Complexity and Algorithms for Well-Structured k-SAT Instances (KG, PAP), pp. 105–118.
SAT-2008-LetombeM #hybrid #incremental #satisfiability: Improvements to Hybrid Incremental SAT Algorithms (FL, JMS), pp. 168–181.
SAT-2008-Marques-SilvaM #effectiveness #satisfiability #towards: Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms (JMS, VMM), pp. 225–230.
VMCAI-2008-BagnaraHZ #constraints #integer: An Improved Tight Closure Algorithm for Integer Octagonal Constraints (RB, PMH, EZ), pp. 8–21.
VMCAI-2008-RanzatoRT #abstraction #refinement: A Forward-Backward Abstraction Refinement Algorithm (FR, ORD, FT), pp. 248–262.
VMCAI-2008-SohailSR #game studies #hybrid #ltl: A Hybrid Algorithm for LTL Games (SS, FS, KR), pp. 309–323.
CBSE-2007-MallickS #approach #constraints #web #web service: Capturing Web Services Provider Constraints — An Algorithmic Approach (SM, SVS), pp. 211–226.
DocEng-2007-Mello #documentation #image: A new Tsallis entropy-based thresholding algorithm for images of historical documents (CABM), pp. 32–34.
DRR-2007-Marosi #adaptation #architecture #industrial: Industrial OCR approaches: architecture, algorithms, and adaptation techniques (IM).
ECDL-2007-DiederichB #automation #categorisation #semantics: The Semantic GrowBag Algorithm: Automatically Deriving Categorization Systems (JD, WTB), pp. 1–13.
ECDL-2007-GiunchigliaZK #classification #documentation #formal method: Formalizing the Get-Specific Document Classification Algorithm (FG, IZ, UK), pp. 26–37.
ICDAR-2007-EgoziDCF #detection: An EM Based Algorithm for Skew Detection (AE, ID, JC, MCF), pp. 277–281.
ICDAR-2007-HamamuraAI #probability #recognition #using #word: An Analytic Word Recognition Algorithm Using a Posteriori Probability (TH, TA, BI), pp. 669–673.
ICDAR-2007-MasSLL #diagrams #incremental #online #parsing #sketching: An Incremental On-line Parsing Algorithm for Recognizing Sketching Diagrams (JM, GS, JL, BL), pp. 452–456.
ICDAR-2007-MaWXD #evaluation #locality #performance: Usage-Oriented Performance Evaluation for Text Localization Algorithms (YM, CW, BX, RD), pp. 1033–1037.
ICDAR-2007-MelloBZM #performance: An Efficient Thresholding Algorithm for Brazilian Bank Checks (CABM, BLDB, CZ, VM), pp. 193–197.
ICDAR-2007-RamirezTBR #linear #robust: Quantile Linear Algorithm for Robust Binarization of Digitalized Letters (MR, ET, MB, RR), pp. 1158–1162.
PODS-2007-ChakaravarthyPRAM #approximate #identification: Decision trees for entity identification: approximation algorithms and hardness results (VTC, VP, SR, PA, MKM), pp. 53–62.
SIGMOD-2007-BandiMAA #data type #performance #using: Fast data stream algorithms using associative memories (NB, AM, DA, AEA), pp. 247–256.
SIGMOD-2007-GouC #performance #xpath: Efficient algorithms for evaluating xpath over streams (GG, RC), pp. 269–280.
SIGMOD-2007-ParkS #approximate: Approximate algorithms for K-anonymity (HP, KS), pp. 67–78.
VLDB-2007-AkbariniaPV #query: Best Position Algorithms for Top-k Queries (RA, EP, PV), pp. 495–506.
VLDB-2007-AraiDGK #metric: Anytime Measures for Top-k Algorithms (BA, GD, DG, NK), pp. 914–925.
VLDB-2007-Liu #modelling #privacy: From Data Privacy to Location Privacy: Models and Algorithms (LL), pp. 1429–1430.
VLDB-2007-XuJ #query #random: Randomized Algorithms for Data Reconciliation in Wide Area Aggregate Query Processing (FX, CJ), pp. 639–650.
ITiCSE-2007-ChinnSM #data type #performance #problem #student: Problem solving and student performance in data structures and algorithms (DDC, CS, KM), pp. 241–245.
ITiCSE-2007-CrescenziN #experience #visualisation: Fully integrating algorithm visualization into a cs2 course.: a two-year experience (PC, CN), pp. 296–300.
ITiCSE-2007-MyllerLK #collaboration #taxonomy #visualisation: Analyzing engagement taxonomy in collaborative algorithm visualization (NM, ML, AK), pp. 251–255.
ITiCSE-2007-RosslingKS #animation #flexibility #generative #performance: Easy, fast, and flexible algorithm animation generation (GR, SK, SS), p. 357.
ITiCSE-2007-Sanchez-TorrubiaTC #graph #interactive #learning #tool support: New interactive tools for graph algorithms active learning (MGST, CTB, JC), p. 337.
ICPC-2007-Vivanco #complexity #identification #metric #modelling #predict #search-based #source code #using: Use of a Genetic Algorithm to Identify Source Code Metrics Which Improves Cognitive Complexity Predictive Models (RAV), pp. 297–300.
ICSM-2007-BowmanBL #multi #search-based: Multi-Objective Genetic Algorithm to Support Class Responsibility Assignment (MB, LCB, YL), pp. 124–133.
SCAM-2007-GiffhornH #concurrent #evaluation #slicing #source code: An Evaluation of Slicing Algorithms for Concurrent Programs (DG, CH), pp. 17–26.
CIAA-J-2006-BallaRM07 #performance: Efficient Algorithms for degenerate Primer Search (SB, SR, IIM), pp. 899–910.
ICALP-2007-AlonCHKRS #graph: Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions (NA, ACO, HH, MK, VR, MS), pp. 789–800.
ICALP-2007-AlonFGKS #problem: Parameterized Algorithms for Directed Maximum Leaf Problems (NA, FVF, GG, MK, SS), pp. 352–362.
ICALP-2007-BansalCP #scheduling: Competitive Algorithms for Due Date Scheduling (NB, HLC, KP), pp. 28–39.
ICALP-2007-CaiL #artificial reality #power of: Holographic Algorithms: The Power of Dimensionality Resolved (JyC, PL), pp. 631–642.
ICALP-2007-Chazelle #design: Ushering in a New Era of Algorithm Design (BC), p. 1.
ICALP-2007-DemaineMRW #composition #distance #edit distance: An Optimal Decomposition Algorithm for Tree Edit Distance (EDD, SM, BR, OW), pp. 146–157.
ICALP-2007-DornFT: Subexponential Parameterized Algorithms (FD, FVF, DMT), pp. 15–27.
ICALP-2007-Elkin #maintenance #streaming: Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse Spanners (ME), pp. 716–727.
ICALP-2007-KontogiannisS #approximate #constant #game studies #performance: Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games (SCK, PGS), pp. 595–606.
ICALP-2007-SchroderP #composition #logic: Modular Algorithms for Heterogeneous Modal Logics (LS, DP), pp. 459–471.
SEFM-2007-ColvinG #scalability #stack #verification: A Scalable Lock-Free Stack Algorithm and its Verification (RC, LG), pp. 339–348.
SEFM-2007-DengRH #execution #object-oriented #source code #symbolic computation #towards: Towards A Case-Optimal Symbolic Execution Algorithm for Analyzing Strong Properties of Object-Oriented Programs (XD, R, JH), pp. 273–282.
CIG-2007-ButterRGHA #game studies #search-based #student: Genetic Algorithms for Finding Optimal Strategies for a Student's Game (TB, FR, JG, TH, JA), pp. 346–351.
CIG-2007-CarterL #using: An Investigation into Tournament Poker Strategy using Evolutionary Algorithms (RGC, JL), pp. 117–124.
CIG-2007-LeighLM #search-based #using: Using a Genetic Algorithm to Explore A*-like Pathfinding Algorithms (REL, SJL, CM), pp. 72–79.
AGTIVE-2007-FussT #graph transformation #model transformation #simulation #transformation language: Simulating Set-Valued Transformations with Algorithmic Graph Transformation Languages (CF, VET), pp. 442–455.
AGTIVE-2007-HeerRK #graph grammar #integration #ontology: Algorithm and Tool for Ontology Integration Based on Graph Rewriting (TH, DR, BK), pp. 577–582.
AGTIVE-2007-MaierM #editing #layout #metamodelling #modelling: A Generic Layout Algorithm for Meta-model Based Editors (SM, MM), pp. 66–81.
DHM-2007-GaoLZX: A Motion Compensated De-interlacing Algorithm for Motive Object Capture (LG, CL, CZ, ZX), pp. 74–81.
DHM-2007-GeraciLMPR #array #clustering #scalability: FPF-SB : A Scalable Algorithm for Microarray Gene Expression Data Clustering (FG, ML, MM, MP, MER), pp. 606–615.
DHM-2007-KangXCX: A New Decoding Algorithm in MIMO-ZP-OFDM Systems (RK, CX, HC, HX), pp. 130–135.
DHM-2007-LiLZ #approach #identification #modelling #multi #robust: A Robust Algorithm for a System Identification Approach to Digital Human Modeling: An Application to Multi-fingered Hand Movement (KL, SWL, XZ), pp. 157–160.
DHM-2007-SongLM #estimation #performance: A Fast Motion Estimation Algorithm for H.264 (JS, BL, QlM), pp. 189–196.
DHM-2007-XuWZZ #complexity #predict: An Epileptic Seizure Prediction Algorithm from Scalp EEG Based on Morphological Filter and Kolmogorov Complexity (GX, JW, QZ, JZ), pp. 736–746.
HCI-AS-2007-HongJ #design #development #education #mobile: Design and Development of Mixed Mobile Education System Based on SIFT Algorithm (KH, KJ), pp. 255–263.
HCI-AS-2007-ZhangLL #fault #random: A Routing Algorithm for Random Error Tolerance in Network-on-Chip (LZ, HL, XL), pp. 1210–1219.
HCI-MIE-2007-ChenC07a #design #fault #feedback: An Improved H.264 Error Concealment Algorithm with User Feedback Design (XC, YYC), pp. 815–820.
HCI-MIE-2007-KimKK #architecture #low cost: Human-Aided Cleaning Algorithm for Low-Cost Robot Architecture (SK, KK, THK), pp. 366–375.
HCI-MIE-2007-ShukranCC #implementation #usability #video: Implementation of a New H.264 Video Watermarking Algorithm with Usability Test (MAMS, YYC, XC), pp. 963–970.
HCI-MIE-2007-SunCSC #gesture #integration #interface #natural language: An Input-Parsing Algorithm Supporting Integration of Deictic Gesture in Natural Language Interface (YS, FC, Y(S, VC), pp. 206–215.
HIMI-IIE-2007-MoradiKSH #detection #navigation #realtime: A Real-Time GPU-Based Wall Detection Algorithm for Mapping and Navigation in Indoor Environments (HM, EK, DNS, JH), pp. 1072–1077.
HIMI-MTT-2007-CrawfordCM #development #information management #optimisation: Knowledge Management in the Development of Optimization Algorithms (BC, CC, EM), pp. 604–612.
ICEIS-AIDSS-2007-CuellarDP #hybrid #network #problem: Problems and Features of Evolutionary Algorithms to Build Hybrid Training Methods for Recurrent Neural Networks (MPC, MD, MdCPJ), pp. 204–211.
ICEIS-AIDSS-2007-PascaleT #image #search-based: A Niche Based Genetic Algorithm for Image Registration (GP, LT), pp. 342–347.
ICEIS-AIDSS-2007-WenningGTSK #distributed #framework: Investigations on Object-Centered Routing in Dynamic Environments: Algorithmic Framework and Initial Numerical Results — Support for Distributed Decision Making in Transport Systems (BLW, CG, ATG, JS, HK), pp. 225–230.
ICEIS-DISI-2007-Chen #pattern matching: A new algorithm for twig pattern matching (YC), pp. 44–51.
CIKM-2007-ChanZ #evaluation #performance #query: A fast unified optimal route query evaluation algorithm (EPFC, JZ), pp. 371–380.
CIKM-2007-ZhangW #approximate #data type #performance: An efficient algorithm for approximate biased quantile computation in data streams (QZ, WW), pp. 1023–1026.
ECIR-2007-McDonald #case study #multi #summary: A Study of Global Inference Algorithms in Multi-document Summarization (RTM), pp. 557–564.
ECIR-2007-PaltoglouSS #modelling #multi #using: Results Merging Algorithm Using Multiple Regression Models (GP, MS, MS), pp. 173–184.
ICML-2007-AimeurBG #clustering #quantum: Quantum clustering algorithms (EA, GB, SG), pp. 1–8.
ICML-2007-Azran #learning #markov #multi #random: The rendezvous algorithm: multiclass semi-supervised learning with Markov random walks (AA), pp. 49–56.
ICML-2007-CortesMR #ranking: Magnitude-preserving ranking algorithms (CC, MM, AR), pp. 169–176.
ICML-2007-DollarRB #analysis #learning: Non-isometric manifold learning: analysis and an algorithm (PD, VR, SJB), pp. 241–248.
ICML-2007-EspositoR #classification #evaluation #named #performance: CarpeDiem: an algorithm for the fast evaluation of SSL classifiers (RE, DPR), pp. 257–264.
ICML-2007-GhavamzadehE: Bayesian actor-critic algorithms (MG, YE), pp. 297–304.
ICML-2007-GlobersonKCC #predict: Exponentiated gradient algorithms for log-linear structured prediction (AG, TK, XC, MC), pp. 305–312.
ICML-2007-KimC #geometry #message passing: Neighbor search with global geometry: a minimax message passing algorithm (KHK, SC), pp. 401–408.
ICML-2007-NguyenG #sequence: Comparisons of sequence labeling algorithms and extensions (NN, YG), pp. 681–688.
ICML-2007-SunJSF #kernel #learning: A kernel-based causal learning algorithm (XS, DJ, BS, KF), pp. 855–862.
ICML-2007-TsampoukaS #approximate: Approximate maximum margin algorithms with rules controlled by the number of mistakes (PT, JST), pp. 903–910.
ICML-2007-WangYL #kernel: A kernel path algorithm for support vector machines (GW, DYY, FHL), pp. 951–958.
ICML-2007-Werner #consistency #question #what: What is decreased by the max-sum arc consistency algorithm? (TW), pp. 1007–1014.
KDD-2007-LaxmanSU #performance: A fast algorithm for finding frequent episodes in event streams (SL, PSS, KPU), pp. 410–419.
KDD-2007-XuYFS #clustering #named #network: SCAN: a structural clustering algorithm for networks (XX, NY, ZF, TAJS), pp. 824–833.
MLDM-2007-GomezF #2d #evolution #hybrid #image #learning: A Hybrid Algorithm Based on Evolution Strategies and Instance-Based Learning, Used in Two-Dimensional Fitting of Brightness Profiles in Galaxy Images (JCG, OF), pp. 716–726.
MLDM-2007-HulsmannF #comparison #multi #novel #optimisation #parametricity: Comparison of a Novel Combined ECOC Strategy with Different Multiclass Algorithms Together with Parameter Optimization Methods (MH, CMF), pp. 17–31.
MLDM-2007-PalancarTCL #distributed #memory management #mining #parallel: Distributed and Shared Memory Algorithm for Parallel Mining of Association Rules (JHP, OFT, JFC, RHL), pp. 349–363.
MLDM-2007-SuarezM #clustering: A Clustering Algorithm Based on Generalized Stars (APS, JEMP), pp. 248–262.
MLDM-2007-ZagorisPK #fuzzy #reduction #self #using: Color Reduction Using the Combination of the Kohonen Self-Organized Feature Map and the Gustafson-Kessel Fuzzy Algorithm (KZ, NP, IK), pp. 703–715.
RecSys-2007-BogersB #information retrieval #recommendation: Comparing and evaluating information retrieval algorithms for news recommendation (TB, AvdB), pp. 141–144.
RecSys-2007-ZhangP #collaboration #predict #recommendation #recursion: A recursive prediction algorithm for collaborative filtering recommender systems (JZ, PP), pp. 57–64.
SEKE-2007-SantosH #detection #semantics #xml: A Semantical Change Detection Algorithm for XML (RCS, CSH), pp. 438–443.
SIGIR-2007-ChibaneD #layout #segmentation #topic #visual notation #web: A web page topic segmentation algorithm based on visual criteria and content layout (IC, BLD), pp. 817–818.
SIGIR-2007-RaghavanA #feedback #interactive: An interactive algorithm for asking and incorporating feature feedback into support vector machines (HR, JA), pp. 79–86.
SIGIR-2007-ShahKF #case study #feedback: Making mind and machine meet: a study of combining cognitive and algorithmic relevance feedback (CS, DK, XF), pp. 877–878.
SIGIR-2007-XuL #information retrieval #named: AdaRank: a boosting algorithm for information retrieval (JX, HL), pp. 391–398.
LOPSTR-2007-CasasCH #independence #logic programming #source code #strict: Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs (AC, MC, MVH), pp. 138–153.
SAS-2007-WeiMZC #decompiler #identification: A New Algorithm for Identifying Loops in Decompilation (TW, JM, WZ, YC), pp. 170–183.
SAC-2007-Chiong #search-based #using: Applying genetic algorithms to economy market using iterated prisoner’s dilemma (RC), pp. 733–737.
SAC-2007-GooneratneTH #graph #traversal #using #verification #web #web service: Verification of web service descriptions using graph-based traversal algorithms (NG, ZT, JH), pp. 1385–1392.
SAC-2007-HungCYCS #architecture #design #energy: An architectural co-synthesis algorithm for energy-aware network-on-chip design (WHH, YJC, CLY, YSC, APS), pp. 680–684.
SAC-2007-KimmSS #evaluation #linux #mobile #scalability: Evaluation of interval-based dynamic voltage scaling algorithms on mobile Linux system (HK, SYS, COS), pp. 1141–1145.
SAC-2007-KunXY #constraints #geometry #parallel #theorem proving: Parallel algorithms on geometric constraint solving (KJ, YG, XL, YZ), pp. 778–779.
SAC-2007-LinsS #documentation: A quantitative method for assessing algorithms to remove back-to-front interference in documents (RDL, JMMdS), pp. 610–616.
SAC-2007-MilsztajnG #3d #markov #random #search-based #segmentation #using: Three-dimensional segmentation of brain tissues using Markov random fields and genetic algorithms (FM, KdG), pp. 745–746.
SAC-2007-SarfrazR #image #polynomial #random #using: A randomized knot insertion algorithm for outline capture of planar images using cubic spline (MS, AR), pp. 71–75.
SAC-2007-SilvaL #documentation #performance: A fast algorithm to binarize and filter documents with back-to-front interference (JMMdS, RDL), pp. 639–640.
SAC-2007-StanchinaM #garbage collection #performance #realtime: Exploiting the efficiency of generational algorithms for hardware-supported real-time garbage collection (SS, MM), pp. 713–718.
SAC-2007-Teo #adaptation #generative #optimisation: Investigating adaptive mutation in the generalized generation gap (G3) algorithm for unconstrained global optimization (JT), pp. 743–744.
SAC-2007-WaltersHC #distributed: Selecting a distributed agreement algorithm (RJW, PH, SC), pp. 586–587.
SAC-2007-YapaK #component #image: A connected component labeling algorithm for grayscale images and application of the algorithm on mammograms (RDY, HK), pp. 146–152.
SAC-2007-ZhangZZMY #random #streaming: A priority random sampling algorithm for time-based sliding windows over weighted streaming data (LZ, ZL, YQZ, YM, ZY), pp. 453–456.
CASE-2007-ChengOKKO #problem #scheduling: Simulated Annealing Algorithm for Daily Nursing Care Scheduling Problem (MC, HIO, NK, KK, JO), pp. 507–512.
CASE-2007-FontanelliRS #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.
CASE-2007-GoemansAGS #automation #composition #design #industrial #physics: Automated Feeding of Industrial Parts with Modular Blades: Design Software, Physical Experiments, and an Improved Algorithm (OCG, MTA, KG, AFvdS), pp. 318–325.
CASE-2007-LiuWL #design #effectiveness #multi #platform #product line #search-based #towards #using: Towards Effective Multi-platforming Design of Product Family using Genetic Algorithm (ZL, YSW, KSL), pp. 300–305.
CASE-2007-MartinWS #online #performance: Offline and Online Evolutionary Bi-Directional RRT Algorithms for Efficient Re-Planning in Dynamic Environments (SRM, SEW, JWS), pp. 1131–1136.
CASE-2007-MolterMZHBLM #metric: Algorithm Advancements for the Measurement of Single Cell Oxygen Consumption Rates (TWM, SM, MZ, MH, LWB, MEL, DRM), pp. 386–391.
CASE-2007-PlanckaertDBBR: Metal transfer characterization with an active contour algorithm in MIG/MAG welding movies (JPP, EHD, DB, FB, FR), pp. 933–938.
CASE-2007-SuLCW #implementation: Implementation Considerations of Various Virtual Metrology Algorithms (YCS, THL, FTC, WMW), pp. 276–281.
CASE-2007-YogeswaranPT #heuristic #hybrid #problem #search-based #using: An hybrid heuristic using genetic algorithm and simulated annealing algorithm to solve machine loading problem in FMS (MY, SGP, MKT), pp. 182–187.
CASE-2007-YoonHMSR #image #navigation #performance #using: Efficient Navigation Algorithm Using 1D Panoramic Images (SY, WH, SKM, YS, KSR), pp. 536–541.
CC-2007-FiremanPZ: New Algorithms for SIMD Alignment (LF, EP, AZ), pp. 1–15.
CC-2007-GrundH #performance: A Fast Cutting-Plane Algorithm for Optimal Coalescing (DG, SH), pp. 111–125.
CGO-2007-KulkarniWT #heuristic #optimisation #order: Evaluating Heuristic Optimization Phase Order Search Algorithms (PAK, DBW, GST), pp. 157–169.
DAC-2007-ChenYCHL #design #metaprogramming #named: MP-trees: A Packing-Based Macro Placement Algorithm for Mixed-Size Designs (TCC, PHY, YWC, FJH, DL), pp. 447–452.
DAC-2007-ChiouJCC #fine-grained #power management: Fine-Grained Sleep Transistor Sizing Algorithm for Leakage Power Minimization (DSC, DCJ, YTC, SCC), pp. 81–86.
DAC-2007-FangHC #design #integer #linear #programming: An Integer Linear Programming Based Routing Algorithm for Flip-Chip Design (JWF, CHH, YWC), pp. 606–611.
DAC-2007-HanS #named #performance #preprocessor: Alembic: An Efficient Algorithm for CNF Preprocessing (HH, FS), pp. 582–587.
DAC-2007-LiuLC #approximate #multi #optimisation #using: A Provably Good Approximation Algorithm for Power Optimization Using Multiple Supply Voltages (HYL, WPL, YWC), pp. 887–890.
DAC-2007-OstlerC #approximate #architecture #concurrent #multi #network #thread: Approximation Algorithm for Data Mapping on Block Multi-threaded Network Processor Architectures (CO, KSC), pp. 801–804.
DAC-2007-PanC #named: IPR: An Integrated Placement and Routing Algorithm (MP, CCNC), pp. 59–62.
DATE-2007-BrandenburgSHEE #approach #design #novel #prototype: From algorithm to first 3.5G call in record time: a novel system design approach based on virtual prototyping and its consequences for interdisciplinary system design teams (MB, AS, SH, JE, TE), pp. 828–830.
DATE-2007-CuiDHG #2d #configuration management #online #performance: An efficient algorithm for online management of 2D area of partially reconfigurable FPGAs (JC, QD, XH, ZG), pp. 129–134.
DATE-2007-JayakumarK: An algorithm to minimize leakage through simultaneous input vector control and circuit modification (NJ, SPK), pp. 618–623.
DATE-2007-KhanATE #implementation #pipes and filters #sorting: A new pipelined implementation for minimum norm sorting used in square root algorithm for MIMO-VBLAST systems (ZK, TA, JST, ATE), pp. 1569–1574.
DATE-2007-MatarreseMCDB #performance #validation: Experimental validation of a tuning algorithm for high-speed filters (GM, CM, FC, SD, AB), pp. 421–426.
DATE-2007-SahinH #architecture #hardware #interactive #performance #predict: Interactive presentation: An efficient hardware architecture for H.264 intra prediction algorithm (ES, IH), pp. 183–188.
DATE-2007-SchamannHLB #architecture #case study #design #power management: Low power design on algorithmic and architectural level: a case study of an HSDPA baseband digital signal processing system (MS, SH, UL, MB), pp. 1406–1411.
DATE-2007-YonedaIF #configuration management #interactive #scheduling #using: Interactive presentation: An SoC test scheduling algorithm using reconfigurable union wrappers (TY, MI, HF), pp. 231–236.
DATE-2007-ZhuP #graph #probability #random: Random sampling of moment graph: a stochastic Krylov-reduction algorithm (ZZ, JRP), pp. 1502–1507.
ISMM-2007-StanchinaM #implementation #realtime: Mark-sweep or copying?: a “best of both worlds” algorithm and a hardware-supported real-time implementation (SS, MM), pp. 173–182.
PDP-2007-Baz #analysis #architecture #communication #implementation #message passing #parallel: Communication Study and Implementation Analysis of Parallel Asynchronous Iterative Algorithms on Message Passing Architectures (DEB), pp. 77–83.
PDP-2007-CastilloFCV #network: A Modified O(n) Leader Election Algorithm for Complete Networks (MC, FF, AC, JEV), pp. 189–198.
PDP-2007-GalletRV #communication #complexity #scheduling #traversal: Scheduling Communication Requests Traversing a Switch: Complexity and Algorithms (MG, YR, FV), pp. 39–46.
PDP-2007-GonzalezLMRS #parallel: A Parallel Skeleton for the Strength Pareto Evolutionary Algorithm 2 (OG, CL, GM, CR, CS), pp. 434–441.
PDP-2007-GoyenecheVAPC #architecture #distributed #network: A Distributed Data Gathering Algorithm for Wireless Sensor Networks with Uniform Architecture (MG, JEV, JJA, MP, AC), pp. 373–380.
PDP-2007-Heroux #development #kernel: Optimal Kernels to Optimal Solutions: Algorithm and Software Issues in Solver Development (MAH).
PDP-2007-HerruzoRBP #parallel #sorting: A New Parallel Sorting Algorithm based on Odd-Even Mergesort (EH, GR, JIB, OGP), pp. 18–22.
PDP-2007-WielandLL #detection #evaluation: An evaluation of ring-based algorithms for the Eventually Perfect failure detector class (JW, ML, AL), pp. 163–170.
FoSSaCS-2007-Rosu #effectiveness #problem #regular expression: An Effective Algorithm for the Membership Problem for Extended Regular Expressions (GR), pp. 332–345.
STOC-2007-AsadpourS #approximate: An approximation algorithm for max-min fair allocation of indivisible goods (AA, AS), pp. 114–121.
STOC-2007-BayatiGKNT #approximate: Simple deterministic approximation algorithms for counting matchings (MB, DG, DAK, CN, PT), pp. 122–127.
STOC-2007-BeameJR #bound #random: Lower bounds for randomized read/write stream algorithms (PB, TSJ, AR), pp. 689–698.
STOC-2007-CaiL #artificial reality: Holographic algorithms: from art to science (JyC, PL), pp. 401–410.
STOC-2007-Chan #graph: More algorithms for all-pairs shortest paths in weighted graphs (TMC), pp. 590–598.
STOC-2007-GilbertSTV #performance #sketching: One sketch for all: fast algorithms for compressed sensing (ACG, MJS, JAT, RV), pp. 237–246.
STOC-2007-GuhaM #approximate #learning #problem: Approximation algorithms for budgeted learning problems (SG, KM), pp. 104–113.
STOC-2007-HariharanKPB #graph: An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs (RH, TK, DP, AB), pp. 605–614.
STOC-2007-JainV: Eisenberg-Gale markets: algorithms and structural properties (KJ, VVV), pp. 364–373.
STOC-2007-KakadeKL #approximate #game studies: Playing games with approximation algorithms (SMK, ATK, KL), pp. 546–555.
STOC-2007-Lynch #distributed #modelling #proving: Distributed computing theory: algorithms, impossibility results, models, and proofs (NAL), p. 247.
STOC-2007-MooreRS #graph #morphism #on the #quantum: On the impossibility of a quantum sieve algorithm for graph isomorphism (CM, AR, PS), pp. 536–545.
TACAS-2007-Derisavi #markov: A Symbolic Algorithm for Optimal Markov Chain Lumping (SD), pp. 139–154.
TACAS-2007-DoyenR #approach #model checking: Improved Algorithms for the Automata-Based Approach to Model-Checking (LD, JFR), pp. 451–465.
TACAS-2007-Horn #game studies #performance: Faster Algorithms for Finitary Games (FH), pp. 472–484.
TACAS-2007-ZhangHEJ #performance #probability #simulation: Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations (LZ, HH, FE, DNJ), pp. 155–169.
CAV-2007-AlfaroF #game studies: An Accelerated Algorithm for 3-Color Parity Games with an Application to Timed Games (LdA, MF), pp. 108–120.
CAV-2007-BeyerHS #interface #synthesis: Algorithms for Interface Synthesis (DB, TAH, VS), pp. 4–19.
ICLP-2007-KoninckSD #logic: The Correspondence Between the Logical Algorithms Language and CHR (LDK, TS, BD), pp. 209–223.
ISSTA-2007-OstrandWB #automation #identification: Automating algorithms for the identification of fault-prone files (TJO, EJW, RMB), pp. 219–227.
LICS-2007-RanzatoT #equivalence #performance #simulation: A New Efficient Simulation Equivalence Algorithm (FR, FT), pp. 171–180.
MBT-2007-HesselP #generative #modelling #testing: A Global Algorithm for Model-Based Test Suite Generation (AH, PP), pp. 47–59.
SAT-2007-PorschenS #problem #satisfiability: Algorithms for Variable-Weighted 2-SAT and Dual Problems (SP, ES), pp. 173–186.
TAP-2007-Haiyan #distributed #proving #testing #type system: Testing and Proving Distributed Algorithms in Constructive Type Theory (QH), pp. 79–94.
TestCom-FATES-2007-PapSKN #bound #finite #generative #incremental #state machine #testing: A Bounded Incremental Test Generation Algorithm for Finite State Machines (ZP, MS, GK, GÁN), pp. 244–259.
VMCAI-2007-Madhusudan #learning #verification: Learning Algorithms and Formal Verification (PM), p. 214.
ECDL-2006-FuGF #clustering #collaboration #query: A Hierarchical Query Clustering Algorithm for Collaborative Querying (LF, DHLG, SSBF), pp. 441–444.
JCDL-2006-JordanWG #feedback #generative #query #using: Using controlled query generation to evaluate blind relevance feedback algorithms (CJ, CRW, QG), pp. 286–295.
PODS-2006-CondonDHW #pipes and filters #problem: Flow algorithms for two pipelined filter ordering problems (AC, AD, LH, NW), pp. 193–202.
PODS-2006-CormodeKMS #data type: Space- and time-efficient deterministic algorithms for biased quantiles over data streams (GC, FK, SM, DS), pp. 263–272.
SIGMOD-2006-KoudasSS #metric #similarity: Record linkage: similarity measures and algorithms (NK, SS, DS), pp. 802–803.
VLDB-2006-BurdickDJRV #performance: Efficient Allocation Algorithms for OLAP Over Imprecise Data (DB, PMD, TSJ, RR, SV), pp. 391–402.
VLDB-2006-DrineasM #matrix #random #set: Randomized Algorithms for Matrices and Massive Data Sets (PD, MWM), p. 1269.
VLDB-2006-KanneM #approximate #clustering #linear: A Linear Time Algorithm for Optimal Tree Sibling Partitioning and Approximation Algorithms in Natix (CCK, GM), pp. 91–102.
VLDB-2006-MoerkotteN #analysis #generative #programming: Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products (GM, TN), pp. 930–941.
VLDB-2006-ZhengFCGKD #data transformation #named #re-engineering: Crimson: A Data Management System to Support Evaluating Phylogenetic Tree Reconstruction Algorithms (YZ, SF, SC, SG, JK, SBD), pp. 1231–1234.
ITiCSE-2006-Bozic #automaton #finite #modelling: Application of finite state automata to the bakery algorithm in critical section modeling (VB), p. 362.
ITiCSE-2006-ChenWHL #benchmark #design #metric #problem: Design and applications of an algorithm benchmark system in a computational problem solving environment (MYC, JDW, JHH, DTL), pp. 123–127.
ITiCSE-2006-Lauer #interactive #visualisation: Learner interaction with algorithm visualizations: viewing vs. changing vs. constructing (TL), pp. 202–206.
ITiCSE-2006-PerrenetK #abstraction #comprehension #concept #perspective #student: Levels of abstraction in students’ understanding of the concept of algorithm: the qualitative perspective (JP, EK), pp. 270–274.
ITiCSE-2006-Snapp06a #education #graph: Teaching graph algorithms in a corn maze (RRS), p. 347.
ITiCSE-2006-WirthB #research #student: New algorithms research for first year students (AW, MB), pp. 128–132.
CSMR-2006-KaczorGH #design pattern #identification #performance: Efficient Identification of Design Patterns with Bit-vector Algorithm (OK, YGG, SH), pp. 175–184.
MSR-2006-SagerBPK #detection #java #using: Detecting similar Java classes using tree algorithms (TS, AB, MP, CK), pp. 65–71.
SCAM-2006-BeszedesGG #dependence #slicing: Graph-Less Dynamic Dependence-Based Dynamic Slicing Algorithms (ÁB, TG, TG), pp. 21–30.
SCAM-2006-SawinR #graph #runtime: Estimating the Run-Time Progress of a Call Graph Construction Algorithm (JS, AR), pp. 53–62.
DLT-J-2005-FukagawaA06 #comparison #performance: Fast Algorithms for Comparison of Similar Unordered Trees (DF, TA), pp. 703–729.
DLT-J-2005-Okhotin06 #boolean grammar #glr #parsing: Generalized Lr Parsing Algorithm for Boolean Grammars (AO), pp. 629–664.
DLT-J-2005-Tsin06 #distributed #performance: An Efficient Distributed Algorithm for 3-edge-connectivity (YHT), pp. 677–702.
CIAA-2006-BacletP: Around Hopcroft’s Algorithm (MB, CP), pp. 114–125.
CIAA-2006-PargaGR #product line #regular expression: A Family of Algorithms for Non Deterministic Regular Languages Inference (MVdP, PG, JR), pp. 265–274.
ICALP-v1-2006-Bille #regular expression: New Algorithms for Regular Expression Matching (PB), pp. 643–654.
ICALP-v1-2006-BjorklundH #satisfiability: Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings (AB, TH), pp. 548–559.
ICALP-v1-2006-CaiC #artificial reality: Some Results on Matchgates and Holographic Algorithms (JyC, VC), pp. 703–714.
ICALP-v1-2006-ChaudhuriRRT #approximate #bound: A Push-Relabel Algorithm for Approximating Degree Bounded MSTs (KC, SR, SR, KT), pp. 191–201.
ICALP-v1-2006-Fujito #approximate #how: How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover (TF), pp. 431–442.
ICALP-v1-2006-GargK: Better Algorithms for Minimizing Average Flow-Time on Related Machines (NG, AK), pp. 181–190.
ICALP-v1-2006-HariharanKM #graph #performance: A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs (RH, TK, KM), pp. 250–261.
ICALP-v1-2006-KortsarzN #approximate #problem: Tight Approximation Algorithm for Connectivity Augmentation Problems (GK, ZN), pp. 443–452.
ICALP-v1-2006-RaviS #approximate: Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs (RR, MS), pp. 169–180.
FM-2006-GenonMM #distributed #ltl #monitoring #performance #sequence: Monitoring Distributed Controllers: When an Efficient LTL Algorithm on Sequences Is Needed to Model-Check Traces (AG, TM, CM), pp. 557–572.
CIG-2006-Cazenave #data type #heuristic #optimisation: Optimizations of data structures, heuristics and algorithms for path-finding on maps (TC), pp. 27–33.
CIG-2006-ReynoldsAA #game studies #optimisation #problem #using: Optimization Problem Solving using Predator/Prey Games and Cultural Algorithms (RGR, MZA, RSA), pp. 119–125.
ICGT-2006-Lins: New Algorithms and Applications of Cyclic Reference Counting (RDL), pp. 15–29.
CHI-2006-TuckerW #evaluation: Time is of the essence: an evaluation of temporal compression algorithms (ST, SW), pp. 329–338.
SOFTVIS-2006-BaloukasP #network #visualisation: A visualization software for the network simplex algorithm (TB, KP), pp. 153–154.
SOFTVIS-2006-BlumenkrantsSS #visualisation: Narrative algorithm visualization (MB, HS, AS), pp. 17–26.
SOFTVIS-2006-HundhausenBF #design #pointer #visualisation: Adding procedures and pointers to the ALVIS algorithm visualization software: a preliminary design (CDH, JLB, SF), pp. 155–156.
SOFTVIS-2006-KaravirtaKM #animation #taxonomy: Taxonomy of algorithm animation languages (VK, AK, LM), pp. 77–85.
SOFTVIS-2006-KerrenMS #education #novel: Novel algorithm explanation techniques for improving algorithm teaching (AK, TM, EMS), pp. 175–176.
SOFTVIS-2006-RhodesKR #animation #comprehension #interactive: The importance of interactive questioning techniques in the comprehension of algorithm animations (PR, EK, BR), pp. 183–184.
ICEIS-AIDSS-2006-GollerHS #data mining #mining: Beneficial Sequential Combination of Data Mining Algorithms (MG, MH, MS), pp. 135–143.
ICEIS-AIDSS-2006-SombattheeraG #distributed #linear: A Distributed Algorithm for Coalition Formation in Linear Production Domain (CS, AG), pp. 17–22.
ICEIS-DISI-2006-AraqueSDGS: Algorithms for Integrating Temporal Properties of Data in Data Warehousing (FA, AS, CD, EG, JS), pp. 193–199.
ICEIS-DISI-2006-LongboZMYY #data type #random: Random Sampling Algorithms for Landmark Windows over Data Streams (LZ, ZL, YM, WY, JY), pp. 103–107.
ICEIS-DISI-2006-LoureiroB: A Discrete Particle Swarm Algorithm for OLAP Data Cube Selection (JL, OB), pp. 46–62.
CIKM-2006-GoldinMN #clustering #distance #sequence: In search of meaning for time series subsequence clustering: matching algorithms based on a new distance measure (DQG, RM, GN), pp. 347–356.
CIKM-2006-JiangLH #performance #xml: An efficient one-phase holistic twig join algorithm for XML data (ZJ, CL, WCH), pp. 786–787.
CIKM-2006-ParthasarathyMS #detection #robust: Robust periodicity detection algorithms (SP, SM, SS), pp. 874–875.
CIKM-2006-Takasu #approximate #documentation #multi #retrieval #robust: An approximate multi-word matching algorithm for robust document retrieval (AT), pp. 34–42.
CIKM-2006-TatikondaPK #mining: TRIPS and TIDES: new algorithms for tree mining (ST, SP, TMK), pp. 455–464.
ICML-2006-AgarwalHKS: Algorithms for portfolio management based on the Newton method (AA, EH, SK, RES), pp. 9–16.
ICML-2006-ArgyriouHMP #kernel: A DC-programming algorithm for kernel selection (AA, RH, CAM, MP), pp. 41–48.
ICML-2006-CaruanaN #comparison #empirical #learning: An empirical comparison of supervised learning algorithms (RC, ANM), pp. 161–168.
ICML-2006-ConitzerG #learning #online #problem: Learning algorithms for online principal-agent problems (and selling goods online) (VC, NG), pp. 209–216.
ICML-2006-ShengL #testing: Feature value acquisition in testing: a sequential batch test algorithm (VSS, CXL), pp. 809–816.
ICML-2006-WarmuthLR: Totally corrective boosting algorithms that maximize the margin (MKW, JL, GR), pp. 1001–1008.
ICPR-v1-2006-BouguessaWJ #clustering: A K-means-based Algorithm for Projective Clustering (MB, SW, QJ), pp. 888–891.
ICPR-v1-2006-ChenCLT #automation #graph #image #segmentation #using: Automatic Segmentation of Lung Fields from Radiographic Images of SARS Patients Using a New Graph Cuts Algorithm (SC, LC, JL, XT), pp. 271–274.
ICPR-v1-2006-HuaWCW: A Pixel-wise Object Tracking Algorithm with Target and Background Sample (CH, HW, QC, TW), pp. 739–742.
ICPR-v1-2006-LamY #calculus #clustering: Improved Clustering Algorithm Based on Calculus of Variation (BSYL, HY), pp. 900–903.
ICPR-v1-2006-Li #clustering #performance: A clustering Based Color Model and Fast Algorithm for Object Tracking (PL), pp. 671–674.
ICPR-v1-2006-LiuYYG #novel: A Novel Volumetric Shape from Silhouette Algorithm Based on a Centripetal Pentahedron Model (XL, HY, GY, WG), p. 9.
ICPR-v1-2006-NegriCMP #classification: An Oriented-Contour Point Based Voting Algorithm for Vehicle Type Classification (PN, XC, MM, RP), pp. 574–577.
ICPR-v1-2006-PrehnS #adaptation #classification #clustering #incremental #robust #using: An Adaptive Classification Algorithm Using Robust Incremental Clustering (HP, GS), pp. 896–899.
ICPR-v1-2006-QinL: An Improved Semi-Supervised Support Vector Machine Based Translation Algorithm for BCI Systems (JQ, YL), pp. 1240–1243.
ICPR-v1-2006-RiponTKI #clustering #multi #search-based #using: Multi-Objective Evolutionary Clustering using Variable-Length Real Jumping Genes Genetic Algorithm (KSNR, CHT, SK, MKI), pp. 1200–1203.
ICPR-v1-2006-WangGLR #performance: An efficient algorithm for fingerprint matching (CW, MLG, YL, JGR), pp. 1034–1037.
ICPR-v1-2006-XingmingH #detection #independence: An Illumination Independent Eye Detection Algorithm (XZ, HZ), pp. 392–395.
ICPR-v1-2006-YalcinG #difference #evolution: Integrating Differential Evolution and Condensation Algorithms for License Plate Tracking (IKY, MG), pp. 658–661.
ICPR-v1-2006-YanCK #probability #video: A Maximum A Posteriori Probability Viterbi Data Association Algorithm for Ball Tracking in Sports Video (FY, WJC, JK), pp. 279–282.
ICPR-v2-2006-BenaventRS #modelling #named: EBEM: An Entropy-based EM Algorithm for Gaussian Mixture Models (APB, FER, JMS), pp. 451–455.
ICPR-v2-2006-CaiUS #online #performance #recognition: An Efficient Radical-Based Algorithm for Stroke-Order-Free Online Kanji Character Recognition (WC, SU, HS), pp. 986–989.
ICPR-v2-2006-CamastraSV #benchmark #challenge #machine learning #metric #pattern matching #pattern recognition #recognition: Offline Cursive Character Challenge: a New Benchmark for Machine Learning and Pattern Recognition Algorithms. (FC, MS, AV), pp. 913–916.
ICPR-v2-2006-ChengCWF #prototype #search-based: A Prototypes-Embedded Genetic K-means Algorithm (SSC, YHC, HMW, HCF), pp. 724–727.
ICPR-v2-2006-DengHG #classification: Ada-Boost Algorithm, Classification, Naïve- (WD, JH, JG), pp. 699–702.
ICPR-v2-2006-FerchichiW #2d #3d #clustering: A Clustering-based Algorithm for Extracting the Centerlines of 2D and 3D Objects (SF, SW), pp. 296–299.
ICPR-v2-2006-FuDLJR #novel #recognition #segmentation #string: A Novel Segmentation and Recognition Algorithm for Chinese Handwritten Address Character Strings (QF, XQD, TL, YJ, ZR), pp. 974–977.
ICPR-v2-2006-Gil-GarciaBP #clustering #framework: A General Framework for Agglomerative Hierarchical Clustering Algorithms (RGG, JMBC, APP), pp. 569–572.
ICPR-v2-2006-GorceP #multi #performance: Fast Dichotomic Multiple Search Algorithm for Shortest Cirular Path (MdLG, NP), pp. 403–406.
ICPR-v2-2006-LocteauRALHT #approximate #multi #search-based #using: Approximation of Digital Curves using a Multi-Objective Genetic Algorithm (HL, RR, SA, YL, PH, ÉT), pp. 716–719.
ICPR-v2-2006-MavroforakisST #geometry #novel: A novel SVM Geometric Algorithm based on Reduced Convex Hulls (MEM, MS, ST), pp. 564–568.
ICPR-v2-2006-MoghaddamS #image #retrieval: Gabor Wavelet Correlogram Algorithm for Image Indexing and Retrieval (HAM, MST), pp. 925–928.
ICPR-v2-2006-Ren: A Pattern Selection Algorithm Based on the Generalized Confidence (JR), pp. 824–827.
ICPR-v2-2006-SantoFSPV #detection: An Unsupervised Algorithm for Anchor Shot Detection (MDS, PF, CS, GP, MV), pp. 1238–1241.
ICPR-v2-2006-SavelonasIM #segmentation: An LBP-Based Active Contour Algorithm for Unsupervised Texture Segmentation (MAS, DKI, DEM), pp. 279–282.
ICPR-v2-2006-SharmaL #segmentation #word: An Iterative Algorithm for Segmentation of Isolated Handwritten Words in Gurmukhi Script (DVS, GSL), pp. 1022–1025.
ICPR-v2-2006-SomolP #feature model #keyword #multi #prototype #using: Multi-Subset Selection for Keyword Extraction and Other Prototype Search Tasks Using Feature Selection Algorithms (PS, PP), pp. 736–739.
ICPR-v2-2006-XuWH #learning: A maximum margin discriminative learning algorithm for temporal signals (WX, JW, ZH), pp. 460–463.
ICPR-v2-2006-YuW #clustering #named #realtime #scalability #set: GCA: A real-time grid-based clustering algorithm for large data set (ZY, HSW), pp. 740–743.
ICPR-v2-2006-YuW06a: Genetic-based K-means algorithm for selection of feature variables (ZY, HSW), pp. 744–747.
ICPR-v2-2006-ZhengT #robust: A Robust Algorithm for Generalized Orthonormal Discriminant Vectors (WZ, XT), pp. 784–787.
ICPR-v3-2006-BaiSW #novel #symmetry: A Novel Eye Location Algorithm based on Radial Symmetry Transform (LB, LS, YW), pp. 511–514.
ICPR-v3-2006-BarbuRLAHT #classification #graph #recognition #search-based #using: Graph Classification Using Genetic Algorithm and Graph Probing Application to Symbol Recognition (EB, RR, HL, SA, PH, ÉT), pp. 296–299.
ICPR-v3-2006-ChanL #approximate #fault #multi #performance: Multiplierless Fast DCT Algorithms with Minimal Approximation Errors (RKWC, MCL), pp. 921–925.
ICPR-v3-2006-GokberkA #3d #analysis #comparative #recognition: Comparative Analysis of Decision-level Fusion Algorithms for 3D Face Recognition (BG, LA), pp. 1018–1021.
ICPR-v3-2006-HoppeS #linear #modelling: Fusion Algorithm for Locally Arranged Linear Models (FH, GS), pp. 1208–1211.
ICPR-v3-2006-JainHSVHG #clustering #hybrid #recursion #sequence: A Hybrid, Recursive Algorithm for Clustering Expressed Sequence Tags in Chlamydomonas reinhardtii (MJ, HJH, JS, OV, CH, AG), pp. 404–407.
ICPR-v3-2006-KimLL #image #optimisation: Joint Optimization of Image Registration and Comparametric Exposure Compensation Based on the Lucas-Kanade Algorithm (DSK, SYL, KL), pp. 905–908.
ICPR-v3-2006-KohmuraW #search-based #using: Determining Optimal Filters for Binarization of Degraded Characters in Color Using Genetic Algorithms (HK, TW), pp. 661–664.
ICPR-v3-2006-KyweFM #image #realtime #scheduling #using: Scheduling of Image Processing Using Anytime Algorithm for Real-time System (WWK, DF, KM), pp. 1095–1098.
ICPR-v3-2006-LiuW #analysis #component #feature model #recognition #search-based: Feature Extraction with Genetic Algorithms Based Nonlinear Principal Component Analysis for Face Recognition (NL, HW), pp. 461–464.
ICPR-v3-2006-LiWG #novel: A Novel Blind Watermarking Algorithm in Contourlet Domain (HL, JW, HG), pp. 639–642.
ICPR-v3-2006-Morii: A Generalized K-Means Algorithm with Semi-Supervised Weight Coefficients (FM), pp. 198–201.
ICPR-v3-2006-TianK06a #distance #performance #using: An Efficient Algorithm for Point Matching Using Hilbert Scanning Distance (LT, SiK), pp. 873–876.
ICPR-v3-2006-XueTCZ #matrix #recognition: A Modified Non-negative Matrix Factorization Algorithm for Face Recognition (YX, CST, WSC, WZ), pp. 495–498.
ICPR-v3-2006-YaoYLJ #realtime #recognition #scalability: Real Time Large Vocabulary Continuous Sign Language Recognition Based on OP/Viterbi Algorithm (GY, HY, XL, FJ), pp. 312–315.
ICPR-v3-2006-ZhuZX #implementation: A Digital Watermarking Algorithm and Implementation Based on Improved SVD (XZ, JZ, HX), pp. 651–656.
ICPR-v4-2006-AreekulSJ #locality: The New Focal Point Localization Algorithm for Fingerprint Registration (VA, KS, SJ), pp. 497–500.
ICPR-v4-2006-CantoniLL06a: Most minutiae-based matching algorithms confront (VC, LL, PL), pp. 378–385.
ICPR-v4-2006-HoppeS06a #linear #modelling: Fusion Algorithm for Locally Arranged Linear Models (FH, GS), p. 951.
ICPR-v4-2006-VietKT #3d: An Algorithm for Cutting 3D Surface Meshes (HQHV, TK, HTT), pp. 762–765.
ICPR-v4-2006-YaoLYZL #analysis #identification: Analysis and Improvement of An Iris Identification Algorithm (PY, JL, XY, ZZ, BL), pp. 362–365.
ICPR-v4-2006-YaoLYZL06a #recognition #using: Iris Recognition Algorithm Using Modified Log-Gabor Filters (PY, JL, XY, ZZ, BL), pp. 461–464.
KDD-2006-GionisMPU #order: Algorithms for discovering bucket orders from data (AG, HM, KP, AU), pp. 561–566.
KDD-2006-KumarRHP: Algorithms for storytelling (DK, NR, RFH, MP), pp. 604–610.
KDD-2006-ManiyarN #data mining #mining #using #visual notation #visualisation: Visual data mining using principled projection algorithms and information visualization techniques (DMM, ITN), pp. 643–648.
KDD-2006-Moore #statistics: New cached-sufficient statistics algorithms for quickly answering statistical questions (AM), p. 2.
KDD-2006-Morchen #mining: Algorithms for time series knowledge mining (FM), pp. 668–673.
KR-2006-CroitoruC #composition #concept #graph: A Tree Decomposition Algorithm for Conceptual Graph Projection (MC, EC), pp. 271–276.
SIGIR-2006-Baeza-YatesBC #rank #ranking: Generalizing PageRank: damping functions for link-based ranking algorithms (RABY, PB, CC), pp. 308–315.
SIGIR-2006-DingLP #equivalence #hybrid: NMF and PLSI: equivalence and a hybrid algorithm (CHQD, TL, WP), pp. 641–642.
SIGIR-2006-Henzinger #evaluation #scalability #web: Finding near-duplicate web pages: a large-scale evaluation of algorithms (MRH), pp. 284–291.
QAPL-2005-Siveroni06: Filling Out the Gaps: A Padding Algorithm for Transforming Out Timing Leaks (IS), pp. 241–257.
LOPSTR-2006-Silva #case study #comparative #debugging: A Comparative Study of Algorithmic Debugging Strategies (JS), pp. 143–159.
PLDI-2006-JarviGWLS #c++ #challenge #programming: Algorithm specialization in generic programming: challenges of constrained generics in C++ (JJ, DG, JW, AL, JGS), pp. 272–282.
PLDI-2006-JohnsonE #composition #independence: Context-sensitive domain-independent algorithm composition and selection (TAJ, RE), pp. 181–192.
PLDI-2006-VechevYB #concurrent #garbage collection: Correctness-preserving derivation of concurrent garbage collection algorithms (MTV, EY, DFB), pp. 341–353.
PPDP-2006-ColazzoS #performance #xml: An efficient algorithm for XML type projection (DC, CS), pp. 51–60.
PPDP-2006-SilvaC #debugging #slicing: Combining algorithmic debugging and program slicing (JS, OC), pp. 157–166.
SAS-2006-GoubaultP #static analysis: Static Analysis of Numerical Algorithms (EG, SP), pp. 18–34.
SAS-2006-LoginovRS #automation #verification: Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal Algorithm (AL, TWR, MS), pp. 261–279.
ASE-2006-MohaGL #automation #design #detection #fault #generative: Automatic Generation of Detection Algorithms for Design Defects (NM, YGG, PL), pp. 297–300.
FSE-2006-GulavaniHKNR #named: SYNERGY: a new algorithm for property checking (BSG, TAH, YK, AVN, SKR), pp. 117–127.
SAC-2006-AhmedKL #design #implementation #network: Design and implementation of a context-aware decision algorithm for heterogeneous networks (TA, KK, ML), pp. 1134–1138.
SAC-2006-AlmeidaG #database #incremental #nearest neighbour #network #using: Using Dijkstra’s algorithm to incrementally find the k-Nearest Neighbors in spatial network databases (VTdA, RHG), pp. 58–62.
SAC-2006-BendaJPSC #distributed #resource management: A distributed stand-in agent based algorithm for opportunistic resource allocation (PB, PJ, MP, NS, MMC), pp. 119–125.
SAC-2006-ChenSC #evaluation #query: Tree inclusion algorithm, signatures and evaluation of path-oriented queries (YC, YS, YC), pp. 1020–1025.
SAC-2006-CutelloNO #analysis #heuristic: Analysis of an evolutionary algorithm with HyperMacromutation and stop at first constructive mutation heuristic for solving trap functions (VC, GN, PSO), pp. 945–949.
SAC-2006-CutelloNP #hybrid #optimisation #using: Real coded clonal selection algorithm for unconstrained global optimization using a hybrid inversely proportional hypermutation operator (VC, GN, MP), pp. 950–954.
SAC-2006-DantsinWK #constraints #problem #quantum #towards: Quantum versions of k-CSP algorithms: a first step towards quantum algorithms for interval-related constraint satisfaction problems (ED, AW, VK), pp. 1640–1644.
SAC-2006-DextersPG #analysis #probability: A probability analysis for candidate-based frequent itemset algorithms (ND, PWP, DVG), pp. 541–545.
SAC-2006-DuranX #scheduling #search-based: The effects of two replacement strategies on a genetic algorithm for scheduling jobs on computational grids (BD, FX), pp. 960–961.
SAC-2006-GeraciPPS #clustering #scalability #web: A scalable algorithm for high-quality clustering of web snippets (FG, MP, PP, FS), pp. 1058–1062.
SAC-2006-Goldsztejn #approximate #branch #set: A branch and prune algorithm for the approximation of non-linear AE-solution sets (AG), pp. 1650–1654.
SAC-2006-JenkinsM #development: GIS, SINKS, FILL, and disappearing wetlands: unintended consequences in algorithm development and use (DGJ, LAM), pp. 277–282.
SAC-2006-Lecca #probability #π-calculus: A time-dependent extension of gillespie algorithm for biochemical stochastic π-calculus (PL), pp. 137–144.
SAC-2006-LeongL #multi #problem: A multi-agent algorithm for vehicle routing problem with time window (HWL, ML), pp. 106–111.
SAC-2006-LuHS #precise #realtime #scheduling: A precise schedulability test algorithm for scheduling periodic tasks in real-time systems (WCL, JWH, WKS), pp. 1451–1455.
SAC-2006-MaC #array #data mining #mining #network #novel: A novel data mining algorithm for reconstructing gene regulatory networks from microarray data (PCHM, KCCC), pp. 202–203.
SAC-2006-NemalhabibS #category theory #clustering #dataset #named: CLUC: a natural clustering algorithm for categorical datasets based on cohesion (AN, NS), pp. 637–638.
SAC-2006-YangU #adaptation #correlation #search-based: Adaptive mutation with fitness and allele distribution correlation for genetic algorithms (SY, SU), pp. 940–944.
SAC-2006-YaoJ: NFP-based nesting algorithm for irregular shapes (LHY, HYJ), pp. 963–967.
LDTA-J-2004-BegelG #ambiguity #named #programming language: XGLR — an algorithm for ambiguity in programming languages (AB, SLG), pp. 211–227.
LDTA-J-2004-JohnstoneSE #glr #parsing: Evaluating GLR parsing algorithms (AJ, ES, GRE), pp. 228–244.
GPCE-2006-DenneyF #automation #certification #safety: A generic annotation inference algorithm for the safety certification of automatically generated code (ED, BF), pp. 121–130.
ASPLOS-2006-CoonsCBMK #architecture #scheduling: A spatial path scheduling algorithm for EDGE architectures (KEC, XC, DB, KSM, SKK), pp. 129–140.
CASE-2006-ChandrasekaranSPV #optimisation #permutation #problem #scheduling: An Application of Particle Swarm Optimization Algorithm to Permutation Flowshop Scheduling Problems to Minimize Makespan, Total Flowtime and Completion Time Variance (SC, RKS, SGP, NV), pp. 513–518.
CASE-2006-ChenYY #simulation: Backward-traversing Waveform Relaxation Algorithm for Circuit Simulation and Simulation on Demand (CJC, JLY, TNY), pp. 134–139.
CASE-2006-HuCLY #detection #robust #statistics: A Robust Statistical-based Speaker’s Location Detection Algorithm in a Vehicular Environment (JSH, CCC, WHL, CHY), pp. 274–279.
CASE-2006-Jiang #coordination #multi: An improved algorithm for coordination control of multi-agent system based on r-limited voronoi partitions (QJ), pp. 667–671.
CASE-2006-KobetskiSF #comparison #coordination #scheduling: Scheduling algorithms for optimal robot cell coordination — a comparison (AK, DS, MF), pp. 381–386.
CASE-2006-LiHZ #multi: A New Data Association Algorithm for Multiple Passive Sensors (CL, CH, HZ), pp. 594–599.
CASE-2006-LiuWL #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-LiZYC #analysis #locality #network #novel: A Novel Algorithm for Node Localization and Motion Analysis in Wireless Sensor Networks (SL, DZ, ZY, NC), pp. 574–579.
CASE-2006-LopatinY #approximate #polynomial #using: Using the forward search and the polynomial approximation algorithms in the exact algorithm for manipulator’s control in an unknown environment (PKL, ASY), pp. 206–211.
CASE-2006-LuDYL: An Algorithm for Locating Sky-Sea Line (JWL, YZD, XHY, FLL), pp. 615–619.
CASE-2006-PonnambalamSSG #assembly #parallel #search-based: PARALLEL POPULATIONS GENETIC ALGORITHM FOR MINIMIZING ASSEMBLY VARIATION IN SELECTIVE ASSEMBLY (SGP, SSS, SS, MG), pp. 496–500.
CASE-2006-ReveliotisB #learning #performance: Efficient learning algorithms for episodic tasks with acyclic state spaces (SR, TB), pp. 411–418.
CASE-2006-ShangYQ #equation #linear: Algorithm of Two-Step Eye-Hand Calibration by Resolving Linear Equations (YS, QY, ZQ), pp. 218–222.
CASE-2006-ShaoHM #analysis #component #linear #multi #using: Quantitative Analysis Using NIR by Building Principal Component- Multiple Linear Regression-BP Algorithm (YS, YH, JM), pp. 161–164.
CASE-2006-XuWZZ #automation #detection #using: An Automatic EEG Spike Detection Algorithm Using Morphological Filter (GX, JW, QZ, JZ), pp. 170–175.
CC-2006-CavazosMO #hybrid #optimisation #question: Hybrid Optimizations: Which Optimization Algorithm to Use? (JC, JEBM, MFPO), pp. 124–138.
CGO-2006-NagpurkarKHSR #detection #online: Online Phase Detection Algorithms (PN, CK, MH, PFS, VTR), pp. 111–123.
DAC-2006-BrahmbhattZWQ #adaptation #encoding #hybrid #power management #using: Low-power bus encoding using an adaptive hybrid algorithm (ARB, JZ, QW, QQ), pp. 987–990.
DAC-2006-BurginCHMMSKFF #adaptation #architecture #implementation #power management #trade-off: Low-power architectural trade-offs in a VLSI implementation of an adaptive hearing aid algorithm (FB, FC, MH, HM, RMP, RS, HK, NF, WF), pp. 558–561.
DAC-2006-ChengDCW #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-ChenRPR: A test pattern ordering algorithm for diagnosis with truncated fail data (GC, SMR, IP, JR), pp. 399–404.
DAC-2006-CongZ #performance #scheduling: An efficient and versatile scheduling algorithm based on SDC formulation (JC, ZZ), pp. 433–438.
DAC-2006-HuAHKLSS #performance: Fast algorithms for slew constrained minimum cost buffering (SH, CJA, JH, SKK, ZL, WS, CCNS), pp. 308–313.
DAC-2006-LinZ #constraints #performance: An efficient retiming algorithm under setup and hold constraints (CL, HZ), pp. 945–950.
DAC-2006-YangCGJ #matrix #parallel #rank #scalability: A parallel low-rank multilevel matrix compression algorithm for parasitic extraction of electrically large structures (CY, SC, DG, VJ), pp. 1053–1056.
DAC-2006-ZhaoPSYF #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-AhnYPKKC #architecture #configuration management: A spatial mapping algorithm for heterogeneous coarse-grained reconfigurable architectures (MA, JWY, YP, YK, MK, KC), pp. 363–368.
DATE-2006-BurgBWSB: Advanced receiver algorithms for MIMO wireless communications (AB, MB, MW, CS, HB), pp. 593–598.
DATE-2006-GrossschadlIPTV #case study #design #encryption #set: Combining algorithm exploration with instruction set design: a case study in elliptic curve cryptography (JG, PI, LP, ST, AKV), pp. 218–223.
DATE-2006-MatulaM #float #formal method #generative #performance #standard #traversal #verification: A formal model and efficient traversal algorithm for generating testbenches for verification of IEEE standard floating point division (DWM, LDM), pp. 1134–1138.
DATE-2006-RaoCBS #fault #performance: An efficient static algorithm for computing the soft error rates of combinational circuits (RRR, KC, DB, DS), pp. 164–169.
DATE-2006-RongP #formal method #markov #online #process: Determining the optimal timeout values for a power-managed system based on the theory of Markovian processes: offline and online algorithms (PR, MP), pp. 1128–1133.
DATE-2006-WangM #analysis #multi: A logarithmic full-chip thermal analysis algorithm based on multi-layer Green’s function (BW, PM), pp. 39–44.
DATE-DF-2006-CarvalhoPJF #fault tolerance #implementation: A practical implementation of the fault-tolerant daisy-chain clock synchronization algorithm on CAN (FCC, CEP, ETSJ, EPdF), pp. 189–194.
DATE-DF-2006-DavilaTSSBR #architecture #configuration management #design #implementation: Design and implementation of a rendering algorithm in a SIMD reconfigurable architecture (MorphoSys) (JD, AdT, JMS, MSE, NB, FR), pp. 52–57.
HPDC-2006-ZhengYS #grid #how #novel #probability #scheduling: How to avoid herd: a novel stochastic algorithm in grid scheduling (QZ, HY, YS), pp. 267–278.
PDP-2006-CamineroCC #lightweight #multi #network: A New Lightweight CAC Algorithm for High-Performance Multimedia Networks (ACC, BC, CC), pp. 465–472.
PDP-2006-DominguesMS #grid #named #scheduling: DGSchedSim: A Trace-Driven Simulator to Evaluate Scheduling Algorithms for Desktop Grid Environments (PD, PM, LMS), pp. 83–90.
PDP-2006-JollyF #parallel: Parallel Multi-Sector Algorithm for the General Hough Transform (EKJ, MF), pp. 380–387.
PDP-2006-PrietoVFC #concurrent #distributed: An O(n) Distributed Deadlock Resolution Algorithm (MP, JEV, FF, AC), pp. 48–55.
PPoPP-2006-HuTH #manycore #network #parallel #thread: High-performance IPv6 forwarding algorithm for multi-core and multithreaded network processor (XH, XT, BH), pp. 168–177.
FASE-2006-OlveczkyC #analysis #maude #realtime #scheduling #simulation: Formal Simulation and Analysis of the CASH Scheduling Algorithm in Real-Time Maude (PCÖ, MC), pp. 357–372.
STOC-2006-AharonovJL #approximate #polynomial #quantum: A polynomial quantum algorithm for approximating the Jones polynomial (DA, VJ, ZL), pp. 427–436.
STOC-2006-CharikarMM #game studies: Near-optimal algorithms for unique games (MC, KM, YM), pp. 205–214.
STOC-2006-DeMarzoKM #online #robust: Online trading algorithms and robust option pricing (PD, IK, YM), pp. 477–486.
STOC-2006-Gurvits #approach #bound #proving: Hyperbolic polynomials approach to Van der Waerden/Schrijver-Valiant like conjectures: sharper bounds, simpler proofs and algorithmic applications (LG), pp. 417–426.
STOC-2006-Impagliazzo #question #random: Can every randomized algorithm be derandomized? (RI), pp. 373–374.
STOC-2006-KelnerS #linear #polynomial #programming #random: A randomized polynomial-time simplex algorithm for linear programming (JAK, DAS), pp. 51–60.
STOC-2006-LeviRS #modelling #probability: Provably near-optimal sampling-based algorithms for Stochastic inventory control models (RL, RR, DBS), pp. 739–748.
STOC-2006-NesetrilM #linear: Linear time low tree-width partitions and algorithmic consequences (JN, POdM), pp. 391–400.
STOC-2006-Plandowski #equation #performance #word: An efficient algorithm for solving word equations (WP), pp. 467–476.
STOC-2006-Raghavan #web: The changing face of web search: algorithms, auctions and advertising (PR), p. 129.
CAV-2006-ColvinGLM #concurrent #lazy evaluation #set #verification: Formal Verification of a Lazy Concurrent List-Based Set Algorithm (RC, LG, VL, MM), pp. 475–488.
CAV-2006-WulfDHR #anti #automaton #finite #named: Antichains: A New Algorithm for Checking Universality of Finite Automata (MDW, LD, TAH, JFR), pp. 17–30.
CSL-2006-ChatterjeeDHR #game studies: Algorithms for ω-Regular Games with Imperfect Information (KC, LD, TAH, JFR), pp. 287–302.
FATES-RV-2006-LiD #aspect-oriented #safety #testing #verification: Decompositional Algorithms for Safety Verification and Testing of Aspect-Oriented Systems (CL, ZD), pp. 100–114.
ICLP-2006-SahaR #evaluation #incremental #logic programming #source code: A Local Algorithm for Incremental Evaluation of Tabled Logic Programs (DS, CRR), pp. 56–71.
IJCAR-2006-Boldo #float #proving: Pitfalls of a Full Floating-Point Proof: Example on the Formal Proof of the Veltkamp/Dekker Algorithms (SB), pp. 52–66.
IJCAR-2006-Mahboubi #implementation #performance #proving: Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials (AM), pp. 438–452.
SAT-2006-DershowitzHN #satisfiability #scalability: A Scalable Algorithm for Minimal Unsatisfiable Core Extraction (ND, ZH, AN), pp. 36–41.
SAT-2006-Goldberg: Determinization of Resolution by an Algorithm Operating on Complete Assignments (EG), pp. 90–95.
VMCAI-2006-HristovaL #automaton #linear #logic #model checking: Improved Algorithm Complexities for Linear Temporal Logic Model Checking of Pushdown Systems (KH, YAL), pp. 190–206.
DocEng-2005-AvilaL #detection #documentation #image #performance: A fast orientation and skew detection algorithm for monochromatic document images (BTÁ, RDL), pp. 118–126.
DocEng-2005-AvilaLO #image: A new rotation algorithm for monochromatic images (BTÁ, RDL, LO), pp. 130–132.
ECDL-2005-BiaG #library #named: DiCoMo: An Algorithm Based Method to Estimate Digitization Costs in Digital Libraries (AB, JG), pp. 519–520.
ICDAR-2005-ChenL #analysis #component #independence #segmentation: Independent Component Analysis Segmentation Algorithm (YC, GL), pp. 680–684.
ICDAR-2005-FuDLJ #markov #modelling #recognition #segmentation #string: A Hidden Markov Model Based Segmentation and Recognition Algorithm for Chinese Handwritten Address Character Strings (QF, XQD, CSL, YJ), pp. 590–594.
ICDAR-2005-GaoLV #online #programming #segmentation: A Two-stage Online Handwritten Chinese Character Segmentation Algorithm Based on Dynamic Programming (XG, PML, CVG), pp. 735–739.
ICDAR-2005-Kavallieratou #documentation #image: A Binarization Algorithm specialized on Document Images and Photos (EK), pp. 463–467.
ICDAR-2005-LiangNSV #2d #geometry #parsing #performance: Efficient Geometric Algorithms for Parsing in Two Dimensions (PL, MN, MS, PAV), pp. 1172–1177.
ICDAR-2005-LiuGI #detection #image #robust: A Robust Algorithm for Text Detection in Color Images (YL, SG, TI), pp. 399–405.
ICDAR-2005-OjimaKW #search-based #using: Determining Optimal Filters for Binarization of Degraded Grayscale Characters Using Genetic Algorithms (YO, SK, TW), pp. 555–559.
ICDAR-2005-OliveiraBS #database #segmentation: A Synthetic Database to Assess Segmentation Algorithms (LSO, AdSBJ, RS), pp. 207–211.
ICDAR-2005-RusuG #interactive #proving #recognition #using: A Human Interactive Proof Algorithm Using Handwriting Recognition (AIR, VG), pp. 967–971.
ICDAR-2005-SteinkrauSB #machine learning #using: Using GPUs for Machine Learning Algorithms (DS, PYS, IB), pp. 1115–1119.
ICDAR-2005-WeiMJ #search-based #segmentation: Segmentation of Connected Chinese Characters Based on Genetic Algorithm (XW, SM, YJ), pp. 645–649.
ICDAR-2005-YuanT05a #component #multi: Multi-Level Component Grouping Algorithm and Its Applications (BY, CLT), pp. 1178–1181.
PODS-2005-CohenS #incremental: An incremental algorithm for computing ranked full disjunctions (SC, YS), pp. 98–107.
PODS-2005-Gottlob: Computing cores for data exchange: new algorithms and practical solutions (GG), pp. 148–159.
SIGMOD-2005-JohnsonMR: Sampling Algorithms in a Stream Operator (TJ, SM, IR), pp. 1–12.
SIGMOD-2005-ZhaoZ #3d #array #clustering #effectiveness #mining #named: TriCluster: An Effective Algorithm for Mining Coherent Clusters in 3D Microarray Data (LZ, MJZ), pp. 694–705.
VLDB-2005-ChenGK #graph #pattern matching: Stack-based Algorithms for Pattern Matching on DAGs (LC, AG, MEK), pp. 493–504.
VLDB-2005-Guha #performance: Space Efficiency in Synopsis Construction Algorithms (SG), pp. 409–420.
VLDB-2005-GuhaS #data type #performance: Offline and Data Stream Algorithms for Efficient Computation of Synopsis Structures (SG, KS), p. 1364.
VLDB-2005-Lawrence #configuration management #performance: Early Hash Join: A Configurable Algorithm for the Efficient and Early Production of Join Results (RL), pp. 841–852.
VLDB-2005-MichelTW #distributed #framework #named #query: KLEE: A Framework for Distributed Top-k Query Algorithms (SM, PT, GW), pp. 637–648.
ITiCSE-2005-Chinn #assessment: Peer assessment in the algorithms course (DDC), pp. 69–73.
ITiCSE-2005-HabermanAG: Is it really an algorithm: the need for explicit discourse (BH, HA, DG), pp. 74–78.
ITiCSE-2005-KrebsLOT #assessment #feedback #flexibility #generative #student #visualisation: Student-built algorithm visualizations for assessment: flexible generation, feedback and grading (MK, TL, TO, ST), pp. 281–285.
ITiCSE-2005-MullerH #guidelines #multi #object-oriented #problem: Guidelines for a multiple-goal CS introductory course: algorithmic problem-solving woven into OOP (OM, BH), p. 356.
ITiCSE-2005-OechsleG #distributed #framework #implementation #platform #simulation: DisASTer (distributed algorithms simulation terrain): a platform for the implementation of distributed algorithms (RO, TG), pp. 44–48.
ITiCSE-2005-PerrenetGK #abstraction #comprehension #concept #student: Exploring students’ understanding of the concept of algorithm: levels of abstraction (JP, JFG, EK), pp. 64–68.
CSMR-2005-BreechTP #comparison #impact analysis #online: A Comparison of Online and Dynamic Impact Analysis Algorithms (BB, MT, LLP), pp. 143–152.
ICSM-2005-WuHH #clustering #comparison #evolution: Comparison of Clustering Algorithms in the Context of Software Evolution (JW, AEH, RCH), pp. 525–535.
PASTE-2005-LiangPH #context-sensitive grammar #java #source code: Evaluating the impact of context-sensitivity on Andersen’s algorithm for Java programs (DL, MP, MJH), pp. 6–12.
PASTE-2005-TallamG #concept analysis #testing: A concept analysis inspired greedy algorithm for test suite minimization (ST, NG), pp. 35–42.
CIAA-J-2004-AllauzenMR05 #design #library: The design principles and algorithms of a weighted grammar library (CA, MM, BR), pp. 403–421.
CIAA-2005-CampeanuPS #automaton #finite #incremental: An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata (CC, AP, JRS), pp. 90–103.
CIAA-2005-SudaH #automaton #backtracking #top-down: Non-backtracking Top-Down Algorithm for Checking Tree Automata Containment (TS, HH), pp. 294–306.
ICALP-2005-Ambuhl #bound #energy #network #performance: An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks (CA), pp. 1139–1150.
ICALP-2005-BorodinCM #how #question: How Well Can Primal-Dual and Local-Ratio Algorithms Perform? (AB, DC, AM), pp. 943–955.
ICALP-2005-DonatoLT #analysis #ranking #similarity: Stability and Similarity of Link Analysis Ranking Algorithms (DD, SL, PT), pp. 717–729.
ICALP-2005-ElbassioniFMS #approximate: Approximation Algorithms for Euclidean Group TSP (KME, AVF, NHM, RS), pp. 1115–1126.
ICALP-2005-GairingMW #approximate #combinator #parallel #performance #scheduling: A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines (MG, BM, AW), pp. 828–839.
ICALP-2005-Kavitha #graph #random: An Õ(m2n) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph (TK), pp. 273–284.
ICALP-2005-KumarSS #clustering #linear #problem: Linear Time Algorithms for Clustering Problems in Any Dimensions (AK, YS, SS), pp. 1374–1385.
ICALP-2005-PemmarajuR #approximate #problem: Approximation Algorithms for the Max-coloring Problem (SVP, RR), pp. 1064–1075.
SEFM-2005-HubertM #c #case study #source code #verification: A case study of C source code verification: the Schorr-Waite algorithm (TH, CM), pp. 190–199.
TLCA-2005-AbelC #framework #logic #similarity: Untyped Algorithmic Equality for Martin-Löf’s Logical Framework with Surjective Pairs (AA, TC), pp. 23–38.
TLCA-2005-BaillotT #logic #type system: A Feasible Algorithm for Typing in Elementary Affine Logic (PB, KT), pp. 55–70.
CIG-2005-PapacostantisEF #game studies #optimisation #probability #using: Coevolving Probabilistic Game Playing Agents using Particle Swarm Optimization Algorithm (EP, APE, NF).
SOFTVIS-2005-BaloianBL #concept #using #visualisation: Algorithm visualization using concept keyboards (NAB, HB, WL), pp. 7–16.
SOFTVIS-2005-JohannesSW #analysis #animation #using #visualisation: Algorithm animation using shape analysis: visualising abstract executions (DJ, RS, RW), pp. 17–26.
ICEIS-v1-2005-KaurSS #concurrent #database #distributed #multi: Secure Concurrency Control Algorithm for Multilevel Secure Distributed Database Systems (NK, RS, HKS), pp. 267–272.
ICEIS-v2-2005-ColaceSVF #approach #learning #multi #network: A Bayesian Networks Structural Learning Algorithm Based on a Multiexpert Approach (FC, MDS, MV, PF), pp. 194–200.
ICEIS-v2-2005-Diaz-GomezH #detection #search-based #using: Improved Off-Line Intrusion Detection Using a Genetic Algorithm (PADG, DFH), pp. 66–73.
ICEIS-v4-2005-SaleemB #grid #scheduling #search-based #using: Job Scheduling in Computational Grid Using Genetic Algorithm (MS, SB), pp. 163–169.
ICEIS-v5-2005-JaklicV #documentation #image #preprocessor: Two Simple Algorithms for Document Image Preprocessing — Making a Document Scanning Application More User-Friendly (AJ, BV), pp. 116–121.
CIKM-2005-GriecoLRR #consistency #dependence #query: Consistent query answering under key and exclusion dependencies: algorithms and experiments (LG, DL, RR, MR), pp. 792–799.
ECIR-2005-AminiUG #automation #clustering #ranking #summary: Automatic Text Summarization Based on Word-Clusters and Ranking Algorithms (MRA, NU, PG), pp. 142–156.
ECIR-2005-VinayCMW #feedback: Evaluating Relevance Feedback Algorithms for Searching on Small Displays (VV, IJC, NMF, KRW), pp. 185–199.
ICML-2005-AndersonM #learning #markov #modelling: Active learning for Hidden Markov Models: objective functions and algorithms (BA, AM), pp. 9–16.
ICML-2005-JinZ #probability #using: A smoothed boosting algorithm using probabilistic output codes (RJ, JZ), pp. 361–368.
ICML-2005-SalojarviPK: Expectation maximization algorithms for conditional likelihoods (JS, KP, SK), pp. 752–759.
KDD-2005-Aggarwal #classification #towards: Towards exploratory test instance specific algorithms for high dimensional classification (CCA), pp. 526–531.
KDD-2005-DhillonGK #clustering #graph #kernel #multi #performance: A fast kernel-based multilevel algorithm for graph clustering (ISD, YG, BK), pp. 629–634.
KDD-2005-KubicaMCJ #multi #performance: A multiple tree algorithm for the efficient association of asteroid observations (JK, AWM, AJC, RJ), pp. 138–146.
KDD-2005-ZakiPAS #category theory #clustering #dataset #effectiveness #mining #named: CLICKS: an effective algorithm for mining subspace clusters in categorical datasets (MJZ, MP, IA, TS), pp. 736–742.
MLDM-2005-CaoHXW #network #recognition: Iris Recognition Algorithm Based on Point Covering of High-Dimensional Space and Neural Network (WC, JH, GX, SW), pp. 305–313.
MLDM-2005-DuKAB #clustering #encoding #multi #search-based: Alternative Clustering by Utilizing Multi-objective Genetic Algorithm with Linked-List Based Chromosome Encoding (JD, EEK, RA, KB), pp. 346–355.
MLDM-2005-GhoshGYB #analysis #comparative #network #search-based: Comparative Analysis of Genetic Algorithm, Simulated Annealing and Cutting Angle Method for Artificial Neural Networks (RG, MG, JY, AMB), pp. 62–70.
MLDM-2005-SunWW #parametricity: Parameter Inference of Cost-Sensitive Boosting Algorithms (YS, AKCW, YW), pp. 21–30.
SEKE-2005-FerreiraV #generative #hybrid #named #search-based #testing: TDSGen: An Environment Based on Hybrid Genetic Algorithms for Generation of Test Data (LPF, SRV), pp. 312–317.
SEKE-2005-IzadiM #calculus #model checking #performance #μ-calculus: An Efficient Model Checking Algorithm for a Fragment of μ-Calculus (MI, AMR), pp. 392–395.
SEKE-2005-LoYT #mining #predict: Weighted Binary Sequential Mining Algorithm with Application to the Next-Day Appearance Prediction (SL, JY, FCT), pp. 783–782.
SIGIR-2005-BodoffL #student #testing: Testing algorithms is like testing students (DB, PL), pp. 589–590.
SIGIR-2005-PerkioBT #adaptation #ranking: A temporally adaptive content-based relevance ranking algorithm (JP, WLB, HT), pp. 647–648.
OOPSLA-2005-GregorL #graph #parallel: Lifting sequential graph algorithms for distributed-memory parallel computation (DG, AL), pp. 423–437.
LOPSTR-2005-AlvezL #logic programming #source code: An Algorithm for Local Variable Elimination in Normal Logic Programs (JÁ, PL), pp. 61–79.
SAS-2005-Abramsky #game studies #semantics #static analysis: Algorithmic Game Semantics and Static Analysis (SA), p. 1.
ASE-2005-BryceC #interactive #testing: Constructing interaction test suites with greedy algorithms (RCB, CJC), pp. 440–443.
ASE-2005-Grov #approach #correctness #deduction #reasoning #source code #verification: Verifying the correctness of hume programs: an approach combining deductive and algorithmic reasoning (GG), pp. 444–447.
ASE-2005-XingS #design #difference #named #object-oriented: UMLDiff: an algorithm for object-oriented design differencing (ZX, ES), pp. 54–65.
SAC-2005-Bourgeois-RepubliqueVC #interactive: An interactive evolutionary algorithm for cochlear implant fitting: first results (CBR, GV, PC), pp. 231–235.
SAC-2005-BuenoTT #approximate #query #search-based #similarity #using: Accelerating approximate similarity queries using genetic algorithms (RB, AJMT, CTJ), pp. 617–622.
SAC-2005-DanielOS #multi #search-based: Airspace congestion smoothing by multi-objective genetic algorithm (DD, SO, SP), pp. 907–912.
SAC-2005-FalcoTCG #clustering #search-based: A new variable-length genome genetic algorithm for data clustering in semeiotics (IDF, ET, ADC, FG), pp. 923–927.
SAC-2005-FeizabadiRJ #named #scheduling: MSA: a memory-aware utility accrual scheduling algorithm (SF, BR, EDJ), pp. 857–862.
SAC-2005-GoettlBJ #email #search-based: Call me e-mail: arranging the keyboard with a permutation-coded genetic algorithm (JSG, AWB, BAJ), pp. 947–951.
SAC-2005-Goualard #constraints #on the #theorem proving: On considering an interval constraint solving algorithm as a free-steering nonlinear Gauss-Seidel procedure (FG), pp. 1434–1438.
SAC-2005-HuangCC #approximate #type inference: An approximation algorithm for haplotype inference by maximum parsimony (YTH, KMC, TC), pp. 146–150.
SAC-2005-OcaGA #classification #clustering #network: An hybridization of an ant-based clustering algorithm with growing neural gas networks for classification tasks (MAMdO, LG, JLA), pp. 9–13.
SAC-2005-PandeyGM #learning #probability #scheduling: Stochastic scheduling of active support vector learning algorithms (GP, HG, PM), pp. 38–42.
SAC-2005-YangC #detection #maturity: The T-detectors maturation algorithm based on match range model (DY, JC), pp. 43–44.
SAC-2005-ZhangGZL: A tabu search algorithm for the safe transportation of hazardous materials (LZ, SG, YZ, AL), pp. 940–946.
CGO-2005-LiGP #optimisation #search-based #sorting: Optimizing Sorting with Genetic Algorithms (XL, MJG, DAP), pp. 99–110.
DAC-2005-BrennerS #performance: Faster and better global placement by a new transportation algorithm (UB, MS), pp. 591–596.
DAC-2005-JiangCC #3d #linear #named #order: ICCAP: a linear time sparse transformation and reordering algorithm for 3D BEM capacitance extraction (RJ, YHC, CCPC), pp. 163–166.
DAC-2005-KlemasDW #order #reduction: Segregation by primary phase factors: a full-wave algorithm for model order reduction (TJK, LD, JKW), pp. 943–946.
DAC-2005-ManiDO #constraints #performance #statistics: An efficient algorithm for statistical minimization of total power under timing yield constraints (MM, AD, MO), pp. 309–314.
DAC-2005-MengBISLK #design #estimation #performance: MP core: algorithm and design techniques for efficient channel estimation in wireless applications (YM, APB, RAI, TS, HL, RK), pp. 297–302.
DAC-2005-SuC: An exact jumper insertion algorithm for antenna effect avoidance/fixing (BYS, YWC), pp. 325–328.
DATE-2005-BaradaranD #architecture #configuration management: A Register Allocation Algorithm in the Presence of Scalar Replacement for Fine-Grain Configurable Architectures (NB, PCD), pp. 6–11.
DATE-2005-FaroukS #communication #encryption #hybrid #implementation #security: An Improved FPGA Implementation of the Modified Hybrid Hiding Encryption Algorithm (MHHEA) for Data Communication Security (HAF, MS), pp. 76–81.
DATE-2005-KhanV #platform #scheduling: An Iterative Algorithm for Battery-Aware Task Scheduling on Portable Computing Platforms (JK, RV), pp. 622–627.
DATE-2005-LiS05a: An O(bn2) Time Algorithm for Optimal Buffer Insertion with b Buffer Types (ZL, WS), pp. 1324–1329.
DATE-2005-ShenQL #analysis #performance: A Faster Counterexample Minimization Algorithm Based on Refutation Analysis (SS, YQ, SL), pp. 672–677.
DATE-2005-TeslenkoD #graph #performance: An Efficient Algorithm for Finding Double-Vertex Dominators in Circuit Graphs (MT, ED), pp. 406–411.
DATE-2005-YangCK #approximate #energy #multi #scheduling: An Approximation Algorithm for Energy-Efficient Scheduling on A Chip Multiprocessor (CYY, JJC, TWK), pp. 468–473.
HPDC-2005-AnandS #automation #clustering #search-based: Genetic algorithm based automatic data partitioning scheme for HPF (SKA, YNS), pp. 289–290.
PPoPP-2005-DarteS #linear: A linear-time algorithm for optimal barrier placement (AD, RS), pp. 26–35.
PPoPP-2005-LowGZ #algebra #linear #parallel #specification: Extracting SMP parallelism for dense linear algebra algorithms from high-level specifications (TML, RAvdG, FGVZ), pp. 153–163.
PPoPP-2005-ThomasTTPAR #adaptation #framework: A framework for adaptive algorithm selection in STAPL (NT, GT, OT, JP, NMA, LR), pp. 277–288.
FoSSaCS-2005-Goguen: Justifying Algorithms for βη-Conversion (HG), pp. 410–424.
STOC-2005-AgarwalCMM #approximate #problem: O(sqrt(log n)) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems (AA, MC, KM, YM), pp. 573–581.
STOC-2005-Basu #algebra #polynomial #set: Polynomial time algorithm for computing the top Betti numbers of semi-algebraic sets defined by quadratic inequalities (SB), pp. 313–322.
STOC-2005-ChenD #approximate #fixpoint #on the: On algorithms for discrete and approximate brouwer fixed points (XC, XD), pp. 323–330.
STOC-2005-CheriyanV #approximate #design #metric #network: Approximation algorithms for network design with metric costs (JC, AV), pp. 167–175.
STOC-2005-DobzinskiNS #approximate #combinator: Approximation algorithms for combinatorial auctions with complement-free bidders (SD, NN, MS), pp. 610–618.
STOC-2005-FeigeHL #approximate: Improved approximation algorithms for minimum-weight vertex separators (UF, MTH, JRL), pp. 563–572.
STOC-2005-FlaxmanFV #approximate #on the #performance #problem: On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem (AF, AMF, JCV), pp. 441–449.
STOC-2005-Hallgren #performance #quantum: Fast quantum algorithms for computing the unit group and class group of a number field (SH), pp. 468–474.
STOC-2005-Jayanti #multi: An optimal multi-writer snapshot algorithm (PJ), pp. 723–732.
STOC-2005-SchmidtV #polynomial #quantum: Polynomial time quantum algorithm for the computation of the unit group of a number field (AS, UV), pp. 475–480.
STOC-2005-Trifonov: An O(log n log log n) space algorithm for undirected st-connectivity (VT), pp. 626–633.
TACAS-2005-EtessamiY #probability #recursion #state machine #verification: Algorithmic Verification of Recursive Probabilistic State Machines (KE, MY), pp. 253–270.
TACAS-2005-HardingRS #game studies #ltl #synthesis: A New Algorithm for Strategy Synthesis in LTL Games (AH, MR, PYS), pp. 477–492.
TACAS-2005-RanzatoT #abstract interpretation #refinement: An Abstract Interpretation-Based Refinement Algorithm for Strong Preservation (FR, FT), pp. 140–156.
TACAS-2005-SchwoonE #on the fly #verification: A Note on On-the-Fly Verification Algorithms (SS, JE), pp. 174–190.
SAT-J-2004-DantsinW05 #satisfiability: Derandomization of Schuler’s Algorithm for SAT (ED, AW), pp. 80–88.
SAT-J-2004-GummadiNV05 #independence #satisfiability #set #using: Algorithms for Satisfiability Using Independent Sets of Variables (RG, NSN, VR), pp. 133–144.
SAT-J-2004-Interian05 #approximate #random: Approximation Algorithm for Random MAX- kSAT (YI), pp. 173–182.
SAT-J-2004-TangYRM05 #analysis #problem #quantifier #satisfiability: Analysis of Search Based Algorithms for Satisfiability of Propositional and Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems (DT, YY, DR, SM), pp. 292–305.
SAT-J-2004-TompkinsH05 #implementation #named #satisfiability: UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT (DADT, HHH), pp. 306–320.
CADE-2005-KuncakNR #algebra: An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic (VK, HHN, MCR), pp. 260–277.
CAV-2005-ConwayNDE #analysis #incremental #interprocedural #safety: Incremental Algorithms for Inter-procedural Analysis of Safety Properties (CLC, KSN, DD, SAE), pp. 449–461.
CAV-2005-CostanGGMP #fixpoint #policy #source code #static analysis: A Policy Iteration Algorithm for Computing Fixed Points in Static Analysis of Programs (AC, SG, EG, MM, SP), pp. 462–475.
CAV-2005-NeculaG #program analysis #random #verification: Randomized Algorithms for Program Analysis and Verification (GCN, SG), p. 1.
CAV-2005-PiazzaAMPWM #algebra #biology #challenge #model checking: Algorithmic Algebraic Model Checking I: Challenges from Systems Biology (CP, MA, VM, AP, FW, BM), pp. 5–19.
CSL-2005-ChenD #consistency #constraints #game studies #quantifier: From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction (HC, VD), pp. 232–247.
CSL-2005-Slissenko #logic #verification: Verification in Predicate Logic with Time: Algorithmic Questions (AS), pp. 3–17.
CSL-2005-Soltys #matrix #proving: Feasible Proofs of Matrix Properties with Csanky’s Algorithm (MS), pp. 493–508.
ICLP-2005-LambertCMRS #constraints #search-based: Hybridization of Genetic Algorithms and Constraint Propagation for the BACP (TL, CC, EM, MCR, FS), pp. 421–423.
SAT-2005-ManquinhoM #on the #optimisation #pseudo: On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization (VMM, JPMS), pp. 451–458.
SAT-2005-MneimnehLASS #bound #satisfiability: A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas (MNM, IL, ZSA, JPMS, KAS), pp. 467–474.
TestCom-2005-LiL05a #detection #fault #network #probability #testing: Fault Detection of Hierarchical Networks with Probabilistic Testing Algorithms (KL, DL), pp. 258–274.
HT-2004-OngL #approach #generative #interactive #search-based: A genetic algorithm approach to interactive narrative generation (TO, JJL), pp. 181–182.
SIGMOD-2004-CohenK #network: Spatially-decaying aggregation over a network: model and algorithms (EC, HK), pp. 707–718.
SIGMOD-2004-LernerSWZZ #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.
VLDB-2004-FontouraSZRN #intranet #performance: High Performance Index Build Algorithms for Intranet Search Engines (MF, EJS, JYZ, SR, AN), pp. 1158–1169.
VLDB-2004-GuhaSW #fault #named: REHIST: Relative Error Histogram Construction Algorithms (SG, KS, JW), pp. 300–311.
VLDB-2004-Hellerstein #architecture #data transformation: Architectures and Algorithms for Internet-Scale (P2P) Data Management (JMH), p. 1244.
VLDB-2004-PandeyDO #monitoring #named #web: WIC: A General-Purpose Algorithm for Monitoring Web Information Sources (SP, KD, CO), pp. 360–371.
CSMR-2004-MaqboolB #clustering: The Weighted Combined Algorithm: A Linkage Algorithm for Software Clustering (OM, HAB), pp. 15–24.
ICSM-2004-ZhaoZHMS #feature model #scalability: Alternative Scalable Algorithms for Lattice-Based Feature Location (WZ, LZ, DH, HM, JS), p. 528.
IWPC-2004-WenT #clustering #effectiveness: An Effectiveness Measure for Software Clustering Algorithms (ZW, VT), pp. 194–203.
SCAM-2004-FatiregunHH #evolution #search-based #sequence #using: Evolving Transformation Sequences using Genetic Algorithms (DF, MH, RMH), pp. 66–75.
CIAA-2004-BerstelC #complexity #on the: On the Complexity of Hopcroft’s State Minimization Algorithm (JB, OC), pp. 35–44.
CIAA-2004-PengT #performance #sequence: Time and Space Efficient Algorithms for Constrained Sequence Alignment (ZSP, HFT), pp. 237–246.
DLT-2004-GenestMK #automaton #communication #effectiveness #theorem: A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms (BG, AM, DK), pp. 30–48.
DLT-2004-InenagaST #context-free grammar #pattern matching #performance #subclass: An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars (SI, AS, MT), pp. 225–236.
ICALP-2004-AggarwalFMZ #multi: Algorithms for Multi-product Pricing (GA, TF, RM, AZ), pp. 72–83.
ICALP-2004-AlekhnovichHI #bound #exponential #satisfiability: Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas (MA, EAH, DI), pp. 84–96.
ICALP-2004-ArgeMT #graph #memory management: External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs (LA, UM, LT), pp. 146–157.
ICALP-2004-Fleischer #bound #linear #network: Linear Tolls Suffice: New Bounds and Algorithms for Tolls in Single Source Networks (LF), pp. 544–554.
ICALP-2004-FominKT #exponential: Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In (FVF, DK, IT), pp. 568–580.
ICALP-2004-FominT #exponential #graph #kernel #linear #performance: Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up (FVF, DMT), pp. 581–592.
ICALP-2004-FuW: A 2O(n1-(1/d)log n) Time Algorithm for d-Dimensional Protein Folding in the HP-Model (BF, WW), pp. 630–644.
ICALP-2004-JothiR #approximate #design #network #problem: Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design (RJ, BR), pp. 805–818.
ICALP-2004-KavithaMMP #graph #performance: A Faster Algorithm for Minimum Cycle Basis of Graphs (TK, KM, DM, KEP), pp. 846–857.
ICALP-2004-Muller-OlmS: A Note on Karr’s Algorithm (MMO, HS), pp. 1016–1028.
ICALP-2004-Paluch #approximate: A 2(1/8)-Approximation Algorithm for Rectangle Tiling (KEP), pp. 1054–1065.
ICALP-2004-Rytter #encoding #string: Grammar Compression, LZ-Encodings, and String Algorithms with Implicit Input (WR), pp. 15–27.
ICALP-2004-Williams #constraints: A New Algorithm for Optimal Constraint Satisfaction and Its Implications (RW), pp. 1227–1237.
RTA-2004-Contejean: A Certified AC Matching Algorithm (EC), pp. 70–84.
SEFM-2004-HuBG #generative #optimisation #validation: Theory and Algorithms for the Generation and Validation of Speculative Loop Optimizations (YH, CWB, BG), pp. 281–289.
ICGT-2004-PlumpS #graph #source code #towards: Towards Graph Programs for Graph Algorithms (DP, SS), pp. 128–143.
ICEIS-v1-2004-El-SonbatyK #incremental #mining #performance: New Fast Algorithm for Incremental Mining of Association Rules (YES, RK), pp. 275–281.
ICEIS-v1-2004-JuniorV #graph #relational #xml: Keys Graph — Based Relational to XML Translation Algorithm (WMdAJ, CV), pp. 142–148.
ICEIS-v2-2004-ColaceSVF #automation #learning #ontology: A Semi-Automatic Bayesian Algorithm for Ontology Learning (FC, MDS, MV, PF), pp. 191–196.
ICEIS-v2-2004-ColaceSVF04a #comparison #learning #network: Bayesian Network Structural Learning from Data: An Algorithms Comparison (FC, MDS, MV, PF), pp. 527–530.
ICEIS-v2-2004-CuellarNJP #case study #comparative #network #predict: A Comparative Study of Evolutionary Algorithms for Training Elman Recurrent Neural Networks to Predict Autonomous Indebtedness (MPC, AN, MdCPJ, RPP), pp. 461–464.
ICEIS-v2-2004-Martinez-OtzetaS #analysis #nearest neighbour #probability: Analysis of the Iterated Probabilistic Weighted K Nearest Neighbor Method, a new Distance-Based Algorithm (JMMO, BS), pp. 233–240.
ICEIS-v2-2004-OgielaTO #information management #reasoning #visual notation: Cognitive Reasoning in Intelligent Medical Information Systems — Visual Data Perception Algorithms in Medical Decision support Systems (MRO, RT, LO), pp. 222–225.
ICEIS-v2-2004-PerezMAG: Consolidated Tree Construction Algorithm: Structurally Steady Trees (JMP, JM, OA, IG), pp. 14–21.
ICEIS-v2-2004-WuW04a #comparison #set: Result Comparison of Two Rough Set Based Discretization Algorithms (SW, WW), pp. 511–514.
ICEIS-v3-2004-HaratyOE #case study #comparative #encryption: A Comparative Study of Elgamal Based Cryptographic Algorithms (RAH, HO, ANEK), pp. 79–84.
CIKM-2004-BotW #documentation #feedback #using: Improving document representations using relevance feedback: the RFA algorithm (RSB, YfBW), pp. 270–278.
CIKM-2004-GollapudiS #analysis #framework #set: Framework and algorithms for trend analysis in massive temporal data sets (SG, DS), pp. 168–177.
CIKM-2004-SongB #detection #effectiveness #named #performance: BioDIFF: an effective fast change detection algorithm for genomic and proteomic data (YS, SSB), pp. 146–147.
CIKM-2004-XueZCYMXF04a #named #similarity: MRSSA: an iterative algorithm for similarity spreading over interrelated objects (GRX, HJZ, ZC, YY, WYM, WX, EAF), pp. 240–241.
ICML-2004-AhnCO #multi: A multiplicative up-propagation algorithm (JHA, SC, JHO).
ICML-2004-BachLJ #kernel #learning #multi: Multiple kernel learning, conic duality, and the SMO algorithm (FRB, GRGL, MIJ).
ICML-2004-EsmeirM #induction: Lookahead-based algorithms for anytime induction of decision trees (SE, SM).
ICML-2004-FungDBR #kernel #performance #using: A fast iterative algorithm for fisher discriminant using heterogeneous kernels (GF, MD, JB, RBR).
ICML-2004-Gilad-BachrachNT #feature model: Margin based feature selection — theory and algorithms (RGB, AN, NT).
ICML-2004-KashimaT #graph #kernel #learning #sequence: Kernel-based discriminative learning algorithms for labeling sequences, trees, and graphs (HK, YT).
ICML-2004-RayP: Sequential skewing: an improved skewing algorithm (SR, DP).
ICML-2004-Zhang #linear #predict #probability #problem #scalability #using: Solving large scale linear prediction problems using stochastic gradient descent algorithms (TZ0).
ICML-2004-ZhangKY: Surrogate maximization/minimization algorithms for AdaBoost and the logistic regression model (ZZ, JTK, DYY).
ICML-2004-ZhangYK #kernel #learning #matrix #using: Bayesian inference for transductive learning of kernel matrix using the Tanner-Wong data augmentation algorithm (ZZ, DYY, JTK).
ICPR-v1-2004-AbrantesM #framework: The Mean Shift Algorithm and the Unified Framework (AJA, JSM), pp. 244–247.
ICPR-v1-2004-ChenCL #detection #robust: A Robust Algorithm of Principal Curve Detection (MC, ZC, YL), pp. 429–432.
ICPR-v1-2004-DmitryD #classification #effectiveness: Data Dependent Classifier Fusion for Construction of Stable Effective Algorithms (DV, DK), pp. 144–147.
ICPR-v1-2004-DmitryD04a #fuzzy #generative: An Algorithm for Rule Generation in Fuzzy Expert Systems (DK, DV), pp. 212–215.
ICPR-v1-2004-HordleyF: Re-evaluating Colour Constancy Algorithms (SDH, GDF), pp. 76–79.
ICPR-v1-2004-IlaGC #architecture #detection #parallel: Proposal of a Parallel Architecture for a Motion Detection Algorithm (VI, RG, FC), pp. 797–800.
ICPR-v1-2004-JainTLB #clustering: Landscape of Clustering Algorithms (AKJ, APT, MHCL, JMB), pp. 260–263.
ICPR-v1-2004-KimYL #distance #graph #relational #using: A New Attributed Relational Graph Matching Algorithm Using the Nested Structure of Earth Mover’s Distance (DHK, IDY, SUL), pp. 48–51.
ICPR-v1-2004-Martin-MerinoM #visualisation: A New Sammon Algorithm for Sparse Data Visualization (MMM, AM), pp. 477–481.
ICPR-v1-2004-MiasnikovRH #clustering: A Hierarchical Projection Pursuit Clustering Algorithm (ADM, JER, RMH), pp. 268–271.
ICPR-v1-2004-MottlDK #pattern matching #pattern recognition #problem #recognition: Pattern Recognition in Interrelated Data: The Problem, Fundamental Assumptions, Recognition Algorithms (VM, SD, AK), pp. 188–191.
ICPR-v1-2004-PetrosinoV #clustering #fuzzy #named #parallel #scalability: P-AFLC: A Parallel Scalable Fuzzy Clustering Algorithm (AP, MV), pp. 809–812.
ICPR-v1-2004-PopoviciTRM #detection #evaluation #locality #on the #performance: On Performance Evaluation of Face Detection and Localization Algorithms (VP, JPT, YR, SM), pp. 313–317.
ICPR-v1-2004-TabboneW04b #adaptation #image: Binarization of Color Images from an Adaptation of Possibilistic C-Means Algorithm (ST, LW), pp. 704–707.
ICPR-v1-2004-TremblaySM #multi #nearest neighbour #optimisation #random #search-based #using: Optimizing Nearest Neighbour in Random Subspaces using a Multi-Objective Genetic Algorithm (GT, RS, PM), p. 208.
ICPR-v1-2004-VirmajokiF #clustering #divide and conquer #graph: Divide-and-Conquer Algorithm for Creating Neighborhood Graph for Clustering (OV, PF), pp. 264–267.
ICPR-v1-2004-ZhuRL #3d: A Landweber Algorithm for 3D Confocal Microscopy Restoration (DZ, MR, RAL), pp. 552–555.
ICPR-v2-2004-CaetanoCB #comparison #distance #metric #using: A Comparison of Junction Tree and Relaxation Algorithms for Point Matching using Different Distance Metrics (TSC, TC, DACB), pp. 124–127.
ICPR-v2-2004-FayolleRT #3d #modelling #re-engineering #search-based #using: 3D Shape Reconstruction of Template Models Using Genetic Algorithms (PAF, CR, CT), pp. 269–272.
ICPR-v2-2004-HouZ #3d #estimation: Filter Algorithm for 3D Pose Estimation of Maneuvering Target (FH, FZ), pp. 140–144.
ICPR-v2-2004-Kazanov #image #segmentation: A New Color Image Segmentation Algorithm based on Watershed Transformation (MK), pp. 590–593.
ICPR-v2-2004-LuoYT #automation #detection #performance: An Efficient Automatic Redeye Detection and Correction Algorithm (HL, JY, DT), pp. 883–886.
ICPR-v2-2004-MilanovaTK #composition #image #recursion: Lossless Data Compression for Image Decomposition With Recursive IDP Algorithm (MGM, VT, RK), pp. 823–826.
ICPR-v2-2004-RayBP #problem #search-based: New Operators of Genetic Algorithms for Traveling Salesman Problem (SSR, SB, SKP), pp. 497–500.
ICPR-v2-2004-TremblaisA #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-WongAH #prototype #recognition: A Software Algorithm Prototype for Optical Recognition of Embossed Braille (LW, WHA, SH), pp. 586–589.
ICPR-v2-2004-YuWC #3d #multi #performance #re-engineering #recursion: A Fast Recursive 3D Model Reconstruction Algorithm for Multimedia Applications (YKY, KhW, MMYC), pp. 241–244.
ICPR-v3-2004-ChambonC #robust #towards: Towards Correlation-Based Matching Algorithms that are Robust Near Occlusions (SC, AC), pp. 20–23.
ICPR-v3-2004-ChenCG #adaptation #detection #search-based #self: Resampling for Face Detection by Self-Adaptive Genetic Algorithm (JC, XC, WG), pp. 822–825.
ICPR-v3-2004-DeguchiKO: Object Tracking by the Mean-Shift of Regional Color Distribution Combined with the Particle-Filter Algorithm (KD, OK, TO), pp. 506–509.
ICPR-v3-2004-DOrazioLCD #detection #image #realtime: An Algorithm for Real Time Eye Detection in Face Images (TD, ML, GC, AD), pp. 278–281.
ICPR-v3-2004-FujimuraOT #3d #re-engineering: Improved 3D Head Reconstruction System based on Combining Shape-From-Silhouette with Two-Stage Stereo Algorithm (KF, YO, TT), pp. 127–130.
ICPR-v3-2004-KatoW #classification #nearest neighbour #performance: Direct Condensing: An Efficient Voronoi Condensing Algorithm for Nearest Neighbor Classifiers (TK, TW), pp. 474–477.
ICPR-v3-2004-KawanishiKKT #adaptation #performance #using: A Fast Template Matching Algorithm with Adaptive Skipping Using Inner-Subtemplates’ Distances (TK, TK, KK, ST), pp. 654–657.
ICPR-v3-2004-NaderiMC #image #optimisation #using #verification: 1D-HMM for Face Verification: Model Optimization Using Improved Algorithm and Intelligent Selection of Training Images (SN, MSM, NMC), pp. 330–333.
ICPR-v3-2004-WuTR #component #video: High Frequency Component Compensation based Super-Resolution Algorithm for Face Video Enhancement (JW, MMT, BDR), pp. 598–601.
ICPR-v4-2004-Cheung #automation #clustering #towards: A Rival Penalized EM Algorithm towards Maximizing Weighted Likelihood for Density Mixture Clustering with Automatic Model Selection (YmC), pp. 633–636.
ICPR-v4-2004-GoniEVC #detection #eye tracking #robust: Robust Algorithm for Pupil-Glint Vector Detection in a Video-oculography Eyetracking System (SG, JE, AV, RC), pp. 941–944.
ICPR-v4-2004-JinSS #adaptation #detection #image #novel: A Novel Adaptive Image Enhancement Algorithm for Face Detection (LJ, SS, MS), pp. 843–848.
ICPR-v4-2004-LaiY #fault #network #predict: Successive-Least-Squares Error Algorithm on Minimum Description Length Neural Networks for Time Series Prediction (YNL, SYY), pp. 609–612.
ICPR-v4-2004-NockN #clustering #optimisation: Improving Clustering Algorithms through Constrained Convex Optimization (RN, FN), pp. 557–560.
ICPR-v4-2004-PaclikVD #feature model #multi: Multi-Class Extensions of the GLDB Feature Extraction Algorithm for Spectral Data (PP, SV, RPWD), pp. 629–632.
ICPR-v4-2004-QinandS #analysis #clustering #kernel: Kernel Neural Gas Algorithms with Application to Cluster Analysis (AKQ, PNS), pp. 617–620.
ICPR-v4-2004-QinandS04a #kernel #learning #novel #prototype: A Novel Kernel Prototype-Based Learning Algorithm (AKQ, PNS), pp. 621–624.
ICPR-v4-2004-Xiao-JunKYMW #feature model #recognition: A New Direct LDA (D-LDA) Algorithm for Feature Extraction in Face Recognition (XW, JK, JYY, KM, SW), pp. 545–548.
ICPR-v4-2004-YagerA #evaluation: Evaluation of Fingerprint Orientation Field Registration Algorithms (NY, AA), pp. 641–644.
ICPR-v4-2004-ZhuRL04a #optimisation #robust: A Robust Regularised Restoration Algorithm Based on Topkis-Veinott Optimisation Method (DZ, MR, RAL), pp. 705–708.
KDD-2004-DavidsonGST #approach #data mining #matrix #mining #quality: A general approach to incorporate data quality matrices into data mining algorithms (ID, AG, AS, GKT), pp. 794–798.
KDD-2004-LiuYM #classification #parametricity #performance: The IOC algorithm: efficient many-class non-parametric classification for high-dimensional data (TL, KY, AWM), pp. 629–634.
KDD-2004-Ordonez #clustering #programming #sql: Programming the K-means clustering algorithm in SQL (CO), pp. 823–828.
KDD-2004-RamakrishnanKMPH #mining: Turning CARTwheels: an alternating algorithm for mining redescriptions (NR, DK, BM, MP, RFH), pp. 266–275.
KDD-2004-YePLJXK #composition #incremental #named #reduction: IDR/QR: an incremental dimension reduction algorithm via QR decomposition (JY, QL, HX, HP, RJ, VK), pp. 364–373.
KR-2004-Baget #concept #graph: Improving the Forward Chaining Algorithm for Conceptual Graphs Rules (JFB), pp. 407–414.
KR-2004-BaralE #policy #polynomial: A Polynomial-Time Algorithm for Constructing k-Maintainable Policies (CB, TE), pp. 720–730.
KR-2004-Gabaldon: Precondition Control and the Progression Algorithm (AG), pp. 634–643.
SEKE-2004-FengyanZX #kernel #modelling #parametricity #reliability: A Nonparametric Software Reliability Model Based on Kernel Estimator and Optimum Algorithm (HF, QZ, WX), pp. 13–18.
SIGIR-2004-Bot #documentation #feedback #representation: Improving document representation by accumulating relevance feedback (abstract only): the relevance feedback accumulation algorithm (RSB), p. 602.
SIGIR-2004-McLaughlinH #collaboration #evaluation #experience #metric #user interface: A collaborative filtering algorithm and evaluation metric that accurately model the user experience (MRM, JLH), pp. 329–336.
SIGIR-2004-TryfonopoulosKD #information retrieval #modelling #proximity: Filtering algorithms for information retrieval models with named attributes and proximity operators (CT, MK, YD), pp. 313–320.
OOPSLA-2004-AbuaiadhOPS #parallel #performance: An efficient parallel heap compaction algorithm (DA, YO, EP, US), pp. 224–236.
PLDI-2004-SmithRH #graph: A generalized algorithm for graph-coloring register allocation (MDS, NR, GHH), pp. 277–288.
SAS-2004-GulwaniN #polynomial: A Polynomial-Time Algorithm for Global Value Numbering (SG, GCN), pp. 212–227.
SIGAda-2004-SoriconeN #analysis #comparative #implementation #search-based: Comparative analysis of genetic algorithm implementations (RS, MN), pp. 35–38.
ASE-2004-ApiwattanapongOH #difference #object-oriented #source code: A Differencing Algorithm for Object-Oriented Programs (TA, AO, MJH), pp. 2–13.
ASE-2004-KhorG #automation #branch #concept analysis #search-based #testing #using: Using a Genetic Algorithm and Formal Concept Analysis to Generate Branch Coverage Test Data Automatically (SK, PG), pp. 346–349.
FSE-2004-PerkinsE #detection #incremental #invariant #performance: Efficient incremental algorithms for dynamic detection of likely invariants (JHP, MDE), pp. 23–32.
ICSE-2004-OrsoALRH #comparison #empirical #impact analysis: An Empirical Comparison of Dynamic Impact Analysis Algorithms (AO, TA, JL, GR, MJH), pp. 491–500.
SAC-2004-Al-SadiA #fault tolerance #performance #using: Efficient fault-tolerant routing algorithm for OTIS-cube using unsafety vectors (JAS, AMA), pp. 1426–1430.
SAC-2004-AvilaL #documentation: A new algorithm for removing noisy borders from monochromatic documents (BTÁ, RDL), pp. 1219–1225.
SAC-2004-Bourgeois-RepubliqueCC #automation: Automatic fitting of cochlear implants with evolutionary algorithms (CBR, JJC, PC), pp. 296–300.
SAC-2004-CaldeiraMR #hybrid #problem #using: Using a hybrid Evolutionary-Taboo Algorithm to solve Job Shop Problem (JPC, FM, ACR), pp. 1446–1451.
SAC-2004-Calderon-BenavidesGAGD #collaboration #comparison #multi #predict: A comparison of several predictive algorithms for collaborative filtering on multi-valued ratings (MLCB, CNGC, JdJPA, JCGD, JD), pp. 1033–1039.
SAC-2004-CarvalhoOFS #parallel: A parallel algorithm for the extraction of structured motifs (AMC, ALO, ATF, MFS), pp. 147–153.
SAC-2004-Chen #transitive: A new algorithm for computing transitive closures (YC), pp. 1091–1092.
SAC-2004-FeltlR #hybrid #problem #search-based: An improved hybrid genetic algorithm for the generalized assignment problem (HF, GRR), pp. 990–995.
SAC-2004-Guo #clustering #evaluation #framework #functional: A new framework for clustering algorithm evaluation in the domain of functional genomics (AG), pp. 143–146.
SAC-2004-JulstromA #hybrid #problem: Two hybrid evolutionary algorithms for the rectilinear Steiner arborescence problem (BAJ, AA), pp. 980–984.
SAC-2004-KarabudakHB #search-based #using: A call admission control scheme using genetic algorithms (DK, CCH, BB), pp. 1151–1158.
SAC-2004-Liew #search-based #using: Using a genetic algorithm to optimize the gape of a snake jaw (CWL), pp. 975–979.
SAC-2004-LuLFDB #clustering #named #performance #search-based: FGKA: a Fast Genetic K-means Clustering Algorithm (YL, SL, FF, YD, SJB), pp. 622–623.
SAC-2004-OrlandoPS #mining #sequence: A new algorithm for gap constrained sequence mining (SO, RP, CS), pp. 540–547.
SAC-2004-SanthanakrishnanACL #named #self: GD-GhOST: a goal-oriented self-tuning caching algorithm (GS, AA, PKC, DL), pp. 1141–1145.
LDTA-2004-JohnstoneSE #case study #glr #parsing: The Grammar Tool Box: A Case Study Comparing GLR Parsing Algorithms (AJ, ES, GRE), pp. 97–113.
CC-2004-ParkerC: An Automata-Theoretic Algorithm for Counting Solutions to Presburger Formulas (EP, SC), pp. 104–119.
DAC-2004-ChauhanCK #satisfiability #simulation: A SAT-based algorithm for reparameterization in symbolic simulation (PC, EMC, DK), pp. 524–529.
DAC-2004-ChoiPR #novel #process: Novel sizing algorithm for yield improvement under process variation in nanometer technology (SHC, BCP, KR), pp. 454–459.
DAC-2004-ChopraV #pseudo: Implicit pseudo boolean enumeration algorithms for input vector control (KC, SBKV), pp. 767–772.
DAC-2004-ContiCVOT #analysis #performance: Performance analysis of different arbitration algorithms of the AMBA AHB bus (MC, MC, GBV, SO, CT), pp. 618–621.
DAC-2004-HandaV #online #performance: An efficient algorithm for finding empty space for online FPGA placement (MH, RV), pp. 960–965.
DAC-2004-KejariwalGNDG #clustering #energy #mobile: Proxy-based task partitioning of watermarking algorithms for reducing energy consumption in mobile devices (AK, SG, AN, ND, RG), pp. 556–561.
DAC-2004-Kerntopf #heuristic #logic #synthesis: A new heuristic algorithm for reversible logic synthesis (PK), pp. 834–837.
DAC-2004-LiYYYL #adaptation #design #representation #using: A packing algorithm for non-manhattan hexagon/triangle placement design by using an adaptive o-tree representation (JL, TY, BY, JY, CL), pp. 646–651.
DAC-2004-RoyB #design #fixpoint #float #matlab: An algorithm for converting floating-point computations to fixed-point in MATLAB based FPGA design (SR, PB), pp. 484–487.
DAC-2004-SalujaK #approximate #robust: A robust algorithm for approximate compatible observability don’t care (CODC) computation (NS, SPK), pp. 422–427.
DAC-2004-SelvakkumaranRRK #clustering #multi: Multi-resource aware partitioning algorithms for FPGAs with heterogeneous resources (NS, AR, SR, GK), pp. 741–746.
DAC-2004-SilveiraP #network #reduction: Exploiting input information in a model reduction algorithm for massively coupled parasitic networks (LMS, JRP), pp. 385–388.
DATE-v1-2004-BabighianBM #scalability: A Scalable ODC-Based Algorithm for RTL Insertion of Gated Clocks (PB, LB, EM), pp. 500–505.
DATE-v1-2004-HandaV #performance: A Fast Algorithm for Finding Maximal Empty Rectangles for Dynamic FPGA Placement (MH, RV), pp. 744–745.
DATE-v1-2004-NagariN #multi: A 2.7V 350muW 11-b Algorithmic Analog-to-Digital Converter with Single-Ended Multiplexed Inputs (AN, GN), pp. 76–81.
DATE-v2-2004-DengW: Optimal Algorithm for Minimizing the Number of Twists in an On-Chip Bus (LD, MDFW), pp. 1104–1109.
DATE-v2-2004-GuptaJ #architecture: An Algorithm for Nano-Pipelining of Circuits and Architectures for a Nanotechnology (PG, NKJ), pp. 974–979.
DATE-v2-2004-KumarBK #analysis #array #embedded #memory management #named #reduction #using: MemMap: Technology Mapping Algorithm for Area Reduction in FPGAs with Embedded Memory Arrays Using Reconvergence Analysis (AMK, JB, VK), pp. 922–929.
DATE-v2-2004-LorenzM #code generation #search-based #using: Phase Coupled Code Generation for DSPs Using a Genetic Algorithm (ML, PM), pp. 1270–1275.
DATE-v2-2004-ReedLBMC #parallel #simulation: An Application of Parallel Discrete Event Simulation Algorithms to Mixed Domain System Simulation (DKR, SPL, JB, JAM, DMC), pp. 1356–1357.
DATE-v2-2004-VermaWM: Cache-Aware Scratchpad Allocation Algorithm (MV, LW, PM), pp. 1264–1269.
HPDC-2004-ZhangKPCNWS #parallel #using: Strategies for Using Additional Resources in Parallel Hash-Based Join Algorithms (XZ, TMK, TP, ÜVÇ, SN, PW, JHS), pp. 4–13.
LCTES-2004-HiserD #compilation #memory management #named #performance: EMBARC: an efficient memory bank assignment algorithm for retargetable compilers (JH, JWD), pp. 182–191.
PDP-2004-AttiyaH #distributed: Two Phase Algorithm for Load Balancing in Heterogeneous Distributed Systems (GA, YH), p. 434–?.
PDP-2004-Bilbao-CastroCFG #3d #comparison #parallel #re-engineering: Parallelization and Comparison of 3D Iterative Reconstruction Algorithms (JRBC, JMC, JJF, IG), pp. 96–102.
ESOP-2004-CarlssonB #automaton #constraints #finite: From Constraints to Finite Automata to Filtering Algorithms (MC, NB), pp. 94–108.
STOC-2004-AlbersS #on the #performance: On the performance of greedy algorithms in packet buffering (SA, MS), pp. 35–44.
STOC-2004-Ambainis #quantum: Quantum algorithms a decade after shor (AA), p. 111.
STOC-2004-BansalBCM #approximate: Approximation algorithms for deadline-TSP and vehicle routing with time-windows (NB, AB, SC, AM), pp. 166–174.
STOC-2004-BatuKR #sublinear #testing: Sublinear algorithms for testing monotone and unimodal distributions (TB, RK, RR), pp. 381–390.
STOC-2004-Devanur #constraints #equilibrium: The spending constraint model for market equilibrium: algorithmic, existence and uniqueness results (NRD), pp. 519–528.
STOC-2004-DunaganV #linear #polynomial #source code: A simple polynomial-time rescaling algorithm for solving linear programs (JD, SV), pp. 315–320.
STOC-2004-GargK #equilibrium: Auction algorithms for market equilibrium (RG, SK), pp. 511–518.
STOC-2004-GuptaPRS #approximate #optimisation #probability: Boosted sampling: approximation algorithms for stochastic optimization (AG, MP, RR, AS), pp. 417–426.
STOC-2004-Indyk #data type #geometry #problem: Algorithms for dynamic geometric problems over data streams (PI), pp. 373–380.
STOC-2004-KempeM #analysis #distributed: A decentralized algorithm for spectral analysis (DK, FM), pp. 561–568.
STOC-2004-KortsarzN #approximate #graph: Approximation algorithm for k-node connected subgraphs via critical graphs (GK, ZN), pp. 138–145.
STOC-2004-LeviRS #problem: Primal-dual algorithms for deterministic inventory problems (RL, RR, DBS), pp. 353–362.
STOC-2004-Reichardt #optimisation #quantum: The quantum adiabatic optimization algorithm and local minima (BR), pp. 502–510.
STOC-2004-RodittyZ #graph #linear #reachability: A fully dynamic reachability algorithm for directed graphs with an almost linear update time (LR, UZ), pp. 184–191.
STOC-2004-SpielmanT #clustering #graph #linear: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems (DAS, SHT), pp. 81–90.
STOC-2004-Talwar #metric: Bypassing the embedding: algorithms for low dimensional metrics (KT), pp. 281–290.
TACAS-2004-GeldenhuysV #ltl #on the fly #performance #verification: Tarjan’s Algorithm Makes On-the-Fly LTL Verification More Efficient (JG, AV), pp. 205–219.
CAV-2004-Arons #execution #verification: Verification of an Advanced mips-Type Out-of-Order Execution Algorithm (TA), pp. 414–426.
CAV-2004-GaoH #parallel #reduction: A Formal Reduction for Lock-Free Parallel Algorithms (HG, WHH), pp. 44–56.
IJCAR-2004-Avenhaus #performance #permutation: Efficient Algorithms for Computing Modulo Permutation Theories (JA), pp. 415–429.
IJCAR-2004-GilHSZ #constraints #finite #order #performance #problem: Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract (ÀJG, MH, GS, BZ), pp. 244–258.
SAT-2004-DantsinW #satisfiability: Derandomization of Schuler’s Algorithm for SAT (ED, AW), pp. 69–75.
SAT-2004-GummadiNV #independence #satisfiability #set #using: Algorithms for Satisfiability using Independent Sets of Variables (RG, NSN, VR), pp. 56–63.
SAT-2004-Interian #approximate #random: Approximation Algorithm for Random MAX-kSAT (YI), pp. 64–68.
SAT-2004-TangYRM #analysis #problem #quantifier #satisfiability: Analysis of Search Based Algorithms for Satisfiability of Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems (DT, YY, DR, SM), pp. 214–223.
SAT-2004-TompkinsH #implementation #named #satisfiability: UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT & MAX-SAT (DADT, HHH), pp. 37–46.
TestCom-2004-DaiGNP #design #uml: From Design to Test with UML: Applied to a Roaming Algorithm for Bluetooth Devices (ZRD, JG, HN, HP), pp. 33–49.
DRR-2003-MaoRK #analysis #documentation #overview: Document structure analysis algorithms: a literature survey (SM, AR, TK), pp. 197–207.
DRR-2003-SuwaN #composition #image #using: Separation algorithm of superimposed pattern using directional decomposition of an image (MS, SN), pp. 278–285.
ICDAR-2003-Breuel #analysis #documentation #layout: An Algorithm for Finding Maximal Whitespace Rectangles at Arbitrary Orientations for Document Layout Analysis (TMB), pp. 66–70.
ICDAR-2003-BrittoSSSB #clustering #low cost #parallel #using: A Low-Cost Parallel K-Means VQ Algorithm Using Cluster Computing (AdSBJ, PSLdS, RS, SdRSdS, DLB), pp. 839–843.
ICDAR-2003-ChangC #component #using: A Component-Labeling Algorithm Using Contour Tracing Technique (FC, CJC), pp. 741–745.
ICDAR-2003-ChaTS #optimisation #recognition #search-based #similarity #using: Optimizing Binary Feature Vector Similarity Measure using Genetic Algorithm and Handwritten Character Recognition (SHC, CCT, SNS), pp. 662–665.
ICDAR-2003-ChenD #documentation #multi #recognition: Rejection Algorithm for Mis-segmented Characters In Multilingual Document Recognition (ZC, XD), pp. 746–749.
ICDAR-2003-HaoLS03a #classification #comparison #search-based #set: Comparison of Genetic Algorithm and Sequential Search Methods for Classifier Subset Selection (HH, CLL, HS), pp. 765–769.
ICDAR-2003-Hilaire #evaluation #performance: A Matching Scheme to Enhance Performance Evaluation of Raster-to-Vector Conversion Algorithms (XH), pp. 629–633.
ICDAR-2003-HuangWL #parallel: An Improved Parallel Thinning Algorithm (LH, GW, CL), pp. 780–783.
ICDAR-2003-KimMO #classification #statistics #word: A Text Watermarking Algorithm based on Word Classification and Inter-word Space Statistics (YWK, KAM, ISO), pp. 775–779.
ICDAR-2003-LeedhamYTTM #comparison #documentation #image #segmentation: Comparison of Some Thresholding Algorithms for Text/Background Segmentation in Difficult Document Images (GL, YC, KT, JHNT, LM), p. 859–?.
ICDAR-2003-MoritaSBS03a #feature model #multi #recognition #search-based #using #word: Unsupervised Feature Selection Using Multi-Objective Genetic Algorithms for Handwritten Word Recognition (MEM, RS, FB, CYS), pp. 666–670.
ICDAR-2003-OliveiraSBS #approach #feature model #multi #search-based: Feature Selection for Ensembles: A Hierarchical Multi-Objective Genetic Algorithm Approach (LESdO, RS, FB, CYS), p. 676–?.
ICDAR-2003-PearceA #segmentation: An Evolutionary Algorithm for General Symbol Segmentation (SP, MA), pp. 726–730.
ICDAR-2003-RadtkeOSW #design #multi #using: Intelligent Zoning Design Using Multi-Objective Evolutionary Algorithms (PVWR, LESdO, RS, TW), pp. 824–828.
ICDAR-2003-ShafieiR #markov #modelling #online #segmentation #using #verification: A New On-Line Signature Verification Algorithm Using Variable Length Segmentation and Hidden Markov Models (MMS, HRR), p. 443–?.
ICDAR-2003-StefanoCM #classification #reliability #search-based: Exploiting Reliability for Dynamic Selection of Classifiers by Means of Genetic Algorithms (CDS, ADC, AM), pp. 671–675.
ICDAR-2003-ZhengLD #detection #documentation #modelling: A Model-based Line Detection Algorithm in Documents (YZ, HL, DSD), pp. 44–48.
PODS-2003-KhullerKW #migration: Algorithms for data migration with cloning (SK, YAK, YC(W), pp. 27–36.
SIGMOD-2003-KementsietsidisAM #peer-to-peer #semantics: Mapping Data in Peer-to-Peer Systems: Semantics and Algorithmic Issues (AK, MA, RJM), pp. 325–336.
SIGMOD-2003-PapadiasTFS #query: An Optimal and Progressive Algorithm for Skyline Queries (DP, YT, GF, BS), pp. 467–478.
SIGMOD-2003-SchleimerWA #documentation #named: Winnowing: Local Algorithms for Document Fingerprinting (SS, DSW, AA), pp. 76–85.
ITiCSE-2003-DAntonio: Incorporating bioinformatics in an algorithms course (LD), pp. 211–214.
ITiCSE-2003-Gal-EzerVZ #approach #education #performance: Teaching algorithm efficiency in a CS1 course SBTa different approach (JGE, TV, EZ), p. 256.
ITiCSE-2003-PapadopoulosP #authoring #education #using: Using ToolBook authoring tool to facilitate the teaching of algorithms (GP, HMP), p. 277.
ITiCSE-2003-Papalaskari #evaluation: Peer evaluation in an algorithms course (MAP), p. 274.
ITiCSE-2003-PapamanthouP #problem #visualisation: A visualization of the primal simplex algorithm for the assignment problem (CP, KP), p. 267.
CSMR-2003-AntoniolPN #clustering #library #search-based: Moving to Smaller Libraries via Clustering and Genetic Algorithms (GA, MDP, MN), pp. 307–316.
CSMR-2003-SaeedMBHS #clustering #using: Software Clustering Techniques and the Use of Combined Algorithm (MS, OM, HAB, SZH, SMS), pp. 301–306.
IWPC-2003-WenT #distance: An Optimal Algorithm for MoJo Distance (ZW, VT), pp. 227–236.
SCAM-2003-BinkleyH #analysis #graph #optimisation #performance #reachability #scalability #source code: Results from a Large-Scale Study of Performance Optimization Techniques for Source Code Analyses Based on Graph Reachability Algorithms (DB, MH), p. 203–?.
WCRE-2003-AliasB #analysis #data flow #recognition: Algorithm Recognition based on Demand-Driven Data-flow Analysis (CA, DB), pp. 296–305.
CIAA-2003-AllauzenM #performance: An Efficient Pre-determinization Algorithm (CA, MM), pp. 83–95.
CIAA-2003-FanLLTWY: An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics Extended Abstract (THF, SL, HIL, TST, TCW, AY), pp. 251–257.
CIAA-2003-Ravikumar #automaton: Weak Minimization of DFA — An Algorithm and Applications (BR), pp. 226–238.
DLT-2003-ChamparnaudC #automaton #nondeterminism #reduction: NFA Reduction Algorithms by Means of Regular Inequalities (JMC, FC), pp. 194–205.
ICALP-2003-AgeevYZ #approximate #combinator #problem: Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem (AAA, YY, JZ), pp. 145–156.
ICALP-2003-AmirACLP #bound: Function Matching: Algorithms, Applications, and a Lower Bound (AA, YA, RC, ML, EP), pp. 929–942.
ICALP-2003-BaswanaS #graph #linear: A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n1+1/k) Size in Weighted Graphs (SB, SS), pp. 384–296.
ICALP-2003-BespamyatnikhS #approximate: Dynamic Algorithms for Approximating Interdistances (SB, MS), pp. 1169–1180.
ICALP-2003-BhatiaCFN #aspect-oriented: Algorithmic Aspects of Bandwidth Trading (RB, JC, AF, JN), pp. 751–766.
ICALP-2003-Blaser #approximate #difference #symmetry: An Improved Approximation Algorithm for the Asymmetric TSP with Strengthened Triangle Inequality (MB), pp. 157–163.
ICALP-2003-DeanG #approximate #scheduling: Improved Approximation Algorithms for Minimum-Space Advertisement Scheduling (BCD, MXG), pp. 1138–1152.
ICALP-2003-DemaineFHT #graph #parametricity: Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs (EDD, FVF, MTH, DMT), pp. 829–844.
ICALP-2003-ElkinK #approximate #multi #problem: Approximation Algorithm for Directed Telephone Multicast Problem (ME, GK), pp. 212–223.
ICALP-2003-GandhiHKKS #approximate: An Improved Approximation Algorithm for Vertex Cover with Hard Capacities (RG, EH, SK, GK, AS), pp. 164–175.
ICALP-2003-HallHS #complexity #multi #performance: Multicommodity Flows over Time: Efficient Algorithms and Complexity (AH, SH, MS), pp. 397–409.
ICALP-2003-Jagerskupper #analysis: Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces (JJ), pp. 1068–1079.
ICALP-2003-SittersSP #problem: A Competitive Algorithm for the General 2-Server Problem (RS, LS, WdP), pp. 624–636.
RTA-2003-KapurNW #composition #protocol: An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation (DK, PN, LW), pp. 165–179.
RTA-2003-McAllester #logic #ml #type inference: Joint RTA-TLCA Invited Talk: A Logical Algorithm for ML Type Inference (DAM), pp. 436–451.
IFL-2003-MartinezP #algebra #interface: Building an Interface Between Eden and Maple: A Way of Parallelizing Computer Algebra Algorithms (RMT, RP), pp. 135–151.
AGTIVE-2003-SmithPS #specification: Local Specification of Surface Subdivision Algorithms (CS, PP, FFS), pp. 313–327.
SOFTVIS-2003-GrissomMN #education #student #visualisation: Algorithm Visualization in CS Education: Comparing Levels of Student Engagement (SG, MFM, TLN), pp. 87–94.
SOFTVIS-2003-Hubscher-YoungerS #student #visualisation: Dancing Hamsters and Marble Statues: Characterizing Student Visualizations of Algorithms (THY, NHN), pp. 95–104.
ICEIS-v1-2003-KaramEII #constraints #maintenance: The Enhanced Greedy Interchange Algorithm for the Selection of Materialized Views Under a Maintenance Cost Constraint in Data Warehouses (OHK, MES, OI, RI), pp. 279–284.
ICEIS-v2-2003-DoP #dataset #mining #scalability: Mining Very Large Datasets with Support Vector Machine Algorithms (TND, FP), pp. 140–147.
ICEIS-v2-2003-HashemGH #ad hoc #mobile #network #search-based: A Quality-Of-Service-Aware Genetic Algorithm for the Source Routing in Ad-Hoc Mobile Networks (MH, SG, MH), pp. 589–599.
ICEIS-v2-2003-HassanienA #classification #image #performance #retrieval #set: An Efficient Classification and Image Retrieval Algorithm Based on Rough Set Theory (AEH, JMHA), pp. 457–460.
ICEIS-v2-2003-SalemSA #self #using: Improving Self-Organizing Feature Map (SOFM) Training Algorithm Using K-Means Initialization (ABMS, MMS, AFA), pp. 399–405.
ICEIS-v2-2003-SrikumarB #mining #set #transaction: An Algorithm for Mining Maximal Frequent Sets Based on Dominancy of Transactions (KS, BB), pp. 422–425.
ICEIS-v2-2003-TolbaMGA #analysis #image #multi #segmentation #using: MR-Brain Image Segmentation Using Gaussian Multiresolution Analysis and the EM Algorithm (MFT, MGM, TFG, MAMS), pp. 165–170.
ECIR-2003-AlfonsecaR #generative #search-based: Generating Extracts with Genetic Algorithms (EA, PR), pp. 511–519.
ICML-2003-BaramEL #learning #online: Online Choice of Active Learning Algorithms (YB, REY, KL), pp. 19–26.
ICML-2003-Bouckaert #learning #testing: Choosing Between Two Learning Algorithms Based on Calibrated Tests (RRB), pp. 51–58.
ICML-2003-ConitzerS #learning #multi #named #self: AWESOME: A General Multiagent Learning Algorithm that Converges in Self-Play and Learns a Best Response Against Stationary Opponents (VC, TS), pp. 83–90.
ICML-2003-GhavamzadehM #policy: Hierarchical Policy Gradient Algorithms (MG, SM), pp. 226–233.
ICML-2003-Harrington #collaboration #online #ranking #using: Online Ranking/Collaborative Filtering Using the Perceptron Algorithm (EFH), pp. 250–257.
ICML-2003-JinYZH #exponential #performance #scalability: A Faster Iterative Scaling Algorithm for Conditional Exponential Model (RJ, RY, JZ, AGH), pp. 282–289.
ICML-2003-Mesterharm #multi #using: Using Linear-threshold Algorithms to Combine Multi-class Sub-experts (CM), pp. 544–551.
ICML-2003-SchoknechtM #performance: TD(0) Converges Provably Faster than the Residual Gradient Algorithm (RS, AM), pp. 680–687.
KDD-2003-PeterCG #clustering #dataset #scalability: New unsupervised clustering algorithm for large datasets (WP, JC, CG), pp. 643–648.
KDD-2003-WhiteS #network: Algorithms for estimating relative importance in networks (SW, PS), pp. 266–275.
MLDM-2003-RodriguesDFVC #analysis #clustering #comparative #profiling: A Comparative Analysis of Clustering Algorithms Applied to Load Profiling (FR, FJFD, VF, ZAV, MC), pp. 73–85.
SEKE-2003-LiWQ #performance #recognition: A Fast Binary Tree Based Face Recognition Algorithm (HL, SW, FQ), pp. 594–598.
SEKE-2003-Sheng: The Algorithm Tutor (EYS), pp. 616–620.
SIGIR-2003-AslamPS #evaluation #performance #retrieval: A unified model for metasearch and the efficient evaluation of retrieval systems via the hedge algorithm (JAA, VP, RS), pp. 393–394.
SIGIR-2003-TellexKLFM #evaluation #retrieval: Quantitative evaluation of passage retrieval algorithms for question answering (ST, BK, JJL, AF, GM), pp. 41–47.
LOPSTR-2003-BerghammerM #approximate #development #using #verification: Formal Development and Verification of Approximation Algorithms Using Auxiliary Variables (RB, MMO), pp. 59–74.
LOPSTR-2003-MurakamiHKT #analysis #performance #staging: An Efficient Staging Algorithm for Binding-Time Analysis (TM, ZH, KK, MT), pp. 106–107.
PADL-2003-HuetC #performance: Zen and the Art of Symbolic Computing: Light and Fast Applicative Algorithms for Computational Linguistics (GPH), pp. 17–18.
PADL-2003-ZhouT #garbage collection #prolog: Garbage Collection Algorithms for Java-Based Prolog Engines (QZ, PT), pp. 304–319.
PLDI-2003-HsuK #compilation #cpu #design #energy #evaluation #implementation #reduction: The design, implementation, and evaluation of a compiler algorithm for CPU energy reduction (CHH, UK), pp. 38–48.
POPL-2003-ZibinG #incremental: Incremental algorithms for dispatching in dynamically typed languages (YZ, JYG), pp. 126–138.
POPL-2003-ZibinGC #morphism #performance: Efficient algorithms for isomorphisms of simple types (YZ, JYG, JC), pp. 160–171.
ICSE-2003-ZhangGZ #precise #slicing: Precise Dynamic Slicing Algorithms (XZ, RG, YZ), pp. 319–329.
SAC-2003-AuyeungGD #multi #scheduling #search-based: Multi-Heuristic List Scheduling Genetic Algorithms for Task Scheduling (AA, IG, HKD), pp. 721–724.
SAC-2003-DuanK: A Treecode Algorithm for Computing Ewald Summation of Dipolar Systems (ZHD, RK), pp. 172–177.
SAC-2003-FernandezCGPC #multi: A New Cache Management Algorithm for Multimedia Storage Systems (JF, JC, FG, JMP, AC), pp. 956–960.
SAC-2003-GondraS #parallel #search-based: A Coarse-Grain Parallel Genetic Algorithm for Finding Ramsey Numbers (IG, MHS), pp. 2–8.
SAC-2003-HareJ #problem #search-based: A Spanning Tree-Based Genetic Algorithm for Some Instances of the Rectilinear Steiner Problem with Obstacles (RMH, BAJ), pp. 725–729.
SAC-2003-Landrin-SchweitzerCPL #interactive: Introducing Lateral Thinking in Search Engines with Interactive Evolutionary Algorithms (YLS, PC, TP, EL), pp. 214–219.
SAC-2003-NgGLC #clustering #database #search-based: Applying Genetic Algorithms in Database Partitioning (VTYN, NG, DML, CKC), pp. 544–549.
SAC-2003-RaidlJ #bound #heuristic #problem: Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem (GRR, BAJ), pp. 747–752.
SAC-2003-ScerriMST #case study #constraints #distributed #hardware #multi: Are Multiagent Algorithms Relevant for Real Hardware? A Case Study of Distributed Constraint Algorithms (PS, PJM, WMS, MT), pp. 38–44.
SAC-2003-Shen: An Alternative Routing Algorithm for the Pyramid Structures (ZS), pp. 1009–1013.
SAC-2003-SogrineP #database #distributed: Evaluating Database Selection Algorithms for Distributed Search (MS, AP), pp. 817–822.
SAC-2003-ZhangP #effectiveness #performance: A Fast and Effective Steganalytic Technique Against JSteg-like Algorithms (TZ, XP), pp. 307–311.
CC-2003-Leupers #evaluation #optimisation: Offset Assignment Showdown: Evaluation of DSP Address Code Optimization Algorithms (RL), pp. 290–302.
DAC-2003-LauP #design #using: Fractional-N frequency synthesizer design at the transfer function level using a direct closed loop realization algorithm (CYL, MHP), pp. 526–531.
DAC-2003-MillerMD #logic #synthesis: A transformation based algorithm for reversible logic synthesis (DMM, DM, GWD), pp. 318–323.
DAC-2003-MishchenkoWK #composition: A new enhanced constructive decomposition and mapping algorithm (AM, XW, TK), pp. 143–148.
DAC-2003-ShiL: An O(nlogn) time algorithm for optimal buffer insertion (WS, ZL), pp. 580–585.
DAC-2003-Travaglione #design #implementation #quantum: Designing and implementing small quantum circuits and algorithms (BT), pp. 894–899.
DAC-2003-VasilyevRW #generative #modelling: A TBR-based trajectory piecewise-linear algorithm for generating accurate low-order models for nonlinear analog circuits and MEMS (DV, MR, JW), pp. 490–495.
DAC-2003-ZhuSW #3d #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-MaciiMCZ #embedded #energy: A New Algorithm for Energy-Driven Data Compression in VLIW Embedded Processors (AM, EM, FC, RZ), pp. 10024–10029.
DATE-2003-OhtakeOF #fault #generative #testing #using: A Method of Test Generation fo Path Delay Faults Using Stuck-at Fault Test Generation Algorithms (SO, KO, HF), pp. 10310–10315.
DATE-2003-PanatoBR: A Low Device Occupation IP to Implement Rijndael Algorithm (AP, MB, RAdLR), pp. 20020–20025.
DATE-2003-RenczSP #layout #performance #simulation: A Fast Algorithm for the Layout Based Electro-Thermal Simulation (MR, VS, AP), pp. 11032–11037.
DATE-2003-SyalH #fault #identification #low cost #novel: A Novel, Low-Cost Algorithm for Sequentially Untestable Fault Identification (MS, MSH), pp. 10316–10321.
HPCA-2003-JeongD: Cost-Sensitive Cache Replacement Algorithms (JJ, MD), pp. 327–337.
HPDC-2003-TakefusaTMM #analysis #architecture #energy #grid #performance #physics #replication #scheduling: Performance Analysis of Scheduling and Replication Algorithms on Grid Datafarm Architecture for High-Energy Physics Applications (AT, OT, SM, YM), pp. 34–47.
LCTES-2003-GuoSBH #configuration management #graph: A graph covering algorithm for a coarse grain reconfigurable system (YG, GJMS, HB, PMH), pp. 199–208.
LCTES-2003-LeeCD #architecture #configuration management: An algorithm for mapping loops onto coarse-grained reconfigurable architectures (JeL, KC, NDD), pp. 183–188.
PDP-2003-Al-DubaiOM #3d #network #scalability: A Scalable Plane-Based Broadcast Algorithm for 3D-Mesh Networks (AYAD, MOK, LMM), pp. 149–156.
PDP-2003-AlmeidaGMRT #clustering #on the #predict: On the Prediction of Master-Slave algorithms over Heterogeneous Clusters (FA, DG, LMM, CR, JT), p. 433–?.
PDP-2003-BahiCV: Broken Edges and Dimension Exchange Algorithms on Hypercube Topology (JMB, RC, FV), p. 140–?.
PDP-2003-BanosGMO #clustering #parallel: A Parallel Evolutionary Algorithm for Circuit Partitioning (RB, CG, MDGM, JO), pp. 365–371.
PDP-2003-BorzemskiZ #adaptation #clustering #fuzzy #web: A Fuzzy Adaptive Request Distribution Algorithm for Cluster-based Web Systems (LB, KZ), pp. 119–126.
PDP-2003-Corana #interactive: Computing long-and short-range interactions with ring-based algorithms on homogeneous and heterogeneous systems (AC), pp. 357–364.
PDP-2003-CordobaFGMV #communication #concurrent #detection #distributed: A Low Communication Cost Algorithm for Distributed Deadlock Detection and Resolution (AC, FF, JRG, JRGdM, JEV), pp. 235–242.
PDP-2003-GarciaMS #multi #problem #sequence: A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem (TG, JFM, DS), pp. 349–356.
PDP-2003-HidalgoPLBTG #hybrid #parallel #search-based: Hybrid Parallelization of a Compact Genetic Algorithm (JIH, MP, JL, RB, FT, OG), pp. 449–455.
PDP-2003-RenaudLBZW #comparison #distributed #framework #named #performance: Algon: A Framework for Supporting Comparison of Distributed Algorithm Performance (KR, JLCL, JB, PvZ, BW), pp. 425–432.
PDP-2003-VilladangosFCMG #evaluation #performance: Knot Resolution Algorithm and its Performance Evaluation (JEV, FF, AC, JRGdM, JRG), pp. 227–234.
STOC-2003-Ajtai #approximate #behaviour #worst-case: The worst-case behavior of schnorr’s algorithm approximating the shortest nonzero vector in a lattice (MA), pp. 396–406.
STOC-2003-BatuEKMRRS #approximate #distance #edit distance #sublinear: A sublinear algorithm for weakly approximating edit distance (TB, FE, JK, AM, SR, RR, RS), pp. 316–324.
STOC-2003-CharikarOP #clustering #problem #streaming: Better streaming algorithms for clustering problems (MC, LO, RP), pp. 30–39.
STOC-2003-ChazelleLM #geometry #sublinear: Sublinear geometric algorithms (BC, DL, AM), pp. 531–540.
STOC-2003-ChenRS #approximate #confluence: Meet and merge: approximation algorithms for confluent flows (JC, RR, RS), pp. 373–382.
STOC-2003-ChildsCDFGS #exponential #quantum: Exponential algorithmic speedup by a quantum walk (AMC, RC, ED, EF, SG, DAS), pp. 59–68.
STOC-2003-ColeH #performance: A fast algorithm for computing steiner edge connectivity (RC, RH), pp. 167–176.
STOC-2003-GuptaKR #approximate #design #network: Simpler and better approximation algorithms for network design (AG, AK, TR), pp. 365–372.
STOC-2003-Plaxton #approximate #problem: Approximation algorithms for hierarchical location problems (CGP), pp. 40–49.
CADE-2003-ManoliosV: Algorithms for Ordinal Arithmetic (PM, DV), pp. 243–257.
CAV-2003-AbdullaJNd #model checking: Algorithmic Improvements in Regular Model Checking (PAA, BJ, MN, Jd), pp. 236–248.
CAV-2003-GrumbergHS #analysis #distributed #reachability: A Work-Efficient Distributed Algorithm for Reachability Analysis (OG, TH, AS), pp. 54–66.
CSL-2003-BornerBJK #complexity #constraints #quantifier: Quantified Constraints: Algorithms and Complexity (FB, AAB, PJ, AAK), pp. 58–70.
FATES-2003-GuoHHD #search-based #sequence #using: Computing Unique Input/Output Sequences Using Genetic Algorithms (QG, RMH, MH, KD), pp. 164–177.
LICS-2003-Oliva #effectiveness #polynomial #proving: Polynomial-time Algorithms from Ineffective Proofs (PO), pp. 128–137.
SAT-2003-BaumerS #independence #probability #satisfiability: Improving a Probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs (SB, RS), pp. 150–161.
SAT-2003-BroeringL #satisfiability: Width-Based Algorithms for SAT and CIRCUIT-SAT: (EB, SVL), pp. 162–171.
SAT-2003-Chen #satisfiability: An Algorithm for SAT Above the Threshold (HC), pp. 14–24.
SAT-2003-PorschenRS #linear #problem #satisfiability: Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems (SP, BR, ES), pp. 172–187.
SAT-2003-ZhangM #case study #implementation #performance #satisfiability: Cache Performance of SAT Solvers: a Case Study for Efficient Implementation of Algorithms (LZ, SM), pp. 287–298.
VMCAI-2003-WinEGKL #distributed #execution #using #verification: Using Simulated Execution in Verifying Distributed Algorithms (TNW, MDE, SJG, DKK, NAL), pp. 283–297.
PODS-2002-GuhaKS #performance: Fast Algorithms For Hierarchical Range Histogram Construction (SG, NK, DS), pp. 180–187.
PODS-2002-ShashaWG #graph: Algorithmics and Applications of Tree and Graph Searching (DS, JTLW, RG), pp. 39–52.
SIGMOD-2002-LuoEHN #scalability: A scalable hash ripple join algorithm (GL, CJE, PJH, JFN), pp. 252–262.
SIGMOD-2002-ProcopiucJAM #clustering #monte carlo #performance: A Monte Carlo algorithm for fast projective clustering (CMP, MJ, PKA, TMM), pp. 418–427.
SIGMOD-2002-Ramanan #performance #query: Efficient algorithms for minimizing tree pattern queries (PR), pp. 299–309.
VLDB-2002-DittrichSTW: Progressive Merge Join: A Generic and Non-blocking Sort-based Join Algorithm (JPD, BS, DST, PW), pp. 299–310.
VLDB-2002-GottlobKP #performance #query #xpath: Efficient Algorithms for Processing XPath Queries (GG, CK, RP), pp. 95–106.
VLDB-2002-KossmannRR #online #query: Shooting Stars in the Sky: An Online Algorithm for Skyline Queries (DK, FR, SR), pp. 275–286.
VLDB-2002-LeeWMS #multi: A One-Pass Aggregation Algorithm with the Optimal Buffer Size in Multidimensional OLAP (YKL, KYW, YSM, IYS), pp. 790–801.
ITiCSE-2002-RosslingN #requirements #visualisation: A testbed for pedagogical requirements in algorithm visualizations (GR, TLN), pp. 96–100.
ITiCSE-2002-Schreiner #distributed #education #java #tool support: A java toolkit for teaching distributed algorithms (WS), pp. 111–115.
CSMR-2002-HajnalF #precise: A Precise Demand-Driven Def-Use Chaining Algorithm (ÁH, IF), p. 77–?.
CSMR-2002-RaysideK #graph #problem #program analysis #reachability: A Generic Worklist Algorithm for Graph Reachability Problems in Program Analysis (DR, KK), pp. 67–76.
ICSM-2002-HarmanHHMZDOW: A Post-Placement Side-Effect Removal Algorithm (MH, LH, RMH, MM, XZ, JJD, MCO, JW), pp. 2–11.
ICSM-2002-SilvaRC #concept: An Algorithm to Compare OO-Conceptual Schemas (JS, IR, JÁC), pp. 351–358.
WCRE-2002-HarmanGHB #concept #slicing: Code Extraction Algorithms which Unify Slicing and Concept Assignment (MH, NG, RMH, DB), pp. 11–21.
WCRE-2002-JrW #image #parallel: Exposing Data-Level Parallelism in Sequential Image Processing Algorithms (LBBJ, LMW), pp. 245–254.
CIAA-J-2000-BergeronH02 #approximate #string: Vector Algorithms for Approximate String Matching (AB, SH), pp. 53–66.
CIAA-J-2000-CampeanuPY02 #automaton #finite #performance: An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages (CC, AP, SY), pp. 83–97.
CIAA-J-2000-Mohri02 #transducer: Generic e-Removal and Input e-Normalization Algorithms for Weighted Transducers (MM), pp. 129–143.
CIAA-2002-Daciuk #automaton #comparison #finite #set #string: Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings (JD), pp. 255–261.
CIAA-2002-Trahtman #polynomial #testing: A Polynomial Time Algorithm for Left [Right] Local Testability (ANT), pp. 203–212.
DLT-2002-AnanichevCV #automaton #word: An Inverse Automata Algorithm for Recognizing 2-Collapsing Words (DSA, AC, MVV), pp. 270–282.
DLT-2002-Archangelsky #equivalence #finite #multi #performance: Efficient Algorithm for Checking Multiplicity Equivalence for the Finite Z-Σ*-Automata (KA), pp. 283–289.
ICALP-2002-BenderCR #exponential #performance: Exponential Structures for Efficient Cache-Oblivious Algorithms (MAB, RC, RR), pp. 195–207.
ICALP-2002-CharikarIP #orthogonal #problem #query #set: New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems (MC, PI, RP), pp. 451–462.
ICALP-2002-Pettie #graph #performance: A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs (SP), pp. 85–97.
ICALP-2002-Uehara #graph #linear: Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs (RU), pp. 993–1004.
FME-2002-BarnerBGSW #approach #design: An Algorithmic Approach to Design Exploration (SB, SBD, AG, BS, YW), pp. 146–162.
IFM-2002-ZulkernineS #automation #detection: Assume-Guarantee Algorithms for Automatic Detection of Software Failures (MZ, RES), pp. 89–108.
ICGT-2002-GodardMMS #detection #distributed #graph #termination: Termination Detection of Distributed Algorithms by Graph Relabelling Systems (EG, YM, MM, AS), pp. 106–119.
VISSOFT-2002-Francik #data flow #specification #visualisation: Specifying Algorithm Visualizations in Terms of Data Flow (JF), p. 110–?.
CAiSE-2002-SunL #parallel #query: Parallel Query Processing Algorithms for Semi-structured Data (WS, KL), pp. 770–773.
ICEIS-2002-FloresG #case study #estimation #fuzzy #learning #problem: Applicability of Estimation of Distribution Algorithms to the Fuzzy Rule Learning Problem: A Preliminary Study (MJF, JAG), pp. 350–357.
ICEIS-2002-GharibMT #clustering #using: High Dimensional Data Clustering Using SOFM And K-Means Algorithms (TFG, MGM, MFT), pp. 488–493.
CIKM-2002-BarbaraLC #category theory #clustering #named: COOLCAT: an entropy-based algorithm for categorical clustering (DB, YL, JC), pp. 582–589.
CIKM-2002-ChangC #integration #web: A new cache replacement algorithm for the integration of web caching and prefectching (CYC, MSC), pp. 632–634.
CIKM-2002-HamerlyE #clustering: Alternatives to the k-means algorithm that find better clusterings (GH, CE), pp. 600–607.
CIKM-2002-JensenBPGF #clustering #documentation #performance: Parallelizing the buckshot algorithm for efficient document clustering (ECJ, SMB, AJP, NG, OF), pp. 684–686.
CIKM-2002-NanopoulosMT #effectiveness #performance: An efficient and effective algorithm for density biased sampling (AN, YM, YT), pp. 398–404.
CIKM-2002-ZhaoK #clustering #dataset #documentation #evaluation: Evaluation of hierarchical clustering algorithms for document datasets (YZ, GK), pp. 515–524.
ECIR-2002-KimL #rank: An Improved Computation of the PageRank Algorithm (SJK, SHL), pp. 73–85.
ICML-2002-Bonet #markov #process: An epsilon-Optimal Grid-Based Algorithm for Partially Observable Markov Decision Processes (BB), pp. 51–58.
ICML-2002-KamvarKM #approach #clustering #modelling #using: Interpreting and Extending Classical Agglomerative Clustering Algorithms using a Model-Based approach (SDK, DK, CDM), pp. 283–290.
ICML-2002-KeerthiDSP #kernel #performance: A Fast Dual Algorithm for Kernel Logistic Regression (SSK, KD, SKS, ANP), pp. 299–306.
ICML-2002-LiZHSK: The Perceptron Algorithm with Uneven Margins (YL, HZ, RH, JST, JSK), pp. 379–386.
ICML-2002-PickettB #learning #named: PolicyBlocks: An Algorithm for Creating Useful Macro-Actions in Reinforcement Learning (MP, AGB), pp. 506–513.
ICPR-v1-2002-DOrazioACN #detection #image #sequence: A Ball Detection Algorithm for Real Soccer Image Sequences (TD, NA, GC, MN), pp. 210–213.
ICPR-v1-2002-GongY #estimation #multi #search-based: Multi-Resolution Genetic Algorithm and Its Application in Motion Estimation (MG, YHY), pp. 644–647.
ICPR-v1-2002-JiangM #detection #evaluation: Supervised Evaluation Methodology for Curvilinear Structure Detection Algorithms (XJ, DM), pp. 103–106.
ICPR-v1-2002-OjalaMPVKH #analysis #empirical #evaluation #framework: Outex- New Framework for Empirical Evaluation of Texture Analysis Algorithms (TO, TM, MP, JV, JK, SH), pp. 701–706.
ICPR-v1-2002-OliveiraSBS #feature model #multi #recognition #search-based #using: Feature Selection Using Multi-Objective Genetic Algorithms for Handwritten Digit Recognition (LESdO, RS, FB, CYS), pp. 568–571.
ICPR-v1-2002-PhillipsSRGB #challenge #identification #problem #set: The Gait Identification Challenge Problem: Data Sets and Baseline Algorithm (PJP, SS, IRV, PG, KWB), pp. 385–388.
ICPR-v1-2002-ZhangW #verification: Core-Based Structure Matching Algorithm of Fingerprint Verification (WZ, YW), pp. 70–74.
ICPR-v1-2002-ZhouC #probability #recognition #robust: A Robust Algorithm for Probabilistic Human Recognition From (SKZ, RC), pp. 226–229.
ICPR-v2-2002-GuangmingJMHX #data type #fault #metric: A New Mesh Simplification Algorithm Combining Half-Edge Data Structure with Modified Quadric Error Metric (GL, JT, MZ, HH, XZ), pp. 659–658.
ICPR-v2-2002-LiWZ #network: Step Acceleration Based Training Algorithm for Feedforward Neural Networks (YL, KW, DZ), pp. 84–87.
ICPR-v2-2002-LiZ #visual notation: Visual Contour Tracking Based on Sequential Importance Sampling/Resampling Algorithm (PL, TZ), pp. 564–568.
ICPR-v2-2002-OhLM #feature model #search-based: Local Search-Embedded Genetic Algorithms for Feature Selection (ISO, JSL, BRM), pp. 148–151.
ICPR-v2-2002-QunTHC #automation #clustering #identification #using: Automatic Fingerprint Identification Using Cluster Algorithm (QR, JT, YH, JC), pp. 398–401.
ICPR-v2-2002-RothW #matrix: Some Improvements on Two Autocalibration Algorithms Based on the Fundamental Matrix (GR, AW), p. 312–?.
ICPR-v2-2002-RukhinGPLHN #dependence #recognition: Dependence Characteristics of Face Recognition Algorithms (ALR, PG, PJP, SL, AH, EMN), pp. 36–39.
ICPR-v2-2002-SeokL #analysis #approach #difference #learning #probability: The Analysis of a Stochastic Differential Approach for Langevine Comepetitive Learning Algorithm (JS, JWL), pp. 80–83.
ICPR-v2-2002-SijbersCD #3d #fourier: Algorithm for the Computation of 3D Fourier Descriptors (JS, TC, DVD), pp. 790–793.
ICPR-v2-2002-SirlantzisFG #classification #multi: An Evolutionary Algorithm for Classifier and Combination Rule Selection in Multiple Classifier Systems (KS, MCF, RMG), pp. 771–774.
ICPR-v2-2002-VishwanathanM #geometry #performance: Geometric SVM: A Fast and Intuitive SVM Algorithm (SVNV, MNM), pp. 56–59.
ICPR-v3-2002-ChetverikovSSK: The Trimmed Iterative Closest Point Algorithm (DC, DS, DS, PK), pp. 545–548.
ICPR-v3-2002-ChoC: A Script Matching Algorithm for Oriental Characters on PDAs (MGC, HGC), pp. 957–960.
ICPR-v3-2002-HatanoASMOOK #difference #using #verification: A Fingerprint Verification Algorithm Using the Differential Matching Rate (TH, TA, SS, HM, SO, YO, HK), pp. 799–802.
ICPR-v3-2002-KimKP #image: New Enhancement Algorithm for Fingerprint Images (BGK, HJK, DJP), pp. 879–882.
ICPR-v3-2002-LeeCK #robust #using: A Robust Fingerprint Matching Algorithm Using Local Alignment (DL, KC, JK), pp. 803–806.
ICPR-v3-2002-LiLSW #geometry #image: New Algorithm for Geometric Transformations of Digital Images and Patterns (ZCL, JYL, CYS, HW), pp. 315–318.
ICPR-v3-2002-MarianoMPKMLDD #detection #evaluation #performance: Performance Evaluation of Object Detection Algorithms (VYM, JM, JHP, RK, DM, HL, DSD, TD), pp. 965–969.
ICPR-v3-2002-Saint-JeanF #clustering #robust: A Robust Semi-Supervised EM-Based Clustering Algorithm with a Reject Option (CSJ, CF), pp. 399–402.
ICPR-v3-2002-ZhouZ #recognition: Face Recognition by Combining Several Algorithms (JZ, DZ), p. 497–?.
ICPR-v4-2002-CorreiaC #implementation #realtime: Real-Time Implementation of an Optical Flow Algorithm (MVC, ACC), pp. 247–250.
ICPR-v4-2002-HlaouiW #graph: A New Algorithm for Inexact Graph Matching (AH, SW), pp. 180–183.
ICPR-v4-2002-HuY #estimation #robust #search-based #using: Robust Estimation of Trifocal Tensor Using Messy Genetic Algorithm (MH, BY), pp. 347–350.
ICPR-v4-2002-KolesnikovF #approximate #performance: A Fast Near-Optimal Algorithm for Approximation of Polygonal Curves (AK, PF), pp. 335–338.
ICPR-v4-2002-NoguchiO: A Simple but High-Quality Stereo Algorithm (TN, YO), pp. 351–354.
ICPR-v4-2002-PalaciosVK #distance #evaluation #using: An Evaluation of the WPE Algorithm Using Tangent Distance (RPP, EV, DK), pp. 48–51.
ICPR-v4-2002-PopatGP #adaptation #documentation #image #stack: Adaptive Stack Algorithm in Document Image Decoding (KP, DHG, TLP), pp. 231–234.
ICPR-v4-2002-Sarkar #classification: An Iterative Algorithm for Optimal Style Conscious Field Classification (PS), p. 243–?.
ICPR-v4-2002-TabboneW02a #image #multi: An Original Multi-Scale Algorithm to Binarize Images (ST, LW), pp. 322–325.
ICPR-v4-2002-ToyamaFSM #assembly #search-based #using: Assembly of Puzzles Using a Genetic Algorithm (FT, YF, KS, JM), pp. 389–392.
KDD-2002-BennettME #kernel #modelling #named: MARK: a boosting algorithm for heterogeneous kernel models (KPB, MM, MJE), pp. 24–31.
KDD-2002-BucilaGKW #constraints #named: DualMiner: a dual-pruning algorithm for itemsets with constraints (CB, JG, DK, WMW), pp. 42–51.
KDD-2002-ChenHS: A new two-phase sampling based algorithm for discovering association rules (BC, PJH, PS), pp. 462–468.
KDD-2002-DobraG #linear #named #scalability: SECRET: a scalable linear regression tree algorithm (AD, JG), pp. 481–487.
KDD-2002-KruengkraiJ #classification #learning #parallel: A parallel learning algorithm for text classification (CK, CJ), pp. 201–206.
KDD-2002-LiB #classification: Instability of decision tree classification algorithms (RHL, GGB), pp. 570–575.
KDD-2002-LinC #clustering #performance #robust #self: A robust and efficient clustering algorithm based on cohesion self-merging (CRL, MSC), pp. 582–587.
KDD-2002-YangGY #clustering #effectiveness #named #performance #transaction: CLOPE: a fast and effective clustering algorithm for transactional data (YY, XG, JY), pp. 682–687.
KR-2002-TessarisHG #composition: Evaluating a Modular Abox Algorithm (ST, IH, GG), pp. 227–238.
SEKE-2002-BriandFL #integration #metric #order #search-based #using: Using genetic algorithms and coupling measures to devise optimal integration test orders (LCB, JF, YL), pp. 43–50.
SEKE-2002-Drori #documentation #idea #ranking #simulation: Algorithm for documents ranking: idea and simulation results (OD), pp. 99–102.
SIGIR-2002-CosterS #collaboration: Inverted file search algorithms for collaborative filtering (RC, MS), pp. 246–252.
SIGIR-2002-CrammerS #online #product line #ranking: A new family of online algorithms for category ranking (KC, YS), pp. 151–158.
SIGIR-2002-KouG #classification: Study of category score algorithms for k-NN classifier (HK, GG), pp. 393–394.
OOPSLA-2002-ZibinG #multi #performance: Fast algorithm for creating space efficient dispatching tables with application to multi-dispatching (YZ, JYG), pp. 142–160.
ASIA-PEPM-2002-FutamuraKG #automation #generative #performance #string: Automatic generation of efficient string matching algorithms by generalized partial computation (YF, ZK, RG), pp. 1–8.
PLDI-2002-Gargi: A Sparse Algorithm for Predicated Global Value Numbering (KG), pp. 45–56.
SIGAda-2002-NevilleS #search-based: Developing a generic genetic algorithm (MN, AS), pp. 45–52.
ASE-2002-AzarPBKS #adaptation #modelling #predict #quality #search-based: Combining and Adapting Software Quality Predictive Models by Genetic Algorithms (DA, DP, SB, BK, HAS), pp. 285–288.
ICSE-2002-UchitelSZ #modelling #state machine #tool support: Scenarios and state machines: models, algorithms, and tools (SU, TS, AZ), pp. 659–660.
SAC-2002-Al-SadiDO #fault tolerance #probability: Probability vectors: a new fault-tolerant routing algorithm for k-ary n-cubes (JAS, KD, MOK), pp. 830–834.
SAC-2002-BillhardtBM #retrieval #search-based #using: Using genetic algorithms to find suboptimal retrieval expert combinations (HB, DB, VM), pp. 657–662.
SAC-2002-BrommeKEK #authentication #concept #framework #operating system #testing: A conceptual framework for testing biometric algorithms within operating systems’ authentication (AB, MK, OE, OK), pp. 273–280.
SAC-2002-CornoRS: An evolutionary algorithm for reducing integrated-circuit test application time (FC, MSR, GS), pp. 608–612.
SAC-2002-FuTS #similarity: Node splitting algorithms in tree-structured high-dimensional indexes for similarity search (YF, JCT, SRS), pp. 766–770.
SAC-2002-Huynh: Slide Edge Algorithm (DH), pp. 178–183.
SAC-2002-JulstromR #robust #set: Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges (BAJ, GRR), pp. 547–552.
SAC-2002-MaciasVR #mining #using: Mining interesting regions using an evolutionary algorithm (JLÁM, JMV, JCRS), pp. 498–502.
SAC-2002-MataMR: An evolutionary algorithm to discover numeric association rules (JMV, JLÁM, JCRS), pp. 590–594.
SAC-2002-NyakoeOT #multi #search-based #using: Acquisition of modulation pulses for a multi-robot system using genetic algorithm (GNN, MO, ST), pp. 568–573.
SAC-2002-PerezCRT #detection #interactive #multi: An enablement detection algorithm for open multiparty interactions (JAP, RC, DR, MT), pp. 378–384.
SAC-2002-Pillay #induction #programming #search-based #using: Using genetic programming for the induction of novice procedural programming solution algorithms (NP), pp. 578–583.
SAC-2002-VedovaW: Optimal algorithms for local vertex quartet cleaning (GDV, TW), pp. 173–177.
SAC-2002-VeldhuizenZL #multi: Issues in parallelizing multiobjective evolutionary algorithms for real world applications (DAvV, JBZ, GBL), pp. 595–602.
SAC-2002-ZhangS #implementation #parametricity #performance: An efficient implementation of parametric line and polygon clipping algorithm (MZ, CLS), pp. 796–800.
ASPLOS-2002-KimY #compilation #design #evaluation: Design and evaluation of compiler algorithms for pre-execution (DK, DY), pp. 159–170.
ASPLOS-2002-MukherjeeSBELW #case study #comparative #pipes and filters: A comparative study of arbitration algorithms for the Alpha 21364 pipelined router (SSM, FS, PJB, JSE, SL, DW), pp. 223–234.
DAC-2002-Casinovi #analysis: An algorithm for frequency-domain noise analysis in nonlinear systems (GC), pp. 514–517.
DAC-2002-GanaiAGZM #satisfiability: Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver (MKG, PA, AG, LZ, SM), pp. 747–750.
DAC-2002-HartongHB #model checking #verification: Model checking algorithms for analog verification (WH, LH, EB), pp. 542–547.
DAC-2002-SeoKP #memory management #synthesis: An integrated algorithm for memory allocation and assignment in high-level synthesis (JS, TK, PRP), pp. 608–611.
DAC-2002-XiangWT: An algorithm for integrated pin assignment and buffer planning (HX, DFW, XT), pp. 584–589.
DAC-2002-ZhongD #constraints #multi #optimisation: Algorithms for simultaneous satisfaction of multiple constraints and objective optimization in a placement flow with application to congestion control (KZ, SD), pp. 854–859.
DATE-2002-BensoCNP #automation #generative #testing: An Optimal Algorithm for the Automatic Generation of March Tests (AB, SDC, GDN, PP), pp. 938–943.
DATE-2002-CoelhoSP #approximate #using: Passive Constrained Rational Approximation Algorithm Using Nevanlinna-Pick Interpolation (CPC, LMS, JRP), pp. 923–930.
DATE-2002-GoldbergPB #problem #satisfiability #symmetry #using: Using Problem Symmetry in Search Based Satisfiability Algorithms (EIG, MRP, RKB), pp. 134–141.
DATE-2002-HuangTXWL #polynomial #problem: A Polynomial Time Optimal Diode Insertion/Routing Algorithm for Fixing Antenna Problem (LDH, XT, HX, DFW, IML), pp. 470–475.
DATE-2002-KimKM #analysis #realtime #scalability #using: A Dynamic Voltage Scaling Algorithm for Dynamic-Priority Hard Real-Time Systems Using Slack Time Analysis (WK, JK, SLM), pp. 788–794.
DATE-2002-LeeCDGM #detection #fault #multi #testing: A New ATPG Algorithm to Limit Test Set Size and Achieve Multiple Detections of All Faults (SL, BC, JD, MRG, MRM), pp. 94–99.
DATE-2002-MenardS #automation #evaluation #fixpoint: Automatic Evaluation of the Accuracy of Fixed-Point Algorithms (DM, OS), pp. 529–535.
DATE-2002-PandeyP #architecture #design #generative #incremental #testing: An Incremental Algorithm for Test Generation in Illinois Scan Architecture Based Designs (ARP, JHP), pp. 368–375.
DATE-2002-SoininenKQ #architecture #estimation: Mappability Estimation of Architecture and Algorithm (JPS, JK, YQ), p. 1132.
DATE-2002-WuK: Exploiting Idle Cycles for Algorithm Level Re-Computing (KW, RK), pp. 842–846.
ISMM-2002-Ben-YitzhakGKKL #incremental #parallel: An algorithm for parallel incremental compaction (OBY, IG, EKK, KK, VL), pp. 207–212.
ISMM-2002-VardhanA #garbage collection #using: Using passive object garbage collection algorithms for garbage collection of active objects (AV, GA), pp. 213–220.
LCTES-SCOPES-2002-ChoPW #architecture #graph #memory management #performance: Efficient register and memory assignment for non-orthogonal architectures via graph coloring and MST algorithms (JC, YP, DBW), pp. 130–138.
PDP-2002-BaydalLD #adaptation: Increasing the Adaptivity of Routing Algorithms for k-ary n-cubes (EB, PL, JD), pp. 455–462.
PDP-2002-CorsonelloSST #configuration management #hardware #implementation #performance: Efficient Implementation of Cellular Algorithms on Reconfigurable Hardware (PC, GS, GS, DT), pp. 211–218.
PDP-2002-Jimenez-GonzalezNL #parallel #sorting: The Effect of Local Sort on Parallel Sorting Algorithms (DJG, JJN, JLLP), pp. 360–367.
PDP-2002-JimenezFC #consistency #memory management: A Parametrized Algorithm that Implements Sequential, Causal, and Cache Memory Consistency (EJ, AF, VC), pp. 437–444.
PDP-2002-Rodriguez #analysis #design #parallel: The Design and Analysis of Parallel Algorithms (CR), p. 1.
PDP-2002-SanchoRD #network #performance: Performance Sensitivity of Routing Algorithms to Failures in Networks of Workstations with Regular and Irregular Topologies (JCS, AR, JD), pp. 81–90.
PDP-2002-ToroOFD #named #optimisation #parallel #search-based: PSFGA: A Parallel Genetic Algorithm for Multiobjective Optimization (FdT, JO, JF, AFD).
STOC-2002-AnshelevichKK: Stability of load balancing algorithms in dynamic adversarial systems (EA, DK, JMK), pp. 399–406.
STOC-2002-ArgeBDHM #graph #queue: Cache-oblivious priority queue and graph algorithm applications (LA, MAB, EDD, BHM, JIM), pp. 268–276.
STOC-2002-BaswanaHS #maintenance #transitive: Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths (SB, RH, SS), pp. 117–123.
STOC-2002-Charikar #estimation #similarity: Similarity estimation techniques from rounding algorithms (MC), pp. 380–388.
STOC-2002-CheriyanVV #approximate #low cost: Approximation algorithms for minimum-cost k-vertex connected subgraphs (JC, SV, AV), pp. 306–312.
STOC-2002-CryanD #approximate #constant #polynomial: A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant (MC, MED), pp. 240–249.
STOC-2002-ElkinK #approximate #combinator #problem: Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem (ME, GK), pp. 438–447.
STOC-2002-GilbertGIKMS #approximate #maintenance #performance: Fast, small-space algorithms for approximate histogram maintenance (ACG, SG, PI, YK, SM, MS), pp. 389–398.
STOC-2002-Hallgren #equation #polynomial #problem #quantum: Polynomial-time quantum algorithms for Pell’s equation and the principal ideal problem (SH), pp. 653–658.
STOC-2002-JainV: Equitable cost allocations via primal-dual-type algorithms (KJ, VVV), pp. 313–321.
STOC-2002-Kontogiannis #bound #online #scheduling: Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines (SCK), pp. 124–133.
STOC-2002-Sivakumar #complexity: Algorithmic derandomization via complexity theory (DS), pp. 619–626.
TACAS-2002-GodefroidK #scalability #search-based #using: Exploring Very Large State Spaces Using Genetic Algorithms (PG, SK), pp. 266–280.
TACAS-2002-HeljankoKK #parallel #petri net: Parallelisation of the Petri Net Unfolding Algorithm (KH, VK, MK), pp. 371–385.
CADE-2002-GramlichP #aspect-oriented #equation #modelling: Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations (BG, RP), pp. 241–259.
CAV-2002-BozzanoD #protocol #verification: Algorithmic Verification of Invalidation-Based Protocols (MB, GD), pp. 295–308.
ICLP-2002-GanzingerM #logic: Logical Algorithms (HG, DAM), pp. 209–223.
ISSTA-2002-Naumovich #java #source code: A conservative algorithm for computing the flow of permissions in Java programs (GN), pp. 33–43.
SAT-2002-BrglezLS #benchmark #metric #satisfiability #testing: The role of a skeptic agent in testing and benchmarking of SAT algorithms (FB, XYL, MFS), p. 13.
SAT-2002-Hoos #modelling #satisfiability: SLS algorithms for SAT: irregular instances, search stagnation, and mixture models (HH), p. 41.
SAT-2002-KaporisKL #analysis #probability #satisfiability: The Probabilistic Analysis of a Greedy Satisfiability Algorithm (ACK, LMK, EGL), p. 5.
SAT-2002-LynceM1 #backtracking #satisfiability #strict: Complete unrestricted backtracking algorithms for satisfiability (IL, JMS), p. 29.
SAT-2002-MonassonC #analysis #exponential #random #satisfiability #scalability: Restart method and exponential acceleration of random 3-SAT instances resolutions: A large deviation analysis of the Davis-Putnam-Loveland-Logemann algorithm (RM, SC), p. 11.
SAT-2002-TakenakaH #problem #satisfiability: An analog algorithm for the satisfiability problem (YT, AH), p. 40.
VMCAI-2002-KrsticM #monad #verification: Verifying BDD Algorithms through Monadic Interpretation (SK, JM), pp. 182–195.
WICSA-2001-MitchellRM #architecture #clustering: An Architecture for Distributing the Computation of Software Clustering Algorithms (BSM, MT, SM), pp. 181–190.
ECDL-2001-ZaslavskyBM #comparison #detection #multi #using: Using Copy-Detection and Text Comparison Algorithms for Cross-Referencing Multiple Editions of Literary Works (ABZ, AB, KM), pp. 103–114.
ICDAR-2001-Breuel #programming #segmentation #string #using: Segmentation of Handprinted Letter Strings Using a Dynamic Programming Algorithm (TMB), pp. 821–826.
ICDAR-2001-ChaS #analysis #classification: Apriori Algorithm for Sub-category Classification Analysis of Handwriting (SHC, SNS), pp. 1022–1025.
ICDAR-2001-HasegawaAM #online #recognition: A Bayesian Bi-gram Scheme for HMM Online Handwriting Recognition Algorithm (TH, KA, TM), pp. 1012–1016.
ICDAR-2001-HusseinWK #feature model #overview #search-based: Genetic Algorithms for Feature Selection and Weighting, A Review and Study (FH, RKW, NNK), p. 1240–?.
ICDAR-2001-LiuLHY #analysis #component #layout: A New Component Based Algorithm for Newspaper Layout Analysis (FL, YL, DH, MY), pp. 1176–1180.
ICDAR-2001-StefanoCM #segmentation: An Investigation on MPEG Audio Segmentation by Evolutionary Algorithms (CDS, ADC, AM), pp. 952–956.
ICDAR-2001-SuralD #feature model #search-based: A Genetic Algorithm for Feature Selection in a Neuro-Fuzzy OCR System (SS, PKD), pp. 987–991.
ICDAR-2001-Yan #detection #fuzzy: Detection of Curved Text Path Based on the Fuzzy Curve-Tracing (FCT) Algorithm (HY), pp. 266–270.
JCDL-2001-RiggsW #automation #rating: An algorithm for automated rating of reviewers (TR, RW), pp. 381–387.
PODS-2001-AgrawalA #data mining #design #mining #on the #privacy #quantifier: On the Design and Quantification of Privacy Preserving Data Mining Algorithms (DA, CCA).
PODS-2001-FaginLN #middleware: Optimal Aggregation Algorithms for Middleware (RF, AL, MN).
VLDB-2001-GalhardasFSSS #declarative: Declarative Data Cleaning: Language, Model, and Algorithms (HG, DF, DS, ES, CAS), pp. 371–380.
CSEET-2001-Cowling01a #data type #education #experience #java #re-engineering: Teaching Data Structures and Algorithms in a Software Engineering Degree: Some Experience with Java (AJC), pp. 247–257.
ITiCSE-2001-CiesielskiM #animation #learning #student #using: Using animation of state space algorithms to overcome student learning difficulties (VC, PM), pp. 97–100.
ITiCSE-2001-Ginat #learning #problem: Metacognitive awareness utilized for learning control elements in algorithmic problem solving (DG), pp. 81–84.
ITiCSE-2001-KhuriH #education #graph #named: EVEGA: an educational visulalization environment for graph algorithms (SK, KH), pp. 101–104.
ITiCSE-2001-KorhonenMS #animation #concept #matrix #named #simulation: Matrix — concept animation and algorithm simulation system (AK, LM, RS), p. 180.
ITiCSE-2001-Velazquez-Iturbide #problem: A first problem for the algorithms course (JÁVI), p. 187.
CSMR-2001-MorettiCO #control flow #graph: New Algorithms for Control-Flow Graph Structuring (EM, GC, AO), pp. 184–187.
ICSM-2001-MitchellM #clustering #metric #similarity #using: Comparing the Decompositions Produced by Software Clustering Algorithms Using Similarity Measurements (BSM, SM), pp. 744–753.
CIAA-2001-BergeronH: Cascade Decompositions are Bit-Vector Algorithms (AB, SH), pp. 13–26.
ICALP-2001-CaiJ: Subexponential Parameterized Algorithms Collapse the W-Hierarchy (LC, DWJ), pp. 273–284.
ICALP-2001-GandhiKS #approximate #problem: Approximation Algorithms for Partial Covering Problems (RG, SK, AS), pp. 225–236.
ICALP-2001-Papadimitriou #game studies #internet: Algorithms, Games, and the Internet (CHP), pp. 1–3.
ICALP-2001-SadakaneTT #combinator #sequence: Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence (KS, NTC, TT), pp. 166–177.
ICALP-2001-Wegener #aspect-oriented: Theoretical Aspects of Evolutionary Algorithms (IW), pp. 64–78.
RTA-2001-BoudetC: Combining Pattern E-Unification Algorithms (AB, EC), pp. 63–76.
ICFP-2001-Chitil #composition #debugging #fault: Compositional Explanation of Types and Algorithmic Debugging of Type Errors (OC), pp. 193–204.
GT-VMT-2001-BauderonGMMS #distributed #graph #visualisation: Visualization of Distributed Algorithms Based on Graph Relabelling Systems (MB, SG, YM, MM, AS), pp. 227–237.
SVIS-2001-BaskenN #geometry #interactive #named #visualisation: GeoWin — A Generic Tool for Interactive Visualization of Geometric Algorithms (MB, SN), pp. 88–100.
SVIS-2001-DemetrescuFS #question #specification #visualisation: Specifying Algorithm Visualizations: Interesting Events or State Mapping? (CD, IF, JTS), pp. 16–30.
SVIS-2001-DiehlGK: Animating Algorithms Live and Post Mortem (SD, CG, AK), pp. 46–57.
SVIS-2001-Faltin #constraints #interactive #learning: Structure and Constraints in Interactive Exploratory Algorithm Learning (NF), pp. 213–226.
SVIS-2001-FleischerK #animation #education: Algorithm Animation for Teaching (RF, LK), pp. 113–128.
SVIS-2001-Francik #animation #data flow #using: Algorithm Animation Using Data Flow Tracing (JF), pp. 73–87.
SVIS-2001-GutwengerJKLM #graph: Graph Drawing Algorithm Engineering with AGD (CG, MJ, GWK, SL, PM), pp. 307–323.
SVIS-2001-HundhausenD #visualisation: A Language and System for Constructing and Presenting Low Fidelity Algorithm Visualizations (CDH, SAD), pp. 227–240.
SVIS-2001-KerrenS #animation: Algorithm Animation — Introduction (AK, JTS), pp. 1–15.
SVIS-2001-KorhonenST #comprehension #testing #visualisation: Understanding Algorithms by Means of Visualized Path Testing (AK, ES, JT), pp. 256–268.
SVIS-2001-Tal #animation: Algorithm Animation Systems for Constrained Domains (AT), pp. 101–112.
SVIS-2001-WilhelmMS #invariant #visualisation: Algorithm Explanation: Visualizing Abstract States and Invariants (RW, TM, RS), pp. 381–394.
ICEIS-v1-2001-HippGG #database #mining #relational: Integrating Association Rule Mining Algorithms with Relational Database Systems (JH, UG, UG), pp. 130–137.
ICEIS-v1-2001-Rao #clustering #multi: An Algorithm for Determining Subspaces Containing Clusters with Multiple Minimum Density Thresholds for Numerical Data (PRR), pp. 530–532.
ICEIS-v1-2001-SoonthornphisajK #categorisation #problem #set #using #web: The Effects of Differnet Feature Sets on the Web Page Categorization Problem Using the Iterative Cross-Training Algorithm (NS, BK), pp. 404–410.
ICEIS-v1-2001-TehZL #automation #query: Automation Query Processing Selection Algorithms (YWT, ABZ, SPL), pp. 283–286.
CIKM-2001-HsuLC #generative #multi #source code: A Near Optimal Algorithm for Generating Broadcast Programs on Multiple Channels (CHH, GL, ALPC), pp. 303–309.
CIKM-2001-Karypis #evaluation #recommendation: Evaluation of Item-Based Top-N Recommendation Algorithms (GK), pp. 247–254.
CIKM-2001-KimLJH #hybrid #named #transaction: O-PreH: Optimistic Transaction Processing Algorithm based on Pre-Reordering in Hybrid Broadcast Environments (SK, SL, SYJ, CSH), pp. 553–555.
CIKM-2001-KrishnaK #clustering #mining #symmetry: A Clustering Algorithm for Asymmetrically Related Data with Applications to Text Mining (KK, RK), pp. 571–573.
CIKM-2001-LeeLC #incremental #mining #performance: Sliding-Window Filtering: An Efficient Algorithm for Incremental Mining (CHL, CRL, MSC), pp. 263–270.
CIKM-2001-YanF #dependence #multi: Algorithm for Discovering Multivalued Dependencies (MHY, AWCF), pp. 556–558.
ICML-2001-BlockeelS #performance: Efficient algorithms for decision tree cross-validation (HB, JS), pp. 11–18.
ICML-2001-DomingosH #clustering #machine learning #scalability: A General Method for Scaling Up Machine Learning Algorithms and its Application to Clustering (PMD, GH), pp. 106–113.
ICML-2001-LloraG: Inducing Partially-Defined Instances with Evolutionary Algorithms (XL, JMGiG), pp. 337–344.
ICML-2001-NairCK: Some Greedy Algorithms for Sparse Nonlinear Regression (PBN, AC, AJK), pp. 369–376.
ICML-2001-RozsypalK #classification #nearest neighbour #search-based #using: Using the Genetic Algorithm to Reduce the Size of a Nearest-Neighbor Classifier and to Select Relevant Attributes (AR, MK), pp. 449–456.
ICML-2001-Thollard #grammar inference #probability: Improving Probabilistic Grammatical Inference Core Algorithms with Post-processing Techniques (FT), pp. 561–568.
KDD-2001-ChiuFCWJ #clustering #database #robust #scalability: A robust and scalable clustering algorithm for mixed type attributes in large database environment (TC, DF, JC, YW, CJ), pp. 263–268.
KDD-2001-DittrichS #mining #named #scalability #set: GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces (JPD, BS), pp. 47–56.
KDD-2001-LazarevicO #distributed: The distributed boosting algorithm (AL, ZO), pp. 311–316.
KDD-2001-ShekharLZ #detection #graph #summary: Detecting graph-based spatial outliers: algorithms and applications (a summary of results) (SS, CTL, PZ), pp. 371–376.
KDD-2001-StreetK #classification #scalability #streaming: A streaming ensemble algorithm (SEA) for large-scale classification (WNS, YK), pp. 377–382.
KDD-2001-ZhengKM #performance: Real world performance of association rule algorithms (ZZ, RK, LM), pp. 401–406.
MLDM-2001-TrinidadS #clustering #concept #named: LC: A Conceptual Clustering Algorithm (JFMT, GSD), pp. 117–127.
SEKE-2001-BuenoJ #automation #generative #search-based #testing #using: Automatic Test Data Generation for Program Paths Using Genetic Algorithms (PMSB, MJ), pp. 2–9.
SIGIR-2001-HoashiMIH #collaboration #predict #query: Query Expansion Based on Predictive Algorithms for Collaborative Filtering (KH, KM, NI, KH), pp. 414–415.
SIGIR-2001-MillerRS #matrix #using: Modifications of Kleinberg’s HITS Algorithm Using Matrix Exponentiation and WebLog Records (JCM, GR, FS), pp. 444–445.
SIGIR-2001-ZhengNJ #analysis: Stable Algorithms for Link Analysis (AXZ, AYN, MIJ), pp. 258–266.
UML-2001-EshuisW #execution #graph #process #uml: An Execution Algorithm for UML Activity Graphs (RE, RW), pp. 47–61.
TOOLS-USA-2001-LiKLCL #automation #data mining #mining #parallel: Automatic Data Mining by Asynchronous Parallel Evolutionary Algorithms (JL, ZK, YL, HC, PL), pp. 99–107.
PADL-2001-TyagiT #interface #prolog: A Most Specific Method Finding Algorithm for Reflection Based Dynamic Prolog-to-Java Interfaces (ST, PT), pp. 322–336.
PLDI-2001-XiongJJP #compilation #named: SPL: A Language and Compiler for DSP Algorithms (JX, JRJ, RWJ, DAP), pp. 298–308.
PPDP-2001-HernandezR #development #logic programming #reuse #string: Development Reuse and the Logic Program Derivation of Two String-Matching Algorithms (MH, DAR), pp. 38–48.
SIGAda-2001-ChenBY #adaptation #detection #using: Detecting concurrently executed pairs of statements using an adapted MHP algorithm (ZC, BX, HY), pp. 107–114.
RE-2001-JeffordsH #invariant #requirements #specification: An Algorithm for Strengthening State Invariants Generated from Requirements Specifications (RDJ, CLH), pp. 182–193.
ASE-2001-Denney #java #synthesis: The Synthesis of a Java Card Tokenization Algorithm (ED), pp. 43–50.
ICSE-2001-CobleighCO #analysis #data flow #finite #verification: The Right Algorithm at the Right Time: Comparing Data Flow Analysis Algorithms for Finite State Verification (JMC, LAC, LJO), pp. 37–46.
ICSE-2001-HarmanJ #metaheuristic #named #re-engineering #using: SEMINAL: Software Engineering Using Metaheuristic INnovative Algorithms (MH, BFJ), pp. 762–763.
SAC-2001-BaroneBVM #analysis #approximate #problem: An approximation algorithm for the shortest common supersequence problem: an experimental analysis (PB, PB, GDV, GM), pp. 56–60.
SAC-2001-DeermanLP #predict #problem #search-based: Linkage-learning genetic algorithm application to the protein structure prediction problem (KRD, GBL, RP), pp. 333–339.
SAC-2001-FernandesTMR #problem #search-based #using: Using assortative mating in genetic algorithms for vector quantization problems (CMF, RT, CM, ACR), pp. 361–365.
SAC-2001-GaliassoW #hybrid #multi #problem #search-based: A hybrid genetic algorithm for the point to multipoint routing problem with single split paths (PG, RLW), pp. 327–332.
SAC-2001-HousniTKP #distributed: A new distributed mutual exclusion algorithm for two groups (AH, MT, MSK, MSP), pp. 531–538.
SAC-2001-HwangR #detection #fault: Algorithms to detect chained-inference faults in information distribution systems (YPH, DCR), pp. 679–685.
SAC-2001-JulstromR #graph #problem: Weight-biased edge-crossover in evolutionary algorithms for wto graph problems (BAJ, GRR), pp. 321–326.
SAC-2001-Kandemir #algebra #linear #locality #optimisation: A dynamic locality optimization algorithm for linear algebra codes (MTK), pp. 632–635.
SAC-2001-LeeYKP #order #performance #towards: Processor reordering algorithms toward efficient GEN_BLOCK redistribution (SL, HGY, MSK, MSP), pp. 539–543.
SAC-2001-MaddiD #performance: An efficient algorithm for causal messages ordering (AM, FD), pp. 499–503.
SAC-2001-Shen: A routing algorithm for the pyramid structures (ZS), pp. 484–488.
SAC-2001-VuHT #detection #image #performance #query: An efficient core-area detection algorithm for fast noise-free image query processing (KV, KAH, DAT), pp. 258–263.
SAC-2001-WahlsL #concurrent #constraints #modelling #semantics #source code #specification: Formal semantics of an algorithm for translating model-based specifications to concurrent constraint programs (TW, GTL), pp. 567–575.
SAC-2001-Yfantis #video: An algorithm for key-frame determination in digital video (EAY), pp. 312–314.
DAC-2001-MishchenkoSP #logic: An Algorithm for Bi-Decomposition of Logic Functions (AM, BS, MAP), pp. 103–108.
DAC-2001-Najork #animation: Web-based Algorithm Animation (MN), pp. 506–511.
DAC-2001-OckunzziP: Test Strategies for BIST at the Algorithmic and Register-Transfer Levels (KAO, CAP), pp. 65–70.
DAC-2001-PeymandoustM #algebra #synthesis #using: Using Symbolic Algebra in Algorithmic Level DSP Synthesis (AP, GDM), pp. 277–282.
DAC-2001-WuHCWW #generative #multi #scheduling: Simulation-Based Test Algorithm Generation and Port Scheduling for Multi-Port Memories (CFW, CTH, KLC, CWW, CWW), pp. 301–306.
DAC-2001-ZhaoS #pattern matching: A New Structural Pattern Matching Algorithm for Technology Mapping (MZ, SSS), pp. 371–376.
DATE-2001-AcquavivaBR #adaptation #multi #power management #streaming: An adaptive algorithm for low-power streaming multimedia processing (AA, LB, BR), pp. 273–279.
DATE-2001-GaoW #graph #modelling: A graph based algorithm for optimal buffer insertion under accurate delay models (YG, DFW), pp. 535–539.
DATE-2001-NogueraB #architecture #clustering #configuration management: A HW/SW partitioning algorithm for dynamically reconfigurable architectures (JN, RMB), p. 729.
DATE-2001-OlbrichRB #analysis #classification: An improved hierarchical classification algorithm for structural analysis of integrated circuits (MO, AR, EB), p. 807.
DATE-2001-YuK #distributed #performance: Explicit formulas and efficient algorithm for moment computation of coupled RC trees with lumped and distributed elements (QY, ESK), pp. 445–450.
PDP-2001-BaragliaPHLT #clustering #parallel #search-based: A Parallel Compact Genetic Algorithm for Multi-FPGA Partitioning (RB, RP, JIH, JL, FT), pp. 113–120.
PDP-2001-BeaumontBLRR #approximate #clustering #multi: Heterogeneous Matrix-Matrix Multiplication or Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms (OB, VB, AL, FR, YR), pp. 298–305.
PDP-2001-CasalicchioT #scalability #scheduling #web: Static and Dynamic Scheduling Algorithms for Scalable Web Server Farm (EC, ST), pp. 369–376.
PDP-2001-CuencaGG #algebra #behaviour #linear #message passing #modelling: Modeling the Behaviour of Linear Algebra Algorithms with Message-Passing (JC, DG, JG), pp. 282–289.
PDP-2001-DaneseLLQRT #case study #implementation #network #parallel: A Parallel Neurochip for Neural Networks Implementing the Reactive Tabu Search Algorithm: Application Case Studies (GD, IDL, FL, AQ, SR, GT), p. 273.
PDP-2001-Girault #static analysis: Elimination of Redundant Messages with a Two-Pass Static Analysis Algorithm (AG), pp. 178–185.
PDP-2001-Latif-ShabgahiBB #fault tolerance #novel: History-Based Weighted Average Voter: A Novel Software Voting Algorithm for Fault-Tolerant Computer Systems (GLS, JMB, SB), pp. 402–409.
PDP-2001-OksaV #parallel: Multi-Level Parallelism in the Block-Jacobi SVD Algorithm (GO, MV), p. 306–?.
PDP-2001-SemeM #geometry #parallel #performance #problem: Efficient BSR-Based Parallel Algorithms for Geometrical Problems (DS, JFM), pp. 265–272.
STOC-2001-AjtaiKS #problem: A sieve algorithm for the shortest lattice vector problem (MA, RK, DS), pp. 601–610.
STOC-2001-Bar-YossefKS #bound: Sampling algorithms: lower bounds and applications (ZBY, RK, DS), pp. 266–275.
STOC-2001-ChekuriKZ: Algorithms for minimizing weighted flow time (CC, SK, AZ), pp. 84–93.
STOC-2001-GoemansW #approximate #problem #programming: Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (MXG, DPW), pp. 443–452.
STOC-2001-GrigniSVV #problem #quantum: Quantum mechanical algorithms for the nonabelian hidden subgroup problem (MG, LJS, MV, UVV), pp. 68–74.
STOC-2001-JainV #approximate #game studies: Applications of approximation algorithms to cooperative games (KJ, VVV), pp. 364–372.
STOC-2001-JerrumSV #approximate #matrix #polynomial: A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries (MJ, AS, EV), pp. 712–721.
STOC-2001-MossR #approximate #problem: Approximation algorithms for constrained for constrained node weighted steiner tree problems (AM, YR), pp. 373–382.
STOC-2001-Papadimitriou #game studies #internet: Algorithms, games, and the internet (CHP), pp. 749–753.
STOC-2001-SpielmanT #analysis #polynomial #why: Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time (DAS, SHT), pp. 296–305.
STOC-2001-Watrous #quantum: Quantum algorithms for solvable groups (JW), pp. 60–67.
TACAS-2001-FislerFVY #detection #question: Is There a Best Symbolic Cycle-Detection Algorithm? (KF, RF, GK, MYV, ZY), pp. 420–434.
TACAS-2001-Khurshid #search-based #testing #using: Testing an Intentional Naming Scheme Using Genetic Algorithms (SK), pp. 358–372.
CAV-2001-DovierPP #bisimulation #performance: A Fast Bisimulation Algorithm (AD, CP, AP), pp. 79–90.
CAV-2001-MoriokaKY #performance #towards #verification: Towards Efficient Verification of Arithmetic Algorithms over Galois Fields GF(2m) (SM, YK, TY), pp. 465–477.
IJCAR-2001-Voronkov #automation #deduction #performance: Algorithms, Datastructures, and other Issues in Efficient Automated Deduction (AV), pp. 13–28.
LICS-2001-BouajjaniMT #permutation #verification: Permutation Rewriting and Algorithmic Verification (AB, AM, TT), pp. 399–408.
SAT-2001-LynceBM #probability #satisfiability: Stochastic Systematic Search Algorithms for Satisfiability (IL, LB, JMS), pp. 190–204.
SAT-2001-Morrisette #effectiveness #satisfiability: The Unreasonable Effectiveness of Alternation-Based Satisfiability Algorithms (TM), pp. 254–268.
SIGMOD-2000-BerckenDS #library #prototype #query: javax.XXL: A prototype for a Library of Query processing Algorithms (JVdB, JPD, BS), p. 588.
SIGMOD-2000-OrdonezC #clustering #named #performance #sql #using: SQLEM: Fast Clustering in SQL using the EM Algorithm (CO, PC), pp. 559–570.
SIGMOD-2000-RamaswamyRS #mining #performance #scalability #set: Efficient Algorithms for Mining Outliers from Large Data Sets (SR, RR, KS), pp. 427–438.
SIGMOD-2000-RoySSB #multi #optimisation #performance #query: Efficient and Extensible Algorithms for Multi Query Optimization (PR, SS, SS, SB), pp. 249–260.
VLDB-2000-ChoenniV #data mining #design #implementation #mining: Design and Implementation of a Genetic-Based Algorithm for Data Mining (SC), pp. 33–42.
VLDB-2000-PottingerL #query #scalability #using: A Scalable Algorithm for Answering Queries Using Views (RP, AYL), pp. 484–495.
ITiCSE-2000-KhuriH #image #interactive #learning: Interactive packages for learning image compression algorithms (SK, HCH), pp. 73–76.
ITiCSE-2000-KorhonenM #assessment #automation #simulation: Algorithm simulation with automatic assessment (AK, LM), pp. 160–163.
ITiCSE-2000-RosslingSF #animation: The ANIMAL algorithm animation tool (GR, MS, BF), pp. 37–40.
IWPC-2000-RaysideRHK #automation #clustering #graph #object-oriented #source code: The Effect of Call Graph Construction Algorithms for Object-Oriented Programs on Automatic Clustering (DR, SR, EH, KK), pp. 191–200.
IWPC-2000-TzerposH #clustering #on the: On the Stability of Software Clustering Algorithms (VT, RCH), pp. 211–218.
WCRE-2000-TzerposH #clustering #named: ACDC: An Algorithm for Comprehension-Driven Clustering (VT, RCH), pp. 258–267.
CIAA-2000-DiehlKW #automaton #finite #generative #visual notation #web: Visual Exploration of Generation Algorithms for Finite Automata on the Web (SD, AK, TW), pp. 327–328.
CIAA-2000-Mohri #automaton: Generic epsilon -Removal Algorithm for Weighted Automata (MM), pp. 230–242.
CIAA-2000-PaunSY #automaton #finite: An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages (AP, NS, SY), pp. 243–251.
CIAA-2000-SchmitzV #finite #game studies #implementation: Implementation of a Strategy Improvement Algorithm for Finite-State Parity Games (DS, JV), pp. 263–271.
CIAA-2000-Watson: Directly Constructing Minimal DFAs: Combining Two Algorithms by Brzozowski (BWW), pp. 311–317.
ICALP-2000-AkhaviV: Average Bit-Complexity of Euclidean Algorithms (AA, BV), pp. 373–387.
ICALP-2000-AlstrupH: Improved Algorithms for Finding Level Ancestors in Dynamic Trees (SA, JH), pp. 73–84.
ICALP-2000-AmbuhlGS #problem: Optimal Projective Algorithms for the List Update Problem (CA, BG, BvS), pp. 305–316.
ICALP-2000-DantsinGHS #satisfiability: Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search (ED, AG, EAH, US), pp. 236–247.
ICALP-2000-Hastad #approximate #np-hard #optimisation #performance #problem #question: Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms? (JH), p. 235.
ICALP-2000-Karp #challenge #research: The Genomics Revolution and Its Challenges for Algorithmic Research (RMK), p. 428.
ICALP-2000-Kucera #performance #process #verification: Efficient Verification Algorithms for One-Counter Processes (AK), pp. 317–328.
ICALP-2000-Mehlhorn #constraints #graph #programming: Constraint Programming and Graph Algorithms (KM), pp. 571–575.
ICALP-2000-PettieR: An Optimal Minimum Spanning Tree Algorithm (SP, VR), pp. 49–60.
ICALP-2000-Seiden #bound #online: An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing (SSS), pp. 283–295.
WLC-2000-SchottS #parallel #word: Two Optimal Parallel Algorithms on the Commutation Class of a Word (RS, JCS), pp. 403–419.
ICFP-2000-Okasaki #design #lessons learnt: Breadth-first numbering: lessons from a small exercise in algorithm design (CO), pp. 131–136.
ICFP-2000-SasanoHTO #linear #problem: Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems (IS, ZH, MT, MO), pp. 137–149.
CIKM-2000-BoughanemT #optimisation #query #search-based #using: Query Optimization Using An Improved Genetic Algorithm (MB, LT), pp. 368–373.
CIKM-2000-HanK #categorisation #documentation #performance #reduction #retrieval: Fast Supervised Dimensionality Reduction Algorithm with Applications to Document Categorization & Retrieval (EHH, GK), pp. 12–19.
CIKM-2000-SebastianiSV #categorisation: An Improved Boosting Algorithm and its Application to Text Categorization (FS, AS, NV), pp. 78–85.
ICML-2000-BennetDS #generative: A Column Generation Algorithm For Boosting (KPB, AD, JST), pp. 65–72.
ICML-2000-LagoudakisL #learning #using: Algorithm Selection using Reinforcement Learning (MGL, MLL), pp. 511–518.
ICML-2000-LauerR #distributed #learning #multi: An Algorithm for Distributed Reinforcement Learning in Cooperative Multi-Agent Systems (ML, MAR), pp. 535–542.
ICML-2000-LiRD #incremental #maintenance: The Space of Jumping Emerging Patterns and Its Incremental Maintenance Algorithms (JL, KR, GD), pp. 551–558.
ICML-2000-NgR #learning: Algorithms for Inverse Reinforcement Learning (AYN, SJR), pp. 663–670.
ICML-2000-OkamotoY #analysis #nearest neighbour: Generalized Average-Case Analyses of the Nearest Neighbor Algorithm (SO, NY), pp. 695–702.
ICML-2000-OSullivanLCB #named #robust: FeatureBoost: A Meta-Learning Algorithm that Improves Model Robustness (JO, JL, RC, AB), pp. 703–710.
ICML-2000-PennockMGH #learning: A Normative Examination of Ensemble Learning Algorithms (DMP, PMRI, CLG, EH), pp. 735–742.
ICML-2000-PfahringerBG #learning: Meta-Learning by Landmarking Various Learning Algorithms (BP, HB, CGGC), pp. 743–750.
ICML-2000-RandlovBR #learning: Combining Reinforcement Learning with a Local Control Algorithm (JR, AGB, MTR), pp. 775–782.
ICML-2000-Ting #case study #comparative: A Comparative Study of Cost-Sensitive Boosting Algorithms (KMT), pp. 983–990.
ICPR-v1-2000-Abrantes #analysis #clustering #multi: A Constrained Clustering Algorithm for Shape Analysis with Multiple Features (AJA), pp. 1912–1919.
ICPR-v1-2000-BorgesA #2d #image #segmentation: A Split-and-Merge Segmentation Algorithm for Line Extraction in 2-D Range Image (GdAB, MJA), pp. 1441–1444.
ICPR-v1-2000-CinqueLPCM #parametricity #search-based #segmentation: Optimal Range Segmentation Parameters through Genetic Algorithms (LC, SL, GP, RC, SM), pp. 1474–1477.
ICPR-v1-2000-CufiMFM #concurrent: A Concurrent Region Growing Algorithm Guided by Circumscribed Contours (XC, XM, JF, JM), pp. 1432–1435.
ICPR-v1-2000-DaniilidisG: Omnidirectional Vision: Theory and Algorithms (KD, CG), pp. 1089–1096.
ICPR-v1-2000-MarroquinBCV #image: The MPM-MAP Algorithm for Image Segmentatio (JLM, SB, FC, BCV), pp. 1303–1308.
ICPR-v1-2000-PanM #3d #estimation #search-based: 3D Motion Estimation of Human by Genetic Algorithm (CP, SM), pp. 1159–1163.
ICPR-v1-2000-StringaR #novel: A Novel Camera Calibration Algorithm Based on Kalman Filter (ES, CSR), pp. 1872–1875.
ICPR-v1-2000-SugayaO #integration: Stereo by Integration of Two Algorithms with/without Occlusion Handling (YS, YO), pp. 1109–1113.
ICPR-v1-2000-TorreR #contest #image: Agricultural-Field Extraction on Aerial Images by Region Competition Algorithm (MT, PR), pp. 1313–1316.
ICPR-v1-2000-WilliamsB #evaluation #multi #novel #set: Evaluation of a Novel Multiple Point Set Registration Algorithm (JAW, MB), pp. 5007–5010.
ICPR-v2-2000-BurrellP #detection #learning #online #parametricity #probability #process: Sequential Algorithms for Detecting Changes in Acting Stochastic Processes and On-Line Learning of their Operational Parameters (AB, TPK), pp. 2656–2659.
ICPR-v2-2000-ChenHF #nearest neighbour: Winner-Update Algorithm for Nearest Neighbor Search (YSC, YPH, CSF), pp. 2704–2707.
ICPR-v2-2000-ChouS #classification #learning #multi: A Hierarchical Multiple Classifier Learning Algorithm (YYC, LGS), pp. 2152–2155.
ICPR-v2-2000-DasarathyS #editing #nearest neighbour: Tandem Fusion of Nearest Neighbor Editing and Condensing Algorithms — Data Dimensionality Effects (BVD, JSS), pp. 2692–2695.
ICPR-v2-2000-GaoD #classification #feature model #on the: On Improvement of Feature Extraction Algorithms for Discriminative Pattern Classification (JG, XD), pp. 2101–2104.
ICPR-v2-2000-HiraokaHHMMY #analysis #learning #linear: Successive Learning of Linear Discriminant Analysis: Sanger-Type Algorithm (KH, KiH, MH, HM, TM, SY), pp. 2664–2667.
ICPR-v2-2000-LauYT #image: EDT Based Tracing Maximum Thinning Algorithm on Grey Scale Images (KKL, PCY, YYT), pp. 2863–2866.
ICPR-v2-2000-LucasS #automation #evaluation #internet: Automatic Evaluation of Algorithms over the Internet (SML, KS), pp. 2471–2474.
ICPR-v2-2000-LuoH #composition #graph #using: Symbolic Graph Matching Using the EM Algorithm and Singular Value Decomposition (BL, ERH), pp. 2141–2144.
ICPR-v2-2000-MesserK #design #network #performance: Fast Unit Selection Algorithm for Neural Network Design (KM, JK), pp. 2981–2984.
ICPR-v2-2000-PavlovMD #using: Scaling-Up Support Vector Machines Using Boosting Algorithm (DP, JM, BD), pp. 2219–2222.
ICPR-v2-2000-PolickerG #clustering #fuzzy #predict: A New Algorithm for Time Series Prediction by Temporal Fuzzy Clustering (SP, ABG), pp. 2728–2731.
ICPR-v2-2000-Salotti #composition: Improvement of Perez and Vidal Algorithm for the Decomposition of Digitized Curves into Line Segments (MS), pp. 2878–2882.
ICPR-v2-2000-SerratosaAS #graph #performance: Efficient Algorithms for Matching Attributed Graphs and Function-Described Graphs (FS, RA, AS), pp. 2867–2872.
ICPR-v2-2000-SomolP #feature model: Oscillating Search Algorithms for Feature Selection (PS, PP), pp. 2406–2409.
ICPR-v2-2000-SunOKAKT #approximate #distance #reduction: Two-Stage Computational Cost Reduction Algorithm Based on Mahalanobis Distance Approximations (FS, SO, NK, HA, SK, TT), pp. 2696–2699.
ICPR-v3-2000-BulowK: Rubber Band Algorithm for Estimating the Length of Digitized Space-Curves (TB, RK), pp. 3551–3555.
ICPR-v3-2000-ChoiLS #performance: An Efficient and Accurate Algorithm for Extracting a Skeleton (WPC, KML, WCS), pp. 3750–3753.
ICPR-v3-2000-ChuC #generative #performance: A Fast Algorithm for Generating Fractals (HTC, CCC), pp. 3306–3309.
ICPR-v3-2000-CostaBG #feature model: Level Curve Tracking Algorithm for Textural Feature Extraction (JPDC, PB, CG), pp. 3921–3924.
ICPR-v3-2000-GatosM #novel #recursion #using: A Novel Recursive Algorithm for Area Location Using Isothetic Polygons (BG, SLM), pp. 3496–3499.
ICPR-v3-2000-GuaragnellaS #estimation #object-oriented: Object Oriented Motion Estimation by Sliced-Block Matching Algorithm (CG, EDS), pp. 3865–3868.
ICPR-v3-2000-JiangK #3d #adaptation #image #search-based: 3D MR Image Restoration by Combining Local Genetic Algorithm with Adaptive Pre-Conditioning (TJ, FK), pp. 3302–3305.
ICPR-v3-2000-LiapisST #performance #segmentation #using: Color and/or Texture Segmentation Using Deterministic Relaxation and Fast Marching Algorithms (SL, ES, GT), pp. 3621–3624.
ICPR-v3-2000-MaedaINTS #fuzzy #image #segmentation #using: Rough and Accurate Segmentation of Natural Color Images Using Fuzzy Region-Growing Algorithm (JM, CI, SN, NT, YS), pp. 3642–3645.
ICPR-v3-2000-OukilS #energy #markov #random: Markovian Random Fields Energy Minimization Algorithms (AO, AS), pp. 3522–3525.
ICPR-v3-2000-RuizMMRL #multi: New Algorithm for Searching Minimum Bit Rate Wavelet Representations with Application to Multiresolution-Based Perceptual Audio Coding (NR, DM, RM, MR, FL), pp. 3290–3293.
ICPR-v3-2000-TraverRI #approximate #performance #search-based: Exploring the Performance of Genetic Algorithms as Polygonal Approximators (VJT, GR, JMIQ), pp. 3774–3777.
ICPR-v3-2000-Verges-LlahiSC #clustering #constraints #graph #image #segmentation: Color Image Segmentation Solving Hard-Constraints on Graph Partitioning Greedy Algorithms (JVL, AS, JC), pp. 3629–3632.
ICPR-v3-2000-XiongC #clustering #database #fuzzy #image #towards: Towards An Unsupervised Optimal Fuzzy Clustering Algorithm for Image Database Organization (XX, KLC), pp. 3909–3912.
ICPR-v4-2000-AbeggEW #image #linear #robust #sequence #video: A Robust Algorithm for Segmenting Deformable Linear Objects from Video Image Sequences (FA, DE, HW), pp. 4756–4759.
ICPR-v4-2000-AksoyYSSWHPPRSF #contest #performance: Algorithm Performance Contest (SA, MY, MLS, MS, YW, RMH, JRP, JP, DR, CS, GF), pp. 4870–4876.
ICPR-v4-2000-GeraudFD #image #pattern matching #pattern recognition #recognition: Obtaining Genericity for Image Processing and Pattern Recognition Algorithms (TG, YF, ADL), pp. 4816–4819.
ICPR-v4-2000-HasegawaYM #online #performance #recognition: Fast Discrete HMM Algorithm for On-line Handwriting Recognition (TH, HY, TM), pp. 4535–4538.
ICPR-v4-2000-JiangBMHSIBGLB #case study #comparison #image #segmentation: Some Further Results of Experimental Comparison of Range Image Segmentation Algorithms (XJ, KWB, YM, SH, KS, SI, MB, CG, REL, JMHdB), pp. 4877–4882.
ICPR-v4-2000-Lopez-de-TeruelRG #image #parallel: A Parallel Algorithm for Tracking of Segments in Noisy Edge Images (PELdT, AR, JMG), pp. 4807–4811.
ICPR-v4-2000-LuoTW #verification: A Minutia Matching Algorithm in Fingerprint Verification (XL, JT, YW), pp. 4833–4836.
ICPR-v4-2000-MaoK #approach #automation #optimisation #segmentation: Automatic Training of Page Segmentation Algorithms: An Optimization Approach (SM, TK), pp. 4531–4534.
ICPR-v4-2000-ScagliolaN #fuzzy #recognition: Crisp and Fuzzy Evaluations and D.P. Algorithms for Dealing with Extra Ink in Cursive Handwriting Recognition (CS, GN), pp. 4019–4022.
KDD-2000-Bhattacharyya #data mining #mining #modelling #multi #performance: Evolutionary algorithms in data mining: multi-objective performance modeling for direct marketing (SB), pp. 465–473.
KDD-2000-GarofalakisHRS #constraints #performance: Efficient algorithms for constructing decision trees with constraints (MNG, DH, RR, KS), pp. 335–339.
KDD-2000-SchefferW: A sequential sampling algorithm for a general class of utility criteria (TS, SW), pp. 330–334.
KDD-2000-YamanishiTWM #detection #finite #learning #online #using: On-line unsupervised outlier detection using finite mixtures with discounting learning algorithms (KY, JiT, GJW, PM), pp. 320–324.
KR-2000-GinsbergP #finite #quantifier #satisfiability: Satisfiability Algorithms and Finite Quantification (MLG, AJP), pp. 690–701.
KR-2000-Wassermann: An Algorithm for Belief Revision (RW), pp. 345–352.
SIGIR-2000-FisherHHNTV #collaboration #development #evaluation #framework #named: SWAMI: a framework for collaborative filtering algorithm development and evaluation (DF, KH, JIH, MWN, MT, RV), pp. 366–368.
SIGIR-2000-HatzivassiloglouGM #clustering #documentation #topic: An investigation of linguistic features and clustering algorithms for topical document clustering (VH, LG, AM), pp. 224–231.
SIGIR-2000-Papadias #retrieval: Hill climbing algorithms for content-based retrieval of similar configurations (DP), pp. 240–247.
OOPSLA-2000-TipP #graph #scalability: Scalable propagation-based call graph construction algorithms (FT, JP), pp. 281–293.
TOOLS-USA-2000-LeeOA #analysis #object-oriented: Algorithmic Analysis of the Impacts of Changes to Object-Oriented Software (ML, AJO, RTA), pp. 61–70.
PADL-2000-HuCT #analysis #data mining #mining: Calculating a New Data Mining Algorithm for Market Basket Analysis (ZH, WNC, MT), pp. 169–184.
PLDI-2000-Boothe #bidirectional #debugging #performance: Efficient algorithms for bidirectional debugging (BB), pp. 299–310.
POPL-2000-EsparzaP #graph #interprocedural #parallel #performance: Efficient Algorithms for pre^* and post^* on Interprocedural Parallel Flow Graphs (JE, AP), pp. 1–11.
ICSE-2000-Ramil #estimation #evolution: Algorithmic cost estimation for software evolution (JFR), pp. 701–703.
SAC-2000-AguiarDPR #named #process #search-based: EEGSolver — Brain Activity and Genetic Algorithms (PA, AD, SP, ACR), pp. 80–84.
SAC-2000-BrestVZ #clustering #sorting: A Sorting Algorithm on a PC Cluster (JB, AV, VZ), pp. 710–715.
SAC-2000-FernandesTR #named #search-based: niGAVaPS — Outbreeding in Genetic Algorithms (CMF, RT, ACR), pp. 477–482.
SAC-2000-Gottlieb #multi #problem: Permutation-Based Evolutionary Algorithms for Multidimensional Knapsack Problems (JG), pp. 408–414.
SAC-2000-GottliebK #problem: Selection in Evolutionary Algorithms for the Traveling Salesman Problem (JG, TK), pp. 415–421.
SAC-2000-HongKCW #data-driven #database #fuzzy #mining: Mining Fuzzy Rules from Quantitative Data Based on the AprioriTid Algorithm (TPH, CSK, SCC, SLW), pp. 534–536.
SAC-2000-KhuriH #tool support #visualisation: Tools for Visualizing Text Compression Algorithms (SK, HCH), pp. 119–123.
SAC-2000-KhuriWS #graph #search-based: A Grouping Genetic Algorithm for Coloring the Edges of Graphs (SK, TW, YS), pp. 422–427.
SAC-2000-MarchioriS #constraints #problem #random #search-based: A Genetic Local Search Algorithm for Random Binary Constraint Satisfaction Problems (EM, AGS), pp. 458–462.
SAC-2000-Monfroy #constraints #coordination: A Coordination-based Chaotic Iteration Algorithm for Constraint Propagation (EM), pp. 262–269.
SAC-2000-ODonnellRR: A Side-Effect-Free Hierarchical Radiosity Algorithm (JO, TR, GR), pp. 782–791.
SAC-2000-RaidlJ #problem #search-based: A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem (GRR, BAJ), pp. 440–445.
SAC-2000-Reich #difference #equation #simulation #using: Simulation of Imprecise Ordinary Differential Equations Using Evolutionary Algorithms (CR), pp. 428–432.
SAC-2000-RibeiroHOR #implementation #parallel #problem: A Parallel Algorithm for the Routing Problem: An Implementation in The Parallel Computer IBM-SP2 (CMR, FH, FCJdO, JFFR), pp. 649–654.
SAC-2000-RossiMK #adaptation #problem #satisfiability: An Adaptive Evolutionary Algorithm for the Satisfiability Problem (CR, EM, JNK), pp. 463–469.
SAC-2000-Shaw #equation #parallel: A Parallel Algorithm for NonLinear Volterra Integro-Differential Equations (RES), pp. 86–88.
SAC-2000-VeldhuizenL #multi #optimisation #search-based: Multiobjective Optimization with Messy Genetic Algorithms (DAvV, GBL), pp. 470–476.
DAC-2000-AagaardJKKS #verification: Formal verification of iterative algorithms in microprocessors (MA, RBJ, RK, KRK, CJHS), pp. 201–206.
DAC-2000-JagannathanHL #performance: A fast algorithm for context-aware buffer insertion (AJ, SWH, JL), pp. 368–373.
DAC-2000-VancorenlandRSG #design #using: Optimal RF design using smart evolutionary algorithms (PJV, CDR, MS, GGEG), pp. 7–10.
DAC-2000-YuWK #network #order #reduction: Passive model order reduction algorithm based on Chebyshev expansion of impulse response of interconnect networks (QY, JMW, ESK), pp. 520–525.
DAC-2000-ZachariahCR #novel: A novel algorithm to extract two-node bridges (STZ, SC, CDR), pp. 790–793.
DATE-2000-DubrovaEMM #named #optimisation: TOP: An Algorithm for Three-Level Optimization of PLDs (ED, PE, DMM, JCM), p. 751.
DATE-2000-LuCSMB #comparison #power management: Quantitative Comparison of Power Management Algorithms (YHL, EYC, TS, GDM, LB), pp. 20–26.
DATE-2000-ManquinhoS #on the #satisfiability #using: On Using Satisfiability-Based Pruning Techniques in Covering Algorithms (VMM, JPMS), pp. 356–363.
DATE-2000-MorawiecUR #diagrams #simulation #using: Cycle-Based Simulation Algorithms for Digital Systems Using High-Level Decision Diagrams (AM, RU, JR), p. 743.
DATE-2000-RamanathanG #online #power management: System Level Online Power Management Algorithms (DR, RKG), pp. 606–611.
DATE-2000-Saab #clustering #effectiveness #multi #performance: A New Effective And Efficient Multi-Level Partitioning Algorithm (YS), pp. 112–116.
DATE-2000-SchonherrS #automation #equivalence: Automatic Equivalence Check of Circuit Descriptions at Clocked Algorithmic and Register Transfer Level (JS, BS), p. 759.
DATE-2000-ShenoyBC #quality #synthesis: A System-Level Synthesis Algorithm with Guaranteed Solution Quality (UNS, PB, ANC), pp. 417–424.
OSDI-2000-ChandraAGS #cpu #multi #scheduling #symmetry: Surplus Fair Scheduling: A Proportional-Share CPU Scheduling Algorithm for Symmetric Multiprocessors (AC, MA, PG, PJS), pp. 45–58.
PDP-2000-BrzezinskiW #consistency #distributed #memory management #requirements: Consistency requirements of distributed shared memory for Lamport’s bakery algorithm for mutual exclusion (JB, DW), pp. 220–226.
PDP-2000-KozirisRTP #architecture #clustering #graph #multi #performance #physics: An efficient algorithm for the physical mapping of clustered task graphs onto multiprocessor architectures (NK, MR, PT, GKP), pp. 406–413.
PDP-2000-RivasI #3d #image #parallel #performance #re-engineering: Fast parallel algorithms for 3D reconstruction of angiographic images (RR, MBI), pp. 43–47.
FoSSaCS-2000-Zimmer #mobile #type system: Subtyping and Typing Algorithms for Mobile Ambients (PZ), pp. 375–390.
STOC-2000-AleksandrovMS #approximate #geometry #problem: Approximation algorithms for geometric shortest path problems (LA, AM, JRS), pp. 286–295.
STOC-2000-CsirikJKOSW #on the: On the sum-of-squares algorithm for bin packing (JC, DSJ, CK, JBO, PWS, RRW), pp. 208–217.
STOC-2000-CzumajS #approach #problem #satisfiability #scheduling: A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (AC, CS), pp. 38–47.
STOC-2000-FiatM: Better algorithms for unfair metrical task systems and applications (AF, MM), pp. 725–734.
STOC-2000-FleischerI: Improved algorithms for submodular function minimization and submodular flow (LF, SI), pp. 107–116.
STOC-2000-GuptaT #approximate #classification #constant #problem: A constant factor approximation algorithm for a class of classification problems (AG, ÉT), pp. 652–658.
STOC-2000-GuruswamiS: List decoding algorithms for certain concatenated codes (VG, MS), pp. 181–190.
STOC-2000-GurvitsS #approximate #polynomial: A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume (LG, AS), pp. 48–57.
STOC-2000-IwataFF #combinator #polynomial: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions (SI, LF, SF), pp. 97–106.
STOC-2000-Kleinberg #perspective: The small-world phenomenon: an algorithmic perspective (JMK), pp. 163–170.
STOC-2000-KonemannR #approximate #bound #matter: A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees (JK, RR), pp. 537–546.
STOC-2000-Seiden #game studies #online #random: A guessing game and randomized online algorithms (SSS), pp. 592–601.
STOC-2000-Vygen #on the: On dual minimum cost flow algorithms (JV), pp. 117–125.
CADE-2000-Belinfante: Gödel’s Algorithm for Class Formation (JGFB), pp. 132–147.
CAV-2000-BaumgartnerTASA #abstraction #design #verification: An Abstraction Algorithm for the Verification of Generalized C-Slow Designs (JB, AT, AA, VS, FA), pp. 5–19.
CAV-2000-EsparzaHRS #automaton #model checking #performance: Efficient Algorithms for Model Checking Pushdown Systems (JE, DH, PR, SS), pp. 232–247.
CAV-2000-Marques-SilvaS #automation #design #satisfiability #tutorial: Invited Tutorial: Boolean Satisfiability Algorithms and Applications in Electronic Design Automation (JPMS, KAS), p. 3.
CAV-2000-VogeJ #game studies: A Discrete Strategy Improvement Algorithm for Solving Parity Games (JV, MJ), pp. 202–215.
CL-2000-CelleB #consistency #database #implementation #query: Querying Inconsistent Databases: Algorithms and Implementation (AC, LEB), pp. 942–956.
CL-2000-Gennari #consistency: Arc Consistency Algorithms via Iterations of Subsumed Functions (RG), pp. 358–372.
LICS-2000-Kripke #first-order #theorem: From the Church-Turing Thesis to the First-Order Algorithm Theorem (SK), p. 177.
ICDAR-1999-AntonacopoulosB #analysis #flexibility #performance #segmentation: Methodology for Flexible and Efficient Analysis of the Performance of Page Segmentation Algorithms (AA, AB), pp. 451–454.
ICDAR-1999-BruzzoneC: An Algorithm for Extracting Cursive Text Lines (EB, MCC), pp. 749–752.
ICDAR-1999-ChaSS #analysis #approximate #recognition #sequence #string: Approximate Stroke Sequence String Matching Algorithm for Character Recognition and Analysis (SHC, YCS, SNS), pp. 53–56.
ICDAR-1999-ChenD #detection #documentation #image #robust: A Robust Skew Detection Algorithm for Grayscale Document Image (MC, XD), pp. 617–620.
ICDAR-1999-ChenMM #graph #performance #segmentation: An Efficient Algorithm for Matching a Lexicon with a Segmentation Graph (DYC, JM, KMM), pp. 543–546.
ICDAR-1999-GaoDW #segmentation #string: A Segmentation Algorithm for Handwritten Chinese Character Strings (JG, XD, YW), pp. 633–636.
ICDAR-1999-GatosMCTP #composition: Integrated Algorithms for Newspaper Page Decomposition and Article Tracking (BG, SLM, KC, AT, SJP), pp. 559–562.
ICDAR-1999-LiuN99a #classification #learning #nearest neighbour #prototype #recognition: Prototype Learning Algorithms for Nearest Neighbor Classifier with Application to Handwritten Character Recognition (CLL, MN), pp. 378–381.
ICDAR-1999-Lopresti #detection #documentation #modelling: Models and Algorithms for Duplicate Document Detection (DPL), pp. 297–300.
ICDAR-1999-NishimuraKMN #feature model #multi #recognition #using: Off-line Character Recognition using HMM by Multiple Directional Feature Extraction and Voting with Bagging Algorithm (HN, MK, MM, YN), pp. 49–52.
ICDAR-1999-StefanoCM #recognition: Handwritten Numeral Recognition by means of Evolutionary Algorithms (CDS, ADC, AM), pp. 804–807.
ICDAR-1999-SuralD #documentation #generative #image #parallel #segmentation: A Two-step Algorithm and its Parallelization for the Generation of Minimum Containing Rectangles for Document Image Segmentation (SS, PKD), pp. 173–176.
ICDAR-1999-TangSMRTC #2d #composition: Accelerating the 2-D Mallat Decomposition Algorithm with Cyclical Convolution and FNTT (YYT, QS, HM, DBR, YT, ZKC), pp. 87–90.
ICDAR-1999-ZhuSW #fourier #image: A New Distinguishing Algorithm of Connected Character Image based on Fourier Transform (XZ, YS, SW), pp. 788–791.
SIGMOD-1999-AggarwalPWYP #clustering #performance: Fast Algorithms for Projected Clustering (CCA, CMP, JLW, PSY, JSP), pp. 61–72.
SIGMOD-1999-MamoulisP #integration #multi: Integration of Spatial Join Algorithms for Processing Multiple Inputs (NM, DP), pp. 1–12.
SIGMOD-1999-NatsevRS #database #image #named #retrieval #similarity: WALRUS: A Similarity Retrieval Algorithm for Image Databases (AN, RR, KS), pp. 395–406.
VLDB-1999-LiRS #scalability: Aggregation Algorithms for Very Large Compressed Data Warehouses (JL, DR, JS), pp. 651–662.
VLDB-1999-PacittMS #consistency #database #lazy evaluation #maintenance #performance: Fast Algorithms for Maintaining Replica Consistency in Lazy Master Replicated Databases (EP, PM, ES), pp. 126–137.
ITiCSE-1999-Faltin #design #game studies #learning: Designing courseware on algorithms for active learning with virtual board games (NF), pp. 135–138.
ITiCSE-1999-KoldehofePT #distributed #education #visualisation: Distributed algorithms visualisation for educational purposes (BK, MP, PT), pp. 103–106.
ITiCSE-1999-KopecCA #data type #how: How should data structures and algorithms be taught (DK, RC, JA), pp. 175–176.
ITiCSE-1999-SternSN #animation #complexity: A strategy for managing content complexity in algorithm animation (LS, HS, LN), pp. 127–130.
WIA-1999-Trahtman #automaton #finite #testing #verification: An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata (ANT), pp. 164–173.
WIA-1999-Watson #automaton #finite #taxonomy: A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Finite Automata (BWW), pp. 174–182.
FM-v1-1999-MoninK #consistency #correctness #proving #standard: Correctness Proof of the Standardized Algorithm for ABR Conformance (JFM, FK), pp. 662–681.
FM-v2-1999-Eschbach #detection #specification #termination #verification: A Termination Detection Algorithm: Specification and Verification (RE), pp. 1720–1737.
RTA-1999-KepserR #equation #named #unification: UNIMOK: A System for Combining Equational Unification Algorithm (SK, JR), pp. 248–251.
IFL-1999-HammondP #haskell #named: HaskSkel: Algorithmic Skeletons in Haskell (KH, ÁJRP), pp. 181–198.
AGTIVE-1999-RodgersV #animation #graph: Graph Algorithm Animation with Grrr (PJR, NV), pp. 379–393.
HCI-CCAD-1999-Chiu #approach #learning #search-based #using: Learning path planning using genetic algorithm approach (CC), pp. 71–75.
HCI-CCAD-1999-NakagawaN #clustering #image: Image clustering by computer with human-oriented emergence algorithm (MN, HN), pp. 1221–1225.
HCI-EI-1999-Matsuda #ambiguity #search-based: Genetic Algorithm (GA) as a Means of Ambiguous Decision Support by AHP (NM), pp. 764–768.
ICEIS-1999-DuKM #mining #performance #reuse: Two Fast Algorithms for Repeated Mining of Association Rules Based on Ressource Reuse (XD, KK, AM), pp. 65–73.
ICEIS-1999-RamanA #mining: Candidate Drop Algorithm for Mining Association Rules (SR, TSA), pp. 132–139.
CIKM-1999-HsuL #classification: Classification Algorithms for NETNEWS Articles (WLH, SDL), pp. 114–121.
CIKM-1999-NoamanB #distributed: A Horizontal Fragmentation Algorithm for the Fact Relation in a Distributed Data Warehouse (AYN, KB), pp. 154–161.
CIKM-1999-WidyantoroIY #adaptation #learning: An Adaptive Algorithm for Learning Changes in User Interests (DHW, TRI, JY), pp. 405–412.
ICML-1999-FreundM #learning: The Alternating Decision Tree Learning Algorithm (YF, LM), pp. 124–133.
ICML-1999-Meila: An Accelerated Chow and Liu Algorithm: Fitting Tree Distributions to High-Dimensional Sparse Data (MM), pp. 249–257.
ICML-1999-TalbertF #named #optimisation: OPT-KD: An Algorithm for Optimizing Kd-Trees (DAT, DHF), pp. 398–405.
ICML-1999-VovkGS: Machine-Learning Applications of Algorithmic Randomness (VV, AG, CS), pp. 444–453.
ICML-1999-ZhouB #approach #hybrid #learning #memory management #parametricity #requirements: A Hybrid Lazy-Eager Approach to Reducing the Computation and Memory Requirements of Local Parametric Learning Algorithms (YZ, CEB), p. 503–?.
KDD-1999-AyanTA #performance #scalability: An Efficient Algorithm to Update Large Itemsets with Early Pruning (NFA, AUT, MEA), pp. 287–291.
KDD-1999-PellegM #geometry #reasoning: Accelerating Exact k-means Algorithms with Geometric Reasoning (DP, AWM), pp. 277–281.
KDD-1999-WangWLSSZ #clustering #data mining #mining: Evaluating a Class of Distance-Mapping Algorithms for Data Mining and Clustering (JTLW, XW, KIL, DS, BAS, KZ), pp. 307–311.
KDD-T-1999-RastogiS #database #mining #scalability: Scalable Algorithms for Mining Large Databases (RR, KS), pp. 73–140.
MLDM-1999-AizenbergAK #image #learning #multi #recognition: Multi-valued and Universal Binary Neurons: Learning Algorithms, Application to Image Processing and Recognition (INA, NNA, GAK), pp. 21–35.
SIGIR-1999-FrenchPCVEPM #database #performance: Comparing the Performance of Database Selection Algorithms (JCF, ALP, JPC, CLV, TE, KJP, YM), pp. 238–245.
SIGIR-1999-HerlockerKBR #collaboration #framework: An Algorithmic Framework for Performing Collaborative Filtering (JLH, JAK, AB, JR), pp. 230–237.
SIGIR-1999-Ribeiro-NetoMNZ #distributed #performance: Efficient Distributed Algorithms to Build Inverted Files (BARN, ESdM, MSN, NZ), pp. 105–112.
TOOLS-ASIA-1999-ShenLSZ #architecture #graph #object-oriented #using: An Algorithm for Describing Object-Oriented Software Architecture Using Graph (HHS, CL, MMS, WMZ), pp. 225–231.
TOOLS-EUROPE-1999-SchaerfLC #c++ #framework: LOCAL++: A C++ Framework for Local Search Algorithms (AS, ML, MC), pp. 152–161.
ESEC-FSE-1999-NaumovichAC #concurrent #java #performance #source code: An Efficient Algorithm for Computing MHP Information for Concurrent Java Programs (GN, GSA, LAC), pp. 338–354.
ICSE-1999-Murphy #development #mobile: Algorithm Development in the Mobile Environment (ALM), pp. 728–729.
SAC-1999-BentoPR: Mastermind by Evolutionary Algorithms (LB, LP, ACR), pp. 307–311.
SAC-1999-CraneWS #multi #pipes and filters #scheduling #search-based #using: Scheduling of Multi-Product Fungible Liquid Pipelines Using Genetic Algorithms (DSC, RLW, DAS), pp. 280–285.
SAC-1999-FernandesCMR: High School Weekly Timetabling by Evolutionary Algorithms (CMF, JPC, FM, ACR), pp. 344–350.
SAC-1999-JonesK #network #search-based #using: The Use of Genetic Algorithms and Neural Networks to Investigate the Baldwin Effect (MJ, AHK), pp. 275–279.
SAC-1999-KatayamaN #problem #search-based #using: A New Iterated Local Search Algorithm Using Genetic Crossover for the Traveling Salesman Problem (KK, HN), pp. 302–306.
SAC-1999-Lagoudakis: An IDA Algorithm for Optimal Spare Allocation (MGL), pp. 486–488.
SAC-1999-Raidl #multi #problem #search-based: A Weight-Coded Genetic Algorithm for the Multiple Container Packing Problem (GRR), pp. 291–296.
SAC-1999-Rivera-Gallego #distance #matrix #problem #search-based: A Genetic Algorithm for Solving the Euclidean Distance Matrices Completion Problem (WRG), pp. 286–290.
SAC-1999-TavaresTSR: Infected Genes Evolutionary Algorithm (RT, AT, PS, ACR), pp. 333–338.
SAC-1999-VeldhuizenL #multi #testing: Multiobjective Evolutionary Algorithm Test Suites (DAvV, GBL), pp. 351–357.
CC-1999-LiberatoreFK #evaluation: Evaluation of Algorithms for Local Register Allocation (VL, MFC, UK), pp. 137–152.
CC-1999-RiveraT #comparison #compilation: A Comparison of Compiler Tiling Algorithms (GR, CWT), pp. 168–182.
DAC-1999-BeniniMMOP #approximate #component #kernel #optimisation: Kernel-Based Power Optimization of RTL Components: Exact and Approximate Extraction Algorithms (LB, GDM, EM, GO, MP), pp. 247–252.
DAC-1999-CoelhoPS #approximate #generative #robust: Robust Rational Function Approximation Algorithm for Model Generation (CPC, JRP, LMS), pp. 207–212.
DAC-1999-DasdanIG #performance #problem: Efficient Algorithms for Optimum Cycle Mean and Optimum Cost to Time Ratio Problems (AD, SI, RKG), pp. 37–42.
DAC-1999-Freund #modelling #simulation: Passive Reduced-Order Models for Interconnect Simulation and Their Computation via Krylov-Subspace Algorithms (RWF), pp. 195–200.
DAC-1999-Grajcar #multi #scheduling #search-based: Genetic List Scheduling Algorithm for Scheduling and Allocation on a Loosely Coupled Heterogeneous Multiprocessor System (MG), pp. 280–285.
DAC-1999-HansenNR #approach #specification: An Approach for Extracting RT Timing Information to Annotate Algorithmic VHDL Specifications (CH, FN, WR), pp. 678–683.
DAC-1999-PerkowskiMGBM #evaluation #graph #performance: Graph Coloring Algorithms for Fast Evaluation of Curtis Decompositions (MAP, RM, SG, MB, AM), pp. 225–230.
DAC-1999-RoyBB #constraints: An Approxmimate Algorithm for Delay-Constraint Technology Mapping (SR, KPB, PB), pp. 367–372.
DATE-1999-CornoRS #approximate #equivalence #search-based #verification: Approximate Equivalence Verification of Sequential Circuits via Genetic Algorithms (FC, MSR, GS), pp. 754–755.
DATE-1999-EijkJMT #identification #symmetry: Identification and Exploitation of Symmetries in DSP Algorithms (CAJvE, ETAFJ, BM, AHT), pp. 602–608.
DATE-1999-MartinezAQH #encoding #using: An Algorithm for Face-Constrained Encoding of Symbols Using Minimum Code Length (MM, MJA, JMQ, JLH), pp. 521–525.
DATE-1999-SilvaSM #satisfiability: Algorithms for Solving Boolean Satisfiability in Combinational Circuits (LGeS, LMS, JPMS), pp. 526–530.
HPDC-1999-TakefusaMNAN #evaluation #overview #performance #scheduling: Overview of a Performance Evaluation System for Global Computing Scheduling Algorithms (AT, SM, HN, KA, UN), pp. 97–104.
LCTES-1999-CooperSS #optimisation #search-based #using: Optimizing for Reduced Code Space using Genetic Algorithms (KDC, PJS, DS), pp. 1–9.
PDP-1999-CarrionBG #evaluation #performance: Performance evaluation of the bubble algorithm: benefits for k-ary n-cubes (CC, RB, JÁG), pp. 349–356.
PDP-1999-CasadoG #bound #branch #distributed: Work load balance approaches for branch and bound algorithms on distributed systems (LGC, IG), pp. 155–162.
PDP-1999-CastorinoC: Optimal-election algorithms for hypercubes (AC, GC), pp. 215–220.
PDP-1999-CortesRSPL #nearest neighbour #on the #parallel #performance: On the performance of nearest-neighbors load balancing algorithms in parallel systems (AC, AR, MÀS, PP, EL), pp. 170–177.
PDP-1999-MontoyaGG #image #problem #segmentation: Load balancing for a class of irregular and dynamic problems: region growing image segmentation algorithms (MDGM, CG, IG), pp. 163–169.
PDP-1999-Vajtersic #problem #scalability: A scalable VLSI algorithm for the fourth-order elliptic problem (MV), pp. 53–57.
PPoPP-1999-LeePM #compilation #parallel #source code: Basic Compiler Algorithms for Parallel Programs (JL, DAP, SPM), pp. 1–12.
PPoPP-1999-RuginaR #automation #divide and conquer #parallel: Automatic Parallelization of Divide and Conquer Algorithms (RR, MCR), pp. 72–83.
FoSSaCS-1999-DantsinV #nondeterminism #polynomial #set #unification: A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees (ED, AV), pp. 180–196.
STOC-1999-BorodinOR99a #approximate #clustering #problem: Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces (AB, RO, YR), pp. 435–444.
STOC-1999-CharikarGTS #approximate #problem: A Constant-Factor Approximation Algorithm for the k-Median Problem (MC, SG, ÉT, DBS), pp. 1–10.
STOC-1999-GabowKT: Unique Maximum Matching Algorithms (HNG, HK, RET), pp. 70–78.
STOC-1999-GuruswamiKRSY #approximate #problem: Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems (VG, SK, RR, FBS, MY), pp. 19–28.
STOC-1999-Indyk #metric #problem #sublinear: Sublinear Time Algorithms for Metric Space Problems (PI), pp. 428–434.
STOC-1999-KargerKSTY #geometry #multi: Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut (DRK, PNK, CS, MT, NEY), pp. 668–678.
STOC-1999-KingS #maintenance #transitive: A Fully Dynamic Algorithm for Maintaining the Transitive Closure (VK, GS), pp. 492–498.
STOC-1999-NisanR #design: Algorithmic Mechanism Design (NN, AR), pp. 129–140.
STOC-1999-Wayne #combinator #polynomial: A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow (KDW), pp. 11–18.
TACAS-1999-RyuH #design #realtime: A Period Assignment Algorithm for Real-Time System Design (MR, SH), pp. 34–43.
CADE-1999-Tobies #logic: A PSpace Algorithm for Graded Modal Logic (ST), pp. 52–66.
CAV-1999-BaumgartnerHSA #abstraction #model checking: Model Checking the IBM Gigahertz Processor: An Abstraction Algorithm for High-Performance Netlists (JB, TH, VS, AA), pp. 72–83.
ICLP-1999-CaseauJL #named #set: CLAIRE: Combining Sets, Search, and Rules to Better Express Algorithms (YC, FXJ, FL), pp. 245–259.
IWTCS-1999-GecseK #automation: Automated Test of TCP Congestion Control Algorithms (RG, PK), pp. 149–166.
ADL-1998-FengF #mining: Binary Partition Based Algorithms for Mining Association Rules (JF, YF), pp. 30–34.
PODS-1998-Vitter #memory management: External Memory Algorithms (JSV), pp. 119–128.
SIGMOD-1998-GuhaRS #clustering #database #named #performance #scalability: CURE: An Efficient Clustering Algorithm for Large Databases (SG, RR, KS), pp. 73–84.
SIGMOD-1998-HjaltasonS #database #distance #incremental: Incremental Distance Join Algorithms for Spatial Databases (GRH, HS), pp. 237–248.
SIGMOD-1998-ShintaniK #classification #mining #parallel: Parallel Mining Algorithms for Generalized Association Rules with Classification Hierarchy (TS, MK), pp. 25–36.
VLDB-1998-Ganguly #analysis #design #optimisation #parametricity #query: Design and Analysis of Parametric Query Optimization Algorithms (SG), pp. 228–238.
VLDB-1998-HelmerWM #named: Diag-Join: An Opportunistic Join Algorithm for 1:N Relationships (SH, TW, GM), pp. 98–109.
VLDB-1998-KnorrN #dataset #mining #scalability: Algorithms for Mining Distance-Based Outliers in Large Datasets (EMK, RTN), pp. 392–403.
VLDB-1998-MorimotoFMTY #category theory #database #mining: Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases (YM, TF, HM, TT, KY), pp. 380–391.
VLDB-1998-OzsuVU #consistency: An Asynchronous Avoidance-Based Cache Consistency Algorithm for Client Caching DBMSs (MTÖ, KV, RCU), pp. 440–451.
VLDB-1998-PapadiasMD #query: Algorithms for Querying by Spatial Structure (DP, NM, VD), pp. 546–557.
ITiCSE-1998-DagdilelisS #education #graph #named: DIDAGRAPH: software for teaching graph theory algorithms (VD, MS), pp. 64–68.
ITiCSE-1998-Marneffe #problem: The problem of examination questions in algorithmics (PAdM), pp. 74–76.
ITiCSE-1998-Naps #java #source code #student #visualisation: A Java visualiser class: incorporating algorithm visualisations into students’ programs (TLN), pp. 181–184.
ITiCSE-1998-TenEyckSG #design #specification: Specification of an algorithm design system (JT, GS, RG), pp. 232–235.
ICALP-1998-BazganST #approximate #performance #problem #similarity: Efficient Approximation Algorithms for the Subset-Sums Equality Problem (CB, MS, ZT), pp. 387–396.
ICALP-1998-DyerG #polynomial: A Genuinely Polynomial-Time Algorithms for Sampling Two-Rowed Contingency Tables (MED, CSG), pp. 339–350.
ICALP-1998-KestenPR #linear #logic #specification #verification: Algorithmic Verification of Linear Temporal Logic Specifications (YK, AP, LoR), pp. 1–16.
ICALP-1998-LiuS #fixpoint #linear: Simple Linear-Time Algorithms for Minimal Fixed Points (XL, SAS), pp. 53–66.
ICALP-1998-Overmars #geometry: Geometric Algorithms for Robotic Manipulation (MHO), pp. 116–117.
ICALP-1998-Wigderson #probability #question: Do Probabilistic Algorithms Outperform Deterministic Ones? (AW), pp. 212–214.
WIA-1998-AlbertGW #context-free grammar #normalisation: Extended Context-Free Grammars and Normal Form Algorithms (JA, DG, DW), pp. 1–12.
WIA-1998-Watson #performance: A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs (BWW), pp. 121–132.
RTA-1998-VermaRL #problem #reduction: Algorithms and Reductions for Rewriting Problems (RMV, MR, DL), pp. 166–180.
CSCW-1998-SunE #editing #realtime: Operational Transformation in Real-Time Group Editors: Issues, Algorithms, and Achievements (CS, CAE), pp. 59–68.
CIKM-1998-AggarwalSY #online: Online Algorithms for Finding Profile Association Rules (CCA, ZS, PSY), pp. 86–95.
CIKM-1998-DumaisPHS #categorisation #induction #learning: Inductive Learning Algorithms and Representations for Text Categorization (STD, JCP, DH, MS), pp. 148–155.
CIKM-1998-JeonN #database: A Database Disk Buffer Management Algorithm Based on Prefetching (HSJ, SHN), pp. 167–174.
CIKM-1998-YuL #adaptation #learning #online: A New On-Line Learning Algorithm for Adaptive Text Filtering (KLY, WL), pp. 156–160.
ICML-1998-FreundISS #performance: An Efficient Boosting Algorithm for Combining Preferences (YF, RDI, RES, YS), pp. 170–178.
ICML-1998-FriessCC #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-GarciaN #analysis #learning: A Learning Rate Analysis of Reinforcement Learning Algorithms in Finite-Horizon (FG, SMN), pp. 215–223.
ICML-1998-HuW #framework #learning #multi: Multiagent Reinforcement Learning: Theoretical Framework and an Algorithm (JH, MPW), pp. 242–250.
ICML-1998-KearnsM #bottom-up #performance: A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization (MJK, YM), pp. 269–277.
ICML-1998-KimuraK #analysis #learning #using: An Analysis of Actor/Critic Algorithms Using Eligibility Traces: Reinforcement Learning with Imperfect Value Function (HK, SK), pp. 278–286.
ICML-1998-NakamuraA #collaboration #predict #using: Collaborative Filtering Using Weighted Majority Prediction Algorithms (AN, NA), pp. 395–403.
ICML-1998-ProvostFK #estimation #induction: The Case against Accuracy Estimation for Comparing Induction Algorithms (FJP, TF, RK), pp. 445–453.
ICML-1998-SaundersGV #learning: Ridge Regression Learning Algorithm in Dual Variables (CS, AG, VV), pp. 515–521.
ICPR-1998-Aviles-Cruz #data fusion #probability #segmentation #using: Unsupervised texture segmentation using stochastic version of the EM algorithm and data fusion (CAC), pp. 1005–1009.
ICPR-1998-CaiL: A new thresholding algorithm based on all-pole model (JC, ZQL), pp. 34–36.
ICPR-1998-Chen #image #on the: On the selection of image compression algorithms (CCC), pp. 1500–1504.
ICPR-1998-ChenL #documentation #using: Field-data grouping for form document processing using a gravitation-based algorithm (JLC, HJL), pp. 1095–1097.
ICPR-1998-ChenWSSC #3d #estimation #robust: A robust algorithm for 3D head pose estimation (QC, HW, TS, TS, KC), pp. 1356–1359.
ICPR-1998-ChetverikovV: Tracking feature points: a new algorithm (DC, JV), pp. 1436–1438.
ICPR-1998-Claridge #bound #consistency #locality #visual notation: A boundary localisation algorithm consistent with human visual perception (EC), pp. 300–304.
ICPR-1998-CordellaFSTV #evaluation #graph #performance: Graph matching: a fast algorithm and its evaluation (LPC, PF, CS, FT, MV), pp. 1582–1584.
ICPR-1998-DuanKC0: Intra-block algorithm for digital watermarking (FYD, IK, LWC, LX), pp. 1589–1591.
ICPR-1998-DuyguluAD #documentation #heuristic #representation: A heuristic algorithm for hierarchical representation of form documents (PD, VA, ED), pp. 929–931.
ICPR-1998-FerriMAS #estimation #using: Variable-size block matching algorithm for motion estimation using a perceptual-based splitting criterion (FJF, JM, JVA, JS), pp. 286–288.
ICPR-1998-HoffmanL #geometry #trade-off: Some trade-offs and a new algorithm for geometric hashing (MH, ML), pp. 1700–1704.
ICPR-1998-HuYY #clustering #string: Algorithms for partitioning path construction of handwritten numeral strings (JH, DY, HY), pp. 372–374.
ICPR-1998-JuanVA #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-KawaguchiN #detection #search-based #using: Ellipse detection using a genetic algorithm (TK, RiN), pp. 141–145.
ICPR-1998-KawaguchiN98a #recognition #search-based: Recognition of occluded objects by a genetic algorithm (TK, MN), pp. 233–237.
ICPR-1998-LamIL #performance: Approaches to decompose flat structuring element for fast overlapping search morphological algorithm (RWKL, HHSI, CKL), pp. 1461–1463.
ICPR-1998-Lehmann #image #modelling: A two-stage algorithm for model-based registration of medical images (TML), pp. 344–351.
ICPR-1998-LiuD #evaluation #performance #recognition: Performance evaluation of graphics recognition algorithms: principles and applications (WL, DD), pp. 1180–1182.
ICPR-1998-LiuW #3d #multi #novel: A novel algorithm for recovering the 3D motions of multiple moving rigid objects (MLL, KHW), pp. 655–657.
ICPR-1998-McLachlanP #automation #modelling #named #testing: MIXFIT: an algorithm for the automatic fitting and testing of normal mixture models (GJM, DP), pp. 553–557.
ICPR-1998-NakamuraEIH #using: Skeleton revision algorithm using maximal circles (TN, HE, HI, LH), pp. 1607–1609.
ICPR-1998-OzdemirBMEE #analysis #comparative #evaluation #fault: Comparative evaluation of texture analysis algorithms for defect inspection of textile products (SÖ, AB, RM, AE, AE), pp. 1738–1740.
ICPR-1998-QiTD #classification #feedback #search-based: Fingerprint classification system with feedback mechanism based on genetic algorithm (YQ, JT, RD), pp. 163–165.
ICPR-1998-SchutzJH #3d #for free #multi: Multi-feature matching algorithm for free-form 3D surface registration (CS, TJ, HH), pp. 982–984.
ICPR-1998-ShearerVB #performance #video: An efficient least common subgraph algorithm for video indexing (KS, SV, HB), pp. 1241–1243.
ICPR-1998-ShioyamaWN #recognition: Recognition algorithm based on wavelet transform for handprinted Chinese characters (TS, HW, TN), pp. 229–232.
ICPR-1998-SunOA #multi #recognition #taxonomy: An algorithm for constructing a multi-template dictionary for character recognition considering distribution of feature vectors (FS, SO, HA), pp. 1114–1116.
ICPR-1998-TissainayagamS #using #visual notation: Visual tracking and motion determination using the IMM algorithm (PT, DS), pp. 289–291.
ICPR-1998-ToyamaSM #estimation #modelling #search-based #using: Model-based pose estimation using genetic algorithm (FT, KS, JM), pp. 198–201.
ICPR-1998-VesWH: Matching blood vessel patterns with the generalised EM algorithm (EdV, RCW, ERH), pp. 364–367.
ICPR-1998-Visa #image #search-based #segmentation: A genetic algorithm based method to improve image segmentation (AV), pp. 1015–1017.
ICPR-1998-ZhaHH #3d #modelling #recursion #using: A recursive fitting-and-splitting algorithm for 3-D object modeling using superquadrics (HZ, TH, TH), pp. 658–662.
ICPR-1998-ZhangB #image #modelling #segmentation: A deformable model-based image segmentation algorithm for shapes with corners (ZZ, MB), pp. 392–394.
KDD-1998-Bhattacharyya #modelling #search-based #using: Direct Marketing Response Models Using Genetic Algorithms (SB), pp. 144–148.
KDD-1998-BradleyFR #clustering #database #scalability: Scaling Clustering Algorithms to Large Databases (PSB, UMF, CR), pp. 9–15.
KDD-1998-DuMouchelS #detection #performance #testing: A Fast Computer Intrusion Detection Algorithm Based on Hypothesis Testing of Command Transition Probabilities (WD, MS), pp. 189–193.
KDD-1998-EsterFKS #database #detection: Algorithms for Characterization and Trend Detection in Spatial Databases (ME, AF, HPK, JS), pp. 44–50.
KDD-1998-FayyadRB #clustering #refinement: Initialization of Iterative Refinement Clustering Algorithms (UMF, CR, PSB), pp. 194–198.
KDD-1998-NakhaeizadehS #data mining #evaluation #mining #personalisation #towards: Towards the Personalization of Algorithms Evaluation in Data Mining (GN, AS), pp. 289–293.
KR-1998-Rintanen: A Planning Algorithm not based on Directional Search (JR), pp. 617–625.
SIGIR-1998-BharatH #topic: Improved Algorithms for Topic Distillation in a Hyperlinked Environment (KB, MRH), pp. 104–111.
SIGIR-1998-RagasK #classification #corpus: Four Text Classification Algorithms Compared on a Dutch Corpus (HR, CHAK), pp. 369–370.
ECOOP-1998-FerreiraS #correctness #distributed #garbage collection #modelling #proving: Modelling a Distributed Cached Store for Garbage Collection: The Algorithm and Its Correctness Proof (PF, MS), pp. 234–259.
LOPSTR-1998-Wolper #perspective: Algorithms for Synthesizing Reactive Systems: A Perspective (PW), p. 308.
PLDI-1998-SastryJ: A New Algorithm for Scalar Register Promotion based on SSA Form (AVSS, RDCJ), pp. 15–25.
SIGAda-1998-Crawford #animation: Algorithm Animation with Symbol Processing Robots (BSC), pp. 217–218.
SIGAda-1998-JarcF #ada #animation #data type #empirical: An Empirical Study of Web-Based algorithm Animation Courseware in an Ada Data Structure Course (DJJ, MBF), pp. 68–74.
SIGAda-1998-ReisnerLPS #ada #implementation #self: Implementing a Culling and Self-Intersection Algorithm for Stereolithography Files in Ada 95 (JAR, ZL, TJP, SAD), pp. 104–113.
FSE-1998-NaumovichA #data flow #detection #parallel: A Conservative Data Flow Algorithm for Detecting All Pairs of Statement That May Happen in Parallel (GN, GSA), pp. 24–34.
SAC-1998-AbunawassBDL #clustering #convergence #fuzzy: Fuzzy clustering improves convergence of the backpropagation algorithm (AMA, OSB, MD, WL), pp. 277–281.
SAC-1998-Al-OmariA #network: Routing algorithms for tree-hypercube networks (MAO, HAS), pp. 85–89.
SAC-1998-CappJ #problem #search-based: A weight-coded genetic algorithm for the minimum weight triangulation problem (KC, BAJ), pp. 327–331.
SAC-1998-CornoRS #optimisation: The selfish gene algorithm: a new evolutionary optimization strategy (FC, MSR, GS), pp. 349–355.
SAC-1998-Hosseini-Khayat: Replacement algorithms for object caching (SHK), pp. 90–97.
SAC-1998-Julstrom: Comparing decoding algorithms in a weight-coded GA for TSP (BAJ), pp. 313–317.
SAC-1998-KangH #graph transformation #problem #search-based #using: Solving the rural postman problem using a genetic algorithm with a graph transformation (MJK, CGH), pp. 356–360.
SAC-1998-Konstam #classification #programming #search-based #using: Group classification using a mix of genetic programming and genetic algorithms (AHK), pp. 308–312.
SAC-1998-Li98a #distributed #online #random: Deterministic and randomized algorithms for distributed on-line task assignment and load balancing without load status information (KL), pp. 613–622.
SAC-1998-LiII #constraints #estimation #recursion: A recursive time estimation algorithm for program traces under resource constraints (DL, YI, NI), pp. 635–640.
SAC-1998-Marchiori98a #clique #heuristic #problem #search-based: A simple heuristic based genetic algorithm for the maximum clique problem (EM), pp. 366–373.
SAC-1998-McGuireS #linear #search-based #using: Using a genetic algorithm to find good linear error-correcting codes (KMM, RES), pp. 332–337.
SAC-1998-MerkleGL #performance #scalability #search-based: Scalability of an MPI-based fast messy genetic algorithm (LDM, GHGJ, GBL), pp. 386–393.
SAC-1998-Nemer-PreeceW #parallel #problem #satisfiability #search-based: Parallel genetic algorithm to solve the satisfiability problem (NNP, RWW), pp. 23–28.
SAC-1998-VitiniMD: A factoring algorithm in F₂[x] (FMV, JMM, APD), pp. 672–676.
SAC-1998-WieseG #search-based: Keep-best reproduction: a selection strategy for genetic algorithms (KCW, SDG), pp. 343–348.
ASPLOS-1998-AcharyaUS #evaluation #programming: Active Disks: Programming Model, Algorithms and Evaluation (AA, MU, JHS), pp. 81–91.
CC-1998-LelaitGE #performance: A New Fast Algorithm for Optimal Register Allocation in Modulo Scheduled Loops (SL, GRG, CE), pp. 204–218.
DAC-1998-CarroN #adaptation #performance: Efficient Analog Test Methodology Based on Adaptive Algorithms (LC, MN), pp. 32–37.
DAC-1998-HasteerMB #automaton #verification: An Implicit Algorithm for Finding Steady States and its Application to FSM Verification (GH, AM, PB), pp. 611–614.
DAC-1998-KarkowskiC #design #embedded #multi: Design Space Exploration Algorithm for Heterogeneous Multi-Processor Embedded System Design (IK, HC), pp. 82–87.
DAC-1998-KimB #estimation #parallel: Parallel Algorithms for Power Estimation (VK, PB), pp. 672–677.
DAC-1998-Kung #library #optimisation #performance: A Fast Fanout Optimization Algorithm for Near-Continuous Buffer Libraries (DSK), pp. 352–355.
DAC-1998-ShiLKY #3d #performance: A Fast Hierarchical Algorithm for 3-D Capacitance Extraction (WS, JL, NK, TY), pp. 212–217.
DAC-1998-VecianaJG #constraints #performance #probability: Hierarchical Algorithms for Assessing Probabilistic Constraints on System Performance (GdV, MFJ, JHG), pp. 251–256.
DATE-1998-ChuW #polynomial: A Polynomial Time Optimal Algorithm for Simultaneous Buffer and Wire Sizing (CCNC, DFW), pp. 479–485.
DATE-1998-LiG #behaviour: An Algorithm To Determine Mutually Exclusive Operations In Behavioral Descriptions (JL, RKG), pp. 457–463.
DATE-1998-MarquesKWS #3d #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-RuttenBEK #divide and conquer #logic #performance: An Efficient Divide and Conquer Algorithm for Exact Hazard Free Logic Minimization (JWJMR, MRCMB, CAJvE, MAJK), pp. 749–754.
DATE-1998-SchneiderKHD #architecture #comparison #hardware: From Algorithms to Hardware Architectures: A Comparison of Regular and Irregular Structured IDCT Algorithms (CS, MK, TH, JD), pp. 186–190.
DATE-1998-Vygen #standard: Algorithms for Detailed Placement of Standard Cells (JV), pp. 321–324.
DATE-1998-YangP #performance #scheduling #synthesis: An Efficient Algorithm to Integrate Scheduling and Allocation in High-Level Test Synthesis (LTY, ZP), pp. 74–81.
HPDC-1998-BhatPR #adaptation #communication #distributed: Adaptive Communication Algorithms for Distributed Heterogeneous Systems (PBB, VKP, CSR), pp. 310–321.
HPDC-1998-ChenWCK #automation #optimisation #parallel #performance #search-based #using: Automatic Parallel I/O Performance Optimization Using Genetic Algorithms (YC, MW, YC, SWK), pp. 155–162.
HPDC-1998-NaikTC #distributed #named #network #object-oriented: NETMAN: An Object-Oriented Environment for Experimenting Distributed Algorithms on a Network of Workstations (KN, YT, ZC), pp. 350–351.
HPDC-1998-Zambonelli #distributed #effectiveness #on the: On the Effectiveness of Distributed Checkpoint Algorithms for Domino-Free Recovery (FZ), pp. 124–131.
ISMM-1998-ColnetCZ #compilation: Compiler Support to Customize the Mark and Sweep Algorithm (DC, PC, OZ), pp. 154–165.
PDP-1998-ClematisCS #network #parallel: Developing non-local iterative parallel algorithms for GIS on a workstation network (AC, AC, MS), pp. 250–256.
PDP-1998-GerbessiotisS #case study #sorting: An experimental study of BSP sorting algorithms (AVG, CJS), pp. 479–485.
PDP-1998-JanikK #configuration management #fault tolerance #multi #optimisation: An algorithm for optimization of reconfiguration of fault tolerant multiprocessor systems (PJ, MK), pp. 342–348.
PDP-1998-Khan #distributed #performance #pipes and filters: Performance of the pipelined hash-join algorithm in a heterogeneous distributed environment (ZSK), pp. 486–491.
PDP-1998-MontoyaG #analysis #implementation #parallel: Implementation of parallel thinning algorithms on multicomputers: analysis of the work load balance (MDGM, IG), pp. 257–263.
PDP-1998-PalazariC #implementation: Virtual cut-through implementation of the HB packet switching routing algorithm (PP, MC), pp. 416–421.
PDP-1998-RodriguezAM #network #parallel #performance #predict #using: Prediction of parallel algorithms performance on bus-based networks using PVM (RJR, CA, DM), pp. 57–63.
PDP-1998-RoyoVG #2d #symmetry: A Jacobi-based algorithm for computing symmetric eigenvalues and eigenvectors in a two-dimensional mesh (DR, MVG, AG), pp. 463–469.
PDP-1998-Sergent #performance: The performance of the consensus algorithm running on FDDI (NS), pp. 77–83.
PDP-1998-VesztergombiORV #architecture #matrix #multi #scalability: Scalable matrix multiplication algorithm for IRAM architecture machine (GV, GÓ, FR, GV), pp. 367–372.
PDP-1998-VilladangosFM #concurrent #distributed: A safe distributed deadlock resolution algorithm for the OR request model (JEV, FF, JRGdM), pp. 150–156.
ESOP-1998-FechtS #constraints #difference #fixpoint #performance: Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems (CF, HS), pp. 90–104.
STOC-1998-Bshouty #composition #learning #theorem: A New Composition Theorem for Learning Algorithms (NHB), pp. 583–589.
STOC-1998-BuchsbaumKRW #linear #verification: Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators (ALB, HK, AR, JW), pp. 279–288.
STOC-1998-CalinescuKR #approximate #multi: An Improved Approximation Algorithm for Multiway Cut (GC, HJK, YR), pp. 48–52.
STOC-1998-CharikarCGG #approximate: Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and k-Median (MC, CC, AG, SG), pp. 114–123.
STOC-1998-CharikarKR: Algorithms for Capacitated Vehicle Routing (MC, SK, BR), pp. 349–358.
STOC-1998-Grover #framework #performance #quantum: A Framework for Fast Quantum Mechanical Algorithms (LKG), pp. 53–62.
STOC-1998-HolmLT: Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge, and Biconnectivity (JH, KdL, MT), pp. 79–89.
STOC-1998-Kleinberg #problem: Decision Algorithms for Unsplittable Flow and the Half-Disjoint Paths Problem (JMK), pp. 530–539.
STOC-1998-LevcopoulosNS #fault tolerance #geometry #performance: Efficient Algorithms for Constructing Fault-Tolerant Geometric Spanners (CL, GN, MHMS), pp. 186–195.
STOC-1998-LinialSW #approximate #matrix #polynomial #scalability: A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents (NL, AS, AW), pp. 644–652.
STOC-1998-MolloyR #aspect-oriented: Further Algorithmic Aspects of the Local Lemma (MM, BAR), pp. 524–529.
STOC-1998-NatanzonSS #approximate #polynomial #problem: A Polynomial Approximation Algorithm for the Minimum Fill-In Problem (AN, RS, RS), pp. 41–47.
TACAS-1998-GribomontZ #automation #verification: Automated Verification of Szymanski’s Algorithm (EPG, GZ), pp. 424–438.
TACAS-1998-JensenL #abstraction #proving #using: A Proof of Burns N-Process Mutual Exclusion Algorithm Using Abstraction (HEJ, NAL), pp. 409–423.
CADE-1998-OliartS #performance: A Fast Algorithm for Uniform Semi-Unification (AO, WS), pp. 239–253.
CADE-1998-Thery: A Certified Version of Buchberger’s Algorithm (LT), pp. 349–364.
CAV-1998-McMillan #composition #implementation #model checking #verification: Verification of an Implementation of Tomasulo’s Algorithm by Compositional Model Checking (KLM), pp. 110–121.
CSL-1998-Sadowski #on the #satisfiability: On an Optimal Deterministic Algorithm for SAT (ZS), pp. 179–187.
ISSTA-1998-HajnalF #fault #generative #testing: An Applicable Test Data Generation Algorithm for Domain Errors (ÁH, IF), pp. 63–72.
JICSLP-1998-AngelopoulosPW #constraints #implementation #logic programming #random: Implementing Randomised Algorithms in Constraint Logic Programming (NA, ADP, HW), pp. 355–356.
JICSLP-1998-GrecoZ #datalog: Greedy Algorithms in Datalog with Choice and Negation (SG, CZ), pp. 294–309.
JICSLP-1998-Zhou #compilation #constraints: A High-Level Intermediate Language and the Algorithms for Compiling Finite-Domain Constraints (NFZ), pp. 70–84.
ICDAR-1997-AbakBS #evaluation #performance #recognition: The Performance Evaluation of Thresholding Algorithms for Optical character Recognition (ATA, UB, BS), pp. 697–700.
ICDAR-1997-AblameykoBFHP #recognition: Algorithms for Recognition of the Main Engineering Drawing Entities (SA, VB, OF, MH, NP), pp. 776–779.
ICDAR-1997-BagdanovK #estimation #image: Projection profile based skew estimation algorithm for JBIG compressed images (ADB, JK), pp. 401–406.
ICDAR-1997-ChangLP #analysis: Line sweep thinning algorithm for feature analysis (FC, YCL, TP), pp. 123–127.
ICDAR-1997-DoriW #segmentation: Arc Segmentation from Complex Line Environments: A Vector-Based Stepwise Recovery Algorithm (DD, LW), pp. 76–80.
ICDAR-1997-MarianiDLM #network: Algorithms for the Hydrographic Network Names Association on Geographic Maps (RM, MPD, JL, RM), p. 362.
ICDAR-1997-MasakiKMNM #online #recognition: An On-Line Handwriting Characters Recognition Algorithm RAV (Reparameterized Angle Variations) (SM, MK, OM, YN, TM), pp. 919–925.
ICDAR-1997-SauvolaHKSPD #analysis #distributed #documentation #image #testing: A distributed management system for testing document image analysis algorithms (JJS, SH, HK, TS, MP, DSD), pp. 989–995.
ICDAR-1997-SongS #robust #self: Self-organizing Algorithm of Robust PCA Based on Single-layer NN (WS, SX), p. 851–?.
ICDAR-1997-TakahashiYM #online #performance #recognition: A Fast HMM Algorithm for On-line Handwritten Character Recognition (KT, HY, TM), pp. 369–375.
ICDAR-1997-TonouchiK #online #recognition #using: An on-line Japanese character recognition method using length-based stroke correspondence algorithm (YT, AK), pp. 633–636.
PODS-1997-AgrawalAS #database: Epidemic Algorithms in Replicated Databases (DA, AEA, RCS), pp. 161–172.
SIGMOD-1997-ZhaoDN #multi: An Array-Based Algorithm for Simultaneous Multidimensional Aggregates (YZ, PD, JFN), pp. 159–170.
VLDB-1997-AlsabtiRS: A One-Pass Algorithm for Accurately Estimating Quantiles for Disk-Resident Data (KA, SR, VS), pp. 346–355.
VLDB-1997-HelmerM #comparison #evaluation #in memory #memory management #set: Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates (SH, GM), pp. 386–395.
VLDB-1997-HumborstadSHT #symmetry: 1-Safe Algorithms for Symmetric Site Configurations (RH, MS, SOH, ØT), pp. 316–325.
VLDB-1997-ShaferA #data mining #mining #parallel #similarity: Parallel Algorithms for High-dimensional Similarity Joins for Data Mining Applications (JCS, RA), pp. 176–185.
VLDB-1997-YangKL #design: Algorithms for Materialized View Design in Data Warehousing Environment (JY, KK, QL), pp. 136–145.
ITiCSE-1997-Ben-Ari #distributed #java: Distributed algorithms in Java (MBA), pp. 62–64.
ITiCSE-1997-Berry #education: Improving discrete mathematics and algorithms curricula with LINK (JWB), pp. 14–20.
ITiCSE-1997-BurkeV #optimisation #search-based #tutorial: A genetic algorithms tutorial tool for numerical function optimisation (EKB, DBV), pp. 27–30.
ITiCSE-1997-Janser #interactive #learning #visualisation: An interactive learning system visualizing computer graphics algorithms (AWJ), pp. 21–23.
ITiCSE-1997-Naps #difference #exclamation #java #visualisation #web: Algorithm visualization on the World Wide Web — the difference Java makes! (TLN), pp. 59–61.
ITiCSE-1997-RautamaST #animation: Excel as an algorithm animation environment (ER, ES, JT), pp. 24–26.
WCRE-1997-Wiggerts #clustering #legacy #using: Using Clustering Algorithms in Legacy Systems Remodularization (TAW), pp. 33–43.
ICALP-1997-BodlaenderT #linear: Constructive Linear Time Algorithms for Branchwidth (HLB, DMT), pp. 627–637.
ICALP-1997-Bruyere #bound: A Completion Algorithm for Codes with Bounded Synchronization Delay (VB), pp. 87–97.
ICALP-1997-CaceresDFFRRSS #graph #parallel #performance: Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP (EC, FKHAD, AF, PF, IR, AR, NS, SWS), pp. 390–400.
ICALP-1997-GrossiI #order #performance #problem: Efficient Splitting and Merging Algorithms for Order Decomposable Problems (RG, GFI), pp. 605–615.
ICALP-1997-Hagerup #bound #graph: Dynamic Algorithms for Graphs of Bounded Treewidth (TH), pp. 292–302.
WIA-1997-Miller #context-free grammar #normalisation #towards: Towards a Meta-Normal Form Algorithm for Context-Free Grammars (CLM), pp. 133–143.
RTA-1997-Ringeissen #programming language #prototype #rule-based #unification: Prototyping Combination of Unification Algorithms with the ELAN Rule-Based Programming Language (CR), pp. 323–326.
RTA-1997-Schulz: A Criterion for Intractability of E-unification with Free Function Symbols and Its Relevance for Combination Algorithms (KUS), pp. 284–298.
TLCA-1997-DamianiG #strict: An Inference Algorithm for Strictness (FD, PG), pp. 129–146.
HCI-SEC-1997-HacW #distributed #multi: A Multicast Algorithm in a Distributed Multimedia Conference System (AH, DW), pp. 679–682.
ICML-1997-Joachims #analysis #categorisation #probability: A Probabilistic Analysis of the Rocchio Algorithm with TFIDF for Text Categorization (TJ), pp. 143–151.
KDD-1997-AronisP #data mining #mining #performance: Increasing the Efficiency of Data Mining Algorithms with Breadth-First Marker Propagation (JMA, FJP), pp. 119–122.
KDD-1997-KahngM #mining: Mining Generalized Term Associations: Count Propagation Algorithm (JK, WHKL, DM), pp. 203–206.
KDD-1997-NakhaeizadehS #data mining #development #evaluation #metric #mining #multi: Development of Multi-Criteria Metrics for Evaluation of Data Mining Algorithms (GN, AS), pp. 37–42.
KDD-1997-ProvostK #induction #overview #perspective #scalability: Scaling Up Inductive Algorithms: An Overview (FJP, VK), pp. 239–242.
KDD-1997-ThomasBAR #database #incremental #performance #scalability: An Efficient Algorithm for the Incremental Updation of Association Rules in Large Databases (ST, SB, KA, SR), pp. 263–266.
KDD-1997-ZakiPOL #performance: New Algorithms for Fast Discovery of Association Rules (MJZ, SP, MO, WL), pp. 283–286.
OOPSLA-1997-Weihe #challenge #object-oriented #programming #reuse #using: Reuse of Algorithms: Still a Challenge to Object-Oriented Programming (KW), pp. 34–48.
PLDI-1997-ChowCKLLT: A New Algorithm for Partial Redundancy Elimination based on SSA Form (FCC, SC, RK, SML, RL, PT), pp. 273–286.
PLDI-1997-RamalingamS #c++: A Member Lookup Algorithm for C++ (GR, HS), pp. 18–30.
POPL-1997-Saibi #inheritance #type system: Typing Algorithm in Type Theory with Inheritance (AS), pp. 292–301.
ASE-1997-MichaelMSW #generative #search-based #testing: Genetic Algorithms for Dynamic Test Data Generation (CCM, GM, MS, CCW), pp. 307–308.
SAC-1997-ChanA #effectiveness #mining: An effective algorithm for mining interesting quantitative association rules (KCCC, WHA), pp. 88–90.
SAC-1997-ChristensenWS #hybrid #multi #problem: A hybrid algorithm for the point to multipoint routing problem (HLC, RLW, DAS), pp. 263–268.
SAC-1997-ChungP #problem #question #representation #search-based #why: Why is problem-dependent and high-level representation scheme better in a genetic algorithm? (SC, RP), pp. 239–246.
SAC-1997-CornoPRR #generative #named: SAARA: a simulated annealing algorithm for test pattern generation for digital circuits (FC, PP, MR, MSR), pp. 228–232.
SAC-1997-HuizingaK #design #distributed #generative: A tree generating algorithm for designing optimal hierarchical distributed systems (DMH, EK), pp. 345–353.
SAC-1997-JagotaD #distributed #problem: Simple distributed algorithms for the cycle cutset problem (AKJ, RD), pp. 366–373.
SAC-1997-Julstrom #adaptation #search-based: Adaptive operator probabilities in a genetic algorithm that applies three operators (BAJ), pp. 233–238.
SAC-1997-KaiserLMGP #hybrid #predict #search-based: Polypeptide structure prediction: real-value versus binary hybrid genetic algorithms (CEK, GBL, LDM, GHGJ, RP), pp. 279–286.
SAC-1997-KhuriC #heuristic #problem: Heuristic algorithms for the terminal assignment problem (SK, TC), pp. 247–251.
SAC-1997-Liu #evaluation #execution #parallel #performance #query: Performance evaluation of processor allocation algorithms for parallel query execution (KHL), pp. 393–402.
SAC-1997-OchiDF #design #implementation #parallel #problem #search-based: Design and implementation of a parallel genetic algorithm for the travelling purchaser problem (LSO, LMdAD, RMVF), pp. 257–262.
SAC-1997-PargasLS #hybrid: Hybrid search algorithms (RPP, JL, SAS), pp. 269–273.
SAC-1997-SabharwalQ #performance: An efficient algorithm for direct computation of adjacent block coefficients in the transformed domain (CLS, BQ), pp. 515–520.
DAC-1997-AluruW #simulation: Algorithms for Coupled Domain MEMS Simulation (NRA, JW), pp. 686–690.
DAC-1997-KimK #design #layout #performance: An Efficient Transistor Folding Algorithm for Row-Based CMOS Layout Design (JK, SMK), pp. 456–459.
DAC-1997-MaheshwariS: An Improved Algorithm for Minimum-Area Retiming (NM, SSS), pp. 2–7.
DAC-1997-TsaiCLB #hybrid: A Hybrid Algorithm for Test Point Selection for Scan-Based BIST (HCT, KTC, CJL, SB), pp. 478–483.
DAC-1997-Vygen #scalability: Algorithms for Large-Scale Flat Placement (JV), pp. 746–751.
DAC-1997-YeR #graph #network #synthesis: A Graph-Based Synthesis Algorithm for AND/XOR Networks (YY, KR), pp. 107–112.
EDTC-1997-Garcia-VargasGFR #analysis #generative #scalability: An algorithm for numerical reference generation in symbolic analysis of large analog circuits (IGV, MG, FVF, ÁRV), pp. 395–399.
EDTC-1997-GovindarajanV #clustering #heuristic: Cone-based clustering heuristic for list-scheduling algorithms (SG, RV), pp. 456–462.
EDTC-1997-PrietoRQH #optimisation: A performance-driven placement algorithm with simultaneous Place&Route optimization for analog ICs (JAP, AR, JMQ, JLH), pp. 389–394.
HPCA-1997-YuanMG #distributed #multi #network: Distributed Path Reservation Algorithms for Multiplexed All-Optical Interconnection Networks (XY, RGM, RG), pp. 38–47.
PDP-1997-CunhaM #development #distributed #prolog: Distributed algorithm development with PVM-prolog (JCC, RFPM), pp. 211–215.
PDP-1997-GinisJZ #adaptation #evaluation: Evaluation of a visual-tracking adaptive robot control algorithm (CG, DIJ, EZ), pp. 246–252.
PDP-1997-RodriguezGARG #parallel #problem: Parallel algorithms for polyadic problems (CR, DG, FA, JLR, FG), pp. 394–400.
PDP-1997-Sergent #distributed #latency #petri net #using: Evaluating latency of distributed algorithms using petri nets (NS), pp. 437–444.
PDP-1997-WyrzykowskiKM #implementation #orthogonal #parallel: A new orthogonal version of the Gauss-Jordan algorithm and its parallel implementation (RW, JK, OM), pp. 445–452.
PPoPP-1997-FrankAV #modelling #named #parallel: LoPC: Modeling Contention in Parallel Algorithms (MF, AA, MKV), pp. 276–287.
STOC-1997-AwerbuchS #multi #online: Online Algorithms for Selective Multicast and Maximal Dense Trees (BA, TS), pp. 354–362.
STOC-1997-BartalBBT: A polylog(n)-Competitive Algorithm for Metrical Task Systems (YB, AB, CB, AT), pp. 711–719.
STOC-1997-Ben-DavidBK #composition #concept #geometry #learning #theorem: A Composition Theorem for Learning Algorithms with Applications to Geometric Concept Classes (SBD, NHB, EK), pp. 324–333.
STOC-1997-BermanC #online #problem: On-Line Algorithms for Steiner Tree Problems (PB, CC), pp. 344–353.
STOC-1997-Fill #markov: An Interruptible Algorithm for Perfect Sampling via Markov Chains (JAF), pp. 688–695.
STOC-1997-Kleinberg #nearest neighbour: Two Algorithms for Nearest-Neighbor Search in High Dimensions (JMK), pp. 599–608.
STOC-1997-OstrovskyR: Universal O(Congestion + Dilation + log1+epsilonN) Local Control Packet Switching Algorithms (RO, YR), pp. 644–653.
STOC-1997-ShmoysTA #approximate #problem: Approximation Algorithms for Facility Location Problems (DBS, ÉT, KA), pp. 265–274.
STOC-1997-SrinivasanT #approximate: A Constant-Factor Approximation Algorithm for Packet Routing, and Balancing Local vs. Global Criteria (AS, CPT), pp. 636–643.
STOC-1997-Vardy #complexity #distance #problem: Algorithmic Complexity in Coding Theory and the Minimum Distance Problem (AV), pp. 92–109.
TACAS-1997-DrechslerBR: Manipulation Algorithms for K*BMDs (RD, BB, SR), pp. 4–18.
TACAS-1997-Prasetya #self: Mechanically Verified Self-Stabilizing Hierarchical Algorithms (ISWBP), pp. 399–415.
TAPSOFT-1997-BeauquierS #model checking #problem #semantics #towards: The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages (DB, AS), pp. 201–212.
TAPSOFT-1997-MantaciM #equation: An Algorithm for the Solution of Tree Equations (SM, DM), pp. 417–428.
CADE-1997-NieuwenhuisRV #automation #data type #deduction #kernel #named #similarity: Dedan: A Kernel of Data Structures and Algorithms for Automated Deduction with Equality Clauses (RN, JMR, MÁV), pp. 49–52.
CADE-1997-YangFZ #geometry: A Practical Symbolic Algorithm for the Inverse Kinematics of 6R Manipulators with Simple Geometry (LY, HF, ZZ), pp. 73–86.
CAV-1997-Klarlund #online #refinement: An n log n Algorithm for Online BDD Refinement (NK), pp. 107–118.
ICLP-1997-TorosluK #effectiveness #maintenance #recursion: Effective Maintenance of Recursive Views: Improvements to the DRed Algorithm (IHT, FK), pp. 213–225.
ILPS-1997-AravindanB #database #performance: A Rational and Efficient Algorithm for View Deletion in Databases (CA, PB), pp. 165–179.
SIGMOD-1996-Agarwal #sorting: A Super Scalar Sort Algorithm for RISC Processors (RCA), pp. 240–246.
SIGMOD-1996-ColbyGLMT #maintenance: Algorithms for Deferred View Maintenance (LSC, TG, LL, ISM, HT), pp. 469–480.
SIGMOD-1996-FukudaMMT #2d #data mining #mining #using #visualisation: Data Mining Using Two-Dimensional Optimized Accociation Rules: Scheme, Algorithms, and Visualization (TF, YM, SM, TT), pp. 13–23.
VLDB-1996-GardarinGT #cost analysis #database #object-oriented: Cost-based Selection of Path Expression Processing Algorithms in Object-Oriented Databases (GG, JRG, ZHT), pp. 390–401.
VLDB-1996-LabioG #difference #performance: Efficient Snapshot Differential Algorithms for Data Warehousing (WL, HGM), pp. 63–74.
ITiCSE-1996-JacksonM #animation #network: Algorithm animation of neural networks (DJ, IGM), pp. 39–41.
ITiCSE-1996-Krone #analysis #data type #education #symbolic computation #using: Using symbolic computation for teaching data structures and algorithm analysis (JK), p. 230.
ITiCSE-1996-McNally #data type #education #using #visualisation: Using visualization in teaching data structures and algorithms (MFM), p. 231.
ITiCSE-1996-Naps #how #visualisation #web #why: Algorithm visualization served off the World Wide Web: why and how (TLN), pp. 66–71.
ITiCSE-1996-Velazquez-IturbideRF #development #programming #tool support: An inexpensive programming toolset for algorithm development (JÁVI, AMCR, NLF), p. 231.
ITiCSE-1996-WilsonAK #animation #comprehension #overview: Review of animation systems for algorithm understanding (JDW, RMA, IRK), pp. 75–77.
ICSM-1996-LiO #impact analysis #object-oriented: Algorithmic Analysis of the Impact of Changes to Object-Oriented Software (LL, AJO), pp. 171–184.
WCRE-1996-WoodsQ #comprehension #how #recognition #towards: Some Experiments Toward Understanding How Program Plan Recognition Algorithms Scale (SW, AQ), pp. 21–30.
WPC-1996-QuiliciW #constraints #framework #towards: Toward a Constraint-Satisfaction Framework for Evaluating Program-Understanding Algorithms (AQ, SW), p. 55–?.
ICALP-1996-AlbersM #analysis: Average Case Analyses of List Update Algorithms, with Applications to Data Compression (SA, MM), pp. 514–525.
ICALP-1996-ChakrabartiPSSSW #scheduling: Improved Scheduling Algorithms for Minsum Criteria (SC, CAP, ASS, DBS, CS, JW), pp. 646–657.
ICALP-1996-ChoiG #analysis: Lopsided Trees: Analyses, Algorithms, and Applications (VSNC, MJG), pp. 538–549.
ICALP-1996-Fernandez-BacaL #polynomial: A Polynomial-Time Algorithm for Near-Perfect Phylogeny (DFB, JL), pp. 670–680.
ICALP-1996-HenzingerT #graph: Improved Sampling with Applications to Dynamic Graph Algorithms (MRH, MT), pp. 290–299.
ICALP-1996-KoppenhagenM: Optimal Gröbner Base Algorithms for Binomial Ideals (UK, EWM), pp. 244–255.
WIA-1996-BiehlKR #automaton: Algorithms for Guided Tree Automata (MB, NK, TR), pp. 6–25.
WIA-1996-PontyZC #automaton #polynomial #regular expression: A New Quadratic Algorithm to Convert a Regular Expression into an Automaton (JLP, DZ, JMC), pp. 109–119.
FME-1996-KannikeswaranRFAW #specification #verification: Formal Specification and Verification of the pGVT Algorithm (BK, RR, PF, PA, PAW), pp. 405–424.
RTA-1996-Schmidt-Schauss #unification: An Algorithm for Distributive Unification (MSS), pp. 287–301.
IFL-1996-DebbabiFT #analysis #concurrent #control flow #higher-order #source code #type system: A Type-Based Algorithm for the Control-Flow Analysis of Higher-Order Concurrent Programs (MD, AF, NT), pp. 247–266.
IFL-1996-Serrarens #functional #implementation: Implementing the Conjugate Gradient Algorithm in a Functional Language (PRS), pp. 125–140.
CHI-1996-Eisenberg #design #interface: The Thin Glass Line: Designing Interfaces to Algorithms (ME), pp. 181–188.
CIKM-1996-HanP #mining: Background for Association Rules and Cost Estimate of Selected Mining Algorithms (JLH, AWP), pp. 73–80.
ICML-1996-Caruana #learning #multi: Algorithms and Applications for Multitask Learning (RC), pp. 87–95.
ICML-1996-FreundS: Experiments with a New Boosting Algorithm (YF, RES), pp. 148–156.
ICML-1996-GoldmanS #empirical: A Theoretical and Empirical Study of a Noise-Tolerant Algorithm to Learn Geormetric Patterns (SAG, SDS), pp. 191–199.
ICML-1996-Munos #convergence #learning: A Convergent Reinforcement Learning Algorithm in the Continuous Case: The Finite-Element Reinforcement Learning (RM), pp. 337–345.
ICML-1996-Suzuki #learning #network #performance #using: Learning Bayesian Belief Networks Based on the Minimum Description Length Principle: An Efficient Algorithm Using the B & B Technique (JS), pp. 462–470.
ICML-1996-ThrunO #learning #multi: Discovering Structure in Multiple Learning Tasks: The TC Algorithm (ST, JO), pp. 489–497.
ICPR-1996-0002NSWOEM #image: An algorithm for coronary calcification diagnosis based on helical CT images (YU, NN, HS, SW, HO, KE, NM), pp. 543–547.
ICPR-1996-AleksandrovskyWGLG #sequence: An algorithm derived from thalamocortical circuitry stores and retrieves temporal sequences (BA, JW, AG, GL, RG), pp. 550–554.
ICPR-1996-ArumugaveluR #clustering: SIMD algorithms for single link and complete link pattern clustering (SA, NR), pp. 625–629.
ICPR-1996-BakerN: Algorithms for pattern rejection (SB, SKN), pp. 869–874.
ICPR-1996-BrunnstromS #for free #search-based: Genetic algorithms for free-form surface matching (KB, AJS), pp. 689–693.
ICPR-1996-ChaiZZS #linear #search-based: Binary linear decision tree with genetic algorithm (BBC, XZ, YZ, JS), pp. 530–534.
ICPR-1996-ChanY #detection: Line detection algorithm (TsC, RKKY), pp. 126–130.
ICPR-1996-ChehadehCB #adaptation #distance #using: A skeletonization algorithm using chamfer distance transformation adapted to rectangular grids (YC, DC, PB), pp. 131–135.
ICPR-1996-ChenNANT #image #re-engineering #search-based: Reconstruction of neutron penumbral images by a constrained genetic algorithm (YWC, ZN, KA, IN, ST), pp. 525–529.
ICPR-1996-ChenNFT #image #parallel #search-based: A parallel genetic algorithm for image restoration (YWC, ZN, XF, ST), pp. 694–698.
ICPR-1996-Chetverikov #interactive #performance: Structural filtering with texture feature-based interaction maps: fast algorithm and applications (DC), pp. 795–799.
ICPR-1996-ChiuT: A feature-preserved thinning algorithm for handwritten Chinese characters (HPC, DCT), pp. 235–239.
ICPR-1996-CordellaFSV #graph #performance #using: An efficient algorithm for the inexact matching of ARG graphs using a contextual transformational model (LPC, PF, CS, MV), pp. 180–184.
ICPR-1996-FischerN #comprehension #image #parallel: A parallel any-time control algorithm for image understanding (VF, HN), pp. 141–145.
ICPR-1996-Floreby #image #multi #sequence: A multiscale algorithm for closed contour matching in image sequence (LF), pp. 884–888.
ICPR-1996-HataSKK #search-based #using: Shape extraction of transparent object using genetic algorithm (SH, YS, SK, KK), pp. 684–688.
ICPR-1996-HsiehLFK #image #performance: A fast algorithm for image registration without predetermining correspondences (JWH, HYML, KCF, MTK), pp. 765–769.
ICPR-1996-KitamuraK #generative #parallel #representation: A parallel algorithm for octree generation from polyhedral shape representation (YK, FK), pp. 303–309.
ICPR-1996-KrebsSK #3d #fuzzy #recognition: A fuzzy ICP algorithm for 3D free-form object recognition (BK, PS, BK), pp. 539–543.
ICPR-1996-Kupeev #detection #on the: On significant maxima detection: a fine-to-coarse algorithm (KYK), pp. 270–274.
ICPR-1996-LaferteHP #classification #image #multi: A multiresolution EM algorithm for unsupervised image classification (JML, FH, PP), pp. 849–853.
ICPR-1996-LeiteH: Iterative spline relaxation with the EM algorithm (JAFL, ERH), pp. 161–165.
ICPR-1996-LinT #performance #video: Fast full-search block-matching algorithm for motion-compensated video compression (YCL, SCT), pp. 914–918.
ICPR-1996-LiuD #performance: Sparse pixel tracking: a fast vectorization algorithm applied to engineering drawings (WL, DD), pp. 808–812.
ICPR-1996-LiuTHS #adaptation #documentation #geometry #segmentation: Adaptive document segmentation and geometric relation labeling: algorithms and experimental results (JL, YYT, QH, CYS), pp. 763–767.
ICPR-1996-LuoTB #fuzzy #multi: A new multilevel line-based stereo vision algorithm based on fuzzy techniques (AL, WT, HB), pp. 383–387.
ICPR-1996-MizukamiK #recognition #using: A handwritten character recognition system using hierarchical displacement extraction algorithm (YM, KK), pp. 160–164.
ICPR-1996-MukherjeePCCK #detection #image #performance: An efficient algorithm for detection of road-like structures in satellite images (AM, SKP, DC, BBC, RK), pp. 875–879.
ICPR-1996-NakanishiO #evaluation #performance #realtime: A real-time CAM-based Hough transform algorithm and its performance evaluation (MN, TO), pp. 516–521.
ICPR-1996-NamuduriRR #image #named #segmentation #slicing #using: SVBS: a high-resolution medical image compression algorithm using slicing with variable block size segmentation (KRN, NR, HR), pp. 919–923.
ICPR-1996-OhyaK #detection #image #search-based #using: Detecting facial expressions from face images using a genetic algorithm (JO, FK), pp. 649–653.
ICPR-1996-Oncina #string: The Cocke-Younger-Kasami algorithm for cyclic strings (JO), pp. 413–416.
ICPR-1996-ParagiosT #detection #using: Detection and location of moving objects using deterministic relaxation algorithms (NP, GT), pp. 201–205.
ICPR-1996-PauwelsFG #adaptation #using: Autonomous grouping of contour-segments using an adaptive region-growing algorithm (EJP, PF, LJVG), pp. 586–590.
ICPR-1996-PeiH96a #complexity #detection #symmetry: A low complexity algorithm for detecting rotational symmetry based on the Hough transform technique (SCP, JHH), pp. 492–496.
ICPR-1996-PhillipsHD #performance #process #recognition: An efficient registration and recognition algorithm via sieve processes (PJP, JH, SMD), pp. 775–779.
ICPR-1996-PhillipsVDBS #automation: An automatic MR-PET registration algorithm (PJP, YV, SMD, MSB, JLSC), pp. 533–537.
ICPR-1996-SaitoM #image #modelling #multi #search-based #using: Object modeling from multiple images using genetic algorithms (HS, MM), pp. 669–673.
ICPR-1996-SakanoKM #image #search-based: Seeing the character images that an OCR system sees-analysis by genetic algorithm (HS, HK, NM), pp. 411–416.
ICPR-1996-SanchizQP #detection: A neural network-based algorithm to detect dominant points from the chain-code of a contour (JMS, JMIQ, FP), pp. 325–329.
ICPR-1996-SatohO #comparison #detection: Occlusion detectable stereo-systematic comparison of detection algorithms (KS, YO), pp. 280–286.
ICPR-1996-ShekharKCT #integration #knowledge-based: Knowledge-based integration of IU algorithms (CS, SK, RC, MT), pp. 599–605.
ICPR-1996-ShioyamaH #2d #recognition: Recognition algorithm for handprinted Chinese characters by 2D-FFT (TS, JH), pp. 225–229.
ICPR-1996-SzeL #bound #branch #classification: Branch and bound algorithm for the Bayes classifier (LS, CHL), pp. 705–709.
ICPR-1996-TanakaI #modelling #principle #statistics: Statistical-mechanical algorithm in MRF model based on variational principle (KT, MI), pp. 381–388.
ICPR-1996-TeixeiraA #video: Block matching algorithms in MPEG video coding (LMLT, APA), pp. 934–938.
ICPR-1996-TianT96a #3d #image #search-based #sequence #using: 3D shape recovery from two-color image sequences using a genetic algorithm (YlT, HTT), pp. 674–678.
ICPR-1996-WangF #analysis #overview #pattern matching #pattern recognition #recognition #search-based: Applying genetic algorithms on pattern recognition: an analysis and survey (YKW, KCF), pp. 740–744.
ICPR-1996-WangF96a #detection #geometry #search-based: Detection of geometric shapes by the combination of genetic algorithm and subpixel accuracy (YW, NF), pp. 535–539.
ICPR-1996-YuY #image #performance: An efficient algorithm for smoothing binary image contours (DY, HY), pp. 403–407.
ICPR-1996-ZhangW #parallel: A parallel thinning algorithm with two-subiteration that generates one-pixel-wide skeletons (EYYZ, PSPW), pp. 457–461.
ICPR-1996-ZhaNN #3d #image #modelling #recognition #using: 3-D object recognition from range images by using a model-based Hopfield-style matching algorithm (HZ, HN, TN), pp. 111–116.
ICPR-1996-ZongkerJ #evaluation #feature model: Algorithms for feature selection: An evaluation (DEZ, AKJ), pp. 18–22.
KDD-1996-EsterKSX #clustering #database #scalability: A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise (ME, HPK, JS, XX), pp. 226–231.
KDD-1996-MongeE #problem: The Field Matching Problem: Algorithms and Applications (AEM, CE), pp. 267–270.
KR-1996-Ginsberg #generative: A New Algorithm for Generative Planning (MLG), pp. 186–197.
SEKE-1996-GuilfoyleHSB #implementation #knowledge base: Implementation of Selected Data/Knowledge-Base Algorithms on a Digital Optoelectronic Processor (PSG, JMH, RVS, PBB), pp. 571–576.
SIGIR-1996-LewisSCP #classification #linear: Training Algorithms for Linear Text Classifiers (DDL, RES, JPC, RP), pp. 298–306.
SAS-1996-PueblaH #analysis #incremental #logic programming #source code: Optimized Algorithms for Incremental Analysis of Logic Programs (GP, MVH), pp. 270–284.
SAS-1996-SchoenigD #prolog #slicing: A Backward Slicing Algorithm for Prolog (SS, MD), pp. 317–331.
KBSE-1996-Darche #automation #difference #generative #set: Set Differentiation: A Method for the Automatic Generation of Filtering Algorithms (FDD), p. 19.
KBSE-1996-Jr.B #algebra #synthesis: Synthesis of Local Search Algorithms by Algebraic Means (RPGJ, PDB), p. 7.
KBSE-1996-QuiliciYW #comprehension #recognition: Applying Plan Recognition Algorithms to Program Understanding (AQ, QY, SW), p. 15.
SAC-1996-AbualiWS #design #problem #search-based #set #using: Solving the subset interconnection design problem using genetic algorithms (FNA, RLW, DAS), pp. 299–304.
SAC-1996-BedarhallyPC #approach #product line #search-based: A family elitist approach in genetic algorithms (PVB, RAP, WSC), pp. 238–244.
SAC-1996-ChenH #multi #realtime: Threshold-based dynamic admission control algorithms for real-time multimedia servers (IRC, THH), pp. 224–229.
SAC-1996-CorcoranW #search-based: Reducing disruption of superior building blocks in genetic algorithms (ALC, RLW), pp. 269–276.
SAC-1996-DurandAN #automation #search-based #using: Automatic aircraft conflict resolution using genetic algorithms (ND, JMA, JN), pp. 289–298.
SAC-1996-HoeltingSW #network #search-based #using: Finding investigator tours in telecommunication networks using genetic algorithms (CJH, DAS, RLW), pp. 82–87.
SAC-1996-HoeltingSW96a #precedence #problem #search-based #using: A genetic algorithm for the minimum broadcast time problem using a global precedence vector (CJH, DAS, RLW), pp. 258–262.
SAC-1996-HurleyTS #comparison #problem: A comparison of local search algorithms for radio link frequency assignment problems (SH, SUT, DHS), pp. 251–257.
SAC-1996-Julstom #representation #search-based: Representing rectilinear Steiner trees in genetic algorithms (BAJ), pp. 245–250.
SAC-1996-LiuC #distributed #heuristic #query: A heuristic algorithm for partition strategy in distributed query processing (CL, HC), pp. 196–200.
SAC-1996-MerkleGLGP #energy #hybrid #search-based: Hybrid genetic algorithms for polypeptide energy minimization (LDM, RLG, GBL, GHGJ, RP), pp. 305–311.
SAC-1996-Neubauer #adaptation #search-based: Genetic algorithms for non-linear adaptive filters in digital signal processing (AN), pp. 519–522.
SAC-1996-Pham #fuzzy #modelling #search-based: Genetic algorithm for fuzzy modeling of robotic manipulators (TTP), pp. 600–604.
SAC-1996-SohHHO #automation #distributed: Decentralized routing algorithms for automated guided vehicles (JTLS, WJH, SYH, ACYO), pp. 473–479.
DAC-1996-BamjiM #network #optimisation: Enhanced Network Flow Algorithm for Yield Optimization (CB, EM), pp. 746–751.
DAC-1996-BasaranR #constraints #performance: An O(n) Algorithm for Transistor Stacking with Performance Constraints (BB, RAR), pp. 221–226.
DAC-1996-BinhISH #clustering #design #hardware #pipes and filters: A Hardware/Software Partitioning Algorithm for Designing Pipelined ASIPs with Least Gate Counts (NNB, MI, AS, NH), pp. 527–532.
DAC-1996-ChenH #approximate #performance: Efficient Approximation Algorithms for Floorplan Area Minimization (DZC, XH), pp. 483–486.
DAC-1996-ChenS #power management: An Exact Algorithm for Low Power Library-Specific Gate Re-Sizing (DSC, MS), pp. 783–788.
DAC-1996-CoudertHM #case study #comparative: New Algorithms for Gate Sizing: A Comparative Study (OC, RWH, SM), pp. 734–739.
DAC-1996-HiguchiM #finite #performance #reduction #state machine: A Fast State Reduction Algorithm for Incompletely Specified Finite State Machines (HH, YM), pp. 463–466.
HPDC-1996-BotorogK #distributed #imperative #named #performance #programming: Skil: An Imperative Language with Algorithmic Skeletons for Efficient Distributed Programming (GHB, HK), pp. 243–252.
HPDC-1996-DincerFH #fortran: High-Performance Fortran and Possible Extensions to Support Conjugate Gradient Algorithms (KD, GF, KAH), pp. 69–77.
HPDC-1996-Fang #parallel: Engineering Parallel Algorithms (NF), pp. 233–242.
HPDC-1996-KumarSSG #distributed #problem #robust #search-based: Robust and Distributed Genetic Algorithm for Ordering Problems (AK, AS, AS, RKG), pp. 253–262.
HPDC-1996-LuO #parallel #performance: A Massively Parallel Fast Multipole Algorithm in Three Dimensions (EJLL, DIO), pp. 40–48.
HPDC-1996-PoppPBG #parallel: Multitarget Tracking Algorithm Parallelization for Distributed-Memory Computing Systems (RLP, KRP, YBS, RRG), pp. 412–421.
PDP-1996-MendivilFVG #concurrent #distributed #liveness: Liveness Conditions for a Safe Distributed Deadlock Resolution Algorithm (JRGdM, FF, JEV, JRG), pp. 139–146.
PDP-1996-RiedlR #classification: Classification of Load Distribution Algorithms (RR, LR), pp. 404–413.
PDP-1996-SanchezBT #approach #parallel #simulation: Deblocking Event Algorithm: A New Approach to Conservative Parallel Discrete Event Simulation (VS, AB, FT), pp. 510–517.
ESOP-1996-FradetCM #axiom #detection #fault #pointer #static analysis: Static Detection of Pointer Errors: An Axiomatisation and a Checking Algorithm (PF, RC, DLM), pp. 125–140.
STOC-1996-AfekMO #complexity #convergence: Convergence Complexity of Optimistic Rate Based Flow Control Algorithms (YA, YM, ZO), pp. 89–98.
STOC-1996-AspnesW #composition #distributed: Modular Competitiveness for Distributed Algorithms (JA, OW), pp. 237–246.
STOC-1996-BlumRV #approximate #problem: A Constant-factor Approximation Algorithm for the k MST Problem (AB, RR, SV), pp. 442–448.
STOC-1996-CheriyanT #performance: Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation (JC, RT), pp. 37–46.
STOC-1996-CleggEI #proving #satisfiability #using: Using the Groebner Basis Algorithm to Find Proofs of Unsatisfiability (MC, JE, RI), pp. 174–183.
STOC-1996-CypherHSV: Universal Algorithms for Store-and-Forward and Wormhole Routing (RC, FMadH, CS, BV), pp. 356–365.
STOC-1996-DeyG: Algorithms for Manifolds and Simplicial Complexes in Euclidean 3-Space (TKD, SG), pp. 398–407.
STOC-1996-DimitriouI #analysis #optimisation #towards: Towards an Analysis of Local Optimization Algorithms (TD, RI), pp. 304–313.
STOC-1996-FarachK #evolution #performance: Efficient Algorithms for Inverting Evolution (MF, SK), pp. 230–236.
STOC-1996-Grover #database #performance #quantum: A Fast Quantum Mechanical Algorithm for Database Search (LKG), pp. 212–219.
STOC-1996-Karloff #how #question: How Good is the Goemans-Williamson MAX CUT Algorithm? (HJK), pp. 427–434.
STOC-1996-KearnsM #learning #on the #top-down: On the Boosting Ability of Top-Down Decision Tree Learning Algorithms (MJK, YM), pp. 459–468.
STOC-1996-KleinL #approximate #performance #source code: Efficient Approximation Algorithms for Semidefinite Programs Arising from MAX CUT and COLORING (PNK, HIL), pp. 338–347.
STOC-1996-McCormick #parametricity #performance #scheduling: Fast Algorithms for Parametric Scheduling Come from Extensions to Parametric Maximum Flow (STM), pp. 319–328.
STOC-1996-Slavik #analysis #set: A Tight Analysis of the Greedy Algorithm for Set Cover (PS), pp. 435–441.
TACAS-1996-EsparzaRV: An Improvement of McMillan’s Unfolding Algorithm (JE, SR, WV), pp. 87–106.
CADE-1996-GiacomoM #logic: Tableaux and Algorithms for Propositional Dynamic Logic with Converse (GDG, FM), pp. 613–627.
CADE-1996-HermannK #polynomial #unification: Unification Algorithms Cannot be Combined in Polynomial Time (MH, PGK), pp. 246–260.
CADE-1996-Sengler #data type #termination: Termination of Algorithms over Non-freely Generated Data Types (CS), pp. 121–135.
CAV-1996-Baier #bisimulation #polynomial #probability #simulation #testing: Polynomial Time Algorithms for Testing Probabilistic Bisimulation and Simulation (CB), pp. 50–61.
CAV-1996-ClarkeGZ #proving #theorem proving #using #verification: Verifying the SRT Division Algorithm Using Theorem Proving Techniques (EMC, SMG, XZ), pp. 111–122.
CAV-1996-PistoreS #refinement #π-calculus: A Partition Refinement Algorithm for the π-Calculus (MP, DS), pp. 38–49.
CAV-1996-PnueliS #deduction #framework #platform #verification: A Platform for Combining Deductive with Algorithmic Verification (AP, ES), pp. 184–195.
JICSLP-1996-LhommeGRT: Boosting the Interval Narrowing Algorithm (OL, AG, MR, PT), pp. 378–392.
LICS-1996-DegtyarevMV #problem: Simultaneous E-Unification and Related Algorithmic Problems (AD, YM, AV), pp. 494–502.
ICDAR-v1-1995-ChangCPS: A line sweep thinning algorithm (FC, YPC, TP, TYS), pp. 227–230.
ICDAR-v1-1995-FangH #approach #recognition #testing #using #word: A hypothesis testing approach to word recognition using an A* search algorithm (CF, JJH), pp. 360–363.
ICDAR-v1-1995-TanahashiSY #image #search-based #using: Recovering decorative patterns of ceramic objects from a monocular image using a genetic algorithm (HT, KS, KY), pp. 339–342.
ICDAR-v1-1995-ZhaoS #image #multi #recognition #word: A word recognition algorithm for machine-printed word images of multiple fonts and varying qualities (SXZ, SNS), pp. 351–354.
ICDAR-v2-1995-ChangKRKK #detection #documentation #image: Improved binarization algorithm for document image by histogram and edge detection (MSC, SMK, WSR, HGK, DJK), pp. 636–639.
ICDAR-v2-1995-KimuraMS #recognition #using #word: Handwritten ZIP code recognition using lexicon free word recognition algorithm (FK, YM, MS), pp. 906–910.
ICDAR-v2-1995-LiD95a #recognition: A personal handwritten Chinese character recognition algorithm based on the generalized Hough transform (ML, RWD), pp. 828–831.
ICDAR-v2-1995-Likforman-SulemHF #documentation: A Hough based algorithm for extracting text lines in handwritten documents (LLS, AH, CF), pp. 774–777.
ICDAR-v2-1995-Smith #detection #performance: A simple and efficient skew detection algorithm via text row accumulation (RS), pp. 1145–1148.
ICDAR-v2-1995-SylwesterS #segmentation: A trainable, single-pass algorithm for column segmentation (DS, SCS), pp. 615–618.
SIGMOD-1995-FaloutsosL #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.
SIGMOD-1995-ParkCY #effectiveness #mining: An Effective Hash Based Algorithm for Mining Association Rules (JSP, MSC, PSY), pp. 175–186.
SIGMOD-1995-ShatdalN #adaptation #parallel: Adaptive Parallel Aggregation Algorithms (AS, JFN), pp. 104–114.
VLDB-1995-SavasereON #database #mining #performance #scalability: An Efficient Algorithm for Mining Association Rules in Large Databases (AS, EO, SBN), pp. 432–444.
ICSM-1995-CanforaC #dependence #graph: Algorithms for program dependence graph production (GC, AC), p. 157–?.
ICALP-1995-AulettaPP: Placing Resources in a Tree: Dynamic and Static Algorithms (VA, DP, GP), pp. 232–243.
ICALP-1995-BodlaenderH #bound #parallel: Parallel Algorithms with Optimal Speedup for Bounded Treewidth (HLB, TH), pp. 268–279.
ICALP-1995-Chen #set #string: NC Algorithms for Finding a Maximal Set of Paths with Application to Compressing Strings (ZZC), pp. 99–110.
ICALP-1995-CorneilOS #graph #linear: Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs (DGC, SO, LS), pp. 292–302.
ICALP-1995-GiancarloG #matrix #on the: On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications (RG, RG), pp. 111–122.
ICALP-1995-GolinR #programming: A Dynamic Programming Algorithm for Constructing Optimal Refix-Free Codes for Unequal Letter Costs (MJG, GR), pp. 256–267.
RTA-1995-Senizergues #confluence #polynomial #testing: A Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue Systems (GS), pp. 194–209.
AFP-1995-Launchbury95 #functional #graph: Graph Algorithms with a Functional Flavous (JL), pp. 308–331.
CHI-1995-ShardanandM #automation #information management #social #word: Social Information Filtering: Algorithms for Automating “Word of Mouth” (US, PM), pp. 210–217.
CIKM-1995-ElmagarmidJB #mobile #performance #reliability #transaction: An Efficient and Reliable Reservation Algorithm for Mobile Transactions (AKE, JJ, OAB), pp. 90–95.
CIKM-1995-ParkST #concurrent #detection #distributed #generative #graph #hybrid: A Distributed Deadlock Detection and Resolution Algorithm Based on A Hybrid Wait-for Graph and Probe Generation Scheme (YCP, PS, HLT), pp. 378–386.
ICML-1995-AbeLN #2d #learning #online #using: On-line Learning of Binary Lexical Relations Using Two-dimensional Weighted Majority Algorithms (NA, HL, AN), pp. 3–11.
ICML-1995-Baird #approximate #learning: Residual Algorithms: Reinforcement Learning with Function Approximation (LCBI), pp. 30–37.
ICML-1995-BalujaC #search-based #standard: Removing the Genetics from the Standard Genetic Algorithm (SB, RC), pp. 38–46.
ICML-1995-Blum #empirical #scheduling: Empirical Support for Winnow and Weighted-Majority Based Algorithms: Results on a Calendar Scheduling Domain (AB), pp. 64–72.
ICML-1995-Cussens #analysis #finite #learning: A Bayesian Analysis of Algorithms for Learning Finite Functions (JC), pp. 142–149.
ICML-1995-FultonKS #multi #performance: Efficient Algorithms for Finding Multi-way Splits for Decision Trees (TF, SK, SS), pp. 244–251.
ICML-1995-Littlestone #learning: Comparing Several Linear-threshold Learning Algorithms on Tasks Involving Superfluous Attributes (NL), pp. 353–361.
ICML-1995-SinghP #classification #comparison #induction: A Comparison of Induction Algorithms for Selective and non-Selective Bayesian Classifiers (MS, GMP), pp. 497–505.
KDD-1995-AugierVK #first-order #learning #logic #search-based: Learning First Order Logic Rules with a Genetic Algorithm (SA, GV, YK), pp. 21–26.
KDD-1995-HwangF #induction #performance: Efficient Algorithms for Attribute-Oriented Induction (HYH, AWCF), pp. 168–173.
ECOOP-1995-Agesen #morphism #parametricity #polymorphism #precise #type inference: The Cartesian Product Algorithm: Simple and Precise Type Inference Of Parametric Polymorphism (OA), pp. 2–26.
ECOOP-1995-SeligmannG #garbage collection #incremental #maturity #using: Incremental Mature Garbage Collection Using the Train Algorithm (JS, SG), pp. 235–252.
LOPSTR-1995-Gregory #concurrent: Derivation of Concurrent Algorithms in Tempo (SG), pp. 46–60.
POPL-1995-BrookesD #parallel: Sequential Algorithms, Deterministic Parallelism, and Intensional Expressiveness (SDB, DD), pp. 13–24.
POPL-1995-KingL #haskell: Structuring Depth-First Search Algorithms in Haskell (DJK, JL), pp. 344–354.
POPL-1995-SchauserCG #clustering #constraints #source code #strict #thread: Separation Constraint Partitioning — A New Algorithm for Partitioning Non-strict Programs into Sequential Threads (KES, DEC, SCG), pp. 259–271.
POPL-1995-SreedharG #linear: A Linear Time Algorithm for Placing phi-nodes (VCS, GRG), pp. 62–73.
KBSE-1995-DickS: Searching for a Global Algorithm (SD, TS), pp. 52–59.
SAC-1995-AbualiWS95a #morphism #problem #search-based #using: Solving the three-star tree isomorphism problem using genetic algorithms (FNA, RLW, DAS), pp. 337–344.
SAC-1995-ChenH #analysis #concurrent #database #performance: Performance analysis of a periodic data reorganization algorithm for concurrent B-trees in database systems (IRC, SH), pp. 40–45.
SAC-1995-CrawfordVW #detection #multi #search-based #using: Detecting multiple outliers in regression data using genetic algorithms (KDC, DJV, RLW), pp. 351–356.
SAC-1995-Gibson #data type #multi #optimisation #problem #search-based: A genetic algorithm for optimizing problems with multiple disparate data types (GMG), pp. 300–304.
SAC-1995-GrimRP #3d #re-engineering #search-based #using: Use of genetic algorithms in three-dimensional reconstruction in carbon black aggregates (RJG, JRR, LDP), pp. 288–292.
SAC-1995-HalgamugeBG #classification #comparison #generative #heuristic #rule-based #search-based: Comparison of a heuristic method with a genetic algorithm for generation of compact rule based classifiers (SKH, AB, MG), pp. 580–585.
SAC-1995-Hendrickson #lr #parallel #parsing: A new parallel LR parsing algorithm (KJH), pp. 277–281.
SAC-1995-JengL: Optimal hypercube algorithms for robot configuration space computation (JFFJ, WNL), pp. 182–186.
SAC-1995-Julstrom #problem #search-based: Very greedy crossover in a genetic algorithm for the traveling salesman problem (BAJ), pp. 324–328.
SAC-1995-KrishnaKumarS #fuzzy #modelling #multi #using: Discovering multiple fuzzy models using the EFMCN algorithm (KK, AS), pp. 537–541.
SAC-1995-KumblaJB #fuzzy #implementation #logic #network #using: Implementation of fuzzy logic and neural networks control algorithm using a digital signal processing chip (KKK, MJ, JBR), pp. 524–528.
SAC-1995-Li #optimisation #performance #set: An efficient algorithm for computing a minimum node cutset from a vertex-disjoint path set for timing optimization (WNL), pp. 56–60.
SAC-1995-LiangL #matrix #representation #scheduling #search-based #using: A sparse matrix representation for production scheduling using genetic algorithms (SJTL, JML), pp. 313–317.
SAC-1995-LuoD #matrix #parallel #scalability: A scalable parallel Strassen’s matrix multiplication algorithm for distributed-memory computers (QL, JBD), pp. 221–226.
SAC-1995-MooneyGBW #adaptation: Computer algorithm for adaptive extraction of fetal cardiac electrical signal (DMM, LJG, LSB, JDW), pp. 113–117.
SAC-1995-RunklerG #multi #performance #set: Multidimensional defuzzification — fast algorithms for the determination of crisp characteristic subsets (TAR, MG), pp. 575–579.
SAC-1995-SmithDS #inheritance #search-based: Fitness inheritance in genetic algorithms (RES, BAD, SAS), pp. 345–350.
SAC-1995-ThuenteS #hybrid #problem #programming #search-based: Mathematical programming in a hybrid genetic algorithm for Steiner point problems (DJT, PS), pp. 357–363.
DAC-1995-AlexanderR: New Performance-Driven FPGA Routing Algorithms (MJA, GR), pp. 562–567.
DAC-1995-ChangMC #performance #set: An Efficient Algorithm for Local Don’t Care Sets Calculation (SCC, MMS, KTC), pp. 663–667.
DAC-1995-DeCastelo-Vide-e-SouzaPP #approach #architecture #optimisation #throughput #using: Optimal ILP-Based Approach for Throughput Optimization Using Simultaneous Algorithm/Architecture Matching and Retiming (YGDVeS, MP, ACP), pp. 113–118.
DAC-1995-FeldmannF #linear #modelling #scalability: Reduced-Order Modeling of Large Linear Subcircuits via a Block Lanczos Algorithm (PF, RWF), pp. 474–479.
DAC-1995-KruiskampL #named #search-based #synthesis: DARWIN: CMOS Opamp Synthesis by Means of a Genetic Algorithm (WK, DL), pp. 433–438.
DAC-1995-LeeT #analysis #incremental: An Algorithm for Incremental Timing Analysis (JfL, DTT), pp. 696–701.
DAC-1995-WalkerG #distributed #execution #parallel #simulation: Asynchronous, Distributed Event Driven Simulation Algorithm for Execution of VHDL on Parallel Processors (PAW, SG), pp. 144–150.
DAC-1995-WurthEA #composition #functional #multi: Functional Multiple-Output Decomposition: Theory and an Implicit Algorithm (BW, KE, KA), pp. 54–59.
HPDC-1995-JacobL #performance #recursion #refinement: A Spanning Tree Based Recursive Refinement Algorithm for Fast Task Mapping (JCJ, SYL), pp. 58–65.
HPDC-1995-RankinB #distributed #implementation #parallel: A Portable Distributed Implementation of the Parallel Multipole Tree Algorithm (WTR, JABJ), pp. 17–22.
PDP-1995-AnconaB #documentation #parallel #segmentation: A parallel algorithm for “document segmentation” (MA, MDB), pp. 516–521.
PDP-1995-ColiP95a #adaptation #concurrent: An adaptive deadlock and livelock free routing algorithm (MC, PP), pp. 288–295.
PDP-1995-DionRR #array #scheduling: Resource-constrained scheduling of partitioned algorithms on processor arrays (MD, TR, YR), pp. 571–580.
PDP-1995-GaiRR #parallel #using: An improved data parallel algorithm for Boolean function manipulation using BDDs (SG, MR, MSR), pp. 33–41.
PDP-1995-GuarracinoP #architecture #distributed #memory management #parallel: A parallel modified block Lanczos’ algorithm for distributed memory architectures (MRG, FP), pp. 424–431.
PDP-1995-MendivilDBG #concurrent #correctness #distributed: Correctness of a distributed deadlock resolution algorithm for the single request model (JRGdM, AD, JMBA, JRG), pp. 254–261.
PDP-1995-OBoyle #compilation #locality: A hierarchical locality algorithm for NUMA compilation (MFPO), pp. 106–113.
PDP-1995-Ralha #matrix #parallel #symmetry: Parallel QR algorithm for the complete eigensystem of symmetric matrices (RMSR), pp. 480–485.
PDP-1995-StuartW #data type #named #parallel #prototype #visual notation: PAVE: parallel algorithms visually explored, a prototype tool for the investigation of data structures in parallel numerical iterative algorithms (EJS, JSW), pp. 522–528.
PDP-1995-ZhouB #implementation #on the #parallel: On parallel implementation of the one-sided Jacobi algorithm for singular value decompositions (BBZ, RPB), pp. 401–408.
PPoPP-1995-BaderJ #case study #component #image #parallel: Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study (DAB, JJ), pp. 123–133.
PPoPP-1995-KennedyNS #linear #memory management #sequence #source code: A Linear-Time Algorithm for Computing the Memory Access Sequence in Data-Parallel Programs (KK, NN, AS), pp. 102–111.
PPoPP-1995-WisniewskiKS #multi #performance: High Performance Synchronization Algorithms for Multiprogrammed Multiprocessors (RWW, LIK, MLS), pp. 199–206.
STOC-1995-CzumajGGPP #parallel #problem #string: Work-time-optimal parallel algorithms for string problems (AC, ZG, LG, KP, WP), pp. 713–722.
STOC-1995-DiaconisS #question #what: What do we know about the Metropolis algorithm? (PD, LSC), pp. 112–129.
STOC-1995-GhoshLMMPRRTZ #analysis: Tight analyses of two local load balancing algorithms (BG, FTL, BMM, SM, CGP, RR, AWR, RET, DZ), pp. 548–558.
STOC-1995-HannenhalliP #permutation #polynomial #sorting: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals (SH, PAP), pp. 178–189.
STOC-1995-HenzingerK #graph #random: Randomized dynamic graph algorithms with polylogarithmic time per operation (MRH, VK), pp. 519–527.
STOC-1995-KhullerR #approximate #problem: Improved approximation algorithms for uniform connectivity problems (SK, BR), pp. 1–10.
STOC-1995-Pan #approximate #parallel #polynomial: Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros (VYP), pp. 741–750.
TAPSOFT-1995-BadouelBD #bound #polynomial #synthesis: Polynomial Algorithms for the Synthesis of Bounded Nets (EB, LB, PD), pp. 364–378.
CAV-1995-HenzingerH #analysis #hybrid: Algorithmic Analysis of Nonlinear Hybrid Systems (TAH, PHH), pp. 225–238.
CAV-1995-JonssonK #distributed #infinity #safety #verification: Verifying Safety Properties of a Class of Infinite-State Distributed Algorithms (BJ, LK), pp. 42–53.
ICLP-1995-Brand #graph: A Decision Graph Algorithm for CCP Languages (PB), pp. 433–447.
ICLP-1995-HeintzeJ #analysis: A Generic Algorithm for CLP Analysis (NH, JJ), pp. 49–63.
ILPS-1995-SorensenG #supercompilation: An Algorithm of Generalization in Positive Supercompilation (MHS, RG), pp. 465–479.
PODS-1994-SuciuP #algebra #exponential #set #transitive: Any Algorithm in the Complex Object Algebra with Powerset Needs Exponential Space to Compute Transitive Closure (DS, JP), pp. 201–209.
SIGMOD-1994-DarR #performance #transitive: A Performance Study of Transitive Closure Algorithms (SD, RR), pp. 454–465.
VLDB-1994-AgrawalS #database #mining #performance #scalability: Fast Algorithms for Mining Association Rules in Large Databases (RA, RS), pp. 487–499.
VLDB-1994-HasanM #optimisation #parallel #pipes and filters #trade-off: Optimization Algorithms for Exploiting the Parallelism-Communication Tradeoff in Pipelined Parallelism (WH, RM), pp. 36–47.
VLDB-1994-JohnsonS #named #performance: 2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm (TJ, DS), pp. 439–450.
VLDB-1994-SetzerZ #concurrent: New Concurrency Control Algorithms for Accessing and Compacting B-Trees (VWS, AZ), pp. 238–248.
VLDB-1994-ShatdalKN #query #relational: Cache Conscious Algorithms for Relational Query Processing (AS, CK, JFN), pp. 510–521.
ICALP-1994-BirgetMMW #problem: PSPACE-Completeness of Certain Algorithmic Problems on the Subgroups of Free Groups (JCB, SWM, JCM, PW), pp. 274–285.
ICALP-1994-Feige #graph #performance #random: A Fast Randomized LOGSPACE Algorithm for Graph Connectivity (UF), pp. 499–507.
ICALP-1994-HariharanM #parallel: Optimal Parallel Algorithms for Prefix Matching (RH, SM), pp. 203–214.
LFP-1994-KfouryW #higher-order #type inference #λ-calculus: A Direct Algorithm for Type Inference in the Rank-2 Fragment of the Second-Order λ-Calculus (AJK, JBW), pp. 196–207.
CIKM-1994-ChenH #graph #linear #source code #traversal: An Optimal Graph Traversal Algorithm for Evaluating Linear Binary-Chain Programs (YC, TH), pp. 34–41.
CIKM-1994-Rundensteiner #classification #object-oriented: A Classification Algorithm for Supporting Object-Oriented Views (EAR), pp. 18–25.
ICML-1994-DruckerCJCV #machine learning: Boosting and Other Machine Learning Algorithms (HD, CC, LDJ, YL, VV), pp. 53–61.
ICML-1994-GiordanaSZ #concept #learning #search-based: Learning Disjunctive Concepts by Means of Genetic Algorithms (AG, LS, FZ), pp. 96–104.
ICML-1994-KietzL #induction #logic programming #performance: An Efficient Subsumption Algorithm for Inductive Logic Programming (JUK, ML), pp. 130–138.
ICML-1994-MooreL #fault #performance #validation: Efficient Algorithms for Minimizing Cross Validation Error (AWM, MSL), pp. 190–198.
ICML-1994-SchapireW #analysis #learning #on the #worst-case: On the Worst-Case Analysis of Temporal-Difference Learning Algorithms (RES, MKW), pp. 266–274.
ICML-1994-Sebag #constraints #induction: A Constraint-based Induction Algorithm in FOL (MS), pp. 275–283.
ICML-1994-Skalak #feature model #prototype #random: Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms (DBS), pp. 293–301.
ICML-1994-Utgoff #incremental #induction: An Improved Algorithm for Incremental Induction of Decision Trees (PEU), pp. 318–325.
KDD-1994-GregoryC #modelling: Two Algorithms for Inducing Causal Models from Data (DEG, PRC), pp. 73–84.
KDD-1994-MannilaTV #performance: Efficient Algorithms for Discovering Association Rules (HM, HT, AIV), pp. 181–192.
KR-1994-Ben-EliyahuP #modelling #performance #reasoning: Reasoning with Minimal Models: Efficient Algorithms and Applications (RBE, LP), pp. 39–50.
KR-1994-Kambhampati #framework #refinement: Refinement Search as a Unifying Framework for Analyzing Planning Algorithms (SK), pp. 329–340.
KR-1994-Konolige #problem: Easy to be Hard: Difficult Problems for Greedy Algorithms (KK), pp. 374–378.
SEKE-1994-ReynoldsZ #learning #using: Learning to understand software from examples using cultural algorithms (RGR, EZ), pp. 188–192.
SIGIR-1994-LewisG #classification: A Sequential Algorithm for Training Text Classifiers (DDL, WAG), pp. 3–12.
SIGIR-1994-Paice #evaluation: An Evaluation Method for Stemming Algorithms (CDP), pp. 42–50.
POPL-1994-HankinM #analysis #strict #type inference: Deriving Algorithms From Type Inference Systems: Application to Strictness Analysis (CH, DLM), pp. 202–212.
POPL-1994-RamalingamR #incremental #maintenance: An Incremental Algorithm for Maintaining the Dominator Tree of a Reducible Flowgraph (GR, TWR), pp. 287–296.
SAC-1994-AbualiSW #design #network #probability #search-based #using: Designing telecommunications networks using genetic algorithms and probabilistic minimum spanning trees (FNA, DAS, RLW), pp. 242–246.
SAC-1994-CorcoranH #database #distributed #search-based: A genetic algorithm for fragment allocation in a distributed database system (ALC, JH), pp. 247–250.
SAC-1994-CorcoranW #parallel #problem #scheduling #search-based: A parallel island model genetic algorithm for the multiprocessor scheduling problem (ALC, RLW), pp. 483–487.
SAC-1994-FlachsbartBCH #classification #using: Using the ID3 symbolic classification algorithm to reduce data density (BF, WEB, DCSC, JH), pp. 292–296.
SAC-1994-GordonBW #performance #problem #search-based: A note on the performance of genetic algorithms on zero-one knapsack problems (VSG, APWB, DW), pp. 194–195.
SAC-1994-GordonMW #locality #search-based: Cellular genetic algorithms as function optimizers: locality effects (VSG, KEM, DW), pp. 237–241.
SAC-1994-Janikow #fuzzy #learning #search-based: A genetic algorithm for learning fuzzy controllers (CZJ), pp. 232–236.
SAC-1994-Julstrom #performance #problem #search-based: Seeding the population: improved performance in a genetic algorithm for the rectilinear Steiner problem (BAJ), pp. 222–226.
SAC-1994-KarunanithiC #search-based: A ring loading application of genetic algorithms (NK, TC), pp. 227–231.
SAC-1994-Khuri #search-based: Walsh and Haar functions in genetic algorithms (SK), pp. 201–205.
SAC-1994-KhuriBH #multi #problem #search-based: The zero/one multiple knapsack problem and genetic algorithms (SK, TB, JH), pp. 188–193.
SAC-1994-Konstam #classification #search-based #using: N-group classification using genetic algorithms (AHK), pp. 212–216.
SAC-1994-LogarCWWW #image #recognition: A don’t care back propagation algorithm applied to satellite image recognition (AML, EMC, SW, RW, RW), pp. 369–373.
SAC-1994-MerkleL #analysis #parallel #performance #search-based: An initial analysis of data parallelism in the fast messy genetic algorithm (LDM, GBL), pp. 488–492.
SAC-1994-RayJD #array #graph #linear #parallel: A parallel algorithm for mapping a special class of task graphs onto linear array multiprocessors (SR, HJ, JSD), pp. 473–477.
SAC-1994-Sabharwal #implementation #performance: A fast implementation of surface/surface intersection algorithm (CLS), pp. 333–337.
SAC-1994-VaradarajanH #adaptation #performance #refinement: An efficient dynamic load balancing algorithm for adaptive mesh refinement (RV, IH), pp. 467–472.
SAC-1994-WarwickT #problem #search-based #using: Using a genetic algorithm to tackle the processors configuration problem (TW, EPKT), pp. 217–221.
SAC-1994-WooR #parallel: Unordered parallel distance-1 and distance-2 FFT algorithms of radix 2 and (4-2) (MlW, RAR), pp. 504–509.
SAC-1994-XiaoW #search-based #using: Molecular docking using genetic algorithms (YLX, DEW), pp. 196–200.
ASPLOS-1994-LimA #multi: Reactive Synchronization Algorithms for Multiprocessors (BHL, AA), pp. 25–35.
ASPLOS-1994-SkeppstedtS #compilation #protocol: Simple Compiler Algorithms to Reduce Ownership Operhead in Cache Coherence Protocols (JS, PS), pp. 286–296.
DAC-1994-AloqeelyC #synthesis: Sequencer-Based Data Path Synthesis of Regular Iterative Algorithms (MA, CYRC), pp. 155–160.
DAC-1994-BuiM #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.
DAC-1994-ChakradharBA: An Exact Algorithm for Selecting Partial Scan Flip-Flops (STC, AB, VDA), pp. 81–86.
DAC-1994-Edahiro #performance: An Efficient Zero-Skew Routing Algorithm (ME), pp. 375–380.
DAC-1994-KamVBS: A Fully Implicit Algorithm for Exact State Minimization (TK, TV, RKB, ALSV), pp. 684–690.
DAC-1994-KannanSF #optimisation: A Methodology and Algorithms for Post-Placement Delay Optimization (LNK, PS, HGF), pp. 327–332.
DAC-1994-RudnickPGN #framework #generative #search-based #testing: Sequential Circuit Test Generation in a Genetic Algorithm Framework (EMR, JHP, GSG, TMN), pp. 698–704.
DAC-1994-YuBS #3d #aspect-oriented: Algorithmic Aspects of Three Dimensional MCM Routing (QY, SB, NAS), pp. 397–401.
EDAC-1994-ChoHMPS #approximate #automaton #composition #traversal: A State Space Decomposition Algorithm for Approximate FSM Traversal (HC, GDH, EM, MP, FS), pp. 137–141.
EDAC-1994-EsbensenM #graph #problem #search-based: A Genetic Algorithm for the Steiner Problem in a Graph (HE, PM), pp. 402–406.
EDAC-1994-HachtelMPS #finite #state machine: Symbolic Algorithms to Calculate Steady-State Probabilities of a Finite State Machine (GDH, EM, AP, FS), pp. 214–218.
EDAC-1994-HolmesG #behaviour #generative: An Algorithm for Generation of Behavioral Shape Functions (NDH, DG), pp. 314–318.
EDAC-1994-NaganumaOH #debugging #design #using #validation: High-Level Design Validation Using Algorithmic Debugging (JN, TO, TH), pp. 474–480.
EDAC-1994-RamachandranGC #array #clustering: An Algorithm for Array Variable Clustering (LR, DG, VC), pp. 262–266.
EDAC-1994-RudnickHSP #generative #search-based #testing: Application of Simple Genetic Algorithms to Sequential Circuit Test Generation (EMR, JGH, DGS, JHP), pp. 40–45.
HPDC-1994-HeddayaP #interactive #network #parallel: Mapping Parallel Interactive Algorithms onto Workstation Networks (AH, KP), pp. 211–218.
HPDC-1994-PuthukattukaranCS #design #implementation #parallel: Design and Implementation of Parallel Algorithms for Gene-Finding (JP, SC, PS), pp. 186–193.
PDP-1994-BastiaensLDV #concurrent #image #implementation #operating system #parallel #performance #re-engineering #thread: An Efficient Parallel Implementation Of The Ml-EM Algorithm For PET Image Reconstruction With A Multi-threaded Operating System (KB, IL, PD, WV), pp. 253–259.
PDP-1994-BauchMM #distributed #fault tolerance #scheduling: A Distributed Algorithm For Fault-tolerant Dynamic Task Scheduling (AB, EM, FJM), pp. 309–316.
PDP-1994-DiersteinHR #array #bound: A Branch-and-bound Algorithm For Array Distributions (AD, RH, TR), pp. 528–535.
PDP-1994-GaberGHLT #parallel: Non-numerical Data Parallel Algorithms (JG, GG, TH, PL, BT), pp. 167–174.
PDP-1994-Gonzalez #parallel: Parallel Numerical Algorithms (AG), pp. 238–239.
PDP-1994-Ralha: A New Algorithm For Singular Value Decompositions (RMSR), pp. 240–244.
PDP-1994-StuartW #approach #linear #parallel #using #visualisation: The Enhancement Of Parallel Numerical Linear Algorithms Using A Visualization Approach (EJS, JSW), pp. 274–281.
STOC-1994-AlurAT #adaptation: Time-adaptive algorithms for synchronization (RA, HA, GT), pp. 800–809.
STOC-1994-AwerbuchL #approximate #multi #network #problem: Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks (BA, TL), pp. 487–496.
STOC-1994-ChariRS #approximate #probability: Improved algorithms via approximations of probability distributions (SC, PR, AS), pp. 584–592.
STOC-1994-ChungY: A near optimal algorithm for edge separators (FRKC, STY), pp. 1–8.
STOC-1994-Gabow #graph #performance: Efficient splitting off algorithms for graphs (HNG), pp. 696–705.
STOC-1994-GargH #approximate #problem: An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane (NG, DSH), pp. 432–438.
STOC-1994-GoemansW #approximate #satisfiability: .879-approximation algorithms for MAX CUT and MAX 2SAT (MXG, DPW), pp. 422–431.
STOC-1994-Hagerup #parallel #sorting #string: Optimal parallel string algorithms: sorting, merging and computing the minimum (TH), pp. 382–391.
STOC-1994-ImpagliazzoNW #network #pseudo: Pseudorandomness for network algorithms (RI, NN, AW), pp. 356–364.
STOC-1994-JacquetS #analysis #equation #functional: A functional equation often arising in the analysis of algorithms (PJ, WS), pp. 780–789.
STOC-1994-KleinRRS #graph #performance: Faster shortest-path algorithms for planar graphs (PNK, SR, MRH, SS), pp. 27–37.
STOC-1994-KleinT #linear #random: A randomized linear-time algorithm for finding minimum spanning trees (PNK, RET), pp. 9–15.
STOC-1994-KollerMS #game studies #performance #random: Fast algorithms for finding randomized strategies in game trees (DK, NM, BvS), pp. 750–759.
STOC-1994-MuthukrishnanP #complexity #standard #string: Non-standard stringology: algorithms and complexity (SM, KVP), pp. 770–779.
STOC-1994-Sitharam #generative #learning #pseudo: Pseudorandom generators and learning algorithms for AC (MS), pp. 478–486.
CAV-1994-LeeR #implementation #parallel #problem #relational: A Parallel Algorithm for Relational Coarsest Partition Problems and Its Implementation (IL, SR), pp. 404–414.
CAV-1994-LongBCJM #evaluation #fixpoint: An Improved Algorithm for the Evaluation of Fixpoint Expressions (DEL, AB, EMC, SJ, WRM), pp. 338–350.
ILPS-1994-PodelskiR #incremental #testing: The Beauty and the Beast Algorithm: Quasi-Linear Incremental Tests of Entailment and Disentailment over Trees (AP, PVR), pp. 359–374.
ICDAR-1993-Bunke #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-DeseillignyMS #comprehension #graph #network #re-engineering: Map understanding for GIS data capture: Algorithms for road network graph reconstruction (MPD, HLM, GS), pp. 676–679.
ICDAR-1993-HarukiTO #generative #multi: A multi-stage algorithm of extracting joint points for generating function-fonts (RH, KT, YO), pp. 31–34.
ICDAR-1993-IwataM #classification: A color classification algorithm (KI, GM), pp. 726–729.
ICDAR-1993-JaisimhaHD #performance: A methodology for the characterization of the performance of thinning algorithms (MYJ, RMH, DD), pp. 282–286.
ICDAR-1993-KimuraSC #recognition #word: Improvements of a lexicon directed algorithm for recognition of unconstrained handwritten words (FK, MS, ZC), pp. 18–22.
ICDAR-1993-KonnoH #probability #semantics: Postprocessing algorithm based on the probabilistic and semantic method for Japanese OCR (AK, YH), pp. 646–649.
ICDAR-1993-KrtolicaM #recognition: Two-stage box connectivity algorithm for optical character recognition (RK, SM), pp. 179–182.
ICDAR-1993-LamS #evaluation: Evaluation of thinning algorithms from an OCR viewpoint (LL, CYS), pp. 287–290.
ICDAR-1993-LeeKM #fault #performance #recognition: Efficient postprocessing algorithms for error correction in handwritten Hangul address and human name recognition (SWL, ESK, BWM), pp. 232–235.
ICDAR-1993-LiuFS #documentation #image: An object attribute thresholding algorithm for document image binarization (YL, RF, SNS), pp. 278–281.
ICDAR-1993-PlamondonBCS #design #preprocessor #validation: Validation of preprocessing algorithms: A methodology and its application to the design of a thinning algorithm for handwritten characters (RP, MB, CC, CYS), pp. 262–269.
ICDAR-1993-TangLL #implementation #pattern matching #pattern recognition #recognition: VLSI implementation for HVRI algorithm in pattern recognition (YYT, TL, SWL), pp. 460–463.
ICDAR-1993-Viard-GaudinNB #2d #approach #using: A bar code location algorithm using a two-dimensional approach (CVG, NN, DB), pp. 45–48.
ICDAR-1993-XuL #image #string: A new algorithm separating text strings from map images (TX, XL), pp. 910–913.
SIGMOD-1993-HouP #array: Comparing Rebuild Algorithms for Mirrored and RAID5 Disk Arrays (RYH, YNP), pp. 317–326.
SIGMOD-1993-LiRS #grid #parallel: Algorithms for Loading Parallel Grid Files (JL, DR, JS), pp. 347–356.
SIGMOD-1993-ONeilOW #database: The LRU-K Page Replacement Algorithm For Database Disk Buffering (EJO, PEO, GW), pp. 297–306.
VLDB-1993-FabretRS #adaptation #database #evaluation #incremental: An Adaptive Algorithm for Incremental Evaluation of Production Rules in Databases (FF, MR, ES), pp. 455–466.
VLDB-1993-HoutsmaWF #evaluation #implementation #parallel #performance #transitive: Implementation and Performance Evaluation of a Parallel Transitive Closure Algorithm on PRISMA/DB (MAWH, ANW, JF), pp. 206–217.
CSM-1993-RothermelH #performance #testing: A Safe, Efficient Algorithm for Regression Test Selection (GR, MJH), pp. 358–367.
DLT-1993-Calude: Borel Normality and Algorithmic Randomness (CC), pp. 113–129.
ICALP-1993-DolevM #distributed #on the: On Distributed Algorithms in a Broadcast Domain (DD, DM), pp. 371–387.
ICALP-1993-GargVY #approximate #multi #set: Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover (NG, VVV, MY), pp. 64–75.
ICALP-1993-JaromczykS #formal method: A Theory of Even Functionals and Their Algorithmic Applications (JWJ, GS), pp. 126–136.
FME-1993-Bicarregui #refinement: Algorithm Refinement with Read and Write Frames (JB), pp. 148–161.
RTA-1993-Adian #monad #on the #problem: On some Algorithmic Problems for Groups and Monoids (SIA), pp. 289–300.
RTA-1993-ChakrabartiY #correctness #distributed #memory management #on the: On the Correctness of a Distributed Memory Gröbner basis Algorithm (SC, KAY), pp. 77–91.
FPCA-1993-GrantSWZ #finite #functional #implementation: Some Issues in a Functional Implementation of a Finite Element Algorithm (PWG, JAS, MFW, XZ), pp. 12–17.
HCI-SHI-1993-ChoMHM #comprehension #development #recognition: A Pen-Based System to Input Correct Answers to Assist in the Development of Recognition and Understanding Algorithms of Ink Data (YC, TM, SH, SM), pp. 68–73.
INTERCHI-1993-StaskoBL #analysis #animation #empirical #learning: Do algorithm animations assist learning?: an empirical study and analysis (JTS, ANB, CL), pp. 61–66.
CIKM-1993-EickJ #classification #learning #search-based: Learning Bayesian Classification Rules through Genetic Algorithms (CFE, DJ), pp. 305–313.
CIKM-1993-Karr #design #modelling #process #search-based: Genetic Algorithms for Modelling, Design, and Process Control (CLK), pp. 233–238.
CIKM-1993-Lee #precise #transaction: Precision Locking Algorithm for Nested Transactions Systems (JKL), pp. 674–683.
ICML-1993-Baluja #evolution #parallel #towards: The Evolution of Gennetic Algorithms: Towards Massive Parallelism (SB), pp. 1–8.
ICML-1993-Schlimmer: Efficiently Inducing Determinations: A Complete and Systematic Search Algorithm that Uses Optimal Pruning (JCS), pp. 284–290.
SEKE-1993-Eberbach #calculus #design #self #specification: The Design and Specification of SEMAL — A Cost Language Based on the Calculus of Self-Modifiable Algorithms (EE), pp. 166–173.
LOPSTR-1993-Smith #constraints #synthesis #towards: Towards the Synthesis of Constraint Propagation Algorithms (DRS), pp. 1–9.
PLILP-1993-Nederhof #definite clause grammar #parsing #recursion #top-down: A New Top-Down Parsing Algorithm for Left-Recursive DCGs (MJN), pp. 108–122.
POPL-1993-Gay #π-calculus: A Sort Inference Algorithm for the Polyadic π-Calculus (SJG), pp. 429–438.
WSA-1993-CharlierDMH #abstract interpretation #fixpoint #optimisation #performance #prolog: Optimization Techniques for General Purpose Fixpoint Algorithms — Practical Efficiency for the Abstract Interpretation of Prolog (BLC, OD, LM, PVH), pp. 15–26.
WSA-1993-FergusonH #abstract interpretation #performance #using: Fast Abstract Interpretation Using Sequential Algorithms (AF, JH), pp. 45–59.
FSE-1993-CaiP #implementation #towards: Towards Increased Productivity of Algorithm Implementation (JC, RP), pp. 71–78.
ICSE-1993-MukherjeaS #animation #comprehension #debugging: Applying Algorithm Animation Techniques for Program Tracing, Debugging, and Understanding (SM, JTS), pp. 456–465.
KBSE-1993-Smith #named #synthesis: KIDS: An Algorithm Synthesis System (DRS), p. 2.
SAC-1993-AcreeCUGS #adaptation #analysis #linear #parallel: Parallelization and Analysis of a Linear Adaptive Filtering Algorithm (RKA, DTC, NU, MJG, DMS), pp. 165–172.
SAC-1993-BerqueGE #implementation #recursion: Implementing Progress Indicators for Recursive Algorithms (DAB, MKG, JAE), pp. 533–538.
SAC-1993-ChuD #convergence #search-based: The Effect of Population Structure on the Rate of Convergence of Genetic Algorithms (PHC, SAD), pp. 147–151.
SAC-1993-ChungY #multi: Distributive Join Algorithm for Shared-Memory Multiprocessors (SMC, JY), pp. 546–553.
SAC-1993-CorcoranW #named #research #search-based: LibGA: A User-Friendly Workbench for Order-Based Genetic Algorithm Research (ALC, RLW), pp. 111–117.
SAC-1993-FlorianiM #modelling: Algorithms for Visibility Computation on Digital Terrain Models (LDF, PM), pp. 380–387.
SAC-1993-FrederickSW #metric #network #problem #search-based: The Hamming Metric in Genetic Algorithms and Its Application to Two Network Problems (WGF, RLS, CMW), pp. 126–130.
SAC-1993-GallionSCB #learning: Dynamic ID3: A Symbolic Learning Algorithm for Many-Valued Attribute Domains (RG, CLS, DCSC, WEB), pp. 14–20.
SAC-1993-JoshiRN #network #performance #problem: A Fast Algorithm for Generalized Network Location Problems (DSJ, SR, CN), pp. 701–708.
SAC-1993-Konstam #analysis #linear #search-based #using: Linear Discriminant Analysis Using Genetic Algorithms (AHK), pp. 152–156.
SAC-1993-MinZ: Time-Space Optimal Convex Hull Algorithms (HM, SQZ), pp. 687–693.
SAC-1993-RankinWHS #evaluation #hybrid #problem #search-based: A Hybrid Genetic Algorithm for an NP-Complete Problem with an Expensive Evaluation Function (RR, RWW, GH, JS), pp. 251–256.
SAC-1993-SekharanW #search-based: Manipulating Subpopulations of Feasible and Infeasible Solutions in Genetic Algorithms (DAS, RLW), pp. 118–125.
SAC-1993-StrateW #multi #programming: Load Balancing Techniques for Dynamic Programming Algorithms on Hypercube Multiprocessors (SAS, RLW), pp. 562–569.
DAC-1993-ChakravartyG #fault: An Algorithm for Diagnosing Two-Line Bridging Faults in Combinational Circuits (SC, YG), pp. 520–524.
DAC-1993-ChaoLS #pipes and filters #scheduling: Rotation Scheduling: A Loop Pipelining Algorithm (LFC, ASL, EHMS), pp. 566–572.
DAC-1993-ChoHMPS #approximate #automaton #traversal: Algorithms for Approximate FSM Traversal (HC, GDH, EM, BP, FS), pp. 25–30.
DAC-1993-ChoS #performance: A Nuffer Distribution Algorithm for High-Speed Clock Routing (JDC, MS), pp. 537–543.
DAC-1993-CongS #bottom-up #clustering #design #parallel: A Parallel Bottom-Up Clustering Algorithm with Applications to Circuit Partitioning in VLSI Design (JC, MS), pp. 755–760.
DAC-1993-Edahiro #clustering #optimisation: A Clustering-Based Optimization Algorithm in Zero-Skew Routings (ME), pp. 612–616.
DAC-1993-HongXKCH: Performance-Driven Steiner Tree Algorithm for Global Routing (XH, TX, ESK, CKC, JH), pp. 177–181.
DAC-1993-HuangHCK #performance: An Efficient Timing-Driven Global Routing Algorithm (JH, XH, CKC, ESK), pp. 596–600.
DAC-1993-HuangJHHW #scheduling: A Tree-Based Scheduling Algorithm for Control-Dominated Circuits (SHH, YLJ, CTH, YCH, JFW), pp. 578–582.
DAC-1993-LadageL #using: Resistance Extraction using a Routing Algorithm (LL, RL), pp. 38–42.
DAC-1993-Lee #2d #bound #design: A Bounded 2D Contour Searching Algorithm for Floorplan Design with Arbitrarily Shaped Rectilinear and Soft Modules (TcL), pp. 525–530.
DAC-1993-MotoharaHMMKSS #matrix #traversal #using: A State Traversal Algorithm Using a State Covariance Matrix (AM, TH, MM, HM, KK, YS, SS), pp. 97–101.
DAC-1993-NouraniP #estimation #layout: A Layout Estimation Algorithm for RTL Datapaths (MN, CAP), pp. 285–291.
DAC-1993-OhlrichEGS #identification #morphism #named #performance #using: SubGemini: Identifying SubCircuits using a Fast Subgraph Isomorphism Algorithm (MO, CE, EG, LS), pp. 31–37.
HPDC-1993-JoshiHV: A Methodology for Evaluating Load Balancing Algorithms (BSJ, SHH, KV), pp. 216–223.
HPDC-1993-KarpovichJSG #framework #object-oriented #parallel: A Parallel Object-Oriented Framework for Stencil Algorithms (JFK, MJ, WTS, ASG), pp. 34–41.
PDP-1993-BadiaV #distributed #memory management #parallel: A parallel algorithm to solve tridiagonal systems on distributed memory multiprocessors (JMB, AMV), pp. 203–210.
PDP-1993-CabaleiroCZ #component #parallel: Parallel algorithm for principal components based on Hotelling’s iterative procedure (JCC, JMC, ELZ), pp. 144–149.
PDP-1993-CremonesiFFP #parallel #simulation: Parallel algorithms applied to direct simulation methods (PC, MF, AF, RP), pp. 239–246.
PDP-1993-HuesoHM #equation #matrix: Systolic algorithms for matrix functions via the commutant equation (JLH, VH, GM), pp. 222–229.
PDP-1993-NieplochaC #communication #distributed: Communication structures for asynchronous algorithms on distributed MIMD computers (JN, CCC), pp. 291–298.
PDP-1993-RebaudengoR #analysis #migration #parallel #search-based: An experimental analysis of the effects of migration in parallel genetic algorithms (MR, MSR), pp. 232–238.
PDP-1993-SharpC #fourier #functional #performance #program transformation #synthesis: Synthesis of the fast Fourier transform algorithm by functional language program transformation (DWNS, MC), pp. 136–143.
PDP-1993-StuartW #array #matrix #parallel #scalability #set #symmetry #using: An algorithm far the parallel computation of subsets of eigenvalues and associated eigenvectors of large symmetric matrices using an array processor (EJS, JSW), pp. 211–217.
PPoPP-1993-Siegl #symbolic computation #using: Parallelizing Algorithms for Symbolic Computation using ||MAPLE|| (KS), pp. 179–186.
STOC-1993-Baker #formal method #pattern matching: A theory of parameterized pattern matching: algorithms and applications (BSB), pp. 71–80.
STOC-1993-BernGR #online: On-line algorithms for cache sharing (MWB, DHG, AR), pp. 422–430.
STOC-1993-Bodlaender #linear: A linear time algorithm for finding tree-decompositions of small treewidth (HLB), pp. 226–234.
STOC-1993-CondonFLS #approximate: Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions (AC, JF, CL, PWS), pp. 305–314.
STOC-1993-DworkHW #memory management: Contention in shared memory algorithms (CD, MH, OW), pp. 174–183.
STOC-1993-EppsteinGIS #graph: Separator based sparsification for dynamic planar graph algorithms (DE, ZG, GFI, THS), pp. 208–217.
STOC-1993-FelsnerW #combinator #set: Maximum k-chains in planar point sets: combinatorial structure and algorithms (SF, LW), pp. 146–153.
STOC-1993-Goldberg #graph #polynomial #product line: Polynomial space polynomial delay algorithms for listing families of graphs (LAG), pp. 218–225.
STOC-1993-KargerS: An O~(n2) algorithm for minimum cuts (DRK, CS), pp. 757–765.
STOC-1993-LubyN #approximate #linear #parallel #programming: A parallel approximation algorithm for positive linear programming (ML, NN), pp. 448–457.
STOC-1993-MatousekS #3d #problem: A deterministic algorithm for the three-dimensional diameter problem (JM, OS), pp. 478–484.
STOC-1993-RaviMRRH #approximate #multi: Many birds with one stone: multi-objective approximation algorithms (RR, MVM, SSR, DJR, HBHI), pp. 438–447.
STOC-1993-WilliamsonGMV #approximate #network #problem: A primal-dual approximation algorithm for generalized Steiner network problems (DPW, MXG, MM, VVV), pp. 708–717.
CAV-1993-KestenMMP #logic: A Decision Algorithm for Full Propositional Temporal Logic (YK, ZM, HM, AP), pp. 97–109.
CAV-1993-LincolnR #consistency #fault #hybrid #interactive #verification: The Formal Verification of an Algorithm for Interactive Consistency under a Hybrid Fault Model (PL, JMR), pp. 292–304.
CAV-1993-YannakakisL #performance #realtime: An Efficient Algorithm for Minimizing Real-time Transition Systems (MY, DL), pp. 210–224.
ILPS-1993-PodelskiR: The Beauty and the Beast Algorithm (AP, PVR), p. 653.
ISSTA-1993-WeissF #analysis #mutation testing: Improved Serial Algorithms for Mutation Analysis (SNW, VNF), pp. 149–158.
PODS-1992-TurekSP #concurrent #data type: Locking without Blocking: Making Lock Based Concurrent Data Structure Algorithms Nonblocking (JT, DS, SP), pp. 212–222.
PODS-1992-WolfsonJ #distributed #replication: Distributed Algorithms for Dynamic Replication of Data (OW, SJ), pp. 149–163.
SIGMOD-1992-MohanN #scalability: Algorithms for Creating Indexes for Very Large Tables Without Quiescing Updates (CM, IN), pp. 361–370.
SIGMOD-1992-PolyzoisG #evaluation #transaction: Evaluation of Remote Backup Algorithms for Transaction Processing Systems (CAP, HGM), pp. 246–255.
VLDB-1992-KrishnakumarB #database #throughput: High Throughput Escrow Algorithms for Replicated Databases (NK, AJB), pp. 175–186.
VLDB-1992-Muralikrishna #query #sql: Improved Unnesting Algorithms for Join Aggregate SQL Queries (MM), pp. 91–102.
ICALP-1992-ApostolicoBG #parallel: Optimal Parallel Algorithms for Periods, Palindromes and Squares (AA, DB, ZG), pp. 296–307.
ICALP-1992-Bundgen #perspective #term rewriting: Buchberger’s Algorithm: The Term Rewriter’s Point of View (RB), pp. 380–391.
ICALP-1992-Flajolet #analysis: Analytic Analysis of Algorithms (PF), pp. 186–210.
ICALP-1992-KhullerT #approximate #graph: Approximation Algorithms for Graph Augmentation (SK, RT), pp. 330–341.
ICALP-1992-MatousekS: A Tail Estimate for Mulmuley’s Segment Intersection Algorithm (JM, RS), pp. 427–438.
ICALP-1992-Schmid #multi: The Average CRI-Length of a Tree Collision Resolution Algorithm in Presence of Multiplicity-Dependent Capture Effects (US), pp. 223–234.
CHI-1992-Brown #parallel #sorting #visualisation: An Introduction to Zeus: Audiovisualization of Some Elementary Sequential and Parallel Sorting Algorithms (MHB), pp. 663–664.
ML-1992-GiordanaS #concept #learning #search-based #using: Learning Structured Concepts Using Genetic Algorithms (AG, CS), pp. 169–178.
ML-1992-Hickey #approach #evaluation #towards: Artificial Universes — Towards a Systematic Approach to Evaluation Algorithms which Learn form Examples (RJH), pp. 196–205.
ML-1992-Moulet: A Symbolic Algorithm for Computing Coefficients’ Accuracy in Regression (MM), pp. 332–337.
ML-1992-Singh #learning #modelling #scalability: Scaling Reinforcement Learning Algorithms by Learning Variable Temporal Resolution Models (SPS), pp. 406–415.
ML-1992-SubramanianH #design: Measuring Utility and the Design of Provably Good EBL Algorithms (DS, SH), pp. 426–425.
SEKE-1992-HacL #compilation #distributed #parallel: A Distributed Load Building Algorithm for Parallel Compilation of Files in a Software Application (AH, RRL), pp. 269–275.
SEKE-1992-TaT #layout: Layout Algorithms for DFD Processors (KPT, TCT), pp. 567–573.
SEKE-1992-WangG #concurrent #transaction: An Optomized Concurrency Control Algorithm for Transaction Brocessing (SW, UOG), pp. 9–16.
SIGIR-1992-FoxCH #performance: A Faster Algorithm for Constructing Minimal Perfect Hash Functions (EAF, QFC, LSH), pp. 266–273.
ALP-1992-BundgenE #analysis #normalisation #performance: A Fast Algorithm for Ground Normal Form Analysis (RB, HE), pp. 291–305.
PLDI-1992-LandiR #alias #approximate #interprocedural #pointer: A Safe Approximate Algorithm for Interprocedural Pointer Aliasing (WL, BGR), pp. 235–248.
PLILP-1992-EnglebertCRH #abstract interpretation #evaluation #optimisation #prolog: Generic Abstract Interpretation Algorithms For Prolog: Tow Optimization Techniques and Their Experimental Evaluation (VE, BLC, DR, PVH), pp. 310–325.
PLILP-1992-NilssonF #debugging #functional #lazy evaluation: Algorithmic Debugging for Lazy Functional Languages (HN, PF), pp. 385–399.
POPL-1992-LincolnM #aspect-oriented #type inference #type system: Algorithmic Aspects of Type Inference with Subtypes (PL, JCM), pp. 293–304.
TRI-Ada-C-1992-MayrhauserH #ada #communication #concurrent #graph #testing: An Ada Deadlock Testing Algorithm Based on Control and Communication Flow Graphs (AvM, SMSH), pp. 450–457.
WSA-1992-Hanus #abstract interpretation #logic programming #source code: An Abstract Interpretation Algorithm for Residuating Logic Programs (MH), pp. 304–312.
Best-of-PLDI-1992-LandiR92a #alias #approximate #interprocedural #pointer: A safe approximate algorithm for interprocedural pointer aliasing (with retrospective) (WL, BGR), pp. 473–489.
ASPLOS-1992-MowryLG #compilation #design #evaluation: Design and Evaluation of a Compiler Algorithm for Prefetching (TCM, MSL, AG), pp. 62–73.
DAC-1992-ChakravartyL #fault #monitoring: Algorithms for Current Monitor Based Diagnosis of Bridging and Leakage Faults (SC, ML), pp. 353–356.
DAC-1992-ChaudharyP #constraints: A Near Optimal Algorithm for Technology Mapping Minimizing Area under Delay Constraints (KC, MP), pp. 492–498.
DAC-1992-ChenF #logic #optimisation #performance #set: Efficient Sum-to-One Subsets Algorithm for Logic Optimization (KCC, MF), pp. 443–448.
DAC-1992-ChengM #on the #problem: On the Over-Specification Problem in Sequential ATPG Algorithms (KTC, HKTM), pp. 16–21.
DAC-1992-GaoVL #performance: A Performance Driven Macro-Cell Placement Algorithm (TG, PMV, CLL), pp. 147–152.
DAC-1992-HongHCK #named #performance: FARM: An Efficient Feed-Through Pin Assignment Algorithm (XH, JH, CKC, ESK), pp. 530–535.
DAC-1992-HouC #permutation: A Pin Permutation Algorithm for Improving Over-the-Cell Channel Routing (CYH, CYRC), pp. 594–599.
DAC-1992-KimBCP #named: APT: An Area-Performance-Testability Driven Placement Algorithm (SK, PB, VC, JHP), pp. 141–146.
DAC-1992-KungDNG #named: BDDMAP: A Technology Mapper Based on a New Covering Algorithm (DSK, RFD, TAN, DJG), pp. 484–487.
DAC-1992-MurgaiBS #multi #synthesis: An Improved Synthesis Algorithm for Multiplexor-Based PGA’s (RM, RKB, ALSV), pp. 380–386.
DAC-1992-NaborsW #3d #multi: Multipole-Accelerated 3-D Capacitance Extraction Algorithms for Structures with Conformal Dielectrics (KN, JW), pp. 710–715.
DAC-1992-OkudaO #generative #layout #performance: An Efficient Routing Algorithm for SOG Cell Generation on a Dense Gate-Isolated Layout Style (RO, SO), pp. 676–681.
DAC-1992-PuriG #performance: An Efficient algorithm for Microword Length Minimization (RP, JG), pp. 651–656.
DAC-1992-SaldanhaBS92a #revisited: Circuit Structure Relations to Redundancy and Delay: The KMS Algorithm Revisited (AS, RKB, ALSV), pp. 245–248.
STOC-1992-AdlerB #algebra #linear #polynomial #programming: Polynomial Algorithms for Linear Programming over the Algebraic Numbers (IA, PAB), pp. 483–494.
STOC-1992-AjtaiM #linear #programming: A Deterministic Poly(log log N)-Time N-Processor Algorithm for Linear Programming in Fixed Dimension (MA, NM), pp. 327–338.
STOC-1992-BartalFKV #problem #scheduling: New Algorithms for an Ancient Scheduling Problem (YB, AF, HJK, RV), pp. 51–58.
STOC-1992-BartalFR #data transformation #distributed: Competitive Algorithms for Distributed Data Management (YB, AF, YR), pp. 39–50.
STOC-1992-ChoyS #distributed #fault tolerance #performance #resource management: Efficient Fault Tolerant Algorithms for Resource Allocation in Distributed Systems (MC, AKS), pp. 593–602.
STOC-1992-Galil #parallel #string: A Constant-Time Optimal Parallel String-Matching Algorithm (ZG), pp. 69–76.
STOC-1992-Kalai #random: A Subexponential Randomized Simplex Algorithm (GK), pp. 475–482.
STOC-1992-Lindell: A Logspace Algorithm for Tree Canonization (SL), pp. 400–404.
STOC-1992-MaggsS #bound #network: Simple Algorithms for Routing on Butterfly Networks with Bounded Queues (BMM, RKS), pp. 150–161.
STOC-1992-PanconesiS #composition #distributed #network #problem: Improved Distributed Algorithms for Coloring and Network Decomposition Problems (AP, AS), pp. 581–592.
STOC-1992-Rao #graph #performance: Faster Algorithms for Finding Small Edge Cuts in Planar Graphs (SR), pp. 229–240.
CADE-1992-CichonL #complexity #polynomial: Polynomial Interpretations and the Complexity of Algorithms (AC, PL), pp. 139–147.
CAV-1992-WrightL #concurrent #proving #reasoning #theorem proving #using: Using a Theorem Prover for Reasoning about Concurrent Algorithms (JvW, TL), pp. 56–68.
CSL-1992-BaazZ #proving: Algorithmic Structuring of Cut-free Proofs (MB, RZ), pp. 29–42.
CSL-1992-Grandjean #linear #problem: Linear Time Algorithms and NP-Complete Problems (EG), pp. 248–273.
JICSLP-1992-ChenRR #execution #multi #prolog: Multistage Indexing Algorithms for Speeding Prolog Execution (TC, IVR, RR), pp. 639–653.
JICSLP-1992-KirchnerR #algebra #constraints #finite #theorem proving #unification: A Constraint Solver in Finite Algebras and Its Combination with Unification Algorithms (HK, CR), pp. 225–239.
LICS-1992-Curien #data type: Observable Algorithms on Concrete Data Structures (PLC), pp. 432–443.
PODS-1991-Jakobsson #transitive: Mixed-Approach Algorithms for Transitive Closure (HJ), pp. 199–205.
SIGMOD-1991-GruenwaldE: MMDB Reload Algorithms (LG, MHE), pp. 397–405.
SIGMOD-1991-SrinivasanC #concurrent #performance: Performance of B-Tree Concurrency Algorithms (VS, MJC), pp. 416–425.
ICALP-1991-BodlaenderK #graph: Better Algorithms for the Pathwidth and Treewidth of Graphs (HLB, TK), pp. 544–555.
ICALP-1991-Furer #graph #performance: An Efficient NC Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs (MF), pp. 429–440.
ICALP-1991-GalilM #linear #problem: An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem (ZG, OM), pp. 719–727.
ICALP-1991-Hashiguchi #generative #regular expression: Algorithms for Determining the Smallest Number of Nonterminals (States) Sufficient for Generating (Accepting) a Regular Language (KH), pp. 641–648.
ICALP-1991-JungSS #constraints #parallel #precedence #scheduling: A Parallel Algorithm for Two Processors Precedence Constraint Scheduling (HJ, MJS, PGS), pp. 417–428.
ICALP-1991-KhullerMV #online: On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages (SK, SGM, VVV), pp. 728–738.
ICALP-1991-LengauerT #performance #problem: Efficient Algorithms for Path Problems with Gernal Cost Citeria (TL, DT), pp. 314–326.
ICALP-1991-Vishkin #parallel: Strutural Parallel Algorithmics (UV), pp. 363–380.
RTA-1991-Bundgen #simulation: Simulation Buchberger’s Algorithm by Knuth-Bendix Completion (RB), pp. 386–397.
RTA-1991-Pottier #bound #linear: Minimal Solutions of Linear Diophantine Systems: Bounds and Algorithms (LP), pp. 162–173.
CHI-1991-Stasko #animation #using: Using direct manipulation to build algorithm animations by demonstration (JTS), pp. 307–314.
CAiSE-1991-Kalman #concept #database #implementation #relational: Implementation and Critique of an Algorithm which Maps a Relational Database to a Conceptual Model (KK), pp. 393–415.
KR-1991-ChalasaniEM #performance #permutation #problem: Integrating Efficient Model-Learning and Problem-Solving Algorithms in Permutation Environments (PC, OE, JM), pp. 89–98.
ML-1991-BrunkP #concept #learning #relational: An Investigation of Noise-Tolerant Relational Concept Learning Algorithms (CB, MJP), pp. 389–393.
SIGIR-1991-FreiW #effectiveness #network #retrieval: Retrieval Algorithm Effectiveness in a Wide Area Network Information Filter (HPF, MFW), pp. 114–122.
SIGIR-1991-Lelu #automation #generative #hypermedia #incremental #information retrieval #probability: Automatic Generation of Hypertext Links in Information Retrieval Systems: A Stochastic and an Incremental Algorithm (AL), pp. 326–335.
SIGIR-1991-LuoY #hybrid #image: Image Decompression: A Hybrid Image Decompressing Algorithm (CL, CTY), pp. 82–91.
LOPSTR-1991-Schaeck #constraints #framework #logic programming: Global Search Algorithms and the Constraint Logic Programming Framework (SS), pp. 252–253.
LOPSTR-1991-WaalG #unification: Specialisation of a Unification Algorithm (DAdW, JPG), pp. 205–220.
PEPM-1991-Lisper #detection #partial evaluation: Detecting Static Algorithms by Partial Evaluation (BL), pp. 31–42.
PLDI-1991-FritzsonGKS #debugging #testing: Generalized Algorithmic Debugging and Testing (PF, TG, MK, NS), pp. 317–326.
PLDI-1991-WolfL #locality #optimisation: A Data Locality Optimizing Algorithm (MEW, MSL), pp. 30–44.
PLILP-1991-AlpuenteF #constraints #incremental: Narrowing as an Incremental Constraint Satisfaction Algorithm (MA, MF), pp. 111–122.
Best-of-PLDI-1991-LamW #locality #optimisation: A data locality optimizing algorithm (with retrospective) (MSL, MEW), pp. 442–459.
KBSE-1991-FrinckeAL #approach #automation #concurrent #detection #named: CTPLAN: A Planning-Based Approach to Automatically Detecting Flaws in Concurrent Algorithms (DAF, MA, KNL), pp. 151–160.
ASPLOS-1991-LamRW #optimisation #performance: The Cache Performance and Optimizations of Blocked Algorithms (MSL, EER, MEW), pp. 63–74.
DAC-1991-CardenC #approximate #multi #performance #using: A Global Router Using An Efficient Approximate Multicommodity Multiterminal Flow Algorithm (RCCI, CKC), pp. 316–321.
DAC-1991-ChakradharA #generative #testing #transitive: A Transitive Closure Based Algorithm for Test Generation (STC, VDA), pp. 353–358.
DAC-1991-DevadasKM #generative #multi #testing: A Synthesis-Based Test Generation and Compaction Algorithm for Multifaults (SD, KK, SM), pp. 359–365.
DAC-1991-HolmesSS #using: New Algorithm for Over-the-Cell Channel Routing Using Vacant Terminals (NDH, NAS, MS), pp. 126–131.
DAC-1991-Kitamura #fault #simulation: Sequential Circuit Fault Simulation by Fault Information Tracing Algorithm: FIT (YK), pp. 151–154.
DAC-1991-LavagnoKS #synthesis: Algorithms for Synthesis of Hazard-Free Asynchronous Circuits (LL, KK, ALSV), pp. 302–308.
DAC-1991-LiuDC #parallel #performance: An Efficient Parallel Critical Path Algorithm (LRL, DHCD, HCC), pp. 535–540.
DAC-1991-Srinivasan: An Algorithm for Performance-Driven Initial Placement of Small-Cell ICs (AS), pp. 636–639.
DAC-1991-VandrisS #fault #memory management #performance #simulation: Algorithms for Fast, Memory Efficient Switch-Level Fault Simulation (EV, GES), pp. 138–143.
DAC-1991-YehCL #clustering #multi: A General Purpose Multiple Way Partitioning Algorithm (CWY, CKC, TTYL), pp. 421–426.
PPoPP-1991-MeierE #parallel #performance: Parallelization and Performance of Conjugate Gradient Algorithms on the Cedar Hierarchical-Memory Multiprocessor (UM, RE), pp. 178–188.
CAAP-1991-GabbrielliL #constraints: A Solved Form Algorithm for Ask and Tell Herbrand Constraints (MG, GL), pp. 320–337.
STOC-1991-AgrawalKR #approximate #network #problem: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks (AA, PNK, RR), pp. 134–144.
STOC-1991-AndersonW #parallel #problem: Wait-free Parallel Algorithms for the Union-Find Problem (RJA, HW), pp. 370–380.
STOC-1991-BabaiCFLS #monte carlo #performance #permutation: Fast Monte Carlo Algorithms for Permutation Groups (LB, GC, LF, EML, ÁS), pp. 90–100.
STOC-1991-BarnesR #polynomial #sublinear #using: Deterministic Algorithms for Undirected s-t Connectivity Using Polynomial Time and Sublinear Space (GB, WLR), pp. 43–53.
STOC-1991-CheriyanT #parallel: Algorithms for Parallel k-Vertex Connectivity and Sparse Certificates (JC, RT), pp. 391–401.
STOC-1991-CohenM #difference #linear: Improved Algorithms for Linear Inequalities with Two Variables per Inequality (EC, NM), pp. 145–155.
STOC-1991-DjidjevR #performance #problem: An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs (HD, JHR), pp. 337–347.
STOC-1991-FederM #clique #graph: Clique Partitions, Graph Compression, and Speeding-Up Algorithms (TF, RM), pp. 123–133.
STOC-1991-GalilI #problem: Fully Dynamic Algorithms for Edge-Connectivity Problems (ZG, GFI), pp. 317–327.
STOC-1991-Grove #online: The Harmonic Online K-Server Algorithm Is Competitive (EFG), pp. 260–266.
STOC-1991-KarloffRR #bound #random: Lower Bounds for Randomized k-Server and Motion Planning Algorithms (HJK, YR, YR), pp. 278–288.
STOC-1991-LeightonMPSTT #approximate #multi #performance #problem: Fast Approximation Algorithms for Multicommodity Flow Problems (FTL, FM, SAP, CS, ÉT, ST), pp. 101–111.
CAV-1991-ChristoffC #performance #probability #process #verification: Efficient Algorithms for Verification of Equivalences for Probabilistic Processes (LC, IC), pp. 310–321.
CAV-1991-CleavelandS #calculus #linear #model checking #μ-calculus: A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal μ-Calculus (RC, BS), pp. 48–58.
CAV-1991-JardJ #bound #on the fly #verification: Bounded-memory Algorithms for Verification On-the-fly (CJ, TJ), pp. 192–202.
ICLP-1991-CharlierMH #abstract interpretation #analysis #complexity: A Generic Abstract Interpretation Algorithm and its Complexity Analysis (BLC, KM, PVH), pp. 64–78.
ICLP-1991-CodishDY #alias #analysis #safety #unification: Derivation and Safety of an Abstract Unification Algorithm for Groundness and Aliasing Analysis (MC, DD, EY), pp. 79–93.
ICLP-1991-FujitaH #generative #proving #theorem proving #using: A Model Generation Theorem Prover in KL1 Using a Ramified -Stack Algorithm (HF, RH), pp. 535–548.
TAV-1991-Podgurski #reliability: Reliability, Sampling, and Algorithmic Randomness (AP), pp. 11–20.
PODS-1990-JohnsonS #analysis #concurrent #framework #performance: A Framework for the Performance Analysis of Concurrent B-tree Algorithms (TJ, DS), pp. 273–287.
PODS-1990-Willard #calculus #relational: Quasilinear Algorithms for Processing Relational Calculus Expressions (DEW), pp. 243–257.
SIGMOD-1990-HansonCKW #database: A Predicate Matching Algorithm for Database Rule Systems (ENH, MC, CHK, YWW), pp. 271–280.
SIGMOD-1990-IoannidisK #optimisation #query #random #scalability: Randomized Algorithms for Optimizing Large Join Queries (YEI, YCK), pp. 312–321.
VLDB-1990-AgrawalJ #hybrid #transitive: Hybrid Transitive Closure Algorithms (RA, HVJ), pp. 326–334.
VLDB-1990-DrewKH #implementation #performance: The Performance and Utility of the Cactis Implementation Algorithms (PD, RK, SEH), pp. 135–147.
VLDB-1990-Garcia-MolinaPH: Two Epoch Algorithms for Disaster Recovery (HGM, CAP, RBH), pp. 222–230.
VLDB-1990-JauhariCL #named: Priority-Hints: An Algorithm for Priority-Based Buffer Management (RJ, MJC, ML), pp. 708–721.
VLDB-1990-LuTS #multi: Hash-Based Join Algorithms for Multiprocessor Computers (HL, KLT, MCS), pp. 198–209.
VLDB-1990-ZellerG #adaptation #multi: An Adaptive Hash Join Algorithm for Multiuser Environments (HZ, JG), pp. 186–197.
ICALP-1990-BattistaT #graph #online: On-Line Graph Algorithms with SPQR-Trees (GDB, RT), pp. 598–611.
ICALP-1990-GrooteV #bisimulation #branch #equivalence #performance: An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence (JFG, FWV), pp. 626–638.
ICALP-1990-JerrumS #approximate #polynomial: Polynomial-Time Approximation Algorithms for Ising Model (MJ, AS), pp. 462–475.
ICALP-1990-NaherM #data type #library #named #performance: LEDA: A Library of Efficient Data Types and Algorithms (SN, KM), pp. 1–5.
ICALP-1990-VermaR #normalisation #term rewriting: Nonoblivious Normalization Algorithms for Nonlinear Rewrite Systems (RMV, IVR), pp. 370–385.
GG-1990-BunkeGT #graph grammar #implementation #performance: An Efficient Implementation of Graph Grammars Based on the RETE Matching Algorithm (HB, TG, THT), pp. 174–189.
CHI-1990-BohringerP #automation #constraints #graph #layout #using: Using constraints to achieve stability in automatic graph layout algorithms (KFB, FNP), pp. 43–51.
ML-1990-KadabaN #automation #parametricity #performance #search-based: Improving the Performance of Genetic Algorithms in Automated Discovery of Parameters (NK, KEN), pp. 140–148.
ML-1990-Kadie #concept #set: Conceptual Set Covering: Improving Fit-And-Split Algorithms (CMK), pp. 40–48.
ML-1990-McCallumS #search-based #using: Using Genetic Algorithms to Learn Disjunctive Rules from Examples (AM, KAS), pp. 149–152.
ML-1990-PazzaniS #analysis #learning: Average Case Analysis of Conjunctive Learning Algorithms (MJP, WS), pp. 339–347.
ALP-1990-HuynhLL #fourier #revisited: Fourier Algorithm Revisited (TH, CL, JLL), pp. 117–131.
PLILP-1990-Jaakola #constraints #theorem proving: Modifying the Simplex Algorithm to a Constraint Solver (JJ), pp. 89–105.
PLILP-1990-KamkarNF #debugging #locality #slicing: Bug Localization by Algorithmic Debugging and Program Slicing (MK, NS, PF), pp. 60–74.
POPL-1990-Lamping #reduction #λ-calculus: An Algorithm for Optimal λ Calculus Reduction (JL), pp. 16–30.
POPL-1990-MarloweR #analysis #data flow #hybrid #incremental #performance: An Efficient Hybrid Algorithm for Incremental Data Flow Analysis (TJM, BGR), pp. 184–196.
WAGA-1990-ShinodaK #attribute grammar #distributed #implementation #object-oriented #using: Object-Oriented Extension of Attribute Grammars and its Implementation Using Distributed Attribute Evaluation Algorithm (YS, TK), pp. 177–191.
CC-1990-ShahmehriF #debugging #imperative: Algorithmic Debugging for Imperative Languages with Side-Effects (NS, PF), pp. 226–227.
DAC-1990-BrasenB #named #optimisation: MHERTZ: A New Optimization Algorithm for Floorplanning and Global Routing (DRB, MLB), pp. 107–110.
DAC-1990-CaiW #layout: A Channel/Switchbox Definition Algorithm for Building-Block Layout (YC, DFW), pp. 638–641.
DAC-1990-CarlsonR #design #evaluation #parallel #performance #verification: Design and Performance Evaluation of New Massively Parallel VLSI Mask Verification Algorithms in JIGSAW (ECC, RAR), pp. 253–259.
DAC-1990-Chan #logic: Algorithms for Library-Specific Sizing of Combinational Logic (PKC), pp. 353–356.
DAC-1990-CloutierT #scheduling: The Combination of Scheduling, Allocation, and Mapping in a Single Algorithm (RJC, DET), pp. 71–76.
DAC-1990-CompasanoB #scheduling #synthesis #using: Synthesis Using Path-Based scheduling: algorithms and Exercises (RC, RAB), pp. 450–455.
DAC-1990-CongPL #design #modelling #standard: General Models and Algorithms for Over-the-Cell Routing in Standard Cell Design (JC, BP, CLL), pp. 709–715.
DAC-1990-EdahiroY #standard: New Placement and Global Routing Algorithms for Standard Cell Layouts (ME, TY), pp. 642–645.
DAC-1990-GrantD #memory management #synthesis: Memory, Control and Communications Synthesis for Scheduled Algorithms (DMG, PBD), pp. 162–167.
DAC-1990-KageyamaMS #approach #linear #logic #optimisation #programming: Logic Optimization Algorithm by Linear Programming Approach (NK, CM, TS), pp. 345–348.
DAC-1990-LoV: An O(n1.5logn) 1-d Compaction Algorithm (CYL, RV), pp. 382–387.
DAC-1990-OkuboWW: New Algorithm for Overlapping Cell Treatment in Hierarchical CAD Data/Electron Beam Exposure Data Conversion (TO, TW, KW), pp. 321–326.
DAC-1990-PapachristouK #linear #optimisation #scheduling: A Linear Program Driven Scheduling and Allocation Method Followed by an Interconnect Optimization Algorithm (CAP, HK), pp. 77–83.
DAC-1990-RamakrishnanK: Extension of the Critical Path Tracing Algorithm (TR, LK), pp. 720–723.
DAC-1990-SinghS #heuristic #problem: A Heuristic Algorithm for the Fanout Problem (KJS, ALSV), pp. 357–360.
DAC-1990-Soukup #database: Organized C: A Unified Method of Handling Data in CAD Algorithms and Databases (JS), pp. 425–430.
DAC-1990-TeraiTS #assurance #constraints #design #layout: A New Min-Cut Placement Algorithm for Timing Assurance Layout Design Meeting Net Length Constraint (MT, KT, KS), pp. 96–102.
DAC-1990-WangW #optimisation: An Optimal Algorithm for Floorplan Area Optimization (TCW, DFW), pp. 180–186.
PPoPP-1990-DinningS #comparison #detection #empirical #monitoring: An Empirical Comparison of Monitoring Algorithms for Access Anomaly Detection (AD, ES), pp. 1–10.
STOC-1990-AroraLM #network #online: On-line Algorithms for Path Selection in a Nonblocking Network (SA, FTL, BMM), pp. 149–158.
STOC-1990-Ben-DavidBKTW #on the #online #power of: On the Power of Randomization in Online Algorithms (SBD, AB, RMK, GT, AW), pp. 379–386.
STOC-1990-BernGRS #online: Online Algorithms for Locating Checkpoints (MWB, DHG, AR, MS), pp. 359–368.
STOC-1990-BoardP #on the: On the Necessity of Occam Algorithms (RAB, LP), pp. 54–63.
STOC-1990-CoppersmithDRS #graph #online #random: Random Walks on Weighted Graphs, and Applications to On-line Algorithms (DC, PD, PR, MS), pp. 369–378.
STOC-1990-GoddardKS #random #sorting: Optimal Randomized Algorithms for Local Sorting and Set-Maxima (WG, VK, LJS), pp. 45–53.
STOC-1990-KaoK #graph #parallel #performance #towards #transitive: Towards Overcoming the Transitive-Closure Bottleneck: Efficient Parallel Algorithms for Planar Digraphs (MYK, PNK), pp. 181–192.
STOC-1990-KarpVV #online: An Optimal Algorithm for On-line Bipartite Matching (RMK, UVV, VVV), pp. 352–358.
STOC-1990-KleinST #approximate #concurrent #performance: Leighton-Rao Might Be Practical: Faster Approximation Algorithms for Concurrent Flow with Uniform Capacities (PNK, CS, ÉT), pp. 310–321.
CADE-1990-Boudet #equation #performance #unification: Unification in a Combination of Equational Theories: an Efficient Algorithm (AB), pp. 292–307.
CADE-1990-ChouG #composition #geometry #proving #theorem proving: Ritt-Wu’s Decomposition Algorithm and Geometry Theorem Proving (SCC, XSG), pp. 207–220.
CAV-1990-CourcoubetisVWY #memory management #performance #verification: Memory Efficient Algorithms for the Verification of Temporal Properties (CC, MYV, PW, MY), pp. 233–242.
CLP-1990-GallagherB90: The Derivation of an Algorithm for Program Specialisation (JPG, MB), pp. 732–746.
CLP-1990-InamuraO90 #detection: A Detection Algorithm of Perpetual Suspension in KL1 (YI, SO), pp. 18–30.
CLP-1990-Malhotra90 #prolog: An Algorithm for Optimal Back-Striding in Prolog (VMM), pp. 147–158.
CSL-1990-Durdanovic #garbage collection #performance #prolog: A Fast Garbage Collection Algorithm for WAM-Based Prolog (ID), pp. 110–127.
CSL-1990-Gabbay #proving: Algorithmic Proof with Diminishing Resources, Part 1 (DMG), pp. 156–173.
LICS-1990-BoudetCD #equation #unification: A New AC Unification Algorithm with an Algorithm for Solving Systems of Diophantine Equations (AB, EC, HD), pp. 289–299.
PODS-1989-MannilaR #normalisation #testing: Practical Algorithms for Finding Prime Attributes and Testing Normal Forms (HM, KJR), pp. 128–133.
PODS-1989-YuanC #database #evaluation #query #relational: A Sound and Complete Query Evaluation Algorithm for Relational Databases with Disjunctive Information (LYY, DAC), pp. 66–74.
SIGMOD-1989-NavatheR #clustering #database #design #visual notation: Vertical Partitioning for Database Design: A Graphical Algorithm (SBN, MR), pp. 440–450.
SIGMOD-1989-SchneiderD #evaluation #parallel #performance: A Performance Evaluation of Four Parallel Join Algorithms in a Shared-Nothing Multiprocessor Environment (DAS, DJD), pp. 110–121.
VLDB-1989-IyerRV #multi: Percentile Finding Algorithm for Multiple Sorted Runs (BRI, GRR, PJV), pp. 135–144.
VLDB-1989-LorieY #communication #database #parallel #sorting: A Low Communication Sort Algorithm for a Parallel Database Machine (RAL, HCY), pp. 125–134.
VLDB-1989-Muralikrishna #data flow #optimisation #query: Optimization and Dataflow Algorithms for Nested Tree Queries (MM), pp. 77–85.
SEI-1989-Collberg #data type #re-engineering: Data Structures, Algorithms, and Software Engineering (CSC), pp. 70–79.
ICALP-1989-Colson #recursion: About Primitive Recursive Algorithms (LC), pp. 194–206.
ICALP-1989-EppsteinG #combinator #parallel: Parallel Algorithmic Techniques for Combinatorial Computation (DE, ZG), pp. 304–318.
ICALP-1989-FeldmanM #probability: An Optimal Probabilistic Algorithm For Synchronous Byzantine Agreement (PF, SM), pp. 341–378.
ICALP-1989-GalilP #approximate #string: An Improved Algorithm for Approximate String Matching (ZG, KP), pp. 394–404.
ICALP-1989-LouchardRS #analysis #probability: Dynamic Algorithms in D. E. Knuth’s Model: A Probabilistic Analysis (GL, BR, RS), pp. 521–533.
ICALP-1989-RaghavanS #memory management #online: Memory Versus Randomization in On-line Algorithms (PR, MS), pp. 687–703.
RTA-1989-Nipkow: Combining Matching Algorithms: The Rectangular Case (TN), pp. 343–358.
RTA-1989-Snyder #equation #generative #performance #set: Efficient Ground Completion: An O(n log n) Algorithm for Generating Reduced Sets of Ground Rewrite Rules Equivalent to a Set of Ground Equations E (WS), pp. 419–433.
ML-1989-CaruanaSE #bias #induction #multi #search-based #using: Using Multiple Representations to Improve Inductive Bias: Gray and Binary Coding for Genetic Algorithms (RC, JDS, LJE), pp. 375–378.
ML-1989-Fogarty #incremental #learning #realtime #search-based: An Incremental Genetic Algorithm for Real-Time Learning (TCF), pp. 416–419.
ML-1989-FriedrichN #induction #learning #using: Using Domain Knowledge to Improve Inductive Learning Algorithms for Diagnosis (GF, WN), pp. 75–77.
ML-1989-GoodmanS #induction #probability #set: The Induction of Probabilistic Rule Sets — The Itrule Algorithm (RMG, PS), pp. 129–132.
ML-1989-Grefenstette #incremental #learning #search-based: Incremental Learning of Control Strategies with Genetic algorithms (JJG), pp. 340–344.
ML-1989-LambertTL #concept #hybrid #learning #recursion: Generalized Recursive Splitting Algorithms for Learning Hybrid Concepts (BLL, DKT, SCYL), pp. 496–498.
ML-1989-MohanT #automation: Automatic Construction of a Hierarchical Generate-and-Test Algorithm (SM, CT), pp. 483–484.
ML-1989-Mostow #object-oriented #representation: An Object-Oriented Representation for Search algorithms (JM), pp. 489–491.
ML-1989-PagalloH: Two Algorithms That Learn DNF by Discovering Relevant Features (GP, DH), pp. 119–123.
ML-1989-SarrettP #empirical #learning: One-Sided Algorithms for Integrating Empirical and Explanation-Based Learning (WS, MJP), pp. 26–28.
SIGIR-1989-StanfillTW #information retrieval #parallel: A Parallel Indexed Algorithm for Information Retrieval (CS, RT, DLW), pp. 88–97.
DAC-1989-AgrawalTD #hardware #logic: Algorithms for Accuracy Enhancement in a Hardware Logic Simulator (PA, RT, WJD), pp. 645–648.
DAC-1989-BonapaceL #design: An O(nlogm) Algorithm for VLSI Design Rule Checking (CRB, CYL), pp. 503–507.
DAC-1989-BuiHJL #graph #performance: Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms (TNB, CH, CJ, FTL), pp. 775–778.
DAC-1989-Coppola #analysis #logic: New Methods in the Analysis of Logic Minimization Data and Algorithms (AJC), pp. 226–231.
DAC-1989-JabriS #knowledge-based #named #top-down: PIAF: A Knowledge-based/Algorithm Top-Down Floorplanning System (MAJ, DJS), pp. 582–585.
DAC-1989-McGeerB89a #network #performance: Efficient Algorithms for Computing the Longest Viable Path in a Combinational Network (PCM, RKB), pp. 561–567.
DAC-1989-NarayananP #fault #parallel #simulation: A Massively Parallel Algorithm for Fault Simulation on the Connection Machine (VN, VP), pp. 734–737.
DAC-1989-Norrod #automation #generative #hardware #testing: An Automatic Test Generation Algorithm for Hardware Description Languages (FEN), pp. 429–434.
DAC-1989-PatilB #bound #branch #generative #parallel #testing: A Parallel Branch and Bound Algorithm for Test Generation (SP, PB), pp. 339–343.
DAC-1989-PaulinK #scheduling #synthesis: Scheduling and Binding Algorithms for High-Level Synthesis (PGP, JPK), pp. 1–6.
DAC-1989-PitaksanonkulTLG #named: DTR: A Defect-Tolerant Routing Algorithm (AP, ST, CL, JAG), pp. 795–798.
DAC-1989-PotkonjackR #graph #resource management #scheduling: A Scheduling and Resource Allocation Algorithm for Hierarchical Signal Flow Graphs (MP, JMR), pp. 7–12.
DAC-1989-SargentB #fault #parallel #standard: A Parallel Row-based Algorithm for Standard Cell Placement with Integrated Error Control (JSS, PB), pp. 590–593.
DAC-1989-ShinL #2d #layout #performance: An Efficient Two-Dimensional Layout Compaction Algorithm (HS, CYL), pp. 290–295.
DAC-1989-YenDG #analysis #performance: Efficient Algorithms for Extracting the K most Critical Paths in Timing Analysis (SHY, DHCD, SG), pp. 649–654.
DAC-1989-YuZYL #behaviour #convergence #novel: A Novel Algorithm for Improving Convergence Behavior of Circuit Simulators (ZY, WZ, ZY, YEL), pp. 626–629.
STOC-1989-Awerbuch #distributed: Distributed Shortest Paths Algorithms (BA), pp. 490–500.
STOC-1989-Blum #approximate: An O(n⁰⋅⁴)-Approximation Algorithm for 3-Coloring (and Improved Approximation Algorithm for k-Coloring) (AB), pp. 535–542.
STOC-1989-ChazelleEGS #combinator: Lines in Space-Combinatorics, Algorithms and Applications (BC, HE, LJG, MS), pp. 382–393.
STOC-1989-CohenM #detection #graph #polynomial: Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Dynamic Graphs (EC, NM), pp. 523–534.
STOC-1989-DyerFK #approximate #polynomial #random: A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies (MED, AMF, RK), pp. 375–381.
STOC-1989-FellowsL #on the #performance #polynomial: On Search, Decision and the Efficiency of Polynomial-Time Algorithms (MRF, MAL), pp. 501–512.
STOC-1989-Motwani #analysis #graph #problem: Expanding Graphs and the Average-case Analysis of Algorithms for Matchings and Related Problems (RM), pp. 550–561.
PODS-1988-Hadzilacos #concurrent #graph #multi: Serialization Graph Algorithms for Multiversion Concurrency Control (TH), pp. 135–141.
PODS-1988-Morris #exclamation: An Algorithm for Ordering Subgoals in NAIL! (KAM), pp. 82–88.
SIGMOD-1988-LeuchnerMS #dependence #functional #polynomial #testing: A Polynomial Time Algorithm for Testing Implications of a Join Dependency and Embodied Functional Dependencies (JHL, LM, GS), pp. 218–224.
SIGMOD-1988-SellisLR #concept #implementation #scalability: Implementing Large Production Systems in a DBMS Environment: Concepts and Algorithms (TKS, CCL, LR), pp. 404–412.
SIGMOD-1988-YuanC #database #evaluation #null #query #relational: A Sound and Complete Query Evaluation Algorithm for Relational Databases with Null Values (LYY, DAC), pp. 74–81.
VLDB-1988-AgrawalA: Reducing Storage for Quorum Consensus Algorithms (DA, AEA), pp. 419–430.
VLDB-1988-CareyL #case study #concurrent #distributed #performance #replication: Distributed Concurrency Control Performance: A Study of Algorithms, Distribution, and Replication (MJC, ML), pp. 13–25.
VLDB-1988-IoannidisR #performance #transitive: Efficient Transitive Closure Algorithms (YEI, RR), pp. 382–394.
VLDB-1988-Jhingran #database #optimisation #performance #query: A Performance Study of Query Optimization Algorithms on a Database System Supporting Procedures (AJ), pp. 88–99.
VLDB-1988-Rougemont #fixpoint #representation #scalability #semantics: Fixed-point semantics and the representation of algorithms on large data (MdR), pp. 264–272.
ICALP-1988-AlbertF #analysis #complexity #multi: Average Case Complexity Analysis of the Rete Multi-Pattern Match Algorithm (LA, FF), pp. 18–37.
ICALP-1988-BajajK #geometry #modelling: Algorithms for Planar Geometric Models (CLB, MSK), pp. 67–81.
ICALP-1988-EdelsbrunnerGPPSS #combinator: Arrangements of Curves in the Plane — Topology, Combinatorics, and Algorithms (HE, LJG, JP, RP, RS, MS), pp. 214–229.
ICALP-1988-KruskalRS #complexity #parallel #performance: A Complexity Theory of Efficient Parallel Algorithms (CPK, LR, MS), pp. 333–346.
ICALP-1988-Lautemann #graph grammar #performance: Efficient Algorithms on Context-Free Graph Grammars (CL), pp. 362–378.
ICALP-1988-LingasS #graph #morphism #polynomial: A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs (AL, MMS), pp. 394–409.
ML-1988-CaruanaS #bias #representation #search-based: Representation and Hidden Bias: Gray vs. Binary Coding for Genetic Algorithms (RC, JDS), pp. 153–161.
ML-1988-Sammut #evaluation: Experimental Results from an Evaluation of Algorithms that Learn to Control Dynamic Systems (CS), pp. 437–443.
ALP-1988-Kucherov #induction #proving #testing: A New Quasi-Reducibility Testing Algorithm and its Application to Proofs by Induction (GK), pp. 204–213.
PLILP-1988-Voisin #adaptation #bottom-up #earley #parsing: A Bottom-Up Adaption of Earley’s Parsing Algorithm (FV), pp. 146–160.
ICSE-1988-HuangZC #clustering #distributed #heuristic #realtime: Heuristic Software Partitioning Algorithms for Distributed Real-Time Applications (XH, HZ, XC), pp. 116–121.
CCHSC-1988-GyimothyHKT #incremental: Incremental Algorithms in Prof-LP (TG, TH, FK, JT), pp. 93–102.
DAC-1988-ChakravertiC #array #metaprogramming: Routing Algorithm for Gate Array Macro Cells (AC, MJC), pp. 658–662.
DAC-1988-ChiangNL #analysis #performance: Time Efficient VLSI Artwork Analysis Algorithms in GOALIE2 (KWC, SN, CYL), pp. 471–475.
DAC-1988-ChoiHB #simulation: Incremental-in-time Algorithm for Digital Simulation (KC, SYH, TB), pp. 501–505.
DAC-1988-GaiMS #concurrent #fault #performance #simulation: The Performance of the Concurrent Fault Simulation Algorithms in MOZART (SG, PLM, FS), pp. 692–697.
DAC-1988-HelliwellP #multi #performance: A Fast Algorithm to Minimize Multi-Output Mixed-Polarity Generalized Reed-Muller Forms (MH, MAP), pp. 427–432.
DAC-1988-HillAHS #fault #simulation: A New Two Task Algorithm for Clock Mode Fault Simulation in Sequential Circuits (FJH, EA, WKH, GQS), pp. 583–586.
DAC-1988-KazamaKNM #evaluation #logic #performance #simulation: Algorithm for Vectorizing Logic Simulation and Evaluation of “VELVET” Performance (YK, YK, MN, HM), pp. 231–236.
DAC-1988-KuoCS #performance: Fast Algorithm for Optimal Layer Assignment (YSK, TCC, WKS), pp. 554–559.
DAC-1988-MaoC #generative #metric #named #self #testing #using: Dytest: A Self-Learning Algorithm Using Dynamic Testability Measures to Accelerate Test Generation (WM, MDC), pp. 591–596.
DAC-1988-Sherman #analysis #generative: Algorithms for Timing Requirement Analysis and Generation (SKS), pp. 724–727.
DAC-1988-TakamineMNMK #development: Clock Event Suppression Algorithm of VELVET and Its Application to S-820 Development (YT, SM, SN, MM, SK), pp. 716–719.
DAC-1988-TsayKH #named #performance: Proud: A Fast Sea-of-Gates Placement Algorithm (RST, ESK, CPH), pp. 318–323.
DAC-1988-WolfKA #kernel #logic #multi: A Kernel-Finding State Assignment Algorithm for Multi-Level Logic (WW, KK, JA), pp. 433–438.
DAC-1988-YenGD #analysis: A Path Selection Algorithm for Timing Analysis (HCY, SG, DHCD), pp. 720–723.
PPEALS-1988-StrammB #compilation #heuristic: Communication-Sensitive Heuristics and Algorithms for Mapping Compilers (BS, FB), pp. 222–234.
ESOP-1988-Laville #implementation #lazy evaluation #pattern matching: Implementation of Lazy Pattern Matching Algorithms (AL), pp. 298–316.
STOC-1988-AggarwalC #memory management: Virtual Memory Algorithms (AA, AKC), pp. 173–185.
STOC-1988-Ben-OrT #multi: A Deterministic Algorithm for Sparse Multivariate Polynominal Interpolation (MBO, PT), pp. 301–309.
STOC-1988-FederG #approximate #clustering: Optimal Algorithms for Approximate Clustering (TF, DHG), pp. 434–444.
STOC-1988-FeldmanM: Optimal Algorithms for Byzantine Agreement (PF, SM), pp. 148–161.
STOC-1988-GabowT #problem: Almost-Optimum Speed-ups of Algorithms for Bipartite Matching and Related Problems (HNG, RET), pp. 514–527.
STOC-1988-GabowW #game studies: Forests, Frames and Games: Algorithms for Matroid Sums and Applications (HNG, HHW), pp. 407–421.
STOC-1988-KarloffR #pseudo #random: Randomized Algorithms and Pseudorandom Numbers (HJK, PR), pp. 310–321.
STOC-1988-ManasseMS #online #problem: Competitive Algorithms for On-line Problems (MSM, LAM, DDS), pp. 322–333.
STOC-1988-Orlin #performance: A Faster Strongly Polynominal Minimum Cost Flow Algorithm (JBO), pp. 377–387.
STOC-1988-PapadimitriouY88b #analysis #architecture #independence #parallel #towards: Towards an Architecture-Independent Analysis of Parallel Algorithms (CHP, MY), pp. 510–513.
CADE-1988-Socher #matrix: A Subsumption Algorithm Based on Characteristic Matrices (RS), pp. 573–581.
CADE-1988-Walther #automation #bound #proving #termination: Argument-Bounded Algorithms as a Basis for Automated Termination Proofs (CW), pp. 602–621.
JICSCP-1988-Kaplan88 #complexity #logic programming #source code: Algorithmic Complexity of Logic Programs (SK), pp. 780–793.
JICSCP-1988-KlingerS88 #compilation #exclamation: A Decision Tree Compilation Algorithm for FCP(!, : , ?) (SK, EYS), pp. 1315–1336.
JICSCP-1988-LichtensteinS88 #debugging: Abstract Algorithmic Debugging (YL, EYS), pp. 512–531.
JICSCP-1988-SomogyiRV88 #backtracking #execution: A Stream AND-Parallel Execution Algorithm with Backtracking (ZS, KR, JV), pp. 1142–1159.
LICS-1988-KuperMPP #anti #parallel #performance: Efficient Parallel Algorithms for Anti-Unification and Relative Complement (GMK, KM, KVP, KJP), pp. 112–120.
PODS-1987-WangL #concurrent #database #distributed: The Precedence-Assignment Model for Distributed Database Concurrency Control Algorithms (CPW, VOKL), pp. 119–128.
SIGMOD-1987-LehmanC #database: A Recovery Algorithm for A High-Performance Memory-Resident Database System (TJL, MJC), pp. 104–117.
SIGMOD-1987-RichardsonLM #design #evaluation #parallel #pipes and filters: Design and Evaluation of Parallel Pipelined Join Algorithms (JPR, HL, KPM), pp. 399–409.
VLDB-1987-AgrawalJ #database #transitive: Direct Algorithms for Computing the Transitive Closure of Database Relations (RA, HVJ), pp. 255–266.
VLDB-1987-JajodiaM: Enhancements to the Voting Algorithm (SJ, DM), pp. 399–406.
ICALP-1987-Holldobler #confluence #unification: A Unification Algorithms for Confluent Theories (SH), pp. 31–41.
ICALP-1987-Marchetti-SpaccamelaV #online #performance #problem: Efficient On-Line Algorithms for the Knapsack Problem (AMS, CV), pp. 445–456.
ICALP-1987-Metivier #automaton #graph: An Algorithm for Computing Asynchronous Automata in the Case of Acyclic Non-Commutation Graphs (YM), pp. 226–236.
ICALP-1987-Miyano #problem: The Lexicographically First Maximal Subgraph Problems: P-Completeness and NC Algorithms (SM), pp. 425–434.
RTA-1987-Benois #automaton #complexity #regular expression #term rewriting: Descendants of Regular Language in a Class of Rewriting Systems: Algorithm and Complexity of an Automata Construction (MB), pp. 121–132.
RTA-1987-ChoppyKS #complexity #term rewriting: Algorithmic Complexity of Term Rewriting Systems (CC, SK, MS), pp. 256–273.
ECOOP-1987-DucournauH #inheritance #multi #object-oriented #on the #programming: On Some Algorithms for Multiple Inheritance in Object-Oriented Programming (RD, MH), pp. 243–252.
DAC-1987-FaroughiS #array: An Improved Systematic Method for Constructing Systolic Arrays from Algorithms (NF, MAS), pp. 26–34.
DAC-1987-JonesB #parallel #performance #standard: Performance of a Parallel Algorithm for Standard Cell Placement on the Intel Hypercube (MJ, PB), pp. 807–813.
DAC-1987-KirklandM: A Topological Search Algorithm for ATPG (TEK, MRM), pp. 502–508.
DAC-1987-MaDSW #implementation #logic #parallel #verification: Logic Verification Algorithms and Their Parallel Implementation (HKTM, SD, ALSV, RW), pp. 283–290.
DAC-1987-MazumderPF #design #parallel #random #testing: Design and Algorithms for Parallel Testing of Random Access and Content Addressable Memories (PM, JHP, WKF), pp. 689–694.
CFLP-1987-Piperno #abstraction #combinator #logic: A Compositive Abstraction Algorithm for Combinatory Logic (AP), pp. 39–51.
STOC-1987-AggarwalA #random: A Random NC Algorithm for Depth First Search (AA, RJA), pp. 325–334.
STOC-1987-AggarwalGSS #diagrams #linear: A Linear Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon (AA, LJG, JBS, PWS), pp. 39–45.
STOC-1987-Awerbuch #distributed #problem #summary: Optimal Distributed Algorithms for Minimum Weight Spanning Tree, Counting, Leader Election and Related Problems (Detailed Summary) (BA), pp. 230–240.
STOC-1987-Bach #analysis #random: Realistic Analysis of Some Randomized Algorithms (EB), pp. 453–461.
STOC-1987-BorodinLS #online: An Optimal Online Algorithm for Metrical Task Systems (AB, NL, MES), pp. 373–382.
STOC-1987-Clarkson #approximate: Approximation Algorithms for Shortest Path Motion Planning (KLC), pp. 56–65.
STOC-1987-DietzS #maintenance #order: Two Algorithms for Maintaining Order in a List (PFD, DDS), pp. 365–372.
STOC-1987-MillerR #graph #parallel: A New Graph Triconnectivity Algorithm and Its Parallelization (GLM, VR), pp. 335–344.
STOC-1987-NaorNS #graph #parallel #performance: Fast Parallel Algorithms for Chordal Graphs (JN, MN, AAS), pp. 355–364.
STOC-1987-Vaidya #linear #programming: An Algorithm for Linear Programming which Requires O(((m+n)n^2 + (m+n)^1.5 n)L) Arithmetic Operations (PMV), pp. 29–38.
CSL-1987-Weber: Algorithms for Propositional Updates (AW0), pp. 335–346.
ICLP-1987-Shapiro87 #execution #implementation #prolog: An OR-Parallel Execution Algorithm for PROLOG and Its FCP Implementation (EYS), pp. 311–337.
SLP-1987-Huntbach87 #debugging: Algorithmic PARLOG Debugging (MMH), pp. 288–297.
SIGMOD-1986-LindsayHM #difference: A Snapshot Differential Refresh Algorithm (BGL, LMH, CM, HP, PFW), pp. 53–60.
SIGMOD-1986-Willard #worst-case: Good Worst-Case Algorithms for Inserting and Deleting Records in Dense Sequential Files (DEW), pp. 251–260.
VLDB-1986-Menon #case study #database #multi #sorting: A Study of Sort Algorithms for Multiprocessor Database Machines (JM0), pp. 197–206.
VLDB-1986-ThomRN #database #deduction: A Superjoin Algorithm for Deductive Databases (JAT, KR, LN), pp. 189–196.
VLDB-1986-WongL #database #scalability: Transposition Algorithms on Very Large Compressed Databases (HKTW, JZL), pp. 304–311.
ICALP-1986-ArquesFGG #approach #combinator #comparison #concurrent #database: Comparison of Algorithms Controlling Concurrent Access to a Database: A Combinatorial Approach (DA, JF, MTG, PG), pp. 11–20.
ICALP-1986-AverbuchWG #classification #polynomial: Classification of all the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial (AA, SW, ZG), pp. 31–39.
ICALP-1986-HermannP #on the: On Nontermination of Knuth-Bendix Algorithm (MH, IP), pp. 146–156.
ICALP-1986-Lengauer #testing: Hierarchical Planary Testing Algorithms (TL), pp. 215–225.
ICALP-1986-Schnorr #performance #reduction: A More Efficient Algorithm for Lattice Basis Reduction (CPS), pp. 359–369.
ICALP-1986-Simon #graph #transitive: An Improved Algorithm for Transitive Closure on Acyclic Digraphs (KS), pp. 376–386.
ICALP-1986-SpirakisT #performance: A Very Fast, Practical Algorithm for Finding a Negative Cycle in a Digraph (PGS, AKT), pp. 397–406.
ICALP-1986-VarmanD #parallel: A Parallel Vertex Insertion Algorithm For Minimum Spanning Trees (PJV, KD), pp. 424–433.
ICALP-1986-YouS #confluence #term rewriting: E-Unification Algorithms for a Class of Confluent Term Rewriting Systems (JHY, PAS), pp. 454–463.
GG-1986-MontanariR #constraints #network #performance: An Efficient Algorithm for the Solution of Hierarchical Networks of Constraints (UM, FR), pp. 440–457.
DAC-1986-BarclayA #generative #heuristic #testing: A heuristic chip-level test generation algorithm (DSB, JRA), pp. 257–262.
DAC-1986-BhaskerS #graph #linear: A linear algorithm to find a rectangular dual of a planar triangulated graph (JB, SS), pp. 108–114.
DAC-1986-BruckKKR #composition #concurrent #synthesis: Synthesis of concurrent modular controllers from algorithmic descriptions (RB, BK, TK, FJR), pp. 285–292.
DAC-1986-OgawaISTKYC #optimisation #performance: Efficient placement algorithms optimizing delay for high-speed ECL masterslice LSIs (YO, TI, YS, HT, TK, KY, KC), pp. 404–410.
DAC-1986-WatanabeS #hardware #implementation: A new routing algorithm and its hardware implementation (TW, YS), pp. 574–580.
DAC-1986-WeiweiX #fault #generative #robust #testing: Robust test generation algorithm for stuck-open fault in CMOS circuits (WM, XL), pp. 236–242.
DAC-1986-WongL #design: A new algorithm for floorplan design (DFW, CLL), pp. 101–107.
DAC-1986-Xiong: Algorithms for global routing (JGX), pp. 824–830.
STOC-1986-Ben-OrFKT #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-CoffmanL #performance: A Provably Efficient Algorithm for Dynamic Storage Allocation (EGCJ, FTL), pp. 77–90.
STOC-1986-ColeV #design #metaprogramming #parallel: Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms (RC, UV), pp. 206–219.
STOC-1986-KapoorV #multi #performance #polynomial #programming: Fast Algorithms for Convex Quadratic Programming and Multicommodity Flows (SK, PMV), pp. 147–159.
STOC-1986-LandauV #approximate #parallel #performance #string: Introducing Efficient Parallelism into Approximate String Matching and a New Serial Algorithm (GML, UV), pp. 220–230.
STOC-1986-LeightonS #analysis #bound #grid: Tight Bounds for Minimax Grid Matching, With Applications to the Average Case Analysis of Algorithms (FTL, PWS), pp. 91–103.
STOC-1986-Mulmuley #matrix #parallel #performance #rank: A Fast Parallel Algorithm to Compute the Rank of a Matrix over an Arbitrary Field (KM), pp. 338–339.
STOC-1986-SchnorrS #sorting: An Optimal Sorting Algorithm for Mesh Connected Computers (CPS, AS), pp. 255–263.
STOC-1986-TarjanW #linear: A Linear-Time Algorithm for Triangulating Simple Polygons (RET, CJVW), pp. 380–388.
CADE-1986-DworkCKS #parallel: Parallel Algorithms for Term Matching (CD, PCK, LJS), pp. 416–430.
CADE-1986-Herold #unification: Combination of Unification Algorithms (AH), pp. 450–469.
CADE-1986-KutzlerS #geometry #proving #theorem proving: A Geometry Theorem Prover Based on Buchberger’s Algorithm (BK, SS), pp. 693–694.
ICLP-1986-LinKL86 #backtracking #execution #logic programming #parallel #source code: An Intelligent Backtracking Algorithm for Parallel Execution of Logic Programs (YJL, VK, CHCL), pp. 55–68.
LICS-1986-Browne #automation #finite #logic #using #verification: An Improved Algorithm for the Automatic Verification of Finite State Systems Using Temporal Logic (MCB), pp. 260–266.
LICS-1986-Kirchner #unification: Computing Unification Algorithms (CK), pp. 206–216.
LICS-1986-Mohring #calculus #development: Algorithm Development in the Calculus of Constructions (CM), pp. 84–91.
SLP-1986-MartelliMR86 #equation #unification: An Algorithm for Unification in Equational Theories (AM, CM, GR), pp. 180–186.
PODS-1985-HadzilacosP #aspect-oriented #concurrent #multi: Algorithmic Aspects of Multiversion Concurrency Control (TH, CHP), pp. 96–104.
PODS-1985-Keller #database: Algorithms for Translating View Updates to Database Updates for Views Involving Selections, Projections, and Joins (AMK), pp. 154–163.
PODS-1985-Kundu: An Improved Algorithm for Finding a Key of a Relation (SK), pp. 189–192.
SIGMOD-1985-FushimiKNTM #adaptation #clustering #evaluation #multi #performance: Algorithm and Performance Evaluation of Adaptive Multidimensional Clustering Technique (SF, MK, MN, HT, TMO), pp. 308–318.
VLDB-1985-DeWittG #multi: Multiprocessor Hash-Based Join Algorithms (DJD, RHG), pp. 151–164.
VLDB-1985-LuC #distributed #network: Some Experimental Results on Distributed Join Algorithms in a Local Network (HL, MJC), pp. 292–304.
ICALP-1985-Fortune #performance: A Fast Algorithm for Polygon Containment by Translation (SF), pp. 189–198.
ICALP-1985-Furer #testing: Deterministic and Las Vegas Primality Testing Algorithms (MF), pp. 199–209.
ICALP-1985-GabowS #performance: Efficient Algorithms for Graphic Matroid Intersection and Parity (HNG, MFMS), pp. 210–220.
ICALP-1985-KurtzM #analysis #distributed #probability #set: A Probabilistic Distributed Algorithm for Set Intersection and Its Analysis (TGK, UM), pp. 356–362.
ICALP-1985-LandauYG #distributed #network: Distributed Algorithms in Synchronous Broadcasting Networks (GML, MMY, ZG), pp. 363–372.
ICALP-1985-Lovasz: Vertex Packing Algorithms (LL), pp. 1–14.
ICALP-1985-LubyR #behaviour #bidirectional: A Bidirectional Shortest-Path Algorithm With Good Average-Case Behavior (ML, PR), pp. 394–403.
ICALP-1985-SippuS #design #on the #performance #relational #using: On the Use of Relational Expressions in the Design of Efficient Algorithms (SS, ESS), pp. 456–464.
RTA-1985-PurdomB #performance: Fast Many-to-One Matching Algorithms (PWPJ, CAB), pp. 407–416.
RTA-1985-RetyKKL #logic programming #named #unification: NARROWER: A New Algorithm for Unification and Its Application to Logic Programming (PR, CK, HK, PL), pp. 141–157.
RTA-1985-Yelick #equation #unification: Combining Unification Algorithms for Confined Regular Equational Theories (KAY), pp. 365–380.
FPCA-1985-Hughes85a #distributed #garbage collection: A Distributed Garbage Collection Algorithm (JH), pp. 256–271.
FPCA-1985-PatelSE85 #analysis #hardware #multi #named #specification #synthesis: vFP: An Environment for the Multi-level Specification, Analysis, and Synthesis of Hardware Algorithms (DP, MDFS, MDE), pp. 238–255.
SIGIR-1985-Gordon #documentation #learning: A Learning Algorithm Applied to Document Description (MG), pp. 179–186.
DAC-1985-AndouYMKSH #automation: Automatic routing algorithm for VLSI (HA, IY, YM, YK, KS, KH), pp. 785–788.
DAC-1985-BierP #design #multi: An algorithm for design rule checking on a multiprocessor (GEB, ARP), pp. 299–304.
DAC-1985-HanS: Layering algorithms for single row routing (SH, SS), pp. 516–522.
DAC-1985-HennionSC #generative: A new algorithm for third generation circuit simulators: the one-step relaxation method (BH, PS, DC), pp. 137–143.
DAC-1985-KaoFL #automation: Algorithms for automatic transistor sizing in CMOS digital circuits (WHK, NF, CHL), pp. 781–784.
DAC-1985-KuoCH #heuristic: A heuristic algorithm for PLA block folding (YSK, CC, TCH), pp. 744–747.
DAC-1985-LaarhovenAD #logic: PHIPLA-a new algorithm for logic minimization (PJMvL, EHLA, MD), pp. 739–743.
DAC-1985-NodaYFKKF #array #automation #layout: Automatic layout algorithms for function blocks of CMOS gate arrays (SN, HY, EF, HK, HK, TF), pp. 46–52.
DAC-1985-SchellM #development #named: CADTOOLS: a CAD algorithm development system (ES, MRM), pp. 658–666.
DAC-1985-ShaD: An analytical algorithm for placement of arbitrarily sized rectangular blocks (LS, RWD), pp. 602–608.
DAC-1985-SongC: An algorithm for one and half layer channel routing (JNS, YKC), pp. 131–136.
STOC-1985-Anderson #parallel #problem: A Parallel Algorithm for the Maximal Path Problem (RA), pp. 33–37.
STOC-1985-BollobasFF #graph #random: An Algorithm for Finding Hamilton Cycles in a Random Graph (BB, TIF, AMF), pp. 430–439.
STOC-1985-BollobasS #behaviour #on the #set: On the Expected Behaviour of Disjoint Set Union Algorithms (BB, IS), pp. 224–231.
STOC-1985-Clarkson #probability #problem: A Probabilistic Algorithm for the Post Office Problem (KLC), pp. 175–184.
STOC-1985-Harel #graph #linear #problem: A Linear Time Algorithm for Finding Dominators in Flow Graphs and Related Problems (DH), pp. 185–194.
STOC-1985-Heide #performance #problem #strict: Fast Algorithms for N-Dimensional Restrictions of Hard Problems (FMadH), pp. 413–420.
STOC-1985-LeisersonM #testing: Algorithms for Routing and Testing Routability of Planar VLSI Layouts (CEL, FMM), pp. 69–78.
STOC-1985-Luby #independence #parallel #problem #set: A Simple Parallel Algorithm for the Maximal Independent Set Problem (ML), pp. 1–10.
PODS-1984-FordC #concurrent: Concurrency Control Mechanisms and the Serializability of Concurrent Tree Algorithms (RF, JC), pp. 51–60.
SIGMOD-1984-BoralG #adaptation #concurrent #self #towards: Towards A Self-Adapting Centralized Concurrency Control Algorithm (HB, IG), pp. 18–32.
VLDB-1984-CareyS #concurrent #database #performance: The Performance of Concurrency Control Algorithms for Database Management Systems (MJC, MS), pp. 107–118.
VLDB-1984-Tanaka: Bit-Sliced VLSI Algorithm for Search and Sort (YT), pp. 225–234.
VLDB-1984-Zhu #database #graph #recognition: Line Graph of Gamma-Acyclic Database Schems and its Recognition Algorithm (YzZ), pp. 218–221.
ICALP-1984-KirschenhoferP #analysis #recursion #traversal: Recursion Depth Analysis for Special Tree Traversal Algorithms (PK, HP), pp. 303–311.
ICALP-1984-Mannila #metric #sorting: Measures of Presortedness and Optimal Sorting Algorithms (HM), pp. 324–336.
ICALP-1984-PaigeT #linear #problem: A Linear Time Algorithm to Solve the Single Function Coarsest Partition Problem (RP, RET), pp. 371–379.
ICALP-1984-Schonhage #integer #reduction: Factorization of Univariate Integer Polynomials by Diophantine Aproximation and an Improved Basis Reduction Algorithm (AS), pp. 436–447.
ICALP-1984-Schoning #approach #robust: Robust Algorithms: A Different Approach to Oracles (US), pp. 448–453.
ICALP-1984-Willard #difference #problem #retrieval: Sampling Algorithms for Differential Batch Retrieval Problems (DEW), pp. 514–526.
SIGIR-1984-HahnR #approach #generative #graph: Computing text Constituency: An Algorithmic Approach to the Generation of Text Graphs (UH, UR), pp. 343–368.
DAC-1984-Clow: A global routing algorithm for general cells (GWC), pp. 45–51.
DAC-1984-EtiembleADB #evaluation: Micro-computer oriented algorithms for delay evaluation of MOS gates (DE, VA, NHD, JCB), pp. 358–364.
DAC-1984-EvansBD #design #named #synthesis: ADL: An algorithmic design language for integrated circuit synthesis (WHE, JCB, NHD), pp. 66–72.
DAC-1984-HudsonWP: Module positioning algorithms for rectilinear macrocell assemblies (JAH, JAW, RCP), pp. 672–675.
DAC-1984-KozawaMT #layout #logic #top-down: Combine and top down block placement algorithm for hierarchical logic VLSI layout (TK, CM, HT), pp. 667–669.
DAC-1984-KozminskiK #graph: An algorithm for finding a rectangular dual of a planar graph for use in area planning for VLSI integrated circuits (KK, EK), pp. 655–656.
DAC-1984-LeinwandL: An algorithm for building rectangular floor-plans (SML, YTL), pp. 663–664.
DAC-1984-LewandowskiL #bound #branch: A branch and bound algorithm for optimal pla folding (JLL, CLL), pp. 426–433.
DAC-1984-LuellauHB #independence: A technology independent block extraction algorithm (FL, TH, EB), pp. 610–615.
DAC-1984-Palczewski #performance: Performance of algorithms for initial placement (MP), pp. 399–404.
DAC-1984-ShinshaKHAI #logic #named #synthesis: Polaris: Polarity propagation algorithm for combinational logic synthesis (TS, TK, MH, KA, KI), pp. 322–328.
STOC-1984-AdlerM #bound #polynomial: A Simplex Algorithm Whose Average Number of Steps is Bounded between Two Quadratic Functions of the Smaller Dimension (IA, NM), pp. 312–323.
STOC-1984-Clarkson #approximate #geometry #performance: Fast Expected-Time and Approximation Algorithms for Geometric Minimum Spanning Trees (KLC), pp. 342–348.
STOC-1984-FranzblauK #generative #independence #set: An Algorithm for Constructing Regions with Rectangles: Independence and Minimum Generating Sets for Collections of Intervals (DSF, DJK), pp. 167–174.
STOC-1984-Galil #parallel #string: Optimal Parallel Algorithms for String Matching (ZG), pp. 240–248.
STOC-1984-Karmarkar #linear #polynomial #programming: A New Polynomial-Time Algorithm for Linear Programming (NK), pp. 302–311.
STOC-1984-KarpW #independence #parallel #performance #problem #set: A Fast Parallel Algorithm for the Maximal Independent Set Problem (RMK, AW), pp. 266–272.
CADE-1984-Kirchner #equation #unification: A New Equational Unification Method: A Generalization of Martelli-Montanari’s Algorithm (CK), pp. 224–247.
CADE-1984-Kirchner84a #data type #induction: A General Inductive Completion Algorithm and Application to Abstract Data Types (HK), pp. 282–302.
CADE-1984-LankfordBB: A Progress Report on New Decision Algorithms for Finitely Prsented Abelian Groups (DL, GBI, AMB), pp. 128–141.
CADE-1984-Simon #higher-order #linear: A Linear Time Algorithm for a Subcase of Second Order Instantiation (DS), pp. 209–223.
ILPC-1984-Levy84 #concurrent #prolog #unification: A Unification Algorithm for Concurrent Prolog (JL), pp. 333–341.
ILPC-1984-Plaisted84 #debugging #performance: An Efficient Bug Location Algorithm (DAP), pp. 151–157.
SLP-1984-HellersteinS84 #concurrent #experience #implementation #parallel #prolog: Implementing Parallel Algorithms in Concurrent Prolog: The MAXFLOW Experience (LH, EYS), pp. 99–115.
PODS-1983-GoodmanSCDFR #database #distributed: A Recovery Algorithm for a Distributed Database System (NG, DS, AC, UD, SF, DRR), pp. 8–15.
PODS-1983-KorthKNR #comprehension #concurrent #detection #distributed #framework: A Framework for Understanding Distributed (Deadlock Detection) Algorithms (HFK, RK, AN, JTR), pp. 192–202.
PODS-1983-MurthyKK #approximate #network #problem: An Approximation Algorithm to the File Allocation Problem in Computer Networks (KM, JBK, MSK), pp. 258–266.
SIGMOD-1983-Carey #concurrent #database: An Abstract Model of Database Concurrency Control Algorithms (MJC), pp. 97–107.
ICALP-1983-Dehne #diagrams #nearest neighbour #on the: On O(N^4) Algorithm to Construct all Voronoi Diagrams for k Nearest Neighbor Searching (FKHAD), pp. 160–172.
ICALP-1983-JouannaudKK #equation #incremental #unification: Incremental Construction of Unification Algorithms in Equational Theories (JPJ, CK, HK), pp. 361–373.
ICALP-1983-LangSSS #performance #sorting: A Fast Sorting Algorithm for VLSI (HWL, MS, HS, HS), pp. 408–419.
SIGIR-1983-Eastman #evaluation #multi: Current Practice in The Evaluation of Multikey Search Algorithms (CME), pp. 197–204.
POPL-1983-BackMR #graph #performance: Derivation of Efficient DAG Marking Algorithms (RJB, HM, KJR), pp. 20–27.
POPL-1983-Paige #programming: Transformational Programming — Applications to Algorithms and Systems (RP), pp. 73–87.
DAC-1983-Bhavsar #calculus #design: Design For Test Calculus: An algorithm for DFT rules checking (DKB), pp. 300–307.
DAC-1983-ChyanB #array: A placement algorithm for array processors (DJC, MAB), pp. 182–188.
DAC-1983-Hsu: General river routing algorithm (CPH), pp. 578–583.
DAC-1983-KozawaTIHMOKYO #automation: Automatic placement algorithms for high packing density V L S I (TK, HT, TI, MH, CM, YO, KK, NY, YO), pp. 175–181.
DAC-1983-LiaoW #constraints #layout: An algorithm to compact a VLSI symbolic layout with mixed constraints (YZL, CKW), pp. 107–112.
DAC-1983-SupowitS: Placement algorithms for custom VLSI (KJS, EAS), pp. 164–170.
DAC-1983-SzymanskiW #analysis #performance: Space efficient algorithms for VLSI artwork analysis (TGS, CJVW), pp. 734–739.
STOC-1983-BakerBL #approximate: An Approximation Algorithm for Manhattan Routing (BSB, SNB, FTL), pp. 477–486.
STOC-1983-GabowT #linear #set: A Linear-Time Algorithm for a Special Case of Disjoint Set Union (HNG, RET), pp. 246–251.
STOC-1983-Gathen #algebra #parallel #problem: Parallel algorithms for algebraic problems (JvzG), pp. 17–23.
STOC-1983-Heide #linear #polynomial #problem: A Polynomial Linear Search Algorithm for the N-Dimensional Knapsack Problem (FMadH), pp. 70–79.
STOC-1983-Kannan #integer #problem #programming: Improved Algorithms for Integer Programming and Related Lattice Problems (RK), pp. 193–206.
STOC-1983-Pnueli #on the #probability: On the Extremely Fair Treatment of Probabilistic Algorithms (AP), pp. 278–290.
STOC-1983-Turner #analysis #probability: Probabilistic Analysis of Bandwidth Minimization Algorithms (JST), pp. 467–476.
PODS-1982-Hadzilacos: An Algorithm for Minimizing Roll Back Cost (VH), pp. 93–97.
PODS-1982-Soisalon-SoininenW #detection #safety #testing #transaction: An Optimal Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems (ESS, DW), pp. 108–116.
SIGMOD-1982-Valduriez #multi: Semi-Join Algorithms for Multiprocessor Systems (PV), pp. 225–233.
VLDB-1982-SuM #implementation #parallel: Parallel Algorithms and Their Implementation in MICRONET (SYWS, KPM), pp. 310–324.
ICALP-1982-Ben-Ari #garbage collection #on the fly #proving: On-the-Fly Garbage Collection: New Algorithms Inspired by Program Proofs (MBA), pp. 14–22.
ICALP-1982-Salwicki #data type: Algorithmic Theories of Data Structures (AS), pp. 458–472.
GG-1982-DoesL #generative #representation: Algorithms for the generation and drawing of maps representing cell clones (MdD, AL), pp. 39–57.
POPL-1982-Shapiro: Algorithmic Program Diagnosis (EYS), pp. 299–308.
SCC-1982-MauneyF #ll #lr #parsing: A Forward Move Algorithm for LL and LR Parsers (JM, CNF), pp. 79–87.
DAC-1982-Adshead #complexity #hardware #problem #question #scalability #towards: Towards VLSI complexity: The DA algorithm scaling problem: can special DA hardware help? (HGA), pp. 339–344.
DAC-1982-Grass #bound: A depth-first branch-and-bound algorithm for optimal PLA folding (WG), pp. 133–140.
DAC-1982-Heyns: The 1-2-3 routing algorithm or the single channel 2-step router on 3 interconnection layers (WH), pp. 113–120.
DAC-1982-Hsu #2d: A new two-dimensional routing algorithm (CPH), pp. 46–50.
DAC-1982-KambeCKION #evaluation: A placement algorithm for polycell LSI and ITS evaluation (TK, TC, SK, TI, NO, IN), pp. 655–662.
DAC-1982-Kedem #data type #online: The quad-CIF tree: A data structure for hierarchical on-line algorithms (GK), pp. 352–357.
DAC-1982-LightnerH #functional #megamodelling #testing: Implication algorithms for MOS switch level functional macromodeling implication and testing (MRL, GDH), pp. 691–698.
DAC-1982-LiptonN #automation #design #research: Design automation algorithms: Research and applications (RJL, JDN), p. 410.
DAC-1982-Supowit: A minimum-impact routing algorithm (KJS), pp. 104–112.
DAC-1982-WipflerWM #layout: A combined force and cut algorithm for hierarchical VLSI layout (GJW, MW, DAM), pp. 671–677.
STOC-1982-Bach #performance: Fast Algorithms under the Extended Riemann Hypothesis: A Concrete Estimate (EB), pp. 290–295.
STOC-1982-DolevS #multi #polynomial: Polynomial Algorithms for Multiple Processor Agreement (DD, HRS), pp. 401–407.
STOC-1982-PachlKR #bound #distributed #proving: A Technique for Proving Lower Bounds for Distributed Maximum-Finding Algorithms (JKP, EK, DR), pp. 378–382.
STOC-1982-Wigderson #approximate #graph: A New Approximate Graph Coloring Algorithm (AW), pp. 325–329.
CADE-1982-HornigB: Improvements of a Tautology-Testing Algorithm (KMH, WB), pp. 326–341.
ILPC-1982-Emden82 #prolog #source code: An Algorithm for Interpreting Prolog Programs (MHvE), pp. 56–64.
VLDB-1981-BeeriO #concurrent #detection #independence: A Resource Class Independent Deadlock Detection Algorithm (CB, RO), pp. 166–178.
VLDB-1981-Yannakakis #database: Algorithms for Acyclic Database Schemes (MY), pp. 82–94.
ICALP-1981-Courcelle #approach #axiom: An Axiomatic Approach to the Korenjak-Hopcroft Algorithms (BC), pp. 393–407.
ICALP-1981-Loeckx #data type #specification: Algorithmic Specifications of Abstract Data Types (JL), pp. 129–147.
ICALP-1981-Pearl #branch: The Solution for the Branching Factor of the α-β Pruning Algorithm (JP), pp. 521–529.
ICALP-1981-Schnorr #analysis: Refined Analysis and Improvements on Some Factoring Algorithms (CPS), pp. 1–15.
SIGIR-1981-SmeatonR #bound #information retrieval #nearest neighbour #problem #using: The Nearest Neighbour Problem in Information Retrieval: An Algorithm Using Upperbounds (AFS, CJvR), pp. 83–87.
SIGIR-1981-Stirling #documentation #information retrieval #on the #ranking: On the Limitations of Document Ranking Algorithms in Information Retrieval (KHS), pp. 63–65.
POPL-1981-Myers #data flow #interprocedural #precise: A Precise Interprocedural Data Flow Algorithm (EWM), pp. 219–230.
ICSE-1981-PenedoBE #concurrent #generative: An Algorithm to Support Code-Skeleton Generation for Concurrent Systems (MH(P, DMB, GE), pp. 125–135.
DAC-1981-Abramovici #testing: A maximal resolution guided-probe testing algorithm (MA), pp. 189–195.
DAC-1981-Akers #linear #on the #using: On the use of the linear assignment algorithm in module placement (SBA), pp. 137–144.
DAC-1981-BlankSC #architecture #parallel: A parallel bit map processor architecture for DA algorithms (TB, MS, WMvC), pp. 837–845.
DAC-1981-DoreauK #named: TWIGY — a topological algorithm based routing system (MTD, PK), pp. 746–755.
DAC-1981-HirschhornHB #data type #functional #simulation: Functional level simulation in FANSIM3 — algorithms, data structures and results (SH, MH, CB), pp. 248–255.
DAC-1981-Ji-GuangK: An algorithm for searching shortest path by propagating wave fronts in four quadrants (XJG, TK), pp. 29–36.
DAC-1981-KozawaTSMI #concurrent: A concurrent pattern operation algorithm for VLSI mask data (TK, AT, JS, CM, TI), pp. 563–570.
DAC-1981-Lauther: An O (N log N) algorithm for Boolean mask operations (UL), pp. 555–562.
DAC-1981-Masurkar #development #fault #identification #network: An algorithmic pretest development for fault identification in analog networks (VM), pp. 204–212.
DAC-1981-NagleP #design #hardware #multi: Algorithms for multiple-criterion design of microprogrammed control hardware (AWN, ACP), pp. 486–493.
SOSP-1981-CarrH #effectiveness #memory management #named: WSClock — A Simple and Effective Algorithm for Virtual Memory Management (RWC, JLH), pp. 87–95.
STOC-1981-Mayr #petri net #problem #reachability: An Algorithm for the General Petri Net Reachability Problem (EWM), pp. 238–246.
STOC-1981-ReifS #communication #distributed #realtime: Distributed Algorithms for Synchronizing Interprocess Communication within Real Time (JHR, PGS), pp. 133–145.
SIGMOD-1980-LamY #approximate #distributed #problem: An Approximation Algorithm for a File-Allocation Problem in a Hierarchical Distributed System (KL, CTY), pp. 125–132.
VLDB-1980-BernsteinG80a #concurrent #database #distributed: Timestamp-Based Algorithms for Concurrency Control in Distributed Database Systems (PAB, NG), pp. 285–300.
ICALP-1980-BeckerPS #clustering: A Shifting Algorithm for Min-Max Tree Partitioning (RIB, YP, SRS), pp. 64–75.
ICALP-1980-FlajoletS #analysis #on the: On the Analysis of Tree-Matching Algorithms (PF, JMS), pp. 208–219.
ICALP-1980-Galil #database #dependence #linear #relational: An Almost Linear Time Algorithm for Computing a Dependency Basis in a Relational Data Base (ZG), pp. 246–256.
SIGIR-1980-Weiss #nearest neighbour #probability: A Probabilistic Algorithm for Nearest Neighbour Searching (SFW), pp. 325–333.
POPL-1980-HuntR #performance #similarity: Efficient Algorithms for Structural Similarity of Grammars (HBHI, DJR), pp. 213–219.
DAC-1980-CoteP #problem: The interchange algorithms for circuit placement problems (LCC, AMP), pp. 528–534.
DAC-1980-Frew #architecture #design #overview: A survey of space allocation algorithms in use in architectural design in the past twenty years (RSF), pp. 165–174.
DAC-1980-HeynsSB #problem: A line-expansion algorithm for the general routing problem with a guaranteed solution (WH, WS, HB), pp. 243–249.
STOC-1980-Bloniarz: A Shortest-Path Algorithm with Expected Time O(n^2 log n log ^* n) (PAB), pp. 378–384.
STOC-1980-FilottiM #graph #morphism #polynomial: A Polynomial-time Algorithm for Determining the Isomorphism of Graphs of Fixed Genus (ISF, JNM), pp. 236–243.
STOC-1980-KarpT #linear #problem: Linear Expected-Time Algorithms for Connectivity Problems (RMK, RET), pp. 368–377.
STOC-1980-Mirkowska #axiom #bound #nondeterminism: Complete Axiomatization of Algorithmic Properties of Program Schemes with Bounded Nondeterministic Interpretations (GM), pp. 14–21.
STOC-1980-Tompa80a #implementation #polynomial #sublinear #transitive: Two Familiar Transitive Closure Algorithms which Admit No Polynomial Time, Sublinear Space Implementations (MT), pp. 333–338.
CADE-1980-CoxP: A Complete, Nonredundant Algorithm for Reversed Skolemization (PTC, TP), pp. 374–385.
CADE-1980-GloessL: Adding Dynamic Paramodulation to Rewrite Algorithms (PYG, JPHL), pp. 195–207.
VLDB-1979-KawazuMIT #concurrent #database #detection #distributed: Two-Phase Deadlock Detection Algorithm in Distributed Databases (SK, SM, KI, KT), pp. 360–367.
VLDB-1979-ParkerD #dependence #multi: Algorithmic Applications for a new Result on Multivalued Dependencies (DSPJ, CD), pp. 67–74.
ICALP-1979-Commentz-Walter #performance #string: A String Matching Algorithm Fast on the Average (BCW), pp. 118–132.
ICALP-1979-Deussen #parsing: One Abstract Accepting Algorithm for all Kinds of Parsers (PD), pp. 203–217.
ICALP-1979-DuncanY #correctness #proving: Studies in Abstract/Concrete Mappings in Proving Algorithm Correctness (AGD, LY), pp. 218–229.
ICALP-1979-Karp #analysis #graph #probability: Recent Advances in the Probabilistic Analysis of Graph-Theoretic Algorithms (RMK), pp. 338–339.
POPL-1979-LeeGR #evolution: The Evolution of List-Copying Algorithms (SL, WPdR, SLG), pp. 53–67.
DAC-1979-Goto #2d #layout #problem #slicing: A two-dimensional placement algorithm for the master slice LSI layout problem (SG), pp. 11–17.
DAC-1979-Lauther #graph #representation: A min-cut placement algorithm for general cell assemblies based on a graph representation (UL), pp. 1–10.
DAC-1979-Pimont: New algorithms for grid-less routing of high density printed circuit boards (SP), p. 485.
DAC-1979-PreasC: Placement algorithms for arbitrarily shaped blocks (BP, WMvC), pp. 474–480.
DAC-1979-StablerKK #clustering: Placement algorithm by partitioning for optimum rectangular placement (EPS, VMK, VAK), pp. 24–25.
STOC-1979-Kosaraju79a #array #graph #parallel #performance #problem: Fast Parallel Processing Array Algorithms for some Graph Problems (SRK), pp. 231–236.
ICALP-1978-Galil #on the #string: On Improving the Worst Case Running Time of the Boyer-Moore String Matching Algorithm (ZG), pp. 241–250.
SIGIR-1978-EastmanW #documentation #nearest neighbour #retrieval: A Tree Algorithm For Nearest Neighbor Searching In Document Retrieval Systems (CME, SFW), pp. 131–149.
POPL-1978-DowneySS #online: Off-Line and On-Line Algorithms for Deducing Equalities (PJD, HS, RS), pp. 158–170.
POPL-1978-NelsonO #performance: A Simplifier Based on Efficient Decision Algorithms (CGN, DCO), pp. 141–150.
POPL-1978-PennelloD #fault #lr: A Forward Move Algorithm for LR Error Recovery (TJP, FD), pp. 241–254.
DAC-1978-DoreauA #distance: A topologically based non-minimum distance routing algorithm (MTD, LCA), pp. 92–99.
STOC-1978-Baudet #analysis: An Analysis of the Full αβ Pruning Algorithm (GMB), pp. 296–313.
STOC-1978-Filotti #graph #performance #polynomial: An Efficient Algorithm for Determining Whether a Cubic Graph is Toroidal (ISF), pp. 133–142.
STOC-1978-GabowK #graph: Algorithms for Edge Coloring Bipartite Graphs (HNG, OK), pp. 184–192.
STOC-1978-Rackoff #probability: Relativized Questions Involving Probabilistic Algorithms (CR), pp. 338–342.
SIGMOD-1977-Lomet #concurrent #database: A Practical Deadlock Avoidance Algorithm for Data Base Systems (DBL), pp. 122–127.
SIGMOD-1977-SchenkP #multi #query: An Algorithm for Servicing Multi-Relational Queries (KLS, JRP), pp. 10–20.
VLDB-1977-GardarinL #consistency #database #nondeterminism #scalability #scheduling: Scheduling Algorithms for Avoiding Inconsistency in Large Databases (GG, PL), pp. 501–506.
POPL-1977-Barth #analysis #data flow #interprocedural: An Interprocedural Data Flow Analysis Algorithm (JMB), pp. 119–131.
DAC-1977-AgarwalB #aspect-oriented: Some theoretical aspects of algorithmic routing (PA, MAB), pp. 23–31.
DAC-1977-Baird #analysis #performance: Fast algorithms for LSI artwork analysis (HSB), pp. 303–311.
DAC-1977-Breuer: A class of min-cut placement algorithms (MAB), pp. 284–290.
DAC-1977-Dobes #multi: A multi-contouring algorithm (ID), p. 12.
DAC-1977-PedroG #automation #design #named #set: DOCIL: An automatic system for printed circuit board (PCB) designing. A board description language and an algorithm to connect a set of points (TdP, RG), pp. 174–181.
DAC-1977-Strebendt #generative #heuristic: Heuristic enhancement of an algorithmic test generator (RES), pp. 84–87.
STOC-1977-AngluinV #performance #probability: Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings (DA, LGV), pp. 30–41.
VLDB-J-1975-Burkhard76 #retrieval: Hashing and Trie Algorithms for Partial Match Retrieval (WAB), pp. 175–187.
VLDB-J-1975-YaoDT76 #database: A Dynamic Database Reorganization Algorithm (SBY, KSD, TJT), pp. 159–174.
ICALP-1976-Fontet #graph #linear #morphism #testing: A Linear Algorithm for Testing Isomorphism of Planar Graphs (MF), pp. 411–424.
ICALP-1976-Schnorr #problem #self: Optimal Algorithms for Self-Reducible Problems (CPS), pp. 322–337.
POPL-1976-Baker #source code: An Algorithm for Structuring Programs (BSB), pp. 113–126.
ICSE-1976-Kummel #relational: Improved Updating in relational Dat Base Systems by Deuter-Shere Algorithms (PK), pp. 556–561.
SOSP-J-1975-ChuO76 #analysis #markov: Analysis of the PFF Replacement Algorithm via a Semi-Markov Model (WWC, HO), pp. 298–304.
SOSP-J-1975-PrieveF76 #named: VMIN — An Optimal Variable-Space Page Replacement Algorithm (BGP, RSF), pp. 295–297.
DAC-1976-Misra #design #problem: A principle of algorithm design on limited problem domain (JM), pp. 479–483.
DAC-1976-Schweikert #2d #layout: A 2-dimensional placement algorithm for the layout of electrical circuits (DGS), pp. 408–416.
DAC-1976-WuS #float: A new routing algorithm for two-sided boards with floating vias (WW, DCS), pp. 151–160.
STOC-1976-Galil #realtime #recognition #string: Real-Time Algorithms for String-Matching and Palindrome Recognition (ZG), pp. 161–173.
STOC-1976-Hirschberg #component #parallel #problem #transitive: Parallel Algorithms for the Transitive Closure and the Connected Component Problems (DSH), pp. 55–57.
STOC-1976-Yao #behaviour #on the #set: On the Average Behavior of Set Merging Algorithms (ACCY), pp. 192–195.
POPL-1975-GrahamW #analysis #linear #performance: A Fast and Usually Linear Algorithm for Global Flow Analysis (SLG, MNW), pp. 22–34.
DAC-1975-Brennan #automation: An algorithm for automatic line routing on Schematic Drawings (RJB), pp. 324–330.
DAC-1975-SchmidtD: An iterative algorithm for placement and assignment of integrated circuits (DCS, LED), pp. 361–368.
SOSP-1975-Kain #how: How to Evaluate Page Replacement Algorithms (RYK), pp. 1–5.
SOSP-1975-LamS #analysis #scheduling: Analysis of a Level Algorithm for Preemptive Scheduling (SL, RS), pp. 178–186.
SOSP-1975-Sadeh #analysis #fault #performance: An Analysis of the Performance of the Page Fault Frequency (PFF) Replacement Algorithm (ES), pp. 6–13.
STOC-1975-BoothL #graph #linear: Linear Algorithms to Recognize Interval Graphs and Test for the Consecutive Ones Property (KSB, GSL), pp. 255–265.
STOC-1975-RoseT #aspect-oriented: Algorithmic Aspects of Vertex Elimination (DJR, RET), pp. 245–254.
SIGFIDET-1974-AstrahanG #independence: A Search Path Selection Algorithm for the Data Independent Accessing Model (DIAM) (MMA, SPG), pp. 367–388.
SIGFIDET-1974-CaseyO #database #relational: Generalized Page replacement Algorithms in a Relational Data Base (RGC, IMO), pp. 101–124.
ICALP-1974-Dezani-CiancagliniZ #parallel #performance: Application of Church-Rosser Properties to Increase the Parallelism and Efficiency of Algorithms (MDC, MZ), pp. 170–184.
ICALP-1974-Fischer #matrix: Further Schemes for Combining Matrix Algorithms (PCF), pp. 428–436.
ICALP-1974-FischerP #matrix #performance #using: Efficient Procedures for Using Matrix Algorithms (PCF, RLP), pp. 413–427.
ICALP-1974-Kreczmar #logic #problem: Effectivity Problems of Algorithmic Logic (AK), pp. 584–600.
DAC-1974-ArimaTAO #generative #heuristic #testing: A new heuristic test generation algorithm for sequential circuits (TA, MT, GA, JO), pp. 169–176.
DAC-1974-Wang #clustering: A partitioning technique for LSI chips including a bunching algorithm (PTW), p. 91.
DAC-1974-WeberS #integer: An integer arithmetic path expansion algorithm (TAW, DGS), pp. 62–69.
STOC-1974-HopcroftW #graph #linear #morphism: Linear Time Algorithm for Isomorphism of Planar Graphs (JEH, JKW), pp. 172–184.
STOC-1974-HyafilPV #performance: An Efficient Algorithm for Computing Optimal Desk Merge Patterns (LH, FP, JV), pp. 216–229.
STOC-1974-Kung #bound #evaluation #parallel: New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions (HTK), pp. 323–333.
POPL-1973-HechtU #analysis #problem: Analysis of a Simple Algorithm for Global Flow Problems (MSH, JDU), pp. 207–217.
DAC-1973-KernighanSP: An optimum channel-routing algorithm for polycell layouts of integrated circuits (BWK, DGS, GP), pp. 50–59.
SOSP-1973-KrauseSS #multi #scheduling: A Task Scheduling Algorithm for a Multiprogramming Computer System (KLK, VYS, HDS), pp. 112–118.
STOC-1973-GentlemanJ #analysis #case study: Analysis of Algorithms, a Case Study: Determinants of Polynomials (WMG, SCJ), pp. 135–141.
STOC-1973-Johnson #approximate #combinator #problem: Approximation Algorithms for Combinatorial Problems (DSJ), pp. 38–49.
STOC-1973-Pager #lr #parsing: The Lane Tracing Algorithm for Constructing LR(k) Parsers (DP), pp. 172–181.
STOC-1973-WeinerSB: Neighborhood Search Algorithms for Finding Optimal Traveling Salesman Tours Must Be Inefficient (PW, SLS, AB), pp. 207–213.
ICALP-1972-AguzziPS #approach #programming language #semantics: An Algorithmic Approach to the Semantics of Programming Languages (GA, RP, RS), pp. 147–166.
ICALP-1972-Kfoury #algebra #equivalence: Comparing Algebraic Structures up to Algorithmic Equivalence (DJK), pp. 253–263.
STOC-1972-Fiduccia #evaluation #fourier #performance #polynomial #revisited: Polynomial Evaluation via the Division Algorithm: The Fast Fourier Transform Revisited (CMF), pp. 88–93.
STOC-1972-GareyGU #analysis #memory management #worst-case: Worst-Case Analysis of Memory Allocation Algorithms (MRG, RLG, JDU), pp. 143–150.
STOC-1972-Horowitz: Algorithms for Rational Function Arithmetic Operations (EH), pp. 108–118.
SIGIR-1971-Knott #retrieval: A Balanced Tree Storage and Retrieval Algorithm (GDK), pp. 175–196.
SOSP-1971-Fontao #concurrent: A Concurrent Algorithm for Avoiding Deadlocks (ROF), pp. 72–79.
SOSP-1971-Greenberg: An Algorithm for Drum Storage Management in Time-Sharing Systems (MLG), pp. 141–148.
STOC-1971-Munro #performance: Some Results Concerning Efficient and Optimal Algorithms (JIM), pp. 40–44.
STOC-1971-Terrine #bottom-up #context-free grammar #generative #parsing #set: An Algorithm Generating the Decision Table of a Deterministic Bottom Up Parser for a Subset of Context Free Grammars (GT), pp. 185–205.
STOC-1971-Wise: Domolki’s Algorithm Applied to Generalized Overlap Resolvable Grammars (DSW), pp. 171–184.
DAC-1970-OSullivan #modelling: An algorithm for modeling saturating magnetic devices (GAO), pp. 286–294.
SOSP-1969-Johnston #multi #process: Structure of multiple activity algorithms (JBJ), pp. 80–82.
STOC-1969-Blum #effectiveness #on the: On Effective Procedures for Speeding Up Algorithms (MB), pp. 43–53.
STOC-1969-Ullian #ambiguity #context-free grammar #problem: The Inherent Ambiguity Partial Algorithm Problem for Context Free Languages (JSU), pp. 19–20.
DAC-1968-Heiss #multi: A path connection algorithm for multi-layer boards (SH).
DAC-1968-Marin #logic #on the #strict #synthesis #using: On a general synthesis algorithm of logical circuits using a restricted inventory of integrated circuits (MAM).