807 search results - page 46 / 162 » Space Efficient Algorithms for Ordered Tree Comparison |
178
click to vote
PE
2000
Springer
15 years 3 months ago
2000
Springer
Conventional methods for state space exploration are limited to the analysis of small systems because they suffer from excessive memory and computational requirements. We have dev...
145
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. Preemptiv...
145
click to vote
PKDD
2001
Springer
15 years 8 months ago
2001
Springer
This paper discusses the clustering quality and complexities of the hierarchical data clustering algorithm based on gravity theory. The gravitybased clustering algorithm simulates ...
156
click to vote
NIPS
1990
15 years 5 months ago
1990
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
143
Voted
EUC
2008
Springer
15 years 5 months ago
2008
Springer
Quality of service is an important issue in Delay Tolerant Mobile Ad-Hoc Networks (DTMs). This work attempts to improve the Quality of service (QoS) in DTMs by relying on spanning...