401 search results - page 44 / 81 » Algorithms for a Simple Point Placement Problem |
IWVF
2001
Springer
15 years 4 months ago
2001
Springer
ÐA voxel-based method for flattening a surface in 3D space into 2D while best preserving distances is presented. Triangulation or polyhedral approximation of the voxel data are no...
CORR
2006
Springer
14 years 12 months ago
2006
Springer
A pants decomposition of an orientable surface is a collection of simple cycles that partition into pants, i.e., surfaces of genus zero with three boundary cycles. Given a set P...
ESANN
2007
15 years 1 months ago
2007
In this work, we present a new model for a Recurrent Support Vector Machine. We call it intrinsic because the complete recurrence is directly incorporated within the considered opt...
105
click to vote
VLDB
2002
ACM
14 years 11 months ago
2002
ACM
A continuous nearest neighbor query retrieves the nearest neighbor (NN) of every point on a line segment (e.g., "find all my nearest gas stations during my route from point s...
ECP
1999
Springer
15 years 4 months ago
1999
Springer
We extend a planning algorithm to cover simple forms of arithmetics. The operator preconditions can refer to the values of numeric variables and the operator postconditions can mod...