1274 search results - page 124 / 255 » The Geometry of Coin-Weighing Problems |
156
click to vote
SMA
2003
ACM
15 years 11 months ago
2003
ACM
In this paper we present a new algorithm for solving the data dependent fairing problem for subdivision surfaces, using Catmull-Clark surfaces as an example. Earlier approaches to...
172
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
194
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
We present a new (1 + ε)-spanner for sets of n points in Rd . Our spanner has size O(n/εd−1 ) and maximum degree O(logd n). The main advantage of our spanner is that it can be...
156
click to vote
COCOA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In wireless communication networks, optimal use of the directional antenna is very important. The directional antenna coverage (DAC) problem is to cover all clients with ...
179
click to vote
IJRR
2002
15 years 6 months ago
2002
We study the path planning problem, without obstacles, for closed kinematic chains with n links connected by spherical joints in space or revolute joints in the plane. The configu...