FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2144399314> ?p ?o ?g. }

• W2144399314 endingPage "51" @default.
• W2144399314 startingPage "19" @default.
• W2144399314 abstract "The following two computational problems are studied: Duplicate grouping:Assume thatnitems are given, each of which is labeled by an integer key from the set {0,…,U − 1}. Store the items in an array of sizensuch that items with the same key occupy a contiguous segment of the array. Closest pair:Assume that a multiset ofnpoints in thed-dimensional Euclidean space is given, whered ≥ 1 is a fixed integer. Each point is represented as ad-tuple of integers in the range {0,…,U − 1} (or of arbitrary real numbers). Find a closest pair, i.e., a pair of points whose distance is minimal over all such pairs. In 1976, Rabin described a randomized algorithm for the closest-pair problem that takes linear expected time. As a subroutine, he used a hashing procedure whose implementation was left open. Only years later randomized hashing schemes suitable for filling this gap were developed. In this paper, we return to Rabin's classic algorithm to provide a fully detailed description and analysis, thereby also extending and strengthening his result. As a preliminary step, we study randomized algorithms for the duplicate-grouping problem. In the course of solving the duplicate-grouping problem, we describe a new universal class of hash functions of independent interest. It is shown that both of the foregoing problems can be solved by randomized algorithms that useO(n) space and finish inO(n) time with probability tending to 1 asngrows to infinity. The model of computation is a unit-cost RAM capable of generating random numbers and of performing arithmetic operations from the set {+, −, ∗, div, log2, exp2}, wheredivdenotes integer division andlog2andexp2are the mappings from N to N ∪ {0} withlog2(m) = ⌊log2m⌋ andexp2(m) = 2mfor allm ∈ N. If the operationslog2andexp2are not available, the running time of the algorithms increases by an additive term ofO(log log U). All numbers manipulated by the algorithms consist ofO(log n + log U) bits. The algorithms for both of the problems exceed the time boundO(n) orO(n + log log U) with probability 2−nΩ(1). Variants of the algorithms are also given that use onlyO(log n + log U) random bits and have probabilityO(n−α) of exceeding the time bounds, where α ≥ 1 is a constant that can be chosen arbitrarily. The algorithms for the closest-pair problem also works if the coordinates of the points are arbitrary real numbers, provided that the RAM is able to perform arithmetic operations from {+, −, ∗, div} on real numbers, wherea div bnow means ⌊a/b⌋. In this case, the running time isO(n) withlog2andexp2andO(n + log log(δmax/δmax)) without them, where δmaxis the maximum and δminis the minimum distance between any two distinct input points." @default.
• W2144399314 created "2016-06-24" @default.
• W2144399314 creator A5035432808 @default.
• W2144399314 creator A5037788421 @default.
• W2144399314 creator A5059236728 @default.
• W2144399314 creator A5067257613 @default.
• W2144399314 date "1997-10-01" @default.
• W2144399314 modified "2023-09-27" @default.
• W2144399314 title "A Reliable Randomized Algorithm for the Closest-Pair Problem" @default.
• W2144399314 cites W1981335015 @default.
• W2144399314 cites W1985361644 @default.
• W2144399314 cites W1998777945 @default.
• W2144399314 cites W2004315837 @default.
• W2144399314 cites W2012857639 @default.
• W2144399314 cites W2019038806 @default.
• W2144399314 cites W2034144081 @default.
• W2144399314 cites W2044599026 @default.
• W2144399314 cites W2052207834 @default.
• W2144399314 cites W2054788982 @default.
• W2144399314 cites W2058177464 @default.
• W2144399314 cites W2059985428 @default.
• W2144399314 cites W2070029754 @default.
• W2144399314 cites W2077229436 @default.
• W2144399314 cites W2084300309 @default.
• W2144399314 cites W2108741984 @default.
• W2144399314 cites W2150518053 @default.
• W2144399314 cites W2165621523 @default.
• W2144399314 cites W2167592280 @default.
• W2144399314 cites W2569696182 @default.
• W2144399314 doi "https://doi.org/10.1006/jagm.1997.0873" @default.
• W2144399314 hasPublicationYear "1997" @default.
• W2144399314 type Work @default.
• W2144399314 sameAs 2144399314 @default.
• W2144399314 citedByCount "178" @default.
• W2144399314 countsByYear W21443993142012 @default.
• W2144399314 countsByYear W21443993142013 @default.
• W2144399314 countsByYear W21443993142014 @default.
• W2144399314 countsByYear W21443993142015 @default.
• W2144399314 countsByYear W21443993142016 @default.
• W2144399314 countsByYear W21443993142017 @default.
• W2144399314 countsByYear W21443993142018 @default.
• W2144399314 countsByYear W21443993142019 @default.
• W2144399314 countsByYear W21443993142020 @default.
• W2144399314 countsByYear W21443993142021 @default.
• W2144399314 countsByYear W21443993142022 @default.
• W2144399314 countsByYear W21443993142023 @default.
• W2144399314 crossrefType "journal-article" @default.
• W2144399314 hasAuthorship W2144399314A5035432808 @default.
• W2144399314 hasAuthorship W2144399314A5037788421 @default.
• W2144399314 hasAuthorship W2144399314A5059236728 @default.
• W2144399314 hasAuthorship W2144399314A5067257613 @default.
• W2144399314 hasConcept C11413529 @default.
• W2144399314 hasConcept C114614502 @default.
• W2144399314 hasConcept C118615104 @default.
• W2144399314 hasConcept C128669082 @default.
• W2144399314 hasConcept C13533509 @default.
• W2144399314 hasConcept C178489894 @default.
• W2144399314 hasConcept C199360897 @default.
• W2144399314 hasConcept C2779623528 @default.
• W2144399314 hasConcept C33923547 @default.
• W2144399314 hasConcept C38652104 @default.
• W2144399314 hasConcept C41008148 @default.
• W2144399314 hasConcept C7608002 @default.
• W2144399314 hasConcept C87431388 @default.
• W2144399314 hasConcept C97137487 @default.
• W2144399314 hasConcept C99138194 @default.
• W2144399314 hasConceptScore W2144399314C11413529 @default.
• W2144399314 hasConceptScore W2144399314C114614502 @default.
• W2144399314 hasConceptScore W2144399314C118615104 @default.
• W2144399314 hasConceptScore W2144399314C128669082 @default.
• W2144399314 hasConceptScore W2144399314C13533509 @default.
• W2144399314 hasConceptScore W2144399314C178489894 @default.
• W2144399314 hasConceptScore W2144399314C199360897 @default.
• W2144399314 hasConceptScore W2144399314C2779623528 @default.
• W2144399314 hasConceptScore W2144399314C33923547 @default.
• W2144399314 hasConceptScore W2144399314C38652104 @default.
• W2144399314 hasConceptScore W2144399314C41008148 @default.
• W2144399314 hasConceptScore W2144399314C7608002 @default.
• W2144399314 hasConceptScore W2144399314C87431388 @default.
• W2144399314 hasConceptScore W2144399314C97137487 @default.
• W2144399314 hasConceptScore W2144399314C99138194 @default.
• W2144399314 hasIssue "1" @default.
• W2144399314 hasLocation W21443993141 @default.
• W2144399314 hasOpenAccess W2144399314 @default.
• W2144399314 hasPrimaryLocation W21443993141 @default.
• W2144399314 hasRelatedWork W1552026372 @default.
• W2144399314 hasRelatedWork W1562315931 @default.
• W2144399314 hasRelatedWork W1996177881 @default.
• W2144399314 hasRelatedWork W2049291540 @default.
• W2144399314 hasRelatedWork W2067720770 @default.
• W2144399314 hasRelatedWork W2071179368 @default.
• W2144399314 hasRelatedWork W2329993381 @default.
• W2144399314 hasRelatedWork W2885144874 @default.
• W2144399314 hasRelatedWork W3124533842 @default.
• W2144399314 hasRelatedWork W4303875876 @default.
• W2144399314 hasVolume "25" @default.
• W2144399314 isParatext "false" @default.
• W2144399314 isRetracted "false" @default.

• next