5247 search results - page 744 / 1050 » Frequency Optimized Computation Methods |
169
click to vote
COR
2008
15 years 6 months ago
2008
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
166
click to vote
IJRR
2006
15 years 6 months ago
2006
ABSTRACT. We introduce tools from computational homology to verify coverage in an idealized sensor network. Our methods are unique in that, while they are coordinate-free and assum...
169
click to vote
AROBOTS
2005
15 years 6 months ago
2005
This paper deals with the surveillance problem of computing the motions of one or more robot observers in order to maintain visibility of one or several moving targets. The target...
143
click to vote
IJRR
2010
15 years 5 months ago
2010
Abstract The problem of generating uniform deterministic samples over the rotation group, SO(3), is fundamental to many fields, such as computational structural biology, robotics,...
219
click to vote
ISVC
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We propose an improved shape matching algorithm that extends the work of Felzenszwalb [3]. In this approach, we use triangular meshes to represent deformable objects and ...