Sciweavers

184 search results - page 31 / 37
» Near Neighbor Search in Large Metric Spaces
Sort
View
ICC
2009
IEEE
130views Communications» more  ICC 2009»
14 years 5 months ago
A New Reduced Complexity ML Detection Scheme for MIMO Systems
Abstract— For multiple-input multiple-output (MIMO) systems, the optimum maximum likelihood (ML) detection requires tremendous complexity as the number of antennas or modulation ...
Jin-Sung Kim, Sung Hyun Moon, Inkyu Lee
ICML
2004
IEEE
14 years 11 months ago
Learning to fly by combining reinforcement learning with behavioural cloning
Reinforcement learning deals with learning optimal or near optimal policies while interacting with the environment. Application domains with many continuous variables are difficul...
Eduardo F. Morales, Claude Sammut
COMAD
2009
13 years 12 months ago
Graph Clustering for Keyword Search
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
Rose Catherine K., S. Sudarshan
GECCO
2005
Springer
143views Optimization» more  GECCO 2005»
14 years 4 months ago
Advanced models of cellular genetic algorithms evaluated on SAT
Cellular genetic algorithms (cGAs) are mainly characterized by their spatially decentralized population, in which individuals can only interact with their neighbors. In this work,...
Enrique Alba, Hugo Alfonso, Bernabé Dorrons...
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
14 years 11 months ago
Locality sensitive hash functions based on concomitant rank order statistics
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
Kave Eshghi, Shyamsundar Rajaram