{"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/quantization/papers/50","list_of":"/task/quantization","task":"Quantization","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":50,"pages_in_order":50,"rows_per_page":100,"rows":[4901,4925],"of":4925,"counts":{"archive_papers_tagged":4925,"with_a_code_link":1596,"where_syntology_ran_a_sample":515,"not_listed_spam_title":0,"listed":4925,"listed_where_code_ran":515,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":452,"every_run_a_failure_of_syntologys_instrument":63,"listed_with_a_run_with_no_instrument_failure":452,"listed_every_run_a_failure_of_syntologys_instrument":63,"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/quantization","prev":"/task/quantization/papers/49","next":null,"papers":[{"url":null,"slug":"using-self-organizing-maps-for-sentiment","title":"Using Self-Organizing Maps for Sentiment Analysis","date":"2013-09-16","arxiv_id":"1309.3946","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-study-on-unsupervised-dictionary-learning","title":"A Study on Unsupervised Dictionary Learning and Feature Encoding for Action Classification","date":"2013-09-02","arxiv_id":"1309.0309","repositories_listed":0,"syntology":null},{"url":null,"slug":"coding-for-random-projections","title":"Coding for Random Projections","date":"2013-08-09","arxiv_id":"1308.2218","repositories_listed":0,"syntology":null},{"url":null,"slug":"random-binary-mappings-for-kernel-learning","title":"Random Binary Mappings for Kernel Learning and Efficient SVM","date":"2013-07-19","arxiv_id":"1307.5161","repositories_listed":0,"syntology":null},{"url":null,"slug":"event-retrieval-in-large-video-collections","title":"Event Retrieval in Large Video Collections with Circulant Temporal Encoding","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"k-means-hashing-an-affinity-preserving","title":"K-Means Hashing: An Affinity-Preserving Quantization Method for Learning Binary Compact Codes","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-binary-codes-for-high-dimensional","title":"Learning Binary Codes for High-Dimensional Data Using Bilinear Projections","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"optimized-product-quantization-for","title":"Optimized Product Quantization for Approximate Nearest Neighbor Search","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-quantization-for-patch-description","title":"Sparse Quantization for Patch Description","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"qualitative-detection-of-oil-adulteration","title":"Qualitative detection of oil adulteration with machine learning approaches","date":"2013-05-14","arxiv_id":"1305.3149","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-adaptive-statistical-non-uniform-quantizer","title":"An Adaptive Statistical Non-uniform Quantizer for Detail Wavelet Components in Lossy JPEG2000 Image Compression","date":"2013-05-09","arxiv_id":"1305.1986","repositories_listed":0,"syntology":null},{"url":null,"slug":"anisotropic-oracle-inequalities-in-noisy","title":"Anisotropic oracle inequalities in noisy quantization","date":"2013-05-03","arxiv_id":"1305.0630","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-improved-wavelet-based-signal-denoising","title":"An improved wavelet-based signal-denoising architecture with less hardware consumption","date":"2013-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"wavelet-denoising-on-hardware-devices-with","title":"Wavelet-denoising on hardware devices with Perfect Reconstruction, low latency and adaptive thresholding","date":"2013-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"angular-quantization-based-binary-codes-for","title":"Angular Quantization-based Binary Codes for Fast Similarity Search","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-probability-measures-with-respect-to","title":"Learning Probability Measures with respect to Optimal Transport Metrics","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-dequantized-compressive-sensing","title":"Robust Dequantized Compressive Sensing","date":"2012-07-03","arxiv_id":"1207.0577","repositories_listed":0,"syntology":null},{"url":null,"slug":"codage-echelonnable-a-granularite-fine-de-la","title":"Codage \\'echelonnable \\`a granularit\\'e fine de la parole : Application au codeur G.729 (Fine granularity scalable speech coding: Application to the G.729 coder) [in French]","date":"2012-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"joshua-40-packing-pro-and-paraphrases","title":"Joshua 4.0: Packing, PRO, and Paraphrases","date":"2012-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-k-nearest-neighbor-efficacy-for","title":"Improving K-Nearest Neighbor Efficacy for Farsi Text Classification","date":"2012-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"an-additive-latent-feature-model-for","title":"An Additive Latent Feature Model for Transparent Object Recognition","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-match-kernel-between-sets-of","title":"Efficient Match Kernel between Sets of Features for Visual Recognition","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":"spectral-clustering-with-perturbed-data","title":"Spectral Clustering with Perturbed Data","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"jie-he-yi-chuan-suan-fa-de-lvqshen-jing-wang","title":"结合遗传算法的LVQ神经网络 在声学底质分类中的应用","date":"2007-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"2018cbe5075ea1eca56d658f785bccd3e944dc96562c92c21e92a4b73f3f9587","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}