414 search results - page 35 / 83 » On discrete norms of polynomials |
CORR
2002
Springer
13 years 9 months ago
2002
Springer
We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one corner to its opposite is polynomial in n. This gives the first exponential ...
COCO
2009
Springer
14 years 4 months ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
ICIP
2005
IEEE
14 years 11 months ago
2005
IEEE
We present a new reliable hybrid recursive method for optical flow estimation. The method efficiently combines the advantage of discrete motion estimation and optical flow estimati...
SIAMNUM
2010
13 years 4 months ago
2010
In the numerical simulation of many practical problems in physics and engineering, finite volume methods are an important and popular class of discretization methods due to the loc...
ICCV
2009
IEEE
15 years 2 months ago
2009
IEEE
This paper proposes a new affine registration algorithm
for matching two point sets in IR2 or IR3. The input point
sets are represented as probability density functions, using
e...