Sciweavers

17329 search results - page 195 / 3466
» Improved non-approximability results
Sort
View
IM
2007
13 years 10 months ago
Using the Power of Two Choices to Improve Bloom Filters
We consider the combination of two ideas from the hashing literature: the power of two choices and Bloom filters. Specifically, we show via simulations that, in comparison with a...
Steven S. Lumetta, Michael Mitzenmacher
MCS
2007
Springer
13 years 10 months ago
Exploiting Diversity in Ensembles: Improving the Performance on Unbalanced Datasets
Abstract. Ensembles are often capable of greater predictive performance than any of their individual classifiers. Despite the need for classifiers to make different kinds of err...
Nitesh V. Chawla, Jared Sylvester
BMCBI
2004
91views more  BMCBI 2004»
13 years 10 months ago
Improved hit criteria for DNA local alignment
The hit criterion is a key component of heuristic local alignment algorithms. It specifies a class of patterns assumed to witness a potential similarity, and this choice is decisi...
Laurent Noé, Gregory Kucherov

Publication
261views
15 years 8 months ago
Improving Explicit Congestion Notification with the Mark-Front Strategy
Delivering congestion signals is essential to the performance of networks. Current TCP/IP networks use packet losses to signal congestion. Packet losses not only reduces TCP perfor...
Chunlei Liu, Raj Jain,
CVPR
2007
IEEE
15 years 5 days ago
Improving Variance Estimation in Biometric Systems
Measuring system performance seems conceptually straightforward. However, the interpretation of the results and predicting future performance remain as exceptional challenges in s...
Ross J. Micheals, Terrance E. Boult