2938 search results - page 345 / 588 » On obfuscating point functions |
188
click to vote
MP
2010
15 years 1 months ago
2010
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minima...
162
click to vote
TCS
2010
15 years 1 months ago
2010
In this paper we study some relevant prefixes of coloured Motzkin walks (otherwise called coloured Motzkin words). In these walks, the three kinds of step can have , and colours...
164
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Super-resolution is the task of creating an high resolution image from a low resolution input sequence. To overcome the difficulties of fine image registration, several methods ...
190
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Grassmannian beamforming is an efficient way to quantize channel state information in multiple-input multiple-output wireless systems. Unfortunately, multiuser systems require la...
221
click to vote
FOGA
2011
14 years 10 months ago
2011
It was recently proven that sets of points maximizing the hypervolume indicator do not give a good multiplicative approximation of the Pareto front. We introduce a new “logarith...