Sciweavers

34170 search results - page 6133 / 6834
» Optimization
Sort
View
JMLR
2010
125views more  JMLR 2010»
15 years 2 months ago
Maximum Likelihood in Cost-Sensitive Learning: Model Specification, Approximations, and Upper Bounds
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 ...
Jacek P. Dmochowski, Paul Sajda, Lucas C. Parra
JMLR
2010
134views more  JMLR 2010»
15 years 2 months ago
Half Transductive Ranking
We study the standard retrieval task of ranking a fixed set of items given a previously unseen query and pose it as the half transductive ranking problem. The task is transductive...
Bing Bai, Jason Weston, David Grangier, Ronan Coll...
JMLR
2010
149views more  JMLR 2010»
15 years 2 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
JSAT
2010
132views more  JSAT 2010»
15 years 2 months ago
The Impact of Max-SAT Resolution-Based Preprocessors on Local Search Solvers
In this paper we analyze three well-known preprocessors for Max-SAT. The first preprocessor is based on the so-called variable saturation. The second preprocessor is based on the ...
Federico Heras, David Bañeres
JSCIC
2010
101views more  JSCIC 2010»
15 years 2 months ago
Boundary-Conforming Discontinuous Galerkin Methods via Extensions from Subdomains
A new way of devising numerical methods is introduced whose distinctive feature is the computation of a finite element approximation only in a polyhedral subdomain D of the origina...
Bernardo Cockburn, Deepa Gupta, Fernando Reitich
« Prev « First page 6133 / 6834 Last » Next »