Sciweavers

69 search results - page 7 / 14
» Polynomial frames on the sphere
Sort
View
FOCS
1998
IEEE
15 years 8 months ago
The Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
Daniele Micciancio
SIAMNUM
2010
99views more  SIAMNUM 2010»
14 years 10 months ago
On the Fourier Extension of Nonperiodic Functions
We obtain exponentially accurate Fourier series for nonperiodic functions on the interval [-1, 1] by extending these functions to periodic functions on a larger domain. The series ...
Daan Huybrechs
COMPGEOM
2006
ACM
15 years 9 months ago
How to get close to the median shape
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
Sariel Har-Peled
ICIP
2003
IEEE
16 years 5 months ago
Geometry-assisted statistical modeling for face mosaicing
The modeling of facial appearance has many applications. This paper proposes an approach to generating a statistical face model based on video mosaicing. Unlike traditional video ...
X. Liu, T. Chen
CORR
2007
Springer
183views Education» more  CORR 2007»
15 years 3 months ago
A complete set of rotationally and translationally invariant features for images
We propose a new set of rotationally and translationally invariant features for image or pattern recognition and classification. The new features are cubic polynomials in the pix...
Risi Imre Kondor