Sciweavers

1709 search results - page 153 / 342
» Comparing the Performance of Database Selection Algorithms
Sort
View
W2GIS
2004
Springer
15 years 11 months ago
Expansion-Based Algorithms for Finding Single Pair Shortest Path on Surface
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
Ke Deng, Xiaofang Zhou
WWW
2003
ACM
16 years 7 months ago
The Eigentrust algorithm for reputation management in P2P networks
Peer-to-peer file-sharing networks are currently receiving much attention as a means of sharing and distributing information. However, as recent experience shows, the anonymous, o...
Sepandar D. Kamvar, Mario T. Schlosser, Hector Gar...
CORR
2008
Springer
98views Education» more  CORR 2008»
15 years 6 months ago
Void Traversal for Guaranteed Delivery in Geometric Routing
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorith...
Mikhail Nesterenko, Adnan Vora
WIDM
2009
ACM
16 years 24 days ago
Semantic relatedness hits bibliographic data
In this paper we introduce a novel approach for the thematic organization of bibliographic records that builds upon a semantic relatedness measure we have implemented for this tas...
George Tsatsaronis, Iraklis Varlamis, Sofia Stamou...
VLDB
1994
ACM
91views Database» more  VLDB 1994»
15 years 10 months ago
On Spatially Partitioned Temporal Join
This paper presents an innovative partitionbased time join strategy for temporal databases where time is represented by time intervals. The proposed method maps time intervals to ...
Hongjun Lu, Beng Chin Ooi, Kian-Lee Tan