845 search results - page 67 / 169 » Diagnosabilities of regular networks |
113
click to vote
UAI
2008
15 years 1 months ago
2008
Gaussian Markov random fields (GMRFs) are useful in a broad range of applications. In this paper we tackle the problem of learning a sparse GMRF in a high-dimensional space. Our a...
109
click to vote
CAL
2004
14 years 11 months ago
2004
In this paper we present a methodology to design fault-tolerant routing algorithms for regular direct interconnection networks. It supports fully adaptive routing, does not degrade...
ML
2007
ACM
14 years 11 months ago
2007
ACM
In this paper, we continue our study of learning an optimal kernel in a prescribed convex set of kernels, [18]. We present a reformulation of this problem within a feature space e...
105
click to vote
MP
2011
14 years 2 months ago
2011
Using variational analysis techniques, we study convex-composite optimization problems. In connection with such a problem, we introduce several new notions as variances of the clas...
MP
2011
14 years 2 months ago
2011
Abstract. Using the least element solution of the P0 and Z matrix linear complementarity problem (LCP), we define an implicit solution function for linear complementarity constrai...