4110 search results - page 82 / 822 » Efficient algorithms for the 2-gathering problem |
178
click to vote
COMGEO
2006
ACM
15 years 4 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
127
click to vote
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
We address the design of algorithms for multicores that are oblivious to machine parameters. We propose HM, a multicore model consisting of a parallel shared-memory machine with hi...
119
click to vote
VISUALIZATION
1997
IEEE
15 years 8 months ago
1997
IEEE
This paper discusses the problem of subdividing unstructured mesh topologies containing hexahedra, prisms, pyramids and tetrahedra into a consistent set of only tetrahedra, while ...
156
click to vote
DGCI
2000
Springer
15 years 7 months ago
2000
Springer
We consider the problem of finding the best match for a given query shape among candidate shapes stored in a shape base. This is central to a wide range of applications, such as, d...
240
click to vote
DCOSS
2008
Springer
15 years 5 months ago
2008
Springer
This paper presents an energy-aware, sleep scheduling algorithm called SSMTT to support multiple target tracking sensor networks. SSMTT leverages the awakening result of interferi...