Sciweavers

1491 search results - page 258 / 299
» Training Linear Discriminant Analysis in Linear Time
Sort
View
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
14 years 6 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
ESANN
2006
13 years 10 months ago
Random Forests Feature Selection with K-PLS: Detecting Ischemia from Magnetocardiograms
Random Forests were introduced by Breiman for feature (variable) selection and improved predictions for decision tree models. The resulting model is often superior to AdaBoost and ...
Long Han, Mark J. Embrechts, Boleslaw K. Szymanski...
BMCBI
2007
143views more  BMCBI 2007»
13 years 9 months ago
An adaptive bin framework search method for a beta-sheet protein homopolymer model
Background: The problem of protein structure prediction consists of predicting the functional or native structure of a protein given its linear sequence of amino acids. This probl...
Alena Shmygelska, Holger H. Hoos
CORR
2006
Springer
107views Education» more  CORR 2006»
13 years 8 months ago
Optimal Scheduling of Peer-to-Peer File Dissemination
Peer-to-peer (P2P) overlay networks such as BitTorrent and Avalanche are increasingly used for disseminating potentially large files from a server to many end users via the Intern...
Jochen Mundinger, Richard R. Weber, Gideon Weiss
ENTCS
2007
153views more  ENTCS 2007»
13 years 8 months ago
The Methods of Approximation and Lifting in Real Computation
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
Manuel Lameiras Campagnolo, Kerry Ojakian