callback( { "result":{ "query":"strong* connection*", "status":{ "@code":"200", "text":"OK" }, "time":{ "@unit":"msecs", "text":"125.59" }, "completions":{ "@total":"3", "@computed":"3", "@sent":"0" }, "hits":{ "@total":"49", "@computed":"49", "@sent":"49", "@first":"0", "hit":[{ "@score":"2", "@id":"59021", "info":{"authors":{"author":{"@pid":"39/4545","text":"Giampiero Salvi"}},"title":"Dynamic Behaviour of Connectionist Speech Recognition with Strong Latency Constraints.","venue":"CoRR","volume":"abs/2401.06588","year":"2024","type":"Informal and Other Publications","access":"open","key":"journals/corr/abs-2401-06588","doi":"10.48550/ARXIV.2401.06588","ee":"https://doi.org/10.48550/arXiv.2401.06588","url":"https://dblp.org/rec/journals/corr/abs-2401-06588"}, "url":"URL#59021" }, { "@score":"2", "@id":"94112", "info":{"authors":{"author":[{"@pid":"157/5097","text":"Yingbin Ma"},{"@pid":"14/10138","text":"Xiaoxue Zhang"}]},"title":"Graphs with (strong) proper connection numbers m-3 and m-4.","venue":"Appl. Math. Comput.","volume":"445","pages":"127843","year":"2023","type":"Journal Articles","access":"closed","key":"journals/amc/MaZ23a","doi":"10.1016/J.AMC.2023.127843","ee":"https://doi.org/10.1016/j.amc.2023.127843","url":"https://dblp.org/rec/journals/amc/MaZ23a"}, "url":"URL#94112" }, { "@score":"2", "@id":"94139", "info":{"authors":{"author":[{"@pid":"242/7220","text":"Kairui Nie"},{"@pid":"157/5097","text":"Yingbin Ma"},{"@pid":"29/2398","text":"Elzbieta Sidorowicz"}]},"title":"(Strong) Proper vertex connection of some digraphs.","venue":"Appl. Math. Comput.","volume":"458","pages":"128243","year":"2023","type":"Journal Articles","access":"open","key":"journals/amc/NieMS23","doi":"10.1016/J.AMC.2023.128243","ee":"https://doi.org/10.1016/j.amc.2023.128243","url":"https://dblp.org/rec/journals/amc/NieMS23"}, "url":"URL#94139" }, { "@score":"2", "@id":"100328", "info":{"authors":{"author":[{"@pid":"157/5097","text":"Yingbin Ma"},{"@pid":"14/10138","text":"Xiaoxue Zhang"},{"@pid":"341/2678","text":"Yanfeng Xue"}]},"title":"Graphs with Strong Proper Connection Numbers and Large Cliques.","venue":"Axioms","volume":"12","number":"4","pages":"353","year":"2023","type":"Journal Articles","access":"open","key":"journals/axioms/MaZX23","doi":"10.3390/AXIOMS12040353","ee":"https://doi.org/10.3390/axioms12040353","url":"https://dblp.org/rec/journals/axioms/MaZX23"}, "url":"URL#100328" }, { "@score":"2", "@id":"165539", "info":{"authors":{"author":[{"@pid":"82/7604","text":"Estevão Esmi"},{"@pid":"182/4054","text":"Jefferson Silva"},{"@pid":"25/3594","text":"Tofigh Allahviranloo"},{"@pid":"00/4713","text":"Laécio C. Barros"}]},"title":"Some connections between the generalized Hukuhara derivative and the fuzzy derivative based on strong linear independence.","venue":"Inf. Sci.","volume":"643","pages":"119249","year":"2023","type":"Journal Articles","access":"closed","key":"journals/isci/EsmiSAB23","doi":"10.1016/J.INS.2023.119249","ee":"https://doi.org/10.1016/j.ins.2023.119249","url":"https://dblp.org/rec/journals/isci/EsmiSAB23"}, "url":"URL#165539" }, { "@score":"4", "@id":"184081", "info":{"authors":{"author":[{"@pid":"157/5097","text":"Yingbin Ma"},{"@pid":"341/2678","text":"Yanfeng Xue"},{"@pid":"14/10138","text":"Xiaoxue Zhang"}]},"title":"Proper (Strong) Rainbow Connection and Proper (Strong) Rainbow Vertex Connection of Some Special Graphs.","venue":"J. Interconnect. Networks","volume":"23","number":"3","pages":"2250006:1-2250006:19","year":"2023","type":"Journal Articles","access":"closed","key":"journals/join/MaXZ23","doi":"10.1142/S0219265922500062","ee":"https://doi.org/10.1142/S0219265922500062","url":"https://dblp.org/rec/journals/join/MaXZ23"}, "url":"URL#184081" }, { "@score":"2", "@id":"545825", "info":{"authors":{"author":{"@pid":"08/3583","text":"Kevin Pratt"}},"title":"A stronger connection between the asymptotic rank conjecture and the set cover conjecture.","venue":"CoRR","volume":"abs/2311.02774","year":"2023","type":"Informal and Other Publications","access":"open","key":"journals/corr/abs-2311-02774","doi":"10.48550/ARXIV.2311.02774","ee":"https://doi.org/10.48550/arXiv.2311.02774","url":"https://dblp.org/rec/journals/corr/abs-2311-02774"}, "url":"URL#545825" }, { "@score":"2", "@id":"632738", "info":{"authors":{"author":[{"@pid":"27/6119","text":"József Dombi 0001"},{"@pid":"178/1231","text":"Tamás Jónás"}]},"title":"Remarks on two representations of strong negations and a connection between nilpotent and strict triangular norms.","venue":"Fuzzy Sets Syst.","volume":"448","pages":"173-177","year":"2022","type":"Journal Articles","access":"open","key":"journals/fss/DombiJ22a","doi":"10.1016/J.FSS.2022.01.009","ee":"https://doi.org/10.1016/j.fss.2022.01.009","url":"https://dblp.org/rec/journals/fss/DombiJ22a"}, "url":"URL#632738" }, { "@score":"2", "@id":"696160", "info":{"authors":{"author":[{"@pid":"255/7293","text":"Logan A. Smith"},{"@pid":"255/7508","text":"David T. Mildebrath"},{"@pid":"58/3719","text":"Illya V. Hicks"}]},"title":"An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs.","venue":"Networks","volume":"79","number":"1","pages":"3-19","year":"2022","type":"Journal Articles","access":"closed","key":"journals/networks/SmithMH22","doi":"10.1002/NET.22031","ee":"https://doi.org/10.1002/net.22031","url":"https://dblp.org/rec/journals/networks/SmithMH22"}, "url":"URL#696160" }, { "@score":"3", "@id":"841705", "info":{"authors":{"author":{"@pid":"63/5298","text":"Yuwei Wu"}},"title":"Creative Design Diffusion Model Under Agglomerate Effect - Transformation of Creative Clusters From Weak Connection to Strong Connection.","venue":"HCI","pages":"101-109","year":"2022","type":"Conference and Workshop Papers","access":"closed","key":"conf/hci/Wu22c","doi":"10.1007/978-3-031-19679-9_14","ee":"https://doi.org/10.1007/978-3-031-19679-9_14","url":"https://dblp.org/rec/conf/hci/Wu22c"}, "url":"URL#841705" }, { "@score":"2", "@id":"890484", "info":{"authors":{"author":[{"@pid":"166/6523","text":"Tarek Idriss"},{"@pid":"333/4123","text":"Alex Gavin"},{"@pid":"333/3397","text":"Adrian Gabales"},{"@pid":"166/6517","text":"Haytham Idriss"},{"@pid":"b/MagdyABayoumi","text":"Magdy A. Bayoumi"}]},"title":"XFeed PUF: A Secure and Efficient Delay-based Strong PUF Using Cross-Feed Connections.","venue":"ISCAS","pages":"461-465","year":"2022","type":"Conference and Workshop Papers","access":"closed","key":"conf/iscas/IdrissGGIB22","doi":"10.1109/ISCAS48785.2022.9937815","ee":"https://doi.org/10.1109/ISCAS48785.2022.9937815","url":"https://dblp.org/rec/conf/iscas/IdrissGGIB22"}, "url":"URL#890484" }, { "@score":"2", "@id":"1063641", "info":{"authors":{"author":[{"@pid":"308/6981","text":"Deepak Sangroya"},{"@pid":"308/6552","text":"Rambalak Yadav"},{"@pid":"227/1705","text":"Yatish Joshi"}]},"title":"Does gamified interaction build a strong consumer-brand connection? A study of mobile applications.","venue":"Australas. J. Inf. Syst.","volume":"25","year":"2021","type":"Journal Articles","access":"closed","key":"journals/ajis/SangroyaYJ21","doi":"10.3127/AJIS.V25I0.3105","ee":"https://doi.org/10.3127/ajis.v25i0.3105","url":"https://dblp.org/rec/journals/ajis/SangroyaYJ21"}, "url":"URL#1063641" }, { "@score":"2", "@id":"1095241", "info":{"authors":{"author":[{"@pid":"57/4452","text":"Meng Ji"},{"@pid":"02/736","text":"Jing Wang"}]},"title":"Some results on strong conflict-free connection number of graphs.","venue":"Discret. Math. Algorithms Appl.","volume":"13","number":"5","pages":"2150066:1-2150066:10","year":"2021","type":"Journal Articles","access":"closed","key":"journals/dmaa/JiW21","doi":"10.1142/S179383092150066X","ee":"https://doi.org/10.1142/S179383092150066X","url":"https://dblp.org/rec/journals/dmaa/JiW21"}, "url":"URL#1095241" }, { "@score":"2", "@id":"1095341", "info":{"authors":{"author":[{"@pid":"64/3246","text":"Hui Jiang"},{"@pid":"08/6548","text":"Wenjing Li"},{"@pid":"l/XueliangLi","text":"Xueliang Li 0001"},{"@pid":"78/8049","text":"Colton Magnant"}]},"title":"On proper (strong) rainbow connection of graphs.","venue":"Discuss. Math. Graph Theory","volume":"41","number":"2","pages":"469-479","year":"2021","type":"Journal Articles","access":"open","key":"journals/dmgt/JiangL0M21","doi":"10.7151/DMGT.2201","ee":"https://doi.org/10.7151/dmgt.2201","url":"https://dblp.org/rec/journals/dmgt/JiangL0M21"}, "url":"URL#1095341" }, { "@score":"2", "@id":"1142034", "info":{"authors":{"author":[{"@pid":"157/5097","text":"Yingbin Ma"},{"@pid":"242/7220","text":"Kairui Nie"}]},"title":"(Strong) Total proper connection of some digraphs.","venue":"J. Comb. Optim.","volume":"42","number":"1","pages":"24-39","year":"2021","type":"Journal Articles","access":"closed","key":"journals/jco/MaN21","doi":"10.1007/S10878-021-00738-W","ee":"https://doi.org/10.1007/s10878-021-00738-w","url":"https://dblp.org/rec/journals/jco/MaN21"}, "url":"URL#1142034" }, { "@score":"2", "@id":"1529970", "info":{"authors":{"author":[{"@pid":"57/4452","text":"Meng Ji"},{"@pid":"l/XueliangLi","text":"Xueliang Li 0001"}]},"title":"Strong conflict-free connection of graphs.","venue":"Appl. Math. Comput.","volume":"364","year":"2020","type":"Journal Articles","access":"closed","key":"journals/amc/JiL20","doi":"10.1016/J.AMC.2019.124639","ee":"https://doi.org/10.1016/j.amc.2019.124639","url":"https://dblp.org/rec/journals/amc/JiL20"}, "url":"URL#1529970" }, { "@score":"2", "@id":"1891084", "info":{"authors":{"author":[{"@pid":"255/7293","text":"Logan A. Smith"},{"@pid":"255/7508","text":"David T. Mildebrath"},{"@pid":"58/3719","text":"Illya V. Hicks"}]},"title":"An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs.","venue":"CoRR","volume":"abs/2006.02988","year":"2020","type":"Informal and Other Publications","access":"open","key":"journals/corr/abs-2006-02988","ee":"https://arxiv.org/abs/2006.02988","url":"https://dblp.org/rec/journals/corr/abs-2006-02988"}, "url":"URL#1891084" }, { "@score":"2", "@id":"1951751", "info":{"authors":{"author":[{"@pid":"157/5097","text":"Yingbin Ma"},{"@pid":"242/7220","text":"Kairui Nie"}]},"title":"(Strong) Proper Connection in Some Digraphs.","venue":"IEEE Access","volume":"7","pages":"69692-69697","year":"2019","type":"Journal Articles","access":"open","key":"journals/access/MaN19","doi":"10.1109/ACCESS.2019.2918368","ee":"https://doi.org/10.1109/ACCESS.2019.2918368","url":"https://dblp.org/rec/journals/access/MaN19"}, "url":"URL#1951751" }, { "@score":"2", "@id":"1986860", "info":{"authors":{"author":[{"@pid":"h/FeiHuang","text":"Fei Huang"},{"@pid":"23/5997","text":"Jinjiang Yuan"}]},"title":"On strong proper connection number of cubic graphs.","venue":"Discret. Appl. Math.","volume":"265","pages":"104-119","year":"2019","type":"Journal Articles","access":"closed","key":"journals/dam/HuangY19","doi":"10.1016/J.DAM.2019.03.014","ee":"https://doi.org/10.1016/j.dam.2019.03.014","url":"https://dblp.org/rec/journals/dam/HuangY19"}, "url":"URL#1986860" }, { "@score":"2", "@id":"2139704", "info":{"authors":{"author":[{"@pid":"116/0948-1","text":"Lijie Chen 0001"},{"@pid":"w/RyanWilliams","text":"R. Ryan Williams"}]},"title":"Stronger Connections Between Circuit Analysis and Circuit Lower Bounds, via PCPs of Proximity.","venue":"CCC","pages":"19:1-19:43","year":"2019","type":"Conference and Workshop Papers","access":"open","key":"conf/coco/ChenW19","doi":"10.4230/LIPICS.CCC.2019.19","ee":"https://doi.org/10.4230/LIPIcs.CCC.2019.19","url":"https://dblp.org/rec/conf/coco/ChenW19"}, "url":"URL#2139704" }, { "@score":"2", "@id":"2352675", "info":{"authors":{"author":[{"@pid":"255/7293","text":"Logan A. Smith"},{"@pid":"255/7508","text":"David T. Mildebrath"},{"@pid":"58/3719","text":"Illya V. Hicks"}]},"title":"A Polynomial Time Algorithm for Computing the Strong Rainbow Connection Numbers of Odd Cacti.","venue":"CoRR","volume":"abs/1912.11906","year":"2019","type":"Informal and Other Publications","access":"open","key":"journals/corr/abs-1912-11906","ee":"http://arxiv.org/abs/1912.11906","url":"https://dblp.org/rec/journals/corr/abs-1912-11906"}, "url":"URL#2352675" }, { "@score":"2", "@id":"2371991", "info":{"authors":{"author":[{"@pid":"13/3479-13","text":"Lin Chen 0013"},{"@pid":"l/XueliangLi","text":"Xueliang Li 0001"},{"@pid":"25/4704","text":"Henry Liu"},{"@pid":"62/1684-2","text":"Jinfeng Liu 0002"}]},"title":"On various (strong) rainbow connection numbers of graphs.","venue":"Australas. J Comb.","volume":"70","pages":"137-156","year":"2018","type":"Journal Articles","access":"open","key":"journals/ajc/ChenLLL18","ee":"http://ajc.maths.uq.edu.au/pdf/70/ajc_v70_p137.pdf","url":"https://dblp.org/rec/journals/ajc/ChenLLL18"}, "url":"URL#2371991" }, { "@score":"2", "@id":"2395045", "info":{"authors":{"author":[{"@pid":"29/2398","text":"Elzbieta Sidorowicz"},{"@pid":"75/1997","text":"Éric Sopena"}]},"title":"Strong rainbow connection in digraphs.","venue":"Discret. Appl. Math.","volume":"238","pages":"133-143","year":"2018","type":"Journal Articles","access":"closed","key":"journals/dam/SidorowiczS18","doi":"10.1016/J.DAM.2017.12.017","ee":"https://doi.org/10.1016/j.dam.2017.12.017","url":"https://dblp.org/rec/journals/dam/SidorowiczS18"}, "url":"URL#2395045" }, { "@score":"2", "@id":"2396573", "info":{"authors":{"author":[{"@pid":"194/2527","text":"Yulong Wei"},{"@pid":"09/0-5","text":"Min Xu 0005"},{"@pid":"70/4572","text":"Kaishun Wang"}]},"title":"Strong rainbow connection numbers of toroidal meshes.","venue":"Discret. Math. Algorithms Appl.","volume":"10","number":"3","pages":"1850039:1-1850039:10","year":"2018","type":"Journal Articles","access":"closed","key":"journals/dmaa/WeiXW18","doi":"10.1142/S1793830918500398","ee":"https://doi.org/10.1142/S1793830918500398","url":"https://dblp.org/rec/journals/dmaa/WeiXW18"}, "url":"URL#2396573" }, { "@score":"2", "@id":"3488929", "info":{"authors":{"author":[{"@pid":"37/400","text":"Jakub Pawlewicz"},{"@pid":"h/RyanBHayward","text":"Ryan B. Hayward"},{"@pid":"49/2058","text":"Philip Henderson"},{"@pid":"95/570","text":"Broderick Arneson"}]},"title":"Stronger Virtual Connections in Hex.","venue":"IEEE Trans. Comput. Intell. AI Games","volume":"7","number":"2","pages":"156-166","year":"2015","type":"Journal Articles","access":"closed","key":"journals/tciaig/PawlewiczHHA15","doi":"10.1109/TCIAIG.2014.2345398","ee":"https://doi.org/10.1109/TCIAIG.2014.2345398","url":"https://dblp.org/rec/journals/tciaig/PawlewiczHHA15"}, "url":"URL#3488929" }, { "@score":"2", "@id":"3568235", "info":{"authors":{"author":[{"@pid":"g/JamesGeller","text":"James Geller"},{"@pid":"k/ShmuelTomiKlein","text":"Shmuel T. Klein"},{"@pid":"172/1695","text":"Yuriy Polyakov"}]},"title":"Identifying Pairs of Terms with Strong Semantic Connections in a Textbook Index.","venue":"KEOD","pages":"307-315","year":"2015","type":"Conference and Workshop Papers","access":"closed","key":"conf/ic3k/GellerKP15","doi":"10.5220/0005615403070315","ee":"https://doi.org/10.5220/0005615403070315","url":"https://dblp.org/rec/conf/ic3k/GellerKP15"}, "url":"URL#3568235" }, { "@score":"2", "@id":"3580114", "info":{"authors":{"author":[{"@pid":"174/5124","text":"Fendy Septyanto"},{"@pid":"35/3005","text":"Kiki Ariyanti Sugeng"}]},"title":"On the Rainbow and Strong Rainbow Connection Numbers of the m-Splitting of the Complete Graph Kn.","venue":"ICGTIS","pages":"155-161","year":"2015","type":"Conference and Workshop Papers","access":"open","key":"conf/icgtis/SeptyantoS15","doi":"10.1016/J.PROCS.2015.12.092","ee":"https://doi.org/10.1016/j.procs.2015.12.092","url":"https://dblp.org/rec/conf/icgtis/SeptyantoS15"}, "url":"URL#3580114" }, { "@score":"2", "@id":"3612963", "info":{"authors":{"author":[{"@pid":"144/8065","text":"Juane Li"},{"@pid":"90/4497","text":"Keke Liu"},{"@pid":"20/1643-1","text":"Shu Lin 0001"},{"@pid":"21/3655","text":"Khaled A. S. Abdel-Ghaffar"},{"@pid":"44/3856","text":"William E. Ryan"}]},"title":"An unnoticed strong connection between algebraic-based and protograph-based LDPC codes, Part I: Binary case and interpretation.","venue":"ITA","pages":"36-45","year":"2015","type":"Conference and Workshop Papers","access":"closed","key":"conf/ita/LiLLAR15","doi":"10.1109/ITA.2015.7308964","ee":"https://doi.org/10.1109/ITA.2015.7308964","url":"https://dblp.org/rec/conf/ita/LiLLAR15"}, "url":"URL#3612963" }, { "@score":"2", "@id":"4285862", "info":{"authors":{"author":[{"@pid":"22/6056","text":"Emad A. M. Andrews"},{"@pid":"b/AJBonner","text":"Anthony J. Bonner"}]},"title":"Finding MAPs using strongly equivalent high order recurrent symmetric connectionist networks.","venue":"Cogn. Syst. Res.","volume":"14","number":"1","pages":"50-59","year":"2012","type":"Journal Articles","access":"closed","key":"journals/cogsr/AndrewsB12","doi":"10.1016/J.COGSYS.2010.12.013","ee":"https://doi.org/10.1016/j.cogsys.2010.12.013","url":"https://dblp.org/rec/journals/cogsr/AndrewsB12"}, "url":"URL#4285862" }, { "@score":"2", "@id":"4287294", "info":{"authors":{"author":[{"@pid":"72/5962","text":"Peter A. Jansen"},{"@pid":"37/4436","text":"Scott Watter"}]},"title":"Strong systematicity through sensorimotor conceptual grounding: an unsupervised, developmental approach to connectionist sentence processing.","venue":"Connect. Sci.","volume":"24","number":"1","pages":"25-55","year":"2012","type":"Journal Articles","access":"closed","key":"journals/connection/JansenW12","doi":"10.1080/09540091.2012.664121","ee":"https://doi.org/10.1080/09540091.2012.664121","url":"https://dblp.org/rec/journals/connection/JansenW12"}, "url":"URL#4287294" }, { "@score":"2", "@id":"4547680", "info":{"authors":{"author":[{"@pid":"62/8668","text":"Hengzhe Li"},{"@pid":"l/XueliangLi","text":"Xueliang Li 0001"},{"@pid":"37/10529","text":"Sujuan Liu"}]},"title":"The (strong) rainbow connection numbers of Cayley graphs on Abelian groups.","venue":"Comput. Math. Appl.","volume":"62","number":"11","pages":"4082-4088","year":"2011","type":"Journal Articles","access":"open","key":"journals/cma/LiLL11","doi":"10.1016/J.CAMWA.2011.09.056","ee":"https://doi.org/10.1016/j.camwa.2011.09.056","url":"https://dblp.org/rec/journals/cma/LiLL11"}, "url":"URL#4547680" }, { "@score":"2", "@id":"4598276", "info":{"authors":{"author":{"@pid":"81/7896","text":"Ray E. Reagans"}},"title":"Close Encounters: Analyzing How Social Similarity and Propinquity Contribute to Strong Network Connections.","venue":"Organ. Sci.","volume":"22","number":"4","pages":"835-849","year":"2011","type":"Journal Articles","access":"closed","key":"journals/orgsci/Reagans11","doi":"10.1287/ORSC.1100.0587","ee":"https://doi.org/10.1287/orsc.1100.0587","url":"https://dblp.org/rec/journals/orgsci/Reagans11"}, "url":"URL#4598276" }, { "@score":"2", "@id":"5039088", "info":{"authors":{"author":[{"@pid":"70/1434","text":"Amir Epstein"},{"@pid":"43/1464","text":"Michal Feldman"},{"@pid":"m/YishayMansour","text":"Yishay Mansour"}]},"title":"Strong equilibrium in cost sharing connection games.","venue":"Games Econ. Behav.","volume":"67","number":"1","pages":"51-68","year":"2009","type":"Journal Articles","access":"closed","key":"journals/geb/EpsteinFM09","doi":"10.1016/J.GEB.2008.07.002","ee":"https://doi.org/10.1016/j.geb.2008.07.002","url":"https://dblp.org/rec/journals/geb/EpsteinFM09"}, "url":"URL#5039088" }, { "@score":"2", "@id":"5152406", "info":{"authors":{"author":{"@pid":"m/StanMatwin","text":"Stan Matwin"}},"title":"Image Analysis and Machine Learning: How to Foster a Stronger Connection?","venue":"ICIAP","pages":"5","year":"2009","type":"Conference and Workshop Papers","access":"open","key":"conf/iciap/Matwin09","doi":"10.1007/978-3-642-04146-4_2","ee":"https://doi.org/10.1007/978-3-642-04146-4_2","url":"https://dblp.org/rec/conf/iciap/Matwin09"}, "url":"URL#5152406" }, { "@score":"2", "@id":"5238033", "info":{"authors":{"author":[{"@pid":"11/5922","text":"Edwin J. Beggs"},{"@pid":"91/2370","text":"Tomasz Brzezinski"}]},"title":"An Explicit Formula for a Strong Connection.","venue":"Appl. Categorical Struct.","volume":"16","number":"1-2","pages":"57-63","year":"2008","type":"Journal Articles","access":"closed","key":"journals/acs/BeggsB08","doi":"10.1007/S10485-007-9087-2","ee":"https://doi.org/10.1007/s10485-007-9087-2","url":"https://dblp.org/rec/journals/acs/BeggsB08"}, "url":"URL#5238033" }, { "@score":"2", "@id":"5269392", "info":{"authors":{"author":[{"@pid":"21/2317","text":"Ghassen Ben Brahim"},{"@pid":"71/2824-2","text":"Bilal Khan 0002"},{"@pid":"22/2131","text":"Ala I. Al-Fuqaha"},{"@pid":"15/1123","text":"Mohsen Guizani"}]},"title":"Weak many vs. strong few: reducing BER through packet duplication in power-budgeted wireless connections.","venue":"Int. J. Sens. Networks","volume":"4","number":"3","pages":"145-154","year":"2008","type":"Journal Articles","access":"closed","key":"journals/ijsnet/BrahimKAG08","doi":"10.1504/IJSNET.2008.022108","ee":"https://doi.org/10.1504/IJSNET.2008.022108","url":"https://dblp.org/rec/journals/ijsnet/BrahimKAG08"}, "url":"URL#5269392" }, { "@score":"2", "@id":"5309765", "info":{"authors":{"author":[{"@pid":"58/4543","text":"Li Ding"},{"@pid":"07/4853","text":"Brandon Dixon"}]},"title":"Using an edge-dual graph and k-connectivity to identify strong connections in social networks.","venue":"ACM Southeast Regional Conference","pages":"475-480","year":"2008","type":"Conference and Workshop Papers","access":"closed","key":"conf/ACMse/DingD08","doi":"10.1145/1593105.1593230","ee":"https://doi.org/10.1145/1593105.1593230","url":"https://dblp.org/rec/conf/ACMse/DingD08"}, "url":"URL#5309765" }, { "@score":"2", "@id":"5456449", "info":{"authors":{"author":{"@pid":"75/6861","text":"Jonathan David Farley"}},"title":"A structure theorem for posets admitting a "strong" chain partition: : A generalization of a conjecture of Daykin and Daykin (with connections to probability correlation inequalities).","venue":"Discret. Math.","volume":"307","number":"2","pages":"191-198","year":"2007","type":"Journal Articles","access":"open","key":"journals/dm/Farley07","doi":"10.1016/J.DISC.2005.01.012","ee":"https://doi.org/10.1016/j.disc.2005.01.012","url":"https://dblp.org/rec/journals/dm/Farley07"}, "url":"URL#5456449" }, { "@score":"2", "@id":"5604247", "info":{"authors":{"author":[{"@pid":"70/1434","text":"Amir Epstein"},{"@pid":"43/1464","text":"Michal Feldman"},{"@pid":"m/YishayMansour","text":"Yishay Mansour"}]},"title":"Strong equilibrium in cost sharing connection games.","venue":"EC","pages":"84-92","year":"2007","type":"Conference and Workshop Papers","access":"closed","key":"conf/sigecom/EpsteinFM07","doi":"10.1145/1250910.1250924","ee":"https://doi.org/10.1145/1250910.1250924","url":"https://dblp.org/rec/conf/sigecom/EpsteinFM07"}, "url":"URL#5604247" }, { "@score":"2", "@id":"5680820", "info":{"authors":{"author":{"@pid":"39/4545","text":"Giampiero Salvi"}},"title":"Dynamic behaviour of connectionist speech recognition with strong latency constraints.","venue":"Speech Commun.","volume":"48","number":"7","pages":"802-818","year":"2006","type":"Journal Articles","access":"closed","key":"journals/speech/Salvi06","doi":"10.1016/J.SPECOM.2005.05.005","ee":"https://doi.org/10.1016/j.specom.2005.05.005","url":"https://dblp.org/rec/journals/speech/Salvi06"}, "url":"URL#5680820" }, { "@score":"2", "@id":"6229703", "info":{"authors":{"author":[{"@pid":"s/JorgHSiekmann","text":"Jörg H. Siekmann"},{"@pid":"69/2172","text":"Graham Wrightson"}]},"title":"An Open Research Problem: Strong Completeness of R. Kowalski's Connection Graph Proof Procedure.","venue":"Log. J. IGPL","volume":"10","number":"1","pages":"85-103","year":"2002","type":"Journal Articles","access":"closed","key":"journals/igpl/SiekmannW02","doi":"10.1093/JIGPAL/10.1.85","ee":"https://doi.org/10.1093/jigpal/10.1.85","url":"https://dblp.org/rec/journals/igpl/SiekmannW02"}, "url":"URL#6229703" }, { "@score":"2", "@id":"6259967", "info":{"authors":{"author":[{"@pid":"s/JorgHSiekmann","text":"Jörg H. Siekmann"},{"@pid":"69/2172","text":"Graham Wrightson"}]},"title":"An Open Research Problem: Strong Completeness of R. Kowalski's Connection Graph Proof Procedure.","venue":"Computational Logic - Logic Programming and Beyond","pages":"231-252","year":"2002","type":"Conference and Workshop Papers","access":"closed","key":"conf/birthday/SiekmannW02","doi":"10.1007/3-540-45632-5_10","ee":"https://doi.org/10.1007/3-540-45632-5_10","url":"https://dblp.org/rec/conf/birthday/SiekmannW02"}, "url":"URL#6259967" }, { "@score":"2", "@id":"6283586", "info":{"authors":{"author":[{"@pid":"29/5782","text":"Quan Yuan"},{"@pid":"g/WenGao","text":"Wen Gao 0001"},{"@pid":"y/HongxunYao","text":"Hongxun Yao"},{"@pid":"98/5414","text":"Chunli Wang"}]},"title":"Recognition of Strong and Weak Connection Models in Continuous Sign Language.","venue":"ICPR","pages":"75-78","year":"2002","type":"Conference and Workshop Papers","access":"closed","key":"conf/icpr/YuanGYW02","doi":"10.1109/ICPR.2002.1044616","ee":"https://doi.org/10.1109/ICPR.2002.1044616","url":"https://dblp.org/rec/conf/icpr/YuanGYW02"}, "url":"URL#6283586" }, { "@score":"2", "@id":"6285661", "info":{"authors":{"author":{"@pid":"54/1681","text":"Vasile Postolica"}},"title":"General connection between strong optimization and Pareto efficiency.","venue":"Analysis and Optimization of Differential Systems","pages":"315-320","year":"2002","type":"Conference and Workshop Papers","access":"unavailable","key":"conf/ifip7-2/Postolica02","url":"https://dblp.org/rec/conf/ifip7-2/Postolica02"}, "url":"URL#6285661" }, { "@score":"2", "@id":"6330448", "info":{"authors":{"author":[{"@pid":"s/JorgHSiekmann","text":"Jörg H. Siekmann"},{"@pid":"69/2172","text":"Graham Wrightson"}]},"title":"Erratum: a counterexample to W. Bibel's and E. Eder's strong completeness result for connection graph resolution.","venue":"J. ACM","volume":"48","number":"1","pages":"145-147","year":"2001","type":"Journal Articles","access":"closed","key":"journals/jacm/SiekmannW01","doi":"10.1145/363647.363697","ee":"https://doi.org/10.1145/363647.363697","url":"https://dblp.org/rec/journals/jacm/SiekmannW01"}, "url":"URL#6330448" }, { "@score":"2", "@id":"6629301", "info":{"authors":{"author":[{"@pid":"b/WBibel","text":"Wolfgang Bibel"},{"@pid":"40/3840","text":"Elmar Eder"}]},"title":"Decomposition of tautologies into regular formulas and strong completeness of connection-graph resolution.","venue":"J. ACM","volume":"44","number":"2","pages":"320-344","year":"1997","type":"Journal Articles","access":"closed","key":"journals/jacm/BibelE97","doi":"10.1145/256303.256313","ee":"https://doi.org/10.1145/256303.256313","url":"https://dblp.org/rec/journals/jacm/BibelE97"}, "url":"URL#6629301" }, { "@score":"2", "@id":"6633611", "info":{"authors":{"author":[{"@pid":"h/RobertFHadley","text":"Robert F. Hadley"},{"@pid":"136/4155","text":"Michael B. Hayward"}]},"title":"Strong Semantic Systematicity from Hebbian Connectionist Learning.","venue":"Minds Mach.","volume":"7","number":"1","pages":"1-37","year":"1997","type":"Journal Articles","access":"closed","key":"journals/mima/HadleyH97","doi":"10.1023/A:1008252408222","ee":"https://doi.org/10.1023/A:1008252408222","url":"https://dblp.org/rec/journals/mima/HadleyH97"}, "url":"URL#6633611" }, { "@score":"2", "@id":"6717854", "info":{"authors":{"author":[{"@pid":"64/2829","text":"Stefano Borgo"},{"@pid":"65/6778","text":"Nicola Guarino"},{"@pid":"67/3614","text":"Claudio Masolo"}]},"title":"A Pointless Theory of Space Based on Strong Connection and Congruence.","venue":"KR","pages":"220-229","year":"1996","type":"Conference and Workshop Papers","access":"unavailable","key":"conf/kr/Borgo96","url":"https://dblp.org/rec/conf/kr/Borgo96"}, "url":"URL#6717854" }, { "@score":"2", "@id":"6737359", "info":{"authors":{"author":{"@pid":"25/6109","text":"James W. Fickett"}},"title":"ORFs and Genes: How Strong a Connection?","venue":"J. Comput. Biol.","volume":"2","number":"1","pages":"117-123","year":"1995","type":"Journal Articles","access":"closed","key":"journals/jcb/Fickett95","doi":"10.1089/CMB.1995.2.117","ee":"https://doi.org/10.1089/cmb.1995.2.117","url":"https://dblp.org/rec/journals/jcb/Fickett95"}, "url":"URL#6737359" } ] } } } )