Sciweavers

1763 search results - page 321 / 353
» Dependent random choice
Sort
View
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 8 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder
BMCBI
2006
165views more  BMCBI 2006»
13 years 7 months ago
Improved variance estimation of classification performance via reduction of bias caused by small sample size
Background: Supervised learning for classification of cancer employs a set of design examples to learn how to discriminate between tumors. In practice it is crucial to confirm tha...
Ulrika Wickenberg-Bolin, Hanna Göransson, M&a...
EOR
2007
101views more  EOR 2007»
13 years 7 months ago
Optimizing an objective function under a bivariate probability model
The motivation of this paper is to obtain an analytical closed form of a quadratic objective function arising from a stochastic decision process with bivariate exponential probabi...
Xavier Brusset, Nico M. Temme
TIT
2008
81views more  TIT 2008»
13 years 7 months ago
How to Filter an "Individual Sequence With Feedback"
We consider causally estimating (filtering) the components of a noise-corrupted sequence relative to a reference class of filters. The noiseless sequence to be filtered is designe...
Tsachy Weissman
BMCBI
2005
79views more  BMCBI 2005»
13 years 7 months ago
Mathematical design of prokaryotic clone-based microarrays
Background: Clone-based microarrays, on which each spot represents a random genomic fragment, are a good alternative to open reading frame-based microarrays, especially for microo...
Bart Pieterse, Elisabeth J. Quirijns, Frank H. J. ...