Sciweavers

3652 search results - page 293 / 731
» A study of query length
Sort
View
TREC
2004
15 years 4 months ago
University of North Carolina's HARD Track Experiments at TREC 2004
In the experiment described in this paper, we investigate the effectiveness of a document-independent technique for eliciting additional information from searchers about their inf...
Diane Kelly, Vijay Deepak Dollu, Xin Fu
131
Voted
SAC
2010
ACM
15 years 3 months ago
FANGS: high speed sequence mapping for next generation sequencers
Next Generation Sequencing machines are generating millions of short DNA sequences (reads) everyday. There is a need for efficient algorithms to map these sequences to the referen...
Sanchit Misra, Ramanathan Narayanan, Simon Lin, Al...
SIGMOD
2010
ACM
171views Database» more  SIGMOD 2010»
15 years 3 months ago
An optimal labeling scheme for workflow provenance using skeleton labels
We develop a compact and efficient reachability labeling scheme for answering provenance queries on workflow runs that conform to a given specification. Even though a workflow run...
Zhuowei Bao, Susan B. Davidson, Sanjeev Khanna, Su...
143
Voted
ML
2007
ACM
108views Machine Learning» more  ML 2007»
15 years 3 months ago
Unconditional lower bounds for learning intersections of halfspaces
We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statist...
Adam R. Klivans, Alexander A. Sherstov
134
Voted
IPPS
2010
IEEE
15 years 1 months ago
pFANGS: Parallel high speed sequence mapping for Next Generation 454-roche Sequencing reads
Millions of DNA sequences (reads) are generated by Next Generation Sequencing machines everyday. There is a need for high performance algorithms to map these sequences to the refer...
Sanchit Misra, Ramanathan Narayanan, Wei-keng Liao...