Sciweavers

886 search results - page 105 / 178
» On the Autoreducibility of Random Sequences
Sort
View
SIGIR
2008
ACM
13 years 7 months ago
A unified and discriminative model for query refinement
This paper addresses the issue of query refinement, which involves reformulating ill-formed search queries in order to enhance relevance of search results. Query refinement typica...
Jiafeng Guo, Gu Xu, Hang Li, Xueqi Cheng
SPAA
2004
ACM
14 years 1 months ago
Online algorithms for prefetching and caching on parallel disks
Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...
Rahul Shah, Peter J. Varman, Jeffrey Scott Vitter
CORR
2010
Springer
65views Education» more  CORR 2010»
13 years 7 months ago
On Unconditionally Secure Computation with Vanishing Communication Cost
We propose a novel distortion-theoretic approach to a secure three-party computation problem. Alice and Bob have deterministic sequences, and Charlie wishes to compute a normalize...
Ye Wang, Shantanu Rane, Wei Sun, Prakash Ishwar
ENGL
2007
180views more  ENGL 2007»
13 years 7 months ago
Biological Data Mining for Genomic Clustering Using Unsupervised Neural Learning
— The paper aims at designing a scheme for automatic identification of a species from its genome sequence. A set of 64 three-tuple keywords is first generated using the four type...
Shreyas Sen, Seetharam Narasimhan, Amit Konar
BMCBI
2005
246views more  BMCBI 2005»
13 years 7 months ago
ParPEST: a pipeline for EST data analysis based on parallel computing
Background: Expressed Sequence Tags (ESTs) are short and error-prone DNA sequences generated from the 5' and 3' ends of randomly selected cDNA clones. They provide an im...
Nunzio D'Agostino, Mario Aversano, Maria Luisa Chi...