126 search results - page 2 / 26 » A Framework for Efficient Minimum Distance Computations |
ITNG
2008
IEEE
13 years 11 months ago
2008
IEEE
With recent advances in wireless communication and position technologies, it became possible to collect and record trajectories of moving objects. Thus, many services in road netw...
STRINGOLOGY
2004
13 years 6 months ago
2004
Abstract. The edit distance between strings A and B is defined as the minimum number of edit operations needed in converting A into B or vice versa. Typically the allowed edit oper...
CVPR
2004
IEEE
14 years 7 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
APNOMS
2006
Springer
13 years 9 months ago
2006
Springer
This paper proposes a policy-based management framework for self-managed wireless sensor networks (WSNs) called SNOWMAN (SeNsOr netWork MANagement). In WSNs, a number of sensor nod...
SMA
2006
ACM
13 years 11 months ago
2006
ACM
We present an efficient and robust algorithm for computing the minimum distance between a point and freeform curve or surface by lifting the problem into a higher dimension. This...