On-line Search in Two-Dimensional Environment
نویسندگان
چکیده
منابع مشابه
Binary Search on Two-Dimensional Data
We consider the problem of searching for the predecessor (largest element that is smaller than some key) among elements that are organized as a matrix such that every row and every column is weakly monotonic (sorted matrix). The results are matching upper and lower bounds for the number of accesses to the matrix and comparisons with the key.
متن کاملEffective Design of a 3×4 Two Dimensional Distributed Amplifier Based on Gate Line Considerations
In this paper two dimensional wave propagation is used for power combining in drain nodes of a distributed amplifier (DA). The proposed two dimensional DA uses an electrical funnel to add the currents of drain nodes. The proposed structure is modified due to gate lines considerations. Total gain improvement is achieved by engineering the characteristic impedance of gate lines and also make appr...
متن کاملOn two-dimensional Cayley graphs
A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....
متن کاملMulti-Dimensional Prefix Matching Using Line Search
With the increasing popularity of firewalls, virtual private networks (VPNs) and Quality of Service (QoS) routing, packet classification becomes increasingly important in the Internet. The high-performance solutions known so far strongly rely on certain properties of the filter database to match against, such as a small number of distinct prefixes or the absence of conflicts. In this paper, we ...
متن کاملTowards two-dimensional search engines
We study the statistical properties of various directed networks using ranking of their nodes based on the dominant vectors of the Google matrix known as PageRank and CheiRank. On average PageRank orders nodes proportionally to a number of ingoing links, while CheiRank orders nodes proportionally to a number of outgoing links. In this way the ranking of nodes becomes two-dimensional that paves ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2019
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-019-09948-6