Sciweavers

598 search results - page 13 / 120
» Approximation Algorithms for the Bottleneck Stretch Factor P...
Sort
View
CLA
2007
13 years 8 months ago
Formal Concepts as Optimal Factors in Boolean Factor Analysis: Implications and Experiments
Boolean factor analysis aims at decomposing an objects × attributes Boolean matrix I into a Boolean product of an objects × factors Boolean matrix A and a factors × attributes B...
Radim Belohlávek, Vilém Vychodil
ICAC
2006
IEEE
14 years 1 months ago
Hardness of Approximation and Greedy Algorithms for the Adaptation Problem in Virtual Environments
— Over the past decade, wide-area distributed computing has emerged as a powerful computing paradigm. Virtual machines greatly simplify wide-area distributed computing ing the ab...
Ananth I. Sundararaj, Manan Sanghi, John R. Lange,...
ICML
2010
IEEE
13 years 8 months ago
A Simple Algorithm for Nuclear Norm Regularized Problems
Optimization problems with a nuclear norm regularization, such as e.g. low norm matrix factorizations, have seen many applications recently. We propose a new approximation algorit...
Martin Jaggi, Marek Sulovský
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
14 years 7 months ago
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
ICML
2002
IEEE
14 years 8 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