185 search results - page 8 / 37 » Precise complexity analysis for efficient datalog queries |
IJAHUC
2008
14 years 9 months ago
2008
: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...
87
Voted
JUCS
2010
14 years 4 months ago
2010
: We address the question of how to communicate among distributed processes values such as real numbers, continuous functions and geometrical solids with arbitrary precision, yet e...
CAD
2006
Springer
2006
Springer
An efficient, error-bounded approximation algorithm for simulating quasi-statics of complex linkages
14 years 9 months ago
Design and analysis of articulated mechanical structures, commonly referred to as linkages, is an integral part of any CAD/CAM system. The most common approaches formulate the pro...
TKDE
2010
14 years 4 months ago
2010
DHT is a widely used building block for scalable P2P systems. However, as uniform hashing employed in DHTs destroys data locality, it is not a trivial task to support complex queri...
CORR
2012
Springer
13 years 5 months ago
2012
Springer
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...