Sciweavers

393 search results - page 13 / 79
» The LCA Problem Revisited
Sort
View
CISS
2008
IEEE
14 years 3 months ago
Reconstruction of compressively sensed images via neurally plausible local competitive algorithms
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...
Robert L. Ortman, Christopher J. Rozell, Don H. Jo...
WOLLIC
2010
Springer
14 years 1 months ago
The Two-Variable Fragment with Counting Revisited
The satisfiability and finite satisfiability problems for the two-variable fragment of first-order logic with counting were shown in [5] to be in NExpTime. This paper presents ...
Ian Pratt-Hartmann
RECOMB
2005
Springer
14 years 8 months ago
Consensus Folding of Unaligned RNA Sequences Revisited
As one of the earliest problems in computational biology, RNA secondary structure prediction (sometimes referred to as "RNA folding") problem has attracted attention agai...
Vineet Bafna, Haixu Tang, Shaojie Zhang
CEC
2010
IEEE
13 years 4 days ago
Revisiting Evolutionary Information Filtering
— Adaptive Information Filtering seeks a solution to the problem of information overload through a tailored representation of the user’s interests, called user profile, which ...
Nikolaos Nanas, Stefanos Kodovas, Manolis Vavalis
GECCO
2003
Springer
132views Optimization» more  GECCO 2003»
14 years 1 months ago
Evolutionary Multimodal Optimization Revisited
Abstract. We revisit a class of multimodal function optimizations using evolutionary algorithms reformulated into a multiobjective framework where previous implementations have nee...
Rajeev Kumar, Peter Rockett