margin between spots of distinct rows or columns. The width of the margin is equal to 2/�w�, therefore the widest margin is found by minimizing �w� under the constraints ci(w̄ · x̄i − b) ≥ 1, i.e. requiring that all the spots lie on the correct side of the resulting grid line. The support vector machine described above is called a hard-margin SVM and does not take into account any outliers. One o...

margin between spots of distinct rows or columns. The width of the margin is equal to 2/�w�, therefore the widest margin is found by minimizing �w� under the constraints ci(w̄ · x̄i − b) ≥ 1, i.e. requiring that all the spots lie on the correct side of the resulting grid line. The support vector machine described above is called a hard-margin SVM and does not take into account any outliers. One o...

PURPOSE To minimize line shape distortions and spectral leakage artifacts in MR spectroscopic imaging (MRSI). METHODS A spatially and spectrally regularized non-Cartesian MRSI algorithm that uses the line shape distortion priors, estimated from water reference data, to deconvolve the spectra is introduced. Sparse spectral regularization is used to minimize noise amplification associated with ...

Purpose: To minimize line shape distortions and spectral leakage artifacts in MR spectroscopic imaging. Methods: A spatially and spectrally regularized non-Cartesian MRSI algorithm that uses the line shape distortion priors, estimated from water reference data, to deconvolve the spectra is introduced. Sparse spectral regularization is used to minimize noise amplification associated with deconvo...

Online matching on a line involves matching an online stream of items of various sizes to stored items of various sizes, with the objective of minimizing the average discrepancy in size between matched items. The best previously known upper and lower bounds on the optimal deterministic competitive ratio are linear in the number of items, and constant, respectively. We show that online matching ...