Sciweavers

4488 search results - page 711 / 898
» Properties of NP-Complete Sets
Sort
View
NIPS
2007
15 years 7 months ago
Stability Bounds for Non-i.i.d. Processes
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
Mehryar Mohri, Afshin Rostamizadeh
NIPS
2007
15 years 7 months ago
Feature Selection Methods for Improving Protein Structure Prediction with Rosetta
Rosetta is one of the leading algorithms for protein structure prediction today. It is a Monte Carlo energy minimization method requiring many random restarts to find structures ...
Ben Blum, Michael I. Jordan, David Kim, Rhiju Das,...
NIPS
2007
15 years 7 months ago
Selecting Observations against Adversarial Objectives
In many applications, one has to actively select among a set of expensive observations before making an informed decision. Often, we want to select observations which perform well...
Andreas Krause, H. Brendan McMahan, Carlos Guestri...
NIPS
2007
15 years 7 months ago
Learning Horizontal Connections in a Sparse Coding Model of Natural Images
It has been shown that adapting a dictionary of basis functions to the statistics of natural images so as to maximize sparsity in the coefficients results in a set of dictionary ...
Pierre Garrigues, Bruno Olshausen
SPLC
2008
15 years 7 months ago
Modeling the Variability Space of Self-Adaptive Applications
Modeling self-adaptive applications is a difficult task due to the complex relationships they have with their environments. Designers of such applications strive to model accurate...
Gilles Perrouin, Franck Chauvel, Julien DeAntoni, ...