Sciweavers

984 search results - page 181 / 197
» ideas 2010
Sort
View
CORR
2010
Springer
200views Education» more  CORR 2010»
13 years 11 months ago
Unified Compression-Based Acceleration of Edit-Distance Computation
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...
CORR
2010
Springer
93views Education» more  CORR 2010»
13 years 11 months ago
Rank Awareness in Joint Sparse Recovery
In this paper we revisit the sparse multiple measurement vector (MMV) problem, where the aim is to recover a set of jointly sparse multichannel vectors from incomplete measurement...
Mike E. Davies, Yonina C. Eldar
CORR
2010
Springer
175views Education» more  CORR 2010»
13 years 11 months ago
Detecting Security threats in the Router using Computational Intelligence
Information security is an issue of global concern. As the Internet is delivering great convenience and benefits to the modern society, the rapidly increasing connectivity and acc...
J. Visumathi, K. L. Shunmuganathan
CORR
2010
Springer
125views Education» more  CORR 2010»
13 years 11 months ago
Critical control of a genetic algorithm
Based on speculations coming from statistical mechanics and the conjectured existence of critical states, I propose a simple heuristic in order to control the mutation probability...
Raphaël Cerf
CORR
2010
Springer
111views Education» more  CORR 2010»
13 years 11 months ago
Submodular Maximization by Simulated Annealing
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...
Shayan Oveis Gharan, Jan Vondrák