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
Quasi-Valid range querying and its implications for nearest..:
, In:
Proceedings of the fourth annual symposium on Computational geometry
,
Willard, D. E.
;
Wee, Y. C.
- p. 34-43 , 1988
Link:
https://dl.acm.org/doi/10.1145/73393.73398
RT T1
Proceedings of the fourth annual symposium on Computational geometry
: T1
Quasi-Valid range querying and its implications for nearest neighbor problems
UL https://suche.suub.uni-bremen.de/peid=acm-73398&Exemplar=1&LAN=DE A1 Willard, D. E. A1 Wee, Y. C. PB ACM YR 1988 K1 Theory of computation K1 Randomness, geometry and discrete structures K1 Computational geometry K1 Computing methodologies K1 Artificial intelligence K1 Search methodologies K1 Information systems K1 Information retrieval K1 Information retrieval query processing K1 Mathematics of computing K1 Discrete mathematics K1 Graph theory K1 Trees K1 Software and its engineering K1 Software organization and properties K1 Software functional properties K1 Formal methods K1 Computational complexity and cryptography K1 Complexity classes K1 Information storage systems K1 Record storage systems K1 Directory structures K1 B-trees K1 Software creation and management K1 Software verification and validation K1 Empirical software validation K1 Game tree search K1 Discrete space search K1 Combinatorics K1 Combinatorial algorithms SP 34 OP 43 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/73393.73398 DO https://dl.acm.org/doi/10.1145/73393.73398 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)