3875 search results - page 281 / 775 » Approximation algorithms for the 0-extension problem |
162
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Existing value function approximation methods have been successfully used in many applications, but they often lack useful a priori error bounds. We propose a new approximate bili...
155
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this paper we propose an approximated structured prediction framework for large scale graphical models and derive message-passing algorithms for learning their parameters effic...
310
click to vote
PODS
2009
ACM
16 years 7 months ago
2009
ACM
Database technology is playing an increasingly important role in understanding and solving large-scale and complex scientific and societal problems and phenomena, for instance, un...
208
click to vote
ILP
2004
Springer
16 years 3 days ago
2004
Springer
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
163
click to vote
PRL
2008
15 years 6 months ago
2008
In this work we propose an approach to binary classification based on an extension of Bayes Point Machines. Particularly, we take into account the whole set of hypotheses that are...