1480 search results - page 93 / 296 » Distributed algorithms for weighted problems in sparse graph... |
CISS
2008
IEEE
14 years 5 months ago
2008
IEEE
Motivated to design a feasible optical network architecture for the future Internet, we address the question of scheduling (wavelength assignment) in an optical network. The key ch...
PODC
2006
ACM
14 years 4 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
MST
2010
13 years 9 months ago
2010
We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted...
ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
Graphical models are useful for capturing interdependencies of statistical variables in various fields. Estimating parameters describing sparse graphical models of stationary mul...
JMLR
2010
13 years 5 months ago
2010
We derive PAC-Bayesian generalization bounds for supervised and unsupervised learning models based on clustering, such as co-clustering, matrix tri-factorization, graphical models...