Sciweavers

14165 search results - page 464 / 2833
» The generalized two-server problem
Sort
View
UAI
2008
15 years 8 months ago
Projected Subgradient Methods for Learning Sparse Gaussians
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...
John Duchi, Stephen Gould, Daphne Koller
CATS
2006
15 years 8 months ago
Graph Orientation Algorithms to Minimize the Maximum Outdegree
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei ...
DLOG
2006
15 years 8 months ago
Discrete Tableau Algorithms for FSHI
A variety of fuzzy description logics are proposed to extend classical description logics with fuzzy capability. However, reasoning with general TBoxes is still an open problem in...
Yanhui Li, Baowen Xu, Jianjiang Lu, Dazhou Kang
CORR
2010
Springer
165views Education» more  CORR 2010»
15 years 7 months ago
Online Learning: Beyond Regret
We study online learnability of a wide class of problems, extending the results of [26] to general notions of performance measure well beyond external regret. Our framework simult...
Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari
JSAC
2006
88views more  JSAC 2006»
15 years 6 months ago
OSNR optimization in optical networks: modeling and distributed algorithms via a central cost approach
Abstract-- This paper addresses the problem of optical signalto-noise ratio (OSNR) optimization in optical networks. An analytical OSNR network model is developed for a general mul...
L. Pavel