Sciweavers

2252 search results - page 257 / 451
» Improving Random Forests
Sort
View
ICPR
2010
IEEE
15 years 4 months ago
Beyond "Near-Duplicates": Learning Hash Codes for Efficient Similar-Image Retrieval
Finding similar images in a large database is an important, but often computationally expensive, task. In this paper, we present a two-tier similar-image retrieval system with the...
Shumeet Baluja, Michele Covell
FLAIRS
2007
15 years 3 months ago
A Distance-Based Over-Sampling Method for Learning from Imbalanced Data Sets
Many real-world domains present the problem of imbalanced data sets, where examples of one classes significantly outnumber examples of other classes. This makes learning difficu...
Jorge de la Calleja, Olac Fuentes
USS
2008
15 years 3 months ago
Experiences with Model Inference Assisted Fuzzing
In this paper we introduce the idea of model inference assisted fuzzing aimed to cost effectively improve software security. We experimented with several model inference technique...
Joachim Viide, Aki Helin, Marko Laakso, Pekka Piet...
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
15 years 2 months ago
Corruption and Recovery-Efficient Locally Decodable Codes
A (q, , )-locally decodable code (LDC) C : {0, 1}n {0, 1}m is an encoding from n-bit strings to m-bit strings such that each bit xk can be recovered with probability at least 1 2 +...
David P. Woodruff
ARCS
2008
Springer
15 years 2 months ago
Topology-Aware Replica Placement in Fault-Tolerant Embedded Networks
Application details uncertain at design time as well as tolerance against permanent resource defects demand flexibility and redundancy. In this context, we present a strategy for p...
Thilo Streichert, Michael Glaß, Rolf Wanka, ...