Sciweavers

495 search results - page 23 / 99
» Approximation algorithms for budgeted learning problems
Sort
View
ICML
2004
IEEE
15 years 10 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...
INFOCOM
2010
IEEE
14 years 8 months ago
Distributed Algorithms for Approximating Wireless Network Capacity
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
Michael Dinitz
JGO
2010
117views more  JGO 2010»
14 years 8 months ago
Machine learning problems from optimization perspective
Both optimization and learning play important roles in a system for intelligent tasks. On one hand, we introduce three types of optimization tasks studied in the machine learning l...
Lei Xu
ICASSP
2011
IEEE
14 years 1 months ago
Bayesian framework and message passing for joint support and signal recovery of approximately sparse signals
In this paper, we develop a low-complexity message passing algorithm for joint support and signal recovery of approximately sparse signals. The problem of recovery of strictly spa...
Shubha Shedthikere, Ananthanarayanan Chockalingam
ICML
2002
IEEE
15 years 10 months ago
Algorithm-Directed Exploration for Model-Based Reinforcement Learning in Factored MDPs
One of the central challenges in reinforcement learning is to balance the exploration/exploitation tradeoff while scaling up to large problems. Although model-based reinforcement ...
Carlos Guestrin, Relu Patrascu, Dale Schuurmans