Sciweavers

495 search results - page 28 / 99
» Approximation algorithms for budgeted learning problems
Sort
View
PVLDB
2008
174views more  PVLDB 2008»
15 years 5 months ago
Relaxation in text search using taxonomies
In this paper we propose a novel document retrieval model in which text queries are augmented with multi-dimensional taxonomy restrictions. These restrictions may be relaxed at a ...
Marcus Fontoura, Vanja Josifovski, Ravi Kumar, Chr...
CCIA
2005
Springer
15 years 12 months ago
Direct Policy Search Reinforcement Learning for Robot Control
— This paper proposes a high-level Reinforcement Learning (RL) control system for solving the action selection problem of an autonomous robot. Although the dominant approach, whe...
Andres El-Fakdi, Marc Carreras, Narcís Palo...
ICDM
2007
IEEE
106views Data Mining» more  ICDM 2007»
16 years 22 days ago
High-Speed Function Approximation
We address a new learning problem where the goal is to build a predictive model that minimizes prediction time (the time taken to make a prediction) subject to a constraint on mod...
Biswanath Panda, Mirek Riedewald, Johannes Gehrke,...
SDM
2010
SIAM
200views Data Mining» more  SDM 2010»
15 years 7 months ago
Residual Bayesian Co-clustering for Matrix Approximation
In recent years, matrix approximation for missing value prediction has emerged as an important problem in a variety of domains such as recommendation systems, e-commerce and onlin...
Hanhuai Shan, Arindam Banerjee
204
Voted
IEEEMSP
2002
IEEE
15 years 11 months ago
An optimal shape encoding scheme using skeleton decomposition
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
Haohong Wang, Guido M. Schuster, Aggelos K. Katsag...