363 search results - page 19 / 73 » Finding Small Solutions to Small Degree Polynomials |
SODA
1998
ACM
13 years 9 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
While global methods for matching shapes to images have recently been proposed, so far research has focused on small deformations of a fixed template. In this paper we present the...
JAT
2010
13 years 6 months ago
2010
In [6], we proved an asymptotic O(n−α/(α+1)) bound for the approximation of SU(N) loops (N ≥ 2) with Lipschitz smoothness α > 1/2 by polynomial loops of degree ≤ n. Th...
ECCC
2007
13 years 7 months ago
2007
Let p be a fixed prime number, and N be a large integer. The ’Inverse Conjecture for the Gowers norm’ states that if the ”d-th Gowers norm” of a function f : FN p → F i...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
It is widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study ...