{"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":"/task/computational-efficiency/papers/49","list_of":"/task/computational-efficiency","task":"Computational Efficiency","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":49,"pages_in_order":49,"rows_per_page":100,"rows":[4801,4891],"of":4891,"counts":{"archive_papers_tagged":4891,"with_a_code_link":1644,"where_syntology_ran_a_sample":369,"not_listed_spam_title":0,"listed":4891,"listed_where_code_ran":369,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":307,"every_run_a_failure_of_syntologys_instrument":62,"listed_with_a_run_with_no_instrument_failure":307,"listed_every_run_a_failure_of_syntologys_instrument":62,"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":"/task/computational-efficiency","prev":"/task/computational-efficiency/papers/48","next":null,"papers":[{"url":null,"slug":"computational-and-statistical-boundaries-for","title":"Computational and Statistical Boundaries for Submatrix Localization in a Large Noisy Matrix","date":"2015-02-06","arxiv_id":"1502.01988","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-efficient-anomaly-detectors-from-k","title":"Learning Efficient Anomaly Detectors from $K$-NN Graphs","date":"2015-02-06","arxiv_id":"1502.01783","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-distance-weighted-discrimination","title":"Sparse Distance Weighted Discrimination","date":"2015-01-24","arxiv_id":"1501.06066","repositories_listed":0,"syntology":null},{"url":null,"slug":"sketch-and-validate-for-big-data-clustering","title":"Sketch and Validate for Big Data Clustering","date":"2015-01-22","arxiv_id":"1501.05590","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-local-interaction-sli-model","title":"Stochastic Local Interaction (SLI) Model: Interfacing Machine Learning and Geostatistics","date":"2015-01-16","arxiv_id":"1501.04053","repositories_listed":0,"syntology":null},{"url":null,"slug":"minimizing-the-number-of-matching-queries-for","title":"Minimizing the Number of Matching Queries for Object Retrieval","date":"2014-12-18","arxiv_id":"1412.5808","repositories_listed":0,"syntology":null},{"url":null,"slug":"fixed-point-algorithm-based-on-quasi-newton","title":"Fixed Point Algorithm Based on Quasi-Newton Method for Convex Minimization Problem with Application to Image Deblurring","date":"2014-12-15","arxiv_id":"1412.4438","repositories_listed":0,"syntology":null},{"url":null,"slug":"iterative-subsampling-in-solution-path","title":"Iterative Subsampling in Solution Path Clustering of Noisy Big Data","date":"2014-12-04","arxiv_id":"1412.1559","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-integer-polynomial-programming-based","title":"An Integer Polynomial Programming Based Framework for Lifted MAP Inference","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-sparse-gaussian-chain-graph-models","title":"On Sparse Gaussian Chain Graph Models","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-non-linear-learning-with-adaptive","title":"Scalable Non-linear Learning with Adaptive Polynomial Expansions","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"higher-order-mrfs-based-image-super","title":"Higher-order MRFs based image super resolution: why not MAP?","date":"2014-10-27","arxiv_id":"1410.7429","repositories_listed":0,"syntology":null},{"url":null,"slug":"recovery-of-sparse-signals-using-multiple","title":"Recovery of Sparse Signals Using Multiple Orthogonal Least Squares","date":"2014-10-09","arxiv_id":"1410.2505","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-nonlinear-learning-with-adaptive","title":"Scalable Nonlinear Learning with Adaptive Polynomial Expansions","date":"2014-10-02","arxiv_id":"1410.0440","repositories_listed":0,"syntology":null},{"url":null,"slug":"backhaul-constrained-multi-cell-cooperation","title":"Backhaul-Constrained Multi-Cell Cooperation Leveraging Sparsity and Spectral Clustering","date":"2014-09-30","arxiv_id":"1409.8359","repositories_listed":0,"syntology":null},{"url":null,"slug":"extracting-man-made-objects-from-remote","title":"Extracting man-made objects from remote sensing images via fast level set evolutions","date":"2014-09-26","arxiv_id":"1409.7474","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-inexact-newton-krylov-algorithm-for","title":"An inexact Newton-Krylov algorithm for constrained diffeomorphic image registration","date":"2014-08-27","arxiv_id":"1408.6299","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-distributed-principal-component","title":"Improved Distributed Principal Component Analysis","date":"2014-08-25","arxiv_id":"1408.5823","repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-and-computational-trade-offs-in","title":"Statistical and computational trade-offs in estimation of sparse principal components","date":"2014-08-22","arxiv_id":"1408.5369","repositories_listed":0,"syntology":null},{"url":null,"slug":"bi-l0-l2-norm-regularization-for-blind-motion","title":"Bi-l0-l2-Norm Regularization for Blind Motion Deblurring","date":"2014-08-20","arxiv_id":"1408.4712","repositories_listed":0,"syntology":null},{"url":null,"slug":"object-proposal-generation-using-two-stage","title":"Object Proposal Generation using Two-Stage Cascade SVMs","date":"2014-07-20","arxiv_id":"1407.5242","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-higher-order-tensor-decomposition","title":"Generalized Higher-Order Tensor Decomposition via Parallel ADMM","date":"2014-07-05","arxiv_id":"1407.1399","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-optimal-control-of-smoothly","title":"Bayesian Optimal Control of Smoothly Parameterized Systems: The Lazy Posterior Sampling Algorithm","date":"2014-06-16","arxiv_id":"1406.3926","repositories_listed":0,"syntology":null},{"url":null,"slug":"semantic-graph-for-zero-shot-learning","title":"Semantic Graph for Zero-Shot Learning","date":"2014-06-16","arxiv_id":"1406.4112","repositories_listed":0,"syntology":null},{"url":null,"slug":"eigenspace-method-for-spatiotemporal-hotspot","title":"Eigenspace Method for Spatiotemporal Hotspot Detection","date":"2014-06-13","arxiv_id":"1406.3506","repositories_listed":0,"syntology":null},{"url":null,"slug":"algebraic-combinatorial-methods-for-low-rank","title":"Algebraic-Combinatorial Methods for Low-Rank Matrix Completion with Application to Athletic Performance Prediction","date":"2014-06-11","arxiv_id":"1406.2864","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-computation-of-relative-pose-for","title":"Efficient Computation of Relative Pose for Multi-Camera Systems","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"shrinkage-fields-for-effective-image","title":"Shrinkage Fields for Effective Image Restoration","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"off-policy-shaping-ensembles-in-reinforcement","title":"Off-Policy Shaping Ensembles in Reinforcement Learning","date":"2014-05-21","arxiv_id":"1405.5358","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-ridge-regression-with-randomized","title":"Fast Ridge Regression with Randomized Principal Component Analysis and Gradient Descent","date":"2014-05-15","arxiv_id":"1405.3952","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-rank-svm-approach-to-anomaly-detection","title":"A Rank-SVM Approach to Anomaly Detection","date":"2014-05-02","arxiv_id":"1405.0530","repositories_listed":0,"syntology":null},{"url":null,"slug":"distribution-aware-sampling-and-weighted","title":"Distribution-Aware Sampling and Weighted Model Counting for SAT","date":"2014-04-11","arxiv_id":"1404.2984","repositories_listed":0,"syntology":null},{"url":null,"slug":"dont-fall-for-tuning-parameters-tuning-free","title":"Don't Fall for Tuning Parameters: Tuning-Free Variable Selection in High Dimensions With the TREX","date":"2014-04-02","arxiv_id":"1404.0541","repositories_listed":0,"syntology":null},{"url":null,"slug":"correlation-filters-with-limited-boundaries","title":"Correlation Filters with Limited Boundaries","date":"2014-03-31","arxiv_id":"1403.7876","repositories_listed":0,"syntology":null},{"url":null,"slug":"matroid-bandits-fast-combinatorial","title":"Matroid Bandits: Fast Combinatorial Optimization with Learning","date":"2014-03-20","arxiv_id":"1403.5045","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-driven-hrf-estimation-for-encoding-and","title":"Data-driven HRF estimation for encoding and decoding models","date":"2014-02-27","arxiv_id":"1402.7015","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-high-reproducibility-and-high-accuracy","title":"A high-reproducibility and high-accuracy method for automated topic classification","date":"2014-02-03","arxiv_id":"1402.0422","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximate-model-based-diagnosis-using","title":"Approximate Model-Based Diagnosis Using Greedy Stochastic Search","date":"2014-01-16","arxiv_id":"1401.3848","repositories_listed":0,"syntology":null},{"url":null,"slug":"smart-machines-and-the-sp-theory-of","title":"Smart machines and the SP theory of intelligence","date":"2014-01-08","arxiv_id":"1401.1669","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-return-of-adaboostmh-multi-class-hamming","title":"The return of AdaBoost.MH: multi-class Hamming trees","date":"2013-12-20","arxiv_id":"1312.6086","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-lasso-for-learning-a-sparse-bayesian","title":"A* Lasso for Learning a Sparse Bayesian Network Structure for Continuous Variables","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-inference-for-low-rank","title":"Bayesian inference for low rank spatiotemporal neural receptive fields","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"factorized-asymptotic-bayesian-inference-for-1","title":"Factorized Asymptotic Bayesian Inference for Latent Feature Models","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"global-solver-and-its-efficient-approximation","title":"Global Solver and Its Efficient Approximation for Variational Bayesian Low-rank Subspace Clustering","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"reconciling-priors-priors-without-prejudice","title":"Reconciling \"priors\" & \"priors\" without prejudice?","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"simultaneous-rectification-and-alignment-via","title":"Simultaneous Rectification and Alignment via Robust Recovery of Low-rank Tensors","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-pairwise-graphical-models-with","title":"Learning Pairwise Graphical Models with Nonlinear Sufficient Statistics","date":"2013-11-21","arxiv_id":"1311.5479","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-state-space-inference-of-periodic","title":"Efficient State-Space Inference of Periodic Latent Force Models","date":"2013-10-23","arxiv_id":"1310.6319","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-robust-variational-model-for-positive-image","title":"A Robust Variational Model for Positive Image Deconvolution","date":"2013-10-08","arxiv_id":"1310.2085","repositories_listed":0,"syntology":null},{"url":null,"slug":"mint-mutual-information-based-transductive","title":"MINT: Mutual Information based Transductive Feature Selection for Genetic Trait Prediction","date":"2013-10-07","arxiv_id":"1310.1659","repositories_listed":0,"syntology":null},{"url":null,"slug":"electricity-market-forecasting-via-low-rank","title":"Electricity Market Forecasting via Low-Rank Multi-Kernel Learning","date":"2013-10-02","arxiv_id":"1310.0865","repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-recurrence-quantification-analysis-of","title":"Cross-Recurrence Quantification Analysis of Categorical and Continuous Time Series: an R package","date":"2013-10-01","arxiv_id":"1310.0201","repositories_listed":0,"syntology":null},{"url":null,"slug":"context-aware-recommendations-from-implicit","title":"Context-aware recommendations from implicit data via scalable tensor factorization","date":"2013-09-29","arxiv_id":"1309.7611","repositories_listed":0,"syntology":null},{"url":"/paper/feature-extraction-of-hyperspectral-images","slug":"feature-extraction-of-hyperspectral-images","title":"Feature Extraction of Hyperspectral Images With Image Fusion and Recursive Filtering","date":"2013-09-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"levels-of-integration-between-low-level","title":"Levels of Integration between Low-Level Reasoning and Task Planning","date":"2013-07-29","arxiv_id":"1307.7461","repositories_listed":0,"syntology":null},{"url":null,"slug":"safe-screening-with-variational-inequalities","title":"Safe Screening With Variational Inequalities and Its Application to LASSO","date":"2013-07-29","arxiv_id":"1307.7577","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-statistical-perspective-on-algorithmic","title":"A Statistical Perspective on Algorithmic Leveraging","date":"2013-06-23","arxiv_id":"1306.5362","repositories_listed":0,"syntology":null},{"url":null,"slug":"p-hgrms-a-parallel-hypergraph-based-root-mean","title":"P-HGRMS: A Parallel Hypergraph Based Root Mean Square Algorithm for Image Denoising","date":"2013-06-23","arxiv_id":"1306.5390","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-classification-for-metric-data","title":"Efficient Classification for Metric Data","date":"2013-06-11","arxiv_id":"1306.2547","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-fast-approximate-aib-algorithm-for","title":"A Fast Approximate AIB Algorithm for Distributional Word Clustering","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"discrete-mrf-inference-of-marginal-densities","title":"Discrete MRF Inference of Marginal Densities for Non-uniformly Discretized Variable Space","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-detector-adaptation-for-object","title":"Efficient Detector Adaptation for Object Detection in a Video","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-rigid-motion-segmentation-via","title":"Fast Rigid Motion Segmentation via Incrementally-Complex Local Models","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"patch-match-filter-efficient-edge-aware","title":"Patch Match Filter: Efficient Edge-Aware Filtering Meets Randomized Search for Fast Correspondence Field Estimation","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sampling-strategies-for-real-time-action","title":"Sampling Strategies for Real-Time Action Recognition","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"high-dimensional-mixed-graphical-models","title":"High-dimensional Mixed Graphical Models","date":"2013-04-09","arxiv_id":"1304.2810","repositories_listed":0,"syntology":null},{"url":null,"slug":"computational-lower-bounds-for-sparse-pca","title":"Computational Lower Bounds for Sparse PCA","date":"2013-04-03","arxiv_id":"1304.0828","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-distance-metric-learning-by","title":"Efficient Distance Metric Learning by Adaptive Sampling and Mini-Batch Stochastic Gradient Descent (SGD)","date":"2013-04-03","arxiv_id":"1304.1192","repositories_listed":0,"syntology":null},{"url":null,"slug":"utility-based-control-for-computer-vision","title":"Utility-Based Control for Computer Vision","date":"2013-03-27","arxiv_id":"1304.2367","repositories_listed":0,"syntology":null},{"url":null,"slug":"video-face-matching-using-subset-selection","title":"Video Face Matching using Subset Selection and Clustering of Probabilistic Multi-Region Histograms","date":"2013-03-26","arxiv_id":"1303.6361","repositories_listed":0,"syntology":null},{"url":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","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparserobust-estimation-and-kalman-smoothing","title":"Sparse/Robust Estimation and Kalman Smoothing with Nonsmooth Log-Concave Densities: Modeling, Computation, and Theory","date":"2013-01-19","arxiv_id":"1301.4566","repositories_listed":0,"syntology":null},{"url":null,"slug":"why-size-matters-feature-coding-as-nystrom","title":"Why Size Matters: Feature Coding as Nystrom Sampling","date":"2013-01-15","arxiv_id":"1301.5348","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-marginalized-particle-gaussian-process","title":"A Marginalized Particle Gaussian Process Regression","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-imputation-of-genetic-data-with-a","title":"Scalable imputation of genetic data with a discrete fragmentation-coagulation process","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-crowdsourced-clustering-generalizing","title":"Semi-Crowdsourced Clustering: Generalizing Crowd Labeling by Robust Distance Metric Learning","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-approximate-manifolds-for-differential","title":"Sparse Approximate Manifolds for Differential Geometric MCMC","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"smoothing-dynamic-systems-with-state","title":"Smoothing Dynamic Systems with State-Dependent Covariance Matrices","date":"2012-11-19","arxiv_id":"1211.4601","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-regularized-least-squares","title":"Efficient Regularized Least-Squares Algorithms for Conditional Ranking on Relational Data","date":"2012-09-21","arxiv_id":"1209.4825","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-als-based-tensor-factorization-for","title":"Fast ALS-based tensor factorization for context-aware recommendation from implicit feedback","date":"2012-04-05","arxiv_id":"1204.1259","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-search-efficiently-in-high","title":"Learning to Search Efficiently in High Dimensions","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"query-aware-mcmc","title":"Query-Aware MCMC","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"simultaneous-sampling-and-multi-structure","title":"Simultaneous Sampling and Multi-Structure Fitting with Adaptive Reversible Jump MCMC","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"missforest-nonparametric-missing-value","title":"MissForest - nonparametric missing value imputation for mixed-type data","date":"2011-05-04","arxiv_id":"1105.0828","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-relational-learning-with-hidden","title":"Efficient Relational Learning with Hidden Variable Detection","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-global-convergence-rates-of-gradient","title":"Fast global convergence rates of gradient methods for high-dimensional statistical recovery","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-graph-laplacian-regularized-kernel","title":"Fast Graph Laplacian Regularized Kernel Learning via Semidefinite–Quadratic–Linear Programming","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"group-sparse-coding","title":"Group Sparse Coding","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"inter-domain-gaussian-processes-for-sparse","title":"Inter-domain Gaussian Processes for Sparse Inference using Inducing Features","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-ordered-residual-kernel-for-robust-motion","title":"The Ordered Residual Kernel for Robust Motion Subspace Clustering","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"time-varying-dynamic-bayesian-networks","title":"Time-Varying Dynamic Bayesian Networks","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"28c77643c50180a7328378b23d71fea5a6beea95b839758c64ce4811f8d98ff4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}