Sciweavers

5107 search results - page 182 / 1022
» Data Mining and Information Retrieval
Sort
View
SIGCOMM
2003
ACM
15 years 11 months ago
Peer-to-peer information retrieval using self-organizing semantic overlay networks
Content-based full-text search is a challenging problem in Peer-toPeer (P2P) systems. Traditional approaches have either been centralized or use flooding to ensure accuracy of th...
Chunqiang Tang, Zhichen Xu, Sandhya Dwarkadas
KDD
2005
ACM
165views Data Mining» more  KDD 2005»
16 years 6 months ago
Co-clustering by block value decomposition
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
SIGKDD
2000
106views more  SIGKDD 2000»
15 years 6 months ago
Data mining for hypertext: A tutorial survey
With over 800 million pages covering most areas of human endeavor, the World-wide Web is a fertile ground for data mining research to make a di erence to the e ectiveness of infor...
Soumen Chakrabarti
ISW
2010
Springer
15 years 4 months ago
Efficient Computationally Private Information Retrieval from Anonymity or Trapdoor Groups
A Private Information Retrieval (PIR) protocol allows a database user, or client, to obtain information from a data- base in a manner that prevents the database from knowing which...
Jonathan T. Trostle, Andy Parrish
SP
2007
IEEE
102views Security Privacy» more  SP 2007»
16 years 23 days ago
Improving the Robustness of Private Information Retrieval
Since 1995, much work has been done creating protocols for private information retrieval (PIR). Many variants of the basic PIR model have been proposed, including such modificati...
Ian Goldberg