Spatial search algorithms on Hanoi networks
نویسندگان
چکیده
منابع مشابه
Diversified Spatial Keyword Search On Road Networks
With the increasing pervasiveness of the geo-positioning technologies, there is an enormous amount of spatio-textual objects available in many applications such as location based services and social networks. Consequently, various types of spatial keyword searches which explore both locations and textual descriptions of the objects have been intensively studied by the research communities and c...
متن کاملAnomalous diffusion on the Hanoi networks
Diffusion is modeled on the recently proposed Hanoi networks by studying the mean-square displacement of random walks with time, 〈r2〉 ∼ tw . It is found that diffusion —the quintessential mode of transport throughout Nature— proceeds faster than ordinary, in one case with an exact, anomalous exponent dw = 2− log2(φ) = 1.30576 . . . . It is an instance of a physical exponent containing the “gold...
متن کاملSearch algorithms for multiway spatial joins
This papers deals with multiway spatial joins when (i) there is limited time for query processing and the goal is to retrieve the best possible solutions within this limit (ii) there is unlimited time and the goal is to retrieve a single exact solution, if such a solution exists, or the best approximate one otherwise. The first case is motivated by the high cost of join processing in real-time ...
متن کاملAlgorithms and Bounds for Tower of Hanoi Problems on Graphs
The classic Tower of Hanoi puzzle was marketed by Edouard Lucas in 1883 under the name ”Tower of Hanoi” [31]. There, n disks are due to be moved from one peg to another, using an auxiliary peg while never placing a bigger disk above a smaller one. Its optimal solution is classic in Computer Science. In this thesis, we study a generalization of the original puzzle. The problem is generalized by ...
متن کاملScalable Trajectory Similarity Search Based on Locations in Spatial Networks
In this paper, we propose an efficient query processing algorithm that returns the trajectory results in low search time. We limit the calculation of pairwise shortest path distances between the set of query locations and the spatial nodes, by highly reducing the preprocessing requirements. Also, we introduce a spatiotemporal similarity measure, based on which the temporal-to-spatial significan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2013
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.87.012329