1456 search results - page 17 / 292 » Improved Randomized Results for That Interval Selection Prob... |
ICALP
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We consider the randomized k-server problem, and give improved results for various metric spaces. In particular, we extend a recent result of Cot
COMPGEOM
2010
ACM
15 years 3 months ago
2010
ACM
We present new bounds on the first selection lemma in R3 . This makes progress on the open problems of Bukh, Matoušek and Nivash [6] and Boros-Füredi [4] for the three-dimensio...
IJCAI
2007
14 years 11 months ago
2007
Many methods, including supervised and unsupervised algorithms, have been developed for extractive document summarization. Most supervised methods consider the summarization task ...
ICML
2010
IEEE
14 years 11 months ago
2010
IEEE
We consider the general, widely applicable problem of selecting from n real-valued random variables a subset of size m of those with the highest means, based on as few samples as ...
BMCBI
2008
14 years 10 months ago
2008
Background: Analysis of complex samples with tandem mass spectrometry (MS/MS) has become routine in proteomic research. However, validation of database search results creates a bo...