969 search results - page 8 / 194 » A New Metric Between Polygons and How to Compute it |
LCN
2003
IEEE
14 years 22 days ago
2003
IEEE
In a multi-hop wireless network, each node is able to send a message to all of its neighbors that are located within its transmission radius. In a flooding task, a source sends th...
NIPS
1998
13 years 8 months ago
1998
Principal curves have been defined as "self consistent" smooth curves which pass through the "middle" of a d-dimensional probability distribution or data cloud...
ICPR
2010
IEEE
14 years 2 months ago
2010
IEEE
This paper overviews a set of Performance Evaluation
ToolS (PETS) for zone segmentation and classification. The
tools allow researchers and developers to evaluate, optimize
and ...
WALCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
ICCSA
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...