{"id":"W1900682062","doi":"10.1109/mwscas.1997.662164","title":"Fast VLSI architecture for rank order based filtering using a bit-serial window partitioning technique","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Very-large-scale integration; Computer science; Window (computing); Algorithm; Window function; Binary number; Filter (signal processing); Boolean function; Rank (graph theory); Binary tree; Parallel computing; Stack (abstract data type); Computer hardware; Arithmetic; Mathematics; Embedded system; Computer vision","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002413863,0.0005470442,0.0003811707,0.0007732931,0.0002764311,0.0006097296,0.0008966206,0.0004301918,0.00294585],"category_scores_gemma":[0.0003956122,0.0002676793,0.0002796015,0.000705092,0.0002123657,0.0009215513,0.0002378694,0.0004681442,0.001029823],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003925388,"about_ca_system_score_gemma":0.0005014371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001423227,"about_ca_topic_score_gemma":0.002897733,"domain_scores_codex":[0.9998648,0.00001846194,0.000010388,0.00002383831,0.00006310458,0.00001938326],"domain_scores_gemma":[0.9998426,0.0000483088,0.00001952452,0.00002781065,0.00005217552,0.000009436118],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003851837,0.00008956066,0.0005591091,0.0002084138,0.00008036377,0.0001468633,0.00009676034,0.01258571,0.4547794,0.01440715,0.003615343,0.5130462],"study_design_scores_gemma":[0.0002453811,0.00165977,0.002997054,0.00004653557,0.000270482,0.001166025,0.00006589289,0.5956062,0.3602424,0.008676536,0.02893014,0.00009366839],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03388589,0.000586839,0.9607777,0.00008144453,0.00007627692,0.00009146085,0.00009218029,0.002146876,0.002261302],"genre_scores_gemma":[0.1979621,0.0005460839,0.797139,0.0001056245,0.00007697738,0.0001607356,0.0003864947,0.00009486466,0.003528079],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00294585,"threshold_uncertainty_score":0.009854794,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03479453699891197,"score_gpt":0.2789180752288343,"score_spread":0.2441235382299223,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}