{"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/high/papers/8","list_of":"/task/high","task":"Vocal Bursts Intensity Prediction","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":8,"pages_in_order":27,"rows_per_page":100,"rows":[701,800],"of":2614,"counts":{"archive_papers_tagged":2614,"with_a_code_link":775,"where_syntology_ran_a_sample":147,"not_listed_spam_title":0,"listed":2614,"listed_where_code_ran":147,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":124,"every_run_a_failure_of_syntologys_instrument":23,"listed_with_a_run_with_no_instrument_failure":124,"listed_every_run_a_failure_of_syntologys_instrument":23,"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/high","prev":"/task/high/papers/7","next":"/task/high/papers/9","papers":[{"url":"/paper/low-cost-edge-sensing-for-high-quality","slug":"low-cost-edge-sensing-for-high-quality","title":"Low Cost Edge Sensing for High Quality Demosaicking","date":"2018-06-03","arxiv_id":"1806.00771","repositories_listed":1,"syntology":null},{"url":"/paper/marian-cost-effective-high-quality-neural","slug":"marian-cost-effective-high-quality-neural","title":"Marian: Cost-effective High-Quality Neural Machine Translation in C++","date":"2018-05-30","arxiv_id":"1805.12096","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-spectrum-of-random-features-maps-of","slug":"on-the-spectrum-of-random-features-maps-of","title":"On the Spectrum of Random Features Maps of High Dimensional Data","date":"2018-05-30","arxiv_id":"1805.11916","repositories_listed":1,"syntology":null},{"url":"/paper/joint-bootstrapping-machines-for-high","slug":"joint-bootstrapping-machines-for-high","title":"Joint Bootstrapping Machines for High Confidence Relation Extraction","date":"2018-05-01","arxiv_id":"1805.00254","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-training-of-variational-auto","slug":"adversarial-training-of-variational-auto","title":"Adversarial Training of Variational Auto-encoders for High Fidelity Image Generation","date":"2018-04-27","arxiv_id":"1804.10323","repositories_listed":1,"syntology":null},{"url":"/paper/high-dynamic-range-slam-with-map-aware","slug":"high-dynamic-range-slam-with-map-aware","title":"High Dynamic Range SLAM with Map-Aware Exposure Time Control","date":"2018-04-20","arxiv_id":"1804.07427","repositories_listed":1,"syntology":null},{"url":"/paper/high-dimension-tensor-completion-via-gradient","slug":"high-dimension-tensor-completion-via-gradient","title":"High-dimension Tensor Completion via Gradient-based Optimization Under Tensor-train Format","date":"2018-04-05","arxiv_id":"1804.01983","repositories_listed":1,"syntology":null},{"url":"/paper/context-aware-deep-feature-compression-for","slug":"context-aware-deep-feature-compression-for","title":"Context-aware Deep Feature Compression for High-speed Visual Tracking","date":"2018-03-28","arxiv_id":"1803.10537","repositories_listed":1,"syntology":null},{"url":"/paper/rare-feature-selection-in-high-dimensions","slug":"rare-feature-selection-in-high-dimensions","title":"Rare Feature Selection in High Dimensions","date":"2018-03-18","arxiv_id":"1803.06675","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-algorithms-for-learning-high","slug":"scalable-algorithms-for-learning-high","title":"Scalable Algorithms for Learning High-Dimensional Linear Mixed Models","date":"2018-03-12","arxiv_id":"1803.04431","repositories_listed":1,"syntology":null},{"url":"/paper/high-accuracy-low-precision-training","slug":"high-accuracy-low-precision-training","title":"High-Accuracy Low-Precision Training","date":"2018-03-09","arxiv_id":"1803.03383","repositories_listed":1,"syntology":null},{"url":"/paper/high-dynamic-range-imaging-for-cloud","slug":"high-dynamic-range-imaging-for-cloud","title":"High-Dynamic-Range Imaging for Cloud Segmentation","date":"2018-03-02","arxiv_id":"1803.01071","repositories_listed":1,"syntology":null},{"url":"/paper/an-emg-gesture-recognition-system-with","slug":"an-emg-gesture-recognition-system-with","title":"An EMG Gesture Recognition System with Flexible High-Density Sensors and Brain-Inspired High-Dimensional Classifier","date":"2018-02-28","arxiv_id":"1802.10237","repositories_listed":1,"syntology":null},{"url":"/paper/high-dimensional-bayesian-optimization-via","slug":"high-dimensional-bayesian-optimization-via","title":"High-Dimensional Bayesian Optimization via Additive Models with Overlapping Groups","date":"2018-02-20","arxiv_id":"1802.07028","repositories_listed":1,"syntology":null},{"url":"/paper/links-a-high-dimensional-online-clustering","slug":"links-a-high-dimensional-online-clustering","title":"Links: A High-Dimensional Online Clustering Method","date":"2018-01-30","arxiv_id":"1801.10123","repositories_listed":1,"syntology":null},{"url":"/paper/low-rank-bandit-methods-for-high-dimensional","slug":"low-rank-bandit-methods-for-high-dimensional","title":"Low-Rank Bandit Methods for High-Dimensional Dynamic Pricing","date":"2018-01-30","arxiv_id":"1801.10242","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/low-rank-bandit-methods-for-high-dimensional#ran","syntology_url":"https://syntology.ai/paper/1801.10242","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1801.10242"}},"official":null}},{"url":"/paper/high-throughput-high-resolution-registration","slug":"high-throughput-high-resolution-registration","title":"High-throughput, high-resolution registration-free generated adversarial network microscopy","date":"2018-01-07","arxiv_id":"1801.07330","repositories_listed":1,"syntology":null},{"url":"/paper/faster-high-density-monochromic-qr-codes-with","slug":"faster-high-density-monochromic-qr-codes-with","title":"Faster High Density Monochromic QR-Codes with Reduced Error Rate","date":"2018-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/deep-high-dynamic-range-imaging-with-large","slug":"deep-high-dynamic-range-imaging-with-large","title":"Deep High Dynamic Range Imaging with Large Foreground Motions","date":"2017-11-24","arxiv_id":"1711.08937","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-input-neural-networks-for-high","slug":"sparse-input-neural-networks-for-high","title":"Sparse-Input Neural Networks for High-dimensional Nonparametric Regression and Classification","date":"2017-11-21","arxiv_id":"1711.07592","repositories_listed":1,"syntology":null},{"url":"/paper/high-resolution-deep-convolutional-generative","slug":"high-resolution-deep-convolutional-generative","title":"High-Resolution Deep Convolutional Generative Adversarial Networks","date":"2017-11-17","arxiv_id":"1711.06491","repositories_listed":1,"syntology":null},{"url":"/paper/high-order-attention-models-for-visual","slug":"high-order-attention-models-for-visual","title":"High-Order Attention Models for Visual Question Answering","date":"2017-11-12","arxiv_id":"1711.04323","repositories_listed":1,"syntology":null},{"url":"/paper/high-quality-facial-photo-sketch-synthesis","slug":"high-quality-facial-photo-sketch-synthesis","title":"High-Quality Facial Photo-Sketch Synthesis Using Multi-Adversarial Networks","date":"2017-10-27","arxiv_id":"1710.10182","repositories_listed":1,"syntology":null},{"url":"/paper/vidosat-high-dimensional-sparsifying","slug":"vidosat-high-dimensional-sparsifying","title":"VIDOSAT: High-dimensional Sparsifying Transform Learning for Online Video Denoising","date":"2017-10-03","arxiv_id":"1710.00947","repositories_listed":1,"syntology":null},{"url":"/paper/feature-selection-in-high-dimensional-dataset","slug":"feature-selection-in-high-dimensional-dataset","title":"Feature selection in high-dimensional dataset using MapReduce","date":"2017-09-07","arxiv_id":"1709.02327","repositories_listed":1,"syntology":null},{"url":"/paper/bounded-depth-high-coverage-search-space-for","slug":"bounded-depth-high-coverage-search-space-for","title":"Bounded-Depth High-Coverage Search Space for Noncrossing Parses","date":"2017-09-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/optimal-errors-and-phase-transitions-in-high","slug":"optimal-errors-and-phase-transitions-in-high","title":"Optimal Errors and Phase Transitions in High-Dimensional Generalized Linear Models","date":"2017-08-10","arxiv_id":"1708.03395","repositories_listed":1,"syntology":null},{"url":"/paper/classification-without-labels-learning-from","slug":"classification-without-labels-learning-from","title":"Classification without labels: Learning from mixed samples in high energy physics","date":"2017-08-09","arxiv_id":"1708.02949","repositories_listed":1,"syntology":null},{"url":"/paper/high-risk-learning-acquiring-new-word-vectors","slug":"high-risk-learning-acquiring-new-word-vectors","title":"High-risk learning: acquiring new word vectors from tiny data","date":"2017-07-20","arxiv_id":"1707.06556","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-mixture-model-for-clustering-of","slug":"efficient-mixture-model-for-clustering-of","title":"Efficient mixture model for clustering of sparse high dimensional binary data","date":"2017-07-11","arxiv_id":"1707.03157","repositories_listed":1,"syntology":null},{"url":"/paper/an-interactive-greedy-approach-to-group","slug":"an-interactive-greedy-approach-to-group","title":"An Interactive Greedy Approach to Group Sparsity in High Dimensions","date":"2017-07-10","arxiv_id":"1707.02963","repositories_listed":1,"syntology":null},{"url":"/paper/high-quality-face-image-sr-using-conditional","slug":"high-quality-face-image-sr-using-conditional","title":"High-Quality Face Image SR Using Conditional Generative Adversarial Networks","date":"2017-07-04","arxiv_id":"1707.00737","repositories_listed":1,"syntology":null},{"url":"/paper/some-methods-for-heterogeneous-treatment","slug":"some-methods-for-heterogeneous-treatment","title":"Some methods for heterogeneous treatment effect estimation in high-dimensions","date":"2017-07-01","arxiv_id":"1707.00102","repositories_listed":1,"syntology":null},{"url":"/paper/high-dimensional-classification-by-sparse","slug":"high-dimensional-classification-by-sparse","title":"High-dimensional classification by sparse logistic regression","date":"2017-06-26","arxiv_id":"1706.08344","repositories_listed":1,"syntology":null},{"url":"/paper/bias-and-high-dimensional-adjustment-in","slug":"bias-and-high-dimensional-adjustment-in","title":"Bias and high-dimensional adjustment in observational studies of peer effects","date":"2017-06-14","arxiv_id":"1706.04692","repositories_listed":1,"syntology":null},{"url":"/paper/spatio-temporal-backpropagation-for-training","slug":"spatio-temporal-backpropagation-for-training","title":"Spatio-Temporal Backpropagation for Training High-performance Spiking Neural Networks","date":"2017-06-08","arxiv_id":"1706.02609","repositories_listed":1,"syntology":null},{"url":"/paper/converting-high-dimensional-regression-to","slug":"converting-high-dimensional-regression-to","title":"Converting High-Dimensional Regression to High-Dimensional Conditional Density Estimation","date":"2017-04-26","arxiv_id":"1704.08095","repositories_listed":1,"syntology":null},{"url":"/paper/data-adaptive-statistics-for-multiple","slug":"data-adaptive-statistics-for-multiple","title":"Data-adaptive statistics for multiple hypothesis testing in high-dimensional settings","date":"2017-04-24","arxiv_id":"1704.07008","repositories_listed":1,"syntology":null},{"url":"/paper/algebraic-variety-models-for-high-rank-matrix","slug":"algebraic-variety-models-for-high-rank-matrix","title":"Algebraic Variety Models for High-Rank Matrix Completion","date":"2017-03-28","arxiv_id":"1703.09631","repositories_listed":1,"syntology":null},{"url":"/paper/octree-generating-networks-efficient","slug":"octree-generating-networks-efficient","title":"Octree Generating Networks: Efficient Convolutional Architectures for High-resolution 3D Outputs","date":"2017-03-28","arxiv_id":"1703.09438","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/octree-generating-networks-efficient#ran","syntology_url":"https://syntology.ai/paper/1703.09438","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.09438"}},"official":{"repos":["lmb-freiburg/ogn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/batched-high-dimensional-bayesian","slug":"batched-high-dimensional-bayesian","title":"Batched High-dimensional Bayesian Optimization via Structural Kernel Learning","date":"2017-03-06","arxiv_id":"1703.01973","repositories_listed":1,"syntology":null},{"url":"/paper/an-empirical-bayes-approach-for-high","slug":"an-empirical-bayes-approach-for-high","title":"An Empirical Bayes Approach for High Dimensional Classification","date":"2017-02-16","arxiv_id":"1702.05056","repositories_listed":1,"syntology":null},{"url":"/paper/tflearn-tensorflows-high-level-module-for","slug":"tflearn-tensorflows-high-level-module-for","title":"TF.Learn: TensorFlow's High-level Module for Distributed Machine Learning","date":"2016-12-13","arxiv_id":"1612.04251","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-elicitation-via-sequential","slug":"knowledge-elicitation-via-sequential","title":"Knowledge Elicitation via Sequential Probabilistic Inference for High-Dimensional Prediction","date":"2016-12-10","arxiv_id":"1612.03328","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-regularized-matrix-factorization-for","slug":"temporal-regularized-matrix-factorization-for","title":"Temporal Regularized Matrix Factorization for High-dimensional Time Series Prediction","date":"2016-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/high-resolution-image-inpainting-using-multi","slug":"high-resolution-image-inpainting-using-multi","title":"High-Resolution Image Inpainting using Multi-Scale Neural Patch Synthesis","date":"2016-11-30","arxiv_id":"1611.09969","repositories_listed":1,"syntology":null},{"url":"/paper/distributedfba-jl-high-level-high-performance","slug":"distributedfba-jl-high-level-high-performance","title":"DistributedFBA.jl: High-level, high-performance flux balance analysis in Julia","date":"2016-11-15","arxiv_id":"1611.04743","repositories_listed":1,"syntology":null},{"url":"/paper/octnet-learning-deep-3d-representations-at","slug":"octnet-learning-deep-3d-representations-at","title":"OctNet: Learning Deep 3D Representations at High Resolutions","date":"2016-11-15","arxiv_id":"1611.05009","repositories_listed":1,"syntology":null},{"url":"/paper/high-dimensional-regression-over-disease","slug":"high-dimensional-regression-over-disease","title":"High-dimensional regression over disease subgroups","date":"2016-11-03","arxiv_id":"1611.00953","repositories_listed":1,"syntology":null},{"url":"/paper/the-xyz-algorithm-for-fast-interaction-search","slug":"the-xyz-algorithm-for-fast-interaction-search","title":"The xyz algorithm for fast interaction search in high-dimensional data","date":"2016-10-17","arxiv_id":"1610.05108","repositories_listed":1,"syntology":null},{"url":"/paper/phase-mapper-an-ai-platform-to-accelerate","slug":"phase-mapper-an-ai-platform-to-accelerate","title":"Phase-Mapper: An AI Platform to Accelerate High Throughput Materials Discovery","date":"2016-10-03","arxiv_id":"1610.00689","repositories_listed":1,"syntology":null},{"url":"/paper/referential-uncertainty-and-word-learning-in","slug":"referential-uncertainty-and-word-learning-in","title":"Referential Uncertainty and Word Learning in High-dimensional, Continuous Meaning Spaces","date":"2016-09-30","arxiv_id":"1609.09580","repositories_listed":1,"syntology":null},{"url":"/paper/mdswriter-annotation-tool-for-creating-high","slug":"mdswriter-annotation-tool-for-creating-high","title":"MDSWriter: Annotation Tool for Creating High-Quality Multi-Document Summarization Corpora","date":"2016-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/high-quality-depth-from-uncalibrated-small","slug":"high-quality-depth-from-uncalibrated-small","title":"High-Quality Depth From Uncalibrated Small Motion Clip","date":"2016-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/an-ensemble-method-to-produce-high-quality","slug":"an-ensemble-method-to-produce-high-quality","title":"An Ensemble Method to Produce High-Quality Word Embeddings (2016)","date":"2016-04-06","arxiv_id":"1604.01692","repositories_listed":1,"syntology":null},{"url":"/paper/spegg-high-throughput-eco-evolutionary","slug":"spegg-high-throughput-eco-evolutionary","title":"sPEGG: high throughput eco-evolutionary simulations on commodity graphics processors","date":"2016-03-30","arxiv_id":"1603.09255","repositories_listed":1,"syntology":null},{"url":"/paper/high-dimensional-regularized-discriminant","slug":"high-dimensional-regularized-discriminant","title":"High-Dimensional Regularized Discriminant Analysis","date":"2016-02-03","arxiv_id":"1602.01182","repositories_listed":1,"syntology":null},{"url":"/paper/crosscat-a-fully-bayesian-nonparametric","slug":"crosscat-a-fully-bayesian-nonparametric","title":"CrossCat: A Fully Bayesian Nonparametric Method for Analyzing Heterogeneous, High Dimensional Data","date":"2015-12-03","arxiv_id":"1512.01272","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-factored-logistic-regression","slug":"semi-supervised-factored-logistic-regression","title":"Semi-Supervised Factored Logistic Regression for High-Dimensional Neuroimaging Data","date":"2015-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/cascaded-high-dimensional-histograms-a","slug":"cascaded-high-dimensional-histograms-a","title":"Sparse Density Trees and Lists: An Interpretable Alternative to High-Dimensional Histograms","date":"2015-10-22","arxiv_id":"1510.06779","repositories_listed":1,"syntology":null},{"url":"/paper/high-order-graph-based-neural-dependency","slug":"high-order-graph-based-neural-dependency","title":"High-order Graph-based Neural Dependency Parsing","date":"2015-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/high-dimensional-asymptotics-of-prediction","slug":"high-dimensional-asymptotics-of-prediction","title":"High-Dimensional Asymptotics of Prediction: Ridge Regression and Classification","date":"2015-07-10","arxiv_id":"1507.03003","repositories_listed":1,"syntology":null},{"url":"/paper/environment-driven-lexicon-induction-for-high","slug":"environment-driven-lexicon-induction-for-high","title":"Environment-Driven Lexicon Induction for High-Level Instructions","date":"2015-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/introgression-browser-high-throughput-whole","slug":"introgression-browser-high-throughput-whole","title":"Introgression Browser: High throughput whole-genome SNP visualization","date":"2015-04-21","arxiv_id":"1504.05612","repositories_listed":1,"syntology":null},{"url":"/paper/similarity-learning-for-high-dimensional","slug":"similarity-learning-for-high-dimensional","title":"Similarity Learning for High-Dimensional Sparse Data","date":"2014-11-10","arxiv_id":"1411.2374","repositories_listed":1,"syntology":null},{"url":"/paper/high-dimensional-semiparametric-latent","slug":"high-dimensional-semiparametric-latent","title":"High Dimensional Semiparametric Latent Graphical Model for Mixed Data","date":"2014-04-29","arxiv_id":"1404.7236","repositories_listed":1,"syntology":null},{"url":"/paper/fast-supervised-hashing-with-decision-trees","slug":"fast-supervised-hashing-with-decision-trees","title":"Fast Supervised Hashing with Decision Trees for High-Dimensional Data","date":"2014-04-06","arxiv_id":"1404.1561","repositories_listed":1,"syntology":null},{"url":"/paper/high-quality-scalable-and-parallel-community","slug":"high-quality-scalable-and-parallel-community","title":"High Quality, Scalable and Parallel Community Detectionfor Large Real Graphs","date":"2014-03-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-block-structures-and-high","slug":"hierarchical-block-structures-and-high","title":"Hierarchical Block Structures and High-resolution Model Selection in Large Networks","date":"2013-10-16","arxiv_id":"1310.4377","repositories_listed":1,"syntology":null},{"url":"/paper/high-dimensional-cluster-analysis-with-the","slug":"high-dimensional-cluster-analysis-with-the","title":"High-dimensional cluster analysis with the Masked EM Algorithm","date":"2013-09-11","arxiv_id":"1309.2848","repositories_listed":1,"syntology":null},{"url":"/paper/building-high-level-features-using-large","slug":"building-high-level-features-using-large","title":"Building high-level features using large scale unsupervised learning","date":"2011-12-29","arxiv_id":"1112.6209","repositories_listed":1,"syntology":null},{"url":"/paper/finding-large-average-submatrices-in-high","slug":"finding-large-average-submatrices-in-high","title":"Finding large average submatrices in high dimensional data","date":"2009-05-11","arxiv_id":"0905.1682","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-power-spectrum-estimation-for-high","slug":"efficient-power-spectrum-estimation-for-high","title":"Efficient Power Spectrum Estimation for High Resolution CMB Maps","date":"2008-09-05","arxiv_id":"0809.1092","repositories_listed":1,"syntology":null},{"url":"/paper/high-frequency-trading-in-a-limit-order-book","slug":"high-frequency-trading-in-a-limit-order-book","title":"High-frequency trading in a limit order book","date":"2008-04-28","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/07120194","slug":"07120194","title":"Computing High Accuracy Power Spectra with Pico","date":"2007-12-02","arxiv_id":"0712.0194","repositories_listed":1,"syntology":null},{"url":null,"slug":"hierarchical-dcc-heavy-model-for-high","title":"Hierarchical DCC-HEAVY Model for High-Dimensional Covariance Matrices","date":"2023-05-15","arxiv_id":"2305.08488","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-object-slam-framework-for-association","title":"An Object SLAM Framework for Association, Mapping, and High-Level Tasks","date":"2023-05-12","arxiv_id":"2305.07299","repositories_listed":0,"syntology":null},{"url":null,"slug":"band-pass-filtering-with-high-dimensional","title":"Band-Pass Filtering with High-Dimensional Time Series","date":"2023-05-11","arxiv_id":"2305.06618","repositories_listed":0,"syntology":null},{"url":null,"slug":"computationally-efficient-and-statistically-1","title":"Computationally Efficient and Statistically Optimal Robust High-Dimensional Linear Regression","date":"2023-05-10","arxiv_id":"2305.06199","repositories_listed":0,"syntology":null},{"url":null,"slug":"honeyiot-adaptive-high-interaction-honeypot","title":"HoneyIoT: Adaptive High-Interaction Honeypot for IoT Devices Through Reinforcement Learning","date":"2023-05-10","arxiv_id":"2305.06430","repositories_listed":0,"syntology":null},{"url":null,"slug":"text-guided-high-definition-consistency","title":"Text-guided High-definition Consistency Texture Model","date":"2023-05-10","arxiv_id":"2305.05901","repositories_listed":0,"syntology":null},{"url":null,"slug":"copula-variational-lstm-for-high-dimensional","title":"Copula Variational LSTM for High-dimensional Cross-market Multivariate Dependence Modeling","date":"2023-05-09","arxiv_id":"2305.08778","repositories_listed":0,"syntology":null},{"url":null,"slug":"fooling-state-of-the-art-deepfake-detection","title":"Fooling State-of-the-Art Deepfake Detection with High-Quality Deepfakes","date":"2023-05-09","arxiv_id":"2305.05282","repositories_listed":0,"syntology":null},{"url":null,"slug":"hifi-high-information-attention-heads-hold","title":"HiFi: High-Information Attention Heads Hold for Parameter-Efficient Model Adaptation","date":"2023-05-08","arxiv_id":"2305.04573","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-dimensional-smoothed-entropy-estimation","title":"High-Dimensional Smoothed Entropy Estimation via Dimensionality Reduction","date":"2023-05-08","arxiv_id":"2305.04712","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-to-leverage-high-altitude-platforms-in","title":"How to Leverage High Altitude Platforms in Green Computing?","date":"2023-05-08","arxiv_id":"2305.04878","repositories_listed":0,"syntology":null},{"url":null,"slug":"hiore-leveraging-high-order-interactions-for","title":"HIORE: Leveraging High-order Interactions for Unified Entity Relation Extraction","date":"2023-05-07","arxiv_id":"2305.04297","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-high-dimensional-and-low-rank-tensor","title":"On High-dimensional and Low-rank Tensor Bandits","date":"2023-05-06","arxiv_id":"2305.03884","repositories_listed":0,"syntology":null},{"url":null,"slug":"synthesizing-pet-images-from-high-field-and","title":"Synthesizing PET images from High-field and Ultra-high-field MR images Using Joint Diffusion Attention Model","date":"2023-05-06","arxiv_id":"2305.03901","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-level-context-representation-for-emotion","title":"High-Level Context Representation for Emotion Recognition in Images","date":"2023-05-05","arxiv_id":"2305.03500","repositories_listed":0,"syntology":null},{"url":null,"slug":"sign-coded-exposure-sensing-for-noise-robust","title":"Sign-Coded Exposure Sensing for Noise-Robust High-Speed Imaging","date":"2023-05-05","arxiv_id":"2305.03226","repositories_listed":0,"syntology":null},{"url":null,"slug":"explaining-language-models-predictions-with","title":"Explaining Language Models' Predictions with High-Impact Concepts","date":"2023-05-03","arxiv_id":"2305.02160","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-resolution-synthetic-rgb-d-datasets-for","title":"High-Resolution Synthetic RGB-D Datasets for Monocular Depth Estimation","date":"2023-05-02","arxiv_id":"2305.01732","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-dimensional-clustering-onto-hamiltonian","title":"High-dimensional Clustering onto Hamiltonian Cycle","date":"2023-04-27","arxiv_id":"2304.14531","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-closer-look-at-reward-decomposition-for","title":"A Closer Look at Reward Decomposition for High-Level Robotic Explanations","date":"2023-04-25","arxiv_id":"2304.12958","repositories_listed":0,"syntology":null},{"url":null,"slug":"hdr-chipqa-no-reference-quality-assessment-on","title":"HDR-ChipQA: No-Reference Quality Assessment on High Dynamic Range Videos","date":"2023-04-25","arxiv_id":"2304.13156","repositories_listed":0,"syntology":null},{"url":null,"slug":"img2vec-a-teacher-of-high-token-diversity","title":"Img2Vec: A Teacher of High Token-Diversity Helps Masked AutoEncoders","date":"2023-04-25","arxiv_id":"2304.12535","repositories_listed":0,"syntology":null},{"url":null,"slug":"asymptotic-expansions-for-high-frequency","title":"Asymptotic Expansions for High-Frequency Option Data","date":"2023-04-24","arxiv_id":"2304.12450","repositories_listed":0,"syntology":null},{"url":null,"slug":"design-optimization-for-high-performance","title":"Design optimization for high-performance computing using FPGA","date":"2023-04-24","arxiv_id":"2304.12474","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-fidelity-and-freely-controllable-talking","title":"High-Fidelity and Freely Controllable Talking Head Video Generation","date":"2023-04-20","arxiv_id":"2304.10168","repositories_listed":0,"syntology":null}],"record_sha256":"7d644b2e05b70078c68a605b555bb134fe77f712b289b578eb13238af04b0547","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}