14158 search results - page 350 / 2832 » Generalized switch-setting problems |
165
click to vote
INFOCOM
2011
IEEE
14 years 8 months ago
2011
IEEE
—We consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical problem in distri...
154
click to vote
AAAI
2011
14 years 4 months ago
2011
Automated feature discovery is a fundamental problem in machine learning. Although classical feature discovery methods do not guarantee optimal solutions in general, it has been r...
184
click to vote
JMLR
2012
13 years 7 months ago
2012
An important form of prior information in clustering comes in form of cannot-link and must-link constraints. We present a generalization of the popular spectral clustering techniq...
161
click to vote
TALG
2010
14 years 11 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
119
click to vote
DM
1998
15 years 4 months ago
1998
The problem of the existence of an alternating simple dicycle in a 2-arc-coloured digraph is considered. This is a generalization of the alternating cycle problem in 2-edgecoloure...