{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/speed/papers/96","list_of":"/method/speed","method":"SPEED","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"date (newest first), then slug","page":96,"pages_in_order":96,"rows_per_page":100,"rows":[9501,9573],"of":9573,"counts":{"archive_papers_tagged":9576,"with_a_code_link":3061,"where_syntology_ran_a_sample":779,"not_listed_spam_title":3,"listed":9573,"listed_where_code_ran":779,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":677,"every_run_a_failure_of_syntologys_instrument":102,"listed_with_a_run_with_no_instrument_failure":677,"listed_every_run_a_failure_of_syntologys_instrument":102,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/method/speed","prev":"/method/speed/papers/95","next":null,"papers":[{"paper":null,"slug":"towards-more-accurate-clustering-method-by","title":"Towards more accurate clustering method by using dynamic time warping","date":"2013-04-12","arxiv_id":"1304.3745","n_code_links":0,"syntology":null},{"paper":null,"slug":"solving-linear-equations-by-classical-jacobi","title":"Solving Linear Equations by Classical Jacobi-SR Based Hybrid Evolutionary Algorithm with Uniform Adaptation Technique","date":"2013-04-08","arxiv_id":"1304.2097","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-speed-of-constraint-propagation-and","title":"On the speed of constraint propagation and the time complexity of arc consistency testing","date":"2013-03-28","arxiv_id":"1303.7077","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-vlsi-design-and-implementation-for-a-real","title":"A VLSI Design and Implementation for a Real-Time Approximate Reasoning","date":"2013-03-27","arxiv_id":"1304.3112","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-constructing-the-value-function-for","title":"On Constructing the Value Function for Optimal Trajectory Problem and its Application to Image Processing","date":"2013-03-20","arxiv_id":"1303.4845","n_code_links":0,"syntology":null},{"paper":null,"slug":"top-down-particle-filtering-for-bayesian","title":"Top-down particle filtering for Bayesian decision trees","date":"2013-03-03","arxiv_id":"1303.0561","n_code_links":0,"syntology":null},{"paper":null,"slug":"fast-matching-by-2-lines-of-code-for-large","title":"Fast Matching by 2 Lines of Code for Large Scale Face Recognition Systems","date":"2013-02-28","arxiv_id":"1302.07180","n_code_links":0,"syntology":null},{"paper":null,"slug":"image-based-face-detection-and-recognition","title":"Image-based Face Detection and Recognition: \"State of the Art\"","date":"2013-02-26","arxiv_id":"1302.06379","n_code_links":0,"syntology":null},{"paper":null,"slug":"matching-pursuit-lasso-part-ii-applications","title":"Matching Pursuit LASSO Part II: Applications and Sparse Recovery over Batch Signals","date":"2013-02-20","arxiv_id":"1302.5010","n_code_links":0,"syntology":null},{"paper":null,"slug":"covariance-estimation-in-high-dimensions-via","title":"Covariance Estimation in High Dimensions via Kronecker Product Expansions","date":"2013-02-12","arxiv_id":"1302.2686","n_code_links":0,"syntology":null},{"paper":"/paper/overlapping-community-detection-at-scale-a","slug":"overlapping-community-detection-at-scale-a","title":"Overlapping Community Detection at Scale: A Nonnegative Matrix Factorization Approach","date":"2013-02-04","arxiv_id":null,"n_code_links":2,"syntology":null},{"paper":null,"slug":"equitability-analysis-of-the-maximal","title":"Equitability Analysis of the Maximal Information Coefficient, with Comparisons","date":"2013-01-27","arxiv_id":"1301.6314","n_code_links":0,"syntology":null},{"paper":null,"slug":"branch-and-bound-algorithm-for-dependency","title":"Branch and Bound Algorithm for Dependency Parsing with Non-local Features","date":"2013-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"performance-analysis-of-anfis-in-short-term","title":"Performance Analysis of ANFIS in short term Wind Speed Prediction","date":"2012-12-11","arxiv_id":"1212.2671","n_code_links":0,"syntology":null},{"paper":null,"slug":"runtime-optimizations-for-prediction-with","title":"Runtime Optimizations for Prediction with Tree-Based Models","date":"2012-12-11","arxiv_id":"1212.2287","n_code_links":0,"syntology":null},{"paper":null,"slug":"burn-in-bias-and-the-rationality-of-anchoring","title":"Burn-in, bias, and the rationality of anchoring","date":"2012-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"delay-compensation-with-dynamical-synapses","title":"Delay Compensation with Dynamical Synapses","date":"2012-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"large-scale-distributed-deep-networks","title":"Large Scale Distributed Deep Networks","date":"2012-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"learned-prioritization-for-trading-off","title":"Learned Prioritization for Trading Off Accuracy and Speed","date":"2012-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-visual-motion-in-recurrent-neural","title":"Learning visual motion in recurrent neural networks","date":"2012-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-scale-hyper-time-hardware-emulation-of","title":"Multi-scale Hyper-time Hardware Emulation of Human Motor Nervous System Based on Spiking Neurons using FPGA","date":"2012-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"study-design-in-causal-models","title":"Study design in causal models","date":"2012-11-13","arxiv_id":"1211.2958","n_code_links":0,"syntology":null},{"paper":null,"slug":"secured-wireless-communication-using-fuzzy","title":"Secured Wireless Communication using Fuzzy Logic based High Speed Public-Key Cryptography (FLHSPKC)","date":"2012-11-09","arxiv_id":"1211.2087","n_code_links":0,"syntology":null},{"paper":"/paper/laplace-approximation-for-logistic-gaussian","slug":"laplace-approximation-for-logistic-gaussian","title":"Laplace approximation for logistic Gaussian process density estimation and regression","date":"2012-11-01","arxiv_id":"1211.0174","n_code_links":1,"syntology":null},{"paper":null,"slug":"parallel-mcmc-with-generalized-elliptical","title":"Parallel MCMC with Generalized Elliptical Slice Sampling","date":"2012-10-28","arxiv_id":"1210.7477","n_code_links":0,"syntology":null},{"paper":null,"slug":"fast-online-em-for-big-topic-modeling","title":"Fast Online EM for Big Topic Modeling","date":"2012-10-08","arxiv_id":"1210.2179","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-ultrahigh-dimensional-feature","title":"Towards Ultrahigh Dimensional Feature Selection for Big Data","date":"2012-09-24","arxiv_id":"1209.5260","n_code_links":0,"syntology":null},{"paper":null,"slug":"cooperative-learning-in-multi-agent-systems","title":"Cooperative learning in multi-agent systems from intermittent measurements","date":"2012-09-11","arxiv_id":"1209.2194","n_code_links":0,"syntology":null},{"paper":null,"slug":"supervised-texture-classification-using-a","title":"Supervised Texture Classification Using a Novel Compression-Based Similarity Measure","date":"2012-07-12","arxiv_id":"1207.3071","n_code_links":0,"syntology":null},{"paper":"/paper/a-fast-projected-fixed-point-algorithm-for","slug":"a-fast-projected-fixed-point-algorithm-for","title":"A Fast Projected Fixed-Point Algorithm for Large Graph Matching","date":"2012-07-03","arxiv_id":"1207.1114","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":1,"n_instrument":2,"unverified":0,"pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/fixed-form-variational-posterior","slug":"fixed-form-variational-posterior","title":"Fixed-Form Variational Posterior Approximation through Stochastic Linear Regression","date":"2012-06-28","arxiv_id":"1206.6679","n_code_links":2,"syntology":null},{"paper":null,"slug":"automatic-word-alignment-tools-to-scale","title":"Automatic word alignment tools to scale production of manually aligned parallel texts","date":"2012-05-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"exmaralda-and-the-folk-tools-two-toolsets-for","title":"EXMARaLDA and the FOLK tools --- two toolsets for transcribing and annotating spoken language","date":"2012-05-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"first-results-in-a-study-evaluating-pre","title":"First Results in a Study Evaluating Pre-annotation and Correction Propagation for Machine-Assisted Syriac Morphological Analysis","date":"2012-05-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"freeling-30-towards-wider-multilinguality","title":"FreeLing 3.0: Towards Wider Multilinguality","date":"2012-05-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"joint-grammar-and-treebank-development-for","title":"Joint Grammar and Treebank Development for Mandarin Chinese with HPSG","date":"2012-05-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"analysis-of-a-natural-gradient-algorithm-on","title":"Analysis of a Natural Gradient Algorithm on Monotonic Convex-Quadratic-Composite Functions","date":"2012-04-18","arxiv_id":"1204.4141","n_code_links":0,"syntology":null},{"paper":null,"slug":"rferns-an-implementation-of-the-random-ferns","title":"rFerns: An Implementation of the Random Ferns Method for General-Purpose Machine Learning","date":"2012-02-06","arxiv_id":"1202.1121","n_code_links":0,"syntology":null},{"paper":null,"slug":"boosting-with-maximum-adaptive-sampling","title":"Boosting with Maximum Adaptive Sampling","date":"2011-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"generalized-lasso-based-approximation-of","title":"Generalized Lasso based Approximation of Sparse Coding for Visual Recognition","date":"2011-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"nearest-neighbor-based-greedy-coordinate","title":"Nearest Neighbor based Greedy Coordinate Descent","date":"2011-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-regression-in-metric-spaces-via","title":"Efficient Regression in Metric Spaces via Approximate Lipschitz Extension","date":"2011-11-18","arxiv_id":"1111.4470","n_code_links":0,"syntology":null},{"paper":"/paper/bambi-blind-accelerated-multimodal-bayesian","slug":"bambi-blind-accelerated-multimodal-bayesian","title":"BAMBI: blind accelerated multimodal Bayesian inference","date":"2011-10-13","arxiv_id":"1110.2997","n_code_links":2,"syntology":null},{"paper":null,"slug":"solving-principal-component-pursuit-in-linear","title":"Solving Principal Component Pursuit in Linear Time via $l_1$ Filtering","date":"2011-08-26","arxiv_id":"1108.5359","n_code_links":0,"syntology":null},{"paper":null,"slug":"automatic-road-lighting-system-arls-model","title":"Automatic Road Lighting System (ARLS) Model Based on Image Processing of Moving Object","date":"2011-07-05","arxiv_id":"1107.0845","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-influence-of-global-constraints-on","title":"The Influence of Global Constraints on Similarity Measures for Time-Series Databases","date":"2011-07-01","arxiv_id":"1107.0134","n_code_links":0,"syntology":null},{"paper":"/paper/ais-bn-an-adaptive-importance-sampling","slug":"ais-bn-an-adaptive-importance-sampling","title":"AIS-BN: An Adaptive Importance Sampling Algorithm for Evidential Reasoning in Large Bayesian Networks","date":"2011-06-01","arxiv_id":"1106.0253","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-bayesian-approach-to-concept-drift","title":"A Bayesian Approach to Concept Drift","date":"2010-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-relational-learning-with-hidden","title":"Efficient Relational Learning with Hidden Variable Detection","date":"2010-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"gaussian-sampling-by-local-perturbations","title":"Gaussian sampling by local perturbations","date":"2010-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"linear-complementarity-for-regularized-policy","title":"Linear Complementarity for Regularized Policy Evaluation and Improvement","date":"2010-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"lower-bounds-on-rate-of-convergence-of","title":"Lower Bounds on Rate of Convergence of Cutting Plane Methods","date":"2010-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"parallelized-stochastic-gradient-descent","title":"Parallelized Stochastic Gradient Descent","date":"2010-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"random-projections-for-k-means-clustering","title":"Random Projections for k-means Clustering","date":"2010-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"fast-reinforcement-learning-for-energy","title":"Fast Reinforcement Learning for Energy-Efficient Wireless Communications","date":"2010-09-29","arxiv_id":"1009.5773","n_code_links":0,"syntology":null},{"paper":null,"slug":"fast-l1-minimization-algorithms-for-robust","title":"Fast L1-Minimization Algorithms For Robust Face Recognition","date":"2010-07-21","arxiv_id":"1007.03753","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-parallel-framework-for-multilayer","title":"A Parallel Framework for Multilayer Perceptron for Human Face Recognition","date":"2010-07-05","arxiv_id":"1007.00627","n_code_links":0,"syntology":null},{"paper":null,"slug":"adaptive-submodularity-theory-and","title":"Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization","date":"2010-03-21","arxiv_id":"1003.3967","n_code_links":0,"syntology":null},{"paper":null,"slug":"explaining-human-multiple-object-tracking-as","title":"Explaining human multiple object tracking as resource-constrained approximate inference in a dynamic probabilistic model","date":"2009-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"spatial-normalized-gamma-processes","title":"Spatial Normalized Gamma Processes","date":"2009-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"a-massively-parallel-digital-learning","title":"A Massively Parallel Digital Learning Processor","date":"2008-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"accelerating-bayesian-inference-over","title":"Accelerating Bayesian Inference over Nonlinear Differential Equations with Gaussian Processes","date":"2008-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"artificial-olfactory-brain-for-mixture","title":"Artificial Olfactory Brain for Mixture Identification","date":"2008-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-inference-in-phylogenetic-indel","title":"Efficient Inference in Phylogenetic InDel Trees","date":"2008-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"local-gaussian-process-regression-for-real","title":"Local Gaussian Process Regression for Real Time Online Model Learning","date":"2008-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-resolution-exploration-in-continuous","title":"Multi-resolution Exploration in Continuous Spaces","date":"2008-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"optimal-response-initiation-why-recent","title":"Optimal Response Initiation: Why Recent Experience Matters","date":"2008-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"tracking-changing-stimuli-in-continuous","title":"Tracking Changing Stimuli in Continuous Attractor Neural Networks","date":"2008-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/quantum-reinforcement-learning","slug":"quantum-reinforcement-learning","title":"Quantum reinforcement learning","date":"2008-10-21","arxiv_id":"0810.3828","n_code_links":2,"syntology":{"ran":3,"of":3,"n_ran_checked":2,"n_instrument":1,"unverified":0,"pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":null,"slug":"efficient-principled-learning-of-thin","title":"Efficient Principled Learning of Thin Junction Trees","date":"2007-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"fast-and-scalable-training-of-semi-supervised","title":"Fast and Scalable Training of Semi-Supervised CRFs with Application to Activity Recognition","date":"2007-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"fast-variational-inference-for-large-scale","title":"Fast Variational Inference for Large-scale Internet Diagnosis","date":"2007-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"regularized-boost-for-semi-supervised","title":"Regularized Boost for Semi-Supervised Learning","date":"2007-12-01","arxiv_id":null,"n_code_links":0,"syntology":null}],"record_sha256":"6dea94b1a958e9063d319e7603fc18afa842c1e25c767991e1e8da287c582245","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}