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
Locality-Sensitive Hashing Scheme based on Longest Circular..:
, In:
Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data
,
Lei, Yifan
;
Huang, Qiang
;
Kankanhalli, Mohan
. - p. 2589-2599 , 2020
Link:
https://dl.acm.org/doi/10.1145/3318464.3389778
RT T1 <cTitle>Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data</cTitle>: T1 <Title>Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring</Title> UL https://suche.suub.uni-bremen.de/peid=acm-3389778&Exemplar=1&LAN=DE A1 Lei, Yifan A1 Huang, Qiang A1 Kankanhalli, Mohan A1 Tung, Anthony K. H. PB ACM YR 2020 K1 angular distance K1 euclidean distance K1 locality-sensitive hashing K1 nearest neighbor search K1 suffix tree K1 Information systems K1 Information systems applications K1 Data mining K1 Nearest-neighbor search K1 Theory of computation K1 Design and analysis of algorithms K1 Streaming, sublinear and near linear time algorithms K1 Nearest neighbor algorithms K1 Bloom filters and hashing SP 2589 OP 2599 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3318464.3389778 DO https://dl.acm.org/doi/10.1145/3318464.3389778 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
