Sciweavers

221 search results - page 15 / 45
» Efficient sampling of random permutations
Sort
View
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
13 years 12 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
BCB
2010
175views Bioinformatics» more  BCB 2010»
13 years 2 months ago
Gene set analysis using principal components
We present a new method for identifying gene sets associated with labeled samples, where the labels can be case versus control, or genotype differences. Existing approaches to thi...
Isa Kemal Pakatci, Wei Wang, Leonard McMillan
RECOMB
2007
Springer
14 years 8 months ago
Association Mapping of Complex Diseases with Ancestral Recombination Graphs: Models and Efficient Algorithms
Association, or LD (linkage disequilibrium), mapping is an intensely-studied approach to gene mapping (genome-wide or in candidate regions) that is widely hoped to be able to effic...
Yufeng Wu
VIS
2005
IEEE
122views Visualization» more  VIS 2005»
14 years 9 months ago
Effectively Visualizing Large Networks Through Sampling
We study the problem of visualizing large networks and develop es for effectively abstracting a network and reducing the size to a level that can be clearly viewed. Our size reduc...
Davood Rafiei, Stephen Curial
CIKM
2010
Springer
13 years 6 months ago
Online stratified sampling: evaluating classifiers at web-scale
Deploying a classifier to large-scale systems such as the web requires careful feature design and performance evaluation. Evaluation is particularly challenging because these larg...
Paul N. Bennett, Vitor R. Carvalho