Sciweavers

2747 search results - page 523 / 550
» Non-oblivious Strategy Improvement
Sort
View
PAA
2010
15 years 4 months ago
Exploiting visual and text features for direct marketing learning in time and space constrained domains
Traditionally, direct marketing companies have relied on pre-testing to select the best offers to send to their audiences. Companies systematically dispatch the offers under consid...
Sebastiano Battiato, Giovanni Maria Farinella, Gio...
ICPR
2010
IEEE
15 years 4 months ago
A Re-evaluation of Pedestrian Detection on Riemannian Manifolds
Abstract--Boosting covariance data on Riemannian manifolds has proven to be a convenient strategy in a pedestrian detection context. In this paper we show that the detection perfor...
Diego Tosato, Michela Farenzena, Marco Cristani, V...
BMCBI
2008
119views more  BMCBI 2008»
15 years 6 months ago
Snagger: A user-friendly program for incorporating additional information for tagSNP selection
Background: There has been considerable effort focused on developing efficient programs for tagging single-nucleotide polymorphisms (SNPs). Many of these programs do not account f...
Christopher K. Edlund, Won H. Lee, Dalin Li, David...
IWCC
1999
IEEE
15 years 10 months ago
Nomad: A Scalable Operating System for Clusters of Uni and Multiprocessors
The recent improvements in workstation and interconnection network performance have popularized the clusters of off-the-shelf workstations. However, the usefulness of these cluste...
Eduardo Pinheiro, Ricardo Bianchini
IPPS
1997
IEEE
15 years 10 months ago
Control Schemes in a Generalized Utility for Parallel Branch-and-Bound Algorithms
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
Yuji Shinano, Kenichi Harada, Ryuichi Hirabayashi