539 search results - page 74 / 108 » An Improved Upper Bound for SAT |
101
click to vote
COMGEO
2011
ACM
14 years 6 months ago
2011
ACM
A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum ...
100
click to vote
EJWCN
2010
14 years 6 months ago
2010
Information collection in the disaster area is an important application of pigeon networks - a special type of delay tolerant networks (DTN) that borrows the ancient idea of using ...
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
In previous work, a water-filling algorithm was proposed which sought to minimize the mean square error (MSE) at any given time by optimally choosing the gains (i.e. step-sizes) ...
111
click to vote
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
—We present an alternative analysis of weighted 1 minimization for sparse signals with a nonuniform sparsity model, and extend our results to nuclear norm minimization for matric...
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
Frame (upper and lower) bound ratio is a key factor of numerical stability of frame systems. While tight frames, of which the minimal ratio 1 is achieved, are much preferred in ma...