10 search results - page 2 / 2 » On the number of solutions of the discretizable molecular di... |
EOR
2010
13 years 4 months ago
2010
For a finite set of points S, the (monochromatic) Reverse Nearest Neighbor (RNN) rule associates with any query point q the subset of points in S that have q as its nearest neighb...
JGO
2010
12 years 11 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
TIT
2008
13 years 4 months ago
2008
This paper presents a construction of Slepian group codes from affine reflection groups. The solution to the initial vector and nearest distance problem is presented for all irred...
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
CGF
2006
13 years 4 months ago
2006
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...