Sciweavers

1161 search results - page 29 / 233
» Efficient search engine measurements
Sort
View
FSTTCS
2000
Springer
15 years 3 months ago
Planar Graph Blocking for External Searching
We present a new scheme for storing a planar graph in external memory so that any online path can be traversed in an I-O efficient way. Our storage scheme significantly improves th...
Surender Baswana, Sandeep Sen
WWW
2005
ACM
15 years 5 months ago
Preferential walk: towards efficient and scalable search in unstructured peer-to-peer networks
To improve search efficiency and reduce unnecessary traffic in Peerto-Peer (P2P) networks, this paper proposes a trust-based probabilistic search algorithm, called preferential wa...
Hai Zhuge, Xue Chen, Xiaoping Sun
CIKM
2010
Springer
14 years 9 months ago
Building efficient multi-threaded search nodes
Search nodes are single-purpose components of large Web search engines and their efficient implementation is critical to sustain thousands of queries per second and guarantee indi...
Carolina Bonacic, Carlos García, Mauricio M...
NAACL
2010
14 years 9 months ago
Query Ambiguity Revisited: Clickthrough Measures for Distinguishing Informational and Ambiguous Queries
Understanding query ambiguity in web search remains an important open problem. In this paper we reexamine query ambiguity by analyzing the result clickthrough data. Previously pro...
Yu Wang, Eugene Agichtein
WWW
2006
ACM
16 years 13 days ago
A web-based kernel function for measuring the similarity of short text snippets
Determining the similarity of short text snippets, such as search queries, works poorly with traditional document similarity measures (e.g., cosine), since there are often few, if...
Mehran Sahami, Timothy D. Heilman