4679 search results - page 673 / 936 » Modeling When Connections Are the Problem |
184
click to vote
IJAMCIGI
2010
15 years 1 months ago
2010
We present an experimental investigation of tabu search (TS) to solve the 3-coloring problem (3-COL). Computational results reveal that a basic TS algorithm is able to find proper ...
167
click to vote
JMLR
2010
15 years 1 months ago
2010
We propose a novel group regularization which we call exclusive lasso. Unlike the group lasso regularizer that assumes covarying variables in groups, the proposed exclusive lasso ...
160
click to vote
MOC
2010
15 years 1 months ago
2010
Consider the space of two dimensional vector functions whose components and curl are square integrable with respect to the degenerate weight given by the radial variable. This spac...
189
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
The 1 norm regularized least square technique has been proposed as an efficient method to calculate sparse solutions. However, the choice of the regularization parameter is still...
153
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We address a Kalman-like estimator for solving universally the problems of filtering (p = 0), prediction (p > 0), and smoothing (p < 0) of discrete time-varying state-space...