Sciweavers

2269 search results - page 298 / 454
» Query Incentive Networks
Sort
View
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
16 years 28 days ago
Landmark-Based Routing in Dynamic Graphs
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
Daniel Delling, Dorothea Wagner
IPTPS
2004
Springer
16 years 6 days ago
Making Peer-to-Peer Keyword Searching Feasible Using Multi-level Partitioning
—This paper discusses large scale keyword searching on top of peer-to-peer (P2P) networks. The state-of-the-art keyword searching techniques for unstructured and structured P2P s...
Shuming Shi, Guangwen Yang, Dingxing Wang, Jin Yu,...
SIGIR
2003
ACM
16 years 2 days ago
Automatic ranking of retrieval systems in imperfect environments
The empirical investigation of the effectiveness of information retrieval (IR) systems requires a test collection, a set of query topics, and a set of relevance judgments made by ...
Rabia Nuray, Fazli Can
WEA
2010
Springer
281views Algorithms» more  WEA 2010»
15 years 12 months ago
Distributed Time-Dependent Contraction Hierarchies
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
Tim Kieritz, Dennis Luxen, Peter Sanders, Christia...
MOBICOM
1999
ACM
15 years 11 months ago
An Architecture for a Secure Service Discovery Service
The widespread deployment of inexpensive communications technology, computational resources in the networking infrastructure, and network-enabled end devices poses an interesting ...
Steven E. Czerwinski, Ben Y. Zhao, Todd D. Hodes, ...