Sciweavers

3223 search results - page 105 / 645
» The Scaling of Search Cost
Sort
View
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 4 months ago
Upper Bounds for Maximally Greedy Binary Search Trees
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Der...
Kyle Fox
HICSS
2006
IEEE
123views Biometrics» more  HICSS 2006»
14 years 3 months ago
An Economic Model for Comparing Search Services
Search services are now ubiquitously employed in searching for documents on the Internet and on enterprise intranets. This research develops an economic model for comparing search...
Stephen K. Kwan, Shailaja Venkatsubramanyan
SIGCOMM
2009
ACM
14 years 4 months ago
ROAR: increasing the flexibility and performance of distributed search
To search the web quickly, search engines partition the web index over many machines, and consult every partition when answering a query. To increase throughput, replicas are adde...
Costin Raiciu, Felipe Huici, Mark Handley, David S...
ICDCSW
2006
IEEE
14 years 3 months ago
Improve Searching by Reinforcement Learning in Unstructured P2Ps
— Existing searching schemes in unstructured P2Ps can be categorized as either blind or informed. The quality of query results in blind schemes is low. Informed schemes use simpl...
Xiuqi Li, Jie Wu
AAAI
2010
13 years 11 months ago
Optimal Strategies for Reviewing Search Results
Web search engines respond to a query by returning more results than can be reasonably reviewed. These results typically include the title, link, and snippet of content from the t...
Jeff Huang, Anna Kazeykina