Sciweavers

2555 search results - page 70 / 511
» Quantifiers and Working Memory
Sort
View
ICPR
2004
IEEE
15 years 11 months ago
Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort
A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial ...
Fred W. DePiero
ICNSC
2007
IEEE
15 years 4 months ago
Associative Memory for Noisy and Structurally Deformed Two-Dimensional Images Using Neural Networks
—This paper studies the problem of understanding noisy and structurally deformed two-dimensional images by means of abstractly defined neural works. First, in the framework of sy...
Hiroshi Inaba, Tomoki Takahashi, Keylan Alimhan
IEEEICCI
2006
IEEE
15 years 4 months ago
Evolved Patterns of Connectivity in Associative Memory Models
This paper investigates possible connection strategies in sparsely connected associative memory models. This is interesting because real neural networks must have both efficient p...
Rod Adams, Lee Calcraft, Neil Davey
AUSAI
2004
Springer
15 years 3 months ago
Longer-Term Memory in Clause Weighting Local Search for SAT
Abstract. This paper presents a comparative study between a state-ofthe-art clause weighting local search method for satisfiability testing and a variant modified to obtain longe...
Valnir Ferreira Jr., John Thornton
CC
2004
Springer
127views System Software» more  CC 2004»
15 years 3 months ago
Analyzing Memory Accesses in x86 Executables
This paper concerns static-analysis algorithms for analyzing x86 executables. The aim of the work is to recover intermediate representations that are similar to those that can be c...
Gogul Balakrishnan, Thomas W. Reps