Sciweavers

9949 search results - page 1789 / 1990
» On the Network Complexity of Selection
Sort
View
TIT
2010
128views Education» more  TIT 2010»
15 years 1 months ago
Shannon-theoretic limits on noisy compressive sampling
In this paper, we study the number of measurements required to recover a sparse signal in M with L nonzero coefficients from compressed samples in the presence of noise. We conside...
Mehmet Akçakaya, Vahid Tarokh
TSP
2010
15 years 1 months ago
Distributed sparse linear regression
The Lasso is a popular technique for joint estimation and continuous variable selection, especially well-suited for sparse and possibly under-determined linear regression problems....
Gonzalo Mateos, Juan Andrés Bazerque, Georg...
ALGORITHMICA
2011
14 years 10 months ago
Algorithms for Marketing-Mix Optimization
Algorithms for determining quality/cost/price tradeoffs in saturated markets are consid-3 ered. A product is modeled by d real-valued qualities whose sum determines the unit cost ...
Joachim Gudmundsson, Pat Morin, Michiel H. M. Smid
ASPLOS
2011
ACM
14 years 10 months ago
S2E: a platform for in-vivo multi-path analysis of software systems
This paper presents S2E, a platform for analyzing the properties and behavior of software systems. We demonstrate S2E’s use in developing practical tools for comprehensive perfo...
Vitaly Chipounov, Volodymyr Kuznetsov, George Cand...
CVIU
2011
14 years 10 months ago
Graph-based quadratic optimization: A fast evolutionary approach
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
Samuel Rota Bulò, Marcello Pelillo, Immanue...
« Prev « First page 1789 / 1990 Last » Next »