Sciweavers

616 search results - page 73 / 124
» Decoding One Out of Many
Sort
View
IGPL
2006
87views more  IGPL 2006»
13 years 8 months ago
Satisfiability Decay along Conjunctions of Pseudo-Random Clauses
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...
Eli Shamir
JEA
2008
112views more  JEA 2008»
13 years 8 months ago
Dynamic spatial approximation trees
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Gonzalo Navarro, Nora Reyes
NN
2008
Springer
107views Neural Networks» more  NN 2008»
13 years 8 months ago
Impact of temporal coding of presynaptic entorhinal cortex grid cells on the formation of hippocampal place fields
Many behavioural experiments have pointed out the important role played by the hippocampus in spatial navigation. This role was enlightened by the discovery of hippocampal cells i...
Colin Molter, Yoko Yamaguchi
PAA
2008
13 years 8 months ago
Online nonparametric discriminant analysis for incremental subspace learning and recognition
This paper presents a novel approach for online subspace learning based on an incremental version of the nonparametric discriminant analysis (NDA). For many real-world applications...
Bogdan Raducanu, Jordi Vitrià
PR
2008
151views more  PR 2008»
13 years 8 months ago
Constraint Score: A new filter method for feature selection with pairwise constraints
Feature selection is an important preprocessing step in mining high-dimensional data. Generally, supervised feature selection methods with supervision information are superior to ...
Daoqiang Zhang, Songcan Chen, Zhi-Hua Zhou