Sciweavers

240 search results - page 20 / 48
» Efficient Variants of the Backward-Oracle-Matching Algorithm
Sort
View
JMLR
2010
165views more  JMLR 2010»
13 years 3 months ago
Learning with Blocks: Composite Likelihood and Contrastive Divergence
Composite likelihood methods provide a wide spectrum of computationally efficient techniques for statistical tasks such as parameter estimation and model selection. In this paper,...
Arthur Asuncion, Qiang Liu, Alexander T. Ihler, Pa...
TPDS
2010
126views more  TPDS 2010»
13 years 3 months ago
Stabilizing Distributed R-Trees for Peer-to-Peer Content Routing
Publish/subscribe systems provide useful platforms for delivering data (events) from publishers to subscribers in a decoupled fashion. Developing efficient publish/subscribe scheme...
Silvia Bianchi, Pascal Felber, Maria Gradinariu Po...
ICML
2010
IEEE
13 years 9 months ago
Simple and Efficient Multiple Kernel Learning by Group Lasso
We consider the problem of how to improve the efficiency of Multiple Kernel Learning (MKL). In literature, MKL is often solved by an alternating approach: (1) the minimization of ...
Zenglin Xu, Rong Jin, Haiqin Yang, Irwin King, Mic...
JMLR
2006
93views more  JMLR 2006»
13 years 8 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
SIAMCOMP
2008
108views more  SIAMCOMP 2008»
13 years 8 months ago
A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
Fabrizio Grandoni, Jochen Könemann, Alessandr...