نتایج جستجو برای: hits

تعداد نتایج: 7389  

Journal: :Web Intelligence and Agent Systems 2010
Bui Quang Hung Masanori Otsubo Yoshinori Hijikata Shogo Nishida

Kleinberg’s Hypertext-Induced Topic Selection (HITS) algorithm is a popular and effective algorithm to rank web pages. One of its problems is the topic drift problem. Previous researches have tried to solve this problem using anchor-related text. In this paper, we investigate the effectiveness of using Semantic Text Portion for improving the HITS algorithm. In detail, we examine the degree to w...

2007
Toby Johnson

It is common to use reciprocal best hits, also known as a boomerang criterion, for determining orthology between sequences. The best hits may be found by blast, or by other more recently developed algorithms. Previous work seems to have assumed that reciprocal best hits is a sufficient but not necessary condition for orthology. In this article, I explain why reciprocal best hits cannot logicall...

2010
Saul Drajer MDRichard E. Kerber

Search strategy (including electronic databases searched). DRAJER: Several search strategies were used for each data base. Only those with maximal hits were considered Embase “defibrillation” AND “pads” AND “impedance” as text words (all fields): 31 hits Embase “defibrillation” AND “pads” AND [<1966-2010]/py: 85 hits PubMed “defibrillation” AND “electrode pads” as text words (all fields): 52 hi...

Journal: :Stroke 1998
A Jacobs M Neveling M Horst M Ghaemi J Kessler H Eichstaedt J Rudolf P Model H Bönner E R de Vivie W D Heiss

BACKGROUND AND PURPOSE High-intensity transient signals (HITS) during cardiac surgery are capable of causing encephalopathy and cognitive deficits. This study was undertaken to determine whether intraoperative HITS cause alterations of neuropsychological function (NPF) and/or cerebral glucose metabolism (CMRGlc), even in a low-risk patient group, and whether induced changes are interrelated. ...

Journal: :JNW 2013
Zhaoyan Jin Dian-xi Shi Quanyuan Wu Hua Fan

Hyperlink Induced Topic Search (HITS) is the most authoritative and most widely used personalized ranking algorithm on networks. The HITS algorithm ranks nodes on networks according to power iteration, and has high complexity of computation. This paper models the HITS algorithm with the Monte Carlo method, and proposes Monte Carlo based algorithms for the HITS computation. Theoretical analysis ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید