1640 search results - page 147 / 328 » Conditional Independence Trees |
120
Voted
RECOMB
2005
Springer
16 years 2 months ago
2005
Springer
We present data-analytic and statistical tools for studying rates of rearrangement of whole genomes and to assess the stability of these methods with changes in the level of resol...
136
Voted
STOC
2006
ACM
16 years 2 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
133
Voted
STOC
2005
ACM
16 years 2 months ago
2005
ACM
Abstract. We present a deterministic O(log n log log n) space algorithm for undirected stconnectivity. It is based on a space-efficient simulation of the deterministic EREW algorit...
97
Voted
STOC
2002
ACM
16 years 2 months ago
2002
ACM
Let f : {0, 1}n {0, 1} be a boolean function. For 0 let D (f) be the minimum depth of a decision tree for f that makes an error for fraction of the inputs x {0, 1}n . We also ma...
127
Voted
DCC
2006
IEEE
16 years 2 months ago
2006
IEEE
Lossless compression is studied for pairs of independent integer-valued symbols emitted by a source with a geometric probability distribution of parameter q (0, 1). Optimal prefix...