10901 search results - page 360 / 2181 » Approximations in Distributed Optimization |
241
click to vote
COMBINATORICA
2010
15 years 1 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
204
click to vote
JMLR
2010
2010
Maximum Likelihood in Cost-Sensitive Learning: Model Specification, Approximations, and Upper Bounds
15 years 1 months ago
The presence of asymmetry in the misclassification costs or class prevalences is a common occurrence in the pattern classification domain. While much interest has been devoted to ...
190
click to vote
TON
2012
13 years 9 months ago
2012
—Society relies heavily on its networked physical infrastructure and information systems. Accurately assessing the vulnerability of these systems against disruptive events is vit...
209
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
In this paper, we consider the problem of planning and learning in the infinite-horizon discounted-reward Markov decision problems. We propose a novel iterative direct policysearc...
184
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...