A k-nearest neighbor search algorithm for the Pyramid technique is presented. The Pyramid technique divides d-dimensional data space into 2d pyramids. Given a query point q, we in...
— In this paper, we propose a memory-constrained tree search (MCTS) algorithm for the detection in multiple-input multiple-output (MIMO) systems. The MCTS algorithm offers a wide...
Abstract—Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It...
— Global flooding and expanding ring search are two commonly used methods in search for an interested object in multi-hop wireless networks. While global flooding is simple, it...
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...