Sciweavers

2006 search results - page 376 / 402
» Heuristic Security-Testing Methods
Sort
View
IPM
2007
95views more  IPM 2007»
13 years 9 months ago
Using structural contexts to compress semistructured text collections
We describe a compression model for semistructured documents, called Structural Contexts Model (SCM), which takes advantage of the context information usually implicit in the stru...
Joaquín Adiego, Gonzalo Navarro, Pablo de l...
TSP
2008
151views more  TSP 2008»
13 years 9 months ago
Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
Moshe Mishali, Yonina C. Eldar
NECO
2000
133views more  NECO 2000»
13 years 9 months ago
Neural Coding: Higher-Order Temporal Patterns in the Neurostatistics of Cell Assemblies
Recent advances in the technology of multi-unit recordings make it possible to test Hebb's hypothesis that neurons do not function in isolation but are organized in assemblie...
Laura Martignon, Gustavo Deco, Kathryn B. Laskey, ...
JPDC
1998
124views more  JPDC 1998»
13 years 8 months ago
Multilevel k-way Partitioning Scheme for Irregular Graphs
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm. A key feature of this parallel formulation is that it is able to achieve a high ...
George Karypis, Vipin Kumar
TNN
1998
114views more  TNN 1998»
13 years 8 months ago
Bayesian retrieval in associative memories with storage errors
Abstract—It is well known that for finite-sized networks, onestep retrieval in the autoassociative Willshaw net is a suboptimal way to extract the information stored in the syna...
Friedrich T. Sommer, Peter Dayan