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