Sciweavers

1461 search results - page 37 / 293
» The Cost of Cache-Oblivious Searching
Sort
View
WWW
2004
ACM
16 years 15 days ago
Site-to-site (s2s) searching using the p2p framework with cgi
Peer-To-Peer (P2P) networks like Gnutella improve some shortcomings of Conventional Search Engines (CSE) such as centralized and outdated indexing by distributing the search engin...
Wan Yeung Wong
GCC
2003
Springer
15 years 5 months ago
Dominating-Set-Based Searching in Peer-to-Peer Networks
— The peer-to-peer network for sharing information and data through direct exchange has emerged rapidly in recent years. The searching problem is a basic issue that addresses the...
Chunlin Yang, Jie Wu
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
16 years 1 days ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis
ICDCS
1999
IEEE
15 years 4 months ago
Search Space Reduction in QoS Routing
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
Liang Guo, Ibrahim Matta
EMNLP
2007
15 years 1 months ago
Inducing Search Keys for Name Filtering
This paper describes ETK (Ensemble of Transformation based Keys) a new algorithm for inducing search keys for name filtering. ETK has the low computational cost and ability to ...
Karl Branting