Sciweavers

14 search results - page 2 / 3
» Associative Memories in Infinite Dimensional Spaces
Sort
View
ICRA
2008
IEEE
172views Robotics» more  ICRA 2008»
13 years 11 months ago
Robot navigation using a sparse distributed memory
— Despite all the progress that has been made in Robotics and Artificial Intelligence, traditional approaches seem unsuitable to build truly intelligent robots, exhibiting human...
Mendes Mendes, Manuel Marques Crisóstomo, A...
ICDM
2002
IEEE
159views Data Mining» more  ICDM 2002»
13 years 10 months ago
O-Cluster: Scalable Clustering of Large High Dimensional Data Sets
Clustering large data sets of high dimensionality has always been a serious challenge for clustering algorithms. Many recently developed clustering algorithms have attempted to ad...
Boriana L. Milenova, Marcos M. Campos
IJCNN
2006
IEEE
13 years 11 months ago
Bi-directional Modularity to Learn Visual Servoing Tasks
— This paper shows the advantage of using neural network modularity over conventional learning schemes to approximate complex functions. Indeed, it is difficult for artificial ...
Gilles Hermann, Patrice Wira, Jean-Philippe Urban
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
13 years 9 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
SIAMSC
2010
136views more  SIAMSC 2010»
12 years 11 months ago
A Krylov Method for the Delay Eigenvalue Problem
Abstract. The Arnoldi method is currently a very popular algorithm to solve large-scale eigenvalue problems. The main goal of this paper is to generalize the Arnoldi method to the ...
Elias Jarlebring, Karl Meerbergen, Wim Michiels