Sciweavers

221 search results - page 11 / 45
» Efficient sampling of random permutations
Sort
View
ICDE
2010
IEEE
183views Database» more  ICDE 2010»
14 years 2 months ago
Estimating the compression fraction of an index using sampling
—Data compression techniques such as null suppression and dictionary compression are commonly used in today’s database systems. In order to effectively leverage compression, it...
Stratos Idreos, Raghav Kaushik, Vivek R. Narasayya...
BMCBI
2008
99views more  BMCBI 2008»
13 years 8 months ago
Ranking analysis of F-statistics for microarray data
Background: Microarray technology provides an efficient means for globally exploring physiological processes governed by the coordinated expression of multiple genes. However, ide...
Yuan-De Tan, Myriam Fornage, Hongyan Xu
BMCBI
2008
136views more  BMCBI 2008»
13 years 8 months ago
LOMA: A fast method to generate efficient tagged-random primers despite amplification bias of random PCR on pathogens
Background: Pathogen detection using DNA microarrays has the potential to become a fast and comprehensive diagnostics tool. However, since pathogen detection chips currently utili...
Wah-Heng Lee, Christopher W. Wong, Wan Yee Leong, ...
WWW
2005
ACM
14 years 8 months ago
Sampling search-engine results
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
Aris Anagnostopoulos, Andrei Z. Broder, David Carm...
CDC
2010
IEEE
112views Control Systems» more  CDC 2010»
13 years 2 months ago
An overview of recent results on the identification of sparse channels using random probes
In this paper, we collect and discuss some of the recent theoretical results on channel identification using a random probe sequence. These results are part of the body of work kno...
Justin Romberg