Sciweavers

4112 search results - page 364 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
175
Voted
ICML
2010
IEEE
15 years 8 months ago
Multi-Task Learning of Gaussian Graphical Models
We present multi-task structure learning for Gaussian graphical models. We discuss uniqueness and boundedness of the optimal solution of the maximization problem. A block coordina...
Jean Honorio, Dimitris Samaras
DAM
2002
135views more  DAM 2002»
15 years 7 months ago
Matchings in colored bipartite networks
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
Tongnyoul Yi, Katta G. Murty, Cosimo Spera
DCC
2008
IEEE
16 years 7 months ago
Server Placement in Multiple-Description-Based Media Streaming
Multiple description coding (MDC) has emerged as a powerful technique for reliable real-time communications over lossy packet networks. In its basic form, it involves encoding a me...
Satyajeet Ahuja, Marwan Krunz
IEAAIE
1998
Springer
15 years 11 months ago
Generating Heuristics to Control Configuration Processes
Abstract. Configuration is the process of composing a system from a set of components such that the system fulfills a set of desired demands. The configuration process relies on a ...
Benno Stein
UAI
2004
15 years 9 months ago
PAC-learning Bounded Tree-width Graphical Models
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
Mukund Narasimhan, Jeff A. Bilmes