Matches in SemOpenAlex for { <https://semopenalex.org/work/W2106260429> ?p ?o ?g. }
- W2106260429 abstract "The main contribution of this work is to show that a number of fundamental and seemingly unrelated problems in database design, pattern recognition, robotics, computational geometry, and image processing can be solved simply and elegantly by stating them as instances of a unifying algorithmic framework that we call the multiple query problem. The multiple query problem (MQ, for short) is a 5-tuple (Q, A, D, /spl phi/, /spl oplus/), where Q is a set of queries, A is a set of items, D is a set of solutions, /spl phi/: Q/spl times/A/spl rarr/D is a function, and /spl oplus/ is a commutative and associative binary operator over D. The input to the MQ problem consists of a sequence Q= of m queries from Q and of a sequence A= of n items from A. The goal is to compute, for every query q/sub i/ (1/spl les/i/spl les/m) its solution defined as /spl phi/(q/sub i/,A)=/spl phi/(q/sub i/,a/sub 1/)/spl oplus//spl phi/(q/sub i/,a/sub 2/)/spl oplus//spl middot//spl middot//spl middot//spl oplus//spl phi/(q/sub i/,a/sub n/). We begin by discussing a generic algorithm that solves a large class of MQ problems in O(/spl radic/m+f(n)) time on a reconfigurable mesh of size /spl radic/n/spl times//spl radic/n, where f(n) is the time necessary to compute the expression d/sub 1/ /spl oplus/ d/sub 2/ /spl oplus//spl middot//spl middot//spl middot//spl oplus/ d/sub n/ with d/sub i/ /spl isin/ D on such a platform. We then go on to show that the MQ framework affords us an optimal algorithm for the multiple point location problem on a reconfigurable mesh of size /spl radic/n/spl times//spl radic/n. Given a set A of n points and a set Q of m (m/spl les/n) points in the plane, our algorithm reports, in O(/spl radic/m+log log n) time, all points of Q that lie inside the convex hull of A. Quite surprisingly, our algorithm solves the multiple point location problem without computing the convex hull of A which, in itself, takes /spl Omega/(/spl radic/n) time on a reconfigurable mesh of size /spl radic/n/spl times//spl radic/n. Finally, we prove an /spl Omega/(/spl radic/m+g(n)) time lower bound for nontrivial MQ problems, where g(n) is the lower bound for evaluating the expression d/sub 1/ /spl oplus/ d/sub 2/ /spl oplus//spl middot//spl middot//spl middot//spl oplus/ d/sub n/ with d/sub i/ /spl isin/ D, on a reconfigurable mesh of size /spl radic/n/spl times//spl radic/n." @default.
- W2106260429 created "2016-06-24" @default.
- W2106260429 creator A5008769497 @default.
- W2106260429 creator A5014693754 @default.
- W2106260429 creator A5036465790 @default.
- W2106260429 creator A5086055038 @default.
- W2106260429 creator A5086528192 @default.
- W2106260429 date "2001-01-01" @default.
- W2106260429 modified "2023-09-23" @default.
- W2106260429 title "Optimal algorithms for the multiple query problem on reconfigurable meshes, with applications" @default.
- W2106260429 cites W1481286537 @default.
- W2106260429 cites W1490482062 @default.
- W2106260429 cites W1601329353 @default.
- W2106260429 cites W1987488939 @default.
- W2106260429 cites W2005314985 @default.
- W2106260429 cites W2026497097 @default.
- W2106260429 cites W2056156249 @default.
- W2106260429 cites W2066104460 @default.
- W2106260429 cites W2071261222 @default.
- W2106260429 cites W2074992428 @default.
- W2106260429 cites W2103154261 @default.
- W2106260429 cites W2105354870 @default.
- W2106260429 cites W2107894021 @default.
- W2106260429 cites W2148176991 @default.
- W2106260429 cites W2150500908 @default.
- W2106260429 cites W2153057609 @default.
- W2106260429 cites W2155595395 @default.
- W2106260429 cites W2160047101 @default.
- W2106260429 cites W2162816006 @default.
- W2106260429 cites W2164741953 @default.
- W2106260429 cites W2740373864 @default.
- W2106260429 cites W3017143921 @default.
- W2106260429 cites W3138391603 @default.
- W2106260429 doi "https://doi.org/10.1109/71.954618" @default.
- W2106260429 hasPublicationYear "2001" @default.
- W2106260429 type Work @default.
- W2106260429 sameAs 2106260429 @default.
- W2106260429 citedByCount "4" @default.
- W2106260429 countsByYear W21062604292020 @default.
- W2106260429 crossrefType "journal-article" @default.
- W2106260429 hasAuthorship W2106260429A5008769497 @default.
- W2106260429 hasAuthorship W2106260429A5014693754 @default.
- W2106260429 hasAuthorship W2106260429A5036465790 @default.
- W2106260429 hasAuthorship W2106260429A5086055038 @default.
- W2106260429 hasAuthorship W2106260429A5086528192 @default.
- W2106260429 hasBestOaLocation W21062604292 @default.
- W2106260429 hasConcept C11413529 @default.
- W2106260429 hasConcept C114614502 @default.
- W2106260429 hasConcept C118615104 @default.
- W2106260429 hasConcept C118930307 @default.
- W2106260429 hasConcept C14036430 @default.
- W2106260429 hasConcept C177264268 @default.
- W2106260429 hasConcept C183778304 @default.
- W2106260429 hasConcept C199360897 @default.
- W2106260429 hasConcept C2778112365 @default.
- W2106260429 hasConcept C33923547 @default.
- W2106260429 hasConcept C41008148 @default.
- W2106260429 hasConcept C48372109 @default.
- W2106260429 hasConcept C54355233 @default.
- W2106260429 hasConcept C78458016 @default.
- W2106260429 hasConcept C86803240 @default.
- W2106260429 hasConcept C94375191 @default.
- W2106260429 hasConceptScore W2106260429C11413529 @default.
- W2106260429 hasConceptScore W2106260429C114614502 @default.
- W2106260429 hasConceptScore W2106260429C118615104 @default.
- W2106260429 hasConceptScore W2106260429C118930307 @default.
- W2106260429 hasConceptScore W2106260429C14036430 @default.
- W2106260429 hasConceptScore W2106260429C177264268 @default.
- W2106260429 hasConceptScore W2106260429C183778304 @default.
- W2106260429 hasConceptScore W2106260429C199360897 @default.
- W2106260429 hasConceptScore W2106260429C2778112365 @default.
- W2106260429 hasConceptScore W2106260429C33923547 @default.
- W2106260429 hasConceptScore W2106260429C41008148 @default.
- W2106260429 hasConceptScore W2106260429C48372109 @default.
- W2106260429 hasConceptScore W2106260429C54355233 @default.
- W2106260429 hasConceptScore W2106260429C78458016 @default.
- W2106260429 hasConceptScore W2106260429C86803240 @default.
- W2106260429 hasConceptScore W2106260429C94375191 @default.
- W2106260429 hasLocation W21062604291 @default.
- W2106260429 hasLocation W21062604292 @default.
- W2106260429 hasOpenAccess W2106260429 @default.
- W2106260429 hasPrimaryLocation W21062604291 @default.
- W2106260429 hasRelatedWork W1511439182 @default.
- W2106260429 hasRelatedWork W1920638964 @default.
- W2106260429 hasRelatedWork W1940706511 @default.
- W2106260429 hasRelatedWork W1941736675 @default.
- W2106260429 hasRelatedWork W1952127226 @default.
- W2106260429 hasRelatedWork W2070539897 @default.
- W2106260429 hasRelatedWork W2104378256 @default.
- W2106260429 hasRelatedWork W2113564592 @default.
- W2106260429 hasRelatedWork W2115789164 @default.
- W2106260429 hasRelatedWork W2124382871 @default.
- W2106260429 hasRelatedWork W2125841965 @default.
- W2106260429 hasRelatedWork W2127819793 @default.
- W2106260429 hasRelatedWork W2134169350 @default.
- W2106260429 hasRelatedWork W2148411689 @default.
- W2106260429 hasRelatedWork W2149001195 @default.
- W2106260429 hasRelatedWork W2149019674 @default.
- W2106260429 hasRelatedWork W2149100736 @default.
- W2106260429 hasRelatedWork W2150936694 @default.