Sciweavers

3514 search results - page 61 / 703
» A search space
Sort
View
CVPR
2012
IEEE
11 years 11 months ago
A fast nearest neighbor search algorithm by nonlinear embedding
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...
Yoonho Hwang, Bohyung Han, Hee-Kap Ahn
AAAI
2008
13 years 11 months ago
Minimizing Disk I/O in Two-Bit Breadth-First Search
We present a breadth-first search algorithm, two-bit breadthfirst search (TBBFS), which requires only two bits for each state in the problem space. TBBFS can be parallelized in se...
Richard E. Korf
HPDC
2003
IEEE
14 years 2 months ago
XenoSearch: Distributed Resource Discovery in the XenoServer Open Platform
We describe the XenoSearch system for performing expressive resource discovery searches in a distributed environment. We represent server meta-data, such as their locations and fa...
David Spence, Tim Harris
SSDBM
2009
IEEE
149views Database» more  SSDBM 2009»
14 years 3 months ago
Reverse k-Nearest Neighbor Search Based on Aggregate Point Access Methods
Abstract. We propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem in Euclidean spaces. Compared to the limitations of existing methods for ...
Hans-Peter Kriegel, Peer Kröger, Matthias Ren...
GLOBECOM
2008
IEEE
14 years 3 months ago
Reduced Complexity ML Detection for Differential Unitary Space-Time Modulation with Carrier Frequency Offset
— Recently, a maximum likelihood (ML) detection rule for differential unitary space time modulation (DUSTM) under the existence of unknown carrier frequency offset (CFO) has been...
Feifei Gao, Arumugam Nallanathan, Chintha Tellambu...