{"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/72","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":72,"pages_in_order":96,"rows_per_page":100,"rows":[7101,7200],"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/71","next":"/method/speed/papers/73","papers":[{"paper":null,"slug":"accelerating-supply-chains-with-ant-colony","title":"Accelerating supply chains with Ant Colony Optimization across range of hardware solutions","date":"2020-01-22","arxiv_id":"2001.08102","n_code_links":0,"syntology":null},{"paper":null,"slug":"convergence-time-optimization-for-federated","title":"Convergence Time Optimization for Federated Learning over Wireless Networks","date":"2020-01-22","arxiv_id":"2001.07845","n_code_links":0,"syntology":null},{"paper":null,"slug":"depthwise-non-local-module-for-fast-salient","title":"Depthwise Non-local Module for Fast Salient Object Detection Using a Single Thread","date":"2020-01-22","arxiv_id":"2001.08057","n_code_links":0,"syntology":null},{"paper":null,"slug":"machine-learning-assisted-handover-and","title":"Machine Learning assisted Handover and Resource Management for Cellular Connected Drones","date":"2020-01-22","arxiv_id":"2001.07937","n_code_links":0,"syntology":null},{"paper":"/paper/neural-networks-in-evolutionary-dynamic","slug":"neural-networks-in-evolutionary-dynamic","title":"Neural Networks in Evolutionary Dynamic Constrained Optimization: Computational Cost and Benefits","date":"2020-01-22","arxiv_id":"2001.11588","n_code_links":1,"syntology":null},{"paper":"/paper/traffic-data-imputation-using-deep","slug":"traffic-data-imputation-using-deep","title":"Traffic Data Imputation using Deep Convolutional Neural Networks","date":"2020-01-21","arxiv_id":"2002.04406","n_code_links":1,"syntology":null},{"paper":null,"slug":"transfer-learning-using-neural-ordinary","title":"Transfer Learning using Neural Ordinary Differential Equations","date":"2020-01-21","arxiv_id":"2001.07342","n_code_links":0,"syntology":null},{"paper":"/paper/variational-dropout-sparsification-for","slug":"variational-dropout-sparsification-for","title":"Variational Dropout Sparsification for Particle Identification speed-up","date":"2020-01-21","arxiv_id":"2001.07493","n_code_links":1,"syntology":null},{"paper":null,"slug":"dual-stochastic-natural-gradient-descent","title":"Dual Stochastic Natural Gradient Descent and convergence of interior half-space gradient approximations","date":"2020-01-19","arxiv_id":"2001.06744","n_code_links":0,"syntology":null},{"paper":null,"slug":"image-denoising-via-k-svd-with-primal-dual","title":"Image denoising via K-SVD with primal-dual active set algorithm","date":"2020-01-19","arxiv_id":"2001.06780","n_code_links":0,"syntology":null},{"paper":"/paper/learning-compositional-neural-information-1","slug":"learning-compositional-neural-information-1","title":"Learning Compositional Neural Information Fusion for Human Parsing","date":"2020-01-19","arxiv_id":"2001.06804","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"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","official":{"repos":["ZzzjzzZ/CompositionalHumanParsing"],"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"]}}},{"paper":null,"slug":"efficient-neural-architecture-search-a-broad","title":"BNAS:An Efficient Neural Architecture Search Approach Using Broad Scalable Architecture","date":"2020-01-18","arxiv_id":"2001.06679","n_code_links":0,"syntology":null},{"paper":null,"slug":"netnet-neighbor-erasing-and-transferring","title":"NETNet: Neighbor Erasing and Transferring Network for Better Single Shot Object Detection","date":"2020-01-18","arxiv_id":"2001.06690","n_code_links":0,"syntology":null},{"paper":null,"slug":"road-network-and-travel-time-extraction-from","title":"Road Network and Travel Time Extraction from Multiple Look Angles with SpaceNet Data","date":"2020-01-16","arxiv_id":"2001.05923","n_code_links":0,"syntology":null},{"paper":null,"slug":"rsnet-an-improvement-for-darknet","title":"A lightweight target detection algorithm based on Mobilenet Convolution","date":"2020-01-16","arxiv_id":"2002.03729","n_code_links":0,"syntology":null},{"paper":"/paper/scalable-hyperparameter-optimization-with-1","slug":"scalable-hyperparameter-optimization-with-1","title":"Scalable Hyperparameter Optimization with Lazy Gaussian Processes","date":"2020-01-16","arxiv_id":"2001.05726","n_code_links":1,"syntology":null},{"paper":"/paper/self-supervised-visual-feature-learning-with-1","slug":"self-supervised-visual-feature-learning-with-1","title":"Self-supervised visual feature learning with curriculum","date":"2020-01-16","arxiv_id":"2001.05634","n_code_links":1,"syntology":null},{"paper":"/paper/continuous-action-reinforcement-learning-for","slug":"continuous-action-reinforcement-learning-for","title":"Continuous-action Reinforcement Learning for Playing Racing Games: Comparing SPG to PPO","date":"2020-01-15","arxiv_id":"2001.05270","n_code_links":1,"syntology":null},{"paper":null,"slug":"evaluating-image-matching-methods-for-book","title":"Evaluating image matching methods for book cover identification","date":"2020-01-15","arxiv_id":"2001.05200","n_code_links":0,"syntology":null},{"paper":null,"slug":"theoretical-interpretation-of-learned-step","title":"Theoretical Interpretation of Learned Step Size in Deep-Unfolded Gradient Descent","date":"2020-01-15","arxiv_id":"2001.05142","n_code_links":0,"syntology":null},{"paper":null,"slug":"accelerating-block-coordinate-descent-for","title":"Accelerating Block Coordinate Descent for Nonnegative Tensor Factorization","date":"2020-01-13","arxiv_id":"2001.04321","n_code_links":0,"syntology":null},{"paper":null,"slug":"fast-fourier-forecasting-resource-utilisation","title":"Fast-Fourier-Forecasting Resource Utilisation in Distributed Systems","date":"2020-01-13","arxiv_id":"2001.04281","n_code_links":0,"syntology":null},{"paper":null,"slug":"parametric-probabilistic-quantum-memory","title":"Parametric Probabilistic Quantum Memory","date":"2020-01-11","arxiv_id":"2001.04798","n_code_links":0,"syntology":null},{"paper":null,"slug":"backdoor-attacks-against-transfer-learning","title":"Backdoor Attacks against Transfer Learning with Pre-trained Deep Learning Models","date":"2020-01-10","arxiv_id":"2001.03274","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-programmable-random-variate","title":"Efficient Programmable Random Variate Generation Accelerator from Sensor Noise","date":"2020-01-10","arxiv_id":"2001.05400","n_code_links":0,"syntology":null},{"paper":"/paper/rtm3d-real-time-monocular-3d-detection-from","slug":"rtm3d-real-time-monocular-3d-detection-from","title":"RTM3D: Real-time Monocular 3D Detection from Object Keypoints for Autonomous Driving","date":"2020-01-10","arxiv_id":"2001.03343","n_code_links":2,"syntology":{"ran":11,"of":16,"n_ran_checked":8,"n_instrument":3,"unverified":5,"pointer_only":1,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 3 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","official":{"repos":["Banconxuan/RTM3D"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"paper":null,"slug":"seismiqb-a-novel-framework-for-deep-learning","title":"SeismiQB -- a novel framework for deep learning with seismic data","date":"2020-01-10","arxiv_id":"2001.06416","n_code_links":0,"syntology":null},{"paper":"/paper/faster-fast-and-safe-trajectory-planner-for","slug":"faster-fast-and-safe-trajectory-planner-for","title":"FASTER: Fast and Safe Trajectory Planner for Navigation in Unknown Environments","date":"2020-01-09","arxiv_id":"2001.04420","n_code_links":2,"syntology":null},{"paper":null,"slug":"modeling-climate-change-impact-on-wind-power","title":"Modeling Climate Change Impact on Wind Power Resources Using Adaptive Neuro-Fuzzy Inference System","date":"2020-01-09","arxiv_id":"2001.04279","n_code_links":0,"syntology":null},{"paper":null,"slug":"semi-sequential-probabilistic-model-for","title":"Semi-Sequential Probabilistic Model For Indoor Localization Enhancement","date":"2020-01-08","arxiv_id":"2001.02400","n_code_links":0,"syntology":null},{"paper":null,"slug":"automated-pavement-crack-segmentation-using","title":"Automated Pavement Crack Segmentation Using U-Net-based Convolutional Neural Network","date":"2020-01-07","arxiv_id":"2001.01912","n_code_links":0,"syntology":null},{"paper":"/paper/hybridpose-6d-object-pose-estimation-under","slug":"hybridpose-6d-object-pose-estimation-under","title":"HybridPose: 6D Object Pose Estimation under Hybrid Representations","date":"2020-01-07","arxiv_id":"2001.01869","n_code_links":3,"syntology":{"ran":5,"of":5,"n_ran_checked":5,"n_instrument":0,"unverified":0,"pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 5 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["chensong1995/HybridPose"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/ara-aggregated-rappor-and-analysis-for","slug":"ara-aggregated-rappor-and-analysis-for","title":"ARA : Aggregated RAPPOR and Analysis for Centralized Differential Privacy","date":"2020-01-06","arxiv_id":"2001.01618","n_code_links":1,"syntology":null},{"paper":"/paper/deep-snake-for-real-time-instance","slug":"deep-snake-for-real-time-instance","title":"Deep Snake for Real-Time Instance Segmentation","date":"2020-01-06","arxiv_id":"2001.01629","n_code_links":1,"syntology":null},{"paper":"/paper/deeper-insights-into-weight-sharing-in-neural-1","slug":"deeper-insights-into-weight-sharing-in-neural-1","title":"Deeper Insights into Weight Sharing in Neural Architecture Search","date":"2020-01-06","arxiv_id":"2001.01431","n_code_links":1,"syntology":{"ran":4,"of":6,"n_ran_checked":4,"n_instrument":0,"unverified":2,"pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["ultmaster/deeper-insights-weight-sharing"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"development-demonstration-and-validation-of","title":"Development, Demonstration, and Validation of Data-driven Compact Diode Models for Circuit Simulation and Analysis","date":"2020-01-06","arxiv_id":"2001.01699","n_code_links":0,"syntology":null},{"paper":"/paper/discrimination-aware-network-pruning-for-deep","slug":"discrimination-aware-network-pruning-for-deep","title":"Discrimination-aware Network Pruning for Deep Model Compression","date":"2020-01-04","arxiv_id":"2001.01050","n_code_links":1,"syntology":{"ran":2,"of":4,"n_ran_checked":1,"n_instrument":1,"unverified":2,"pointer_only":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["SCUT-AILab/DCP"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"temporal-spatial-neural-filter-direction","title":"Temporal-Spatial Neural Filter: Direction Informed End-to-End Multi-channel Target Speech Separation","date":"2020-01-02","arxiv_id":"2001.00391","n_code_links":0,"syntology":null},{"paper":null,"slug":"differentiable-architecture-compression","title":"Differentiable Architecture Compression","date":"2020-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"enhancing-language-emergence-through-empathy","title":"Enhancing Language Emergence through Empathy","date":"2020-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"improving-batch-normalization-with-skewness","title":"Improving Batch Normalization with Skewness Reduction for Deep Neural Networks","date":"2020-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"transform-domain-classification-of-human","title":"Transform-Domain Classification of Human Cells based on DNA Methylation Datasets","date":"2019-12-31","arxiv_id":"1912.13167","n_code_links":0,"syntology":null},{"paper":"/paper/real-time-segmentation-and-facial-skin-tones","slug":"real-time-segmentation-and-facial-skin-tones","title":"Real-time Segmentation and Facial Skin Tones Grading","date":"2019-12-30","arxiv_id":"1912.12888","n_code_links":1,"syntology":null},{"paper":"/paper/variance-reduced-local-sgd-with-lower-1","slug":"variance-reduced-local-sgd-with-lower-1","title":"Variance Reduced Local SGD with Lower Communication Complexity","date":"2019-12-30","arxiv_id":"1912.12844","n_code_links":1,"syntology":null},{"paper":null,"slug":"augmented-replay-memory-in-reinforcement","title":"Augmented Replay Memory in Reinforcement Learning With Continuous Control","date":"2019-12-29","arxiv_id":"1912.12719","n_code_links":0,"syntology":null},{"paper":"/paper/explicit-sparse-transformer-concentrated","slug":"explicit-sparse-transformer-concentrated","title":"Explicit Sparse Transformer: Concentrated Attention Through Explicit Selection","date":"2019-12-25","arxiv_id":"1912.11637","n_code_links":2,"syntology":{"ran":3,"of":3,"n_ran_checked":0,"n_instrument":3,"unverified":0,"pointer_only":3,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["lancopku/Explicit-Sparse-Transformer"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"paper":null,"slug":"neural-odes-for-image-segmentation-with-level","title":"Neural ODEs for Image Segmentation with Level Sets","date":"2019-12-25","arxiv_id":"1912.11683","n_code_links":0,"syntology":null},{"paper":"/paper/neural-subgraph-isomorphism-counting-1","slug":"neural-subgraph-isomorphism-counting-1","title":"Neural Subgraph Isomorphism Counting","date":"2019-12-25","arxiv_id":"1912.11589","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["HKUST-KnowComp/NeuralSubgraphCounting"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/cprop-adaptive-learning-rate-scaling-from","slug":"cprop-adaptive-learning-rate-scaling-from","title":"CProp: Adaptive Learning Rate Scaling from Past Gradient Conformity","date":"2019-12-24","arxiv_id":"1912.11493","n_code_links":1,"syntology":null},{"paper":"/paper/fast-and-deep-neuromorphic-learning-with-time","slug":"fast-and-deep-neuromorphic-learning-with-time","title":"Fast and energy-efficient neuromorphic deep learning with first-spike times","date":"2019-12-24","arxiv_id":"1912.11443","n_code_links":2,"syntology":null},{"paper":"/paper/an-optical-diffractive-deep-neural-network","slug":"an-optical-diffractive-deep-neural-network","title":"An optical diffractive deep neural network with multiple frequency-channels","date":"2019-12-23","arxiv_id":"1912.10730","n_code_links":1,"syntology":null},{"paper":null,"slug":"an-uncertainty-principle-for-neural-coding","title":"An uncertainty principle for neural coding: Conjugate representations of position and velocity are mapped onto firing rates and co-firing rates of neural spike trains","date":"2019-12-23","arxiv_id":"1912.11126","n_code_links":0,"syntology":null},{"paper":null,"slug":"cbct-to-ct-synthesis-with-a-single-neural","title":"CBCT-to-CT synthesis with a single neural network for head-and-neck, lung and breast cancer adaptive radiotherapy","date":"2019-12-23","arxiv_id":"1912.11136","n_code_links":0,"syntology":null},{"paper":"/paper/fasterseg-searching-for-faster-real-time-1","slug":"fasterseg-searching-for-faster-real-time-1","title":"FasterSeg: Searching for Faster Real-time Semantic Segmentation","date":"2019-12-23","arxiv_id":"1912.10917","n_code_links":2,"syntology":{"ran":11,"of":13,"n_ran_checked":9,"n_instrument":2,"unverified":2,"pointer_only":2,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","official":{"repos":["TAMU-VITA/FasterSeg"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"paper":null,"slug":"fisheyemultinet-real-time-multi-task-learning","title":"FisheyeMultiNet: Real-time Multi-task Learning Architecture for Surround-view Automated Parking System","date":"2019-12-23","arxiv_id":"1912.11066","n_code_links":0,"syntology":null},{"paper":null,"slug":"atmospheric-turbulence-removal-using","title":"Atmospheric turbulence removal using convolutional neural network","date":"2019-12-22","arxiv_id":"1912.11350","n_code_links":0,"syntology":null},{"paper":"/paper/contracting-implicit-recurrent-neural","slug":"contracting-implicit-recurrent-neural","title":"Contracting Implicit Recurrent Neural Networks: Stable Models with Improved Trainability","date":"2019-12-22","arxiv_id":"1912.10402","n_code_links":1,"syntology":null},{"paper":null,"slug":"rapid-whole-heart-cmr-with-single-volume","title":"Rapid Whole-Heart CMR with Single Volume Super-resolution","date":"2019-12-22","arxiv_id":"1912.10503","n_code_links":0,"syntology":null},{"paper":null,"slug":"seek-and-you-will-find-a-new-optimized","title":"Seek and You Will Find: A New Optimized Framework for Efficient Detection of Pedestrian","date":"2019-12-21","arxiv_id":"1912.10241","n_code_links":0,"syntology":null},{"paper":"/paper/uwgan-underwater-gan-for-real-world-1","slug":"uwgan-underwater-gan-for-real-world-1","title":"UWGAN: Underwater GAN for Real-world Underwater Color Restoration and Dehazing","date":"2019-12-21","arxiv_id":"1912.10269","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-framework-for-explainable-text","title":"A Framework for Explainable Text Classification in Legal Document Review","date":"2019-12-19","arxiv_id":"1912.09501","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-adaptive-and-fast-convergent-approach-to","title":"An Adaptive and Fast Convergent Approach to Differentially Private Deep Learning","date":"2019-12-19","arxiv_id":"1912.09150","n_code_links":0,"syntology":null},{"paper":null,"slug":"lstm-tdnn-with-convolutional-front-end-for","title":"LSTM-TDNN with convolutional front-end for Dialect Identification in the 2019 Multi-Genre Broadcast Challenge","date":"2019-12-19","arxiv_id":"1912.09003","n_code_links":0,"syntology":null},{"paper":null,"slug":"zeroth-order-stochastic-compositional","title":"Zeroth-order Stochastic Compositional Algorithms for Risk-Aware Learning","date":"2019-12-19","arxiv_id":"1912.09484","n_code_links":0,"syntology":null},{"paper":null,"slug":"incremental-elmvis-for-unsupervised-learning","title":"Incremental ELMVIS for unsupervised learning","date":"2019-12-18","arxiv_id":"1912.08638","n_code_links":0,"syntology":null},{"paper":null,"slug":"interleaved-composite-quantization-for-high","title":"Interleaved Composite Quantization for High-Dimensional Similarity Search","date":"2019-12-18","arxiv_id":"1912.08756","n_code_links":0,"syntology":null},{"paper":null,"slug":"preventing-information-leakage-with-neural","title":"Learning to Prevent Leakage: Privacy-Preserving Inference in the Mobile Cloud","date":"2019-12-18","arxiv_id":"1912.08421","n_code_links":0,"syntology":null},{"paper":null,"slug":"asynchronous-federated-learning-with","title":"Asynchronous Federated Learning with Differential Privacy for Edge Intelligence","date":"2019-12-17","arxiv_id":"1912.07902","n_code_links":0,"syntology":null},{"paper":"/paper/bridging-the-gap-between-community-and-node","slug":"bridging-the-gap-between-community-and-node","title":"Bridging the Gap between Community and Node Representations: Graph Embedding via Community Detection","date":"2019-12-17","arxiv_id":"1912.08808","n_code_links":1,"syntology":null},{"paper":null,"slug":"convolutional-dictionary-pair-learning","title":"Convolutional Dictionary Pair Learning Network for Image Representation Learning","date":"2019-12-17","arxiv_id":"1912.12138","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-building-a-real-time-mobile-device","title":"Towards Building a Real Time Mobile Device Bird Counting System Through Synthetic Data Training and Model Compression","date":"2019-12-15","arxiv_id":"1912.07106","n_code_links":0,"syntology":null},{"paper":null,"slug":"adapting-behaviour-for-learning-progress-1","title":"Adapting Behaviour for Learning Progress","date":"2019-12-14","arxiv_id":"1912.06910","n_code_links":0,"syntology":null},{"paper":null,"slug":"deep-learning-predictions-of-sand-dune","title":"Deep learning predictions of sand dune migration","date":"2019-12-13","arxiv_id":"1912.10798","n_code_links":0,"syntology":null},{"paper":"/paper/hierarchical-deep-stereo-matching-on-high-1","slug":"hierarchical-deep-stereo-matching-on-high-1","title":"Hierarchical Deep Stereo Matching on High-resolution Images","date":"2019-12-13","arxiv_id":"1912.06704","n_code_links":2,"syntology":{"ran":8,"of":10,"n_ran_checked":8,"n_instrument":0,"unverified":2,"pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 1 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":null}},{"paper":null,"slug":"queueing-analysis-of-gpu-based-inference","title":"Queueing Analysis of GPU-Based Inference Servers with Dynamic Batching: A Closed-Form Characterization","date":"2019-12-13","arxiv_id":"1912.06322","n_code_links":0,"syntology":null},{"paper":null,"slug":"waldorf-wasteless-language-model-distillation","title":"WaLDORf: Wasteless Language-model Distillation On Reading-comprehension","date":"2019-12-13","arxiv_id":"1912.06638","n_code_links":0,"syntology":null},{"paper":null,"slug":"understanding-important-features-of-deep","title":"Understanding Important Features of Deep Learning Models for Transmission Electron Microscopy Image Segmentation","date":"2019-12-12","arxiv_id":"1912.06077","n_code_links":0,"syntology":null},{"paper":"/paper/a-billion-ways-to-grasp-an-evaluation-of","slug":"a-billion-ways-to-grasp-an-evaluation-of","title":"A Billion Ways to Grasp: An Evaluation of Grasp Sampling Schemes on a Dense, Physics-based Grasp Data Set","date":"2019-12-11","arxiv_id":"1912.05604","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-stable-nuclear-future-the-impact-of","title":"A Stable Nuclear Future? The Impact of Autonomous Systems and Artificial Intelligence","date":"2019-12-11","arxiv_id":"1912.05291","n_code_links":0,"syntology":null},{"paper":"/paper/incrementally-improving-graph-wavenet","slug":"incrementally-improving-graph-wavenet","title":"Incrementally Improving Graph WaveNet Performance on Traffic Prediction","date":"2019-12-11","arxiv_id":"1912.07390","n_code_links":4,"syntology":null},{"paper":null,"slug":"learning-to-request-guidance-in-emergent-1","title":"Learning to Request Guidance in Emergent Communication","date":"2019-12-11","arxiv_id":"1912.05525","n_code_links":0,"syntology":null},{"paper":"/paper/tanet-robust-3d-object-detection-from-point","slug":"tanet-robust-3d-object-detection-from-point","title":"TANet: Robust 3D Object Detection from Point Clouds with Triple Attention","date":"2019-12-11","arxiv_id":"1912.05163","n_code_links":2,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/unet-redesigning-skip-connections-to-exploit","slug":"unet-redesigning-skip-connections-to-exploit","title":"UNet++: Redesigning Skip Connections to Exploit Multiscale Features in Image Segmentation","date":"2019-12-11","arxiv_id":"1912.05074","n_code_links":13,"syntology":{"ran":4,"of":9,"n_ran_checked":3,"n_instrument":1,"unverified":5,"pointer_only":3,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","official":{"repos":["MrGiovanni/UNetPlusPlus"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":null,"slug":"flow-distilled-ip-two-stream-networks-for","title":"Flow-Distilled IP Two-Stream Networks for Compressed Video Action Recognition","date":"2019-12-10","arxiv_id":"1912.04462","n_code_links":0,"syntology":null},{"paper":"/paper/pillar-in-pillar-multi-scale-and-dynamic","slug":"pillar-in-pillar-multi-scale-and-dynamic","title":"Context-Aware Dynamic Feature Extraction for 3D Object Detection in Point Clouds","date":"2019-12-10","arxiv_id":"1912.04775","n_code_links":1,"syntology":null},{"paper":null,"slug":"an-empirical-study-on-position-of-the-batch","title":"An Empirical Study on Position of the Batch Normalization Layer in Convolutional Neural Networks","date":"2019-12-09","arxiv_id":"1912.04259","n_code_links":0,"syntology":null},{"paper":null,"slug":"environment-reconstruction-on-depth-images","title":"Environment reconstruction on depth images using Generative Adversarial Networks","date":"2019-12-09","arxiv_id":"1912.03992","n_code_links":0,"syntology":null},{"paper":null,"slug":"infocnf-an-efficient-conditional-continuous","title":"InfoCNF: An Efficient Conditional Continuous Normalizing Flow with Adaptive Solvers","date":"2019-12-09","arxiv_id":"1912.03978","n_code_links":0,"syntology":null},{"paper":null,"slug":"machine-learning-models-show-similar","title":"Machine learning models show similar performance to Renewables.ninja for generation of long-term wind power time series even without location information","date":"2019-12-09","arxiv_id":"1912.09426","n_code_links":0,"syntology":null},{"paper":"/paper/a-real-time-global-inference-network-for-one","slug":"a-real-time-global-inference-network-for-one","title":"A Real-time Global Inference Network for One-stage Referring Expression Comprehension","date":"2019-12-07","arxiv_id":"1912.03478","n_code_links":1,"syntology":{"ran":13,"of":15,"n_ran_checked":9,"n_instrument":4,"unverified":2,"pointer_only":1,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","official":{"repos":["luogen1996/Real-time-Global-Inference-Network"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/dynamic-convolutions-exploiting-spatial","slug":"dynamic-convolutions-exploiting-spatial","title":"Dynamic Convolutions: Exploiting Spatial Sparsity for Faster Inference","date":"2019-12-06","arxiv_id":"1912.03203","n_code_links":1,"syntology":{"ran":4,"of":5,"n_ran_checked":1,"n_instrument":3,"unverified":1,"pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","official":{"repos":["thomasverelst/dynconv"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/grid-gcn-for-fast-and-scalable-point-cloud","slug":"grid-gcn-for-fast-and-scalable-point-cloud","title":"Grid-GCN for Fast and Scalable Point Cloud Learning","date":"2019-12-06","arxiv_id":"1912.02984","n_code_links":1,"syntology":null},{"paper":null,"slug":"an-accelerated-correlation-filter-tracker","title":"An Accelerated Correlation Filter Tracker","date":"2019-12-05","arxiv_id":"1912.02854","n_code_links":0,"syntology":null},{"paper":null,"slug":"deep-learning-based-segmentation-free-license","title":"Deep Learning Based Segmentation Free License Plate Recognition Using Roadway Surveillance Camera Images","date":"2019-12-05","arxiv_id":"1912.02441","n_code_links":0,"syntology":null},{"paper":null,"slug":"rongba-a-robustly-optimized-natural-gradient","title":"RoNGBa: A Robustly Optimized Natural Gradient Boosting Training Approach with Leaf Number Clipping","date":"2019-12-05","arxiv_id":"1912.02338","n_code_links":0,"syntology":null},{"paper":"/paper/embedmask-embedding-coupling-for-one-stage","slug":"embedmask-embedding-coupling-for-one-stage","title":"EmbedMask: Embedding Coupling for One-stage Instance Segmentation","date":"2019-12-04","arxiv_id":"1912.01954","n_code_links":3,"syntology":null},{"paper":null,"slug":"evaluation-metrics-for-item-recommendation","title":"Evaluation Metrics for Item Recommendation under Sampling","date":"2019-12-04","arxiv_id":"1912.02263","n_code_links":0,"syntology":null},{"paper":null,"slug":"exploring-multi-banking-customer-to-customer","title":"Exploring Multi-Banking Customer-to-Customer Relations in AML Context with Poincaré Embeddings","date":"2019-12-04","arxiv_id":"1912.07701","n_code_links":0,"syntology":null},{"paper":"/paper/extreme-learning-machine-design-for-dealing","slug":"extreme-learning-machine-design-for-dealing","title":"Extreme Learning Machine design for dealing with unrepresentative features","date":"2019-12-04","arxiv_id":"1912.02154","n_code_links":1,"syntology":null},{"paper":"/paper/walking-on-the-edge-fast-low-distortion-1","slug":"walking-on-the-edge-fast-low-distortion-1","title":"Walking on the Edge: Fast, Low-Distortion Adversarial Examples","date":"2019-12-04","arxiv_id":"1912.02153","n_code_links":1,"syntology":null}],"record_sha256":"f1f2d613bcef080c71407405cec70a5b9d00192efd15aa0564562a9f81835ea3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}