Sciweavers

3875 search results - page 536 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
ICML
2010
IEEE
15 years 7 months ago
Gaussian Processes Multiple Instance Learning
This paper proposes a multiple instance learning (MIL) algorithm for Gaussian processes (GP). The GP-MIL model inherits two crucial benefits from GP: (i) a principle manner of lea...
Minyoung Kim, Fernando De la Torre
TEC
2008
104views more  TEC 2008»
15 years 6 months ago
Coevolution of Fitness Predictors
Abstract--We present an algorithm that coevolves fitness predictors, optimized for the solution population, which reduce fitness evaluation cost and frequency, while maintaining ev...
Michael D. Schmidt, Hod Lipson
SIGMOD
2005
ACM
107views Database» more  SIGMOD 2005»
16 years 6 months ago
Relational Confidence Bounds Are Easy With The Bootstrap
Statistical estimation and approximate query processing have become increasingly prevalent applications for database systems. However, approximation is usually of little use witho...
Abhijit Pol, Chris Jermaine
CDC
2009
IEEE
147views Control Systems» more  CDC 2009»
15 years 11 months ago
A simulation-based method for aggregating Markov chains
— This paper addresses model reduction for a Markov chain on a large state space. A simulation-based framework is introduced to perform state aggregation of the Markov chain base...
Kun Deng, Prashant G. Mehta, Sean P. Meyn
WAOA
2010
Springer
236views Algorithms» more  WAOA 2010»
15 years 4 months ago
The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers
We study an extension of the unit-demand pricing problem in which the seller may offer bundles of items. If a customer buys such a bundle she is guaranteed to get one item out of i...
Patrick Briest, Heiko Röglin