Sciweavers

4432 search results - page 194 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
126
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Recovery of sparse perturbations in Least Squares problems
We show that the exact recovery of sparse perturbations on the coefficient matrix in overdetermined Least Squares problems is possible for a large class of perturbation structure...
Mert Pilanci, Orhan Arikan
GECCO
2009
Springer
167views Optimization» more  GECCO 2009»
15 years 10 months ago
Fixed-parameter evolutionary algorithms and the vertex cover problem
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
Stefan Kratsch, Frank Neumann
95
Voted
EOR
2010
102views more  EOR 2010»
15 years 3 months ago
The Tree of Hubs Location Problem
The Tree-of-Hubs Location Problem is studied. This problem, which combines several aspects of some location, network design and routing problems, is inspired by those transportati...
Iván A. Contreras, Elena Fernández, ...
139
Voted
ICIP
2000
IEEE
16 years 5 months ago
Curve Evolution, Boundary-Value Stochastic Processes, the Mumford-Shah Problem, and Missing Data Applications
We present an estimation-theoretic approach to curve evolution for the Mumford-Shah problem. By viewing an active contour as the set of discontinuities in the Mumford-Shah problem...
Andy Tsai, Anthony J. Yezzi, Alan S. Willsky
168
Voted
SOCC
2008
IEEE
124views Education» more  SOCC 2008»
15 years 10 months ago
Energy minimization using a greedy randomized heuristic for the voltage assignment problem in NoC
— Scaling down the voltage levels of the processing elements (PEs) in a Network-on-Chip (NoC) can significantly reduce the computation energy consumption with an overhead of the...
Pavel Ghosh, Arunabha Sen