Sciweavers

14161 search results - page 440 / 2833
» On generalized middle-level problem
Sort
View
CP
2007
Springer
16 years 1 months ago
Reformulating CSPs for Scalability with Application to Geospatial Reasoning
While many real-world combinatorial problems can be advantageously modeled and solved using Constraint Programming, scalability remains a major issue in practice. Constraint models...
Kenneth M. Bayer, Martin Michalowski, Berthe Y. Ch...
148
Voted
JMLR
2006
93views more  JMLR 2006»
15 years 6 months ago
An Efficient Implementation of an Active Set Method for SVMs
We propose an active set algorithm to solve the convex quadratic programming (QP) problem which is the core of the support vector machine (SVM) training. The underlying method is ...
Katya Scheinberg
204
Voted
SODA
2012
ACM
225views Algorithms» more  SODA 2012»
13 years 9 months ago
Approximating rooted Steiner networks
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
Joseph Cheriyan, Bundit Laekhanukit, Guyslain Nave...
176
Voted
ICML
2007
IEEE
16 years 7 months ago
Discriminative learning for differing training and test distributions
We address classification problems for which the training instances are governed by a distribution that is allowed to differ arbitrarily from the test distribution--problems also ...
Michael Brückner, Steffen Bickel, Tobias Sche...
MDAI
2009
Springer
16 years 1 months ago
Using Conditional Random Fields for Decision-Theoretic Planning
We propose a means of extending Conditional Random Field modeling to decision-theoretic planning where valuation is dependent upon fullyobservable factors. Representation is discu...
Paul A. Ardis, Christopher M. Brown