Sciweavers

5316 search results - page 365 / 1064
» Which Search Problems Are Random
Sort
View
WWW
2004
ACM
16 years 8 months ago
Testbed for information extraction from deep web
Search results generated by searchable databases are served dynamically and far larger than the static documents on the Web. These results pages have been referred to as the Deep ...
Yasuhiro Yamada, Nick Craswell, Tetsuya Nakatoh, S...
IPPS
2007
IEEE
16 years 1 months ago
Replication Strategy in Unstructured Peer-to-Peer Systems
1 The unstructured Peer-to-Peer (P2P) systems usually use a “blind search” method to find the requested data object by propagating a query to a number of peers randomly. In or...
Guofu Feng, Yuquan Jiang, Guihai Chen, Qing Gu, Sa...
CIKM
2007
Springer
16 years 1 months ago
"I know what you did last summer": query logs and user privacy
We investigate the subtle cues to user identity that may be exploited in attacks on the privacy of users in web search query logs. We study the application of simple classifiers ...
Rosie Jones, Ravi Kumar, Bo Pang, Andrew Tomkins
ICPADS
2006
IEEE
16 years 1 months ago
XYZ: A Scalable, Partially Centralized Lookup Service for Large-Scale Peer-to-Peer Systems
Peer-to-Peer (P2P) systems are characterized by direct access between peer computers, rather than through a centralized server. File sharing is the dominant P2P application on the...
Jianying Zhang, Jie Wu
CRYPTO
2005
Springer
120views Cryptology» more  CRYPTO 2005»
16 years 1 months ago
Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions
We identify and fill some gaps with regard to consistency (the extent to which false positives are produced) for public-key encryption with keyword search (PEKS), providing new de...
Michel Abdalla, Mihir Bellare, Dario Catalano, Eik...