인공고관절의 세라믹 볼 헤드의 기계적 안정성 평가를 위한 3 차원 유한요소 해석
Citations
2,258 citations
2,023 citations
Cites background from "인공고관절의 세라믹 볼 헤드의 기계적 안정성 평가를 위한 3 차..."
...LSH typically requires 100–500 bytes per descriptor to index, which is not tractable, as a one million image dataset typically produces up to 2 billion local descriptors....
[...]
...It compares favorably in terms of memory usage against other approximate nearest neighbor search algorithms, such as the popular Euclidean locality sensitive hashing (LSH) [7, 8]....
[...]
...Note that this significantly different from the Euclidean version of LSH (E2LSH) [7, 8], which produces several hash keys per descriptor....
[...]
...For instance, with 20 hash functions the memory usage of LSH [7] is of 160 bytes per descriptors compared to about 4 bytes for BOF....
[...]
1,034 citations
950 citations
Cites background from "인공고관절의 세라믹 볼 헤드의 기계적 안정성 평가를 위한 3 차..."
..., [18] for the most recent work), none of these studies seems to have focused on generating and studying breather solutions with complete growth-decay cycles....
[...]
553 citations
Cites background or methods from "인공고관절의 세라믹 볼 헤드의 기계적 안정성 평가를 위한 3 차..."
...For simplicity, we shall estimate LHeC performance in e-Pb collisions with the design performance values of the ion injector chain as described in [659] and the assumption of a single nuclear beam in one ring of the LHC with parameters as recalled from [660] in Table 6....
[...]
...This conserves the dimensions of EPA and gives full flexibility to place the bunches into the LHeC electron ring as required to collide with the proton or ion bunches [659,660]....
[...]
References
2,258 citations
2,023 citations
1,034 citations
950 citations
677 citations