Sciweavers

291 search results - page 15 / 59
» Bias and the limits of pooling
Sort
View
CIKM
2009
Springer
14 years 3 months ago
Improving retrievability of patents with cluster-based pseudo-relevance feedback documents selection
High findability of documents within a certain cut-off rank is considered an important factor in recall-oriented application domains such as patent or legal document retrieval. ...
Shariq Bashir, Andreas Rauber
EUROPAR
2009
Springer
14 years 3 months ago
Uniform Sampling for Directed P2P Networks
Selecting a random peer with uniform probability across a peer-to-peer (P2P) network is a fundamental function for unstructured search, data replication, and monitoring algorithms....
Cyrus P. Hall, Antonio Carzaniga
DASFAA
2010
IEEE
193views Database» more  DASFAA 2010»
13 years 6 months ago
A Simple, Yet Effective and Efficient, Sliding Window Sampling Algorithm
Sampling streams of continuous data with limited memory, or reservoir sampling, is a utility algorithm. Standard reservoir sampling maintains a random sample of the entire stream a...
Xuesong Lu, Wee Hyong Tok, Chedy Raïssi, St&e...
BMCBI
2007
106views more  BMCBI 2007»
13 years 8 months ago
Modeling SAGE tag formation and its effects on data interpretation within a Bayesian framework
Background: Serial Analysis of Gene Expression (SAGE) is a high-throughput method for inferring mRNA expression levels from the experimentally generated sequence based tags. Stand...
Michael A. Gilchrist, Hong Qin, Russell L. Zaretzk...
TJS
2002
160views more  TJS 2002»
13 years 8 months ago
Adaptive Optimizing Compilers for the 21st Century
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...
Keith D. Cooper, Devika Subramanian, Linda Torczon