421 search results - page 48 / 85 » Computing a k -Route over Uncertain Geographical Data |
DCC
2010
IEEE
14 years 3 months ago
2010
IEEE
We present a technique that compresses a string w by enumerating all the substrings of w. The substrings are enumerated from the shortest to the longest and in lexicographic order...
STOC
2005
ACM
14 years 2 months ago
2005
ACM
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
CA
1998
IEEE
14 years 1 months ago
1998
IEEE
Integrating virtual human's animation in networked virtual environments (NVEs) has the potential to create severe network load issues. In NVEs, users are represented by their...
SSD
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. This paper addresses the problem of finding k nearest neighbors for moving query point (we call it k-NNMP). It is an important issue in both mobile computing research an...
SADM
2010
13 years 3 months ago
2010
: The k nearest neighbor classification (k-NN) is a very simple and popular method for classification. However, it suffers from a major drawback, it assumes constant local class po...