{"id":"W2157165312","doi":"10.1109/infcom.2007.284","title":"Randomized k-Coverage Algorithms For Dense Sensor Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":140,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Algorithm; Logarithm; Computer science; Wireless sensor network; Set (abstract data type); Distributed algorithm; Key (lock); Brooks–Iyengar algorithm; Upper and lower bounds; Randomized algorithm; Approximation algorithm; Algorithm design; Mathematics; Distributed computing; Key distribution in wireless sensor networks; Wireless network","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.00209932,0.001092185,0.00171518,0.001248504,0.001011326,0.001056072,0.003279119,0.001439247,0.002662438],"category_scores_gemma":[0.01024478,0.0007404904,0.0009789048,0.001913252,0.001362197,0.00320176,0.002671163,0.001162802,0.0007871805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001533235,"about_ca_system_score_gemma":0.001715398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003000809,"about_ca_topic_score_gemma":0.003316807,"domain_scores_codex":[0.9975289,0.0009023776,0.0001617436,0.0004891871,0.0006509579,0.0002669866],"domain_scores_gemma":[0.9933978,0.003862991,0.0008914382,0.001143469,0.0004807621,0.0002233919],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004364577,0.0002004867,0.001451982,0.0003110213,0.0001056333,0.0001014181,0.0002258434,0.7985573,0.004138554,0.04176494,0.004522036,0.1481842],"study_design_scores_gemma":[0.0001118762,0.00006988493,0.000198081,0.00001578777,0.00001417201,0.00007994317,0.00002509294,0.9768856,0.001282916,0.01990791,0.001394367,0.00001441568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01437759,0.0003354086,0.9825166,0.0002086655,0.00003297754,0.000129467,0.00007541151,0.000826401,0.001497472],"genre_scores_gemma":[0.3591169,0.0004115815,0.6371288,0.00023321,0.00006482794,0.0006012327,0.0004677603,0.0001627381,0.001813027],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003279119,"threshold_uncertainty_score":0.01112449,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01561617032396624,"score_gpt":0.2564076542926405,"score_spread":0.2407914839686743,"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."}}