6575 search results - page 751 / 1315 » Specializing visualization algorithms |
166
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
155
click to vote
SIAMSC
2008
15 years 6 months ago
2008
Abstract. A new iterative algorithm for the solution of minimization problems in infinitedimensional Hilbert spaces which involve sparsity constraints in form of p-penalties is pro...
194
click to vote
JCO
2007
15 years 6 months ago
2007
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
147
click to vote
CGF
2005
15 years 6 months ago
2005
There are two major approaches for converting a tessellated CAD model that contains inconsistencies like cracks or intersections into a manifold and closed triangle mesh. Surface ...
163
click to vote
TSP
2008
15 years 6 months ago
2008
Abstract--Digital processing techniques are based on representing a continuous-time signal by a discrete set of samples. This paper treats the problem of reconstructing a periodic ...