16082 search results - page 104 / 3217 » Algorithms for Marketing-Mix Optimization |
114
click to vote
IDEAL
2009
Springer
15 years 2 months ago
2009
Springer
Many classification algorithms use the concept of distance or similarity between patterns. Previous work has shown that it is advantageous to optimize general Euclidean distances (...
176
click to vote
JMLR
2012
13 years 7 months ago
2012
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
131
click to vote
GLOBECOM
2010
IEEE
15 years 2 months ago
2010
IEEE
We present an information theoretic perspective on optimal broadband matching. Most of the broadband matching and communication theory literature assumes a frequencyflat reflection...
141
click to vote
SIAMCOMP
1998
15 years 4 months ago
1998
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This im...
136
click to vote
CAGD
2008
15 years 4 months ago
2008
In this paper a method is presented to fair the limit surface of a subdivision algorithm locally around an extraordinary point. The dominant six eigenvalues of the subdivision mat...