Sciweavers

621 search results - page 68 / 125
» An Expressive and Efficient Solution to the Service Selectio...
Sort
View
JMLR
2010
187views more  JMLR 2010»
14 years 4 months ago
SFO: A Toolbox for Submodular Function Optimization
In recent years, a fundamental problem structure has emerged as very useful in a variety of machine learning applications: Submodularity is an intuitive diminishing returns proper...
Andreas Krause
JAIR
2006
160views more  JAIR 2006»
14 years 9 months ago
Anytime Point-Based Approximations for Large POMDPs
The Partially Observable Markov Decision Process has long been recognized as a rich framework for real-world planning and control problems, especially in robotics. However exact s...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
DEXAW
1999
IEEE
105views Database» more  DEXAW 1999»
15 years 2 months ago
Personalizing the Web Using Site Descriptions
The information overload on the Web has created a great need for efficient filtering mechanisms. Many sites (e.g., CNN and Quicken) address this problem by allowing a user to crea...
Vinod Anupam, Yuri Breitbart, Juliana Freire, Bhar...
ICML
2006
IEEE
15 years 10 months ago
Generalized spectral bounds for sparse LDA
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
Baback Moghaddam, Yair Weiss, Shai Avidan
ECAI
2010
Springer
14 years 10 months ago
Optimal Task Migration in Service-Oriented Systems: Algorithms and Mechanisms
In service-oriented systems, such as grids and clouds, users are able to outsource complex computational tasks by procuring resources on demand from remote service providers. As th...
Sebastian Stein, Enrico Gerding, Nicholas R. Jenni...