Sciweavers

2880 search results - page 82 / 576
» Approximate Range Searching
Sort
View
CCCG
2006
15 years 8 months ago
K-Nearest Neighbor Search using the Pyramid Technique
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...
Bradford G. Nickerson, Qingxiu Shi
CISS
2008
IEEE
16 years 1 months ago
Memory-constrained ML-optimal tree search detection
— 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...
Yongmei Dai, Zhiyuan Yan
ICC
2007
IEEE
116views Communications» more  ICC 2007»
16 years 28 days ago
Skip Tree Graph: a Distributed and Balanced Search Tree for Peer-to-Peer Networks
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...
Alejandra González Beltrán, Paul Sag...
GLOBECOM
2006
IEEE
16 years 20 days ago
Pessimism Is Mostly the Best for the Expanding Ring Search in Wireless Networks
— 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...
Kui Wu, Hong-Chuan Yang, Fulu Li
NIPS
2007
15 years 8 months ago
Theoretical Analysis of Heuristic Search Methods for Online POMDPs
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
Stéphane Ross, Joelle Pineau, Brahim Chaib-...