In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
A set XN of N points on the unit sphere is a spherical t-design if the average value of any polynomial of degree at most t over XN is equal to the average value of the polynomial o...
Congpei An, Xiaojun Chen, Ian H. Sloan, Robert S. ...
The skyline of a set P of multi-dimensional points (tuples) consists of those points in P for which no clearly better point in P exists, using component-wise comparison on domains ...
Many applications would emerge from the development of artificial systems able to accurately localize and identify sound sources. However, one of the main difficulties of such kin...
We describe a new approach for elucidating the nonlinear degrees of freedom in a distribution of shapes depicted in digital images. By combining a deformation-based method for mea...
Gustavo K. Rohde, Wei Wang, Tao Peng, Robert F. Mu...