2880 search results - page 77 / 576 » Approximate Range Searching |
139
click to vote
MOBIHOC
2008
ACM
16 years 2 months ago
2008
ACM
Broadcast scheduling is a fundamental problem in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in ...
122
click to vote
CPM
1999
Springer
15 years 7 months ago
1999
Springer
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
136
click to vote
CIKM
2006
Springer
15 years 7 months ago
2006
Springer
In this paper, we propose an approach for efficient approximative RkNN search in arbitrary metric spaces where the value of k is specified at query time. Our method uses an approx...
124
Voted
JSA
2008
15 years 3 months ago
2008
In this paper, we present linear processor array architectures for flexible approximate string matching. These architectures are based on parallel realization of dynamic programmi...
107
click to vote
ICDCS
2007
IEEE
15 years 9 months ago
2007
IEEE
We consider a problem that arises during the propagation of subscriptions in a contentbased publish-subscribe system. Subscription covering is a promising optimization that reduce...