4377 search results - page 307 / 876 » Mass problems and randomness |
177
click to vote
COMBINATORICA
2007
15 years 6 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
202
click to vote
JMLR
2010
15 years 5 months ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
197
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This work considers the independent component analysis (ICA) of quaternion random vectors. In particular, we focus on the Gaussian case, and therefore the ICA problem is solved by...
179
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Typical approaches to multi-label classification problem require learning an independent classifier for every label from all the examples and features. This can become a computati...
177
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
We address privacy-preserving classification problem in a distributed system. Randomization has been the approach proposed to preserve privacy in such scenario. However, this appr...