Sciweavers

12825 search results - page 1981 / 2565
» Improved PLSOM algorithm
Sort
View
GECCO
2010
Springer
186views Optimization» more  GECCO 2010»
15 years 8 months ago
Genetic rule extraction optimizing brier score
Most highly accurate predictive modeling techniques produce opaque models. When comprehensible models are required, rule extraction is sometimes used to generate a transparent mod...
Ulf Johansson, Rikard König, Lars Niklasson
GECCO
2008
Springer
137views Optimization» more  GECCO 2008»
15 years 8 months ago
Informative sampling for large unbalanced data sets
Selective sampling is a form of active learning which can reduce the cost of training by only drawing informative data points into the training set. This selected training set is ...
Zhenyu Lu, Anand I. Rughani, Bruce I. Tranmer, Jos...
BMCBI
2010
143views more  BMCBI 2010»
15 years 7 months ago
Evaluation of methods for detection of fluorescence labeled subcellular objects in microscope images
Background: Several algorithms have been proposed for detecting fluorescently labeled subcellular objects in microscope images. Many of these algorithms have been designed for spe...
Pekka Ruusuvuori, Tarmo Äijö, Sharif Cho...
ASE
2005
137views more  ASE 2005»
15 years 7 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
ALGORITHMICA
2000
161views more  ALGORITHMICA 2000»
15 years 7 months ago
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...
« Prev « First page 1981 / 2565 Last » Next »