8294 search results - page 988 / 1659 » Presenting Data from Experiments in Algorithmics |
210
click to vote
JSA
2008
15 years 7 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...
214
click to vote
CCE
2005
15 years 7 months ago
2005
A general method to design optimal redundant sensor network even in the case of one sensor failure and able to estimate process key parameters within a required accuracy is propos...
220
click to vote
EOR
2002
15 years 7 months ago
2002
We present a genetic algorithm for heuristically solving a cost minimization problem applied to communication networks with threshold based discounting. The network model assumes t...
182
click to vote
MDM
2009
Springer
16 years 2 months ago
2009
Springer
Continuous queries in Wireless Sensor Networks (WSNs) are founded on the premise of Query Routing Tree structures (denoted as T), which provide sensors with a path to the querying...
204
click to vote
SIGMOD
1998
ACM
15 years 11 months ago
1998
ACM
In large data recording and warehousing environments, it is often advantageous to provide fast, approximate answers to queries, whenever possible. Before DBMSs providing highly-ac...