277 search results - page 22 / 56 » New results on shortest paths in three dimensions |
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
DAC
2004
ACM
14 years 1 months ago
2004
ACM
As the technology migrates into the deep submicron manufacturing (DSM) era, the critical dimension of the circuits is getting smaller than the lithographic wavelength. The unavoid...
TVCG
2011
13 years 2 months ago
2011
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
IROS
2007
IEEE
14 years 2 months ago
2007
IEEE
— In this paper we present a systematic study of the performance of seven different configurations of GPS on a moving vehicle using three different GPS receivers. The seven diff...
ROBOCOMM
2007
IEEE
14 years 2 months ago
2007
IEEE
—Path planning for mobile robots is a well researched problem for over three decades. In this paper, we test and evaluate a new approach based on Shi and Karl Level Sets for mobi...