4114 search results - page 140 / 823 » Efficient Algorithms for the 2-Center Problems |
206
click to vote
COMGEO
2006
ACM
15 years 6 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...
179
click to vote
WWW
2008
ACM
16 years 6 months ago
2008
ACM
Sequential pattern mining has raised great interest in data mining research field in recent years. However, to our best knowledge, no existing work studies the problem of frequent...
146
click to vote
VISUALIZATION
1997
IEEE
15 years 10 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 ...
187
click to vote
DGCI
2000
Springer
15 years 9 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...
266
click to vote
DCOSS
2008
Springer
15 years 7 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...