293 search results - page 22 / 59 » Geometric algorithms for clearance based optimal path comput... |
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
We propose a modified discrete HMM that includes a feature weighting discrimination component. We assume that the feature space is partitioned into subspaces and that the relevan...
106
click to vote
CCCG
2003
15 years 1 months ago
2003
Given a convex polygon in the plane, we are interested in triangulations of its interior, i.e. maximal sets of nonintersecting diagonals that subdivide the interior of the polygon...
IPPS
1997
IEEE
15 years 3 months ago
1997
IEEE
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
ESA
2010
Springer
15 years 24 days ago
2010
Springer
This paper studies the geodesic diameter of polygonal domains having h holes and n corners. For simple polygons (i.e., h = 0), it is known that the geodesic diameter is determined...
103
click to vote
ICS
2007
Tsinghua U.
15 years 5 months ago
2007
Tsinghua U.
This paper investigates helper threads that improve performance by prefetching data on behalf of an application’s main thread. The focus is data prefetch helper threads that lac...