Sciweavers

452 search results - page 58 / 91
» A mean field approach for optimization in discrete time
Sort
View
ISBI
2009
IEEE
15 years 4 months ago
Fast Algorithms for Nonconvex Compressive Sensing: MRI Reconstruction from Very Few Data
Compressive sensing is the reconstruction of sparse images or signals from very few samples, by means of solving a tractable optimization problem. In the context of MRI, this can ...
Rick Chartrand
TON
2008
106views more  TON 2008»
14 years 9 months ago
Statistical techniques for detecting traffic anomalies through packet header data
This paper proposes a traffic anomaly detector, operated in postmortem and in real-time, by passively monitoring packet headers of traffic. The frequent attacks on network infrastr...
Seong Soo Kim, A. L. Narasimha Reddy
ICML
2008
IEEE
15 years 10 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
GECCO
2006
Springer
156views Optimization» more  GECCO 2006»
15 years 1 months ago
Probabilistic modeling for continuous EDA with Boltzmann selection and Kullback-Leibeler divergence
This paper extends the Boltzmann Selection, a method in EDA with theoretical importance, from discrete domain to the continuous one. The difficulty of estimating the exact Boltzma...
Yunpeng Cai, Xiaomin Sun, Peifa Jia
EVOW
2003
Springer
15 years 2 months ago
GAME-HDL: Implementation of Evolutionary Algorithms Using Hardware Description Languages
Evolutionary Algorithms (EAs) have been proposed as a very powerful heuristic optimization technique to solve complex problems. Many case studies have shown that they work very eff...
Rolf Drechsler, Nicole Drechsler