WIOPT
2010
IEEE
13 years 9 months ago
2010
IEEE
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...
MOC
2002
13 years 10 months ago
2002
Abstract. We analyze the convergence rate of an asynchronous space decomposition method for constrained convex minimization in a reflexive Banach space. This method includes as spe...
ML
2002
ACM
13 years 10 months ago
2002
ACM
The decomposition method is currently one of the major methods for solving support vector machines. An important issue of this method is the selection of working sets. In this pape...
MP
2008
13 years 11 months ago
2008
Abstract. We study piecewise decomposition methods for mathematical programs with equilibrium constraints (MPECs) for which all constraint functions are linear. At each iteration o...
JCSS
2008
13 years 11 months ago
2008
In this paper we derive a generic form of structural decomposition for the constraint satisfaction problem, which we call a guarded decomposition. We show that many existing decom...
GLVLSI
1999
IEEE
14 years 3 months ago
1999
IEEE
This paper presents a method for synthesizing lookup table (LUT) networks. The strategy employed by our method is very different from the strategies of previous methods; many deco...
AVBPA
2003
Springer
14 years 4 months ago
2003
Springer
Abstract. In face recognition, a simple classifier such as NNk − is frequently used. For a robust system, it is common to construct the multiclass classifier by combining the out...
CVPR
2010
IEEE
14 years 7 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...