{"id":"W2124894008","doi":"10.1109/mwscas.2007.4488662","title":"Exploring different methods for 2DR-tree binary search on a FPGA","year":2007,"lang":"en","type":"article","venue":"Conference proceedings","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Implementation; Field-programmable gate array; Computer science; Software implementation; Software; Binary tree; Data structure; Tree (set theory); Binary data; Computer architecture; Binary number; Parallel computing; Theoretical computer science; Embedded system; Operating system; Software engineering; Programming language; Arithmetic; Mathematics","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001385694,0.0002337345,0.0002282878,0.0003214883,0.0001995733,0.000554585,0.001466413,0.00004226406,0.00001264625],"category_scores_gemma":[0.0001092246,0.0001991212,0.00008044348,0.0004229587,0.0000525079,0.00153899,0.0006731577,0.0002040097,0.0000344869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005785841,"about_ca_system_score_gemma":0.0000264956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005283384,"about_ca_topic_score_gemma":9.986667e-7,"domain_scores_codex":[0.9980897,0.00001102715,0.0002621042,0.000678297,0.000320194,0.0006386964],"domain_scores_gemma":[0.9990324,0.0001840718,0.00007768014,0.0002922125,0.0002397167,0.0001739287],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002815024,0.00008543873,0.0002159472,0.00006548156,0.00001771808,0.000003279841,0.001190597,3.780724e-7,0.004659414,0.1613078,0.001136837,0.8312889],"study_design_scores_gemma":[0.003443423,0.003248221,0.03717949,0.0007589507,0.00007123192,0.00001713846,0.003829437,0.3392322,0.3752298,0.03819969,0.1962855,0.002504789],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0520827,0.00002605282,0.9368404,0.002035662,0.0004957844,0.0004880122,0.000002284339,0.0003014383,0.007727629],"genre_scores_gemma":[0.6362384,0.00009341513,0.3611581,0.0006894089,0.0002081568,0.0002255058,0.000009435536,0.00002721293,0.001350387],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8287842,"threshold_uncertainty_score":0.8119929,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2558867416882275,"score_gpt":0.378630708343344,"score_spread":0.1227439666551165,"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."}}