Sciweavers

3652 search results - page 428 / 731
» A study of query length
Sort
View
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 8 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko
286
Voted
IRFC
2011
Springer
14 years 8 months ago
Word Clouds of Multiple Search Results
Search engine result pages (SERPs) are known as the most expensive real estate on the planet. Most queries yield millions of organic search results, yet searchers seldom look beyon...
Rianne Kaptein, Jaap Kamps
ICDCS
2011
IEEE
14 years 4 months ago
Authorized Private Keyword Search over Encrypted Data in Cloud Computing
—In cloud computing, clients usually outsource their data to the cloud storage servers to reduce the management costs. While those data may contain sensitive personal information...
Ming Li, Shucheng Yu, Ning Cao, Wenjing Lou
WSDM
2012
ACM
243views Data Mining» more  WSDM 2012»
14 years 2 days ago
No search result left behind: branching behavior with browser tabs
Today’s Web browsers allow users to open links in new windows or tabs. This action, which we call ‘branching’, is sometimes performed on search results when the user plans t...
Jeff Huang, Thomas Lin, Ryen W. White
SIGMOD
2003
ACM
124views Database» more  SIGMOD 2003»
16 years 4 months ago
Dynamic XML documents with distribution and replication
The advent of XML as a universal exchange format, and of Web services as a basis for distributed computing, has fostered the apparition of a new class of documents: dynamic XML do...
Serge Abiteboul, Angela Bonifati, Gregory Cobena, ...