Titlebook: Similarity Search and Applications; 11th International C Stéphane Marchand-Maillet,Yasin N. Silva,Edgar Chá Conference proceedings 2018 Spr

只看該作者 · 發(fā)表于 2025-3-25 18:20:11

Scalability of the NV-tree: Three Experimentss of up?to 28.5 billion features, representing the largest single-server collection ever reported in the literature. The results show that indeed the NV-tree performs very well for visual instance search applications over large-scale collections.

只看該作者 · 發(fā)表于 2025-3-25 21:42:54

Transactional Support for Visual Instance Searchransactions which ensure both dynamicity and durability. We present a detailed performance evaluation of the transactional NV-tree, showing that the insertion throughput is excellent despite the effort to enforce the ACID properties.

只看該作者 · 發(fā)表于 2025-3-26 02:11:21

只看該作者 · 發(fā)表于 2025-3-26 07:33:47

只看該作者 · 發(fā)表于 2025-3-26 09:07:55

只看該作者 · 發(fā)表于 2025-3-26 13:34:24

只看該作者 · 發(fā)表于 2025-3-26 20:38:13

		自動(dòng)登錄	找回密碼
密碼			To register

關(guān)于派博傳思			派博傳思旗下網(wǎng)站			友情鏈接
派博傳思介紹	公司地理位置	論文服務(wù)流程	影響因子官網(wǎng)	吾愛論文網(wǎng)	大講堂	北京大學(xué)	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點(diǎn)評(píng)	投稿經(jīng)驗(yàn)總結(jié)	SCIENCEGARD	IMPACTFACTOR	派博系數(shù)	清華大學(xué)	Yale Uni.	Stanford Uni.
\|Archiver\|手機(jī)版\|小黑屋\| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-8 18:54
Copyright © 2001-2015 派博傳思京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved