I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
Filtered-DiskANN: Graph Algorithms for Approximate Nearest ..:
, In:
Proceedings of the ACM Web Conference 2023
,
Gollapudi, Siddharth
;
Karia, Neel
;
Sivashankar, Varun
... - p. 3406-3416 , 2023
Link:
https://dl.acm.org/doi/10.1145/3543507.3583552
RT T1
Proceedings of the ACM Web Conference 2023
: T1
Filtered-DiskANN: Graph Algorithms for Approximate Nearest Neighbor Search with Filters
UL https://suche.suub.uni-bremen.de/peid=acm-3583552&Exemplar=1&LAN=DE A1 Gollapudi, Siddharth A1 Karia, Neel A1 Sivashankar, Varun A1 Krishnaswamy, Ravishankar A1 Begwani, Nikit A1 Raz, Swapnil A1 Lin, Yiyong A1 Zhang, Yin A1 Mahapatro, Neelam A1 Srinivasan, Premkumar A1 Singh, Amit A1 Simhadri, Harsha Vardhan PB ACM YR 2023 K1 Approximate nearest neighbor search K1 Dense retrieval K1 Filtered Search K1 Graph algorithms K1 Vector Search K1 Theory of computation K1 Design and analysis of algorithms K1 Streaming, sublinear and near linear time algorithms K1 Nearest neighbor algorithms K1 Information systems K1 World Wide Web K1 Web searching and information discovery SP 3406 OP 3416 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3543507.3583552 DO https://dl.acm.org/doi/10.1145/3543507.3583552 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)