Sciweavers

6455 search results - page 838 / 1291
» Research problems
Sort
View
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
16 years 7 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
KDD
2008
ACM
211views Data Mining» more  KDD 2008»
16 years 7 months ago
ArnetMiner: extraction and mining of academic social networks
This paper addresses several key issues in the ArnetMiner system, which aims at extracting and mining academic social networks. Specifically, the system focuses on: 1) Extracting ...
Jie Tang, Jing Zhang, Limin Yao, Juanzi Li, Li Zha...
KDD
2007
ACM
176views Data Mining» more  KDD 2007»
16 years 7 months ago
Mining correlated bursty topic patterns from coordinated text streams
Previous work on text mining has almost exclusively focused on a single stream. However, we often have available multiple text streams indexed by the same set of time points (call...
Xuanhui Wang, ChengXiang Zhai, Xiao Hu, Richard Sp...
KDD
2007
ACM
186views Data Mining» more  KDD 2007»
16 years 7 months ago
Content-based document routing and index partitioning for scalable similarity-based searches in a large corpus
We present a document routing and index partitioning scheme for scalable similarity-based search of documents in a large corpus. We consider the case when similarity-based search ...
Deepavali Bhagwat, Kave Eshghi, Pankaj Mehra
CHI
2003
ACM
16 years 7 months ago
Phrase sets for evaluating text entry techniques
In evaluations of text entry methods, participants enter phrases of text using a technique of interest while performance data are collected. This paper describes and publishes (vi...
I. Scott MacKenzie, R. William Soukoreff