57 search results - page 3 / 12 » Closest point search in lattices |
GMP
2000
IEEE
13 years 10 months ago
2000
IEEE
An algorithm for calculating the minimum distance between non-convex polyhedra is described. A polyhedron is represented by a set of triangles. In calculating the distance between...
EDBT
2009
ACM
13 years 9 months ago
2009
ACM
Given a set of n query points in a general metric space, a metricspace skyline (MSS) query asks what are the closest points to all these query points in the database. Here, consid...
COMPGEOM
2008
ACM
13 years 7 months ago
2008
ACM
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...
ANTSW
2008
Springer
13 years 7 months ago
2008
Springer
We present a distributed control strategy that lets a swarm of satellites autonomously form a lattice in orbit around a planet. The system, based on the artificial potential field ...
TIT
1998
13 years 5 months ago
1998
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain
of L, and are obtained ba...